Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs
DOI10.1016/J.CAM.2015.09.012zbMATH Open1330.65050OpenAlexW1771953724MaRDI QIDQ898930FDOQ898930
Authors: Xianyu Zuo, Zeyao Mo, Tongxiang Gu, Ai-qing Zhang, Xiao-Wen Xu 
Publication date: 21 December 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.09.012
Recommendations
- PARFES: A method for solving finite element linear equations on multi-core computers
- A parallel multifrontal algorithm and its implementation
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Data-Parallel Sparse Factorization
factorization methodnumerical experimentparallelizationHSS structurelow-rank propertymulti-core system structuresupernodal multifrontal method
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Factorization of matrices (15A23)
Cites Work
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Nested Dissection of a Regular Finite Element Mesh
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Use of Linear Graphs in Gauss Elimination
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- A fast direct solver for elliptic problems on general meshes in 2D
- On a new class of structured matrices
- Complexity Bounds for Regular Finite Difference and Finite Element Grids
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- A bibliography on semiseparable matrices
- Parallel Symbolic Factorization for Sparse LU with Static Pivoting
- On the numerical rank of the off-diagonal blocks of Schur complements of discretized elliptic PDEs
- Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- The Product Form of Inverses of Sparse Matrices and Graph Theory
Cited In (4)
- PARFES: A method for solving finite element linear equations on multi-core computers
- A preconditioned finite element solution of the coupled pressure-temperature equations used to model trace gas sensors
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Title not available (Why is that?)
Uses Software
This page was built for publication: Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898930)
