Skip to main content
Log in

Problem Dependent Generalized Prewavelets

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In this paper, we present a new approach to construct robust multilevel algorithms for elliptic differential equations. The multilevel algorithms consist of multiplicative subspace corrections in spaces spanned by problem dependent generalized prewavelets. These generalized prewavelets are constructed by a local orthogonalization of hierarchical basis functions with respect to a so-called local coarse-grid space. Numerical results show that the local orthogonalization leads to a smaller constant in strengthened Cauchy-Schwarz inequality than the original hierarchical basis functions. This holds also for several equations with discontinuous coefficients. Thus, the corresponding multilevel algorithm is a fast and robust iterative solver.

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

Author information

Authors and Affiliations

Authors

Additional information

Received November 13, 2001; revised October 21, 2002 Published online: December 12, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pflaum, C. Problem Dependent Generalized Prewavelets. Computing 69, 339–352 (2002). https://doi.org/10.1007/s00607-002-1464-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-002-1464-y

Navigation