Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
DOI10.1007/S10596-019-09883-YzbMATH Open1427.65033OpenAlexW2973128606MaRDI QIDQ2009864FDOQ2009864
Authors: Sébastien de la Kethulle de Ryhove, Gilles Moreau, Daniil V. Shantsev, Patrick R. Amestoy, Jean-Yves L'Excellent 
Publication date: 2 December 2019
Published in: Computational Geosciences (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01912713/file/RR-9220.pdf
Recommendations
- On exploiting sparsity of multiple right-hand sides in sparse direct solvers
- A survey of direct methods for sparse linear systems
- A direct parallel sparse matrix solver
- Iterative solution methods for 3D controlled-source electromagnetic forward modelling of geophysical exploration scenarios
- New parallel sparse direct solvers for multicore architectures
direct solvernumerical modelingcontrolled-source electromagnetics (CSEM)marine electromagneticsmultiple sparse right-hand sides
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Factorization of matrices (15A23) Inverse problems in geophysics (86A22) Potentials, prospecting (86A20)
Cites Work
- ScaLAPACK Users' Guide
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- Nested Dissection of a Regular Finite Element Mesh
- A set of level 3 basic linear algebra subprograms
- Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- Direct methods for sparse matrices
- A Minimal Residual Interpolation Method for Linear Equations with Multiple Right-Hand Sides
- A Mapping Algorithm for Parallel Sparse Cholesky Factorization
- Predicting Structure in Sparse Matrix Computations
- On exploiting sparsity of multiple right-hand sides in sparse direct solvers
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Parallel computation of entries of \({A}^{-1}\)
- On the complexity of the block low-rank multifrontal factorization
- Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
Cited In (2)
Uses Software
This page was built for publication: Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009864)
