SRC/sgbtf2.f(3)

๐Ÿ“ฆ
version 3.12.1 ยท 4 versions
, in arch rolling

okay so bestie, welcome to SRC/sgbtf2.f(3) โ€” this page lives in the Library Functions Manual, and it is literally giving LAPACK band-matrix main-character energy ๐Ÿ’…โœจ

๐ŸŒธ NAME ๐ŸŒธ

SRC/sgbtf2.f

โœจ SYNOPSIS โœจ

๐Ÿงš Functions/Subroutines ๐Ÿงš

subroutine sgbtf2 (m, n, kl, ku, ab, ldab, ipiv, info)

SGBTF2 computes the LU factorization of a general band matrix using the unblocked version of the algorithm. periodt ๐Ÿ”ฅ

๐Ÿ“š Function/Subroutine Documentation ๐Ÿ“š

subroutine sgbtf2 (integer m, integer n, integer kl, integer ku, real, dimension( ldab, * ) ab, integer ldab, integer, dimension( * ) ipiv, integer info)

SGBTF2 computes the LU factorization of a general band matrix using the unblocked version of the algorithm.

๐ŸŽฏ Purpose: ๐ŸŽฏ

SGBTF2 computes an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges. ๐Ÿซถ This is the unblocked version of the algorithm, calling Level 2 BLAS. โญ

๐Ÿงฎ Parameters ๐Ÿงฎ

  • M โ€” M is INTEGER. It's the number of rows of the matrix A. M >= 0. ๐Ÿ’–
  • N โ€” N is INTEGER. It's the number of columns of the matrix A. N >= 0. ๐Ÿ’–
  • KL โ€” KL is INTEGER. It's the number of subdiagonals within the band of A. KL >= 0. ๐Ÿ’–
  • KU โ€” KU is INTEGER. It's the number of superdiagonals within the band of A. KU >= 0. ๐Ÿ’–
  • AB โ€” AB is REAL array, dimension (LDAB,N). On entry, it's the matrix A in band storage, in rows KL+1 to 2*KL+KU+1; rows 1 to KL of the array need not be set. The j-th column of A is stored in the j-th column of the array AB as follows: AB(kl+ku+1+i-j,j) = A(i,j) for max(1,j-ku)<=i<=min(m,j+kl). On exit, details of the factorization: U is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to KL+KU+1, and the multipliers used during the factorization are stored in rows KL+KU+2 to 2*KL+KU+1. See below for further details. ๐Ÿซถ
  • LDAB โ€” LDAB is INTEGER. It's the leading dimension of the array AB. LDAB >= 2*KL+KU+1. ๐Ÿ’…
  • IPIV โ€” IPIV is INTEGER array, dimension (min(M,N)). These are the pivot indices; for 1 <= i <= min(M,N), row i of the matrix was interchanged with row IPIV(i). ๐ŸŽ€
  • INFO โ€” INFO is INTEGER:
    • = 0: successful exit โœ…
    • < 0: if INFO = -i, the i-th argument had an illegal value โŒ
    • > 0: if INFO = +i, U(i,i) is exactly zero. The factorization has been completed, but the factor U is exactly singular, and division by zero will occur if it is used to solve a system of equations. ๐Ÿ’€

๐Ÿ‘‘ Author ๐Ÿ‘‘

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

๐ŸŒˆ Further Details: ๐ŸŒˆ

The band storage scheme is illustrated by the following example, when M = N = 6, KL = 2, KU = 1:

On entry:                       On exit:

    *    *    *    +    +    +       *    *    *   u14  u25  u36
    *    *    +    +    +    +       *    *   u13  u24  u35  u46
    *   a12  a23  a34  a45  a56      *   u12  u23  u34  u45  u56
   a11  a22  a33  a44  a55  a66     u11  u22  u33  u44  u55  u66
   a21  a32  a43  a54  a65   *      m21  m32  m43  m54  m65   *
   a31  a42  a53  a64   *    *      m31  m42  m53  m64   *    *

Array elements marked * are not used by the routine; elements marked + need not be set on entry, but are required by the routine to store elements of U, because of fill-in resulting from the row interchanges. ๐ŸŒธ

Definition at line 144 of file sgbtf2.f.

๐Ÿ‘‘ Author ๐Ÿ‘‘

Generated automatically by Doxygen for LAPACK from the source code.


okay bestie, that's the whole vibe: LAPACK, Version 3.12.0, page SRC/sgbtf2.f(3). go off and factor that band matrix responsibly ๐Ÿ’–โœจ

๐Ÿ“ฆ where this page comes from