Abstract
The recursive projection algorithm (rpa), derived from the vector Sylvester identity, has a connection with the recursive interpolation algorithm (ria). These algorithms have many applications and connections with some other methods used in various areas of numerical analysis. The aim of this paper is to study some properties of these algorithms. We use properties of projectors, a matrix implementation and the Schur complement extended to the vector case, to give a result about their finite termination.
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.
