Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)

DOI10.1007/BF01396049zbMath0663.65020MaRDI QIDQ1114300

S. H. Smith

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133364

zbMATH Keywords

complexity; Gauss elimination; Numerical experiments; large sparse systems; nested dissection method; separator theorem; block storage scheme

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65F05: Direct numerical methods for linear systems and matrix inversion

Uses Software

• symrcm