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

💖 NAME 💖

hey bestie, this is the sorbdb6.f(3) page from the Library Functions Manual — it's all about SORBDB6, and we're gonna get you comfy with it, periodt ✨

🌸 SYNOPSIS 🌸

   Functions/Subroutines
       subroutine SORBDB6 (m1, m2, n, x1, incx1, x2, incx2, q1, ldq1, q2, ldq2,
           work, lwork, info)
           SORBDB6

🦋 Function/Subroutine Documentation 🦋

here's the full signature, bestie — don't let the long line scare you, it's just a lot of arguments living their truth 💅

subroutine SORBDB6 (integer m1, integer m2, integer n, real, dimension(*)
    x1, integer incx1, real, dimension(*) x2, integer incx2, real,
    dimension(ldq1,*) q1, integer ldq1, real, dimension(ldq2,*) q2, integer
    ldq2, real, dimension(*) work, integer lwork, integer info)
SORBDB6

✨ Purpose ✨

okay so the purpose is giving very specific math-girl energy, and we're keeping it exactly as it is:

!>
!> SORBDB6 orthogonalizes the column vector
!>      X = [ X1 ]
!>          [ X2 ]
!> with respect to the columns of
!>      Q = [ Q1 ] .
!>          [ Q2 ]
!> The columns of Q must be orthonormal. The orthogonalized vector will
!> be zero if and only if it lies entirely in the range of Q.
!>
!> The projection is computed with at most two iterations of the
!> classical Gram-Schmidt algorithm, see
!> * L. Giraud, J. Langou, M. Rozložník.
!>   2002. CERFACS Technical Report No. TR/PA/02/33. URL:
!>   https://www.cerfacs.fr/algor/reports/2002/TR_PA_02_33.pdf
!>
!>

🎀 Parameters 🎀

parameter time — each one is getting its own little moment, and yes, we're keeping every constraint because rules are cute when they're clear 🫶

• M1 — M1 is INTEGER. It's the dimension of X1 and the number of rows in Q1. Constraint: 0 <= M1. 💅
• M2 — M2 is INTEGER. It's the dimension of X2 and the number of rows in Q2. Constraint: 0 <= M2. 💅
• N — N is INTEGER. It's the number of columns in Q1 and Q2. Constraint: 0 <= N. ✨
• X1 — X1 is REAL array, dimension (M1). On entry, it's the top part of the vector to be orthogonalized. On exit, it's the top part of the projected vector. 🫶
• INCX1 — INCX1 is INTEGER. Increment for entries of X1. 🌸
• X2 — X2 is REAL array, dimension (M2). On entry, it's the bottom part of the vector to be orthogonalized. On exit, it's the bottom part of the projected vector. 🫶
• INCX2 — INCX2 is INTEGER. Increment for entries of X2. 🌸
• Q1 — Q1 is REAL array, dimension (LDQ1, N). It's the top part of the orthonormal basis matrix. 👑
• LDQ1 — LDQ1 is INTEGER. It's the leading dimension of Q1. Constraint: LDQ1 >= M1. 💅
• Q2 — Q2 is REAL array, dimension (LDQ2, N). It's the bottom part of the orthonormal basis matrix. 👑
• LDQ2 — LDQ2 is INTEGER. It's the leading dimension of Q2. Constraint: LDQ2 >= M2. 💅
• WORK — WORK is REAL array, dimension (LWORK). 🧚
• LWORK — LWORK is INTEGER. It's the dimension of the array WORK. Constraint: LWORK >= N. ✨
• INFO — INFO is INTEGER; = 0: successful exit. < 0: if INFO = -i, the i-th argument had an illegal value. 👑

👑 Author 👑

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

📍 Definition at line 157 of file sorbdb6.f. 📍

👑 Author 👑

Generated automatically by Doxygen for LAPACK from the source code. 🧚

xoxo, bestie — this page is LAPACK Version 3.12.0, from /home/abui.../sorbdb6.f(3) 💜🌈