Skip to main content
Log in

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

  • Published:
Applications of Mathematics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Brezzi, M. Fortin: Mixed and Hybrid Finite Element Methods. Springer-Verlag, New York, 1991.

    Google Scholar 

  2. P. G. Ciarlet: The Finite Element Method for Elliptic Problems. North-Holland, Amsterdam, 1978.

    Google Scholar 

  3. M. Fortin, R. Glowinski: Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems. North-Holland, Amsterdam, 1983.

    Google Scholar 

  4. I. Daubechies: Ten Lectures on Wavelets. SIAM, Philadelphia, 1992.

    Google Scholar 

  5. R. Glowinski, T. Pan, and J. Periaux: A fictitious domain method for Dirichlet problem and applications. Comput. Methods Appl. Mech. Eng. 111 (1994), 283–303.

    Google Scholar 

  6. R. Glowinski, T. Pan, R. O. Wells, X. Zhou: Wavelets methods in computational fluid dynamics. In: Proc. Algorithms Trends in Computational Dynamics (1993) (M. Y. Hussaini, A. Kumar, and M. D. Salas, eds.). Springer-Verlag, New York, pp. 259–276.

    Google Scholar 

  7. G. H. Golub, C. F. Van Loan: Matrix Computation. The Johns Hopkins University Press, Baltimore, 1996, 3rd ed.

    Google Scholar 

  8. N. I. M. Gould: On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem. Math. Program. 32 (1985), 90–99.

    Google Scholar 

  9. R. Kucera: Wavelet solution of elliptic PDEs. In: Proc. Matematyka v Naukach Technicznych i Przyrodniczych (2000) (S. Bialas, ed.). AGH Krakow, pp. 55–62.

  10. W. Rudin: Real and Complex Analysis. McGraw-Hill, New York, 1987, 3rd ed.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by grant HPRNT-CT-2002-00286 and MSM 272400019.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kucera, R. Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations. Appl Math 50, 291–308 (2005). https://doi.org/10.1007/s10492-005-0018-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10492-005-0018-y

Keywords

Navigation