![]() |
LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
|
Functions | |
subroutine | cgelqt (m, n, mb, a, lda, t, ldt, work, info) |
CGELQT | |
recursive subroutine | cgelqt3 (m, n, a, lda, t, ldt, info) |
CGELQT3 | |
subroutine | cgemlqt (side, trans, m, n, k, mb, v, ldv, t, ldt, c, ldc, work, info) |
CGEMLQT | |
subroutine | dgeqpf (m, n, a, lda, jpvt, tau, work, info) |
DGEQPF | |
subroutine | dgebak (job, side, n, ilo, ihi, scale, m, v, ldv, info) |
DGEBAK | |
subroutine | dgebal (job, n, a, lda, ilo, ihi, scale, info) |
DGEBAL | |
subroutine | dgebd2 (m, n, a, lda, d, e, tauq, taup, work, info) |
DGEBD2 reduces a general matrix to bidiagonal form using an unblocked algorithm. | |
subroutine | dgebrd (m, n, a, lda, d, e, tauq, taup, work, lwork, info) |
DGEBRD | |
subroutine | dgecon (norm, n, a, lda, anorm, rcond, work, iwork, info) |
DGECON | |
subroutine | dgeequ (m, n, a, lda, r, c, rowcnd, colcnd, amax, info) |
DGEEQU | |
subroutine | dgeequb (m, n, a, lda, r, c, rowcnd, colcnd, amax, info) |
DGEEQUB | |
subroutine | dgehd2 (n, ilo, ihi, a, lda, tau, work, info) |
DGEHD2 reduces a general square matrix to upper Hessenberg form using an unblocked algorithm. | |
subroutine | dgehrd (n, ilo, ihi, a, lda, tau, work, lwork, info) |
DGEHRD | |
subroutine | dgelq2 (m, n, a, lda, tau, work, info) |
DGELQ2 computes the LQ factorization of a general rectangular matrix using an unblocked algorithm. | |
subroutine | dgelqf (m, n, a, lda, tau, work, lwork, info) |
DGELQF | |
subroutine | dgelqt (m, n, mb, a, lda, t, ldt, work, info) |
DGELQT | |
recursive subroutine | dgelqt3 (m, n, a, lda, t, ldt, info) |
DGELQT3 recursively computes a LQ factorization of a general real or complex matrix using the compact WY representation of Q. | |
subroutine | dgemlqt (side, trans, m, n, k, mb, v, ldv, t, ldt, c, ldc, work, info) |
DGEMLQT | |
subroutine | dgemqrt (side, trans, m, n, k, nb, v, ldv, t, ldt, c, ldc, work, info) |
DGEMQRT | |
subroutine | dgeql2 (m, n, a, lda, tau, work, info) |
DGEQL2 computes the QL factorization of a general rectangular matrix using an unblocked algorithm. | |
subroutine | dgeqlf (m, n, a, lda, tau, work, lwork, info) |
DGEQLF | |
subroutine | dgeqp3 (m, n, a, lda, jpvt, tau, work, lwork, info) |
DGEQP3 | |
subroutine | dgeqr2 (m, n, a, lda, tau, work, info) |
DGEQR2 computes the QR factorization of a general rectangular matrix using an unblocked algorithm. | |
subroutine | dgeqr2p (m, n, a, lda, tau, work, info) |
DGEQR2P computes the QR factorization of a general rectangular matrix with non-negative diagonal elements using an unblocked algorithm. | |
subroutine | dgeqrf (m, n, a, lda, tau, work, lwork, info) |
DGEQRF | |
subroutine | dgeqrfp (m, n, a, lda, tau, work, lwork, info) |
DGEQRFP | |
subroutine | dgeqrt (m, n, nb, a, lda, t, ldt, work, info) |
DGEQRT | |
subroutine | dgeqrt2 (m, n, a, lda, t, ldt, info) |
DGEQRT2 computes a QR factorization of a general real or complex matrix using the compact WY representation of Q. | |
recursive subroutine | dgeqrt3 (m, n, a, lda, t, ldt, info) |
DGEQRT3 recursively computes a QR factorization of a general real or complex matrix using the compact WY representation of Q. | |
subroutine | dgerfs (trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, iwork, info) |
DGERFS | |
subroutine | dgerfsx (trans, equed, n, nrhs, a, lda, af, ldaf, ipiv, r, c, b, ldb, x, ldx, rcond, berr, n_err_bnds, err_bnds_norm, err_bnds_comp, nparams, params, work, iwork, info) |
DGERFSX | |
subroutine | dgerq2 (m, n, a, lda, tau, work, info) |
DGERQ2 computes the RQ factorization of a general rectangular matrix using an unblocked algorithm. | |
subroutine | dgerqf (m, n, a, lda, tau, work, lwork, info) |
DGERQF | |
subroutine | dgesvj (joba, jobu, jobv, m, n, a, lda, sva, mv, v, ldv, work, lwork, info) |
DGESVJ | |
subroutine | dgetf2 (m, n, a, lda, ipiv, info) |
DGETF2 computes the LU factorization of a general m-by-n matrix using partial pivoting with row interchanges (unblocked algorithm). | |
subroutine | dgetrf (m, n, a, lda, ipiv, info) |
DGETRF | |
recursive subroutine | dgetrf2 (m, n, a, lda, ipiv, info) |
DGETRF2 | |
subroutine | dgetri (n, a, lda, ipiv, work, lwork, info) |
DGETRI | |
subroutine | dgetrs (trans, n, nrhs, a, lda, ipiv, b, ldb, info) |
DGETRS | |
subroutine | dhgeqz (job, compq, compz, n, ilo, ihi, h, ldh, t, ldt, alphar, alphai, beta, q, ldq, z, ldz, work, lwork, info) |
DHGEQZ | |
subroutine | dla_geamv (trans, m, n, alpha, a, lda, x, incx, beta, y, incy) |
DLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. | |
double precision function | dla_gercond (trans, n, a, lda, af, ldaf, ipiv, cmode, c, info, work, iwork) |
DLA_GERCOND estimates the Skeel condition number for a general matrix. | |
subroutine | dla_gerfsx_extended (prec_type, trans_type, n, nrhs, a, lda, af, ldaf, ipiv, colequ, c, b, ldb, y, ldy, berr_out, n_norms, errs_n, errs_c, res, ayb, dy, y_tail, rcond, ithresh, rthresh, dz_ub, ignore_cwise, info) |
DLA_GERFSX_EXTENDED improves the computed solution to a system of linear equations for general matrices by performing extra-precise iterative refinement and provides error bounds and backward error estimates for the solution. | |
double precision function | dla_gerpvgrw (n, ncols, a, lda, af, ldaf) |
DLA_GERPVGRW | |
subroutine | dlaorhr_col_getrfnp (m, n, a, lda, d, info) |
DLAORHR_COL_GETRFNP | |
recursive subroutine | dlaorhr_col_getrfnp2 (m, n, a, lda, d, info) |
DLAORHR_COL_GETRFNP2 | |
recursive subroutine | dlaqz0 (wants, wantq, wantz, n, ilo, ihi, a, lda, b, ldb, alphar, alphai, beta, q, ldq, z, ldz, work, lwork, rec, info) |
DLAQZ0 | |
subroutine | dlaqz1 (a, lda, b, ldb, sr1, sr2, si, beta1, beta2, v) |
DLAQZ1 | |
subroutine | dlaqz2 (ilq, ilz, k, istartm, istopm, ihi, a, lda, b, ldb, nq, qstart, q, ldq, nz, zstart, z, ldz) |
DLAQZ2 | |
recursive subroutine | dlaqz3 (ilschur, ilq, ilz, n, ilo, ihi, nw, a, lda, b, ldb, q, ldq, z, ldz, ns, nd, alphar, alphai, beta, qc, ldqc, zc, ldzc, work, lwork, rec, info) |
DLAQZ3 | |
subroutine | dlaqz4 (ilschur, ilq, ilz, n, ilo, ihi, nshifts, nblock_desired, sr, si, ss, a, lda, b, ldb, q, ldq, z, ldz, qc, ldqc, zc, ldzc, work, lwork, info) |
DLAQZ4 | |
subroutine | dtgevc (side, howmny, select, n, s, lds, p, ldp, vl, ldvl, vr, ldvr, mm, m, work, info) |
DTGEVC | |
subroutine | dtgexc (wantq, wantz, n, a, lda, b, ldb, q, ldq, z, ldz, ifst, ilst, work, lwork, info) |
DTGEXC | |
subroutine | sgelqt (m, n, mb, a, lda, t, ldt, work, info) |
SGELQT | |
recursive subroutine | sgelqt3 (m, n, a, lda, t, ldt, info) |
SGELQT3 | |
subroutine | sgemlqt (side, trans, m, n, k, mb, v, ldv, t, ldt, c, ldc, work, info) |
SGEMLQT | |
recursive subroutine | slaqz0 (wants, wantq, wantz, n, ilo, ihi, a, lda, b, ldb, alphar, alphai, beta, q, ldq, z, ldz, work, lwork, rec, info) |
SLAQZ0 | |
subroutine | slaqz1 (a, lda, b, ldb, sr1, sr2, si, beta1, beta2, v) |
SLAQZ1 | |
subroutine | slaqz2 (ilq, ilz, k, istartm, istopm, ihi, a, lda, b, ldb, nq, qstart, q, ldq, nz, zstart, z, ldz) |
SLAQZ2 | |
recursive subroutine | slaqz3 (ilschur, ilq, ilz, n, ilo, ihi, nw, a, lda, b, ldb, q, ldq, z, ldz, ns, nd, alphar, alphai, beta, qc, ldqc, zc, ldzc, work, lwork, rec, info) |
SLAQZ3 | |
subroutine | slaqz4 (ilschur, ilq, ilz, n, ilo, ihi, nshifts, nblock_desired, sr, si, ss, a, lda, b, ldb, q, ldq, z, ldz, qc, ldqc, zc, ldzc, work, lwork, info) |
SLAQZ4 | |
subroutine | zgelqt (m, n, mb, a, lda, t, ldt, work, info) |
ZGELQT | |
recursive subroutine | zgelqt3 (m, n, a, lda, t, ldt, info) |
ZGELQT3 recursively computes a LQ factorization of a general real or complex matrix using the compact WY representation of Q. | |
subroutine | zgemlqt (side, trans, m, n, k, mb, v, ldv, t, ldt, c, ldc, work, info) |
ZGEMLQT | |
This is the group of double computational functions for GE matrices