scientific article; zbMATH DE number 1924346

MaRDI QIDQ4707003zbMATH OpenFDO

Authors Jürgen Schulze

Publication date 4 June 2003

Full work available at URL http://d-nb.info/962060046

zbMATH Keywords

bottom-up methodcomputational performanceeliminationfactorizationfill-ingraphs and matricesmultilevel methodnested-dissection methodnumerical examplesorderingparallel computationpivotingsparse positive definite matricesspectrumtop-down method

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cited in

(5)

• Conditioning analysis of positive definite matrices by approximate factorizations
• Maintaining LU factors of a general sparse matrix
• scientific article; zbMATH DE number 4217769 (Why is no real title available?)
• The Factorization of Sparse Symmetric Indefinite Matrices
• Sparse direct factorizations through unassembled hyper-matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4707003)