Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
- 1 April 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 15 (2) , 297-327
- https://doi.org/10.1137/0715021
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Numerical Experiments Using Dissection Methods to Solve n by n Grid ProblemsSIAM Journal on Numerical Analysis, 1977
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse MatrixSIAM Journal on Numerical Analysis, 1976
- On Block Elimination for Sparse Linear SystemsSIAM Journal on Numerical Analysis, 1974
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Some Basic Techniques for Solving Sparse Systems of Linear EquationsPublished by Springer Nature ,1972
- A New Search Algorithm for Finding the Simple Cycles of a Finite Directed GraphJournal of the ACM, 1972
- Dissection of StructuresJournal of the Structural Division, 1967
- A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous EquationsThe Computer Journal, 1966
- The Use of Linear Graphs in Gauss EliminationSIAM Review, 1961