Calculs de complexité relatifs à une méthode de dissection emboîtée
DOI10.1007/BF01389708zbMATH Open0537.65025OpenAlexW2268954487MaRDI QIDQ792734FDOQ792734
Authors: 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
Recommendations
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
- scientific article; zbMATH DE number 4074330
- The analysis of a nested dissection algorithm
- scientific article; zbMATH DE number 4030966
- scientific article; zbMATH DE number 741125
Gaussian eliminationnumerical resultssparse matrixfinite element methodplanar graphnested dissectionseparator
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Nested Dissection
- Nested Dissection of a Regular Finite Element Mesh
- Title not available (Why is that?)
- A Separator Theorem for Planar Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- The Use of Linear Graphs in Gauss Elimination
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Title not available (Why is that?)
Cited In (8)
- Efficient solutions of hierarchical systems of linear equations
- A Note on Nested Dissection for Rectangular Grids
- É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
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The analysis of a nested dissection algorithm
Uses Software
This page was built for publication: Calculs de complexité relatifs à une méthode de dissection emboîtée
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792734)