Efficient parallel factorization and solution of structured and unstructured linear systems
DOI10.1016/j.jcss.2004.12.010zbMath1079.65143OpenAlexW2121472090MaRDI QIDQ2486566
Publication date: 5 August 2005
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2004.12.010
linear systemsPadé approximationNewton iterationsparse matricesparallel algorithmsdense matricesToeplitz matricesresultantstructured matricesdisplacement rank\(LU\) factorizationpolynomial greatest common divisor
Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple algorithms for approximating all roots of a polynomial with real roots
- Matrix multiplication via arithmetic progressions
- Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
- Complexity of parallel matrix computations
- Displacement ranks of matrices and linear equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- The parallel computation of minimum cost paths in graphs by stream contraction
- On fast multiplication of polynomials over arbitrary algebras
- Parallel solution of Toeplitzlike linear systems
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- Inverse eigenvalue problems for Jacobi matrices
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Fast and efficient parallel solution of dense linear systems
- On parallel computations with banded matrices
- On Computations with Dense Structured Matrices
- The Probability That a Numerical Analysis Problem is Difficult
- Superfast Solution of Real Positive Definite Toeplitz Systems
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- A Separator Theorem for Planar Graphs
- Generalized Nested Dissection
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- On the Complexity of Polynomial Zeros
- A view of three decades of linear filtering theory
- Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
- Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Fast parallel matrix and GCD computations
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- A Note on an Iterative Method for Generalized Inversion of Matrices
- On Iterative Computation of Generalized Inverses and Associated Projections
- Polynomial Remainder Sequences and Determinants
- On Euclid's Algorithm and the Theory of Subresultants
- The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
- Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
- Some New Methods in Matrix Calculation
- Further Points on Matrix Calculation and Simultaneous Equations
