SIMPLE SOLUTIONS

Manual pages

Origin: LAPACK version 1.5.

[ Alias ↣ ] Name (section) Brief
dlamsh(3) Send multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal.
dlaref(3) Applie one or several Householder reflectors of size 3 to one or two matrices (if column is speci‐.
dlasorte(3) Sort eigenpairs so that real eigenpairs are together and complex are together.
dlasrt2(3) The numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ).
dstein2(3) Compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigen‐.
pcdbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcdbtrf(3) Compute a LU factorization of an N-by-N complex banded diagonally dominant-like distributed matrix.
pcdbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcdbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcdtsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcdttrf(3) Compute a LU factorization of an N-by-N complex tridiagonal diagonally dominant-like distributed.
pcdttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcdttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
pcgbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcgbtrf(3) Compute a LU factorization of an N-by-N complex banded distributed matrix with bandwidth BWL, BWU.
pcgbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcgebd2(3) Reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or.
pcgebrd(3) Reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or.
pcgecon(3) Estimate the reciprocal of the condition number of a general distributed complex matrix.
pcgeequ(3) Compute row and column scalings intended to equilibrate an M-by-N distributed matrix sub( A ) =.
pcgehd2(3) Reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary simi‐.
pcgehrd(3) Reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary simi‐.
pcgelq2(3) Compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgelqf(3) Compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgels(3) Solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix sub( A ) =.
pcgeql2(3) Compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgeqlf(3) Compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgeqpf(3) Compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) =.
pcgeqr2(3) Compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgeqrf(3) Compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgerfs(3) Improve the computed solution to a system of linear equations and provides error bounds and backward.
pcgerq2(3) Compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgerqf(3) Compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgesv(3) Compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),.
pcgesvx(3) Use the LU factorization to compute the solution to a complex system of linear equations.
pcgetf2(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcgetrf(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1).
pcgetri(3) Compute the inverse of a distributed matrix using the LU factorization computed by PCGETRF.
pcgetrs(3) Solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-.
pcggqrf(3) Compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an.
pcggrqf(3) Compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pcheevx(3) Compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by call‐.
pchegs2(3) Reduce a complex Hermitian-definite generalized eigenproblem to standard form.
pchegst(3) Reduce a complex Hermitian-definite generalized eigenproblem to standard form.
pchegvx(3) Compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-.
pchetd2(3) Reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity.
pchetrd(3) Reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity.
pclabrd(3) Reduce the first NB rows and columns of a complex general M-by-N distributed matrix sub( A ) =.
pclacgv(3) Conjugate a complex vector of length N, sub( X ), where sub( X ) denotes X(IX,JX:JX+N-1) if INCX =.
pclacon(3) Estimate the 1-norm of a square, complex distributed matrix A.
pclacp2(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pclacpy(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pclaevswp(3) Move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard.
pclahrd(3) Reduce the first NB columns of a complex general N-by-(N-K+1) distributed matrix.
pclange(3) Return the value of the one norm, or the Frobenius norm,.
pclanhe(3) Return the value of the one norm, or the Frobenius norm,.
pclanhs(3) Return the value of the one norm, or the Frobenius norm,.
pclansy(3) Return the value of the one norm, or the Frobenius norm,.
pclantr(3) Return the value of the one norm, or the Frobenius norm,.
pclapiv(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed.
pclapv2(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix.
pclaqge(3) Equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and.
pclaqsy(3) Equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling fac‐.
pclarf(3) Applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) =.
pclarfb(3) Applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed.
pclarfc(3) Applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) =.
pclarfg(3) Generate a complex elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ).
pclarft(3) Form the triangular factor T of a complex block reflector H of order n, which is defined as a prod‐.
pclarz(3) Applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) =.
pclarzb(3) Applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed.
pclarzc(3) Applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) =.
pclarzt(3) Form the triangular factor T of a complex block reflector H of order > n, which is defined as a.
pclascl(3) Multiplie the M-by-N complex distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real.
pclase2(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pclaset(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pclassq(3) Return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2.
pclaswp(3) Perform a series of row or column interchanges on the distributed matrix sub( A ) =.
pclatra(3) Compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 ).
pclatrd(3) Reduce NB rows and columns of a complex Hermitian distributed matrix sub( A ) =.
pclatrs(3) Solve a triangular system.
pclatrz(3) Reduce the M-by-N ( M.
pclauu2(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pclauum(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pcmax1(3) Compute the global index of the maximum element in absolute value of a distributed vector sub( X ).
pcpbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcpbtrf(3) Compute a Cholesky factorization of an N-by-N complex banded symmetric positive definite distributed.
pcpbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcpbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcpocon(3) Estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive def‐.
pcpoequ(3) Compute row and column scalings intended to equilibrate a distributed Hermitian positive definite.
pcporfs(3) Improve the computed solution to a system of linear equations when the coefficient matrix is Hermit‐.
pcposv(3) Compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),.
pcposvx(3) Use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system.
pcpotf2(3) Compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub(.
pcpotrf(3) Compute the Cholesky factorization of an N-by-N complex hermitian positive definite distributed.
pcpotri(3) Compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) =.
pcpotrs(3) Solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X =.
pcptsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcpttrf(3) Compute a Cholesky factorization of an N-by-N complex tridiagonal symmetric positive definite dis‐.
pcpttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pcpttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
pcsrscl(3) Multiplie an N-element complex distributed vector sub( X ) by the real scalar 1/a.
pcstein(3) Compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration.
pctrcon(3) Estimate the reciprocal of the condition number of a triangular distributed matrix.
pctrrfs(3) Provide error bounds and backward error estimates for the solution to a system of linear equations.
pctrti2(3) Compute the inverse of a complex upper or lower triangular block matrix sub( A ) =.
pctrtri(3) Compute the inverse of a upper or lower triangular distributed matrix sub( A ) =.
pctrtrs(3) Solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ) or.
pctzrzf(3) Reduce the M-by-N ( M.
pcung2l(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcung2r(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcungl2(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcunglq(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcungql(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcungqr(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcungr2(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcungrq(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pcunm2l(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunm2r(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmbr(3) VECT = 'Q', PCUNMBR overwrites the general complex distributed M-by-N matrix sub( C ) =.
pcunmhr(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunml2(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmlq(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmql(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmqr(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmr2(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmr3(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmrq(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmrz(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pcunmtr(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pddbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pddbtrf(3) Compute a LU factorization of an N-by-N real banded diagonally dominant-like distributed matrix with.
pddbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pddbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pddtsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pddttrf(3) Compute a LU factorization of an N-by-N real tridiagonal diagonally dominant-like distributed matrix.
pddttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pddttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
pdgbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pdgbtrf(3) Compute a LU factorization of an N-by-N real banded distributed matrix with bandwidth BWL, BWU.
pdgbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pdgebd2(3) Reduce a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower.
pdgebrd(3) Reduce a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower.
pdgecon(3) Estimate the reciprocal of the condition number of a general distributed real matrix.
pdgeequ(3) Compute row and column scalings intended to equilibrate an M-by-N distributed matrix sub( A ) =.
pdgehd2(3) Reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal simi‐.
pdgehrd(3) Reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal simi‐.
pdgelq2(3) Compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L.
pdgelqf(3) Compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L.
pdgels(3) Solve overdetermined or underdetermined real linear systems involving an M-by-N matrix sub( A ) =.
pdgeql2(3) Compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
pdgeqlf(3) Compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
pdgeqpf(3) Compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) =.
pdgeqr2(3) Compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
pdgeqrf(3) Compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
pdgerfs(3) Improve the computed solution to a system of linear equations and provides error bounds and backward.
pdgerq2(3) Compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R.
pdgerqf(3) Compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R.
pdgesv(3) Compute the solution to a real system of linear equations sub( A ) * X = sub( B ),.
pdgesvd(3) Compute the singular value decomposition (SVD) of an M-by-N matrix A, optionally computing the left.
pdgesvx(3) Use the LU factorization to compute the solution to a real system of linear equations.
pdgetf2(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pdgetrf(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1).
pdgetri(3) Compute the inverse of a distributed matrix using the LU factorization computed by PDGETRF.
pdgetrs(3) Solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-.
pdggqrf(3) Compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an.
pdggrqf(3) Compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pdlabad(3) Take as input the values computed by PDLAMCH for underflow and overflow, and returns the square root.
pdlabrd(3) Reduce the first NB rows and columns of a real general M-by-N distributed matrix sub( A ) =.
pdlacon(3) Estimate the 1-norm of a square, real distributed matrix A.
pdlaconsb(3) Look for two consecutive small subdiagonal elements by seeing the effect of starting a double.
pdlacp2(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pdlacp3(3) I an auxiliary routine that copies from a global parallel array into a local replicated array or.
pdlacpy(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pdlaevswp(3) Move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard.
pdlahqr(3) I an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already.
pdlahrd(3) Reduce the first NB columns of a real general N-by-(N-K+1) distributed matrix A(IA:IA+N-1,JA:JA+N-K).
pdlamch(3) Determine double precision machine parameters.
pdlange(3) Return the value of the one norm, or the Frobenius norm,.
pdlanhs(3) Return the value of the one norm, or the Frobenius norm,.
pdlansy(3) Return the value of the one norm, or the Frobenius norm,.
pdlantr(3) Return the value of the one norm, or the Frobenius norm,.
pdlapiv(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed.
pdlapv2(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix.
pdlaqge(3) Equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and.
pdlaqsy(3) Equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling fac‐.
pdlared1d(3) Redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and.
pdlared2d(3) Redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and.
pdlarf(3) Applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) =.
pdlarfb(3) Applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) =.
pdlarfg(3) Generate a real elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = (.
pdlarft(3) Form the triangular factor T of a real block reflector H of order n, which is defined as a product.
pdlarz(3) Applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) =.
pdlarzb(3) Applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) =.
pdlarzt(3) Form the triangular factor T of a real block reflector H of order > n, which is defined as a product.
pdlascl(3) Multiplie the M-by-N real distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real.
pdlase2(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pdlaset(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pdlasmsub(3) Look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero.
pdlassq(3) Return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2.
pdlaswp(3) Perform a series of row or column interchanges on the distributed matrix sub( A ) =.
pdlatra(3) Compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 ).
pdlatrd(3) Reduce NB rows and columns of a real symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1).
pdlatrs(3) Solve a triangular system.
pdlatrz(3) Reduce the M-by-N ( M.
pdlauu2(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pdlauum(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pdlawil(3) Get the transform given by H44,H33, & H43H34 into V starting at row M.
pdorg2l(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
pdorg2r(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
pdorgl2(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
pdorglq(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
pdorgql(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
pdorgqr(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
pdorgr2(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
pdorgrq(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
pdorm2l(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdorm2r(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormbr(3) VECT = 'Q', PDORMBR overwrites the general real distributed M-by-N matrix sub( C ) =.
pdormhr(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdorml2(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormlq(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormql(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormqr(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormr2(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormr3(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormrq(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormrz(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdormtr(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pdpbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pdpbtrf(3) Compute a Cholesky factorization of an N-by-N real banded symmetric positive definite distributed.
pdpbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pdpbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pdpocon(3) Estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive defi‐.
pdpoequ(3) Compute row and column scalings intended to equilibrate a distributed symmetric positive definite.
pdporfs(3) Improve the computed solution to a system of linear equations when the coefficient matrix is symmet‐.
pdposv(3) Compute the solution to a real system of linear equations sub( A ) * X = sub( B ),.
pdposvx(3) Use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of.
pdpotf2(3) Compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A.
pdpotrf(3) Compute the Cholesky factorization of an N-by-N real symmetric positive definite distributed matrix.
pdpotri(3) Compute the inverse of a real symmetric positive definite distributed matrix sub( A ) =.
pdpotrs(3) Solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X =.
pdptsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pdpttrf(3) Compute a Cholesky factorization of an N-by-N real tridiagonal symmetric positive definite distrib‐.
pdpttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pdpttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
pdrscl(3) Multiplie an N-element real distributed vector sub( X ) by the real scalar 1/a.
pdstebz(3) Compute the eigenvalues of a symmetric tridiagonal matrix in parallel.
pdstein(3) Compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration.
pdsyevx(3) Compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling.
pdsygs2(3) Reduce a real symmetric-definite generalized eigenproblem to standard form.
pdsygst(3) Reduce a real symmetric-definite generalized eigenproblem to standard form.
pdsygvx(3) Compute all the eigenvalues, and optionally, the eigenvectors of a real generalized SY-definite.
pdsytd2(3) Reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity.
pdsytrd(3) Reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity.
pdtrcon(3) Estimate the reciprocal of the condition number of a triangular distributed matrix.
pdtrrfs(3) Provide error bounds and backward error estimates for the solution to a system of linear equations.
pdtrti2(3) Compute the inverse of a real upper or lower triangular block matrix sub( A ) =.
pdtrtri(3) Compute the inverse of a upper or lower triangular distributed matrix sub( A ) =.
pdtrtrs(3) Solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ),.
pdtzrzf(3) Reduce the M-by-N ( M.
pdzsum1(3) Return the sum of absolute values of a complex distributed vector sub( X ) in ASUM,.
pscsum1(3) Return the sum of absolute values of a complex distributed vector sub( X ) in ASUM,.
psdbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
psdbtrf(3) Compute a LU factorization of an N-by-N real banded diagonally dominant-like distributed matrix with.
psdbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
psdbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
psdtsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
psdttrf(3) Compute a LU factorization of an N-by-N real tridiagonal diagonally dominant-like distributed matrix.
psdttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
psdttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
psgbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
psgbtrf(3) Compute a LU factorization of an N-by-N real banded distributed matrix with bandwidth BWL, BWU.
psgbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
psgebd2(3) Reduce a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower.
psgebrd(3) Reduce a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower.
psgecon(3) Estimate the reciprocal of the condition number of a general distributed real matrix.
psgeequ(3) Compute row and column scalings intended to equilibrate an M-by-N distributed matrix sub( A ) =.
psgehd2(3) Reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal simi‐.
psgehrd(3) Reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal simi‐.
psgelq2(3) Compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L.
psgelqf(3) Compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L.
psgels(3) Solve overdetermined or underdetermined real linear systems involving an M-by-N matrix sub( A ) =.
psgeql2(3) Compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
psgeqlf(3) Compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
psgeqpf(3) Compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) =.
psgeqr2(3) Compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
psgeqrf(3) Compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q.
psgerfs(3) Improve the computed solution to a system of linear equations and provides error bounds and backward.
psgerq2(3) Compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R.
psgerqf(3) Compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R.
psgesv(3) Compute the solution to a real system of linear equations sub( A ) * X = sub( B ),.
psgesvd(3) Compute the singular value decomposition (SVD) of an M-by-N matrix A, optionally computing the left.
psgesvx(3) Use the LU factorization to compute the solution to a real system of linear equations.
psgetf2(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
psgetrf(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1).
psgetri(3) Compute the inverse of a distributed matrix using the LU factorization computed by PSGETRF.
psgetrs(3) Solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-.
psggqrf(3) Compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an.
psggrqf(3) Compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pslabad(3) Take as input the values computed by PSLAMCH for underflow and overflow, and returns the square root.
pslabrd(3) Reduce the first NB rows and columns of a real general M-by-N distributed matrix sub( A ) =.
pslacon(3) Estimate the 1-norm of a square, real distributed matrix A.
pslaconsb(3) Look for two consecutive small subdiagonal elements by seeing the effect of starting a double.
pslacp2(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pslacp3(3) I an auxiliary routine that copies from a global parallel array into a local replicated array or.
pslacpy(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pslaevswp(3) Move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard.
pslahqr(3) I an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already.
pslahrd(3) Reduce the first NB columns of a real general N-by-(N-K+1) distributed matrix A(IA:IA+N-1,JA:JA+N-K).
pslamch(3) Determine single precision machine parameters.
pslange(3) Return the value of the one norm, or the Frobenius norm,.
pslanhs(3) Return the value of the one norm, or the Frobenius norm,.
pslansy(3) Return the value of the one norm, or the Frobenius norm,.
pslantr(3) Return the value of the one norm, or the Frobenius norm,.
pslapiv(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed.
pslapv2(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix.
pslaqge(3) Equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and.
pslaqsy(3) Equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling fac‐.
pslared1d(3) Redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and.
pslared2d(3) Redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and.
pslarf(3) Applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) =.
pslarfb(3) Applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) =.
pslarfg(3) Generate a real elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = (.
pslarft(3) Form the triangular factor T of a real block reflector H of order n, which is defined as a product.
pslarz(3) Applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) =.
pslarzb(3) Applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) =.
pslarzt(3) Form the triangular factor T of a real block reflector H of order > n, which is defined as a product.
pslascl(3) Multiplie the M-by-N real distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real.
pslase2(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pslaset(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pslasmsub(3) Look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero.
pslassq(3) Return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2.
pslaswp(3) Perform a series of row or column interchanges on the distributed matrix sub( A ) =.
pslatra(3) Compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 ).
pslatrd(3) Reduce NB rows and columns of a real symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1).
pslatrs(3) Solve a triangular system.
pslatrz(3) Reduce the M-by-N ( M.
pslauu2(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pslauum(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pslawil(3) Get the transform given by H44,H33, & H43H34 into V starting at row M.
psorg2l(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
psorg2r(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
psorgl2(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
psorglq(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
psorgql(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
psorgqr(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal col‐.
psorgr2(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
psorgrq(3) Generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows,.
psorm2l(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psorm2r(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormbr(3) VECT = 'Q', PSORMBR overwrites the general real distributed M-by-N matrix sub( C ) =.
psormhr(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psorml2(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormlq(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormql(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormqr(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormr2(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormr3(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormrq(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormrz(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
psormtr(3) Overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE =.
pspbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pspbtrf(3) Compute a Cholesky factorization of an N-by-N real banded symmetric positive definite distributed.
pspbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pspbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pspocon(3) Estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive defi‐.
pspoequ(3) Compute row and column scalings intended to equilibrate a distributed symmetric positive definite.
psporfs(3) Improve the computed solution to a system of linear equations when the coefficient matrix is symmet‐.
psposv(3) Compute the solution to a real system of linear equations sub( A ) * X = sub( B ),.
psposvx(3) Use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of.
pspotf2(3) Compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A.
pspotrf(3) Compute the Cholesky factorization of an N-by-N real symmetric positive definite distributed matrix.
pspotri(3) Compute the inverse of a real symmetric positive definite distributed matrix sub( A ) =.
pspotrs(3) Solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X =.
psptsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pspttrf(3) Compute a Cholesky factorization of an N-by-N real tridiagonal symmetric positive definite distrib‐.
pspttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pspttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
psrscl(3) Multiplie an N-element real distributed vector sub( X ) by the real scalar 1/a.
psstebz(3) Compute the eigenvalues of a symmetric tridiagonal matrix in parallel.
psstein(3) Compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration.
pssyevx(3) Compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling.
pssygs2(3) Reduce a real symmetric-definite generalized eigenproblem to standard form.
pssygst(3) Reduce a real symmetric-definite generalized eigenproblem to standard form.
pssygvx(3) Compute all the eigenvalues, and optionally, the eigenvectors of a real generalized SY-definite.
pssytd2(3) Reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity.
pssytrd(3) Reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity.
pstrcon(3) Estimate the reciprocal of the condition number of a triangular distributed matrix.
pstrrfs(3) Provide error bounds and backward error estimates for the solution to a system of linear equations.
pstrti2(3) Compute the inverse of a real upper or lower triangular block matrix sub( A ) =.
pstrtri(3) Compute the inverse of a upper or lower triangular distributed matrix sub( A ) =.
pstrtrs(3) Solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ),.
pstzrzf(3) Reduce the M-by-N ( M.
pzdbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzdbtrf(3) Compute a LU factorization of an N-by-N complex banded diagonally dominant-like distributed matrix.
pzdbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzdbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzdrscl(3) Multiplie an N-element complex distributed vector sub( X ) by the real scalar 1/a.
pzdtsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzdttrf(3) Compute a LU factorization of an N-by-N complex tridiagonal diagonally dominant-like distributed.
pzdttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzdttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
pzgbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzgbtrf(3) Compute a LU factorization of an N-by-N complex banded distributed matrix with bandwidth BWL, BWU.
pzgbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzgebd2(3) Reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or.
pzgebrd(3) Reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or.
pzgecon(3) Estimate the reciprocal of the condition number of a general distributed complex matrix.
pzgeequ(3) Compute row and column scalings intended to equilibrate an M-by-N distributed matrix sub( A ) =.
pzgehd2(3) Reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary simi‐.
pzgehrd(3) Reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary simi‐.
pzgelq2(3) Compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgelqf(3) Compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgels(3) Solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix sub( A ) =.
pzgeql2(3) Compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgeqlf(3) Compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgeqpf(3) Compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) =.
pzgeqr2(3) Compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgeqrf(3) Compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgerfs(3) Improve the computed solution to a system of linear equations and provides error bounds and backward.
pzgerq2(3) Compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgerqf(3) Compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgesv(3) Compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),.
pzgesvx(3) Use the LU factorization to compute the solution to a complex system of linear equations.
pzgetf2(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzgetrf(3) Compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1).
pzgetri(3) Compute the inverse of a distributed matrix using the LU factorization computed by PZGETRF.
pzgetrs(3) Solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-.
pzggqrf(3) Compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an.
pzggrqf(3) Compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1).
pzheevx(3) Compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by call‐.
pzhegs2(3) Reduce a complex Hermitian-definite generalized eigenproblem to standard form.
pzhegst(3) Reduce a complex Hermitian-definite generalized eigenproblem to standard form.
pzhegvx(3) Compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-.
pzhetd2(3) Reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity.
pzhetrd(3) Reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity.
pzlabrd(3) Reduce the first NB rows and columns of a complex general M-by-N distributed matrix sub( A ) =.
pzlacgv(3) Conjugate a complex vector of length N, sub( X ), where sub( X ) denotes X(IX,JX:JX+N-1) if INCX =.
pzlacon(3) Estimate the 1-norm of a square, complex distributed matrix A.
pzlacp2(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pzlacpy(3) Copie all or part of a distributed matrix A to another distributed matrix B.
pzlaevswp(3) Move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard.
pzlahrd(3) Reduce the first NB columns of a complex general N-by-(N-K+1) distributed matrix.
pzlange(3) Return the value of the one norm, or the Frobenius norm,.
pzlanhe(3) Return the value of the one norm, or the Frobenius norm,.
pzlanhs(3) Return the value of the one norm, or the Frobenius norm,.
pzlansy(3) Return the value of the one norm, or the Frobenius norm,.
pzlantr(3) Return the value of the one norm, or the Frobenius norm,.
pzlapiv(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed.
pzlapv2(3) Applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix.
pzlaqge(3) Equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and.
pzlaqsy(3) Equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling fac‐.
pzlarf(3) Applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) =.
pzlarfb(3) Applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed.
pzlarfc(3) Applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) =.
pzlarfg(3) Generate a complex elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ).
pzlarft(3) Form the triangular factor T of a complex block reflector H of order n, which is defined as a prod‐.
pzlarz(3) Applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) =.
pzlarzb(3) Applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed.
pzlarzc(3) Applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) =.
pzlarzt(3) Form the triangular factor T of a complex block reflector H of order > n, which is defined as a.
pzlascl(3) Multiplie the M-by-N complex distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real.
pzlase2(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pzlaset(3) Initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the.
pzlassq(3) Return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2.
pzlaswp(3) Perform a series of row or column interchanges on the distributed matrix sub( A ) =.
pzlatra(3) Compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 ).
pzlatrd(3) Reduce NB rows and columns of a complex Hermitian distributed matrix sub( A ) =.
pzlatrs(3) Solve a triangular system.
pzlatrz(3) Reduce the M-by-N ( M.
pzlauu2(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pzlauum(3) Compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or.
pzmax1(3) Compute the global index of the maximum element in absolute value of a distributed vector sub( X ).
pzpbsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzpbtrf(3) Compute a Cholesky factorization of an N-by-N complex banded symmetric positive definite distributed.
pzpbtrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzpbtrsv(3) Solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzpocon(3) Estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive def‐.
pzpoequ(3) Compute row and column scalings intended to equilibrate a distributed Hermitian positive definite.
pzporfs(3) Improve the computed solution to a system of linear equations when the coefficient matrix is Hermit‐.
pzposv(3) Compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),.
pzposvx(3) Use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system.
pzpotf2(3) Compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub(.
pzpotrf(3) Compute the Cholesky factorization of an N-by-N complex hermitian positive definite distributed.
pzpotri(3) Compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) =.
pzpotrs(3) Solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X =.
pzptsv(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzpttrf(3) Compute a Cholesky factorization of an N-by-N complex tridiagonal symmetric positive definite dis‐.
pzpttrs(3) Solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS).
pzpttrsv(3) Solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,.
pzstein(3) Compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration.
pztrcon(3) Estimate the reciprocal of the condition number of a triangular distributed matrix.
pztrrfs(3) Provide error bounds and backward error estimates for the solution to a system of linear equations.
pztrti2(3) Compute the inverse of a complex upper or lower triangular block matrix sub( A ) =.
pztrtri(3) Compute the inverse of a upper or lower triangular distributed matrix sub( A ) =.
pztrtrs(3) Solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ) or.
pztzrzf(3) Reduce the M-by-N ( M.
pzung2l(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzung2r(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzungl2(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzunglq(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzungql(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzungqr(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzungr2(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzungrq(3) Generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal.
pzunm2l(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunm2r(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmbr(3) VECT = 'Q', PZUNMBR overwrites the general complex distributed M-by-N matrix sub( C ) =.
pzunmhr(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunml2(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmlq(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmql(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmqr(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmr2(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmr3(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmrq(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmrz(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
pzunmtr(3) Overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with.
slamsh(3) Send multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal.
slaref(3) Applie one or several Householder reflectors of size 3 to one or two matrices (if column is speci‐.
slasorte(3) Sort eigenpairs so that real eigenpairs are together and complex are together.
slasrt2(3) The numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ).
sstein2(3) Compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigen‐.