Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExtenting of Babuv{s}ka-Azizs theorem to higher-order Lagrange interpolation
80
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider the error analysis of Lagrange interpolation on triangles and tetrahedrons. For Lagrange interpolation of order one, Babuv{s}ka and Aziz showed that squeezing a right isosceles triangle perpendicularly does not deteriorate the optimal approximation order. We extend their technique and result to higher-order Lagrange interpolation on both triangles and tetrahedrons. To this end, we make use of difference quotients of functions with two or three variables. Then, the error estimates on squeezed triangles and tetrahedrons are proved by a method that is a straightforward extension of the original given by Babuv{s}ka-Aziz.
rate research
Read More
This paper describes the analysis of Lagrange interpolation errors on tetrahedrons. In many textbooks, the error analysis of Lagrange interpolation is conducted under geometric assumptions such as shape regularity or the (generalized) maximum angle condition. In this paper, we present a new estimation in which the error is bounded in terms of the diameter and projected circumradius of the tetrahedron. Because we do not impose any geometric restrictions on the tetrahedron itself, our error estimation may be applied to any tetrahedralizations of domains including very thin tetrahedrons.
We present the error analysis of Lagrange interpolation on triangles. A new textit{a priori} error estimate is derived in which the bound is expressed in terms of the diameter and circumradius of a triangle. No geometric conditions on triangles are imposed in order to get this type of error estimates.
In the error analysis of finite element methods, the shape regularity assumption on triangulations is typically imposed to obtain a priori error estimations. In practical computations, however, very thin or degenerated elements that violate the shape regularity assumption may appear when we use adaptive mesh refinement. In this manuscript, we attempt to establish an error analysis approach without the shape regularity assumption on triangulations. We have presented several papers on the error analysis of finite element methods on non-shape regular triangulations. The main points in these papers are that, in the error estimates of finite element methods, the circumradius of the triangles is one of the most important factors. The purpose of this manuscript is to provide a simple and plain explanation of the results to researchers and, in particular, graduate students who are interested in the subject. Therefore, this manuscript is not intended to be a research paper. We hope that, in the future, it will be merged into a textbook on the mathematical theory of the finite element methods.
This is the second lecture note on the error analysis of interpolation on simplicial elements without the shape regularity assumption (the previous one is arXiv:1908.03894). In this manuscript, we explain the error analysis of Lagrange interpolation on (possibly anisotropic) tetrahedrons. The manuscript is not intended to be a research paper. We hope that, in the future, it will be merged into a textbook on the mathematical theory of the finite element methods.
Classical reversible circuits, acting on $w$~bits, are represented by permutation matrices of size $2^w times 2^w$. Those matrices form the group P($2^w$), isomorphic to the symmetric group {bf S}$_{2^w}$. The permutation group P($n$), isomorphic to {bf S}$_n$, contains cycles with length~$p$, ranging from~1 to $L(n)$, where $L(n)$ is the so-called Landau function. By Lagrange interpolation between the $p$~matrices of the cycle, we step from a finite cyclic group of order~$p$ to a 1-dimensional Lie group, subgroup of the unitary group U($n$). As U($2^w$) is the group of all possible quantum circuits, acting on $w$~qubits, such interpolation is a natural way to step from classical computation to quantum computation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
