Abstract
The Lanczos method with the Golub and Kahan bidiagonalization algorithm is used to solve non‐symmetric diagonal dominant simultaneous equations. The method is very suitable for sparse matrix and vector computer. The problem with loss of orthogonal property is dealt with by restating the iteration. Numerical examples together with FORTRAN 77 routine are given to illustrate the algorithm. Both scalar and vector CPU times are given for comparison.
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.
