Abstract

Eigenstructure assignment for linear systems is basically an inverse eigenvalue problem. Two possible solutions to this problem that have been implemented on the Ctrl-C commercial design package are presented. One is a least-squares approach, and the other is an iterative method. Both algorithms use singular-value decomposition and produce robust (well-conditioned) answers to the state-feedback pole-assignment problem. An example is included to assess the relative strengths of the two techniques. Both methods give well-conditioned solutions to the problems, and although the iterative design is computationally more expensive, it requires less advance information.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.