Complexity Bounds for Regular Finite Difference and Finite Element Grids
- 1 April 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 10 (2), 364-369
- https://doi.org/10.1137/0710033
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- 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
- Block Elimination on Finite Element Systems of EquationsPublished by Springer Nature ,1972
- Some Basic Techniques for Solving Sparse Systems of Linear EquationsPublished by Springer Nature ,1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear EquationsJournal of the ACM, 1970