Failure of the symmetric-cholesky-decomposition assertion occurs because of 1 element in the decomposition. It did not fail on SBCL or LispWorks. Needs to be investigated.
…ors. In LispWorks, if either was NIL, it was ignored. In SBCL, the presence of the keywords generated an error.
For some reason, LispWorks accepts FINALLY RETURN. This is not conforming and generated an error in SBCL.
Uses the Cholesky decomposition, so the matrices have to be positive definite. May need to add logic to handle other types of symmetric/ hermitian matrices.
The solution vector is saved over the RHS vector. Send a copy of the contents in solve to preserve the data.
Preserves the array as symmetric/hermitian.
Instead of always creating a new result object, provide a way to store the results in an existing result object.
Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods Richard Barrett, Michael Berry, Tony F. Chan, James Demmel, June M. Donato, Jack Dongarra, Victor Eijkhout, Roldan Pozo, Charles Romine, and Henk Van der Vorst