An Algorithm for the Inversion of Finite Hankel Matrices
From MaRDI portal
Cited in
(24)- Stable factorization for Hankel and Hankel‐like matrices
- Computing the coefficients of a recurrence formula for numerical integration by moments and modified moments
- A new algorithm for computing orthogonal polynomials
- The Lanczos algorithm and Hankel matrix factorization
- On the inversion of infinite moment matrices
- Computational methods of linear algebra
- Maximizing Probability Bounds Under Moment-Matching Restrictions
- The Padé-Rayleigh-Ritz method for solving large Hermitian eigenproblems
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
- Inversion components of block Hankel-like matrices
- Displacement ranks of matrices and linear equations
- A method for finding the zeros of polynomials using a companion matrix.
- Swarm intelligence algorithm for interconnect model order reduction with sub-block structure preserving
- Fast algorithms for Toeplitz and Hankel matrices
- A look-ahead algorithm for the solution of general Hankel systems
- Biorthogonal polynomials and the bordering method for linear systems
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- Computation of Padé approximants and continued fractions
- Solution of linear equations with Hankel and Toeplitz matrices
- Numerical solution of the eigenvalue problem for efficiently structured Hermitian matrices
- A note on a Toeplitz inversion formula
- Anti-Hadamard matrices
- A unified derivation for fast estimation algorithms by the conjugate direction method
- Division algorithms for continued fractions and the Padé table
This page was built for publication: An Algorithm for the Inversion of Finite Hankel Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5507958)
