cho_solve(c_and_lower, b, overwrite_b=False, check_finite=True)

Parameters

(c, lower) : tuple, (array, bool)

Cholesky factorization of a, as given by cho_factor

b : array

Right-hand side

overwrite_b : bool, optional

Whether to overwrite data in b (may improve performance)

check_finite : bool, optional

Whether to check that the input matrices contain 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.

Returns

x : array

The solution to the system A x = b

Solve the linear equations A x = b, given the Cholesky factorization of A.

See Also

cho_factor

Cholesky factorization of a matrix

Examples

>>> from scipy.linalg import cho_factor, cho_solve
... A = np.array([[9, 3, 1, 5], [3, 7, 5, 1], [1, 5, 9, 2], [5, 1, 2, 6]])
... c, low = cho_factor(A)
... x = cho_solve((c, low), [1, 1, 1, 1])
... np.allclose(A @ x - [1, 1, 1, 1], np.zeros(4))
True

See :

Back References

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

Local connectivity graph

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

---

GitHub : /scipy/linalg/_decomp_cholesky.py#157
type: <class 'function'>
Commit: