Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
Work
Year: 2017
Type: article
Abstract: In solving a linear system with iterative methods, one is usually confronted with the dilemma of having to choose between cheap, inefficient iterates over sparse search directions (e.g., coordinate de... more
Institutions UCLouvain, University of Namur
Cites: 28
Cited by: 11
Related to: 10
FWCI: 1.156
Citation percentile (by year/subfield): 72.71
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Decent work and economic growth
Open Access status: green
Grant IDS DYSCO, ARC 14/19-060