To find the sparse and symmetric $n$ by $n$ least-change secant update we have to solve a consistent linear system of $n$ equations in $n$ unknowns, where the ...
This is a preview. Log in through your library . Abstract A quasi-Newton algorithm is presented which employs an initial factorization of the approximate Jacobian matrix. The method then updates the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback