Abstract
A fast and accurate algorithm to compute the bidiagonal decomposition of collocation matrices of the Lupaş-type (p,q)-analogue of the Bernstein basis is presented. The error analysis of the algorithm and the perturbation theory for the bidiagonal decomposition are also included. Starting from this bidiagonal decomposition, the accurate and efficient solution of several linear algebra problems involving these matrices is addressed: linear system solving, eigenvalue and singular value computation, and computation of the inverse and the Moore-Penrose inverse. The numerical experiments carried out show the good behaviour of the algorithm.
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.
