scientific article; zbMATH DE number 2201195

zbMATH Open1075.65038MaRDI QIDQ5313620FDOQ5313620

Authors:

Publication date: 1 September 2005

Title of this publication is not available (Why is that?)

Recommendations

• Modification of the minimum-degree algorithm by multiple elimination
• The Evolution of the Minimum Degree Ordering Algorithm
• Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
• The multiple minimum degree ordering with greedy graph compression for vector computers
• scientific article; zbMATH DE number 4074330

zbMATH Keywords

numerical examplesdirect methodblock factorizationroundoff errorscolouring graphsfinite element gridsfill-in effect

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) Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• Title not available (Why is that?)
• Sparsified block elimination for directed laplacians

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 Q5313620)