The Triangular Decomposition of Hankel Matrices
From MaRDI portal
Cited in
(20)- Displacement structure for Hankel, Vandermonde, and related (derived) matrices
- On the parallel arithmetic complexity of the root-finding problem
- Stable factorization for Hankel and Hankel‐like matrices
- The Lanczos algorithm and Hankel matrix factorization
- Computing the block factorization of complex Hankel matrices
- Euclid algorithm, orthogonal polynomials, and generalized Routh-Hurwitz algorithm
- Approximation of discrete linear systems based on a dual criterion
- Computational methods of linear algebra
- A fast method to diagonalize a Hankel matrix
- The Padé-Rayleigh-Ritz method for solving large Hermitian eigenproblems
- The spectrum of Jacobi matrices in terms of its associated weight function
- Application of the Lanczos-Phillips algorithm to continued fractions and its extension with orthogonal polynomials
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
- A method for finding the zeros of polynomials using a companion matrix.
- A fast method to block-diagonalize a Hankel matrix
- A look-ahead algorithm for the solution of general Hankel systems
- Lanczos method of tridiagonalization, Jacobi matrices and physics
- Solution of linear equations with Hankel and Toeplitz matrices
- Division algorithms for continued fractions and the Padé table
- Extension of the Lanczos-Phillips algorithm with Laurent biorthogonal polynomials and its application to the Thron continued fractions
This page was built for publication: The Triangular Decomposition of Hankel Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5627578)
