# Module scid.bindings.lapack.dlapack

LAPACK bindings for D.

## Functions

Name | Description |
---|---|

`bdsdc(uplo, compq, n, d, e, u, ldu, vt, ldvt, q, iq, work, iwork, info)` | Computes the singular value decomposition (SVD) of a real bidiagonal matrix, using a divide and conquer method. |

`bdsdc(uplo, compq, n, d, e, u, ldu, vt, ldvt, q, iq, work, iwork, info)` | |

`bdsqr(uplo, n, ncvt, nru, ncc, d, e, vt, ldvt, u, ldu, c, ldc, work, info)` | Computes the singular value decomposition (SVD) of a real bidiagonal matrix, using the bidiagonal QR algorithm. |

`bdsqr(uplo, n, ncvt, nru, ncc, d, e, vt, ldvt, u, ldu, c, ldc, work, info)` | |

`bdsqr(uplo, n, ncvt, nru, ncc, d, e, vt, ldvt, u, ldu, c, ldc, rwork, info)` | |

`bdsqr(uplo, n, ncvt, nru, ncc, d, e, vt, ldvt, u, ldu, c, ldc, rwork, info)` | |

`disna(job, m, n, d, sep, info)` | Computes the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general matrix. |

`disna(job, m, n, d, sep, info)` | |

`dlamch(cmach)` | |

`gbbrd(vect, m, n, ncc, kl, ku, ab, ldab, d, e, q, ldq, pt, ldpt, c, ldc, work, info)` | Reduces a general band matrix to real upper bidiagonal form by an orthogonal transformation. |

`gbbrd(vect, m, n, ncc, kl, ku, ab, ldab, d, e, q, ldq, pt, ldpt, c, ldc, work, info)` | |

`gbbrd(vect, m, n, ncc, kl, ku, ab, ldab, d, e, q, ldq, pt, ldpt, c, ldc, work, rwork, info)` | |

`gbbrd(vect, m, n, ncc, kl, ku, ab, ldab, d, e, q, ldq, pt, ldpt, c, ldc, work, rwork, info)` | |

