Related papers: An Explicit Upper Bound for Modulus of Divided Dif…
Computing accurate splines of degree greater than three is still a challenging task in today's applications. In this type of interpolation, high-order derivatives are needed on the given mesh. As these derivatives are rarely known and are…
The method to solve inhomogeneous linear differential equations that is usually taught at school relies on the fact that the right hand side function is the product of a polynomial and an exponential and that the linear spaces of those…
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…
The quantitative estimation for the interpolation error constants of the Fujino-Morley interpolation operator is considered. To give concrete upper bounds for the constants, which is reduced to the problem of providing lower bounds for…
We find bounds on the difference between the writhing number of a smooth curve, and the writhing number of a polygon inscribed within. The proof is based on an extension of Fuller's difference of writhe formula to the case of polygonal…
A basic problem for any class of nonassociative algebras is to determine the polynomial identities satisfied by the symmetrization and the skew-symmetrization of the original product. We consider the symmetrization of the product in the…
The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that…
The theories of $\pi$-points and modules of constant Jordan type have been a topic of much recent interest in the field of finite group scheme representation theory. These theories allow for a finite group scheme module $M$ to be restricted…
We develop a method for calculating the norm and the spectrum of the modulus of a Foguel operator. In many cases, the norm can be computed exactly. In others, sharp upper bounds are obtained. In particular, we observe several connections…
The ideal class monoid for an order $R$ in a finite field extension $E/F$ of a number field, denoted by $\overline{\mathrm{Cl}}(R)$, is a fundamental object to study in number theory which has useful applications in algebraic geometry and…
In this paper we consider the approximation of functions by radial basis function interpolants. There is a plethora of results about the asymptotic behaviour of the error between appropriately smooth functions and their interpolants, as the…
A New Error Bound for shifted surface spline interpolation is presented. This error bound probably is the most powerful one up to now.
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
In areas such as kernel smoothing and non-parametric regression there is emphasis on smooth interpolation and smooth statistical models. Splines are known to have optimal smoothness properties in one and higher dimensions. It is shown, with…
We establish new upper bounds for the numerical radius of bounded linear operators on a complex Hilbert space by introducing weighted geometric means of the modulus of an operator and its adjoint. This approach yields a family of…
We provide first the functional analysis background required for reduced order modeling and present the underlying concepts of reduced basis model reduction. The projection-based model reduction framework under affinity assumptions,…
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)…
We study the set $\partition{\nb}$ of all possible Jordan canonical forms of nilpotent matrices commuting with a given nilpotent matrix $B$. We describe $\partition{\nb}$ in the special case when $B$ has only one Jordan block. In the…
In this work we propose a simple but effective high order polynomial correction allowing to enhance the consistency of all kind of boundary conditions for the Euler equations (Dirichlet, characteristic far-field and slip-wall), both in 2D…
First order methods endowed with global convergence guarantees operate using global lower bounds on the objective. The tightening of the bounds has been shown to increase both the theoretical guarantees and the practical performance. In…