Abstract
Lupaş q-analogues of the Bernstein functions play an important role in Approximation Theory and Computer Aided Geometric Design. Their collocation matrices are called Lupaş matrices. In this paper, we provide algorithms for computing the bidiagonal decomposition of these matrices and their inverses to high relative accuracy. It is also shown that these algorithms can be used to perform to high relative accuracy several algebraic calculations with these matrices, such as the calculation of their inverses, their eigenvalues or their singular values. Numerical experiments are included.
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.
