Optimal H2 order-one reduction by solving eigenproblems for polynomial equations

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

A method is given for solving an optimal H2 approximation problem for SISO linear time-invariant stable systems. The method, based on constructive algebra, guarantees that the global optimum is found; it does not involve any gradient-based search, and hence avoids the usual problems of local minima. We examine mostly the case when the model order is reduced by one, and when the original system has distinct poles. This case exhibits special structure which allows us to provide a complete solution. The problem is converted into linear algebra by exhibiting a finite-dimensional basis for a certain space, and can then be solved by eigenvalue calculations, following the methods developed by Stetter and Moeller. The use of Buchberger's algorithm is avoided by writing the first-order optimality conditions in a special form, from which a Groebner basis is immediately available. Compared with our previous work the method presented here has much smaller time and memory requirements, and can therefore be applied to systems of significantly higher McMillan degree. In addition, some hypotheses which were required in the previous work have been removed. Some examples are included.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimal H2 order-one reduction by solving eigenproblems for polynomial equations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal H2 order-one reduction by solving eigenproblems for polynomial equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal H2 order-one reduction by solving eigenproblems for polynomial equations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-450805

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.