Calculs de complexité relatifs à une méthode de dissection emboîtée

DOI10.1007/BF01389708zbMath0537.65025OpenAlexW2268954487MaRDI QIDQ792734

N. E. Zubov

Publication date: 1985

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

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

zbMATH Keywords

numerical resultsfinite element methodGaussian eliminationsparse matrixplanar graphnested dissectionseparator

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)

Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver) ⋮ É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
• Unnamed Item
• Unnamed Item
• The Use of Linear Graphs in Gauss Elimination
• A Separator Theorem for Planar Graphs
• Generalized Nested Dissection
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Algorithmic Aspects of Vertex Elimination on Graphs
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Calculs de complexité relatifs à une méthode de dissection emboîtée