LMIs in Control/Click here to continue/Applications of Non-Linear Systems/Chebyshev Polynomials

From testwiki
Jump to navigation Jump to search

Chebyshev Polynomials

Required data

A univariate Polynomial whose SOSINEQ range specification is desired

The Problem

Let pn(x) be a univariate polynomial of degree n,withγ being the coefficient of xn.

maxγγ, subject to:
|pn(x)|1,x[1,1].

Formulation

The absolute value constraint can be easily rewritten using two inequalities, namely:

1+pn(x)01pn(x)0,x[1,1].

Solution

The optimal solution is γ*=2n1, with pn*(x)=arccos(cosnx) being the n-th Chebyshev polynomial of the first kind.


Example

Code example in SOStools probably worthwhile!

Reference

SOS tools manual: https://sums-of-squares.github.io/sos/

SOS Basics

Return to Main Page:

Template:BookCat


Template:BookCat