High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods
DOI10.1007/s10483-006-1006-1zbMath1167.65354OpenAlexW2079770721MaRDI QIDQ1030424
Pu Chen, Kai-xin Liu, Wei-ran Yuan
Publication date: 1 July 2009
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10483-006-1006-1
numerical examplesPetrov-Galerkin methoddirect methodmeshless methodsmatrix factorization algorithmunsymmetrical sparse linear systems
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (3)
Uses Software
Cites Work
- A new meshless local Petrov-Galerkin (MLPG) approach in computational mechanics
- High performance sparse static solver in finite element analyses with loop-unrolling.
- The meshless local Petrov-Galerkin (MLPG) approach for solving problems in elasto-statics
- Sparse algorithms for indefinite system of linear equations
- A performance assessment of NE/Nastran's new sparse direct and iterative solvers
- Vector-sparse solver for unsymmetrical matrices
- An overview of SuperLU
- Solution of linear equations with skyline-stored symmetric matrix
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Supernodal Approach to Sparse Partial Pivoting
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Parallel cholesky method on MIMD with shared memory
- The impact of an efficient linear solver on finite element analyses
- Algorithm 837
This page was built for publication: High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods