Locality of Reference in LU Decomposition with Partial Pivoting

DOI10.1137/S0895479896297744MaRDI QIDQ4377494zbMATH OpenOpenAlexFDO

Authors Sivan Toledo

Publication date 9 February 1998

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Gaussian eliminationLU factorizationpartial pivotingright looking algorithmStrassen's matrix multiplication

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Publication:3471620
• LU Factorization Algorithms on Distributed-Memory Multiprocessor Architectures
• Algorithms for LU decomposition on a shared memory multiprocessor
• scientific article; zbMATH DE number 741177

Cited in

(19)

• Generalized matrix inversion is not harder than matrix multiplication
• A new efficient method for the numerical solution of linear time-dependent partial differential equations
• Fast linear algebra is stable
• scientific article; zbMATH DE number 1617983 (Why is no real title available?)
• scientific article; zbMATH DE number 4139186 (Why is no real title available?)
• Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
• Communication lower bounds and optimal algorithms for numerical linear algebra
• A graph based Davidson algorithm for the graph partitioning problem
• Linear algebra software for large-scale accelerated multicore computing
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• Optimal cache-oblivious mesh layouts
• Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
• LU decomposition and generalized Autoone-Takagi decomposition of dual matrices and their applications
• Very large electronic structure calculations using an out-of-core filter-diagonalization method
• NonlinearSolve.jl: high-performance and robust solvers for systems of nonlinear equations in Julia
• The cache complexity of multithreaded cache oblivious algorithms
• How to grade the accuracy of the BLAS
• Locality of reference in sparse Cholesky factorization methods
• Solving path problems on the GPU

Describes a project that uses

Uses Software

• LAPACK
• SOLAR
• GEMMW

This page was built for publication: Locality of Reference in LU Decomposition with Partial Pivoting

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