A recursive partitioning algorithm for matrix inversion on parallel computers

DOI10.1108/03684929810221519MaRDI QIDQ4269907zbMATH OpenOpenAlexFDO

Authors Ralf Östermark

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

high performanceLU-factorization algorithmparallel computingparallel optimization algorithmsrecursive matrix inversion algorithm

Mathematics Subject Classification ID

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

Recommendations

• Optimal parallelization of a recursive algorithm for triangular matrix inversion on MIMD computers
• A recursive partitioning algorithm for inverting tridiagonal matrices
• The inversion of matrices by the double-bordering algorithm on MIMD computers
• A note on parallel matrix inversion

Cites work

• A multiprocessor interior point algorithm
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 434716 (Why is no real title available?)
• Optimization by Direct Search in Matrix Computations

Cited in

(6)

• Parallel experience on the inverse matrix computation
• Recursive inverse matrix algorithm in granular mechanics applications
• Memory-usage advantageous block recursive matrix inverse
• A note on parallel matrix inversion
• scientific article; zbMATH DE number 988719 (Why is no real title available?)
• Optimal parallelization of a recursive algorithm for triangular matrix inversion on MIMD computers

Describes a project that uses

Uses Software

• LAPACK
• SUMMA

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

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