Results 31 to 40 of about 55,994 (213)

Elimination and fixed point iterations

open access: yesComputers & Mathematics with Applications, 1993
In fixed point iterations for linear systems, partial elimination effects a reduction of the spectral radii of Jacobi and Gauss-Seidel iteration matrices if the original Jacobi matrix is nonnegative. In the present paper the authors show that similar results also hold for nonlinear systems if the corresponding Jacobian matrix is nonnegative.
Milaszewicz, J.P., Abdel Masih, S.
openaire   +1 more source

A generalization of contraction principle

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1981
In this paper, a generalized mean value contraction is introduced. This contraction is an extension of the contractions of earlier researchers and of the generalized mean value non-expansive mapping.
K. M. Ghosh
doaj   +1 more source

A fixed point theorem involving rational expressions without using Picard iteration

open access: yesTopological Algebra and its Applications, 2021
In this paper, we consider a certain fixed point theorem that contains some rational expressions. The main aim of this paper is to prove a fixed point theorem without using the Picard iteration.
Fulga Andreea
doaj   +1 more source

Fixed points and iteration homotopies [PDF]

open access: yesJournal of the Australian Mathematical Society, 1972
Suppose that Ф is a topological space equipped with a Hausdorff topology and that T is a continuous function mapping Ф into Ф. We discuss the existence and uniqueness of fixed points of T and the convergence of the Picard sequence of iterates, from the viewpoint of the existence of a homotopy with special properties.
openaire   +1 more source

A Design Methodology for the Seismic Retrofitting of Existing Frame Structures Post-Earthquake Incident Using Nonlinear Control Systems

open access: yesBuildings, 2022
A structural design methodology for retrofitting weakened frame systems following earthquakes is developed and presented. The design procedure refers to frame systems in their degraded strength and stiffness states and restores their dynamic performance ...
Assaf Shmerling, Matthias Gerdts
doaj   +1 more source

Numerical reckoning fixed points via new faster iteration process

open access: yesApplied General Topology, 2022
In this paper, we propose a new iteration process which is faster than the leading S [J. Nonlinear Convex Anal. 8, no. 1 (2007), 61-79], Thakur et al. [App. Math. Comp. 275 (2016), 147-155] and M [Filomat 32, no.
Kifayat Ullah   +2 more
doaj   +1 more source

Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems [PDF]

open access: yesSIAM Journal on Optimization, 2017
Summary: In this paper, we establish sublinear and linear convergence of fixed point iterations generated by averaged operators in a Hilbert space. Our results are achieved under a bounded Hölder regularity assumption which generalizes the well-known notion of bounded linear regularity.
Borwein, JM, Li, G, Tam, MK
openaire   +3 more sources

Some stability results for coupled fixed point iterative process in a complete metric space [PDF]

open access: yesSurveys in Mathematics and its Applications, 2019
In the paper [M. O. Olatinwo, Stability of coupled fixed point iterations and the continuous dependence of coupled fixed points, Communications on Applied Nonlinear Analysis 19 (2012), 71-83], the author has extended the notion of stability of fixed ...
M. O. Olatinwo, K. R. Tijani
doaj  

Iteration Scheme with Perturbed Mapping for Common Fixed Points of a Finite Family of Nonexpansive Mappings

open access: yesFixed Point Theory and Applications, 2007
We propose an iteration scheme with perturbed mapping for approximation of common fixed points of a finite family of nonexpansive mappings {Ti}i=1N. We show that the proposed iteration scheme converges to the common fixed point x*∈ ⋂i=1NFix(Ti)
Yeong-Cheng Liou   +2 more
doaj   +2 more sources

Fixed point iteration with inexact function values [PDF]

open access: yesMathematics of Computation, 1982
In many iterative schemes, the precision of each step depends on the computational effort spent on that step. A method of specifying a suitable amount of computation at each step is described. The approach is adaptive and aimed at minimizing the overall computational cost subject to attaining a final iterate that satisfies a suitable error criterion ...
openaire   +1 more source

Home - About - Disclaimer - Privacy