scholarly journals Implicit iterative schemes based on singular decomposition and regularizing algorithms

2018 ◽  
Vol 22 (3) ◽  
pp. 549-556
Author(s):  
Alexander Ivanovic Zhdanov
Keyword(s):  
Iterative Schemes ◽  
Singular Decomposition ◽  
Regularizing Algorithms

Предложен новый вариант неявного метода простых итераций на основе сингулярного разложения. Показано, что данный вариант неявного метода простых итераций позволяет существенно повысить вычислительную устойчивость алгоритма и при этом обеспечивает высокую скорость его сходимости. Рассмотрено применение неявного метода простых итераций на основе сингулярного разложения для разработки итерационных регуляризирующих алгоритмов. Предлагаемые алгоритмы могут быть эффективно использованы для решения широкого класса некорректных и плохо обусловленных вычислительных задач.

scholarly journals The equivalence between the (S,T)− stabilities of Jungck-type iterative schemes

Heliyon ◽  
2021 ◽  
Vol 7 (3) ◽  
pp. e06368
Author(s):  
Hudson Akewe ◽  
Joshua Olilima ◽  
Kanayo Stella Eke
Keyword(s):  
Iterative Schemes

Three novel fifth-order iterative schemes for solving nonlinear equations

2021 ◽  
Vol 187 ◽  
pp. 282-293
Author(s):  
Chein-Shan Liu ◽  
Essam R. El-Zahar ◽  
Chih-Wen Chang
Keyword(s):  
Nonlinear Equations ◽  
Iterative Schemes ◽  
Fifth Order

scholarly journals The alternate direction iterative methods for generalized saddle point systems

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Shuanghua Luo ◽  
Angang Cui ◽  
Cheng-yi Zhang
Keyword(s):  
Saddle Point ◽  
Iterative Methods ◽  
Iterative Schemes ◽  
Numerical Example ◽  
Convergence Results ◽  
Alternate Direction ◽  
Saddle Point Matrix

Abstract The paper studies two splitting forms of generalized saddle point matrix to derive two alternate direction iterative schemes for generalized saddle point systems. Some convergence results are established for these two alternate direction iterative methods. Meanwhile, a numerical example is given to show that the proposed alternate direction iterative methods are much more effective and efficient than the existing one.

scholarly journals Viscosity Approximation Methods for a Family of Nonexpansive Mappings in CAT(0) Spaces

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Jinfang Tang
Keyword(s):  
Strong Convergence ◽  
Nonexpansive Mappings ◽  
Approximation Methods ◽  
Viscosity Approximation Method ◽  
Viscosity Approximation ◽  
Convergence Problem ◽  
Iterative Schemes ◽  
The Family ◽  
Viscosity Approximation Methods ◽  
Implicit And Explicit

The purpose of this paper is using the viscosity approximation method to study the strong convergence problem for a family of nonexpansive mappings in CAT(0) spaces. Under suitable conditions, some strong convergence theorems for the proposed implicit and explicit iterative schemes to converge to a common fixed point of the family of nonexpansive mappings are proved which is also a unique solution of some kind of variational inequalities. The results presented in this paper extend and improve the corresponding results of some others.

scholarly journals Mixed quasi invex equilibrium problems

2004 ◽  
Vol 2004 (57) ◽  
pp. 3057-3067 ◽  
Author(s):  
Muhammad Aslam Noor
Keyword(s):  
Variational Inequalities ◽  
Equilibrium Problems ◽  
Strong Monotonicity ◽  
Auxiliary Principle ◽  
Auxiliary Principle Technique ◽  
Iterative Schemes ◽  
New Class ◽  
Special Cases ◽  
Weaker Conditions

We introduce a new class of equilibrium problems, known asmixed quasi invex equilibrium(orequilibrium-like) problems. This class of invex equilibrium problems includes equilibrium problems, variational inequalities, and variational-like inequalities as special cases. Several iterative schemes for solving invex equilibrium problems are suggested and analyzed using the auxiliary principle technique. It is shown that the convergence of these iterative schemes requires either pseudomonotonicity or partially relaxed strong monotonicity, which are weaker conditions than the previous ones. As special cases, we also obtained the correct forms of the algorithms for solving variational-like inequalities, which have been considered in the setting of convexity. In fact, our results represent significant and important refinements of the previously known results.

Sign in / Sign up

Export Citation Format

Share Document