Related papers: Complete Pascal Interpolation Scheme For Approxima…
Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term numerical emphasizes that a numerical solution is computed. The method consists in replacing the right hand…
A discrete analysis of the phase and dissipation errors of an explicit, semi-Lagrangian spectral element method is performed. The semi-Lagrangian method advects the Lagrange interpolant according the Lagrangian form of the transport…
This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…
A procedure for interpolating between specified points of a curve or surface is described. The method guarantees slope continuity at all junctions. A surface panel divided into p x q contiguous patches is completely specified by the…
Radial basis functions (RBFs) play an important role in function interpolation, in particular in an arbitrary set of interpolation nodes. The accuracy of the interpolation depends on a parameter called the shape parameter. There are many…
In this paper, we present an interpolation framework for structure-preserving model order reduction of parametric bilinear dynamical systems. We introduce a general setting, covering a broad variety of different structures for parametric…
Planar homography, with eight degrees of freedom (DOFs), is fundamental in numerous computer vision tasks. While the positional offsets of four corners are widely adopted (especially in neural network predictions), this parameterization…
An expandable local and parallel two-grid finite element scheme based on superposition principle for elliptic problems is proposed and analyzed in this paper by taking example of Poisson equation. Compared with the usual local and parallel…
In this paper,we deeply research Lagrange interpolation of n-variables and give an application of Cayley-Bacharach theorem for it. We pose the concept of sufficient intersection about s algebraic hypersurfaces in n-dimensional complex…
In this paper, based on the idea of self-adjusting steepness based schemes[5], a two-dimensional calculation method of steepness parameter is proposed, and thus a two-dimensional self-adjusting steepness based limiter is constructed. With…
An extended range of energy stable flux reconstruction schemes, developed using a summation-by-parts approach, is presented on quadrilateral elements for various sets of polynomial bases. For the maximal order bases, a new set of correction…
A numerical scheme is presented for approximating fractional order Poisson problems in two and three dimensions. The scheme is based on reformulating the original problem posed over $\Omega$ on the extruded domain…
In this paper, we propose an $H(\text{curl}^2)$-conforming quadrilateral spectral element method to solve quad-curl problems. Starting with generalized Jacobi polynomials, we first introduce quasi-orthogonal polynomial systems for vector…
We obtain some criteria for a symmetric square-central element of a totally decomposable algebra with orthogonal involution in characteristic two, to be contained in an invariant quaternion subalgebra.
This paper provides an accurate method to obtain the bidiagonal factorization of many generalized Pascal matrices, which in turn can be used to compute with high relative accuracy the eigenvalues, singular values and inverses of these…
By a direct computation, we show that the $P_2$ interpolation of a $P_3$ function is also a local $H^1$-projection on uniform tetrahedral meshes, i.e., the difference is $H^1$-orthogonal to the $P_2$ Lagrange basis function on the support…
In this paper we propose a contour mean calculation and interpolation method designed for averaging manual delineations of objects performed by experts and interpolate 3D layer stack images. The proposed method retains all visible…
Symmetric polynomial quadrature rules for triangles are commonly used to efficiently integrate two-dimensional domains in finite-element-type problems. While the development of such rules focuses on the maximum degree a given number of…
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We combine two different approaches to find regular polygons, depending on their number of edges. Our result depends on the parameter alpha,…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.