An Elementary Approach to Polynomial Optimization on Polynomial Meshes
Journal Title: Journal of Mathematical and Fundamental Sciences - Year 2018, Vol 50, Issue 1
Abstract
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for polynomials whose norming constant is independent of degree. We apply the recently developed theory of polynomial meshes to an elementary discrete approach for polynomial optimization on nonstandard domains, providing a rigorous (over)estimate of the convergence rate. Examples include surface/solid subregions of sphere or torus, such as caps, lenses, lunes, and slices.
Authors and Affiliations
Marco Vianello
Keywords
Related Articles
- EP ID EP540987
- DOI 10.5614/j.math.fund.sci.2018.50.1.7
- Views 90
- Downloads 0
Multifractal Characterization of Pore Size Distributions of Peat Soil
This paper discusses a multifractal analysis of the microscopic structure of peat soil. The aim of this study was to apply the multifractal technique to analyze the properties of five slices of peat soil (L1-L5). Binary...
Disruption of Oil Palm Empty Fruit Bunches by Microwave-assisted Oxalic Acid Pretreatment
Developing an effective pretreatment for the conversion of lignocellulosic biomass to ethanol is an important effort in reducing the cost of this process. Microwave-assisted pretreatment is considered a green technology...
On a Certain Subclass of Meromorphic Functions Defined by a New Linear Differential Operator
In this article, a new linear differential operator I^k (L_s^a (a_l,b_m )f(z)) is defined by using the Hadamard product of the q-hypergeometric function and a function related to the Hurwitz-Lerch zeta function. By using...
New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations
This article presents a new generalized algorithm for developing k-step (m+1)th derivative block methods for solving mth order ordinary differential equations. This new algorithm utilizes the concept from the conventiona...
On Commutative Characterization of Graph Operation with Respect to Metric Dimension
Let G be a connected graph with vertex set V(G) and W={w_1,w_2,…,w_m}⊆V(G). A representation of a vertex v∈V(G) with respect to W is an ordered m-tuple r(v|W)=(d(v,w_1 ),d(v,w_2 ),...,d(v,w_m )) where d(v,w) is the dista...