Results 11 to 20 of about 160 (66)
Fractal and fractional dynamics for a 3D autonomous and two-wing smooth chaotic system
Alexandria Engineering Journal, 2020 Some existing chaotic systems cannot display dynamics with attractors showing a fractal representation. This is due, not only to the nature of the phenomenon under description, but also to the type of derivative operator used to express the whole model ...
Emile F. Doungmo Goufo
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 39, Page 2487-2499, 2003., 2003 Recently, Tautenhahn and Hämarik (1999) have considered a monotone rule as a parameter choice strategy for choosing the regularization parameter while considering approximate solution of an ill‐posed operator equation Tx = y, where T is a bounded linear operator between Hilbert spaces.
Santhosh George, M. Thamban Nair
wiley +1 more source
An iterative approach to a constrained least squares problem
Abstract and Applied Analysis, Volume 2003, Issue 8, Page 503-512, 2003., 2003 A constrained least squares problem in a Hilbert space H is considered. The standard Tikhonov regularization method is used. In the case where the set of the constraints is the nonempty intersection of a finite collection of closed convex subsets of H, an iterative algorithm is designed.
Simeon Reich, Hong-Kun Xu
wiley +1 more source
Strong convergence of a self-adaptive method for the split feasibility problem
, 2013 Self-adaptive methods which permit step-sizes being selected self-adaptively are effective methods for solving some important problems, e.g., variational inequality problems.
Yonghong Yao, M. Postolache, Y. Liou
semanticscholar +1 more source
Stable Approximations of a Minimal Surface Problem with Variational Inequalities
Abstract and Applied Analysis, Volume 2, Issue 1-2, Page 137-161, 1997., 1997 In this paper we develop a new approach for the stable approximation of a minimal surface problem associated with a relaxed Dirichlet problem in the space BV(Ω) of functions of bounded variation. The problem can be reformulated as an unconstrained minimization problem of a functional 𝒥 on BV(Ω) defined by 𝒥(u) = 𝒜(u) + ∫∂Ω|Tu − Φ|, where 𝒜(u) is the ...
M. Zuhair Nashed, Otmar Scherzer
wiley +1 more source
Local Convergence and Radius of Convergence for Modified Newton Method
Annals of the West University of Timisoara: Mathematics and Computer Science, 2017 We investigate the local convergence of modified Newton method, i.e., the classical Newton method in which the derivative is periodically re-evaluated.
Măruşter Ştefan
doaj +1 more source
The implicit midpoint rule for nonexpansive mappings
, 2014 The implicit midpoint rule (IMR) for nonexpansive mappings is established. The IMR generates a sequence by an implicit algorithm. Weak convergence of this algorithm is proved in a Hilbert space.
M. Alghamdi +3 more
semanticscholar +1 more source
Stable discretization methods with external approximation schemes
International Journal of Stochastic Analysis, Volume 8, Issue 4, Page 405-413, 1995., 1995 We investigate the external approximation‐solvability of nonlinear equations‐ an upgrade of the external approximation scheme of Schumann and Zeidler [3] in the context of the difference method for quasilinear elliptic differential equations.
Ram U. Verma
wiley +1 more source
, 2014 The purpose of this paper is to study the split feasibility problem and fixed point problem involved in the pseudocontractive mappings. We construct an iterative algorithm and prove its strong convergence. MSC:47J25, 47H09, 65J15, 90C25.
Yonghong Yao +3 more
semanticscholar +1 more source
On iterative solution of nonlinear functional equations in a metric space
International Journal of Mathematics and Mathematical Sciences, Volume 6, Issue 1, Page 161-170, 1983., 1983 Given that A and P as nonlinear onto and into self‐mappings of a complete metric space R, we offer here a constructive proof of the existence of the unique solution of the operator equation Au = Pu, where u ∈ R, by considering the iterative sequence Aun+1 = Pun (u0 prechosen, n = 0, 1, 2, …).
Rabindranath Sen, Sulekha Mukherjee
wiley +1 more source