solve(a, b, sym_pos=False)

Parameters

a : (M, M) array_like

A square matrix.

b : (M,) or (M, N) array_like

Right-hand side matrix in a x = b .

sym_pos : bool

Assume a is symmetric and positive definite. If True , use Cholesky decomposition.

Returns

x : (M,) or (M, N) Array

Solution to the system a x = b . Shape of the return matches the shape of b.

Solve the equation a x = b for x . By default, use LU decomposition and forward / backward substitutions. When sym_pos is True , use Cholesky decomposition.

Examples

See :

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

---

File: /dask/array/linalg.py#1198
type: <class 'function'>
Commit: