An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems

DOI10.1137/0715069MaRDI QIDQ4195885zbMATH OpenOpenAlexFDO

Authors

Publication date 1978

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0715069

zbMATH Keywords

AlgorithmCholesky's MethodComputation TimeCuthill-Mckee AlgorithmFinite-Element MethodLinear Elliptic EquationNested DissectionPlane DomainSparse Matrix EquationYale Sparse Matrix Package

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cited in

(17)

• Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
• Solution of algebraic equations generated by the p-version of the finite element method
• The analysis of a nested dissection algorithm
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• Solution of sparse positive definite systems on a hypercube
• Bibliography on the evaluation of numerical software
• Experiments with sparse Cholesky using a sequential task-flow implementation
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• A multilevel approach for trace system in HDG discretizations
• The General Minimum Fill-In Problem
• A fast algorithm for sparse matrix computations related to inversion
• PMORSy: parallel sparse matrix ordering software for fill-in minimization
• A survey of direct methods for sparse linear systems
• Parallel sparse Gaussian elimination with partial pivoting
• Task scheduling for parallel sparse Cholesky factorization

This page was built for publication: An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4195885)