SRC/slasd0.f(3)

πŸŽ€ SRC/slasd0.f(3) β€” the glow-up page πŸŽ€

okay bestie, welcome to the SRC/slasd0.f(3) page from the Library Functions Manual. It’s giving very specific LAPACK subroutine energy, and we’re keeping every single deet intact. πŸ’…

✨ NAME ✨

SRC/slasd0.f

πŸ¦‹ SYNOPSIS πŸ¦‹

Functions/Subroutines

  • subroutine slasd0 β€” SLASD0 computes the singular values of a real upper bidiagonal n-by-m matrix B with diagonal d and off-diagonal e. Used by sbdsdc.
subroutine slasd0 (n, sqre, d, e, u, ldu, vt, ldvt, smlsiz, iwork, work,
    info)

πŸ’« Function/Subroutine Documentation πŸ’«

subroutine slasd0

subroutine slasd0 (integer n, integer sqre, real, dimension( * ) d, real,
    dimension( * ) e, real, dimension( ldu, * ) u, integer ldu, real,
    dimension( ldvt, * ) vt, integer ldvt, integer smlsiz, integer,
    dimension( * ) iwork, real, dimension( * ) work, integer info)

SLASD0 computes the singular values of a real upper bidiagonal n-by-m matrix B with diagonal d and off-diagonal e. Used by sbdsdc.

🌸 Purpose 🌸

Using a divide and conquer approach, SLASD0 computes the singular value decomposition (SVD) of a real upper bidiagonal N-by-M matrix B with diagonal D and offdiagonal E, where M = N + SQRE. The algorithm computes orthogonal matrices U and VT such that B = U * S * VT. The singular values S are overwritten on D.

A related subroutine, SLASDA, computes only the singular values, and optionally, the singular vectors in compact form.

πŸŽ€ Parameters πŸŽ€

  • N β€” N is INTEGER. On entry, the row dimension of the upper bidiagonal matrix. This is also the dimension of the main diagonal array D.
  • SQRE β€” SQRE is INTEGER. Specifies the column dimension of the bidiagonal matrix.
    • = 0: The bidiagonal matrix has column dimension M = N;
    • = 1: The bidiagonal matrix has column dimension M = N+1;
  • D β€” D is REAL array, dimension (N). On entry D contains the main diagonal of the bidiagonal matrix. On exit D, if INFO = 0, contains its singular values.
  • E β€” E is REAL array, dimension (M-1). Contains the subdiagonal entries of the bidiagonal matrix. On exit, E has been destroyed.
  • U β€” U is REAL array, dimension (LDU, N). On exit, U contains the left singular vectors, if U passed in as (N, N) Identity.
  • LDU β€” LDU is INTEGER. On entry, leading dimension of U.
  • VT β€” VT is REAL array, dimension (LDVT, M). On exit, VT**T contains the right singular vectors, if VT passed in as (M, M) Identity.
  • LDVT β€” LDVT is INTEGER. On entry, leading dimension of VT.
  • SMLSIZ β€” SMLSIZ is INTEGER. On entry, maximum size of the subproblems at the bottom of the computation tree.
  • IWORK β€” IWORK is INTEGER array, dimension (8*N)
  • WORK β€” WORK is REAL array, dimension (3*M**2+2*M)
  • INFO β€” INFO is INTEGER
    • = 0: successful exit.
    • < 0: if INFO = -i, the i-th argument had an illegal value.
    • > 0: if INFO = 1, a singular value did not converge

πŸ‘‘ Author πŸ‘‘

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

🌟 Contributors: 🌟

  • Ming Gu and Huan Ren, Computer Science Division, University of California at Berkeley, USA

πŸ“Œ Definition at line 150 of file slasd0.f.

🌈 Author 🌈

Generated automatically by Doxygen for LAPACK from the source code.


okurrr, that’s the whole page, bestie πŸ’–. The footer energy is LAPACK Version 3.12.0, page SRC/slasd0.f(3) β€” Doxygen really said β€œI got you” and generated it automatically from the source code ✨🫢

πŸ“¦ where this page comes from