Results 1 
9 of
9
AN ITERATIVE SCHEME FOR SOLVING NONLINEAR EQUATIONS WITH MONOTONE OPERATORS
"... An iterative scheme for solving illposed nonlinear operator equations with monotone operators is introduced and studied in this paper. A discrete version of the Dynamical Systems Method (DSM) algorithm for stable solution of illposed operator equations with monotone operators is proposed and its c ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
An iterative scheme for solving illposed nonlinear operator equations with monotone operators is introduced and studied in this paper. A discrete version of the Dynamical Systems Method (DSM) algorithm for stable solution of illposed operator equations with monotone operators is proposed and its convergence is proved. A discrepancy principle is proposed and justified. A priori and a posteriori stopping rules for the iterative scheme are formulated and justified.
Dynamical systems gradient method for solving illconditioned linear algebraic systems
"... ..."
(Show Context)
2011): Iterative solution of a system of nonlinear algebraic equations F(x) = 0, using ẋ= λ [αR+βP] or λ [αF+βP∗], R is a normal to a hypersurface function of F, P normal to R, and P∗ normal to F. CMES: Computer Modeling in Engineering & Sciences
"... Function of F, P Normal to R, and P ∗ Normal to F ..."
Dynamical Systems Method (DSM) for solving equations with monotone operators without smoothness assumptions on F'(u)
 JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
, 2010
"... ..."
An Iterative Method Using an Optimal Descent Vector, for Solving an IllConditioned System Bx = b, Better and Faster than the Conjugate Gradient Method
"... Abstract: To solve an illconditioned system of linear algebraic equations (LAEs): Bx−b = 0, we define an invariantmanifold in terms of r: = Bx−b, and a monotonically increasing function Q(t) of a timelike variable t. Using this, we derive an evolution equation for dx/dt, which is a system of Non ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract: To solve an illconditioned system of linear algebraic equations (LAEs): Bx−b = 0, we define an invariantmanifold in terms of r: = Bx−b, and a monotonically increasing function Q(t) of a timelike variable t. Using this, we derive an evolution equation for dx/dt, which is a system of Nonlinear Ordinary Differential Equations (NODEs) for x in terms of t. Using the concept of discrete dynamics evolving on the invariant manifold, we arrive at a purely iterative algorithm for solving x, which we label as an Optimal Iterative Algorithm (OIA) involving an Optimal Descent Vector (ODV). The presently used ODV is a modification of the Descent Vector used in the wellknown and widely used Conjugate Gradient Method (CGM). The presently proposed OIA/ODV is shown, through several examples, to converge faster, with better accuracy, than the CGM. The proposed method has the potential for a wideapplicability in solving the LAEs arising out of the spatialdiscretization (using FEM, BEM, Trefftz, Meshless, and other methods)
Dynamical Systems Method (DSM) for solving nonlinear operator equations in Banach spaces
"... Let F (u) = h be an operator equation in a Banach space X with Gateaux differentiable norm, ‖F ′ (u) − F ′ (v) ‖ ≤ ω(‖u − v‖), where ω ∈ C([0, ∞)), ω(0) = 0, ω(r) is strictly growing on [0, ∞). Denote A(u):= F ′ (u), where F ′ (u) is the Fréchet derivative of F, and Aa: = A + aI. Assume that (*) ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let F (u) = h be an operator equation in a Banach space X with Gateaux differentiable norm, ‖F ′ (u) − F ′ (v) ‖ ≤ ω(‖u − v‖), where ω ∈ C([0, ∞)), ω(0) = 0, ω(r) is strictly growing on [0, ∞). Denote A(u):= F ′ (u), where F ′ (u) is the Fréchet derivative of F, and Aa: = A + aI. Assume that (*) ‖A −1 a (u) ‖ ≤ c1 a  b, a > 0, b> 0, a ∈ L. Here a may be a complex number, and L is a smooth path on the complex aplane, joining the origin and some point on the complex a−plane, 0 < a  < ɛ0, where ɛ0> 0 is a small fixed number, such that for any a ∈ L estimate (*) holds. It is proved that the DSM (Dynamical Systems Method) ˙u(t) = −A −1 a(t) (u(t))[F (u(t)) + a(t)u(t) − f], du u(0) = u0, ˙u = dt, converges to y as t → +∞, where a(t) ∈ L, F (y) = f, r(t): = a(t), and r(t) = c4(t + c2) −c3, where cj> 0 are some suitably chosen constants, j = 2, 3, 4. Existence of a solution y to the equation F (u) = f is assumed. It is also assumed that the equation F (wa) + awa − f = 0 is uniquely solvable for any f ∈ X, a ∈ L, and lima→0,a∈L ‖wa − y ‖ = 0.
DSM of Newton type for solving operator equations F(u) = f with minimal smoothness assumptions on F
 JOURN. COMP. SCI AND MATH., 3, N1/2, (2010), 355
, 2010
"... This paper is a review of the authors’ results on the DSM (Dynamical Systems Method) for solving operator equation (*) F (u) = f. It is assumed that (*) is solvable. The novel feature of the results is the minimal assumption on the smoothness of F. It is assumed that F is continuously Fréchet diffe ..."
Abstract
 Add to MetaCart
This paper is a review of the authors’ results on the DSM (Dynamical Systems Method) for solving operator equation (*) F (u) = f. It is assumed that (*) is solvable. The novel feature of the results is the minimal assumption on the smoothness of F. It is assumed that F is continuously Fréchet differentiable, but no smoothness assumptions on F ′ (u) are imposed. The DSM for solving equation (*) is developed. Under weak assumptions global existence of the solution u(t) is proved, the existence of u(∞) is established, and the relation F(u(∞)) = f is obtained. The DSM is developed for a stable solution of equation (*) when noisy data fδ are given, ‖‖f − fδ‖‖ ≤ δ.