`gbcon(norm, n, kl, ku, ab, ldab, ipiv, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a general band matrix, in either the 1-norm or the infinity-norm, using the LU factorization computed by SGBTRF. |

`gbcon(norm, n, kl, ku, ab, ldab, ipiv, anorm, rcond, work, iwork, info)` | |

`gbcon(norm, n, kl, ku, ab, ldab, ipiv, anorm, rcond, work, rwork, info)` | |

`gbcon(norm, n, kl, ku, ab, ldab, ipiv, anorm, rcond, work, rwork, info)` | |

`gbequ(m, n, kl, ku, ab, ldab, r, c, rowcnd, colcnd, amax, info)` | Computes row and column scalings to equilibrate a general band matrix and reduce its condition number. |

`gbequ(m, n, kl, ku, ab, ldab, r, c, rowcnd, colcnd, amax, info)` | |

`gbequ(m, n, kl, ku, ab, ldab, r, c, rowcnd, colcnd, amax, info)` | |

`gbequ(m, n, kl, ku, ab, ldab, r, c, rowcnd, colcnd, amax, info)` | |

`gbrfs(trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Improves the computed solution to a general banded system of linear equations AX=B, A**T X=B or A**H X=B, and provides forward and backward error bounds for the solution. |

`gbrfs(trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`gbrfs(trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`gbrfs(trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`gbsv(n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | Solves a general banded system of linear equations AX=B. |

`gbsv(n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | |

`gbsv(n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | |

`gbsv(n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | |

`gbsvx(fact, trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | Solves a general banded system of linear equations AX=B, A**T X=B or A**H X=B, and provides an estimate of the condition number and error bounds on the solution. |

`gbsvx(fact, trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | |

`gbsvx(fact, trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`gbsvx(fact, trans, n, kl, ku, nrhs, ab, ldab, afb, ldafb, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`gbtrf(m, n, kl, ku, ab, ldab, ipiv, info)` | Computes an LU factorization of a general band matrix, using partial pivoting with row interchanges. |

`gbtrf(m, n, kl, ku, ab, ldab, ipiv, info)` | |

`gbtrf(m, n, kl, ku, ab, ldab, ipiv, info)` | |

`gbtrf(m, n, kl, ku, ab, ldab, ipiv, info)` | |

`gbtrs(trans, n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | |

`gbtrs(trans, n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | |

`gbtrs(trans, n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | |

`gbtrs(trans, n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)` | Solves a general banded system of linear equations AX=B, A**T X=B or A**H X=B, using the LU factorization computed by SGBTRF. |

`gebak(job, side, n, ilo, ihi, scale, m, v, ldv, info)` | |

`gebak(job, side, n, ilo, ihi, scale, m, v, ldv, info)` | |

`gebak(job, side, n, ilo, ihi, scale, m, v, ldv, info)` | |

`gebak(job, side, n, ilo, ihi, scale, m, v, ldv, info)` | Transforms eigenvectors of a balanced matrix to those of the original matrix supplied to SGEBAL. |

`gebal(job, n, a, lda, ilo, ihi, scale, info)` | |

`gebal(job, n, a, lda, ilo, ihi, scale, info)` | |

`gebal(job, n, a, lda, ilo, ihi, scale, info)` | |

`gebal(job, n, a, lda, ilo, ihi, scale, info)` | Balances a general matrix in order to improve the accuracy of computed eigenvalues. |

`gebrd(m, n, a, lda, d, e, tauq, taup, work, lwork, info)` | |

`gebrd(m, n, a, lda, d, e, tauq, taup, work, lwork, info)` | |

`gebrd(m, n, a, lda, d, e, tauq, taup, work, lwork, info)` | |

`gebrd(m, n, a, lda, d, e, tauq, taup, work, lwork, info)` | Reduces a general rectangular matrix to real bidiagonal form by an orthogonal transformation. |

`gecon(norm, n, a, lda, anorm, rcond, work, rwork, info)` | |

`gecon(norm, n, a, lda, anorm, rcond, work, rwork, info)` | |

`gecon(norm, n, a, lda, anorm, rcond, work, iwork, info)` | |

`gecon(norm, n, a, lda, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a general matrix, in either the 1-norm or the infinity-norm, using the LU factorization computed by SGETRF. |

`geequ(m, n, a, lda, r, c, rowcnd, colcnd, amax, info)` | |

`geequ(m, n, a, lda, r, c, rowcnd, colcnd, amax, info)` | |

`geequ(m, n, a, lda, r, c, rowcnd, colcnd, amax, info)` | |

`geequ(m, n, a, lda, r, c, rowcnd, colcnd, amax, info)` | Computes row and column scalings to equilibrate a general rectangular matrix and reduce its condition number. |

`gees(jobvs, sort, select, n, a, lda, sdim, wr, wi, vs, ldvs, work, lwork, bwork, info)` | Computes the eigenvalues and Schur factorization of a general matrix, and orders the factorization so that selected eigenvalues are at the top left of the Schur form. |

`gees(jobvs, sort, select, n, a, lda, sdim, wr, wi, vs, ldvs, work, lwork, bwork, info)` | |

`gees(jobvs, sort, select, n, a, lda, sdim, w, vs, ldvs, work, lwork, rwork, bwork, info)` | |

`gees(jobvs, sort, select, n, a, lda, sdim, w, vs, ldvs, work, lwork, rwork, bwork, info)` | |

`geesx(jobvs, sort, select, sense, n, a, lda, sdim, w, vs, ldvs, rconde, rcondv, work, lwork, rwork, bwork, info)` | |

`geesx(jobvs, sort, select, sense, n, a, lda, sdim, w, vs, ldvs, rconde, rcondv, work, lwork, rwork, bwork, info)` | |

`geesx(jobvs, sort, select, sense, n, a, lda, sdim, wr, wi, vs, ldvs, rconde, rcondv, work, lwork, iwork, liwork, bwork, info)` | |

`geesx(jobvs, sort, select, sense, n, a, lda, sdim, wr, wi, vs, ldvs, rconde, rcondv, work, lwork, iwork, liwork, bwork, info)` | Computes the eigenvalues and Schur factorization of a general matrix, orders the factorization so that selected eigenvalues are at the top left of the Schur form, and computes reciprocal condition numbers for the average of the selected eigenvalues, and for the associated right invariant subspace. |

`geev(jobvl, jobvr, n, a, lda, wr, wi, vl, ldvl, vr, ldvr, work, lwork, info)` | Computes the eigenvalues and left and right eigenvectors of a general matrix. |

`geev(jobvl, jobvr, n, a, lda, wr, wi, vl, ldvl, vr, ldvr, work, lwork, info)` | |

`geev(jobvl, jobvr, n, a, lda, w, vl, ldvl, vr, ldvr, work, lwork, rwork, info)` | |

`geev(jobvl, jobvr, n, a, lda, w, vl, ldvl, vr, ldvr, work, lwork, rwork, info)` | |

`geevx(balanc, jobvl, jobvr, sense, n, a, lda, w, vl, ldvl, vr, ldvr, ilo, ihi, scale, abnrm, rconde, rcondv, work, lwork, rwork, info)` | |

`geevx(balanc, jobvl, jobvr, sense, n, a, lda, w, vl, ldvl, vr, ldvr, ilo, ihi, scale, abnrm, rconde, rcondv, work, lwork, rwork, info)` | |

`geevx(balanc, jobvl, jobvr, sense, n, a, lda, wr, wi, vl, ldvl, vr, ldvr, ilo, ihi, scale, abnrm, rconde, rcondv, work, lwork, iwork, info)` | |

`geevx(balanc, jobvl, jobvr, sense, n, a, lda, wr, wi, vl, ldvl, vr, ldvr, ilo, ihi, scale, abnrm, rconde, rcondv, work, lwork, iwork, info)` | Computes the eigenvalues and left and right eigenvectors of a general matrix, with preliminary balancing of the matrix, and computes reciprocal condition numbers for the eigenvalues and right eigenvectors. |

`gegs(jobvsl, jobvsr, n, a, lda, b, ldb, alphar, alphai, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, info)` | Computes the generalized eigenvalues, Schur form, and left and/or right Schur vectors for a pair of nonsymmetric matrices |

`gegs(jobvsl, jobvsr, n, a, lda, b, ldb, alphar, alphai, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, info)` | |

`gegs(jobvsl, jobvsr, n, a, lda, b, ldb, alphav, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, rwork, info)` | |

`gegs(jobvsl, jobvsr, n, a, lda, b, ldb, alphav, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, rwork, info)` | |

`gegv(jobvl, jobvr, n, a, lda, b, ldb, alphar, alphai, betav, vl, ldvl, vr, ldvr, work, lwork, info)` | Computes the generalized eigenvalues, and left and/or right generalized eigenvectors for a pair of nonsymmetric matrices |

`gegv(jobvl, jobvr, n, a, lda, b, ldb, alphar, alphai, betav, vl, ldvl, vr, ldvr, work, lwork, info)` | |

`gegv(jobvl, jobvr, n, a, lda, b, ldb, alphar, betav, vl, ldvl, vr, ldvr, work, lwork, rwork, info)` | |

`gegv(jobvl, jobvr, n, a, lda, b, ldb, alphar, betav, vl, ldvl, vr, ldvr, work, lwork, rwork, info)` | |

`gehrd(n, ilo, ihi, a, lda, tau, work, lwork, info)` | |

`gehrd(n, ilo, ihi, a, lda, tau, work, lwork, info)` | |

`gehrd(n, ilo, ihi, a, lda, tau, work, lwork, info)` | |

`gehrd(n, ilo, ihi, a, lda, tau, work, lwork, info)` | Reduces a general matrix to upper Hessenberg form by an orthogonal similarity transformation. |

`gelqf(m, n, a, lda, tau, work, lwork, info)` | Computes an LQ factorization of a general rectangular matrix. |

`gelqf(m, n, a, lda, tau, work, lwork, info)` | |

`gelqf(m, n, a, lda, tau, work, lwork, info)` | |

`gelqf(m, n, a, lda, tau, work, lwork, info)` | |

`gels(trans, m, n, nrhs, a, lda, b, ldb, work, lwork, info)` | Computes the least squares solution to an over-determined system of linear equations, A X=B or A**H X=B, or the minimum norm solution of an under-determined system, where A is a general rectangular matrix of full rank, using a QR or LQ factorization of A. |

`gels(trans, m, n, nrhs, a, lda, b, ldb, work, lwork, info)` | |

`gels(trans, m, n, nrhs, a, lda, b, ldb, work, lwork, info)` | |

`gels(trans, m, n, nrhs, a, lda, b, ldb, work, lwork, info)` | |

`gelsd(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, iwork, info)` | Computes the least squares solution to an over-determined system of linear equations, A X=B or A**H X=B, or the minimum norm solution of an under-determined system, using a divide and conquer method, where A is a general rectangular matrix of full rank, using a QR or LQ factorization of A. |

`gelsd(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, iwork, info)` | |

`gelsd(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, rwork, iwork, info)` | |

`gelsd(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, rwork, iwork, info)` | |

`gelss(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, rwork, info)` | |

`gelss(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, rwork, info)` | |

`gelss(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, info)` | |

`gelss(m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, info)` | Computes the minimum norm least squares solution to an over- or under-determined system of linear equations A X=B, using the singular value decomposition of A. |

`gelsx(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, rwork, info)` | |

`gelsx(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, rwork, info)` | |

`gelsx(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, info)` | |

`gelsx(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, info)` | Computes the minimum norm least squares solution to an over- or under-determined system of linear equations A X=B, using a complete orthogonal factorization of A. |

`gelsy(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, lwork, rwork, info)` | |

`gelsy(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, lwork, rwork, info)` | |

`gelsy(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, lwork, info)` | |

`gelsy(m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, lwork, info)` | Computes the minimum norm least squares solution to an over- or under-determined system of linear equations A X=B, using a complete orthogonal factorization of A. |

`geqlf(m, n, a, lda, tau, work, lwork, info)` | Computes a QL factorization of a general rectangular matrix. |

`geqlf(m, n, a, lda, tau, work, lwork, info)` | |

`geqlf(m, n, a, lda, tau, work, lwork, info)` | |

`geqlf(m, n, a, lda, tau, work, lwork, info)` | |

`geqp3(m, n, a, lda, jpvt, tau, work, lwork, info)` | Computes a QR factorization with column pivoting of a general rectangular matrix using Level 3 BLAS. |

`geqp3(m, n, a, lda, jpvt, tau, work, lwork, info)` | |

`geqp3(m, n, a, lda, jpvt, tau, work, lwork, rwork, info)` | |

`geqp3(m, n, a, lda, jpvt, tau, work, lwork, rwork, info)` | |

`geqpf(m, n, a, lda, jpvt, tau, work, info)` | Computes a QR factorization with column pivoting of a general rectangular matrix. |

`geqpf(m, n, a, lda, jpvt, tau, work, info)` | |

`geqpf(m, n, a, lda, jpvt, tau, work, rwork, info)` | |

`geqpf(m, n, a, lda, jpvt, tau, work, rwork, info)` | |

`geqrf(m, n, a, lda, tau, work, lwork, info)` | Computes a QR factorization of a general rectangular matrix. |

`geqrf(m, n, a, lda, tau, work, lwork, info)` | |

`geqrf(m, n, a, lda, tau, work, lwork, info)` | |

`geqrf(m, n, a, lda, tau, work, lwork, info)` | |

`gerfs(trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Improves the computed solution to a general system of linear equations AX=B, A**T X=B or A**H X=B, and provides forward and backward error bounds for the solution. |

`gerfs(trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`gerfs(trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`gerfs(trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`gerqf(m, n, a, lda, tau, work, lwork, info)` | Computes an RQ factorization of a general rectangular matrix. |

`gerqf(m, n, a, lda, tau, work, lwork, info)` | |

`gerqf(m, n, a, lda, tau, work, lwork, info)` | |

`gerqf(m, n, a, lda, tau, work, lwork, info)` | |

`gesdd(jobz, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, iwork, info)` | Computes the singular value decomposition (SVD) of a general rectangular matrix using divide-and-conquer. |

`gesdd(jobz, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, iwork, info)` | |

`gesdd(jobz, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, rwork, iwork, info)` | |

`gesdd(jobz, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, rwork, iwork, info)` | |

`gesv(n, nrhs, a, lda, ipiv, b, ldb, info)` | Solves a general system of linear equations AX=B. |

`gesv(n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`gesv(n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`gesv(n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`gesvd(jobu, jobvt, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, rwork, info)` | |

`gesvd(jobu, jobvt, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, info)` | Computes the singular value decomposition (SVD) of a general rectangular matrix. |

`gesvd(jobu, jobvt, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, info)` | |

`gesvd(jobu, jobvt, m, n, a, lda, s, u, ldu, vt, ldvt, work, lwork, rwork, info)` | |

`gesvx(fact, trans, n, nrhs, a, lda, af, ldaf, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | Solves a general system of linear equations AX=B, A**T X=B or A**H X=B, and provides an estimate of the condition number and error bounds on the solution. |

`gesvx(fact, trans, n, nrhs, a, lda, af, ldaf, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | |

`gesvx(fact, trans, n, nrhs, a, lda, af, ldaf, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`gesvx(fact, trans, n, nrhs, a, lda, af, ldaf, ipiv, equed, r, c, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`getrf(m, n, a, lda, ipiv, info)` | |

`getrf(m, n, a, lda, ipiv, info)` | |

`getrf(m, n, a, lda, ipiv, info)` | |

`getrf(m, n, a, lda, ipiv, info)` | Computes an LU factorization of a general matrix, using partial pivoting with row interchanges. |

`getri(n, a, lda, ipiv, work, lwork, info)` | |

`getri(n, a, lda, ipiv, work, lwork, info)` | |

`getri(n, a, lda, ipiv, work, lwork, info)` | |

`getri(n, a, lda, ipiv, work, lwork, info)` | Computes the inverse of a general matrix, using the LU factorization computed by SGETRF. |

`getrs(trans, n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`getrs(trans, n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`getrs(trans, n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`getrs(trans, n, nrhs, a, lda, ipiv, b, ldb, info)` | Solves a general system of linear equations AX=B, A**T X=B or A**H X=B, using the LU factorization computed by SGETRF. |

`ggbak(job, side, n, ilo, ihi, lscale, rscale, m, v, ldv, info)` | |

`ggbak(job, side, n, ilo, ihi, lscale, rscale, m, v, ldv, info)` | |

`ggbak(job, side, n, ilo, ihi, lscale, rscale, m, v, ldv, info)` | |

`ggbak(job, side, n, ilo, ihi, lscale, rscale, m, v, ldv, info)` | Forms the right or left eigenvectors of the generalized eigenvalue problem by backward transformation on the computed eigenvectors of the balanced pair of matrices output by SGGBAL. |

`ggbal(job, n, a, lda, b, ldb, ilo, ihi, lscale, rscale, work, info)` | |

`ggbal(job, n, a, lda, b, ldb, ilo, ihi, lscale, rscale, work, info)` | |

`ggbal(job, n, a, lda, b, ldb, ilo, ihi, lscale, rscale, work, info)` | |

`ggbal(job, n, a, lda, b, ldb, ilo, ihi, lscale, rscale, work, info)` | Balances a pair of general real matrices for the generalized eigenvalue problem A x = lambda B x. |

`gges(jobvsl, jobvsr, sort, delctg, n, a, lda, b, ldb, sdim, alphav, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, rwork, bwork, info)` | |

`gges(jobvsl, jobvsr, sort, selctg, n, a, lda, b, ldb, sdim, alphav, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, rwork, bwork, info)` | |

`gges(jobvsl, jobvsr, sort, delctg, n, a, lda, b, ldb, sdim, alphar, alphai, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, bwork, info)` | |

`gges(jobvsl, jobvsr, sort, selctg, n, a, lda, b, ldb, sdim, alphar, alphai, betav, vsl, ldvsl, vsr, ldvsr, work, lwork, bwork, info)` | Computes the generalized eigenvalues, Schur form, and left and/or right Schur vectors for a pair of nonsymmetric matrices |

`ggesx(jobvsl, jobvsr, sort, selctg, sense, n, a, lda, b, ldb, sdim, alphav, betav, vsl, ldvsl, vsr, ldvsr, rconde, rcondv, work, lwork, rwork, iwork, liwork, bwork, info)` | |

`ggesx(jobvsl, jobvsr, sort, delctg, sense, n, a, lda, b, ldb, sdim, alphar, alphai, betav, vsl, ldvsl, vsr, ldvsr, rconde, rcondv, work, lwork, iwork, liwork, bwork, info)` | |

`ggesx(jobvsl, jobvsr, sort, delctg, sense, n, a, lda, b, ldb, sdim, alphav, betav, vsl, ldvsl, vsr, ldvsr, rconde, rcondv, work, lwork, rwork, iwork, liwork, bwork, info)` | |

`ggesx(jobvsl, jobvsr, sort, selctg, sense, n, a, lda, b, ldb, sdim, alphar, alphai, betav, vsl, ldvsl, vsr, ldvsr, rconde, rcondv, work, lwork, iwork, liwork, bwork, info)` | Computes the generalized eigenvalues, the real Schur form, and, optionally, the left and/or right matrices of Schur vectors. |

`ggev(jobvl, jobvr, n, a, lda, b, ldb, alphav, betav, vl, ldvl, vr, ldvr, work, lwork, rwork, info)` | |

`ggev(jobvl, jobvr, n, a, lda, b, ldb, alphav, betav, vl, ldvl, vr, ldvr, work, lwork, rwork, info)` | |

`ggev(jobvl, jobvr, n, a, lda, b, ldb, alphar, alphai, betav, vl, ldvl, vr, ldvr, work, lwork, info)` | |

`ggev(jobvl, jobvr, n, a, lda, b, ldb, alphar, alphai, betav, vl, ldvl, vr, ldvr, work, lwork, info)` | Computes the generalized eigenvalues, and left and/or right generalized eigenvectors for a pair of nonsymmetric matrices |

`ggevx(balanc, jobvl, jobvr, sense, n, a, lda, b, ldb, alphav, betav, vl, ldvl, vr, ldvr, ilo, ihi, lscale, rscale, abnrm, bbnrm, rconde, rcondv, work, lwork, rwork, iwork, bwork, info)` | |

`ggevx(balanc, jobvl, jobvr, sense, n, a, lda, b, ldb, alphav, betav, vl, ldvl, vr, ldvr, ilo, ihi, lscale, rscale, abnrm, bbnrm, rconde, rcondv, work, lwork, rwork, iwork, bwork, info)` | |

`ggevx(balanc, jobvl, jobvr, sense, n, a, lda, b, ldb, alphar, alphai, betav, vl, ldvl, vr, ldvr, ilo, ihi, lscale, rscale, abnrm, bbnrm, rconde, rcondv, work, lwork, iwork, bwork, info)` | |

`ggevx(balanc, jobvl, jobvr, sense, n, a, lda, b, ldb, alphar, alphai, betav, vl, ldvl, vr, ldvr, ilo, ihi, lscale, rscale, abnrm, bbnrm, rconde, rcondv, work, lwork, iwork, bwork, info)` | Computes the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors. |

`ggglm(n, m, p, a, lda, b, ldb, d, x, y, work, lwork, info)` | Solves the GLM (Generalized Linear Regression Model) using the GQR (Generalized QR) factorization |

`ggglm(n, m, p, a, lda, b, ldb, d, x, y, work, lwork, info)` | |

`ggglm(n, m, p, a, lda, b, ldb, d, x, y, work, lwork, info)` | |

`ggglm(n, m, p, a, lda, b, ldb, d, x, y, work, lwork, info)` | |

`gghrd(compq, compz, n, ilo, ihi, a, lda, b, ldb, q, ldq, z, ldz, info)` | |

`gghrd(compq, compz, n, ilo, ihi, a, lda, b, ldb, q, ldq, z, ldz, info)` | |

`gghrd(compq, compz, n, ilo, ihi, a, lda, b, ldb, q, ldq, z, ldz, info)` | |

`gghrd(compq, compz, n, ilo, ihi, a, lda, b, ldb, q, ldq, z, ldz, info)` | Reduces a pair of real matrices to generalized upper Hessenberg form using orthogonal transformations |

`gglse(m, n, p, a, lda, b, ldb, c, d, x, work, lwork, info)` | Solves the LSE (Constrained Linear Least Squares Problem) using the GRQ (Generalized RQ) factorization |

`gglse(m, n, p, a, lda, b, ldb, c, d, x, work, lwork, info)` | |

`gglse(m, n, p, a, lda, b, ldb, c, d, x, work, lwork, info)` | |

`gglse(m, n, p, a, lda, b, ldb, c, d, x, work, lwork, info)` | |

`ggqrf(n, m, p, a, lda, taua, b, ldb, taub, work, lwork, info)` | |

`ggqrf(n, m, p, a, lda, taua, b, ldb, taub, work, lwork, info)` | |

`ggqrf(n, m, p, a, lda, taua, b, ldb, taub, work, lwork, info)` | |

`ggqrf(n, m, p, a, lda, taua, b, ldb, taub, work, lwork, info)` | Computes a generalized QR factorization of a pair of matrices. |

`ggrqf(m, p, n, a, lda, taua, b, ldb, taub, work, lwork, info)` | |

`ggrqf(m, p, n, a, lda, taua, b, ldb, taub, work, lwork, info)` | |

`ggrqf(m, p, n, a, lda, taua, b, ldb, taub, work, lwork, info)` | |

`ggrqf(m, p, n, a, lda, taua, b, ldb, taub, work, lwork, info)` | Computes a generalized RQ factorization of a pair of matrices. |

`ggsvd(jobu, jobv, jobq, m, n, p, k, l, a, lda, b, ldb, alphav, betav, u, ldu, v, ldv, q, ldq, work, iwork, info)` | |

`ggsvd(jobu, jobv, jobq, m, n, p, k, l, a, lda, b, ldb, alphav, betav, u, ldu, v, ldv, q, ldq, work, rwork, iwork, info)` | |

`ggsvd(jobu, jobv, jobq, m, n, p, k, l, a, lda, b, ldb, alphav, betav, u, ldu, v, ldv, q, ldq, work, rwork, iwork, info)` | |

`ggsvd(jobu, jobv, jobq, m, n, p, k, l, a, lda, b, ldb, alphav, betav, u, ldu, v, ldv, q, ldq, work, iwork, info)` | Computes the Generalized Singular Value Decomposition |

`ggsvp(jobu, jobv, jobq, m, p, n, a, lda, b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q, ldq, iwork, rwork, tau, work, info)` | |

`ggsvp(jobu, jobv, jobq, m, p, n, a, lda, b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q, ldq, iwork, tau, work, info)` | |

`ggsvp(jobu, jobv, jobq, m, p, n, a, lda, b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q, ldq, iwork, tau, work, info)` | Computes orthogonal matrices as a preprocessing step for computing the generalized singular value decomposition |

`ggsvp(jobu, jobv, jobq, m, p, n, a, lda, b, ldb, tola, tolb, k, l, u, ldu, v, ldv, q, ldq, iwork, rwork, tau, work, info)` | |

`gtcon(norm, n, dl, d, du, du2, ipiv, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a general tridiagonal matrix, in either the 1-norm or the infinity-norm, using the LU factorization computed by SGTTRF. |

`gtcon(norm, n, dl, d, du, du2, ipiv, anorm, rcond, work, iwork, info)` | |

`gtcon(norm, n, dl, d, du, du2, ipiv, anorm, rcond, work, info)` | |

`gtcon(norm, n, dl, d, du, du2, ipiv, anorm, rcond, work, info)` | |

`gtrfs(trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Improves the computed solution to a general tridiagonal system of linear equations AX=B, A**T X=B or A**H X=B, and provides forward and backward error bounds for the solution. |

`gtrfs(trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`gtrfs(trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`gtrfs(trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`gtsv(n, nrhs, dl, d, du, b, ldb, info)` | Solves a general tridiagonal system of linear equations AX=B. |

`gtsv(n, nrhs, dl, d, du, b, ldb, info)` | |

`gtsv(n, nrhs, dl, d, du, b, ldb, info)` | |

`gtsv(n, nrhs, dl, d, du, b, ldb, info)` | |

`gtsvx(fact, trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | Solves a general tridiagonal system of linear equations AX=B, A**T X=B or A**H X=B, and provides an estimate of the condition number and error bounds on the solution. |

`gtsvx(fact, trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | |

`gtsvx(fact, trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`gtsvx(fact, trans, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`gttrf(n, dl, d, du, du2, ipiv, info)` | Computes an LU factorization of a general tridiagonal matrix, using partial pivoting with row interchanges. |

`gttrf(n, dl, d, du, du2, ipiv, info)` | |

`gttrf(n, dl, d, du, du2, ipiv, info)` | |

`gttrf(n, dl, d, du, du2, ipiv, info)` | |

`gttrs(trans, n, nrhs, dl, d, du, du2, ipiv, b, ldb, info)` | 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 SGTTRF. |

`gttrs(trans, n, nrhs, dl, d, du, du2, ipiv, b, ldb, info)` | |

`gttrs(trans, n, nrhs, dl, d, du, du2, ipiv, b, ldb, info)` | |

`gttrs(trans, n, nrhs, dl, d, du, du2, ipiv, b, ldb, info)` | |

`hbev(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, rwork, info)` | |

`hbev(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, rwork, info)` | Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix. |

`hbevd(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`hbevd(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`hbevx(jobz, range, uplo, n, kd, ab, ldab, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | Computes selected eigenvalues and eigenvectors of a Hermitian band matrix. |

`hbevx(jobz, range, uplo, n, kd, ab, ldab, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | |

`hbgst(vect, uplo, n, ka, kb, ab, ldab, bb, ldbb, x, ldx, work, rwork, info)` | Reduces a complex Hermitian-definite banded generalized eigenproblem A x = lambda B x to standard form, where B has been factorized by CPBSTF (Crawford's algorithm). |

`hbgst(vect, uplo, n, ka, kb, ab, ldab, bb, ldbb, x, ldx, work, rwork, info)` | |

`hbgv(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, rwork, info)` | Computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x. A and B are assumed to be Hermitian and banded, and B is also positive definite. |

`hbgv(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, rwork, info)` | |

`hbgvd(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`hbgvd(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | Computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x. A and B are assumed to be Hermitian and banded, and B is also positive definite. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`hbgvx(jobz, range, uplo, n, ka, kb, ab, ldab, bb, ldbb, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | Computes selected eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x. A and B are assumed to be Hermitian and banded, and B is also positive definite. |

`hbgvx(jobz, range, uplo, n, ka, kb, ab, ldab, bb, ldbb, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | |

`hbtrd(vect, uplo, n, kd, ab, ldab, d, e, q, ldq, work, info)` | Reduces a Hermitian band matrix to real symmetric tridiagonal form by a unitary similarity transformation. |

`hbtrd(vect, uplo, n, kd, ab, ldab, d, e, q, ldq, work, info)` | |

`hecon(uplo, n, a, lda, ipiv, anorm, rcond, work, info)` | |

`hecon(uplo, n, a, lda, ipiv, anorm, rcond, work, info)` | Estimates the reciprocal of the condition number of a complex Hermitian indefinite matrix, using the factorization computed by CHETRF. |

`heev(jobz, uplo, n, a, lda, w, work, lwork, rwork, info)` | |

`heev(jobz, uplo, n, a, lda, w, work, lwork, rwork, info)` | Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix. |

`heevd(jobz, uplo, n, a, lda, w, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`heevd(jobz, uplo, n, a, lda, w, work, lwork, rwork, lrwork, iwork, liwork, info)` | Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`heevr(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`heevr(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, rwork, lrwork, iwork, liwork, info)` | Computes selected eigenvalues, and optionally, eigenvectors of a complex Hermitian matrix. Eigenvalues are computed by the dqds algorithm, and eigenvectors are computed from various "good" LDL^T representations (also known as Relatively Robust Representations). |

`heevx(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, rwork, iwork, ifail, info)` | |

`heevx(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, rwork, iwork, ifail, info)` | Computes selected eigenvalues and eigenvectors of a Hermitian matrix. |

`hegst(itype, uplo, n, a, lda, b, ldb, info)` | |

`hegst(itype, uplo, n, a, lda, b, ldb, info)` | Reduces a Hermitian-definite generalized eigenproblem Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, to standard form, where B has been factorized by CPOTRF. |

`hegv(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, rwork, info)` | |

`hegv(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, rwork, info)` | Computes all eigenvalues and the eigenvectors of a generalized Hermitian-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x. |

`hegvd(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`hegvd(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, rwork, lrwork, iwork, liwork, info)` | Computes all eigenvalues and the eigenvectors of a generalized Hermitian-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`hegvx(itype, jobz, range, uplo, n, a, lda, b, ldb, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, rwork, iwork, ifail, info)` | |

`hegvx(itype, jobz, range, uplo, n, a, lda, b, ldb, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, rwork, iwork, ifail, info)` | Computes selected eigenvalues, and optionally, the eigenvectors of a generalized Hermitian-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x. |

`herfs(uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`herfs(uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | Improves the computed solution to a complex Hermitian indefinite system of linear equations AX=B, and provides forward and backward error bounds for the solution. |

`hesv(uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork, info)` | Solves a complex Hermitian indefinite system of linear equations AX=B. |

`hesv(uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork, info)` | |

`hesvx(fact, uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, lwork, rwork, info)` | Solves a complex Hermitian indefinite system of linear equations AX=B, and provides an estimate of the condition number and error bounds on the solution. |

`hesvx(fact, uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, lwork, rwork, info)` | |

`hetrd(uplo, n, a, lda, d, e, tau, work, lwork, info)` | |

`hetrd(uplo, n, a, lda, d, e, tau, work, lwork, info)` | Reduces a Hermitian matrix to real symmetric tridiagonal form by an orthogonal/unitary similarity transformation. |

`hetrf(uplo, n, a, lda, ipiv, work, lwork, info)` | |

`hetrf(uplo, n, a, lda, ipiv, work, lwork, info)` | Computes the factorization of a complex Hermitian-indefinite matrix, using the diagonal pivoting method. |

`hetri(uplo, n, a, lda, ipiv, work, info)` | |

`hetri(uplo, n, a, lda, ipiv, work, info)` | Computes the inverse of a complex Hermitian indefinite matrix, using the factorization computed by CHETRF. |

`hetrs(uplo, n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`hetrs(uplo, n, nrhs, a, lda, ipiv, b, ldb, info)` | Solves a complex Hermitian indefinite system of linear equations AX=B, using the factorization computed by CHPTRF. |

`hgeqz(job, compq, compz, n, ilo, ihi, a, lda, b, ldb, alphar, alphai, betav, q, ldq, z, ldz, work, lwork, info)` | Implements a single-/f_double-shift version of the QZ method for finding the generalized eigenvalues of the equation det(A - w(i) B) = 0 |

`hgeqz(job, compq, compz, n, ilo, ihi, a, lda, b, ldb, alphar, alphai, betav, q, ldq, z, ldz, work, lwork, info)` | |

`hgeqz(job, compq, compz, n, ilo, ihi, a, lda, b, ldb, alphav, betav, q, ldq, z, ldz, work, lwork, rwork, info)` | |

`hgeqz(job, compq, compz, n, ilo, ihi, a, lda, b, ldb, alphav, betav, q, ldq, z, ldz, work, lwork, rwork, info)` | |

`hpcon(uplo, n, ap, ipiv, anorm, rcond, work, info)` | Estimates the reciprocal of the condition number of a complex Hermitian indefinite matrix in packed storage, using the factorization computed by CHPTRF. |

`hpcon(uplo, n, ap, ipiv, anorm, rcond, work, info)` | |

`hpev(jobz, uplo, n, ap, w, z, ldz, work, rwork, info)` | |

`hpev(jobz, uplo, n, ap, w, z, ldz, work, rwork, info)` | Computes selected eigenvalues, and optionally, eigenvectors of a complex Hermitian matrix. Eigenvalues are computed by the dqds algorithm, and eigenvectors are computed from various "good" LDL^T representations (also known as Relatively Robust Representations). Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage. |

`hpevd(jobz, uplo, n, ap, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`hpevd(jobz, uplo, n, ap, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`hpevx(jobz, range, uplo, n, ap, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | Computes selected eigenvalues and eigenvectors of a Hermitian matrix in packed storage. |

`hpevx(jobz, range, uplo, n, ap, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | |

`hpgst(itype, uplo, n, ap, bp, info)` | |

`hpgst(itype, uplo, n, ap, bp, info)` | Reduces a Hermitian-definite generalized eigenproblem Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, to standard form, where A and B are held in packed storage, and B has been factorized by CPPTRF. |

`hpgv(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, rwork, info)` | Computes all eigenvalues and eigenvectors of a generalized Hermitian-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, where A and B are in packed storage. |

`hpgv(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, rwork, info)` | |

`hpgvd(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | Computes all eigenvalues and eigenvectors of a generalized Hermitian-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, where A and B are in packed storage. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`hpgvd(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`hpgvx(itype, jobz, range, uplo, n, ap, bp, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | |

`hpgvx(itype, jobz, range, uplo, n, ap, bp, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork, ifail, info)` | Computes selected eigenvalues, and optionally, the eigenvectors of a generalized Hermitian-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, where A and B are in packed storage. |

`hprfs(uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`hprfs(uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | Improves the computed solution to a complex Hermitian indefinite system of linear equations AX=B, where A is held in packed storage, and provides forward and backward error bounds for the solution. |

`hpsv(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | Solves a complex Hermitian indefinite system of linear equations AX=B, where A is held in packed storage. |

`hpsv(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`hpsvx(fact, uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`hpsvx(fact, uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | Solves a complex Hermitian indefinite system of linear equations AX=B, where A is held in packed storage, and provides an estimate of the condition number and error bounds on the solution. |

`hptrd(uplo, n, ap, d, e, tau, info)` | Reduces a Hermitian matrix in packed storage to real symmetric tridiagonal form by a unitary similarity transformation. |

`hptrd(uplo, n, ap, d, e, tau, info)` | |

`hptrf(uplo, n, ap, ipiv, info)` | Computes the factorization of a complex Hermitian-indefinite matrix in packed storage, using the diagonal pivoting method. |

`hptrf(uplo, n, ap, ipiv, info)` | |

`hptri(uplo, n, ap, ipiv, work, info)` | Computes the inverse of a complex Hermitian indefinite matrix in packed storage, using the factorization computed by CHPTRF. |

`hptri(uplo, n, ap, ipiv, work, info)` | |

`hptrs(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | Solves a complex Hermitian indefinite system of linear equations AX=B, where A is held in packed storage, using the factorization computed by CHPTRF. |

`hptrs(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`hsein(side, eigsrc, initv, select, n, h, ldh, wr, wi, vl, ldvl, vr, ldvr, mm, m, work, ifaill, ifailr, info)` | |

`hsein(side, eigsrc, initv, select, n, h, ldh, w, vl, ldvl, vr, ldvr, mm, m, work, rwork, ifaill, ifailr, info)` | |

`hsein(side, eigsrc, initv, select, n, h, ldh, w, vl, ldvl, vr, ldvr, mm, m, work, rwork, ifaill, ifailr, info)` | |

`hsein(side, eigsrc, initv, select, n, h, ldh, wr, wi, vl, ldvl, vr, ldvr, mm, m, work, ifaill, ifailr, info)` | Computes specified right and/or left eigenvectors of an upper Hessenberg matrix by inverse iteration. |

`hseqr(job, compz, n, ilo, ihi, h, ldh, wr, wi, z, ldz, work, lwork, info)` | Computes the eigenvalues and Schur factorization of an upper Hessenberg matrix, using the multishift QR algorithm. |

`hseqr(job, compz, n, ilo, ihi, h, ldh, wr, wi, z, ldz, work, lwork, info)` | |

`hseqr(job, compz, n, ilo, ihi, h, ldh, w, z, ldz, work, lwork, info)` | |

`hseqr(job, compz, n, ilo, ihi, h, ldh, w, z, ldz, work, lwork, info)` | |

`ilaenv(ispec, name, opts, n1, n2, n3, n4, len_name, len_opts)` | |

`ilaenvset(ispec, name, opts, n1, n2, n3, n4, nvalue, info, len_name, len_opts)` | |

`opgtr(uplo, n, ap, tau, q, ldq, work, info)` | Generates the orthogonal transformation matrix from a reduction to tridiagonal form determined by SSPTRD. |

`opgtr(uplo, n, ap, tau, q, ldq, work, info)` | |

`opmtr(side, uplo, trans, m, n, ap, tau, c, ldc, work, info)` | Multiplies a general matrix by the orthogonal transformation matrix from a reduction to tridiagonal form determined by SSPTRD. |

`opmtr(side, uplo, trans, m, n, ap, tau, c, ldc, work, info)` | |

`orgbr(vect, m, n, k, a, lda, tau, work, lwork, info)` | Generates the orthogonal transformation matrices from a reduction to bidiagonal form determined by SGEBRD. |

`orgbr(vect, m, n, k, a, lda, tau, work, lwork, info)` | |

`orghr(n, ilo, ihi, a, lda, tau, work, lwork, info)` | Generates the orthogonal transformation matrix from a reduction to Hessenberg form determined by SGEHRD. |

`orghr(n, ilo, ihi, a, lda, tau, work, lwork, info)` | |

`orglq(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the orthogonal matrix Q from an LQ factorization determined by SGELQF. |

`orglq(m, n, k, a, lda, tau, work, lwork, info)` | |

`orgql(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the orthogonal matrix Q from a QL factorization determined by SGEQLF. |

`orgql(m, n, k, a, lda, tau, work, lwork, info)` | |

`orgqr(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the orthogonal matrix Q from a QR factorization determined by SGEQRF. |

`orgqr(m, n, k, a, lda, tau, work, lwork, info)` | |

`orgrq(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the orthogonal matrix Q from an RQ factorization determined by SGERQF. |

`orgrq(m, n, k, a, lda, tau, work, lwork, info)` | |

`orgtr(uplo, n, a, lda, tau, work, lwork, info)` | Generates the orthogonal transformation matrix from a reduction to tridiagonal form determined by SSYTRD. |

`orgtr(uplo, n, a, lda, tau, work, lwork, info)` | |

`ormbr(vect, side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by one of the orthogonal transformation matrices from a reduction to bidiagonal form determined by SGEBRD. |

`ormbr(vect, side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormhr(side, trans, m, n, ilo, ihi, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the orthogonal transformation matrix from a reduction to Hessenberg form determined by SGEHRD. |

`ormhr(side, trans, m, n, ilo, ihi, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormlq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the orthogonal matrix from an LQ factorization determined by SGELQF. |

`ormlq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormql(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the orthogonal matrix from a QL factorization determined by SGEQLF. |

`ormql(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormqr(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the orthogonal matrix from a QR factorization determined by SGEQRF. |

`ormqr(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormr3(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, info)` | Multiples a general matrix by the orthogonal matrix from an RZ factorization determined by STZRZF. |

`ormr3(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, info)` | |

`ormrq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the orthogonal matrix from an RQ factorization determined by SGERQF. |

`ormrq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormrz(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormrz(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, lwork, info)` | Multiples a general matrix by the orthogonal matrix from an RZ factorization determined by STZRZF. |

`ormtr(side, uplo, trans, m, n, a, lda, tau, c, ldc, work, lwork, info)` | |

`ormtr(side, uplo, trans, m, n, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the orthogonal transformation matrix from a reduction to tridiagonal form determined by SSYTRD. |

`pbcon(uplo, n, kd, ab, ldab, anorm, rcond, work, rwork, info)` | |

`pbcon(uplo, n, kd, ab, ldab, anorm, rcond, work, rwork, info)` | |

`pbcon(uplo, n, kd, ab, ldab, anorm, rcond, work, iwork, info)` | |

`pbcon(uplo, n, kd, ab, ldab, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a symmetric positive definite band matrix, using the Cholesky factorization computed by SPBTRF. |

`pbequ(uplo, n, kd, ab, ldab, s, scond, amax, info)` | |

`pbequ(uplo, n, kd, ab, ldab, s, scond, amax, info)` | |

`pbequ(uplo, n, kd, ab, ldab, s, scond, amax, info)` | |

`pbequ(uplo, n, kd, ab, ldab, s, scond, amax, info)` | Computes row and column scalings to equilibrate a symmetric positive definite band matrix and reduce its condition number. |

`pbrfs(uplo, n, kd, nrhs, ab, ldab, afb, ldafb, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`pbrfs(uplo, n, kd, nrhs, ab, ldab, afb, ldafb, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`pbrfs(uplo, n, kd, nrhs, ab, ldab, afb, ldafb, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`pbrfs(uplo, n, kd, nrhs, ab, ldab, afb, ldafb, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Improves the computed solution to a symmetric positive definite banded system of linear equations AX=B, and provides forward and backward error bounds for the solution. |

`pbstf(uplo, n, kd, ab, ldab, info)` | |

`pbstf(uplo, n, kd, ab, ldab, info)` | |

`pbstf(uplo, n, kd, ab, ldab, info)` | |

`pbstf(uplo, n, kd, ab, ldab, info)` | Computes a split Cholesky factorization of a real symmetric positive definite band matrix. |

`pbsv(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | Solves a symmetric positive definite banded system of linear equations AX=B. |

`pbsv(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`pbsv(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`pbsv(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`pbsvx(fact, uplo, n, kd, nrhs, ab, ldab, afb, ldafb, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | Solves a symmetric positive definite banded system of linear equations AX=B, and provides an estimate of the condition number and error bounds on the solution. |

`pbsvx(fact, uplo, n, kd, nrhs, ab, ldab, afb, ldafb, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | |

`pbsvx(fact, uplo, n, kd, nrhs, ab, ldab, afb, ldafb, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`pbsvx(fact, uplo, n, kd, nrhs, ab, ldab, afb, ldafb, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`pbtrf(uplo, n, kd, ab, ldab, info)` | |

`pbtrf(uplo, n, kd, ab, ldab, info)` | |

`pbtrf(uplo, n, kd, ab, ldab, info)` | |

`pbtrf(uplo, n, kd, ab, ldab, info)` | Computes the Cholesky factorization of a symmetric positive definite band matrix. |

`pbtrs(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`pbtrs(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`pbtrs(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`pbtrs(uplo, n, kd, nrhs, ab, ldab, b, ldb, info)` | Solves a symmetric positive definite banded system of linear equations AX=B, using the Cholesky factorization computed by SPBTRF. |

`pocon(uplo, n, a, lda, anorm, rcond, work, rwork, info)` | |

`pocon(uplo, n, a, lda, anorm, rcond, work, rwork, info)` | |

`pocon(uplo, n, a, lda, anorm, rcond, work, iwork, info)` | |

`pocon(uplo, n, a, lda, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a symmetric positive definite matrix, using the Cholesky factorization computed by SPOTRF. |

`poequ(n, a, lda, s, scond, amax, info)` | |

`poequ(n, a, lda, s, scond, amax, info)` | |

`poequ(n, a, lda, s, scond, amax, info)` | |

`poequ(n, a, lda, s, scond, amax, info)` | Computes row and column scalings to equilibrate a symmetric positive definite matrix and reduce its condition number. |

`porfs(uplo, n, nrhs, a, lda, af, ldaf, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`porfs(uplo, n, nrhs, a, lda, af, ldaf, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`porfs(uplo, n, nrhs, a, lda, af, ldaf, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`porfs(uplo, n, nrhs, a, lda, af, ldaf, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | 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. |

`posv(uplo, n, nrhs, a, lda, b, ldb, info)` | Solves a symmetric positive definite system of linear equations AX=B. |

`posv(uplo, n, nrhs, a, lda, b, ldb, info)` | |

`posv(uplo, n, nrhs, a, lda, b, ldb, info)` | |

`posv(uplo, n, nrhs, a, lda, b, ldb, info)` | |

`posvx(fact, uplo, n, nrhs, a, lda, af, ldaf, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | Solves a symmetric positive definite system of linear equations AX=B, and provides an estimate of the condition number and error bounds on the solution. |

`posvx(fact, uplo, n, nrhs, a, lda, af, ldaf, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | |

`posvx(fact, uplo, n, nrhs, a, lda, af, ldaf, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`posvx(fact, uplo, n, nrhs, a, lda, af, ldaf, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`potrf(uplo, n, a, lda, info)` | Computes the Cholesky factorization of a symmetric positive definite matrix. |

`potrf(uplo, n, a, lda, info)` | |

`potrf(uplo, n, a, lda, info)` | |

`potrf(uplo, n, a, lda, info)` | |

`potri(uplo, n, a, lda, info)` | |

`potri(uplo, n, a, lda, info)` | Computes the inverse of a symmetric positive definite matrix, using the Cholesky factorization computed by SPOTRF. |

`potri(uplo, n, a, lda, info)` | |

`potri(uplo, n, a, lda, info)` | |

`potrs(uplo, n, nrhs, a, lda, b, ldb, info)` | Solves a symmetric positive definite system of linear equations AX=B, using the Cholesky factorization computed by SPOTRF. |

`potrs(uplo, n, nrhs, a, lda, b, ldb, info)` | |

`potrs(uplo, n, nrhs, a, lda, b, ldb, info)` | |

`potrs(uplo, n, nrhs, a, lda, b, ldb, info)` | |

`ppcon(uplo, n, ap, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a symmetric positive definite matrix in packed storage, using the Cholesky factorization computed by SPPTRF. |

`ppcon(uplo, n, ap, anorm, rcond, work, iwork, info)` | |

`ppcon(uplo, n, ap, anorm, rcond, work, rwork, info)` | |

`ppcon(uplo, n, ap, anorm, rcond, work, rwork, info)` | |

`ppequ(uplo, n, ap, s, scond, amax, info)` | Computes row and column scalings to equilibrate a symmetric positive definite matrix in packed storage and reduce its condition number. |

`ppequ(uplo, n, ap, s, scond, amax, info)` | |

`ppequ(uplo, n, ap, s, scond, amax, info)` | |

`ppequ(uplo, n, ap, s, scond, amax, info)` | |

`pprfs(uplo, n, nrhs, ap, afp, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Improves the computed solution to a symmetric positive definite system of linear equations AX=B, where A is held in packed storage, and provides forward and backward error bounds for the solution. |

`pprfs(uplo, n, nrhs, ap, afp, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`pprfs(uplo, n, nrhs, ap, afp, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`pprfs(uplo, n, nrhs, ap, afp, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`ppsv(uplo, n, nrhs, ap, b, ldb, info)` | Solves a symmetric positive definite system of linear equations AX=B, where A is held in packed storage. |

`ppsv(uplo, n, nrhs, ap, b, ldb, info)` | |

`ppsv(uplo, n, nrhs, ap, b, ldb, info)` | |

`ppsv(uplo, n, nrhs, ap, b, ldb, info)` | |

`ppsvx(fact, uplo, n, nrhs, ap, afp, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | Solves a symmetric positive definite system of linear equations AX=B, where A is held in packed storage, and provides an estimate of the condition number and error bounds on the solution. |

`ppsvx(fact, uplo, n, nrhs, ap, afp, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | |

`ppsvx(fact, uplo, n, nrhs, ap, afp, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`ppsvx(fact, uplo, n, nrhs, ap, afp, equed, s, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`pptrf(uplo, n, ap, info)` | Computes the Cholesky factorization of a symmetric positive definite matrix in packed storage. |

`pptrf(uplo, n, ap, info)` | |

`pptrf(uplo, n, ap, info)` | |

`pptrf(uplo, n, ap, info)` | |

`pptri(uplo, n, ap, info)` | Computes the inverse of a symmetric positive definite matrix in packed storage, using the Cholesky factorization computed by SPPTRF. |

`pptri(uplo, n, ap, info)` | |

`pptri(uplo, n, ap, info)` | |

`pptri(uplo, n, ap, info)` | |

`pptrs(uplo, n, nrhs, ap, b, ldb, info)` | Solves a symmetric positive definite system of linear equations AX=B, where A is held in packed storage, using the Cholesky factorization computed by SPPTRF. |

`pptrs(uplo, n, nrhs, ap, b, ldb, info)` | |

`pptrs(uplo, n, nrhs, ap, b, ldb, info)` | |

`pptrs(uplo, n, nrhs, ap, b, ldb, info)` | |

`ptcon(n, d, e, anorm, rcond, work, info)` | Computes the reciprocal of the condition number of a symmetric positive definite tridiagonal matrix, using the LDL**H factorization computed by SPTTRF. |

`ptcon(n, d, e, anorm, rcond, work, info)` | |

`ptcon(n, d, e, anorm, rcond, rwork, info)` | |

`ptcon(n, d, e, anorm, rcond, rwork, info)` | |

`pteqr(compz, n, d, e, z, ldz, work, info)` | |

`pteqr(compz, n, d, e, z, ldz, work, info)` | |

`pteqr(compz, n, d, e, z, ldz, work, info)` | |

`pteqr(compz, n, d, e, z, ldz, work, info)` | Computes all eigenvalues and eigenvectors of a real symmetric positive definite tridiagonal matrix, by computing the SVD of its bidiagonal Cholesky factor. |

`ptrfs(uplo, n, nrhs, d, e, df, ef, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`ptrfs(uplo, n, nrhs, d, e, df, ef, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`ptrfs(n, nrhs, d, e, df, ef, b, ldb, x, ldx, ferr, berr, work, info)` | |

`ptrfs(n, nrhs, d, e, df, ef, b, ldb, x, ldx, ferr, berr, work, info)` | Improves the computed solution to a symmetric positive definite tridiagonal system of linear equations AX=B, and provides forward and backward error bounds for the solution. |

`ptsv(n, nrhs, d, e, b, ldb, info)` | |

`ptsv(n, nrhs, d, e, b, ldb, info)` | |

`ptsv(n, nrhs, d, e, b, ldb, info)` | |

`ptsv(n, nrhs, d, e, b, ldb, info)` | Solves a symmetric positive definite tridiagonal system of linear equations AX=B. |

`ptsvx(fact, n, nrhs, d, e, df, ef, b, ldb, x, ldx, rcond, ferr, berr, work, info)` | Solves a symmetric positive definite tridiagonal system of linear equations AX=B, and provides an estimate of the condition number and error bounds on the solution. |

`ptsvx(fact, n, nrhs, d, e, df, ef, b, ldb, x, ldx, rcond, ferr, berr, work, info)` | |

`ptsvx(fact, n, nrhs, d, e, df, ef, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`ptsvx(fact, n, nrhs, d, e, df, ef, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`pttrf(n, d, e, info)` | |

`pttrf(n, d, e, info)` | |

`pttrf(n, d, e, info)` | |

`pttrf(n, d, e, info)` | Computes the LDL**H factorization of a symmetric positive definite tridiagonal matrix. |

`pttrs(uplo, n, nrhs, d, e, b, ldb, info)` | |

`pttrs(uplo, n, nrhs, d, e, b, ldb, info)` | |

`pttrs(n, nrhs, d, e, b, ldb, info)` | |

`pttrs(n, nrhs, d, e, b, ldb, info)` | Solves a symmetric positive definite tridiagonal system of linear equations, using the LDL**H factorization computed by SPTTRF. |

`sbev(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, info)` | |

`sbev(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric band matrix. |

`sbevd(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, lwork, iwork, liwork, info)` | |

`sbevd(jobz, uplo, n, kd, ab, ldab, w, z, ldz, work, lwork, iwork, liwork, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric band matrix. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`sbevx(jobz, range, uplo, n, kd, ab, ldab, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | |

`sbevx(jobz, range, uplo, n, kd, ab, ldab, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | Computes selected eigenvalues and eigenvectors of a symmetric band matrix. |

`sbgst(vect, uplo, n, ka, kb, ab, ldab, bb, ldbb, x, ldx, work, info)` | |

`sbgst(vect, uplo, n, ka, kb, ab, ldab, bb, ldbb, x, ldx, work, info)` | Reduces a real symmetric-definite banded generalized eigenproblem A x = lambda B x to standard form, where B has been factorized by SPBSTF (Crawford's algorithm). |

`sbgv(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, info)` | Computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x. A and B are assumed to be symmetric and banded, and B is also positive definite. |

`sbgv(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, info)` | |

`sbgvd(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, lwork, iwork, liwork, info)` | |

`sbgvd(jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, lwork, iwork, liwork, info)` | Computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x. A and B are assumed to be symmetric and banded, and B is also positive definite. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`sbgvx(jobz, range, uplo, n, ka, kb, ab, ldab, bb, ldbb, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | |

`sbgvx(jobz, range, uplo, n, ka, kb, ab, ldab, bb, ldbb, q, ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | Computes selected eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x. A and B are assumed to be symmetric and banded, and B is also positive definite. |

`sbtrd(vect, uplo, n, kd, ab, ldab, d, e, q, ldq, work, info)` | |

`sbtrd(vect, uplo, n, kd, ab, ldab, d, e, q, ldq, work, info)` | Reduces a symmetric band matrix to real symmetric tridiagonal form by an orthogonal similarity transformation. |

`slamch(cmach)` | |

`spcon(uplo, n, ap, ipiv, anorm, rcond, work, info)` | |

`spcon(uplo, n, ap, ipiv, anorm, rcond, work, info)` | |

`spcon(uplo, n, ap, ipiv, anorm, rcond, work, iwork, info)` | |

`spcon(uplo, n, ap, ipiv, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a real symmetric indefinite matrix in packed storage, using the factorization computed by SSPTRF. |

`spev(jobz, uplo, n, ap, w, z, ldz, work, info)` | |

`spev(jobz, uplo, n, ap, w, z, ldz, work, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric matrix in packed storage. |

`spevd(jobz, uplo, n, ap, w, z, ldz, work, lwork, iwork, liwork, info)` | |

`spevd(jobz, uplo, n, ap, w, z, ldz, work, lwork, iwork, liwork, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric matrix in packed storage. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`spevx(jobz, range, uplo, n, ap, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | |

`spevx(jobz, range, uplo, n, ap, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | Computes selected eigenvalues and eigenvectors of a symmetric matrix in packed storage. |

`spgst(itype, uplo, n, ap, bp, info)` | |

`spgst(itype, uplo, n, ap, bp, info)` | Reduces a symmetric-definite generalized eigenproblem Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, to standard form, where A and B are held in packed storage, and B has been factorized by SPPTRF. |

`spgv(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, info)` | Computes all eigenvalues and eigenvectors of a generalized symmetric-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, where A and B are in packed storage. |

`spgv(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, info)` | |

`spgvd(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, lwork, iwork, liwork, info)` | Computes all eigenvalues and eigenvectors of a generalized symmetric-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, where A and B are in packed storage. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`spgvd(itype, jobz, uplo, n, ap, bp, w, z, ldz, work, lwork, iwork, liwork, info)` | |

`spgvx(itype, jobz, range, uplo, n, ap, bp, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | |

`spgvx(itype, jobz, range, uplo, n, ap, bp, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | Computes selected eigenvalues, and optionally, eigenvectors of a generalized symmetric-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, where A and B are in packed storage. |

`sprfs(uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`sprfs(uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`sprfs(uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`sprfs(uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Improves the computed solution to a real symmetric indefinite system of linear equations AX=B, where A is held in packed storage, and provides forward and backward error bounds for the solution. |

`spsv(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`spsv(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`spsv(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`spsv(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | Solves a real symmetric indefinite system of linear equations AX=B, where A is held in packed storage. |

`spsvx(fact, uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | |

`spsvx(fact, uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`spsvx(fact, uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, rwork, info)` | |

`spsvx(fact, uplo, n, nrhs, ap, afp, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, iwork, info)` | Solves a real symmetric indefinite system of linear equations AX=B, where A is held in packed storage, and provides an estimate of the condition number and error bounds on the solution. |

`sptrd(uplo, n, ap, d, e, tau, info)` | Reduces a symmetric matrix in packed storage to real symmetric tridiagonal form by an orthogonal similarity transformation. |

`sptrd(uplo, n, ap, d, e, tau, info)` | |

`sptrf(uplo, n, ap, ipiv, info)` | Computes the factorization of a real symmetric-indefinite matrix in packed storage, using the diagonal pivoting method. |

`sptrf(uplo, n, ap, ipiv, info)` | |

`sptrf(uplo, n, ap, ipiv, info)` | |

`sptrf(uplo, n, ap, ipiv, info)` | |

`sptri(uplo, n, ap, ipiv, work, info)` | Computes the inverse of a real symmetric indefinite matrix in packed storage, using the factorization computed by SSPTRF. |

`sptri(uplo, n, ap, ipiv, work, info)` | |

`sptri(uplo, n, ap, ipiv, work, info)` | |

`sptri(uplo, n, ap, ipiv, work, info)` | |

`sptrs(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`sptrs(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`sptrs(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | Solves a real symmetric indefinite system of linear equations AX=B, where A is held in packed storage, using the factorization computed by SSPTRF. |

`sptrs(uplo, n, nrhs, ap, ipiv, b, ldb, info)` | |

`stebz(range, order, n, vl, vu, il, iu, abstol, d, e, m, nsplit, w, iblock, isplit, work, iwork, info)` | |

`stebz(range, order, n, vl, vu, il, iu, abstol, d, e, m, nsplit, w, iblock, isplit, work, iwork, info)` | Computes selected eigenvalues of a real symmetric tridiagonal matrix by bisection. |

`stedc(compz, n, d, e, z, ldz, work, lwork, iwork, liwork, info)` | |

`stedc(compz, n, d, e, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`stedc(compz, n, d, e, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)` | |

`stedc(compz, n, d, e, z, ldz, work, lwork, iwork, liwork, info)` | Computes all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer algorithm. |

`stegr(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | Computes selected eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix. The eigenvalues are computed by the dqds algorithm, while eigenvectors are computed from various "good" LDL^T representations (also known as Relatively Robust Representations.) |

`stegr(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | |

`stegr(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | |

`stegr(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | |

`stein(n, d, e, m, w, iblock, isplit, z, ldz, work, iwork, ifail, info)` | Computes selected eigenvectors of a real symmetric tridiagonal matrix by inverse iteration. |

`stein(n, d, e, m, w, iblock, isplit, z, ldz, work, iwork, ifail, info)` | |

`stein(n, d, e, m, w, iblock, isplit, z, ldz, work, iwork, ifail, info)` | |

`stein(n, d, e, m, w, iblock, isplit, z, ldz, work, iwork, ifail, info)` | |

`steqr(compz, n, d, e, z, ldz, work, info)` | Computes all eigenvalues and eigenvectors of a real symmetric tridiagonal matrix, using the implicit QL or QR algorithm. |

`steqr(compz, n, d, e, z, ldz, work, info)` | |

`steqr(compz, n, d, e, z, ldz, work, info)` | |

`steqr(compz, n, d, e, z, ldz, work, info)` | |

`sterf(n, d, e, info)` | Computes all eigenvalues of a real symmetric tridiagonal matrix, using a root-free variant of the QL or QR algorithm. |

`sterf(n, d, e, info)` | |

`stev(jobz, n, d, e, z, ldz, work, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric tridiagonal matrix. |

`stev(jobz, n, d, e, z, ldz, work, info)` | |

`stevd(jobz, n, d, e, z, ldz, work, lwork, iwork, liwork, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric tridiagonal matrix. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`stevd(jobz, n, d, e, z, ldz, work, lwork, iwork, liwork, info)` | |

`stevr(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | Computes selected eigenvalues, and optionally, eigenvectors of a real symmetric tridiagonal matrix. Eigenvalues are computed by the dqds algorithm, and eigenvectors are computed from various "good" LDL^T representations (also known as Relatively Robust Representations). |

`stevr(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | |

`stevx(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | Computes selected eigenvalues and eigenvectors of a real symmetric tridiagonal matrix. |

`stevx(jobz, range, n, d, e, vl, vu, il, iu, abstol, m, w, z, ldz, work, iwork, ifail, info)` | |

`sycon(uplo, n, a, lda, ipiv, anorm, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a real symmetric indefinite matrix, using the factorization computed by SSYTRF. |

`sycon(uplo, n, a, lda, ipiv, anorm, rcond, work, iwork, info)` | |

`sycon(uplo, n, a, lda, ipiv, anorm, rcond, work, info)` | |

`sycon(uplo, n, a, lda, ipiv, anorm, rcond, work, info)` | |

`syev(jobz, uplo, n, a, lda, w, work, lwork, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric matrix. |

`syev(jobz, uplo, n, a, lda, w, work, lwork, info)` | |

`syevd(jobz, uplo, n, a, lda, w, work, lwork, iwork, liwork, info)` | Computes all eigenvalues, and optionally, eigenvectors of a real symmetric matrix. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`syevd(jobz, uplo, n, a, lda, w, work, lwork, iwork, liwork, info)` | |

`syevr(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | |

`syevr(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, isuppz, work, lwork, iwork, liwork, info)` | Computes selected eigenvalues, and optionally, eigenvectors of a real symmetric matrix. Eigenvalues are computed by the dqds algorithm, and eigenvectors are computed from various "good" LDL^T representations (also known as Relatively Robust Representations). |

`syevx(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, iwork, ifail, info)` | |

`syevx(jobz, range, uplo, n, a, lda, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, iwork, ifail, info)` | Computes selected eigenvalues and eigenvectors of a symmetric matrix. |

`sygst(itype, uplo, n, a, lda, b, ldb, info)` | Reduces a symmetric-definite generalized eigenproblem Ax= lambda Bx, ABx= lambda x, or BAx= lambda x, to standard form, where B has been factorized by SPOTRF. |

`sygst(itype, uplo, n, a, lda, b, ldb, info)` | |

`sygv(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, info)` | |

`sygv(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, info)` | Computes all eigenvalues and the eigenvectors of a generalized symmetric-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x. |

`sygvd(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, iwork, liwork, info)` | Computes all eigenvalues and the eigenvectors of a generalized symmetric-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x. If eigenvectors are desired, it uses a divide and conquer algorithm. |

`sygvd(itype, jobz, uplo, n, a, lda, b, ldb, w, work, lwork, iwork, liwork, info)` | |

`sygvx(itype, jobz, range, uplo, n, a, lda, b, ldb, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, iwork, ifail, info)` | Computes selected eigenvalues, and optionally, the eigenvectors of a generalized symmetric-definite generalized eigenproblem, Ax= lambda Bx, ABx= lambda x, or BAx= lambda x. |

`sygvx(itype, jobz, range, uplo, n, a, lda, b, ldb, vl, vu, il, iu, abstol, m, w, z, ldz, work, lwork, iwork, ifail, info)` | |

`syrfs(uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`syrfs(uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`syrfs(uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`syrfs(uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Improves the computed solution to a real symmetric indefinite system of linear equations AX=B, and provides forward and backward error bounds for the solution. |

`sysv(uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork, info)` | Solves a real symmetric indefinite system of linear equations AX=B. |

`sysv(uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork, info)` | |

`sysv(uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork, info)` | |

`sysv(uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork, info)` | |

`sysvx(fact, uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, lwork, rwork, info)` | |

`sysvx(fact, uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, lwork, rwork, info)` | |

`sysvx(fact, uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, lwork, iwork, info)` | Solves a real symmetric indefinite system of linear equations AX=B, and provides an estimate of the condition number and error bounds on the solution. |

`sysvx(fact, uplo, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, rcond, ferr, berr, work, lwork, iwork, info)` | |

`sytrd(uplo, n, a, lda, d, e, tau, work, lwork, info)` | Reduces a symmetric matrix to real symmetric tridiagonal form by an orthogonal similarity transformation. |

`sytrd(uplo, n, a, lda, d, e, tau, work, lwork, info)` | |

`sytrf(uplo, n, a, lda, ipiv, work, lwork, info)` | Computes the factorization of a real symmetric-indefinite matrix, using the diagonal pivoting method. |

`sytrf(uplo, n, a, lda, ipiv, work, lwork, info)` | |

`sytrf(uplo, n, a, lda, ipiv, work, lwork, info)` | |

`sytrf(uplo, n, a, lda, ipiv, work, lwork, info)` | |

`sytri(uplo, n, a, lda, ipiv, work, info)` | Computes the inverse of a real symmetric indefinite matrix, using the factorization computed by SSYTRF. |

`sytri(uplo, n, a, lda, ipiv, work, info)` | |

`sytri(uplo, n, a, lda, ipiv, work, info)` | |

`sytri(uplo, n, a, lda, ipiv, work, info)` | |

`sytrs(uplo, n, nrhs, a, lda, ipiv, b, ldb, info)` | Solves a real symmetric indefinite system of linear equations AX=B, using the factorization computed by SSPTRF. |

`sytrs(uplo, n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`sytrs(uplo, n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`sytrs(uplo, n, nrhs, a, lda, ipiv, b, ldb, info)` | |

`tbcon(norm, uplo, diag, n, kd, ab, ldab, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a triangular band matrix, in either the 1-norm or the infinity-norm. |

`tbcon(norm, uplo, diag, n, kd, ab, ldab, rcond, work, iwork, info)` | |

`tbcon(norm, uplo, diag, n, kd, ab, ldab, rcond, work, rwork, info)` | |

`tbcon(norm, uplo, diag, n, kd, ab, ldab, rcond, work, rwork, info)` | |

`tbrfs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Provides forward and backward error bounds for the solution of a triangular banded system of linear equations AX=B, A**T X=B or A**H X=B. |

`tbrfs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`tbrfs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`tbrfs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`tbtrs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, info)` | Solves a triangular banded system of linear equations AX=B, A**T X=B or A**H X=B. |

`tbtrs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`tbtrs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`tbtrs(uplo, trans, diag, n, kd, nrhs, ab, ldab, b, ldb, info)` | |

`tgevc(side, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, mm, m, work, info)` | Computes some or all of the right and/or left generalized eigenvectors of a pair of upper triangular matrices. |

`tgevc(side, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, mm, m, work, info)` | |

`tgevc(side, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, mm, m, work, rwork, info)` | |

`tgevc(side, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, mm, m, work, rwork, info)` | |

`tgexc(wantq, wantz, n, a, lda, b, ldb, q, ldq, z, ldz, ifst, ilst, work, lwork, info)` | Reorders the generalized real Schur decomposition of a real matrix pair (A,B) using an orthogonal equivalence transformation so that the diagonal block of (A,B) with row index IFST is moved to row ILST. |

`tgexc(wantq, wantz, n, a, lda, b, ldb, q, ldq, z, ldz, ifst, ilst, work, lwork, info)` | |

`tgexc(wantq, wantz, n, a, lda, b, ldb, q, ldq, z, ldz, ifst, ilst, info)` | |

`tgexc(wantq, wantz, n, a, lda, b, ldb, q, ldq, z, ldz, ifst, ilst, info)` | |

`tgsen(ijob, wantq, wantz, select, n, a, lda, b, ldb, alphar, alphai, betav, q, ldq, z, ldz, m, pl, pr, dif, work, lwork, iwork, liwork, info)` | Reorders the generalized real Schur decomposition of a real matrix pair (A, B) so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix A and the upper triangular B. |

`tgsen(ijob, wantq, wantz, select, n, a, lda, b, ldb, alphar, alphai, betav, q, ldq, z, ldz, m, pl, pr, dif, work, lwork, iwork, liwork, info)` | |

`tgsen(ijob, wantq, wantz, select, n, a, lda, b, ldb, alphav, betav, q, ldq, z, ldz, m, pl, pr, dif, work, lwork, iwork, liwork, info)` | |

`tgsen(ijob, wantq, wantz, select, n, a, lda, b, ldb, alphav, betav, q, ldq, z, ldz, m, pl, pr, dif, work, lwork, iwork, liwork, info)` | |

`tgsja(jobu, jobv, jobq, m, p, n, k, l, a, lda, b, ldb, tola, tolb, alphav, betav, u, ldu, v, ldv, q, ldq, work, ncycle, info)` | |

`tgsja(jobu, jobv, jobq, m, p, n, k, l, a, lda, b, ldb, tola, tolb, alphav, betav, u, ldu, v, ldv, q, ldq, work, ncycle, info)` | Computes the generalized singular value decomposition of two real upper triangular (or trapezoidal) matrices as output by SGGSVP. |

`tgsja(jobu, jobv, jobq, m, p, n, k, l, a, lda, b, ldb, tola, tolb, alphav, betav, u, ldu, v, ldv, q, ldq, work, ncycle, info)` | |

`tgsja(jobu, jobv, jobq, m, p, n, k, l, a, lda, b, ldb, tola, tolb, alphav, betav, u, ldu, v, ldv, q, ldq, work, ncycle, info)` | |

`tgsna(job, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, s, dif, mm, m, work, lwork, iwork, info)` | Estimates reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a matrix pair (A, B) in generalized real Schur canonical form, as returned by SGGES. |

`tgsna(job, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, s, dif, mm, m, work, lwork, iwork, info)` | |

`tgsna(job, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, s, dif, mm, m, work, lwork, iwork, info)` | |

`tgsna(job, howmny, select, n, a, lda, b, ldb, vl, ldvl, vr, ldvr, s, dif, mm, m, work, lwork, iwork, info)` | |

`tgsyl(trans, ijob, m, n, a, lda, b, ldb, c, ldc, d, ldd, e, lde, f, ldf, scale, dif, work, lwork, iwork, info)` | Solves the generalized Sylvester equation. |

`tgsyl(trans, ijob, m, n, a, lda, b, ldb, c, ldc, d, ldd, e, lde, f, ldf, scale, dif, work, lwork, iwork, info)` | |

`tgsyl(trans, ijob, m, n, a, lda, b, ldb, c, ldc, d, ldd, e, lde, f, ldf, scale, dif, work, lwork, iwork, info)` | |

`tgsyl(trans, ijob, m, n, a, lda, b, ldb, c, ldc, d, ldd, e, lde, f, ldf, scale, dif, work, lwork, iwork, info)` | |

`tpcon(norm, uplo, diag, n, ap, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a triangular matrix in packed storage, in either the 1-norm or the infinity-norm. |

`tpcon(norm, uplo, diag, n, ap, rcond, work, iwork, info)` | |

`tpcon(norm, uplo, diag, n, ap, rcond, work, rwork, info)` | |

`tpcon(norm, uplo, diag, n, ap, rcond, work, rwork, info)` | |

`tprfs(uplo, trans, diag, n, nrhs, ap, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Provides forward and backward error bounds for the solution of a triangular system of linear equations AX=B, A**T X=B or A**H X=B, where A is held in packed storage. |

`tprfs(uplo, trans, diag, n, nrhs, ap, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`tprfs(uplo, trans, diag, n, nrhs, ap, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`tprfs(uplo, trans, diag, n, nrhs, ap, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`tptri(uplo, diag, n, ap, info)` | Computes the inverse of a triangular matrix in packed storage. |

`tptri(uplo, diag, n, ap, info)` | |

`tptri(uplo, diag, n, ap, info)` | |

`tptri(uplo, diag, n, ap, info)` | |

`tptrs(uplo, trans, diag, n, nrhs, ap, b, ldb, info)` | Solves a triangular system of linear equations AX=B, A**T X=B or A**H X=B, where A is held in packed storage. |

`tptrs(uplo, trans, diag, n, nrhs, ap, b, ldb, info)` | |

`tptrs(uplo, trans, diag, n, nrhs, ap, b, ldb, info)` | |

`tptrs(uplo, trans, diag, n, nrhs, ap, b, ldb, info)` | |

`trcon(norm, uplo, diag, n, a, lda, rcond, work, iwork, info)` | Estimates the reciprocal of the condition number of a triangular matrix, in either the 1-norm or the infinity-norm. |

`trcon(norm, uplo, diag, n, a, lda, rcond, work, iwork, info)` | |

`trcon(norm, uplo, diag, n, a, lda, rcond, work, rwork, info)` | |

`trcon(norm, uplo, diag, n, a, lda, rcond, work, rwork, info)` | |

`trevc(side, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, mm, m, work, info)` | Computes some or all of the right and/or left eigenvectors of an upper quasi-triangular matrix. |

`trevc(side, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, mm, m, work, info)` | |

`trevc(side, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, mm, m, work, rwork, info)` | |

`trevc(side, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, mm, m, work, rwork, info)` | |

`trexc(compq, n, t, ldt, q, ldq, ifst, ilst, work, info)` | Reorders the Schur factorization of a matrix by an orthogonal similarity transformation. |

`trexc(compq, n, t, ldt, q, ldq, ifst, ilst, work, info)` | |

`trexc(compq, n, t, ldt, q, ldq, ifst, ilst, info)` | |

`trexc(compq, n, t, ldt, q, ldq, ifst, ilst, info)` | |

`trrfs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`trrfs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, x, ldx, ferr, berr, work, rwork, info)` | |

`trrfs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | Provides forward and backward error bounds for the solution of a triangular system of linear equations A X=B, A**T X=B or A**H X=B. |

`trrfs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, x, ldx, ferr, berr, work, iwork, info)` | |

`trsen(job, compq, select, n, t, ldt, q, ldq, w, m, s, sep, work, lwork, info)` | |

`trsen(job, compq, select, n, t, ldt, q, ldq, w, m, s, sep, work, lwork, info)` | |

`trsen(job, compq, select, n, t, ldt, q, ldq, wr, wi, m, s, sep, work, lwork, iwork, liwork, info)` | |

`trsen(job, compq, select, n, t, ldt, q, ldq, wr, wi, m, s, sep, work, lwork, iwork, liwork, info)` | Reorders the Schur factorization of a matrix in order to find an orthonormal basis of a right invariant subspace corresponding to selected eigenvalues, and returns reciprocal condition numbers (sensitivities) of the average of the cluster of eigenvalues and of the invariant subspace. |

`trsna(job, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, s, sep, mm, m, work, ldwork, rwork, info)` | |

`trsna(job, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, s, sep, mm, m, work, ldwork, rwork, info)` | |

`trsna(job, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, s, sep, mm, m, work, ldwork, iwork, info)` | |

`trsna(job, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr, s, sep, mm, m, work, ldwork, iwork, info)` | Estimates the reciprocal condition numbers (sensitivities) of selected eigenvalues and eigenvectors of an upper quasi-triangular matrix. |

`trsyl(trana, tranb, isgn, m, n, a, lda, b, ldb, c, ldc, scale, info)` | |

`trsyl(trana, tranb, isgn, m, n, a, lda, b, ldb, c, ldc, scale, info)` | |

`trsyl(trana, tranb, isgn, m, n, a, lda, b, ldb, c, ldc, scale, info)` | |

`trsyl(trana, tranb, isgn, m, n, a, lda, b, ldb, c, ldc, scale, info)` | Solves the Sylvester matrix equation A X +/- X B=C where A and B are upper quasi-triangular, and may be transposed. |

`trtri(uplo, diag, n, a, lda, info)` | |

`trtri(uplo, diag, n, a, lda, info)` | |

`trtri(uplo, diag, n, a, lda, info)` | |

`trtri(uplo, diag, n, a, lda, info)` | Computes the inverse of a triangular matrix. |

`trtrs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, info)` | |

`trtrs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, info)` | |

`trtrs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, info)` | |

`trtrs(uplo, trans, diag, n, nrhs, a, lda, b, ldb, info)` | Solves a triangular system of linear equations AX=B, A**T X=B or A**H X=B. |

`tzrqf(m, n, a, lda, tau, info)` | |

`tzrqf(m, n, a, lda, tau, info)` | |

`tzrqf(m, n, a, lda, tau, info)` | |

`tzrqf(m, n, a, lda, tau, info)` | Computes an RQ factorization of an upper trapezoidal matrix. |

`tzrzf(m, n, a, lda, tau, work, lwork, info)` | |

`tzrzf(m, n, a, lda, tau, work, lwork, info)` | |

`tzrzf(m, n, a, lda, tau, work, lwork, info)` | |

`tzrzf(m, n, a, lda, tau, work, lwork, info)` | Computes an RZ factorization of an upper trapezoidal matrix (blocked version of STZRQF). |

`ungbr(vect, m, n, k, a, lda, tau, work, lwork, info)` | |

`ungbr(vect, m, n, k, a, lda, tau, work, lwork, info)` | Generates the unitary transformation matrices from a reduction to bidiagonal form determined by CGEBRD. |

`unghr(n, ilo, ihi, a, lda, tau, work, lwork, info)` | |

`unghr(n, ilo, ihi, a, lda, tau, work, lwork, info)` | Generates the unitary transformation matrix from a reduction to Hessenberg form determined by CGEHRD. |

`unglq(m, n, k, a, lda, tau, work, lwork, info)` | |

`unglq(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the unitary matrix Q from an LQ factorization determined by CGELQF. |

`ungql(m, n, k, a, lda, tau, work, lwork, info)` | |

`ungql(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the unitary matrix Q from a QL factorization determined by CGEQLF. |

`ungqr(m, n, k, a, lda, tau, work, lwork, info)` | |

`ungqr(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the unitary matrix Q from a QR factorization determined by CGEQRF. |

`ungrq(m, n, k, a, lda, tau, work, lwork, info)` | Generates all or part of the unitary matrix Q from an RQ factorization determined by CGERQF. |

`ungrq(m, n, k, a, lda, tau, work, lwork, info)` | |

`ungtr(uplo, n, a, lda, tau, work, lwork, info)` | Generates the unitary transformation matrix from a reduction to tridiagonal form determined by CHETRD. |

`ungtr(uplo, n, a, lda, tau, work, lwork, info)` | |

`unmbr(vect, side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by one of the unitary transformation matrices from a reduction to bidiagonal form determined by CGEBRD. |

`unmbr(vect, side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`unmhr(side, trans, m, n, ilo, ihi, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the unitary transformation matrix from a reduction to Hessenberg form determined by CGEHRD. |

`unmhr(side, trans, m, n, ilo, ihi, a, lda, tau, c, ldc, work, lwork, info)` | |

`unmlq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the unitary matrix from an LQ factorization determined by CGELQF. |

`unmlq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`unmql(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the unitary matrix from a QL factorization determined by CGEQLF. |

`unmql(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`unmqr(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the unitary matrix from a QR factorization determined by CGEQRF. |

`unmqr(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`unmr3(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, info)` | Multiples a general matrix by the unitary matrix from an RZ factorization determined by CTZRZF. |

`unmr3(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, info)` | |

`unmrq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the unitary matrix from an RQ factorization determined by CGERQF. |

`unmrq(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)` | |

`unmrz(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, lwork, info)` | Multiples a general matrix by the unitary matrix from an RZ factorization determined by CTZRZF. |

`unmrz(side, trans, m, n, k, l, a, lda, tau, c, ldc, work, lwork, info)` | |

`unmtr(side, uplo, trans, m, n, a, lda, tau, c, ldc, work, lwork, info)` | Multiplies a general matrix by the unitary transformation matrix from a reduction to tridiagonal form determined by CHETRD. |

`unmtr(side, uplo, trans, m, n, a, lda, tau, c, ldc, work, lwork, info)` | |

`upgtr(uplo, n, ap, tau, q, ldq, work, info)` | Generates the unitary transformation matrix from a reduction to tridiagonal form determined by CHPTRD. |

`upgtr(uplo, n, ap, tau, q, ldq, work, info)` | |

`upmtr(side, uplo, trans, m, n, ap, tau, c, ldc, work, info)` | Multiplies a general matrix by the unitary transformation matrix from a reduction to tridiagonal form determined by CHPTRD. |

`upmtr(side, uplo, trans, m, n, ap, tau, c, ldc, work, info)` |