Accession Number : AD0741232
Title : Complexity Bounds for Regular Finite Difference and Finite Element Grids.
Descriptive Note : Technical rept.,
Corporate Author : DENVER UNIV COLO DEPT OF MATHEMATICS
Personal Author(s) : Martin,Michael S. ; Rose,Donald J.
Report Date : APR 1972
Pagination or Media Count : 18
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)
Descriptors : (*BOUNDARY VALUE PROBLEMS, NUMERICAL ANALYSIS), DIFFERENCE EQUATIONS, GRAPHICS, COMBINATORIAL ANALYSIS, MATRICES(MATHEMATICS), THEOREMS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE