Abstract

Abstract : The authors construct a rank diminishing algorithm for matrices and adapt it for application to Lagrange interpolation polynomials (L sub n0) (f;x) of degree = or < (n-1). In r steps the authors arrive at the polynomials (L sub nr) (f;x) of degree (n-r-1), which share many approximation theoretic properties with Lagrange interpolation polynomials. (Author)

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.