Complexity and memory requirements of an algorithm for solving saddle-point linear systems with singular blocks

Kučera, Radek. "Complexity and memory requirements of an algorithm for solving saddle-point linear systems with singular blocks." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2004. 131-135. <http://eudml.org/doc/271318>.

@inProceedings{Kučera2004,
abstract = {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.},
author = {Kučera, Radek},
booktitle = {Programs and Algorithms of Numerical Mathematics},
location = {Prague},
pages = {131-135},
publisher = {Institute of Mathematics AS CR},
title = {Complexity and memory requirements of an algorithm for solving saddle-point linear systems with singular blocks},
url = {http://eudml.org/doc/271318},
year = {2004},
}

TY - CLSWK
AU - Kučera, Radek
TI - Complexity and memory requirements of an algorithm for solving saddle-point linear systems with singular blocks
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2004
CY - Prague
PB - Institute of Mathematics AS CR
SP - 131
EP - 135
AB - 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.
UR - http://eudml.org/doc/271318
ER -