Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems

DOI10.1137/0715021zbMath0389.65015OpenAlexW2083664134MaRDI QIDQ4171505

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/0715021

Mathematics Subject Classification ID

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

Related Items (10)

An iterative aggregation-disaggregation algorithm for solving linear equations ⋮ 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 dissection solver with kernel detection for symmetric finite element matrices on shared memory computers ⋮ Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition ⋮ A new algorithm for domain decomposition of finite element models ⋮ A survey of direct methods for sparse linear systems ⋮ A linear time implementation of the reverse Cuthill-McKee algorithm ⋮ Bibliography on the evaluation of numerical software ⋮ On finite element methods for the Neumann problem ⋮ Quotient tree partitioning of undirected graphs

This page was built for publication: Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems