A quasi-Newton algorithm is presented which employs an initial factorization of the approximate Jacobian matrix. The method then updates the upper and lower triangular factors directly at each step.… Expand

has been studied by Bhatia [ 1 J, Bobisud [ 21, Butler [3], Erbe [ 51, Kamenev [ 71, Onose [ 12-14 ], Waltman [ 15 ], and Wong [ 16 ]. The survey paper of Wong [ 171 and the more recent survey by… Expand

Consider an even order equation D ny 0, where D is defined recursively by Doy = y, ak,k+,Dky t(= y)D t akiD. yiwhere a.. is continuous on [0, oo), a i+1> 0, i=1,.., n1,+ a, 1, and aij =0 for j > i +… Expand