📦 lapack-man

8668 pages · page 23 of 44

F (continued)

G

gbbrd(3)gbbrd: band to bidiagonal✨
gbcon(3)gbcon: condition number estimate✨
gbequ(3)gbequ: equilibration✨
gbequb(3)gbequb: equilibration, power of 2✨
gbmv(3)gbmv: general matrix-vector multiply✨
gbrfs(3)gbrfs: iterative refinement✨
gbrfsx(3)gbrfsx: iterative refinement, expert✨
gbsv(3)gbsv: factor and solve✨
gbsv_comp(3)--- banded ---✨
gbsv_driver(3)--- banded ---✨
gbsvx(3)gbsvx: factor and solve, expert✨
gbsvxx(3)gbsvxx: factor and solve, extra precise✨
gbtf2(3)gbtf2: triangular factor, level 2✨
gbtrf(3)gbtrf: triangular factor✨
gbtrs(3)gbtrs: triangular solve using factor✨
gebak(3)gebak: back-transform eigvec✨
gebal(3)gebal: balance matrix✨
gebd2(3)gebd2: reduction to bidiagonal, level 2✨
gebrd(3)gebrd: reduction to bidiagonal✨
gecon(3)gecon: condition number estimate✨
gecs_comp_grp(3)Cosine-Sine (CS) decomposition✨
gedmd(3)DMD driver, Dynamic Mode Decomposition✨
geequ(3)geequ: equilibration✨
geequb(3)geequb: equilibration, power of 2✨
gees(3)gees: Schur form✨
geesx(3)geesx: Schur form, expert✨
geev(3)geev: eig✨
geev_comp_grp(3)Eig computational routines✨
geev_driver_grp(3)Standard eig driver, AV = VΛ✨
geev_top(3)Non-symmetric eigenvalues✨
geevx(3)geevx: eig, expert✨
gehd2(3)gehd2: reduction to Hessenberg, level 2✨
gehrd(3)gehrd: reduction to Hessenberg✨
gejsv(3)gejsv: SVD, Jacobi, high-level✨
gelq(3)gelq: LQ factor, flexible✨
gelq2(3)gelq2: LQ factor, level 2✨
gelq_comp1(3)--- flexible ---✨
gelq_comp2(3)--- classic ---✨
gelq_comp3(3)--- with T ---✨
gelq_comp_grp(3)LQ✨
gelqf(3)gelqf: LQ factor✨
gelqt(3)gelqt: LQ factor, with T✨
gelqt3(3)gelqt3: LQ factor, with T, recursive✨
gels(3)gels: least squares using QR/LQ✨
gels_aux_grp(3)Auxiliary routines✨
gels_driver_grp(3)Standard least squares, min || Ax - b ||_2✨
gels_top(3)Least squares✨
gelsd(3)gelsd: least squares using SVD, divide and conquer✨
gelss(3)gelss: least squares using SVD, QR iteration✨
gelst(3)gelst: least squares using QR/LQ with T matrix✨
gelsy(3)gelsy: least squares using complete orthogonal factor✨
gemlq(3)gemlq: multiply by Q from gelq✨
gemlqt(3)gemlqt: multiply by Q from gelqt✨
gemm(3)gemm: general matrix-matrix multiply✨
gemqr(3)gemqr: multiply by Q from geqr✨
gemqrt(3)gemqrt: multiply by Q from geqrt✨
gemv(3)gemv: general matrix-vector multiply✨
geql2(3)geql2: QL factor, level 2✨
geql_comp_grp(3)QL✨
geqlf(3)geqlf: QL factor✨
geqp3(3)geqp3: QR factor with pivoting, level 3✨
geqpf_comp_grp(3)QR with pivoting✨
geqr(3)geqr: QR factor, flexible✨
geqr2(3)geqr2: QR factor, level 2✨
geqr2p(3)geqr2p: QR factor, diag( R ) ≥ 0, level 2✨
geqr_comp1(3)--- flexible ---✨
geqr_comp2(3)--- classic ---✨
geqr_comp3(3)--- with T ---✨
geqr_comp4(3)--- positive ---✨
geqr_comp_grp(3)QR✨
geqrf(3)geqrf: QR factor✨
geqrfp(3)geqrfp: QR factor, diag( R ) ≥ 0✨
geqrt(3)geqrt: QR factor, with T✨
geqrt2(3)geqrt2: QR factor, with T, level 2✨
geqrt3(3)geqrt3: QR factor, with T, recursive panel✨
ger(3)ger: general matrix rank-1 update✨
gerfs(3)gerfs: iterative refinement✨
gerfsx(3)gerfsx: iterative refinement, expert✨
gerq2(3)gerq2: RQ factor, level 2✨
gerq_comp_grp(3)RQ✨
gerqf(3)gerqf: RQ factor✨
gerz_comp_grp(3)RZ✨
gesc2(3)gesc2: triangular solve using factor, with complete pivoting✨
gesdd(3)gesdd: SVD, divide and conquer✨
gesv(3)gesv: factor and solve✨
gesv_comp(3)--- full ---✨
gesv_comp_grp(3)LU: computational routines (factor, cond, etc.)✨
gesv_driver(3)--- full ---✨
gesv_driver_grp(3)LU: General matrix, driver✨
gesv_mixed(3)gesv: factor and solve, mixed precision✨
gesvd(3)gesvd: SVD, QR iteration✨
gesvd_aux(3)--- auxiliary routines ---✨
gesvd_comp_grp(3)SVD computational routines✨
gesvd_driver(3)--- full ---✨
gesvdq(3)gesvdq: SVD, QR with pivoting✨
gesvdx(3)gesvdx: SVD, bisection✨
gesvj(3)gesvj: SVD, Jacobi, low-level✨
gesvx(3)gesvx: factor and solve, expert✨
gesvxx(3)gesvxx: factor and solve, extra precise✨
geswlq_comp_grp(3)LQ, short-wide✨
get_diag_type(3)✨
get_side_type(3)✨
get_transpose_type(3)✨
get_uplo_type(3)✨
getc2(3)getc2: triangular factor, with complete pivoting✨
getf2(3)getf2: triangular factor panel, level 2✨
getrf(3)getrf: triangular factor✨
getrf2(3)getrf2: triangular factor panel, recursive?✨
getri(3)getri: triangular inverse✨
getrs(3)getrs: triangular solve using factor✨
getsls(3)getsls: least squares using tall-skinny QR/LQ✨
getsqr_comp_grp(3)QR, tall-skinny✨
getsqrhrt(3)getsqrhrt: tall-skinny QR factor, with Householder reconstruction✨
ggbak(3)ggbak: back-transform eigvec✨
ggbal(3)ggbal: balance matrix✨
gges(3)gges: Schur form, unblocked✨
gges3(3)gges3: Schur form✨
ggesx(3)ggesx: Schur form, expert✨
ggev(3)ggev: eig, unblocked✨
ggev3(3)ggev3: eig✨
ggev_comp_grp(3)Generalized eig computational routines✨
ggev_driver_grp(3)Generalized eig driver✨
ggevx(3)ggevx: eig, expert✨
ggglm(3)ggglm: Gauss-Markov linear model✨
gghd3(3)gghd3: reduction to Hessenberg, level 3✨
gghrd(3)gghrd: reduction to Hessenberg✨
ggls_driver_grp(3)Constrained least squares✨
gglse(3)gglse: equality-constrained least squares✨
ggqr_comp_grp(3)Generalized QR✨
ggqrf(3)ggqrf: Generalized QR factor✨
ggrq_comp_grp(3)Generalized RQ✨
ggrqf(3)ggrqf: Generalized RQ factor✨
ggsvd3(3)ggsvd3: SVD, QR iteration✨
ggsvd_comp_grp(3)Generalized SVD computational routines✨
ggsvd_driver_grp(3)Generalized SVD driver✨
ggsvp3(3)ggsvp3: step in ggsvd✨
groups-usr.dox(3)✨
gsvj0(3)gsvj0: step in gesvj✨
gsvj1(3)gsvj1: step in gesvj✨
gtcon(3)gtcon: condition number estimate✨
gtrfs(3)gtrfs: iterative refinement✨
gtsv(3)gtsv: factor and solve✨
gtsv_comp(3)--- tridiagonal ---✨
gtsv_driver(3)--- tridiagonal ---✨
gtsvx(3)gtsvx: factor and solve, expert✨
gttrf(3)gttrf: triangular factor✨
gttrs(3)gttrs: triangular solve using factor✨
gtts2(3)gtts2: triangular solve using factor✨

