Incomplete Nested Dissection for Solving n by n Grid Problems

DOI10.1137/0715044MaRDI QIDQ4176338zbMATH 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/0715044

zbMATH Keywords

Incomplete Nested DissectionMesh SubdivisionNested Dissection MethodNumber of Operations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Cited in

(11)

• Sparse linear problems and the least squares method
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• On symbolic factorization of partitioned sparse symmetric matrices
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• Analysis of dissection algorithms for vector computers
• Bibliography on the evaluation of numerical software
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• Sparse matrix factor modification in structural reanalysis
• Data-Parallel Sparse Factorization
• HIERARCHICAL TEARING: AN EFFICIENT HOLOGRAPHIC ALGORITHM FOR SYSTEM DECOMPOSITION
• A survey of direct methods for sparse linear systems

This page was built for publication: Incomplete Nested Dissection for Solving n by n Grid Problems

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