Abstract
Recently, there has been a growing interest in the use of orthogonal rational functions (ORFs) in system identification. There are many advantages over more classical techniques. Probably due to a known explicit expression for the basis functions when the orthogonality weight is uniformly equal to 1 (the so called Malmquist basis), the attention has been on the development of methods using this basis. However, for some discrete identification problems, this choice of the orthogonality weight may still lead to serious numerical problems due to the ill conditioning of the linear system of equations to be solved. In this note, we give an algorithm based on a more general system of ORF to overcome the numerical problem and which allows for a fast-order update of the estimate.
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.
