| D02KDF
| Second-order Sturm–Liouville problem, regular/singular system, finite/infinite range, eigenvalue only, user-specified break-points |
| D02KEF
| Second-order Sturm–Liouville problem, regular/singular system, finite/infinite range, eigenvalue and eigenfunction, user-specified break-points |
| D05BDF
| Nonlinear convolution Volterra–Abel equation, second kind, weakly singular |
| D05BEF
| Nonlinear convolution Volterra–Abel equation, first kind, weakly singular |
| D05BYF
| Generate weights for use in solving weakly singular Abel-type equations |
| F02WDF
| factorization, possibly followed by SVD |
| F02WGF
| Computes leading terms in the singular value decomposition of a real general matrix; also computes corresponding left and right singular vectors |
| F02WUF
| SVD of real upper triangular matrix (Black Box) |
| F02XUF
| SVD of complex upper triangular matrix (Black Box) |
| F08KAF
| Computes the minimum-norm solution to a real linear least squares problem using singular value decomposition |
| F08KBF
| Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors |
| F08KCF
| Computes the minimum-norm solution to a real linear least squares problem using singular value decomposition (divide-and-conquer) |
| F08KDF
| Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors (divide-and-conquer) |
| F08KHF
| Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors (preconditioned Jacobi) |
| F08KJF
| Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors (fast Jacobi) |
| F08KNF
| Computes the minimum-norm solution to a complex linear least squares problem using singular value decomposition |
| F08KPF
| Computes the singular value decomposition of a complex matrix, optionally computing the left and/or right singular vectors |
| F08KQF
| Computes the minimum-norm solution to a complex linear least squares problem using singular value decomposition (divide-and-conquer) |
| F08KRF
| Computes the singular value decomposition of a complex matrix, optionally computing the left and/or right singular vectors (divide-and-conquer) |
| F08MDF
| Computes the singular value decomposition of a real bidiagonal matrix, optionally computing the singular vectors (divide-and-conquer) |
| F08MEF
| SVD of real bidiagonal matrix reduced from real general matrix |
| F08MSF
| SVD of real bidiagonal matrix reduced from complex general matrix |
| F08VAF
| Computes the generalized singular value decomposition of a real matrix pair |
| F08VEF
| Computes orthogonal matrices as processing steps for computing the generalized singular value decomposition of a real matrix pair |
| F08VNF
| Computes the generalized singular value decomposition of a complex matrix pair |
| F08VSF
| Computes orthogonal matrices as processing steps for computing the generalized singular value decomposition of a complex matrix pair |
| F08YEF
| Computes the generalized singular value decomposition of a real upper triangular (or trapezoidal) matrix pair |
| F08YSF
| Computes the generalized singular value decomposition of a complex upper triangular (or trapezoidal) matrix pair |