Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems

DOI10.1137/0714011MaRDI QIDQ4127870zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

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

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

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cited in

(13)

• A survey of direct methods for sparse linear systems
• Analysis of dissection algorithms for vector computers
• Bibliography on the evaluation of numerical software
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• A tearing-based hybrid parallel banded linear system solver
• Mixed isoparametric finite element models of laminated composite shells
• A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
• Nonlinear finite element analysis of curved beams
• HIERARCHICAL TEARING: AN EFFICIENT HOLOGRAPHIC ALGORITHM FOR SYSTEM DECOMPOSITION
• Polynomial preconditioning on vector computers
• A class of iterative methods for finite element equations
• On block triangular preconditioned iteration methods for solving the Helmholtz equation
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition

This page was built for publication: Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems

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