An efficient analyse phase for element problems

DOI10.1002/nla.1810zbMath1313.65044OpenAlexW2141953488MaRDI QIDQ2931513

Jonathan Hogg, Jennifer Scott

Publication date: 25 November 2014

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1810

zbMATH Keywords

numerical experimentsdirect solverfactorisationsupernodeanalyse phaseelement problemsparse symmetric linear systemsupervariable

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A survey of direct methods for sparse linear systems

Uses Software

• HSL
• MA57
• PARDISO
• SuperLU
• METIS
• CHOLMOD
• SparseMatrix
• WSMP
• symrcm
• MA27
• HSL_MA77

Cites Work

• Unnamed Item
• Unnamed Item
• An out-of-core sparse Cholesky solver
• The university of Florida sparse matrix collection
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• 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
• An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
• Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
• The influence of relaxed supernode partitions on the multifrontal method
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• Computing row and column counts for sparse \(QR\) and \(LU\) factorization

This page was built for publication: An efficient analyse phase for element problems