![]() |
LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
|
Functions | |
| subroutine | cgebak (job, side, n, ilo, ihi, scale, m, v, ldv, info) |
| CGEBAK | |
| subroutine | cgebal (job, n, a, lda, ilo, ihi, scale, info) |
| CGEBAL | |
| subroutine | cgebd2 (m, n, a, lda, d, e, tauq, taup, work, info) |
| CGEBD2 reduces a general matrix to bidiagonal form using an unblocked algorithm. | |
| subroutine | cgebrd (m, n, a, lda, d, e, tauq, taup, work, lwork, info) |
| CGEBRD | |
| subroutine | cgecon (norm, n, a, lda, anorm, rcond, work, rwork, info) |
| CGECON | |
| subroutine | cgeequ (m, n, a, lda, r, c, rowcnd, colcnd, amax, info) |
| CGEEQU | |
| subroutine | cgeequb (m, n, a, lda, r, c, rowcnd, colcnd, amax, info) |
| CGEEQUB | |
| subroutine | cgehd2 (n, ilo, ihi, a, lda, tau, work, info) |
| CGEHD2 reduces a general square matrix to upper Hessenberg form using an unblocked algorithm. | |
| subroutine | cgehrd (n, ilo, ihi, a, lda, tau, work, lwork, info) |
| CGEHRD | |
| subroutine | cgelq2 (m, n, a, lda, tau, work, info) |
| CGELQ2 computes the LQ factorization of a general rectangular matrix using an unblocked algorithm. | |
| subroutine | cgelqf (m, n, a, lda, tau, work, lwork, info) |
| CGELQF | |
| subroutine | cgemqrt (side, trans, m, n, k, nb, v, ldv, t, ldt, c, ldc, work, info) |
| CGEMQRT | |
| subroutine | cgeql2 (m, n, a, lda, tau, work, info) |
| CGEQL2 computes the QL factorization of a general rectangular matrix using an unblocked algorithm. | |
| subroutine | cgeqlf (m, n, a, lda, tau, work, lwork, info) |
| CGEQLF | |
| subroutine | cgeqp3 (m, n, a, lda, jpvt, tau, work, lwork, rwork, info) |
| CGEQP3 | |
| subroutine | cgeqr2 (m, n, a, lda, tau, work, info) |
| CGEQR2 computes the QR factorization of a general rectangular matrix using an unblocked algorithm. | |
| subroutine | cgeqr2p (m, n, a, lda, tau, work, info) |
| CGEQR2P computes the QR factorization of a general rectangular matrix with non-negative diagonal elements using an unblocked algorithm. | |
| subroutine | cgeqrf (m, n, a, lda, tau, work, lwork, info) |
| CGEQRF | |
| subroutine | cgeqrfp (m, n, a, lda, tau, work, lwork, info) |
| CGEQRFP | |
| subroutine | cgeqrt (m, n, nb, a, lda, t, ldt, work, info) |
| CGEQRT | |
| subroutine | cgeqrt2 (m, n, a, lda, t, ldt, info) |
| CGEQRT2 computes a QR factorization of a general real or complex matrix using the compact WY representation of Q. | |
| recursive subroutine | cgeqrt3 (m, n, a, lda, t, ldt, info) |
| CGEQRT3 recursively computes a QR factorization of a general real or complex matrix using the compact WY representation of Q. | |
| subroutine | cgerfs (trans, n, nrhs, a, lda, af, ldaf, ipiv, b, ldb, x, ldx, ferr, berr, work, rwork, info) |
| CGERFS | |
| subroutine | cgerfsx (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, rwork, info) |
| CGERFSX | |
| subroutine | cgerq2 (m, n, a, lda, tau, work, info) |
| CGERQ2 computes the RQ factorization of a general rectangular matrix using an unblocked algorithm. | |
| subroutine | cgerqf (m, n, a, lda, tau, work, lwork, info) |
| CGERQF | |
| subroutine | cgesvj (joba, jobu, jobv, m, n, a, lda, sva, mv, v, ldv, cwork, lwork, rwork, lrwork, info) |
| CGESVJ | |
| subroutine | cgetf2 (m, n, a, lda, ipiv, info) |
| CGETF2 computes the LU factorization of a general m-by-n matrix using partial pivoting with row interchanges (unblocked algorithm). | |
| subroutine | cgetrf (m, n, a, lda, ipiv, info) |
| CGETRF | |
| recursive subroutine | cgetrf2 (m, n, a, lda, ipiv, info) |
| CGETRF2 | |
| subroutine | cgetri (n, a, lda, ipiv, work, lwork, info) |
| CGETRI | |
| subroutine | cgetrs (trans, n, nrhs, a, lda, ipiv, b, ldb, info) |
| CGETRS | |
| subroutine | chgeqz (job, compq, compz, n, ilo, ihi, h, ldh, t, ldt, alpha, beta, q, ldq, z, ldz, work, lwork, rwork, info) |
| CHGEQZ | |
| subroutine | cla_geamv (trans, m, n, alpha, a, lda, x, incx, beta, y, incy) |
| CLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. | |
| real function | cla_gercond_c (trans, n, a, lda, af, ldaf, ipiv, c, capply, info, work, rwork) |
| CLA_GERCOND_C computes the infinity norm condition number of op(A)*inv(diag(c)) for general matrices. | |
| real function | cla_gercond_x (trans, n, a, lda, af, ldaf, ipiv, x, info, work, rwork) |
| CLA_GERCOND_X computes the infinity norm condition number of op(A)*diag(x) for general matrices. | |
| subroutine | cla_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) |
| CLA_GERFSX_EXTENDED | |
| real function | cla_gerpvgrw (n, ncols, a, lda, af, ldaf) |
| CLA_GERPVGRW multiplies a square real matrix by a complex matrix. | |
| recursive subroutine | claqz0 (wants, wantq, wantz, n, ilo, ihi, a, lda, b, ldb, alpha, beta, q, ldq, z, ldz, work, lwork, rwork, rec, info) |
| CLAQZ0 | |
| subroutine | claqz1 (ilq, ilz, k, istartm, istopm, ihi, a, lda, b, ldb, nq, qstart, q, ldq, nz, zstart, z, ldz) |
| CLAQZ1 | |
| recursive subroutine | claqz2 (ilschur, ilq, ilz, n, ilo, ihi, nw, a, lda, b, ldb, q, ldq, z, ldz, ns, nd, alpha, beta, qc, ldqc, zc, ldzc, work, lwork, rwork, rec, info) |
| CLAQZ2 | |
| subroutine | claqz3 (ilschur, ilq, ilz, n, ilo, ihi, nshifts, nblock_desired, alpha, beta, a, lda, b, ldb, q, ldq, z, ldz, qc, ldqc, zc, ldzc, work, lwork, info) |
| CLAQZ3 | |
| subroutine | claunhr_col_getrfnp (m, n, a, lda, d, info) |
| CLAUNHR_COL_GETRFNP | |
| recursive subroutine | claunhr_col_getrfnp2 (m, n, a, lda, d, info) |
| CLAUNHR_COL_GETRFNP2 | |
| subroutine | ctgevc (side, howmny, select, n, s, lds, p, ldp, vl, ldvl, vr, ldvr, mm, m, work, rwork, info) |
| CTGEVC | |
| subroutine | ctgexc (wantq, wantz, n, a, lda, b, ldb, q, ldq, z, ldz, ifst, ilst, info) |
| CTGEXC | |
| subroutine | cgeqpf (m, n, a, lda, jpvt, tau, work, rwork, info) |
| CGEQPF | |
This is the group of complex computational functions for GE matrices