Adaptive Wavelet Methods for Variational Formulations of Nonlinear Elliptic PDEs on Tensor-Product Domains

Adaptive Wavelet Methods for Variational Formulations of Nonlinear Elliptic PDEs on Tensor-Product Domains
Author :
Publisher : Logos Verlag Berlin GmbH
Total Pages : 336
Release :
ISBN-10 : 9783832541026
ISBN-13 : 3832541020
Rating : 4/5 (26 Downloads)

Book Synopsis Adaptive Wavelet Methods for Variational Formulations of Nonlinear Elliptic PDEs on Tensor-Product Domains by : Roland Pabel

Download or read book Adaptive Wavelet Methods for Variational Formulations of Nonlinear Elliptic PDEs on Tensor-Product Domains written by Roland Pabel and published by Logos Verlag Berlin GmbH. This book was released on 2015-09-30 with total page 336 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis is concerned with the numerical solution of boundary value problems (BVPs) governed by nonlinear elliptic partial differential equations (PDEs). To iteratively solve such BVPs, it is of primal importance to develop efficient schemes that guarantee convergence of the numerically approximated PDE solutions towards the exact solution. The new adaptive wavelet theory guarantees convergence of adaptive schemes with fixed approximation rates. Furthermore, optimal, i.e., linear, complexity estimates of such adaptive solution methods have been established. These achievements are possible since wavelets allow for a completely new perspective to attack BVPs: namely, to represent PDEs in their original infinite dimensional realm. Wavelets in this context represent function bases with special analytical properties, e.g., the wavelets considered herein are piecewise polynomials, have compact support and norm equivalences between certain function spaces and the $ell_2$ sequence spaces of expansion coefficients exist. This theoretical framework is implemented in the course of this thesis in a truly dimensionally unrestricted adaptive wavelet program code, which allows one to harness the proven theoretical results for the first time when numerically solving the above mentioned BVPs. Numerical studies of 2D and 3D PDEs and BVPs demonstrate the feasibility and performance of the developed schemes. The BVPs are solved using an adaptive Uzawa algorithm, which requires repeated solution of nonlinear PDE sub-problems. This thesis presents for the first time a numerically competitive implementation of a new theoretical paradigm to solve nonlinear elliptic PDEs in arbitrary space dimensions with a complete convergence and complexity theory.


Adaptive Wavelet Methods for Variational Formulations of Nonlinear Elliptic PDEs on Tensor-Product Domains Related Books

Adaptive Wavelet Methods for Variational Formulations of Nonlinear Elliptic PDEs on Tensor-Product Domains
Language: en
Pages: 336
Authors: Roland Pabel
Categories: Mathematics
Type: BOOK - Published: 2015-09-30 - Publisher: Logos Verlag Berlin GmbH

DOWNLOAD EBOOK

This thesis is concerned with the numerical solution of boundary value problems (BVPs) governed by nonlinear elliptic partial differential equations (PDEs). To
Multiscale, Nonlinear and Adaptive Approximation
Language: en
Pages: 671
Authors: Ronald DeVore
Categories: Mathematics
Type: BOOK - Published: 2009-09-16 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

The book of invited articles offers a collection of high-quality papers in selected and highly topical areas of Applied and Numerical Mathematics and Approximat
Multilevel Preconditioning
Language: en
Pages: 0
Authors: W. Dahmen
Categories:
Type: BOOK - Published: 1991 - Publisher:

DOWNLOAD EBOOK

Mathematical Reviews
Language: en
Pages: 1028
Authors:
Categories: Mathematics
Type: BOOK - Published: 1998 - Publisher:

DOWNLOAD EBOOK

Tensor Spaces and Numerical Tensor Calculus
Language: en
Pages: 622
Authors: Wolfgang Hackbusch
Categories: Mathematics
Type: BOOK - Published: 2019-12-16 - Publisher: Springer Nature

DOWNLOAD EBOOK

Special numerical techniques are already needed to deal with n × n matrices for large n. Tensor data are of size n × n ×...× n=nd, where nd exceeds the comp