English
Related papers

Related papers: Optimization-Aided Construction of Multivariate Ch…

200 papers

This paper proposes a semidefinite programming based method for estimating moments of a stochastic hybrid system (SHS). For polynomial SHSs -- which consist of polynomial continuous vector fields, reset maps, and transition intensities --…

Optimization and Control · Mathematics 2018-02-02 Khem Raj Ghusinga , Andrew Lamperski , Abhyudai Singh

The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…

Numerical Analysis · Mathematics 2020-08-04 Donatella Occorsio , Woula Themistoclakis

We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…

Optimization and Control · Mathematics 2022-02-18 Victor Magron , Ngoc Hoang Anh Mai , Yoshio Ebihara , Hayato Waki

A new necessary and sufficient stability test in a tractable number of operations for linear neutral-type delay systems is introduced. It is developed in the Lyapunov-Krasovskii framework via functionals with prescribed derivatives. The…

Systems and Control · Electrical Eng. & Systems 2025-12-15 Gerson Portilla , Mathieu Bajodek , Sabine Mondié

Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…

Algebraic Geometry · Mathematics 2025-11-25 Evelyne Hubert , Tobias Metzlaff , Philippe Moustrou , Cordian Riener

Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…

High Energy Physics - Lattice · Physics 2009-10-30 I. Montvay

We investigate the problem of numerical differentiation of bivariate functions from weighted Wiener classes using Chebyshev polynomial expansions. We develop and analyze a new version of the truncation method based on Chebyshev polynomials…

Numerical Analysis · Mathematics 2026-02-02 Maksym Kyselov , Sergiy G. Solodky

The Chebyshev polynomials are utilized in this study to define the subclass of the bi-univalent function. Also, Chebyshev polynomial bounds and Fekete-Szego inequalities for functions defined in the classes are established.

Complex Variables · Mathematics 2022-09-20 G. M. Birajdar , N. D. Sangle

In this paper we present some classes of real self-reciprocal polynomials with at most two zeros outside the unit circle which are connected with a Chebyshev quasi-orthogonal polynomials of order one. We investigated the distribution,…

Classical Analysis and ODEs · Mathematics 2017-09-12 Vanessa Botta

We solve the problem of factoring polynomials $V_n(x) \pm 1$ and $W_n(x) \pm 1$ where $V_n(x)$ and $W_n(x)$ are Chebyshev polynomials of the third and fourth kinds. The method of proof is based on previous work by Wolfram [12] for factoring…

Classical Analysis and ODEs · Mathematics 2022-03-22 D. A. Wolfram

Analytic expressions for the Fourier transforms of the Chebyshev and Legendre polynomials are derived, and the latter is used to find a new representation for the half-order Bessel functions. The numerical implementation of the so-called…

Numerical Analysis · Mathematics 2012-11-22 A. S. Fokas , S. A. Smitheman

In this paper, "chance optimization" problems are introduced, where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and computationally hard. With the objective…

Optimization and Control · Mathematics 2015-05-12 Ashkan Jasour , Necdet Serhat Aybat , Constantino Lagoa

For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…

Numerical Analysis · Mathematics 2017-08-10 Kevin W. Aiton , Tobin A. Driscoll

A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the…

Symbolic Computation · Computer Science 2013-06-19 Alexandre Benoit , Bruno Salvy

Disjointly constrained multilinear programming concerns the problem of maximizing a multilinear function on the product of finitely many disjoint polyhedra. While maximizing a linear function on a polytope (linear programming) is known to…

Optimization and Control · Mathematics 2016-03-14 Kai Kellner

We consider the problem of constructing an approximation of the Pareto curve associated with the multiobjective optimization problem $\min_{\mathbf{x} \in \mathbf{S}}\{ (f_1(\mathbf{x}), f_2(\mathbf{x})) \}$, where $f_1$ and $f_2$ are two…

Optimization and Control · Mathematics 2014-06-17 Victor Magron , Didier Henrion , Jean-Bernard Lasserre

We study weighted Chebyshev polynomials on compact subsets of the complex plane with respect to a bounded weight function. We establish existence and uniqueness of weighted Chebyshev polynomials and derive weighted analogs of Kolmogorov's…

Complex Variables · Mathematics 2025-08-13 Galen Novello , Klaus Schiefermayr , Maxim Zinchenko

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier-Stokes equation requires robust preconditioning strategies. One such strategy is multigrid. To realize the potential of…

Numerical Analysis · Mathematics 2023-02-27 Malachi Phillips , Paul Fischer

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

Information Theory · Computer Science 2020-10-19 Pavel Loskot

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

Optimization and Control · Mathematics 2023-01-24 Ngoc Hoang Anh Mai