An Algorithm for the Inversion of Finite Hankel Matrices

From MaRDI portal
Publication:5507958

DOI10.1137/0113078zbMath0135.17801OpenAlexW2014919300MaRDI QIDQ5507958

William F. Trench

Publication date: 1965

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0113078



Related Items

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