Complexity Bounds for Regular Finite Difference and Finite Element Grids.
Abstract
Sharp lower bounds are obtained for multiplications and storage in the sparse system arising from the application of finite difference or finite element techniques to linear boundary value problems on plane regions yielding regular n x n grids. Graph theoretic techniques are used to take advantage of the simplicity of the underlying combinatorial structure of the problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1972
- Accession Number
- AD0741232
Entities
People
- Donald J. Rose
- Michael S. Martin
Organizations
- University of Denver