Geodesic
Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations
Applications of Mathematics, Tome 50 (2005) no. 3, pp. 291-308
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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.
DOI : 10.1007/s10492-005-0018-y
Classification : 65F10, 65N30, 65T50, 65T60
Keywords: wavelet-Galerkin discretization; fictitious domain method; saddle-point system; conjugate gradient method; circulant matrix; fast Fourier transform; Kronecker product 
@article{10_1007_s10492_005_0018_y,
     author = {Ku\v{c}era, Radek},
     title = {Complexity of an algorithm for solving saddle-point systems with singular blocks arising in {wavelet-Galerkin} discretizations},
     journal = {Applications of Mathematics},
     pages = {291--308},
     year = {2005},
     volume = {50},
     number = {3},
     doi = {10.1007/s10492-005-0018-y},
     mrnumber = {2133731},
     zbl = {1099.65150},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1007/s10492-005-0018-y/}
}
TY  - JOUR
AU  - Kučera, Radek
TI  - Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations
JO  - Applications of Mathematics
PY  - 2005
SP  - 291
EP  - 308
VL  - 50
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.1007/s10492-005-0018-y/
DO  - 10.1007/s10492-005-0018-y
LA  - en
ID  - 10_1007_s10492_005_0018_y
ER  - 
%0 Journal Article
%A Kučera, Radek
%T Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations
%J Applications of Mathematics
%D 2005
%P 291-308
%V 50
%N 3
%U http://geodesic.mathdoc.fr/articles/10.1007/s10492-005-0018-y/
%R 10.1007/s10492-005-0018-y
%G en
%F 10_1007_s10492_005_0018_y
Kučera, Radek. Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations. Applications of Mathematics, Tome 50 (2005) no. 3, pp. 291-308. doi: 10.1007/s10492-005-0018-y

Cité par Sources :