Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the Sobolev and $L^p$-Stability of the $L^2$-projection
143
0
0.0
(
0
)
Added by
Tabea Tscherpel
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We show stability of the $L^2$-projection onto Lagrange finite element spaces with respect to (weighted) $L^p$ and $W^{1,p}$-norms for any polynomial degree and for any space dimension under suitable conditions on the mesh grading. This includes $W^{1,2}$-stability in two space dimensions for any polynomial degree and meshes generated by newest vertex bisection. Under realistic but conjectured assumptions on the mesh grading in three dimensions we show $W^{1,2}$-stability for all polynomial degrees. We also propose a modified bisection strategy that leads to better $W^{1,p}$-stability. Moreover, we investigate the stability of the $L^2$-projection onto Crouzeix-Raviart elements.
rate research
Read More
In this paper we derive stability estimates in $L^{2}$- and $L^{infty}$- based Sobolev spaces for the $L^{2}$ projection and a family of quasiinterolants in the space of smooth, 1-periodic, polynomial splines defined on a uniform mesh in $[0,1]$. As a result of the assumed periodicity and the uniform mesh, cyclic matrix techniques and suitable decay estimates of the elements of the inverse of a Gram matrix associated with the standard basis of the space of splines, are used to establish the stability results.
In this paper, we study the Sobolev extension property of Lp-quasidisks which are the generalizations of the classical quasidisks. After that, we also find some applications of their Sobolev extension property.
Given a function $uin L^2=L^2(D,mu)$, where $Dsubset mathbb R^d$ and $mu$ is a measure on $D$, and a linear subspace $V_nsubset L^2$ of dimension $n$, we show that near-best approximation of $u$ in $V_n$ can be computed from a near-optimal budget of $Cn$ pointwise evaluations of $u$, with $C>1$ a universal constant. The sampling points are drawn according to some random distribution, the approximation is computed by a weighted least-squares method, and the error is assessed in expected $L^2$ norm. This result improves on the results in [6,8] which require a sampling budget that is sub-optimal by a logarithmic factor, thanks to a sparsification strategy introduced in [17,18]. As a consequence, we obtain for any compact class $mathcal Ksubset L^2$ that the sampling number $rho_{Cn}^{rm rand}(mathcal K)_{L^2}$ in the randomized setting is dominated by the Kolmogorov $n$-width $d_n(mathcal K)_{L^2}$. While our result shows the existence of a randomized sampling with such near-optimal properties, we discuss remaining issues concerning its generation by a computationally efficient algorithm.
We obtain sharp ranges of $L^p$-boundedness for domains in a wide class of Reinhardt domains representable as sub-level sets of monomials, by expressing them as quotients of simpler domains. We prove a general transformation law relating $L^p$-boundedness on a domain and its quotient by a finite group. The range of $p$ for which the Bergman projection is $L^p$-bounded on our class of Reinhardt domains is found to shrink as the complexity of the domain increases.
In this paper, we consider the inverse source problem for the time-fractional diffusion equation, which has been known to be an ill-posed problem. To deal with the ill-posedness of the problem, we propose to transform the problem into a regularized problem with L^2 and total variational (TV) regularization terms. Differing from the classical Tikhonov regularization with L^2 penalty terms, the TV regularization is beneficial for reconstructing discontinuous or piecewise constant solutions. The regularized problem is then approximated by a fully discrete scheme. Our theoretical results include: estimate of the error order between the discrete problem and the continuous direct problem; the convergence rate of the discrete regularized solution to the target source term; and the convergence of the regularized solution with respect to the noise level. Then we propose an accelerated primal-dual iterative algorithm based on an equivalent saddle-point reformulation of the discrete regularized model. Finally, a series of numerical tests are carried out to demonstrate the efficiency and accuracy of the algorithm.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
