LMIs in Control/Matrix and LMI Properties and Tools/Tangential Nevanlinna Pick

From testwiki
Jump to navigation Jump to search

Tangential Nevanlinna-Pick

The Tangential Nevanlinna-Pick arises in multi-input, multi-output (MIMO) control theory, particularly H robust and optimal control.

The problem is to try and find a function H:CCpxq which is analytic in C+ and satisfies Template:Indent H(λi)ui=vi, Template:Spaces i=1,...,m Template:Spaces with ||H||1Template:Spaces(1)

The System

N(ij) is a set of pxq matrix valued Nevanlinna functions. The matrix valued function H({\lambda}) analytic on the open upper half plane is a Nevanlinna function if Im(H(λ))0 (λπ+).

The Data

Given: Template:Indent Initial sequence of data points on real axis λ1,...,λm with λiC+=^(s|Re(s)>0),Template:Indent And two sequences of row vectors containing distinct target points u1,....,um with uiCq, and v1,...,vm with viCp,i=1,...,m.

The LMI: Tangential Nevanlinna- Pick

Problem (1) has a solution if and only if the following is true:

Nevanlinna-Pick Approach

Template:SpacesNij= uiujvivj λi+λj Template:Indent

Lyapunov Approach

N can also be found using the Lyapunov equation:

Template:SpacesAN+NA(UUVV)=0

where A=diag(λ1,...,λm),U=[u1...um],V=[v1...vm]

The tangential Nevanlinna-Pick problem is then solved by confirming that N0.

Conclusion:

If N(ij) is positive (semi)-definite, then there exists a norm-bounded analytic function, H which satisfies H(λi)ui=vi,Template:Spaces i=1,...,m Template:Spaces with ||H||1

Implementation

Implementation requires YALMIP and a linear solver such as sedumi. [1] - MATLAB code for Tangential Nevanlinna-Pick Problem.

Nevalinna-Pick Interpolation with Scaling


Return to Main Page:

LMIs in Control: https://en.wikibooks.org/wiki/LMIs_in_Control Template:BookCat