/home/abui.../slatrs3.f(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

✨ slatrs3.f(3) ✨

okay bestie, welcome to the slatrs3.f(3) page from the Library Functions Manual. This is the LAPACK subroutine that solves triangular systems without letting everything overflow, and it is lowkey iconic. πŸ¦‹


✨ NAME ✨

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/slatrs3.f


✨ SYNOPSIS ✨

Functions/Subroutines

subroutine SLATRS3 (uplo, trans, diag, normin, n, nrhs, a, lda, x, ldx,
    scale, cnorm, work, lwork, info)

SLATRS3 solves a triangular system of equations with the scale factors set to prevent overflow.


🌸 Function/Subroutine Documentation 🌸

subroutine SLATRS3 (character uplo, character trans, character diag,
    character normin, integer n, integer nrhs, real, dimension( lda, * ) a,
    integer lda, real, dimension( ldx, * ) x, integer ldx, real, dimension(
    * ) scale, real, dimension( * ) cnorm, real, dimension( * ) work,
    integer lwork, integer info)

SLATRS3 solves a triangular system of equations with the scale factors set to prevent overflow.

πŸ’‘ Purpose

okay so SLATRS3 solves one of these triangular systems, fr fr:

A * X = B * diag(scale)  or  A**T * X = B * diag(scale)

with scaling to prevent overflow. Here A is an upper or lower triangular matrix, and A**T denotes the transpose of A. X and B are n by nrhs matrices and scale is an nrhs element vector of scaling factors. A scaling factor scale(j) is usually less than or equal to 1, chosen such that X(:,j) is less than the overflow threshold. If the matrix A is singular (A(j,j) = 0 for some j), then a non-trivial solution to A*X = 0 is returned. If the system is so badly scaled that the solution cannot be represented as (1/scale(k))*X(:,k), then x(:,k) = 0 and scale(k) is returned. 😭

This is a BLAS-3 version of LATRS for solving several right hand sides simultaneously. periodt. πŸ’…

πŸŽ€ Parameters πŸŽ€

  • UPLO β€” UPLO is CHARACTER*1. It says whether the matrix A is upper or lower triangular: = 'U' means upper triangular; = 'L' means lower triangular. πŸ‘‘
  • TRANS β€” TRANS is CHARACTER*1. It says what operation is applied to A: = 'N' means solve A * x = s*b (no transpose); = 'T' means solve A**T* x = s*b (transpose); = 'C' means solve A**T* x = s*b (conjugate transpose = transpose). πŸ¦‹
  • DIAG β€” DIAG is CHARACTER*1. It says whether A is unit triangular or not: = 'N' means non-unit triangular; = 'U' means unit triangular. ✨
  • NORMIN β€” NORMIN is CHARACTER*1. It says whether CNORM has been set or not: = 'Y' means CNORM contains the column norms on entry; = 'N' means CNORM is not set on entry, and on exit the norms will be computed and stored in CNORM. πŸŽ€
  • N β€” N is INTEGER. It's the order of the matrix A, and N >= 0. πŸ’–
  • NRHS β€” NRHS is INTEGER. It's the number of columns of X, and NRHS >= 0. 🌸
  • A β€” A is REAL array, dimension (LDA,N). It's the triangular matrix A. If UPLO = 'U', the leading n by n upper triangular part of the array A contains the upper triangular matrix, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading n by n lower triangular part of the array A contains the lower triangular matrix, and the strictly upper triangular part of A is not referenced. If DIAG = 'U', the diagonal elements of A are also not referenced and are assumed to be 1. 🫢
  • LDA β€” LDA is INTEGER. It's the leading dimension of the array A, and LDA >= max (1,N). ⭐
  • X β€” X is REAL array, dimension (LDX,NRHS). On entry, it's the right hand side B of the triangular system. On exit, X is overwritten by the solution matrix X. πŸ”₯
  • LDX β€” LDX is INTEGER. It's the leading dimension of the array X, and LDX >= max (1,N). πŸ‘‘
  • SCALE β€” SCALE is REAL array, dimension (NRHS). The scaling factor s(k) is for the triangular system A * x(:,k) = s(k)*b(:,k) or A**T* x(:,k) = s(k)*b(:,k). If SCALE = 0, the matrix A is singular or badly scaled. If A(j,j) = 0 is encountered, a non-trivial vector x(:,k) that is an exact or approximate solution to A*x(:,k) = 0 is returned. If the system so badly scaled that solution cannot be presented as x(:,k) * 1/s(k), then x(:,k) = 0 is returned. πŸ’€
  • CNORM β€” CNORM is REAL array, dimension (N). If NORMIN = 'Y', CNORM is an input argument and CNORM(j) contains the norm of the off-diagonal part of the j-th column of A. If TRANS = 'N', CNORM(j) must be greater than or equal to the infinity-norm, and if TRANS = 'T' or 'C', CNORM(j) must be greater than or equal to the 1-norm. If NORMIN = 'N', CNORM is an output argument and CNORM(j) returns the 1-norm of the offdiagonal part of the j-th column of A. 🌈
  • WORK β€” WORK is REAL array, dimension (LWORK). On exit, if INFO = 0, WORK(1) returns the optimal size of WORK. 🧚
  • LWORK β€” LWORK is INTEGER. The size rule is literally: LWORK >= MAX(1, 2*NBA * MAX(NBA, MIN(NRHS, 32)), where NBA = (N + NB - 1)/NB and NB is the optimal block size. If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal dimensions 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. πŸ’œ

πŸ’– Parameters πŸ’–

  • INFO β€” INFO is INTEGER. = 0: successful exit. < 0: if INFO = -k, the k-th argument had an illegal value. 😭

🌟 Author 🌟

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

πŸ” Further Details

The original page leaves this section empty, bestie β€” no extra notes here. That's the whole vibe. πŸ’…

Definition at line 227 of file slatrs3.f.


🌟 Author 🌟

Generated automatically by Doxygen for LAPACK from the source code.


πŸ’– cute sign-off: this page is from LAPACK, Version 3.12.0, and the page path is /home/abui.../slatrs3.f(3). That's the source/version info from the footer, bestie β€” slay. πŸŽ€βœ¨
πŸ“¦ where this page comes from