pddbsv.f Solves a general band system of linear equations AX=B (no pivoting). pddtsv.f Solves a general tridiagonal system of linear equations AX=B (no pivoting). pdgbsv.f Solves a general banded system of linear equations AX=B. pdgels.f Solves overdetermined or underdetermined linear systems involving a matrix of full rank. pdgesv.f Solves a general system of linear equations AX=B. pdgesvd.f Computes the singular value decomposition of a general matrix, optionally computing the left and/or right singular vectors. pdpbsv.f Solves a symmetric positive definite banded system of linear equations AX=B. pdposv.f Solves a symmetric positive definite system of linear equations AX=B. pdptsv.f Solves a symmetric positive definite tridiagonal system of linear equations AX=B. pdsyev.f Computes selected eigenvalues and eigenvectors of a symmetric matrix. pdsyevd.f Computes all eigenvalues, and optionally, eigenvectors of a real symmetric matrix. If eigenvectors are desired, it uses a divide and conquer algorithm.

pdgesvx.f Solves a general system of linear equations AX=B. pdposvx.f Solves a symmetric positive definite system of linear equations AX=B. pdsyevx.f Computes selected eigenvalues and eigenvectors of a symmetric matrix. pdsygvx.f Computes selected eigenvalues and eigenvectors of a real generalized symmetric-definite eigenproblem.

pddbtrf.f Computes an LU factorization of a general band matrix with no pivoting. pddbtrs.f Solves a general band system of linear equations AX=B, A**T X=B or A**H X=B, using the LU factorization computed by PDDBTRF. pddbtrsv.f pddttrf.f Computes an LU factorization of a general tridiagonal matrix with no pivoting. pddttrs.f Solves a general tridiagonal system of linear equations AX=B, A**T X=B or A**H X=B, using the LU factorization computed by PDDTTRF. pddttrsv.f pdgbtrf.f Computes an LU factorization of a general band matrix, using partial pivoting with row interchanges. pdgbtrs.f Solves a general band system of linear equations AX=B, A**T X=B or A**H X=B, using the LU factorization computed by PDGBTRF. pdgebrd.f Reduces a general rectangular matrix to real bidiagonal form by an orthogonal transformation. pdgecon.f Estimates the reciprocal of the condition number of a general matrix pdgeequ.f Computes row and column scalings to equilibrate a general rectangular matrix and reduce its condition number. pdgehrd.f Reduces a general matrix to upper Hessenberg form by an orthogonal similarity transformation. pdgelqf.f Computes an LQ factorization of a general rectangular matrix. pdgeqlf.f Computes a QL factorization of a general rectangular matrix. pdgeqpf.f Computes a QR factorization with column pivoting of a general rectangular matrix. pdgeqrf.f Computes a QR factorization of a general rectangular matrix. pdgerfs.f Improves the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions. pdgerqf.f Computes an RQ factorization of a general rectangular matrix. pdgetrf.f Computes an LU factorization of a general matrix, using partial pivoting with row interchanges. pdgetri.f Computes the inverse of a general matrix, using the LU factorization computed by PDGETRF. pdgetrs.f Solves a general system of linear equations AX=B, A**T X=B or A**H X=B, using the LU factorization computed by PDGETRF. pdggqrf.f Computes a generalized QR factorization. pdggrqf.f Computes a generalized RQ factorization. pdlahqr.f Computes the Schur decomposition and/or eigenvalues of a matrix already in Hessenberg form. pdorglq.f Generates all or part of the orthogonal matrix Q from an LQ factorization determined by PDGELQF. pdorgql.f Generates all or part of the orthogonal matrix Q from a QL factorization determined by PDGEQLF. pdorgqr.f Generates all or part of the orthogonal matrix Q from a QR factorization determined by PDGEQRF. pdorgrq.f Generates all or part of the orthogonal matrix Q from an RQ factorization determined by PDGERQF. pdormbr.f Multiplies a general matrix by one of the orthogonal transformation matrices from a reduction to bidiagonal form determined by PDGEBRD. pdormhr.f Multiplies a general matrix by the orthogonal transformation matrix from a reduction to Hessenberg form determined by PDGEHRD. pdormlq.f Multiplies a general matrix by the orthogonal matrix from an LQ factorization determined by PDGELQF. pdormql.f Multiplies a general matrix by the orthogonal matrix from a QL factorization determined by PDGEQLF. pdormqr.f Multiplies a general matrix by the orthogonal matrix from a QR factorization determined by PDGEQRF. pdormrq.f Multiplies a general matrix by the orthogonal matrix from an RQ factorization determined by PDGERQF. pdormrz.f Multiplies a general matrix by the orthogonal transformation matrix from a reduction to upper triangular form determined by PDTZRZF. pdormtr.f Multiplies a general matrix by the orthogonal transformation matrix from a reduction to tridiagonal form determined by PDSYTRD. pdpbtrf.f Computes the Cholesky factorization of a symmetric positive definite banded matrix. pdpbtrs.f Solves a symmetric positive definite banded system of linear equations AX=B, using the Cholesky factorization computed by PDPBTRF. pdpbtrsv.f pdpocon.f Estimates the reciprocal of the condition number of a symmetric positive definite distributed matrix. pdpoequ.f Computes row and column scalings to equilibrate a symmetric positive definite matrix and reduce its condition number. pdporfs.f Improves the computed solution to a symmetric positive definite system of linear equations AX=B, and provides forward and backward error bounds for the solution. pdpotrf.f Computes the Cholesky factorization of a symmetric positive definite matrix. pdpotri.f Computes the inverse of a symmetric positive definite matrix, using the Cholesky factorization computed by PDPOTRF. pdpotrs.f Solves a symmetric positive definite system of linear equations AX=B, using the Cholesky factorization computed by PDPOTRF. pdpttrf.f Computes the Cholesky factorization of a symmetric positive definite tridiagonal matrix. pdpttrs.f Solves a symmetric positive definite tridiagonal system of linear equations AX=B, using the Cholesky factorization computed by PDPTTRF. pdpttrsv.f pdstebz.f Computes the eigenvalues of a symmetric tridiagonal matrix by bisection. pdstedc.f Computes all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer algorithm. pdstein.f Computes the eigenvectors of a symmetric tridiagonal matrix using inverse iteration. pdsygst.f Reduces a symmetric-definite generalized eigenproblem to standard form. pdsytrd.f Reduces a symmetric matrix to real symmetric tridiagonal form by an orthogonal similarity transformation. pdtrcon.f Estimates the reciprocal of the condition number of a triangular matrix. pdtrrfs.f Provides error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix. pdtrtri.f Computes the inverse of a triangular matrix. pdtrtrs.f Solves a triangular system of linear equations AX=B, A**T X=B or A**H X=B. pdtzrzf.f Reduces an upper trapezoidal matrix to upper triangular form by means of orthogonal transformations.