A recursive partitioning algorithm for matrix inversion on parallel computers

DOI10.1108/03684929810221519zbMath0933.65024OpenAlexW1999467695MaRDI QIDQ4269907

Ralf Oestermark

Publication date: 30 March 2000

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684929810221519

zbMATH Keywords

parallel computinghigh performanceparallel optimization algorithmsLU-factorization algorithmrecursive matrix inversion algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Uses Software

• LAPACK
• SUMMA

Cites Work

• Unnamed Item
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• Gaussian elimination is not optimal
• A multiprocessor interior point algorithm
• Optimization by Direct Search in Matrix Computations

This page was built for publication: A recursive partitioning algorithm for matrix inversion on parallel computers