Parallel and superfast algorithms for Hankel systems of equations
From MaRDI portal
A unified approach for the construction of inversion algorithms for Hankel matrices is discussed which contains as special cases the Levinson type algorithms, Schur type algorithm and the fast parallel methods. The approach is based on Gohberg-Semencul type formulas and works for arbitrary Hankel matrices.
Recommendations
Cites work
- A new algorithm for solving Toeplitz systems of equations
- Algebraic methods for Toeplitz-like matrices and operators
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- scientific article; zbMATH DE number 3905732 (Why is no real title available?)
- scientific article; zbMATH DE number 3947329 (Why is no real title available?)
- scientific article; zbMATH DE number 3953612 (Why is no real title available?)
- scientific article; zbMATH DE number 3991705 (Why is no real title available?)
- scientific article; zbMATH DE number 3734289 (Why is no real title available?)
- Inversion of matrices with displacement structure
- Kernel structure of block Hankel and Toeplitz matrices and partial realization
- Laurent series and their Padé approximations
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- On inversion of Toeplitz and close to Toeplitz matrices
- On recursiveness and related topics in linear systems
- On the partial realization problem
- Recursive relations for block Hankel and Toeplitz systems. Part I: Direct recursions
Cited in
(16)- The Lanczos algorithm and Hankel matrix factorization
- A framework for polynomial preconditioners based on fast transforms. I: Theory
- Displacement structure of generalized inverse matrices
- Hankel matrices of finite rank with applications to signal processing and polynomials
- Iterative methods for discrete nonlinear Riemann-Hilbert problems
- Recursive solution of Cauchy-Vandermonde systems of equations
- Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile
- Vandermonde factorization and canonical representations of block Hankel matrices
- A new algorithm for computing orthogonal polynomials
- scientific article; zbMATH DE number 1617990 (Why is no real title available?)
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- scientific article; zbMATH DE number 17457 (Why is no real title available?)
- Sum-of-squares optimization without semidefinite programming
- scientific article; zbMATH DE number 4186995 (Why is no real title available?)
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
This page was built for publication: Parallel and superfast algorithms for Hankel systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920570)