H

hb2st_kernels(3){hb,sb}2st_kernels: band to tridiagonal (2nd stage)✨
hbev(3){hb,sb}ev: eig, QR iteration✨
hbev_2stage(3){hb,sb}ev_2stage: eig, QR iteration✨
hbev_comp(3)--- banded ---✨
hbev_driver(3)--- banded ---✨
hbev_driver2(3)--- banded, 2nd-stage ---✨
hbevd(3){hb,sb}evd: eig, divide and conquer✨
hbevd_2stage(3){hb,sb}evd_2stage: eig, divide and conquer✨
hbevx(3){hb,sb}evx: eig, bisection✨
hbevx_2stage(3){hb,sb}evx_2stage: eig, bisection✨
hbgst(3){hb,sb}gst: reduction to standard form, banded✨
hbgv(3){hb,sb}gv: eig, QR iteration✨
hbgv_driver(3)--- banded ---✨
hbgvd(3){hb,sb}gvd: eig, divide and conquer✨
hbgvx(3){hb,sb}gvx: eig, bisection✨
hbmv(3){hb,sb}mv: Hermitian/symmetric matrix-vector multiply✨
hbtrd(3){hb,sb}trd: reduction to tridiagonal✨
HEADER(3)✨
hecon(3){he,sy}con: condition number estimate✨
hecon_3(3){he,sy}con_3: condition number estimate✨
hecon_rook(3){he,sy}con_rook: condition number estimate✨
heequb(3){he,sy}equb: equilibration, power of 2✨
heev(3){he,sy}ev: eig, QR iteration✨
heev_2stage(3){he,sy}ev_2stage: eig, QR iteration✨
heev_comp(3)--- full ---✨
heev_comp_grp(3)Eig computational routines✨
heev_driver(3)--- full ---✨
heev_driver2(3)--- full, 2-stage ---✨
heev_driver_grp(3)Standard eig driver, AV = VΛ✨
heev_top(3)Hermitian/symmetric eigenvalues✨
heevd(3){he,sy}evd: eig, divide and conquer✨
heevd_2stage(3){he,sy}evd_2stage: eig, divide and conquer✨
heevr(3){he,sy}evr: eig, MRRR✨
heevr_2stage(3){he,sy}evr_2stage: eig, MRRR✨
heevx(3){he,sy}evx: eig, bisection✨
heevx_2stage(3){he,sy}evx_2stage: eig, bisection✨
hegs2(3){he,sy}gs2: reduction to standard form, level 2✨
hegst(3){he,sy}gst: reduction to standard form✨
hegv(3){he,sy}gv: eig, QR iteration✨
hegv_2stage(3){he,sy}gv_2stage: eig, QR iteration, 2-stage✨
hegv_comp_grp(3)Generalized eig computational routines✨
hegv_driver(3)--- full ---✨
hegv_driver_grp(3)Generalized eig driver, AV = BVΛ, etc.✨
hegvd(3){he,sy}gvd: eig, divide and conquer✨
hegvx(3){he,sy}gvx: eig, bisection✨
hemm(3){he,sy}mm: Hermitian/symmetric matrix-matrix multiply✨
hemv(3){he,sy}mv: Hermitian/symmetric matrix-vector multiply ([cz]symv in LAPACK)✨