Page 1

Displaying 1 – 4 of 4

Showing per page

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

Radek Kučera (2005)

Applications of Mathematics

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.

Currently displaying 1 – 4 of 4

Page 1