Pages that link to "Item:Q1002256"
From MaRDI portal
The following pages link to A Lanczos bidiagonalization algorithm for Hankel matrices (Q1002256):
Displaying 16 items.
- Fast ESPRIT algorithms based on partial singular value decompositions (Q477709) (← links)
- A fast SVD for multilevel block Hankel matrices with minimal memory storage (Q494681) (← links)
- Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms (Q512854) (← links)
- Bilinear Lanczos components for fast dimensionality reduction and feature extraction (Q991249) (← links)
- A fast method to diagonalize a Hankel matrix (Q1124767) (← links)
- The Lanczos algorithm and Hankel matrix factorization (Q1194514) (← links)
- A fast eigenvalue algorithm for Hankel matrices (Q1587283) (← links)
- \textsc{mxpfit}: a library for finding optimal multi-exponential approximations (Q2102498) (← links)
- High-order sum-of-squares structured tensors: theory and applications (Q2178622) (← links)
- A fast symmetric SVD algorithm for square Hankel matrices (Q2465321) (← links)
- A fast method to block-diagonalize a Hankel matrix (Q2477406) (← links)
- On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics. (Q2829108) (← links)
- A fast rank-reduction algorithm based on block Hankel Hankel block matrix-vector multiplication with applications to seismic signal processing (Q2924617) (← links)
- Hessenberg Matrix Properties and Ritz Vectors in the Finite-Precision Lanczos Tridiagonalization Process (Q3225529) (← links)
- Fast Hankel tensor–vector product and its application to exponential data fitting (Q5739726) (← links)
- An efficient quantum algorithm for spectral estimation (Q6100594) (← links)