A State-Space Algorithm for the Solution of the 2-Block Superoptimal Distance Problem | Zendy

Imad M. Jaimoukha | Zendy; D.J.N. Limebeer | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A State-Space Algorithm for the Solution of the 2-Block Superoptimal Distance Problem

Author(s) -

Imad M. Jaimoukha,

D.J.N. Limebeer

Publication year - 1993

Publication title -

siam journal on control and optimization

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 1.486

H-Index - 116

eISSN - 1095-7138

pISSN - 0363-0129

ISBN - 0-7803-0872-7

DOI - 10.1137/0331052

Subject(s) - mathematics , lexicographical order , degree (music) , block (permutation group theory) , function (biology) , state (computer science) , algorithm , state space , algebraic number , combinatorics , space (punctuation) , discrete mathematics , mathematical analysis , computer science , statistics , physics , evolutionary biology , acoustics , biology , operating system

The authors present a state-space algorithm for the solution of the 2-block super-optimal distance problem (SODP). Conditions are given for which the solution is unique. An a priori upper bound is also given on the MacMillan degree of the solution. The algorithm only requires standard linear algebraic computations, and is easily implemented

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research