Approximation of boundary element matrices
Approximation of boundary element matrices
复制标题
DOI：
10.1007/s002110000192
复制
发表时间：
2000-10-01
影响因子：
2.1
通讯作者：
Bebendorf, M
中科院分区：
文献类型：
--
作者：
Bebendorf, M
本文考虑了用两个函数的一元乘积之和来逼近一般的二元渐近光滑函数的问题，这通常是在边值问题的积分公式中出现的。根据这些结果，给出了由渐近光滑函数生成的大型非结构矩阵块的低阶逼近的迭代算法。该算法只使用原始块中较少的条目，并且由于它具有自然停止准则，因此不需要事先进行近似排序。
This article considers the problem of approximating a general asymptotically smooth function in two variables, typically arising in integral formulations of boundary value problems, by a sum of products of two functions in one variable. From these results an iterative algorithm for the low-rank approximation of blocks of large unstructured matrices generated by asymptotically smooth functions is developed. This algorithm uses only few entries from the original block and since it has a natural stopping criterion the approximative rank is not needed in advance.