1,951 research outputs found
Besov regularity for operator equations on patchwise smooth manifolds
We study regularity properties of solutions to operator equations on
patchwise smooth manifolds such as, e.g., boundaries of
polyhedral domains . Using suitable biorthogonal
wavelet bases , we introduce a new class of Besov-type spaces
of functions
. Special attention is paid on the
rate of convergence for best -term wavelet approximation to functions in
these scales since this determines the performance of adaptive numerical
schemes. We show embeddings of (weighted) Sobolev spaces on
into , ,
which lead us to regularity assertions for the equations under consideration.
Finally, we apply our results to a boundary integral equation of the second
kind which arises from the double layer ansatz for Dirichlet problems for
Laplace's equation in .Comment: 42 pages, 3 figures, updated after peer review. Preprint: Bericht
Mathematik Nr. 2013-03 des Fachbereichs Mathematik und Informatik,
Universit\"at Marburg. To appear in J. Found. Comput. Mat
An optimal adaptive wavelet method for First Order System Least Squares
In this paper, it is shown that any well-posed 2nd order PDE can be
reformulated as a well-posed first order least squares system. This system will
be solved by an adaptive wavelet solver in optimal computational complexity.
The applications that are considered are second order elliptic PDEs with
general inhomogeneous boundary conditions, and the stationary Navier-Stokes
equations.Comment: 40 page
Compressive Space-Time Galerkin Discretizations of Parabolic Partial Differential Equations
We study linear parabolic initial-value problems in a space-time variational
formulation based on fractional calculus. This formulation uses "time
derivatives of order one half" on the bi-infinite time axis. We show that for
linear, parabolic initial-boundary value problems on , the
corresponding bilinear form admits an inf-sup condition with sparse tensor
product trial and test function spaces. We deduce optimality of compressive,
space-time Galerkin discretizations, where stability of Galerkin approximations
is implied by the well-posedness of the parabolic operator equation. The
variational setting adopted here admits more general Riesz bases than previous
work; in particular, no stability in negative order Sobolev spaces on the
spatial or temporal domains is required of the Riesz bases accommodated by the
present formulation. The trial and test spaces are based on Sobolev spaces of
equal order with respect to the temporal variable. Sparse tensor products
of multi-level decompositions of the spatial and temporal spaces in Galerkin
discretizations lead to large, non-symmetric linear systems of equations. We
prove that their condition numbers are uniformly bounded with respect to the
discretization level. In terms of the total number of degrees of freedom, the
convergence orders equal, up to logarithmic terms, those of best -term
approximations of solutions of the corresponding elliptic problems.Comment: 26 page
Spatial Besov Regularity for Stochastic Partial Differential Equations on Lipschitz Domains
We use the scale of Besov spaces B^\alpha_{\tau,\tau}(O), \alpha>0,
1/\tau=\alpha/d+1/p, p fixed, to study the spatial regularity of the solutions
of linear parabolic stochastic partial differential equations on bounded
Lipschitz domains O\subset R^d. The Besov smoothness determines the order of
convergence that can be achieved by nonlinear approximation schemes. The proofs
are based on a combination of weighted Sobolev estimates and characterizations
of Besov spaces by wavelet expansions.Comment: 32 pages, 3 figure
Analytic Regularity and GPC Approximation for Control Problems Constrained by Linear Parametric Elliptic and Parabolic PDEs
This paper deals with linear-quadratic optimal control problems constrained by a parametric or stochastic elliptic or parabolic PDE. We address the (difficult) case that the state equation depends on a countable number of parameters i.e., on with , and that the PDE operator may depend non-affinely on the parameters. We consider tracking-type functionals and distributed as well as boundary controls. Building on recent results in [CDS1, CDS2], we show that the state and the control are analytic as functions depending on these parameters . We
establish sparsity of generalized polynomial chaos (gpc) expansions of both, state and control, in terms of the stochastic coordinate sequence of the random inputs, and prove convergence rates of best -term truncations of these expansions. Such truncations are the key for subsequent computations since they do {\em not} assume that the stochastic input data has a finite expansion. In the follow-up paper [KS2], we explain two methods how such best -term truncations can practically be computed, by greedy-type algorithms
as in [SG, Gi1], or by multilevel Monte-Carlo methods as in
[KSS]. The sparsity result allows in conjunction with adaptive wavelet Galerkin schemes for sparse, adaptive tensor discretizations of control problems constrained by linear elliptic and parabolic PDEs developed in [DK, GK, K], see [KS2]
- …