Abstract
Extrapolation algorithms are used for accelerating scalar or vector sequences. They are also used for solving systems of linear and nonlinear equations. These algorithms are expressed in terms of a ratio of two determinants, as the E-algorithm and the general recursive projection algorithm ( grpa). In this paper we define the matrix extrapolation problem and we use the Schur complement and the Sylvester identity for solving this problem; we give two transformations, equivalent to the E-algorithm and the grpa, for the matrix case. We give also a characterization of their kernels.
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.
