Round-Off Stability of Iterations for Multivalued Operators

Singh, S. L.; Bhatnagar, Charu; Chadha, Veena
December 2007
Global Journal of Pure & Applied Mathematics;2007, Vol. 3 Issue 3, p391
Academic Journal
While solving inclusions numerically by an iterative procedure, usually we follow some theoretical model and deal with an approximate numerical sequence. If the numerical sequence converges to a point anticipated by the theoretical sequence, then we say that the iterative procedure is stable. This kind of study is of vital importance in numerical praxis. The purpose of this paper is to obtain some new results on the stability of Picard iterative procedure for multivalued operators in a very general setting. Some special cases are discussed as well.


Related Articles

  • An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization. Dai, Y. H.; Yuan, Y. // Annals of Operations Research;2001, Vol. 103 Issue 1-4, p33 

    Recently, we propose a nonlinear conjugate gradient method, which produces a descent search direction at every iteration and converges globally provided that the line search satisfies the weak Wolfe conditions. In this paper, we will study methods related to the new nonlinear conjugate gradient...

  • A generalized projection quasi-Newton method for nonlinear optimization problems. Yanlian Lai; Ziyou Gao; Guoping He // Annals of Operations Research;1999, Vol. 87 Issue 1-4, p353 

    In this paper, a generalized projection quasi-Newton method with inexact line search is proposed for the nonlinear optimization problem with linear constraints. The projection and quasi-Newton technique are used to determine the search direction at each iteration. It is proved that the method...

  • A Conjugate Gradient Method for Unconstrained Optimization Problems. Gonglin Yuan // International Journal of Mathematics & Mathematical Sciences;2009, p1 

    A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell (SWP) line search rule relaxing the parameter σ <...

  • Detection of flaws in a two-dimensional body through measurement of surface temperatures and use of conjugate gradient method. Siavashi, Majid; Kowsary, Farshad; Abbasi-Shavazi, Ehsan // Computational Mechanics;Sep2010, Vol. 46 Issue 4, p597 

    This paper aims to obtain parameters (i.e. location and dimensions) relevant to flaws in a two-dimensional body by measuring the temperature on its boundaries. In this endeavour, a steady-state heat conduction problem is formulated, and the geometry under study is subjected to a known heat load,...

  • Gradient Estimates for the Perfect Conductivity Problem. BAO, ELLEN SHITING; YAN YAN LI; BIAO YIN // Archive for Rational Mechanics & Analysis;Jul2009, Vol. 193 Issue 1, p195 

    We establish both upper and lower bounds of the gradient estimates for the perfect conductivity problem in the case where perfect (stiff) conductors are closely spaced inside an open bounded domain and away from the boundary. These results give the optimal blow-up rates of the stress for...

  • The DY Conjugate Gradient Method with Armijo-type Line Searches. Shujun Lian; Changyu Wang // Journal of Systems Science & Information;Jun2004, Vol. 2 Issue 2, p279 

    Two Armijo-type line searches are proposed in this paper for nonlinear conjugate gradient methods. The two Armijo-type line searches are shown to guarantee the global convergence of the DY method for the unconstrained minimization of nonconvex differentiable functions. Further, if the function...

  • Restrictively preconditioned conjugate gradient methods for systems of linear equations. Bai, Zhong-Zhi; Li, Gui-Qing // IMA Journal of Numerical Analysis;Oct2003, Vol. 23 Issue 4, p561 

    A restrictively preconditioned conjugate gradient method is presented for solving a large sparse system of linear equations. This new method originates from the classical conjugate gradient method and its restrictively preconditioned variant, and covers many standard Krylov subspace iteration...

  • The BiConjugate gradient method on GPUs. Ortega, G.; Garzón, E.; Vázquez, F.; García, I. // Journal of Supercomputing;Apr2013, Vol. 64 Issue 1, p49 

    In a wide variety of applications from different scientific and engineering fields, the solution of complex and/or nonsymmetric linear systems of equations is required. To solve this kind of linear systems the BiConjugate Gradient method (BCG) is especially relevant. Nevertheless, BCG has a...

  • On the blow-up phenomena of the periodic Dullin–Gottwald–Holm equation. Shuanghu Zhang; Zhaoyang Yin // Journal of Mathematical Physics;Nov2008, Vol. 49 Issue 11, p113504 

    We first present several new blow-up results for the periodic Dullin–Gottwald–Holm equation by using some new Sobolev inequalities. We then investigate the blow-up rate for all nonglobal solutions and determine the blow-up set of blowing-up solutions to the equation for a large...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics