cho_factor(a, lower=False, overwrite_a=False, check_finite=True)
Returns a matrix containing the Cholesky decomposition, A = L L*
or A = U* U
of a Hermitian positive-definite matrix a. The return value can be directly used as the first parameter to cho_solve.
The returned matrix also contains random data in the entries not used by the Cholesky decomposition. If you need to zero these entries, use the function :None:None:`cholesky` instead.
Matrix to be decomposed
Whether to compute the upper or lower triangular Cholesky factorization (Default: upper-triangular)
Whether to overwrite data in a (may improve performance)
Whether to check that the input matrix contains only finite numbers. Disabling may give a performance gain, but may result in problems (crashes, non-termination) if the inputs do contain infinities or NaNs.
Raised if decomposition fails.
Matrix whose upper or lower triangle contains the Cholesky factor of a. Other parts of the matrix contain random data.
Flag indicating whether the factor is in the lower or upper triangle
Compute the Cholesky decomposition of a matrix, to use in cho_solve
cho_solve
Solve a linear set equations using the Cholesky factorization of a matrix.
>>> from scipy.linalg import cho_factor
... A = np.array([[9, 3, 1, 5], [3, 7, 5, 1], [1, 5, 9, 2], [5, 1, 2, 6]])
... c, low = cho_factor(A)
... c array([[3. , 1. , 0.33333333, 1.66666667], [3. , 2.44948974, 1.90515869, -0.27216553], [1. , 5. , 2.29330749, 0.8559528 ], [5. , 1. , 2. , 1.55418563]])
>>> np.allclose(np.triu(c).T @ np. triu(c) - A, np.zeros((4, 4))) TrueSee :
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.linalg._decomp_cholesky.cho_solve
scipy.linalg._decomp_cholesky.cho_factor
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them