A New Class of Parallel Algorithms for Solving Systems of Linear Equations

DOI10.1137/0910051zbMath0677.65021OpenAlexW1995803310MaRDI QIDQ3833497

Kishan Jainandunsing, E. F. A. Deprettere

Publication date: 1989

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0910051

zbMATH Keywords

systolic arraysCholesky factorizationLU factorizationGivens rotationsFaddeev's feed-forward methodQR factorization with backsubstitution

Mathematics Subject Classification ID

Factorization of matrices (15A23) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

LU factorization for matrices in quasiseparable form via orthogonal transformations ⋮ Stabilité numérique de l'algorithme de Levinson ⋮ Trends in systolic and cellular computation ⋮ Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming

This page was built for publication: A New Class of Parallel Algorithms for Solving Systems of Linear Equations