DGELSD(3)

🎀 DGELSD(3) — Library Functions Manual 🎀

🌸 NAME 🌸

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dgelsd.f — okay bestie, this is the source file for DGELSD, the routine that computes the minimum-norm solution to a linear least squares problem for GE matrices. 💖

---

✨ SYNOPSIS ✨

🧚 Functions/Subroutines 🧚

• subroutine DGELSD (m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, iwork, info) — DGELSD computes the minimum-norm solution to a linear least squares problem for GE matrices.

---

💖 Function/Subroutine Documentation 💖

🫶 subroutine DGELSD 🫶

subroutine DGELSD (integer m, integer n, integer nrhs, double precision,
    dimension( lda, * ) a, integer lda, double precision, dimension( ldb, *
    ) b, integer ldb, double precision, dimension( * ) s, double precision
    rcond, integer rank, double precision, dimension( * ) work, integer
    lwork, integer, dimension( * ) iwork, integer info)

DGELSD computes the minimum-norm solution to a linear least squares problem for GE matrices. Slay. 💅

🌈 Purpose 🌈

Okay so picture this: DGELSD computes the minimum-norm solution to a real linear least squares problem:

minimize 2-norm(| b - A*x |)

It does this using the singular value decomposition (SVD) of A. And A is an M-by-N matrix which may be rank-deficient — yes, she can still serve even when she's not full rank, no cap. ✨

Several right hand side vectors b and solution vectors x can be handled in a single call. They're stored as the columns of the M-by-NRHS right hand side matrix B and the N-by-NRHS solution matrix X. Group chat energy, but for linear algebra. 🫶

The problem is solved in three steps:

1. Reduce the coefficient matrix A to bidiagonal form with Householder transformations, reducing the original problem into a (BLS).
2. Solve the BLS using a divide and conquer approach.
3. Apply back all the Householder transformations to solve the original least squares problem.

The effective rank of A is determined by treating as zero those singular values which are less than RCOND times the largest singular value. Iconic behavior. 👑

🌸 Parameters 🌸

• M — M is INTEGER. It's the number of rows of A. Constraint: M >= 0.
• N — N is INTEGER. It's the number of columns of A. Constraint: N >= 0.
• NRHS — NRHS is INTEGER. It's the number of right hand sides, i.e. the number of columns of the matrices B and X. Constraint: NRHS >= 0.
• A — A is DOUBLE PRECISION array, dimension (LDA,N). On entry, it's the M-by-N matrix A. On exit, A has been destroyed. 😭 Yes, really — she's gone.
• LDA — LDA is INTEGER. It's the leading dimension of the array A. Constraint: LDA >= max(1,M).
• B — B is DOUBLE PRECISION array, dimension (LDB,NRHS). On entry, it's the M-by-NRHS right hand side matrix B. On exit, B is overwritten by the N-by-NRHS solution matrix X. If m >= n and RANK = n, the residual sum-of-squares for the solution in the i-th column is given by the sum of squares of elements n+1:m in that column.
• LDB — LDB is INTEGER. It's the leading dimension of the array B. Constraint: LDB >= max(1,max(M,N)).
• S — S is DOUBLE PRECISION array, dimension (min(M,N)). It holds the singular values of A in decreasing order. The condition number of A in the 2-norm is S(1)/S(min(m,n)).
• RCOND — RCOND is DOUBLE PRECISION. It's used to determine the effective rank of A: singular values S(i) <= RCOND*S(1) are treated as zero. If RCOND < 0, machine precision is used instead.
• RANK — RANK is INTEGER. It's the effective rank of A, i.e. the number of singular values which are greater than RCOND*S(1).
• WORK — WORK is DOUBLE PRECISION array, dimension (MAX(1,LWORK)). On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
• LWORK — LWORK is INTEGER. It's the dimension of the array WORK. LWORK must be at least 1. The exact minimum amount of workspace needed depends on M, N, and NRHS. As long as LWORK is at least 12*N + 2*N*SMLSIZ + 8*N*NLVL + N*NRHS + (SMLSIZ+1)**2, if M is greater than or equal to N, or at least 12*M + 2*M*SMLSIZ + 8*M*NLVL + M*NRHS + (SMLSIZ+1)**2, if M is less than N, the code will execute correctly. SMLSIZ is returned by ILAENV and is equal to the maximum size of the subproblems at the bottom of the computation tree (usually about 25), and NLVL = MAX( 0, INT( LOG_2( MIN( M,N )/(SMLSIZ+1) ) ) + 1 ). For good performance, LWORK should generally be larger.

If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.

• IWORK — IWORK is INTEGER array, dimension (MAX(1,LIWORK)). LIWORK >= max(1, 3 * MINMN * NLVL + 11 * MINMN), where MINMN = MIN( M,N ). On exit, if INFO = 0, IWORK(1) returns the minimum LIWORK.
• INFO — INFO is INTEGER. = 0: successful exit. < 0: if INFO = -i, the i-th argument had an illegal value. > 0: the algorithm for computing the SVD failed to converge; if INFO = i, i off-diagonal elements of an intermediate bidiagonal form did not converge to zero.

👑 Author 👑

Big brain credits go to:

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

🫶 Contributors: 🫶

• Ming Gu and Ren-Cang Li, Computer Science Division, University of California at Berkeley, USA
• Osni Marques, LBNL/NERSC, USA

Definition at line 201 of file dgelsd.f.

---

📝 Author 📝

This page was generated automatically by Doxygen for LAPACK from the source code.

And that's the whole page, bestie — auto-generated by Doxygen for LAPACK from the source code, stamped LAPACK Version 3.12.0 and living at /home/abui...RC/dgelsd.f(3). The footer doesn't print a separate date, just the version stamp — periodt. 💅✨