Adaptive wavelet methods for saddle point problems

16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Recently, adaptive wavelet strategies for symmetric, positive definite operators have been introduced that were proven to converge. This paper is devoted to the generalization to saddle point problems which are also symmetric, but indefinite. Firstly, we investigate a posteriori error estimates and generalize the known adaptive wavelet strategy to saddle point problems. The convergence of this strategy for elliptic operators essentially relies on the positive definite character of the operator. As an alternative, we introduce an adaptive variant of Uzawa's algorithm and prove its convergence. Secondly, we derive explicit criteria for adaptively refined wavelet spaces in order to fulfill the Ladyshenskaja-Babuška Brezzi (LBB) condition and to be fully equilibrated.

Cite

CITATION STYLE

APA

Dahlke, S., Hochmuth, R., & Urban, K. (2000). Adaptive wavelet methods for saddle point problems. Mathematical Modelling and Numerical Analysis, 34(5), 1003–1022. https://doi.org/10.1051/m2an:2000113

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free