Abstract
The differential qd algorithm with the incorporation of shifts computes the singular values of bidiagonal matrices preserving high accuracy [4]. In this paper we propose an algorithm for the shift which uses only the squares of the elements of the matrix, so that the complete algorithm is implemented in terms of squares until final blocks of sizes 1 × 1 or 2 × 2 are reached. This shift is always lower than the smallest singular value and yields quadratic convergence as in [4]. The algorithm which computes the shift uses some parameters also useful for convergence criteria. Moreover a slight modification in the single step is proposed which admits a larger domain of the matrices to which the differential qd algorithm can be applied, using IEEE arithmetic.
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.
