Efficient parallel factorization and solution of structured and unstructured linear systems

DOI10.1016/J.JCSS.2004.12.010MaRDI QIDQ2486566zbMATH OpenOpenAlexFDO

Authors J. Reif

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

zbMATH Keywords

sparse matriceslinear systemsparallel algorithmsstructured matricesToeplitz matricesNewton iterationresultantdense matricesdisplacement rank\(LU\) factorizationpolynomial greatest common divisorPadé approximation

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 741168
• Parallel Solution of Certain Toeplitz Linear Systems
• scientific article; zbMATH DE number 641618
• LU factorization on parallel computers
• Fast and Efficient Parallel Solution of Sparse Linear Systems

Cites work

• scientific article; zbMATH DE number 432841 (Why is no real title available?)
• scientific article; zbMATH DE number 3151600 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3965444 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3679047 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 177858 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• scientific article; zbMATH DE number 1256710 (Why is no real title available?)
• scientific article; zbMATH DE number 4120318 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3451988 (Why is no real title available?)
• scientific article; zbMATH DE number 880382 (Why is no real title available?)
• scientific article; zbMATH DE number 3260031 (Why is no real title available?)
• A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
• A Note on an Iterative Method for Generalized Inversion of Matrices
• A Separator Theorem for Planar Graphs
• A view of three decades of linear filtering theory
• An Algorithm for the Inversion of Finite Toeplitz Matrices
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• Complexity of parallel matrix computations
• Displacement ranks of matrices and linear equations
• Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fast and Efficient Parallel Solution of Sparse Linear Systems
• Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
• Fast and efficient parallel solution of dense linear systems
• Fast parallel matrix and GCD computations
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Further Points on Matrix Calculation and Simultaneous Equations
• Generalized Nested Dissection
• Greatest common divisor via generalized Sylvester and Bezout matrices
• Inverse eigenvalue problems for Jacobi matrices
• Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
• Matrix multiplication via arithmetic progressions
• On Computations with Dense Structured Matrices
• On Euclid's Algorithm and the Theory of Subresultants
• On Iterative Computation of Generalized Inverses and Associated Projections
• On fast multiplication of polynomials over arbitrary algebras
• On parallel computations with banded matrices
• On the Complexity of Polynomial Zeros
• Parallel solution of Toeplitzlike linear systems
• Polynomial Remainder Sequences and Determinants
• Practical improvement of the divide-and-conquer eigenvalue algorithms
• Simple algorithms for approximating all roots of a polynomial with real roots
• Some New Methods in Matrix Calculation
• Superfast Solution of Real Positive Definite Toeplitz Systems
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
• The Probability That a Numerical Analysis Problem is Difficult
• The parallel computation of minimum cost paths in graphs by stream contraction

Cited in

(4)

• scientific article; zbMATH DE number 3999132 (Why is no real title available?)
• Parallel Factorization of Structured Matrices Arising in Stochastic Programming
• A quasi-random approach to matrix spectral analysis
• A multilevel parallel algorithm to solve symmetric Toeplitz linear systems

This page was built for publication: Efficient parallel factorization and solution of structured and unstructured linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486566)