Efficient parallel factorization and solution of structured and unstructured linear systems

DOI10.1016/J.JCSS.2004.12.010zbMATH Open1079.65143OpenAlexW2121472090MaRDI QIDQ2486566FDOQ2486566

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

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

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)

Cites Work

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

Cited In (4)

• 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
• Title not available (Why is that?)

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)