Recursive version of LU decomposition

DOI10.1007/3-540-45262-1_38MaRDI QIDQ2724512zbMATH OpenFDO

Authors J. Waśniewski, K. A. Georgiev

Publication date 12 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45262-1_38

zbMATH Keywords

FORTRAN 90high performance algorithmsLAPACKLU factorizationrecursive algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 1810094
• Locality of Reference in LU Decomposition with Partial Pivoting
• Algorithm 979: Recursive algorithms for dense linear algebra -- the ReLAPACK collection
• Recursive algorithms of parallel matrix computations
• Parallel algorithms for \(LU\) decomposition on a shared memory multiprocessor

Cited in

(5)

• scientific article; zbMATH DE number 1810094 (Why is no real title available?)
• Generic support of algorithmic and structural recursion for scientific computing
• An efficient implementation of LU decomposition in C
• Algorithm 979: Recursive algorithms for dense linear algebra -- the ReLAPACK collection
• Aggregation of Markov flows I: theory

Describes a project that uses

Uses Software

• LAPACK

This page was built for publication: Recursive version of LU decomposition

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