eigh(a, b=None, lower=True, eigvals_only=False, overwrite_a=False, overwrite_b=False, turbo=False, eigvals=None, type=1, check_finite=True, subset_by_index=None, subset_by_value=None, driver=None)

Notes

Parameters

a : (M, M) array_like

b : (M, M) array_like, optional

lower : bool, optional

eigvals_only : bool, optional

subset_by_index : iterable, optional

subset_by_value : iterable, optional

driver : str, optional

type : int, optional

overwrite_a : bool, optional

overwrite_b : bool, optional

check_finite : bool, optional

turbo : bool, optional, deprecated

eigvals : tuple (lo, hi), optional, deprecated

Raises

LinAlgError

Returns

w : (N,) ndarray

v : (M, N) ndarray

See Also

eig

eigh_tridiagonal

eigvalsh

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.linalg._decomp:eigvalsh

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.py#270
type: <class 'function'>
Commit: