Trigonometric polynomials and sums of squares

1985 ◽  
pp. 225-238 ◽  
Author(s):  
A. Naftalevich ◽  
M. Schreiber
Keyword(s):  
Sums Of Squares ◽  
Trigonometric Polynomials

Sums of squares of trigonometric polynomials

1988 ◽  
Vol 16 (7) ◽  
pp. 1373-1382
Author(s):  
M. Schreiber
Keyword(s):  
Sums Of Squares ◽  
Trigonometric Polynomials

Approximation of Unbounded Functions by Trigonometric Polynomials

2017 ◽  
Vol 13 (4) ◽  
pp. 106-116
Author(s):  
Alaa A. Auad ◽  
◽  
Mousa M. Khrajan
Keyword(s):  
Trigonometric Polynomials

Approximate Solution Of A Singular Integral Equation With A Multiplicative Cauchy Kernel In The Half-Plane

2008 ◽  
Vol 8 (2) ◽  
pp. 143-154 ◽  
Author(s):  
P. KARCZMAREK
Keyword(s):  
Integral Equation ◽  
Approximate Solution ◽  
Singular Integral Equation ◽  
Half Plane ◽  
Singular Integral ◽  
Trigonometric Polynomials ◽  
Cauchy Kernel

AbstractIn this paper, Jacobi and trigonometric polynomials are used to con-struct the approximate solution of a singular integral equation with multiplicative Cauchy kernel in the half-plane.

scholarly journals Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares

2021 ◽  
Vol 107 ◽  
pp. 67-105
Author(s):  
Elisabeth Gaar ◽  
Daniel Krenn ◽  
Susan Margulies ◽  
Angelika Wiegele
Keyword(s):  
Semidefinite Programming ◽  
Sums Of Squares

An extension of q-starlike and q-convex error functions endowed with the trigonometric polynomials

2020 ◽  
Vol 70 (3) ◽  
pp. 599-604
Author(s):  
Şahsene Altinkaya
Keyword(s):  
Error Function ◽  
Trigonometric Polynomials ◽  
Error Functions ◽  
The Family ◽  
Coefficient Inequalities

AbstractIn this present investigation, we will concern with the family of normalized analytic error function which is defined by$$\begin{array}{} \displaystyle E_{r}f(z)=\frac{\sqrt{\pi z}}{2}\text{er} f(\sqrt{z})=z+\overset{\infty }{\underset {n=2}{\sum }}\frac{(-1)^{n-1}}{(2n-1)(n-1)!}z^{n}. \end{array}$$By making the use of the trigonometric polynomials Un(p, q, eiθ) as well as the rule of subordination, we introduce several new classes that consist of 𝔮-starlike and 𝔮-convex error functions. Afterwards, we derive some coefficient inequalities for functions in these classes.

scholarly journals Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials

2021 ◽  
Author(s):  
Mareike Dressler ◽  
Adam Kurpisz ◽  
Timo de Wolff
Keyword(s):  
Computer Science ◽  
Affine Transformation ◽  
Optimization Problems ◽  
Polynomial Optimization ◽  
Theoretical Computer Science ◽  
Sums Of Squares ◽  
Theoretical Computer ◽  
Complexity Bounds ◽  
Polynomial Optimization Problems ◽  
Transformation Of Variables

AbstractVarious key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems is based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS-based certificates remain valid: First, for polynomials, which are nonnegative over the n-variate boolean hypercube with constraints of degree d there exists a SONC certificate of degree at most $$n+d$$ n + d . Second, if there exists a degree d SONC certificate for nonnegativity of a polynomial over the boolean hypercube, then there also exists a short degree d SONC certificate that includes at most $$n^{O(d)}$$ n O ( d ) nonnegative circuit polynomials. Moreover, we prove that, in opposite to SOS, the SONC cone is not closed under taking affine transformation of variables and that for SONC there does not exist an equivalent to Putinar’s Positivstellensatz for SOS. We discuss these results from both the algebraic and the optimization perspective.

Sign in / Sign up

Export Citation Format

Share Document