hankel(c, r=None)

The Hankel matrix has constant anti-diagonals, with c as its first column and r as its last row. If r is not given, then :None:None:`r = zeros_like(c)` is assumed.

Parameters

c : array_like

First column of the matrix. Whatever the actual shape of c, it will be converted to a 1-D array.

r : array_like, optional

Last row of the matrix. If None, r = zeros_like(c) is assumed. r[0] is ignored; the last row of the returned matrix is [c[-1], r[1:]] . Whatever the actual shape of r, it will be converted to a 1-D array.

Returns

A : (len(c), len(r)) ndarray

The Hankel matrix. Dtype is the same as (c[0] + r[0]).dtype .

Construct a Hankel matrix.

See Also

circulant

circulant matrix

toeplitz

Toeplitz matrix

Examples

>>> from scipy.linalg import hankel
... hankel([1, 17, 99])
array([[ 1, 17, 99],
       [17, 99,  0],
       [99,  0,  0]])

>>> hankel([1,2,3,4], [4,7,7,8,9])
array([[1, 2, 3, 4, 7],
       [2, 3, 4, 7, 7],
       [3, 4, 7, 7, 8],
       [4, 7, 7, 8, 9]])

See :

Back References

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

scipy.linalg._special_matrices.circulant scipy.linalg._special_matrices.hankel scipy.linalg._special_matrices.toeplitz

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