Pages that link to "Item:Q1587283"
From MaRDI portal
The following pages link to A fast eigenvalue algorithm for Hankel matrices (Q1587283):
Displaying 15 items.
- Fast algorithms for calculating the eigenvalues of normal Hankel matrices (Q263946) (← links)
- Computational methods for generalized Sturmians basis (Q538604) (← links)
- A fast eigenvalue algorithm for Pascal matrices (Q868255) (← links)
- A Lanczos bidiagonalization algorithm for Hankel matrices (Q1002256) (← links)
- The Lanczos algorithm and Hankel matrix factorization (Q1194514) (← links)
- Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses (Q1881069) (← links)
- Online data-enabled predictive control (Q2123194) (← links)
- Fast algorithms for Toeplitz and Hankel matrices (Q2431168) (← links)
- A fast symmetric SVD algorithm for square Hankel matrices (Q2465321) (← links)
- The infinite Lanczos method for symmetric nonlinear eigenvalue problems (Q2693970) (← links)
- On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics. (Q2829108) (← links)
- (Q3974777) (← links)
- (Q4240207) (← links)
- Structured Inversion of the Bernstein Mass Matrix (Q5112236) (← links)
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices (Q5301192) (← links)