lis_array_cgs(3)

✨ lis_array_cgs ✨

okay so bestie, we're deep in the Lis Library Functions section of the manual, and today's main character is lis_array_cgs(3) 💅

---

🌸 NAME 🌸

lis_array_cgs — bestie, this is the one that does the QR factorization using the classical Gram-Schmidt process. that's the whole vibe. 🎀

---

🦋 SYNOPSIS 🦋

#include "lis.h"

LIS_INT lis_array_cgs(LIS_INT n, LIS_SCALAR a[], LIS_SCALAR q[],
LIS_SCALAR r[]);

like, that's the signature, no notes, copy it exactly or it will not compile and you will cry 😭

---

💖 DESCRIPTION 💖

so what it literally does: it calculates the QR factorization where QR=A, and it does it with the classical Gram-Schmidt process. that's it. that's the function. iconic behavior honestly 👑

---

🌈 INPUT 🌈

• n — the size of the matrices, lowkey important, do not skip it 🙈
• a — the array that stores matrix A, and it's size n * n fr fr

---

🎀 OUTPUT 🎀

• q — the array that stores the orthogonal matrix Q, size n * n ✨
• r — the array that stores the upper-triangular matrix R, size n * n 💜

---

💀 EXIT STATUS 💀

these are the exit values you might get back, bestie, so pay attention:

• 0 — the process is normally terminated, we ate, everything's good 🫶
• unspecified — an error occurred. not me finding out the hard way 💀

---

🧚 SEE ALSO 🧚

• lis(3)
• http://www.ssisc.org/lis/

---

bestie if you're gonna use this, remember: it's Gram-Schmidt, classical flavor, and the sizes are n * n across the board. no cap. ⭐

---

okay that's the whole page! 🌸 this lil masterpiece lives in the lis_array_cgs(3) man page, Man Page, dated 3 Dec 2014, and it's giving exactly what it needs to give. mwah, love u, go factor some matrices 💅🍓