Parallel solution of Toeplitzlike linear systems
From MaRDI portal
Publication:1190529
DOI10.1016/0885-064X(92)90031-6zbMath0753.65022OpenAlexW2035714636MaRDI QIDQ1190529
Publication date: 26 September 1992
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(92)90031-6
parallel algorithmmatrix inversionNewton's iterationpolylogarithmic time boundToeplitz like matriceswell-conditioned Toeplitz linear systems
Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (12)
Structured matrices and Newton's iteration: unified approach ⋮ Newton's iteration for inversion of Cauchy-like and other structured matrices ⋮ Parallel computation of polynomial GCD and some related parallel computations over abstract fields ⋮ Iterative inversion of structured matrices ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ Randomized preprocessing versus pivoting ⋮ Root-finding by expansion with independent constraints ⋮ Homotopic residual correction processes ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Efficient parallel factorization and solution of structured and unstructured linear systems ⋮ New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration ⋮ Improved parallel computations with Toeplitz-like and Hankel-like matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for solving Toeplitz systems of equations
- Efficient solution of linear systems of equations with recursive structure
- Complexity of parallel matrix computations
- The weak and strong stability of algorithms in numerical linear algebra
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Displacement ranks of matrices and linear equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- On the computational power of pushdown automata
- On Computations with Dense Structured Matrices
- Stability of Methods for Solving Toeplitz Systems of Equations
- Fast Parallel Algorithms for QR and Triangular Factorization
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Fast Parallel Matrix Inversion Algorithms
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- The Parallel Evaluation of General Arithmetic Expressions
- Fast parallel matrix and GCD computations
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
This page was built for publication: Parallel solution of Toeplitzlike linear systems