An efficient analyse phase for element problems.
From MaRDI portal
Recommendations
- A direct solver for finite element matrices requiring O(N N) memory places.
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- SPAR: a new architecture for large finite element computations
- scientific article; zbMATH DE number 5524595
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 2087097 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Supernodal Approach to Sparse Partial Pivoting
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
- An out-of-core sparse Cholesky solver
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Role of Elimination Trees in Sparse Factorization
- The University of Florida sparse matrix collection
- The influence of relaxed supernode partitions on the multifrontal method
Cited in
(3)
Describes a project that uses
Uses Software
This page was built for publication: An efficient analyse phase for element problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931513)