>
Fa   |   Ar   |   En
   A new Lanczos-type algorithm for systems of linear equations  
   
نویسنده farooq m. ,salhi a.
منبع journal of prime research in mathematics - 2014 - دوره : 10 - شماره : 1 - صفحه:104 -119
چکیده    Lanczos-type algorithms are efficient and easy to imple-ment. unfortunately they breakdown frequently and well before con-vergence has been achieved. these algorithms are typically based on recurrence relations which involve formal orthogonal polynomials of low degree. in this paper,we consider a recurrence relation that has not been studied before and which involves a relatively higher degree polynomial. interestingly,it leads to an algorithm that shows su-perior stability when compared to existing lanczos-type algorithms. this new algorithm is derived and described. it is then compared to the best known algorithms of this type,namely a5/b10,a8/b10,as well as arnoldi's algorithm,on a set of standard test problems. numerical results are included.
کلیدواژه Arnoldi algorithm; Formal orthogonal polynomials; Lanczos algorithm; Systems of linear equations
آدرس department of mathematics,university of peshawar, Pakistan, department of mathematical sciences,university of essex,wivenhoe park, United Kingdom
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved