SRC/slasyf.f(3)

πŸ’… SRC/slasyf.f(3) πŸ’…

okay so bestie, welcome to the SRC/slasyf.f(3) page from the Library Functions Manual. It’s highkey giving tiny Fortran icon energy. Let’s get into it πŸ’–βœ¨ no cap.

✨ NAME ✨

SRC/slasyf.f

🌸 SYNOPSIS 🌸

Functions/Subroutines

  • subroutine slasyf (uplo, n, nb, kb, a, lda, ipiv, w, ldw, info) β€” SLASYF computes a partial factorization of a real symmetric matrix using the Bunch-Kaufman diagonal pivoting method. πŸ”₯

πŸ’– Function/Subroutine Documentation πŸ’–

subroutine slasyf (character uplo, integer n, integer nb, integer kb, real, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, real, dimension( ldw, * ) w, integer ldw, integer info)

SLASYF computes a partial factorization of a real symmetric matrix using the Bunch-Kaufman diagonal pivoting method.

πŸŽ€ Purpose πŸŽ€

SLASYF computes a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method β€” iconic. The partial factorization has the form:

A  =  ( I  U12 ) ( A11  0  ) (  I       0    )  if UPLO = 'U', or:
      ( 0  U22 ) (  0   D  ) ( U12**T U22**T )

A  =  ( L11  0 ) (  D   0  ) ( L11**T L21**T )  if UPLO = 'L'
      ( L21  I ) (  0  A22 ) (  0       I    )

where the order of D is at most NB. The actual order is returned in the argument KB, and is either NB or NB-1, or N if N <= NB.

SLASYF is an auxiliary routine called by SSYTRF. It uses blocked code (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or A22 (if UPLO = 'L'). slay. The way that it splits the matrix? lowkey obsessed, fr fr. The formulas are literally right here 😭. Periodt.

🧚 Parameters 🧚

  • UPLO β€” UPLO is CHARACTER*1. Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:
    • = 'U': Upper triangular
    • = 'L': Lower triangular
  • N β€” N is INTEGER. The order of the matrix A. N >= 0.
  • NB β€” NB is INTEGER. The maximum number of columns of the matrix A that should be factored. NB should be at least 2 to allow for 2-by-2 pivot blocks.
  • KB β€” KB is INTEGER. The number of columns of A that were actually factored. KB is either NB-1 or NB, or N if N <= NB.
  • A β€” A is REAL array, dimension (LDA,N). On entry, the symmetric matrix A. If UPLO = 'U', the leading n-by-n upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading n-by-n lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced. On exit, A contains details of the partial factorization.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • IPIV β€” IPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure of D. main character energy, honestly. not me being obsessed with pivot blocks. iykyk.
    • If UPLO = 'U':
      • Only the last KB elements of IPIV are set.
      • If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
      • If IPIV(k) = IPIV(k-1) < 0, then rows and columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k) is a 2-by-2 diagonal block.
    • If UPLO = 'L':
      • Only the first KB elements of IPIV are set.
      • If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1-by-1 diagonal block.
      • If IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.
  • W β€” W is REAL array, dimension (LDW,NB).
  • LDW β€” LDW is INTEGER. The leading dimension of the array W. LDW >= max(1,N).
  • INFO β€” INFO is INTEGER.
    • = 0: successful exit
    • > 0: if INFO = k, D(k,k) is exactly zero. The factorization has been completed, but the block diagonal matrix D is exactly singular.

πŸ‘‘ Author πŸ‘‘

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

🌈 Contributors: 🌈

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

Definition at line 175 of file slasyf.f.

πŸ¦‹ Author πŸ¦‹

Generated automatically by Doxygen for LAPACK from the source code.

ngl, that’s the whole page, bestie! footer vibe check: LAPACK, Version 3.12.0, SRC/slasyf.f(3) β€” that’s the source/version info, and there’s no separate date line in this footer. Bye bestie πŸ’–βœ¨πŸ«Ά

πŸ“¦ where this page comes from