lis_array_cgs(3f)

πŸ“¦ version 2.1.11, in fedora 43, fedora 44, nixos 26.05, nixpkgs unstable

πŸ’– lis_array_cgs(3f) β€” the Lis Library Functions era πŸ’–

okay bestie, so this is a page from the Lis Library Functions manual, and it's about one little function that's honestly giving math girlboss energy. her name is lis_array_cgs, and she's here to do QR factorization with the classical Gram-Schmidt process. no cap. πŸŽ€


✨ NAME ✨

lis_array_cgs β€” calculate the QR factorization with the classical Gram-Schmidt process πŸ’…


🌸 SYNOPSIS 🌸

subroutine lis_array_cgs(LIS_INTEGER n, LIS_SCALAR a(), LIS_SCALAR q(),
LIS_SCALAR r(), LIS_INTEGER ierr);

like. look at her. four outputs and a size. iconic behavior honestly πŸ¦‹


πŸ’œ DESCRIPTION πŸ’œ

so what she does is: she calculates the QR factorization

QR=A

using the classical Gram-Schmidt process. that's it, that's the whole vibe. she takes your A and hands you back a Q and an R and she does it the classic way, not the fancy modified way, just so we're clear πŸ”₯


πŸ“ INPUT πŸ“

  • n β€” the size of the matrices, bestie. that's the number.
  • a β€” the array that stores matrix A of size n * n πŸ’–

✨ OUTPUT ✨

  • q β€” the array that stores the orthogonal matrix Q of size n * n. she's orthogonal, she's serving 🫢
  • r β€” the array that stores the upper-triangular matrix R of size n * n. upper triangular. very demure, very mindful, all those zeros below the diagonal ✨
also there's ierr in the synopsis, which is where she drops the error status, so keep an eye on her πŸ‘€

πŸ¦‹ SEE ALSO πŸ¦‹


πŸ’€ the sign-off πŸ’€

this page is from the Lis Library Functions manual, dated 3 Dec 2014, and she lives under the name lis_array_cgs(3f). periodt. go factor something πŸ’…βœ¨

πŸ“¦ where this page comes from