CHOLSOL is based on the routine cholsl described in section 2.9 of Numerical Recipes in C: The Art of Scientific Computing (Second Edition), published by Cambridge University Press, and is used by permission.
Note: If you are working with complex inputs, use the LA_CHOLSOL procedure instead.
To solve a positive-definite symmetric system Ax = b:
;Define the coefficient array:
A = [[ 6.0, 15.0, 55.0], $
[15.0, 55.0, 225.0], $
[55.0, 225.0, 979.0]]
;Define the right-hand side vector B:
B = [9.5, 50.0, 237.0]
;Compute Cholesky decomposition of A:
CHOLDC, A, P
;Compute and print the solution:
PRINT, CHOLSOL(A, P, B)
-0.499998 -1.00000 0.500000
The exact solution vector is [-0.5, -1.0, 0.5].
Result = CHOLSOL( A, P, B [, /DOUBLE] )
Returns an n-element vector containing the solution to the set of linear equations Ax = b, where A is the positive-definite symmetric array returned by the CHOLDC.
An n by n positive-definite symmetric array, as output by CHOLDC. Only the lower triangle of A is accessed.
Note: If CHOLSOL is complex then only the real part is used for the computation.
The diagonal elements of the Cholesky factor L, as computed by CHOLDC.
An n-element vector containing the right-hand side of the equation.
Set this keyword to force the computation to be done in double-precision arithmetic.
This page has no comments yet. Be the first one!