11,985 research outputs found
Multipatch Approximation of the de Rham Sequence and its Traces in Isogeometric Analysis
We define a conforming B-spline discretisation of the de Rham complex on
multipatch geometries. We introduce and analyse the properties of interpolation
operators onto these spaces which commute w.r.t. the surface differential
operators. Using these results as a basis, we derive new convergence results of
optimal order w.r.t. the respective energy spaces and provide approximation
properties of the spline discretisations of trace spaces for application in the
theory of isogeometric boundary element methods. Our analysis allows for a
straightforward generalisation to finite element methods
An analysis of a class of variational multiscale methods based on subspace decomposition
Numerical homogenization tries to approximate the solutions of elliptic
partial differential equations with strongly oscillating coefficients by
functions from modified finite element spaces. We present in this paper a class
of such methods that are very closely related to the method of M{\aa}lqvist and
Peterseim [Math. Comp. 83, 2014]. Like the method of M{\aa}lqvist and
Peterseim, these methods do not make explicit or implicit use of a scale
separation. Their compared to that in the work of M{\aa}lqvist and Peterseim
strongly simplified analysis is based on a reformulation of their method in
terms of variational multiscale methods and on the theory of iterative methods,
more precisely, of additive Schwarz or subspace decomposition methods.Comment: published electronically in Mathematics of Computation on January 19,
201
Numerical Homogenization of Heterogeneous Fractional Laplacians
In this paper, we develop a numerical multiscale method to solve the
fractional Laplacian with a heterogeneous diffusion coefficient. When the
coefficient is heterogeneous, this adds to the computational costs. Moreover,
the fractional Laplacian is a nonlocal operator in its standard form, however
the Caffarelli-Silvestre extension allows for a localization of the equations.
This adds a complexity of an extra spacial dimension and a singular/degenerate
coefficient depending on the fractional order. Using a sub-grid correction
method, we correct the basis functions in a natural weighted Sobolev space and
show that these corrections are able to be truncated to design a
computationally efficient scheme with optimal convergence rates. A key
ingredient of this method is the use of quasi-interpolation operators to
construct the fine scale spaces. Since the solution of the extended problem on
the critical boundary is of main interest, we construct a projective
quasi-interpolation that has both and dimensional averages over
subsets in the spirit of the Scott-Zhang operator. We show that this operator
satisfies local stability and local approximation properties in weighted
Sobolev spaces. We further show that we can obtain a greater rate of
convergence for sufficient smooth forces, and utilizing a global
projection on the critical boundary. We present some numerical examples,
utilizing our projective quasi-interpolation in dimension for analytic
and heterogeneous cases to demonstrate the rates and effectiveness of the
method
Stability of an upwind Petrov Galerkin discretization of convection diffusion equations
We study a numerical method for convection diffusion equations, in the regime
of small viscosity. It can be described as an exponentially fitted conforming
Petrov-Galerkin method. We identify norms for which we have both continuity and
an inf-sup condition, which are uniform in mesh-width and viscosity, up to a
logarithm, as long as the viscosity is smaller than the mesh-width or the
crosswind diffusion is smaller than the streamline diffusion. The analysis
allows for the formation of a boundary layer.Comment: v1: 18 pages. 2 figures. v2: 22 pages. Numerous details added and
completely rewritten final proof. 8 pages appendix with old proo
- …