Polynomial mapped bases: theory and applications
نویسندگان
چکیده
Abstract In this paper, we collect the basic theory and most important applications of a novel technique that has shown to be suitable for scattered data interpolation, quadrature, bio-imaging reconstruction. The method relies on polynomial mapped bases allowing, instance, incorporate or function discontinuities in mapping function. new substantially mitigates Runge’s Gibbs effects.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملIdeal bases for graded polynomial rings and applications to interpolation
Based on a generalized algorithm for the division with remainder of polynomials in several variables, a method for the construction of standard bases for polynomial ideals with respect to arbitrary grading structures is derived. In the case of ideals with finite codimension, which can be viewed upon as a polynomial interpolation problem, an explicit representation for the interpolation space of...
متن کاملFinite Gröbner Bases in Infinite Dimensional Polynomial Rings and Applications
We introduce the theory of monoidal Gröbner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Gröbner bases of ideals that are stable under the action of a monoid. The main motivation for developing this theory is to prove finiteness results in commutative algebra and applications. A basic theorem of this type is that ideals in infinitel...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Applied and Industrial Mathematics
سال: 2022
ISSN: ['2038-0909']
DOI: https://doi.org/10.2478/caim-2022-0001