An algebraic sparsified nested dissection algorithm using low-rank approximations

L Cambier, C Chen, EG Boman, S Rajamanickam… - SIAM Journal on Matrix …, 2020 - SIAM
We propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite
linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection …

Hierarchical orthogonal factorization: Sparse least squares problems

A Gnanasekaran, E Darve - Journal of Scientific Computing, 2022 - Springer
In this work, we develop a fast hierarchical solver for solving large, sparse least squares
problems. We build upon the algorithm, spaQR (sparsified QR Gnanasekaran and Darve in …

Hierarchical orthogonal factorization: Sparse square matrices

A Gnanasekaran, E Darve - SIAM Journal on Matrix Analysis and Applications, 2022 - SIAM
In this work, we develop a new fast algorithm, spaQR---sparsified QR---for solving large,
sparse linear systems. The key to our approach lies in using low-rank approximations to …

On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques

G Pichon - 2018 - inria.hal.science
Solving sparse linear systems is a problem that arises in many scientific applications, and
sparse direct solvers are a time consuming and key kernel for those applications and for …

[图书][B] Fast Orthogonal Factorization for Sparse Matrices: Theory, Implementation, and Application

A Gnanasekaran - 2022 - search.proquest.com
Sparse linear systems and least-squares problems appear in various scientific applications
ranging from classic domains like computational physics to growing fields like data science …

2D static resource allocation for compressed linear algebra and communication constraints

O Beaumont, L Eyraud-Dubois… - 2020 IEEE 27th …, 2020 - ieeexplore.ieee.org
This paper adresses static resource allocation problems for irregular distributed parallel
applications. More precisely, we focus on two classical tiled linear algebra kernels: the …

Algorithmes d'allocation statique pour la planification d'applications haute performance

M Vérité - 2022 - theses.hal.science
De nos jours, les applications d'algèbre linéraire sont couramment utilisées pour traiter des
problèmes dont la grande taille requiert une exécution parallèle distribuée par des plate …

[图书][B] Fast and Scalable Hierarchical Linear Solvers

L Cambier - 2020 - search.proquest.com
Linear solvers are a key component of scientific computing. In Chapter 2 we develop a new
algorithm for the fast solution of large, sparse linear systems, spaND (sparsified Nested …

[图书][B] Multiscale Algorithms for Structured Matrices: Fast Solvers and Deep Learning

JF Fabà - 2021 - search.proquest.com
MULTISCALE ALGORITHMS FOR STRUCTURED MATRICES: FAST SOLVERS AND
DEEP LEARNING A DISSERTATION SUBMITTED TO THE INSTITUTE FOR COMP Page 1 …

[PDF][PDF] L'UNIVERSITÉ DE BORDEAUX

G Pichon - 2018 - researchgate.net
Solving sparse linear systems is a problem that arises in many scientific applications, and
sparse direct solvers are a time consuming and key kernel for those applications and for …