Results 31 to 40 of about 380,543 (330)
Fixed points for mappings with a contractive iterate at each point [PDF]
Mathematica Slovaca, 2014 Abstract We generalize the results of Sehgal and Guseman for mappings on a complete metric space with a contractive iterate condition at each point.
Karaibryamov, Samet, Zlatanov, Boyan
openaire +2 more sources
Convergence analysis of projected fixed‐point iteration on a low‐rank matrix manifold [PDF]
Numerical Linear Algebra with Applications, 2016 In this paper, we analyze the convergence of a projected fixed‐point iteration on a Riemannian manifold of matrices with fixed rank. As a retraction method, we use the projector splitting scheme.
D. A. Kolesnikov, I. Oseledets
semanticscholar +1 more source
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
, 2022 S.188-201This work presents a novel approach for stage-to-stage calculations of distillation columns based on the MESH equations. No simplifying assumptions such as constant molar overflow are used. The transition from one stage to the next is formulated
Welke, Richard +5 more
core +1 more source
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
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization [PDF]
, 2017 Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability.
Gondzio, Jacek +4 more
core +1 more source
IEEE Transactions on Wireless Communications, 2019 In this paper, we revisit the fundamental problem of computing MIMO capacity under per-antenna power constraint (PAPC). Unlike the sum power constraint counterpart which likely admits water-filling-like solutions, MIMO capacity with PAPC has been largely
Thuy M. Pham, R. Farrell, Le-Nam Tran
semanticscholar +1 more source