Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods
From MaRDI portal
Publication:5960916
DOI10.1023/A:1021908421589zbMath0994.65048OpenAlexW1509113568MaRDI QIDQ5960916
Publication date: 10 October 2002
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021908421589
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Quasi-optimal \textit{hp}-finite element refinements towards singularities via deep neural network prediction ⋮ A survey on direct solvers for Galerkin methods ⋮ A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities ⋮ A survey of direct methods for sparse linear systems ⋮ Robust algorithm for random resistor networks using hierarchical domain structure ⋮ Improving Multifrontal Methods by Means of Block Low-Rank Representations
Uses Software
This page was built for publication: Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods