Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations

被引：0
|
作者：
Radek Kucera
机构：
[1] VSB-Technical University of Ostrava,Department of Mathematics and Descriptive Geometry
来源：
Applications of Mathematics | 2005年 / 50卷 / 3期
关键词：
wavelet-Galerkin discretization; fictitious domain method; saddle-point system; conjugate gradient method; circulant matrix; fast Fourier transform; Kronecker product;
D O I：
10.1007/s10492-005-0018-y
中图分类号：
学科分类号：
摘要：
The paper deals with fast solving of large saddle-point systems arising in wavelet-Galerkin discretizations of separable elliptic PDEs. The periodized orthonormal compactly supported wavelets of the tensor product type together with the fictitious domain method are used. A special structure of matrices makes it possible to utilize the fast Fourier transform that determines the complexity of the algorithm. Numerical experiments confirm theoretical results.
引用
收藏
页码：291 / 308
页数：17
相关论文
共 20 条
12