About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

Kučera, Radek
Complexity and memory requirements of an algorithm for solving saddle-point linear systems with singular blocks. (English). In: Chleboun, J., Přikryl, P. and Segeth, K. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 6-11, 2004. Institute of Mathematics AS CR, Prague, 2004. pp. 131-135
Summary:
The paper deals with fast solution 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 possible to use the fast Fourier transform that determines the complexity of the algorithm. Numerical experiments confirm theoretical results.
Partner of
EuDML logo