Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
From MaRDI portal
Publication:3206191
Cited in
(12)- Complexity of parallel matrix computations
- Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Solving certain queueing problems modelled by Toeplitz matrices
- Fast operations on linearized polynomials and their applications in coding theory
- Remarks on complexity of polynomial and special matrix computations
- Rational interpolation and recursive solution of Löwner-Vandermonde systems of equations
- Algorithms for simultaneous Hermite-Padé approximations
- Preconditioned GMRES method for a class of Toeplitz linear systems in fractional eigenvalue problems
- Stabilité numérique de l'algorithme de Levinson
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- A note on a Toeplitz inversion formula
This page was built for publication: Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206191)