Special Issue "Computational Methods in Analysis and Applications"

A special issue of Mathematics (ISSN 2227-7390).

Deadline for manuscript submissions: closed (1 September 2019).

Special Issue Editor

Prof. Dr. Ioannis K. Argyros
E-Mail Website
Guest Editor
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
Interests: numerical analysis; numerical functional analysis; iterative methods for solving equations and systems of equations
Special Issues and Collections in MDPI journals

Special Issue Information

Dear Colleagues,

A plethora of problems in mathematics, economics, physics, biology, chemistry, engineering, and other disciplines can be reduced to solving an equation or a system of equations in an abstract space. The solution of the equation can be found in closed form only in some special cases. That is why most researchers and practitioners introduce iterative methods to produce a sequence approximating the solution under certain conditions. The rapid development of digital computers, advanced computer arithmetics, and symbolic computation have made possible the implementation of high convergence order methods. Moreover, many methods of only academic interest in the past have now become feasible. The main purpose of this Special Issue is to present new ideas in the field of iterative methods and their applications in the aforementioned disciplines.

This issue gives an opportunity to researchers and practitioners to communicate their ideas. The contributors are invited to submit original research papers to stimulate interest in nonlinear equations and related areas.

Prof. Dr. Ioannis Argyros
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1200 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Newton-like methods
  • Steffensen-type methods
  • variational methods
  • iterative methods for image processing
  • methods for solving inverse problems
  • methods for generalized equilibrium problems
  • methods for optimization problems
  • methods in biology, chemistry, and medicine
  • methods in economics
  • methods in physics
  • methods in engineering

