Results 21 to 30 of about 57,211 (263)
Chebyshev Inertial Iteration for Accelerating Fixed-Point Iterations
CoRR, 2020 A novel method which is called the Chebyshev inertial iteration for accelerating the convergence speed of fixed-point iterations is presented. The Chebyshev inertial iteration can be regarded as a valiant of the successive over relaxation or Krasnosel'ski\vı-Mann iteration utilizing the inverse of roots of a Chebyshev polynomial as iteration dependent ...
Tadashi Wadayama, Satoshi Takabe
openaire +2 more sources
Clustering with Semidefinite Programming and Fixed Point Iteration
J. Mach. Learn. Res., 2020 We introduce a novel method for clustering using a semidefinite programming (SDP) relaxation of the Max k-Cut problem. The approach is based on a new methodology for rounding the solution of an SDP relaxation using iterated linear optimization. We show the vertices of the Max k-Cut relaxation correspond to partitions of the data into at most k sets. We
Pedro F. Felzenszwalb +2 more
openaire +4 more sources
Errata to “Elimination and fixed point iterations”
Computers & Mathematics with Applications, 1994 A programming mistake led to numerical errors in Tables 4.1 and 4.2 of the authors' paper [ibid. 25, No. 5, 43-53 (1993; Zbl 0780.65030)]. The two leftmost columns corresponding to the Newton iterations and their residuals in both tables are correct; on the other hand, those corresponding to the Newton-Fourier iterations are wrong.
Milaszewicz, J. P., Masih, S. Abdel
openaire +1 more source
Convergence Rate of Some Two-Step Iterative Schemes in Banach Spaces
Journal of Mathematics, 2016 This article proves some theorems to approximate fixed point of Zamfirescu operators on normed spaces for some two-step iterative schemes, namely, Picard-Mann iteration, Ishikawa iteration, S-iteration, and Thianwan iteration, with their errors.
O. T. Wahab +3 more
doaj +1 more source
Adjoints Of Fixed-Point Iterations
, 2014 Adjoint algorithms, and in particular those obtained through the adjoint mode of Automatic Differentiation (AD), are probably the most efficient way to obtain the gradient of a numerical simulation. This however needs to use the ow of data of the original simulation in reverse order, at a cost that increases with the length of the simulation.
Taftaf, Ala +2 more
openaire +3 more sources
Abstract and Applied Analysis, 2018 We introduce a new iterative method called D-iteration to approximate a fixed point of continuous nondecreasing functions on arbitrary closed intervals. The purpose is to improve the rate of convergence compared to previous work.
Jukkrit Daengsaen, Anchalee Khemphet
doaj +1 more source
A generalization of some fixed point theorems of K. M. Ghosh
International Journal of Mathematics and Mathematical Sciences, 1982 This note establishes the following result. Let T be a selfmap of a normed linear space E.
B. E. Rhoades
doaj +1 more source
A polynomially accelerated fixed-point iteration for vector problems [PDF]
E-Journal of Analysis and Applied MathematicsFixed-point solvers are ubiquitous in nonlinear PDEs, yet their progress collapses whenever the Jacobian at the solution carries an eigenvalue arbitrarily close to one.
Francesco Alemanno
doaj +1 more source
The Fixed Point Property of Strong Pseudocontraction Mapping
Journal of Harbin University of Science and Technology, 2020 In this paper, the iterative methods of fixed point of strong pseudocontraction mappings and accretive operators are studied in Banach spaces. A new threestep Ishikawa iteration is given.
CUI Yunan, ZHU Peng, WANG Ping
doaj +1 more source
A generalization of contraction principle
International 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