applyQ
Q · y, or Qᵀ · y when transpose, without forming Q; see F64Decompositions.applyQ.
ldl
Symmetric indefinite factorization A = L·D·Lᵀ with the active backend. Uplo.FULL checks that both triangles agree; Uplo.LOWER or Uplo.UPPER selects one triangle without checking the other.
lu
LU-factorize this square matrix with the active backend (koblas); see F64Decompositions.factor.
qr
QR factorization A = Q·R with the active backend; see F64Decompositions.qr.
qrPivoted
QR with column pivoting, A·P = Q·R, with the active backend; see F64Decompositions.qrPivoted.
rcond
Reciprocal condition estimate, given the 1-norm anorm of the matrix it came from; see F64Decompositions.rcond. Pair it with com.eignex.koblas.norm1, computed before factoring.
solve
Solve A · x = b for this factorization with the active backend; see F64Decompositions.solve.
Solve A · x = b (or Aᵀ · x = b when transpose) for this factorization with the active backend.
Solve A · X = B for the columns of b at once (LAPACK dgetrs with nrhs).
Solve A · x = b for this symmetric indefinite factorization; see F64Decompositions.solve.
Solve A · X = B for the columns of b at once (LAPACK dsytrs with nrhs).
Solve this QR factorization; minimumNorm solves a wide original system from qr(Aᵀ).
Least-squares solution against this rank-revealing factorization; see F64Decompositions.solve.