Published Papers (14 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Open AccessArticle
Approximating Fixed Points of Bregman Generalized α-Nonexpansive Mappings
Mathematics 2019, 7(8), 709; https://doi.org/10.3390/math7080709 - 06 Aug 2019
Cited by 1
Abstract
In this paper, we introduce a new class of Bregman generalized α -nonexpansive mappings in terms of the Bregman distance. We establish several weak and strong convergence theorems of the Ishikawa and Noor iterative schemes for Bregman generalized α -nonexpansive mappings in Banach [...] Read more.
In this paper, we introduce a new class of Bregman generalized α -nonexpansive mappings in terms of the Bregman distance. We establish several weak and strong convergence theorems of the Ishikawa and Noor iterative schemes for Bregman generalized α -nonexpansive mappings in Banach spaces. A numerical example is given to illustrate the main results of fixed point approximation using Halpern’s algorithm. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
A Modified Self-Adaptive Conjugate Gradient Method for Solving Convex Constrained Monotone Nonlinear Equations for Signal Recovery Problems
Mathematics 2019, 7(8), 693; https://doi.org/10.3390/math7080693 - 01 Aug 2019
Abstract
In this article, we propose a modified self-adaptive conjugate gradient algorithm for handling nonlinear monotone equations with the constraints being convex. Under some nice conditions, the global convergence of the method was established. Numerical examples reported show that the method is promising and [...] Read more.
In this article, we propose a modified self-adaptive conjugate gradient algorithm for handling nonlinear monotone equations with the constraints being convex. Under some nice conditions, the global convergence of the method was established. Numerical examples reported show that the method is promising and efficient for solving monotone nonlinear equations. In addition, we applied the proposed algorithm to solve sparse signal reconstruction problems. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
On a Bi-Parametric Family of Fourth Order Composite Newton–Jarratt Methods for Nonlinear Systems
Mathematics 2019, 7(6), 492; https://doi.org/10.3390/math7060492 - 29 May 2019
Cited by 1
Abstract
We present a new two-parameter family of fourth-order iterative methods for solving systems of nonlinear equations. The scheme is composed of two Newton–Jarratt steps and requires the evaluation of one function and two first derivatives in each iteration. Convergence including the order of [...] Read more.
We present a new two-parameter family of fourth-order iterative methods for solving systems of nonlinear equations. The scheme is composed of two Newton–Jarratt steps and requires the evaluation of one function and two first derivatives in each iteration. Convergence including the order of convergence, the radius of convergence, and error bounds is presented. Theoretical results are verified through numerical experimentation. Stability of the proposed class is analyzed and presented by means of using new dynamics tool, namely, the convergence plane. Performance is exhibited by implementing the methods on nonlinear systems of equations, including those resulting from the discretization of the boundary value problem. In addition, numerical comparisons are made with the existing techniques of the same order. Results show the better performance of the proposed techniques than the existing ones. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
Unified Local Convergence for Newton’s Method and Uniqueness of the Solution of Equations under Generalized Conditions in a Banach Space
Mathematics 2019, 7(5), 463; https://doi.org/10.3390/math7050463 - 23 May 2019
Abstract
Under the hypotheses that a function and its Fréchet derivative satisfy some generalized Newton–Mysovskii conditions, precise estimates on the radii of the convergence balls of Newton’s method, and of the uniqueness ball for the solution of the equations, are given for Banach space-valued [...] Read more.
Under the hypotheses that a function and its Fréchet derivative satisfy some generalized Newton–Mysovskii conditions, precise estimates on the radii of the convergence balls of Newton’s method, and of the uniqueness ball for the solution of the equations, are given for Banach space-valued operators. Some of the existing results are improved with the advantages of larger convergence region, tighter error estimates on the distances involved, and at-least-as-precise information on the location of the solution. These advantages are obtained using the same functions and Lipschitz constants as in earlier studies. Numerical examples are used to test the theoretical results. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
On a Variational Method for Stiff Differential Equations Arising from Chemistry Kinetics
Mathematics 2019, 7(5), 459; https://doi.org/10.3390/math7050459 - 21 May 2019
Abstract
For the approximation of stiff systems of ODEs arising from chemistry kinetics, implicit integrators emerge as good candidates. This paper proposes a variational approach for this type of systems. In addition to introducing the technique, we present its most basic properties and test [...] Read more.
For the approximation of stiff systems of ODEs arising from chemistry kinetics, implicit integrators emerge as good candidates. This paper proposes a variational approach for this type of systems. In addition to introducing the technique, we present its most basic properties and test its numerical performance through some experiments. The main advantage with respect to other implicit methods is that our approach has a global convergence. The other approaches need to ensure convergence of the iterative scheme used to approximate the associated nonlinear equations that appear for the implicitness. Notice that these iterative methods, for these nonlinear equations, have bounded basins of attraction. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
Computing Degree Based Topological Properties of Third Type of Hex-Derived Networks
Mathematics 2019, 7(4), 368; https://doi.org/10.3390/math7040368 - 23 Apr 2019
Cited by 1
Abstract
In chemical graph theory, a topological index is a numerical representation of a chemical network, while a topological descriptor correlates certain physicochemical characteristics of underlying chemical compounds besides its chemical representation. The graph plays a vital role in modeling and designing any chemical [...] Read more.
In chemical graph theory, a topological index is a numerical representation of a chemical network, while a topological descriptor correlates certain physicochemical characteristics of underlying chemical compounds besides its chemical representation. The graph plays a vital role in modeling and designing any chemical network. Simonraj et al. derived a new type of graphs, which is named a third type of hex-derived networks. In our work, we discuss the third type of hex-derived networks H D N 3 ( r ) , T H D N 3 ( r ) , R H D N 3 ( r ) , C H D N 3 ( r ) , and compute exact results for topological indices which are based on degrees of end vertices. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
Convergence Analysis of Weighted-Newton Methods of Optimal Eighth Order in Banach Spaces
Mathematics 2019, 7(2), 198; https://doi.org/10.3390/math7020198 - 19 Feb 2019
Abstract
We generalize a family of optimal eighth order weighted-Newton methods to Banach spaces and study their local convergence. In a previous study, the Taylor expansion of higher order derivatives is employed which may not exist or may be very expensive to compute. However, [...] Read more.
We generalize a family of optimal eighth order weighted-Newton methods to Banach spaces and study their local convergence. In a previous study, the Taylor expansion of higher order derivatives is employed which may not exist or may be very expensive to compute. However, the hypotheses of the present study are based on the first Fréchet-derivative only, thereby the application of methods is expanded. New analysis also provides the radius of convergence, error bounds and estimates on the uniqueness of the solution. Such estimates are not provided in the approaches that use Taylor expansions of derivatives of higher order. Moreover, the order of convergence for the methods is verified by using computational order of convergence or approximate computational order of convergence without using higher order derivatives. Numerical examples are provided to verify the theoretical results and to show the good convergence behavior. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Open AccessArticle
Improved Convergence Analysis of Gauss-Newton-Secant Method for Solving Nonlinear Least Squares Problems
Mathematics 2019, 7(1), 99; https://doi.org/10.3390/math7010099 - 18 Jan 2019
Cited by 1
Abstract
We study an iterative differential-difference method for solving nonlinear least squares problems, which uses, instead of the Jacobian, the sum of derivative of differentiable parts of operator and divided difference of nondifferentiable parts. Moreover, we introduce a method that uses the derivative of [...] Read more.
We study an iterative differential-difference method for solving nonlinear least squares problems, which uses, instead of the Jacobian, the sum of derivative of differentiable parts of operator and divided difference of nondifferentiable parts. Moreover, we introduce a method that uses the derivative of differentiable parts instead of the Jacobian. Results that establish the conditions of convergence, radius and the convergence order of the proposed methods in earlier work are presented. The numerical examples illustrate the theoretical results. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Open AccessArticle
Resistance Distance in the Double Corona Based on R-Graph
Mathematics 2019, 7(1), 92; https://doi.org/10.3390/math7010092 - 17 Jan 2019
Cited by 2
Abstract
Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 [...] Read more.
Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end points of the edge corresponding to it. Let G 1 and G 2 be graphs on n 1 and n 2 vertices, respectively. The R-graph double corona G 0 ( R ) { G 1 , G 2 } of G 0 , G 1 and G 2 , is the graph obtained by taking one copy of R ( G 0 ) , n copies of G 1 and m copies of G 2 and then by joining the i-th old-vertex of R ( G 0 ) to every vertex of the i-th copy of G 1 and the j-th new vertex of R ( G 0 ) to every vertex of the j-th copy of G 2 . In this paper, we consider resistance distance in G 0 ( R ) { G 1 , G 2 } . Moreover, we give an example to illustrate the correction and efficiency of the proposed method. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
Extending the Applicability of Two-Step Solvers for Solving Equations
Mathematics 2019, 7(1), 62; https://doi.org/10.3390/math7010062 - 08 Jan 2019
Cited by 1
Abstract
We present a local convergence of two-step solvers for solving nonlinear operator equations under the generalized Lipschitz conditions for the first- and second-order derivatives and for the first order divided differences. In contrast to earlier works, we use our new idea of center [...] Read more.
We present a local convergence of two-step solvers for solving nonlinear operator equations under the generalized Lipschitz conditions for the first- and second-order derivatives and for the first order divided differences. In contrast to earlier works, we use our new idea of center average Lipschitz conditions, through which, we define a subset of the original domain that also contains the iterates. Then, the remaining average Lipschitz conditions are at least as tight as the corresponding ones in earlier works. This way, we obtain weaker sufficient convergence criteria, larger radius of convergence, tighter error estimates, and better information on the solution. These extensions require the same effort, since the new Lipschitz functions are special cases of the ones in earlier works. Finally, we give a numerical example that confirms the theoretical results, and compares favorably to the results from previous works. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Open AccessArticle
Convergence Ball and Complex Geometry of an Iteration Function of Higher Order
Mathematics 2019, 7(1), 28; https://doi.org/10.3390/math7010028 - 29 Dec 2018
Abstract
Higher-order derivatives are used to determine the convergence order of iterative methods. However, such derivatives are not present in the formulas. Therefore, the assumptions on the higher-order derivatives of the function restrict the applicability of methods. Our convergence analysis of an eighth-order method [...] Read more.
Higher-order derivatives are used to determine the convergence order of iterative methods. However, such derivatives are not present in the formulas. Therefore, the assumptions on the higher-order derivatives of the function restrict the applicability of methods. Our convergence analysis of an eighth-order method uses only the derivative of order one. The convergence results so obtained are applied to some real problems, which arise in science and engineering. Finally, stability of the method is checked through complex geometry shown by drawing basins of attraction of the solutions. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
New Iterative Methods for Solving Nonlinear Problems with One and Several Unknowns
Mathematics 2018, 6(12), 296; https://doi.org/10.3390/math6120296 - 01 Dec 2018
Cited by 1
Abstract
In this manuscript, a new type of study regarding the iterative methods for solving nonlinear models is presented. The goal of this work is to design a new fourth-order optimal family of two-step iterative schemes, with the flexibility through weight function/s or free [...] Read more.
In this manuscript, a new type of study regarding the iterative methods for solving nonlinear models is presented. The goal of this work is to design a new fourth-order optimal family of two-step iterative schemes, with the flexibility through weight function/s or free parameter/s at both substeps, as well as small residual errors and asymptotic error constants. In addition, we generalize these schemes to nonlinear systems preserving the order of convergence. Regarding the applicability of the proposed techniques, we choose some real-world problems, namely chemical fractional conversion and the trajectory of an electron in the air gap between two parallel plates, in order to study the multi-factor effect, fractional conversion of species in a chemical reactor, Hammerstein integral equation, and a boundary value problem. Moreover, we find that our proposed schemes run better than or equal to the existing ones in the literature. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Show Figures

Figure 1

Open AccessArticle
Ball Convergence of an Efficient Eighth Order Iterative Method Under Weak Conditions
Mathematics 2018, 6(11), 260; https://doi.org/10.3390/math6110260 - 17 Nov 2018
Cited by 2
Abstract
The convergence order of numerous iterative methods is obtained using derivatives of a higher order, although these derivatives are not involved in the methods. Therefore, these methods cannot be used to solve equations with functions that do not have such high-order derivatives, since [...] Read more.
The convergence order of numerous iterative methods is obtained using derivatives of a higher order, although these derivatives are not involved in the methods. Therefore, these methods cannot be used to solve equations with functions that do not have such high-order derivatives, since their convergence is not guaranteed. The convergence in this paper is shown, relying only on the first derivative. That is how we expand the applicability of some popular methods. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Open AccessArticle
Unified Semi-Local Convergence for k—Step Iterative Methods with Flexible and Frozen Linear Operator
Mathematics 2018, 6(11), 233; https://doi.org/10.3390/math6110233 - 30 Oct 2018
Abstract
The aim of this article is to present a unified semi-local convergence analysis for a k-step iterative method containing the inverse of a flexible and frozen linear operator for Banach space valued operators. Special choices of the linear operator reduce the method [...] Read more.
The aim of this article is to present a unified semi-local convergence analysis for a k-step iterative method containing the inverse of a flexible and frozen linear operator for Banach space valued operators. Special choices of the linear operator reduce the method to the Newton-type, Newton’s, or Stirling’s, or Steffensen’s, or other methods. The analysis is based on center, as well as Lipschitz conditions and our idea of the restricted convergence region. This idea defines an at least as small region containing the iterates as before and consequently also a tighter convergence analysis. Full article
(This article belongs to the Special Issue Computational Methods in Analysis and Applications)
Back to TopTop