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.65020OpenAlexW379665175MaRDI 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

complexityGauss eliminationNumerical experimentslarge sparse systemsnested dissection methodseparator theoremblock storage scheme

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

Reordering Strategy for Blocking Optimization in Sparse Linear Solvers ⋮ Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Calculs de complexité relatifs à une méthode de dissection emboîtée
• The analysis of a nested dissection algorithm
• The Use of Linear Graphs in Gauss Elimination
• A Separator Theorem for Planar Graphs
• An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
• A New Implementation of Sparse Gaussian Elimination
• Algorithmic Aspects of Vertex Elimination on Graphs
• Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
• Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
• Incomplete Nested Dissection for Solving n by n Grid Problems
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• Nested Dissection of a Regular Finite Element Mesh

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