Function

SparseSolve

Solves the system AX = B for X, using the supplied double-precision factorization of A, and without any internal memory allocations.

Declaration

void SparseSolve(SparseOpaqueFactorization_Double Factored, DenseMatrix_Double B, DenseMatrix_Double X, void *workspace);

Parameters

Factored

Factorization of A.

B

The right-hand side, B.

X

Matrix in which to return solutions.

workspace

Scratch space of size solveWorkspaceRequiredStatic + nrhs * solveWorkspaceRequiredPerRHS, where nrhs is the number of right-hand sides to find solutions for.

Discussion

If the factorization is A = QR and the system is underdetermined, the solution of minimum norm ‖ X ‖₂ is returned.

If the factorization is A = QR and the system is overdetermined, the least squares solution argument minₓ ‖ AX - B ‖₂ is returned.

In the case of a factorization of type SparseFactorizationCholeskyAtA, the factorization is in fact of AᵀA, so the solution returned is for the system AᵀAX = B.

See Also

Direct Solving Functions with User-Defined Workspace

SparseSolve

Solves the system AX = B for X, using the supplied double-precision factorization of A, in place, and without any internal memory allocations.

SparseSolve

Solves the system AX = B for X, using the supplied single-precision factorization of A, in place, and without any internal memory allocations.

SparseSolve

Solves the system AX = B for X, using the supplied single-precision factorization of A, and without any internal memory allocations.