Iterative processes: A survey of convergence theory using Lyapunov second method

1994 ◽  
Vol 30 (4) ◽  
pp. 528-544
Author(s):  
A. N. Nakonechnyi
Keyword(s):  
Convergence Theory ◽  
Iterative Processes ◽  
Lyapunov Second Method

Meet fractal curves with 1C:MathKit

2020 ◽  
pp. 38-48
Author(s):  
O. M. Korchazhkina
Keyword(s):  
Methodological Approach ◽  
Fractal Curve ◽  
Iterative Processes ◽  
Geometric Figures ◽  
Modern Natural ◽  
Geometric Objects ◽  
Ict Tools ◽  
Subject Areas ◽  
The Subject ◽  
And Mathematics

The article presents a methodological approach to studying iterative processes in the school course of geometry, by the example of constructing a Koch snowflake fractal curve and calculating a few characteristics of it. The interactive creative environment 1C:MathKit is chosen to visualize the method discussed. By performing repetitive constructions and algebraic calculations using ICT tools, students acquire a steady skill of work with geometric objects of various levels of complexity, comprehend the possibilities of mathematical interpretation of iterative processes in practice, and learn how to understand the dialectical unity between finite and infinite parameters of flat geometric figures. When students are getting familiar with such contradictory concepts and categories, that replenishes their experience of worldview comprehension of the subject areas they study through the concept of “big ideas”. The latter allows them to take a fresh look at the processes in the world around. The article is a matter of interest to schoolteachers of computer science and mathematics, as well as university scholars who teach the course “Concepts of modern natural sciences”.

scholarly journals On the stability of asynchronous iterative processes

1987 ◽  
Vol 20 (1) ◽  
pp. 137-153 ◽  
Author(s):  
John N. Tsitsiklis
Keyword(s):  
Iterative Processes ◽  
The Stability

scholarly journals Trust-Region Based Penalty Barrier Algorithm for Constrained Nonlinear Programming Problems: An Application of Design of Minimum Cost Canal Sections

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1551
Author(s):  
Bothina El-Sobky ◽  
Yousria Abo-Elnaga ◽  
Abd Allah A. Mousa ◽  
Mohamed A. El-Shorbagy
Keyword(s):  
Nonlinear Programming ◽  
Global Convergence ◽  
Programming Problem ◽  
Trust Region ◽  
Convergence Theory ◽  
Benchmark Problems ◽  
Nonlinear Programming Problem ◽  
Barrier Method ◽  
Starting Point ◽  
Constrained Nonlinear Programming

In this paper, a penalty method is used together with a barrier method to transform a constrained nonlinear programming problem into an unconstrained nonlinear programming problem. In the proposed approach, Newton’s method is applied to the barrier Karush–Kuhn–Tucker conditions. To ensure global convergence from any starting point, a trust-region globalization strategy is used. A global convergence theory of the penalty–barrier trust-region (PBTR) algorithm is studied under four standard assumptions. The PBTR has new features; it is simpler, has rapid convergerce, and is easy to implement. Numerical simulation was performed on some benchmark problems. The proposed algorithm was implemented to find the optimal design of a canal section for minimum water loss for a triangle cross-section application. The results are promising when compared with well-known algorithms.

scholarly journals Application of a Generalized Secant Method to Nonlinear Equations with Complex Roots

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 169
Author(s):  
Avram Sidi
Keyword(s):  
Nonlinear Equations ◽  
Local Convergence ◽  
Real Root ◽  
Numerical Procedure ◽  
Secant Method ◽  
Convergence Theory ◽  
Simple Complex ◽  
Real Roots ◽  
Complex Roots ◽  
Appl Math

The secant method is a very effective numerical procedure used for solving nonlinear equations of the form f(x)=0. In a recent work (A. Sidi, Generalization of the secant method for nonlinear equations. Appl. Math. E-Notes, 8:115–123, 2008), we presented a generalization of the secant method that uses only one evaluation of f(x) per iteration, and we provided a local convergence theory for it that concerns real roots. For each integer k, this method generates a sequence {xn} of approximations to a real root of f(x), where, for n≥k, xn+1=xn−f(xn)/pn,k′(xn), pn,k(x) being the polynomial of degree k that interpolates f(x) at xn,xn−1,…,xn−k, the order sk of this method satisfying 1<sk<2. Clearly, when k=1, this method reduces to the secant method with s1=(1+5)/2. In addition, s1<s2<s3<⋯, such that limk→∞sk=2. In this note, we study the application of this method to simple complex roots of a function f(z). We show that the local convergence theory developed for real roots can be extended almost as is to complex roots, provided suitable assumptions and justifications are made. We illustrate the theory with two numerical examples.

Sign in / Sign up

Export Citation Format

Share Document