Abstract
We propose a numerically reliable computational approach to design least order fault detectors using descriptor system techniques. This approach is based on a new numerically stable algorithm to compute least order rational null space bases of rational matrices. The main computation in this algorithm is the onhogonal reduction of the system pencil matrix to a Kronecker-like form. The proposed approach can be combined with coprime factorization techniques to determine stable rational bases. Least order fault detectors can be detennined by selecting an appropriate linear combination of basis vectors by eliminating non-essential dynamics. The proposed approach is applicable to both standard and descriptor system descriptions.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
