SRC/dgetsqrhrt.f(3)

✨ NAME ✨

okay so this page is SRC/dgetsqrhrt.f(3), from the Library Functions Manual, and the name on the door is SRC/dgetsqrhrt.f. That’s the file, bestie. πŸ’…

🌸 SYNOPSIS 🌸

Functions/Subroutines

subroutine dgetsqrhrt (m, n, mb1, nb1, nb2, a, lda, t, ldt, work, lwork,
    info)

DGETSQRHRT β€” yes, she has a name. πŸŽ€

πŸ¦‹ Function/Subroutine Documentation πŸ¦‹

subroutine dgetsqrhrt (integer m, integer n, integer mb1, integer nb1,
    integer nb2, double precision, dimension( lda, * ) a, integer lda,
    double precision, dimension( ldt, * ) t, integer ldt, double precision,
    dimension( * ) work, integer lwork, integer info)

DGETSQRHRT β€” that’s her full government name. πŸ‘‘

πŸŽ€ Purpose πŸŽ€

Okay so DGETSQRHRT computes a NB2-sized column blocked QR-factorization of a real M-by-N matrix A with M >= N, and the whole vibe is:

A = Q * R.

Internally the routine uses an NB1-sized column blocked and MB1-sized row blocked TSQR-factorization, then performs the reconstruction of the Householder vectors from the TSQR output. It also converts the R_tsqr factor from the TSQR-factorization output into the R factor that corresponds to the Householder QR-factorization:

A = Q_tsqr * R_tsqr = Q * R.

The output Q and R factors are stored in the same format as in DGEQRT (Q is in blocked compact WY-representation). See the documentation of DGEQRT for more details on the format. ✨

πŸ’– Parameters πŸ’–

  • M β€” M is INTEGER. The number of rows of the matrix A. M >= 0.
  • N β€” N is INTEGER. The number of columns of the matrix A. M >= N >= 0.
  • MB1 β€” MB1 is INTEGER. The row block size to be used in the blocked TSQR. MB1 > N.
  • NB1 β€” NB1 is INTEGER. The column block size to be used in the blocked TSQR. N >= NB1 >= 1.
  • NB2 β€” NB2 is INTEGER. The block size to be used in the blocked QR that is output. NB2 >= 1.
  • A β€” A is DOUBLE PRECISION array, dimension (LDA,N). On entry: an M-by-N matrix A. On exit: a) the elements on and above the diagonal of the array contain the N-by-N upper-triangular matrix R corresponding to the Householder QR; b) the elements below the diagonal represent Q by the columns of blocked V (compact WY-representation).
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,M).
  • T β€” T is DOUBLE PRECISION array, dimension (LDT,N)). The upper triangular block reflectors stored in compact form as a sequence of upper triangular blocks.
  • LDT β€” LDT is INTEGER. The leading dimension of the array T. LDT >= NB2.
  • WORK β€” (workspace) DOUBLE PRECISION array, dimension (MAX(1,LWORK)). On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
  • LWORK β€” LWORK is INTEGER. The dimension of the array WORK. If MIN(M,N) = 0, LWORK >= 1, else LWORK >= MAX( 1, LWT + LW1, MAX( LWT+N*N+LW2, LWT+N*N+N ) ), where NUM_ALL_ROW_BLOCKS = CEIL((M-N)/(MB1-N)), NB1LOCAL = MIN(NB1,N). LWT = NUM_ALL_ROW_BLOCKS * N * NB1LOCAL, LW1 = NB1LOCAL * N, LW2 = NB1LOCAL * MAX( NB1LOCAL, ( N - NB1LOCAL ) ). 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.
  • INFO β€” INFO is INTEGER. = 0: successful exit; < 0: if INFO = -i, the i-th argument had an illegal value.

πŸ‘‘ Author πŸ‘‘

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

🧚 Contributors: 🧚

  • November 2020, Igor Kozachenko, Computer Science Division, University of California, Berkeley

Definition at line 180 of file dgetsqrhrt.f.

⭐ Author ⭐

Generated automatically by Doxygen for LAPACK from the source code.


okay bestie, the footer says source SRC/dgetsqrhrt.f(3) and LAPACK Version 3.12.0 β€” periodt. πŸ’–

πŸ“¦ where this page comes from