The Triangular Decomposition of Hankel Matrices

DOI10.2307/2005223zbMath0222.65053OpenAlexW4237218935MaRDI QIDQ5627578

James L. Phillips

Publication date: 1971

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2005223

Mathematics Subject Classification ID

Related Items (20)

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

This page was built for publication: The Triangular Decomposition of Hankel Matrices