Incomplete Nested Dissection for Solving n by n Grid Problems

DOI10.1137/0715044zbMath0393.65014OpenAlexW1986944014MaRDI QIDQ4176338

No author found.

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)

Related Items (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) ⋮ HIERARCHICAL TEARING: AN EFFICIENT HOLOGRAPHIC ALGORITHM FOR SYSTEM DECOMPOSITION ⋮ On symbolic factorization of partitioned sparse symmetric matrices ⋮ Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition ⋮ Data-Parallel Sparse Factorization ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse matrix factor modification in structural reanalysis ⋮ 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

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