Complexity Bounds for Regular Finite Difference and Finite Element Grids
Complexity Bounds for Regular Finite Difference and Finite Element Grids
复制标题
DOI：
10.1137/0710033
复制
发表时间：
1973-04
影响因子：
2.9
通讯作者：
A. Hoffman;Michael S. Martin;D. Rose
中科院分区：
文献类型：
--
作者：
A. Hoffman;Michael S. Martin;D. Rose
通过将有限差分或有限元技术应用于平面区域上的线性边值问题，产生规则的 $n \times n$ 网格，稀疏系统中的乘法和存储获得了尖锐的下界。图论技术用于利用问题底层组合结构的简单性。
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 \times n$ grids. Graph-theoretic techniques are used to take advantage of the simplicity of the underlying combinatorial structure of the problem.