Analysis of Pairwise Pivoting in Gaussian Elimination

DOI10.1109/TC.1985.1676570zbMath0551.65014OpenAlexW2084727637MaRDI QIDQ3343309

Danny C. Sorensen

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.1676570

zbMATH Keywords

parallel computationerror analysisGaussian eliminationsystolic arraypairwise pivoting

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Comparing pivoting strategies for almost strictly sign regular matrices, Growth factors of pivoting strategies associated with Neville elimination, Increasing data locality and introducing level-3 BLAS in the neville elimination, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, Backward error analysis of Neville elimination, Parallel algorithms for \(LU\) decomposition on a shared memory multiprocessor, An improved forecasting approach to reduce inventory levels in decentralized supply chains, Communication lower bounds and optimal algorithms for numerical linear algebra, On systolic array methods for band matrix factorizations, Maintaining LU factors of a general sparse matrix