Least-Change Secant Update Methods for Underdetermined Systems
نویسندگان
چکیده
منابع مشابه
A new gradient method via least change secant update
The Barzilai–Borwein (BB) gradient method is favourable over the classical steepest descent method both in theory and in real computations. This method takes a 'fixed' step size rather than following a set of line search rules to ensure convergence. Along this line, we present a new approach for the two-point approximation to the quasi-Newton equation within the BB framework on the basis of a w...
متن کاملOn the Relation between Two Local Convergence Theories of Least-change Secant Update Methods
In this paper, we show that the main results of the local convergence theory for least-change secant update methods of Dennis and Walker (SIAM J. Numer. Anal. 18 (1981), 949-987) can be proved using the theory introduced recently by Martinez (Math. Comp. 55 (1990), 143-167). In addition, we exhibit two generalizations of well-known methods whose local convergence can be easily proved using Mart...
متن کاملAn All-Inclusive Efficient Region of Updates for Least Change Secant Methods
Least change secant methods, for function minimization, depend on nding a \good" symmetric positive deenite update to approximate the Hessian. This update contains new curvature information while simultaneously preserving, as much as possible, the built up information from the previous update. Updates are generally derived using measures of least change based on some function of the eigen-value...
متن کاملInterval Methods for Solving Underdetermined Nonlinear Systems
The problem of enclosing all solutions of an underdetermined system of equations is considered. A few variants of the algorithm to solve this problem are compared – some of the features come from the literature and some are original. The paper discusses both implementational and theoretical issues of the problem, including a useful theorem that is proved. Shared-memory parallelization, using Op...
متن کاملVerified Bounds for Least Squares Problems and Underdetermined Linear Systems
New algorithms are presented for computing verified error bounds for least squares problems and underdetermined linear systems. In contrast to previous approaches the new methods do not rely on normal equations and are applicable to sparse matrices. Computational results demonstrate that the new methods are faster than existing ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1990
ISSN: 0036-1429,1095-7170
DOI: 10.1137/0727071