📦 lapack-man

8668 pages · page 25 of 44

L (continued)

lags2(3)lags2: 2x2 orthogonal factor, step in tgsja✨
lagtf(3)lagtf: LU factor of (T - λI)✨
lagtm(3)lagtm: tridiagonal matrix-matrix multiply✨
lagts(3)lagts: LU solve of (T - λI) x = y✨
lagv2(3)lagv2: 2x2 generalized Schur factor✨
lahef(3)la{he,sy}f: step in hetrf✨
lahef_aa(3)la{he,sy}f_aa: triangular factor partial factor✨
lahef_rk(3)la{he,sy}f_rk: triangular factor step✨
lahef_rook(3)la{he,sy}f_rook: triangular factor step✨
lahqr(3)lahqr: eig of Hessenberg, step in hseqr✨
lahr2(3)lahr2: step in gehrd✨
laic1(3)laic1: condition estimate, step in gelsy✨
laisnan(3)laisnan: test for NaN, unoptimized✨
laln2(3)laln2: 1x1 or 2x2 solve, step in trevc✨
lals0(3)lals0: back multiplying factors, step in gelsd✨
lalsa(3)lalsa: SVD of coefficient matrix, step in gelsd✨
lalsd(3)lalsd: uses SVD for least squares, step in gelsd✨
lamc1(3)lamc1: ??✨
lamc2(3)lamc2: ??✨
lamc3(3)lamc3: ??✨
lamc4(3)lamc4: ??✨
lamc5(3)lamc5: ??✨
lamch(3)lamch: machine parameters✨
lamrg(3)lamrg: permutation to merge 2 sorted lists✨
lamswlq(3)lamswlq: multiply by Q from laswlq✨
lamtsqr(3)lamtsqr: multiply by Q from latsqr✨
laneg(3)laneg: Sturm count✨
langb(3)langb: general matrix, banded✨
lange(3)lange: general matrix✨
langt(3)langt: general matrix, tridiagonal✨
lanhb(3)lan{hb,sb}: Hermitian/symmetric matrix, banded✨
lanhe(3)lan{he,sy}: Hermitian/symmetric matrix✨
lanhf(3)lan{hf,sf}: Hermitian/symmetric matrix, RFP✨
lanhp(3)lan{hp,sp}: Hermitian/symmetric matrix, packed✨
lanhs(3)lanhs: Hessenberg✨
lanht(3)lan{ht,st}: Hermitian/symmetric matrix, tridiagonal✨
lantb(3)lantb: triangular matrix, banded✨
lantp(3)lantp: triangular matrix, packed✨
lantr(3)lantr: triangular matrix✨
lanv2(3)lanv2: 2x2 Schur factor✨
lapack_top(3)LAPACK✨
LAPACK_VERSION(3)✨
LAPACK_version.f(3)✨
lapll(3)lapll: linear dependence of 2 vectors✨
lapmr(3)lapmr: permute rows✨
lapmt(3)lapmt: permute cols✨
lapy2(3)lapy2: robust sqrt( x^2 + y^2 )✨
lapy3(3)lapy3: robust sqrt( x^2 + y^2 + z^2 )✨
laqgb(3)laqgb: row/col scale matrix✨
laqge(3)laqge: row/col scale matrix✨
laqhb(3)laqhb: row/col scale matrix✨
laqhe(3)laqhe: row/col scale matrix✨
laqhp(3)laqhp: row/col scale matrix✨
laqp2(3)laqp2: step of geqp3✨
laqps(3)laqps: step of geqp3✨
laqr0(3)laqr0: eig of Hessenberg, step in hseqr✨
laqr1(3)laqr1: step in hseqr✨
laqr2(3)laqr2: step in hseqr✨
laqr3(3)laqr3: step in hseqr✨
laqr4(3)laqr4: eig of Hessenberg, step in hseqr✨
laqr5(3)laqr5: step in hseqr✨
laqr_group(3)--- hseqr auxiliary ---✨
laqtr(3)laqtr: quasi-triangular solve✨
laqz0(3)laqz0: step in ggev3, gges3✨
laqz1(3)laqz1: step in ggev3, gges3✨
laqz2(3)laqz2: step in ggev3, gges3✨
laqz3(3)laqz3: step in ggev3, gges3✨
laqz4(3)laqz4: step in ggev3, gges3✨
laqz_group(3)--- ggev3, gges3 auxiliary ---✨
lar1v(3)lar1v: step in larrv, hence stemr & stegr✨
lar2v(3)lar2v: apply vector of plane rotations to 2x2 matrices✨
larcm(3)larcm: real * complex matrix-matrix multiply✨
larf(3)larf: apply Householder reflector✨
larfb(3)larfb: apply block Householder reflector✨
larfb_gett(3)larfb_gett: step in ungtsqr_row✨
larfg(3)larfg: generate Householder reflector✨
larfgp(3)larfgp: generate Householder reflector, beta ≥ 0✨
larft(3)larft: generate T matrix✨
larfx(3)larfx: apply Householder reflector, unrolled✨
larfy(3)larfy: apply Householder reflector symmetrically (2-sided)✨
largv(3)largv: generate vector of plane rotations✨
larmm(3)larmm: scale factor to avoid overflow, step in latrs✨
larnv(3)larnv: random vector✨
larr_comp_grp(3)tridiag RRR routines✨
larra(3)larra: step in stemr✨
larrb(3)larrb: step in stemr✨
larrc(3)larrc: step in stemr✨
larrd(3)larrd: step in stemr, tridiag eig✨
larre(3)larre: step in stemr✨
larrf(3)larrf: step in stemr, find relative robust representation (RRR)✨
larrj(3)larrj: step in stemr, refine eigval estimates✨
larrk(3)larrk: step in stemr, compute one eigval✨
larrr(3)larrr: step in stemr, test to do expensive tridiag eig algorithm✨
larrv(3)larrv: eig tridiagonal, step in stemr & stegr✨
larscl2(3)larscl2: reciprocal diagonal scale matrix, A = D^{-1} A✨
lartg(3)lartg: generate plane rotation, more accurate than BLAS rot✨
lartgp(3)lartgp: generate plane rotation, more accurate than BLAS rot✨
lartgs(3)lartgs: generate plane rotation for bidiag SVD✨
lartv(3)lartv: apply vector of plane rotations to vectors✨
laruv(3)laruv: random uniform vector✨
larz(3)larz: apply reflector✨
larzb(3)larzb: apply block reflector✨
larzt(3)larzt: generate T matrix✨
las2(3)las2: 2x2 triangular SVD✨
lascl(3)lascl: scale matrix✨
lascl2(3)lascl2: diagonal scale matrix, A = D A✨
lasd0(3)lasd0: D&C step: top level solver✨
lasd1(3)lasd1: D&C step: merge subproblems✨
lasd2(3)lasd2: D&C step: deflation✨
lasd3(3)lasd3: D&C step: secular equation✨
lasd4(3)lasd4: D&C step: secular equation nonlinear solver✨
lasd5(3)lasd5: D&C step: secular equation, 2x2✨
lasd6(3)lasd6: D&C step: merge subproblems✨
lasd7(3)lasd7: D&C step: deflation✨
lasd8(3)lasd8: D&C step: secular equation✨
lasd_comp2(3)--- singular values only or factored form ---✨
lasd_comp_grp(3)bidiag D&C routines✨
lasda(3)lasda: D&C step: top level solver✨
lasdq(3)lasdq: D&C step: leaf using bdsqr✨
lasdt(3)lasdt: D&C step: tree✨
laset(3)laset: set matrix✨
lasq1(3)lasq1: dqds step✨
lasq2(3)lasq2: dqds step✨
lasq3(3)lasq3: dqds step✨
lasq4(3)lasq4: dqds step✨
lasq5(3)lasq5: dqds step✨
lasq6(3)lasq6: dqds step✨
lasq_comp_grp(3)bidiag QR iteration routines✨
lasr(3)lasr: apply series of plane rotations✨
lasrt(3)lasrt: sort vector✨
lassq(3)lassq: sum-of-squares, avoiding over/underflow✨
lasv2(3)lasv2: 2x2 triangular SVD✨
laswlq(3)laswlq: short-wide LQ factor✨
laswp(3)laswp: swap permutation✨
lasy2(3)lasy2: Sylvester equation✨
latbs(3)latbs: triangular solve with scaling✨
latdf(3)latdf: Dif-estimate with complete pivoting LU, step in tgsen✨
latps(3)latps: triangular solve with robust scaling✨
latrd(3)latrd: step in hetrd✨
latrs(3)latrs: triangular solve with robust scaling✨
latrs3(3)latrs3: triangular solve with robust scaling, level 3✨
latrz(3)latrz: RZ factor step✨
latsqr(3)latsqr: tall-skinny QR factor✨
launhr_col_getrfnp(3)la{un,or}hr_col_getrfnp: LU factor without pivoting✨
launhr_col_getrfnp2(3)la{un,or}hr_col_getrfnp2: LU factor without pivoting, level 2✨
lauu2(3)lauu2: triangular multiply: U^H U, level 2✨
lauum(3)lauum: triangular multiply: U^H U✨
LCE(3)✨
LCERES(3)✨
LDE(3)✨
LDERES(3)✨
link_xerbla(3)✨
LSAME(3)✨
lsame(3)lsame: string comparison✨
lsame.f(3)✨
LSAMEN(3)✨
lsamen(3)lsamen: string comparison✨
lsamen.f(3)✨
lsametst.f(3)✨
LSE(3)✨
LSERES(3)✨
LZE(3)✨
LZERES(3)✨

M

main(3)✨
MYSUB(3)✨

N

norm_grp(3)Matrix norm✨
nrm2(3)nrm2: || x ||_2✨

P

params_grp(3)Parameters✨
PASSED(3)✨
pbcon(3)pbcon: condition number estimate✨
pbequ(3)pbequ: equilibration✨
pbrfs(3)pbrfs: iterative refinement✨
pbstf(3)pbstf: split Cholesky factor, use with hbgst✨
pbsv(3)pbsv: factor and solve✨
pbsv_comp(3)--- banded ---✨
pbsv_driver(3)--- banded ---✨
pbsvx(3)pbsvx: factor and solve, expert✨
pbtf2(3)pbtf2: triangular factor panel, level 2✨
pbtrf(3)pbtrf: triangular factor✨
pbtrs(3)pbtrs: triangular solve using factor✨
pfsv(3)pfsv: factor and solve [not available]✨
pfsv_comp(3)--- rectangular full packed (RFP) ---✨
pfsv_driver(3)--- rectangular full packed (RFP) ---✨
pftrf(3)pftrf: triangular factor✨
pftri(3)pftri: triangular inverse✨
pftrs(3)pftrs: triangular solve using factor✨
pocon(3)pocon: condition number estimate✨
poequ(3)poequ: equilibration✨
poequb(3)poequb: equilibration, power of 2✨
porfs(3)porfs: iterative refinement✨
porfsx(3)porfsx: iterative refinement, expert✨
posv(3)posv: factor and solve✨
posv_comp(3)--- full ---✨
posv_comp_grp(3)Cholesky: computational routines (factor, cond, etc.)✨
posv_driver(3)--- full ---✨
posv_driver_grp(3)Cholesky: Hermitian/symmetric positive definite matrix, driver✨
posv_mixed(3)posv: factor and solve, mixed precision✨
posvx(3)posvx: factor and solve, expert✨
posvxx(3)posvxx: factor and solve, extra precise✨
potf2(3)potf2: triangular factor panel, level 2✨