Locality of Reference in LU Decomposition with Partial Pivoting
From MaRDI portal
Publication:4377494
DOI10.1137/S0895479896297744zbMath0890.65025OpenAlexW2007768252MaRDI QIDQ4377494
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
Gaussian eliminationLU factorizationpartial pivotingStrassen's matrix multiplicationright looking algorithm
Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (12)
The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation ⋮ Optimal cache-oblivious mesh layouts ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Fast linear algebra is stable ⋮ Very large electronic structure calculations using an out-of-core filter-diagonalization method ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Solving path problems on the GPU ⋮ The cache complexity of multithreaded cache oblivious algorithms ⋮ A new efficient method for the numerical solution of linear time-dependent partial differential equations ⋮ Generalized matrix inversion is not harder than matrix multiplication ⋮ A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM
Uses Software
This page was built for publication: Locality of Reference in LU Decomposition with Partial Pivoting
