koblas
com.eignex.koblas/dense/QrDecomposition

QrDecomposition

class QrDecomposition(val m: Int, val n: Int, val qr: DoubleArray, val tau: DoubleArray)(source)

A QR factorization A = Q·R in LAPACK dgeqrf packed form: qr is the m×n column-major buffer with R on and above the diagonal and the Householder vectors below it (each vector's implicit leading 1 is not stored), and tau holds the min(m, n) reflector coefficients of H_k = I − tau_k·v_k·v_kᵀ with Q = H_0·H_1···H_{k−1}. Produced by LinearAlgebra.qr; consumed by LinearAlgebra.applyQ and LinearAlgebra.solveLeastSquares.

As with LuDecomposition, the format is shared across backends — a factorization produced by one backend applies and solves correctly on another. qr and tau are live buffers, not copies — treat them as read-only.

Constructors

QrDecomposition

constructor(m: Int, n: Int, qr: DoubleArray, tau: DoubleArray)(source)

Properties

m

val m: Int(source)

n

val n: Int(source)

qr

val qr: DoubleArray(source)

tau

val tau: DoubleArray(source)