Practical Quasi-Newton algorithms for singular nonlinear systems

Quasi-Newton methods for solving singular systems of nonlinear equations are considered in this paper. Singular roots cause a number of problems in implementation of iterative methods and in general deteriorate the rate of convergence. We propose two modifications of QN methods based on Newton’s and Shamanski’s method for singular problems. The proposed algorithms belong to the class of two-step iterations. Influence of iterative rule for matrix updates and the choice of parameters that keep iterative sequence within convergence region are empirically analyzed and some conclusions are obtained.     

Fifth-order iterative method for finding multiple roots of nonlinear equations

This paper presents a fifth-order iterative method as a new modification of Newton’s method for finding multiple roots of nonlinear equations with unknown multiplicity m. Its convergence order is analyzed and proved. Moreover, several numerical examples demonstrate that the proposed iterative method is superior to the existing methods.     

New variants of Jarratt’s method with sixth-order convergence

In this paper, by using the two-variable Taylor expansion formula, we introduce some new variants of Jarratt’s method with sixth-order convergence for solving univariate nonlinear equations. The proposed methods contain some recent improvements of Jarratt’s method. Furthermore, a new variant of Jarratt’s method with sixth-order convergence for solving systems of nonlinear equations is proposed only with an additional evaluation for the involved function, and not requiring the computation of new inverse. Numerical comparisons are made to show the performance of the presented methods.     

Universal theory of dynamical chaos in nonlinear dissipative systems of differential equations

The article presents a new universal theory of dynamical chaos in nonlinear dissipative systems of differential equations, including autonomous and nonautonomous ordinary differential equations (ODE), partial differential equations, and delay differential equations. The theory relies on four remarkable results: Feigenbaum’s period doubling theory for cycles of one-dimensional unimodal maps, Sharkovskii’s theory of birth of cycles of arbitrary period up to cycle of period three in one-dimensional unimodal maps, Magnitskii’s theory of rotor singular point in two-dimensional nonautonomous ODE systems, acting as a bridge between one-dimensional maps and differential equations, and Magnitskii’s theory of homoclinic bifurcation cascade that follows the Sharkovskii cascade. All the theoretical propositions are rigorously proved and illustrated with numerous analytical examples and numerical computations, which are presented for all classical chaotic nonlinear dissipative systems of differential equations.     

A Hybrid of the Newton-GMRES and Electromagnetic Meta-Heuristic Methods for Solving Systems of Nonlinear Equations

Solving systems of nonlinear equations is perhaps one of the most difficult problems in all numerical computation. Although numerous methods have been developed to attack this class of numerical problems, one of the simplest and oldest methods, Newton’s method is arguably the most commonly used. As is well known, the convergence and performance characteristics of Newton’s method can be highly sensitive to the initial guess of the solution supplied to the method. In this paper a hybrid scheme is proposed, in which the Electromagnetic Meta-Heuristic method (EM) is used to supply a good initial guess of the solution to the finite difference version of the Newton-GMRES method (NG) for solving a system of nonlinear equations. Numerical examples are given in order to compare the performance of the hybrid of the EM and NG methods. Empirical results show that the proposed method is an efficient approach for solving systems of nonlinear equations.     

Method of accelerated convergence for the construction of solutions of a Noetherian boundary-value problem

We study the problem of finding conditions for the existence of solutions of weakly nonlinear Noetherian boundary-value problems for systems of ordinary differential equations and the construction of these solutions. A new iterative procedure with accelerated convergence is proposed for the construction of solutions of a weakly nonlinear Noetherian boundary-value problem for a system of ordinary differential equations in the critical case. Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 12, pp. 1587–1601, December, 2008.     

Accurate fourteenth-order methods for solving nonlinear equations

We establish new iterative methods of local order fourteen to approximate the simple roots of nonlinear equations. The considered three-step eighth-order construction can be viewed as a variant of Newton’s method in which the concept of Hermite interpolation is used at the third step to reduce the number of evaluations. This scheme includes three evaluations of the function and one evaluation of the first derivative per iteration, hence its efficiency index is 1.6817. Next, the obtained approximation for the derivative of the Newton’s iteration quotient is again taken into consideration to furnish novel fourteenth-order techniques consuming four function and one first derivative evaluations per iteration. In providing such new fourteenth-order methods, we also take a special heed to the computational burden. The contributed four-step methods have 1.6952 as their efficiency index. Finally, various numerical examples are given to illustrate the accuracy of the developed techniques.     

On using the modified variational iteration method for solving the nonlinear coupled equations in the mathematical physics

This paper applied the modified variational iteration method to the nonlinear coupled partial differential equations via the generalized nonlinear Hirota Satsuma coupled KdV equations, the nonlinear coupled Kortewge–de Vries KdV equations and the nonlinear shallow water equations together with the initial conditions. The proposed modification is made by introducing Adomian’s polynomials in the correct functional. The suggested algorithm is quite efficient and is practically well suited for use in such problems. The proposed iterative scheme finds the solution without any discritization, liberalization, perturbation, or restrictive assumptions.     

Taylor series method for dynamical systems with control: Convergence and error estimates

To optimize a complicated function constructed from a solution of a system of ordinary differential equations (ODEs), it is very important to be able to approximate a solution of a system of ODEs very precisely. The precision delivered by the standard Runge-Kutta methods often is insufficient, resulting in a “noisy function” to optimize. We consider an initial-value problem for a system of ordinary differential equations having polynomial right-hand sides with respect to all dependent variables. First we show how to reduce a wide class of ODEs to such polynomial systems. Using the estimates for the Taylor series method, we construct a new “aggregative” Taylor series method and derive guaranteed a priori step-size and error estimates for Runge-Kutta methods of order r. Then we compare the 8,13-Prince-Dormand’s, Taylor series, and aggregative Taylor series methods using seven benchmark systems of equations, including van der Pol’s equations, the “brusselator,” equations of Jacobi’s elliptic functions, and linear and nonlinear stiff systems of equations. The numerical experiments show that the Taylor series method achieves the best precision, while the aggregative Taylor series method achieves the best computational time. The final section of this paper is devoted to a comparative study of the above numerical integration methods for systems of ODEs describing the optimal flight of a spacecraft from the Earth to the Moon. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 24, Dynamical Systems and Optimization, 2005.     

On the local convergence of adjoint Broyden methods

The numerical solution of nonlinear equation systems is often achieved by so-called quasi-Newton methods. They preserve the rapid local convergence of Newton’s method at a significantly reduced cost per step by successively approximating the system Jacobian though low-rank updates. We analyze two variants of the recently proposed adjoint Broyden update, which for the first time combines the classical least change property with heredity on affine systems. However, the new update does require, the evaluation of so-called adjoint vectors, namely products of the transposed Jacobian with certain dual direction vectors. The resulting quasi-Newton method is linear contravariant in the sense of Deuflhard (Newton methods for nonlinear equations. Springer, Heidelberg, 2006) and it is shown here to be locally and q-superlinearly convergent. Our numerical results on a range of test problems demonstrate that the new method usually outperforms Newton’s and Broyden’s method in terms of runtime and iterations count, respectively. Partially supported by the DFG Research Center Matheon “Mathematics for Key Technologies”, Berlin and the DFG grant WA 1607/2-1.     

A modified Newton-Jarratt’s composition

A reduced composition technique has been used on Newton and Jarratt’s methods in order to obtain an optimal relation between convergence order, functional evaluations and number of operations. Following this aim, a family of methods is obtained whose efficiency indices are proved to be better for systems of nonlinear equations.     

On the efficiency index of one-point iterative processes

In this paper, we analyze the index of efficiency of one-point iterative processes, which are in practice the most used methods to solve a nonlinear equation. We obtain the best situation for one-point iterative processes with cubic convergence: Chebyshev’s method, Halley’s method, the super-Halley method and many others classical iterative methods with order of convergence three. By means of a construction of particular multipoint iterations, we get to improve the best situation obtained for one-point methods. Moreover, these type of multipoint iterations, can be considered as quasi-one-point iterations, since they only depend on one initial approximation. Numerical examples are given and the computed results support this theory. Partly supported by the Ministry of Education and Science (MTM 2005-03091) and the University of La Rioja (ATUR-05/43).     

Solving generalized equations via homotopies

Global Newton methods for computing solutions of nonlinear systems of equations have recently received a great deal of attention. By using the theory of generalized equations, a homotopy method is proposed to solve problems arising in complementarity and mathematical programming, as well as in variational inequalities. We introduce the concepts of generalized homotopies and regular values, characterize the solution sets of such generalized homotopies and prove, under boundary conditions similar to Smale’s [10], the existence of a homotopy path which contains an odd number of solutions to the problem. We related our homotopy path to the Newton method for generalized equations developed by Josephy [3]. An interpretation of our results for the nonlinear programming problem will be given.     

A vector version of Krasnosel’skiĭ’s fixed point theorem in cones and positive periodic solutions of nonlinear systems

A new version of Krasnosel’skiĭ’s fixed point theorem in cones is established for systems of operator equations, where the compression-expansion conditions are expressed on components. In applications, this allows the nonlinear term of a system to have different behaviors both in components and in variables.     

Jacobi’s last multiplier,Lie symmetries,and hidden linearity: “Goldfishes” galore

In addition to the reduction method, we present a novel application of Jacobi’s last multiplier for finding Lie symmetries of ordinary differential equations algorithmically. These methods and Lie symmetries allow unveiling the hidden linearity of certain nonlinear equations that are relevant in physics. We consider the Einstein-Yang-Mills equations and Calogero’s many-body problem in the plane as examples. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 151, No. 3, pp. 495–509, June, 2007.     

Nonlinear algebra and Bogoliubov’s recursion

We give many examples of applying Bogoliubov’s forest formula to iterative solutions of various nonlinear equations. The same formula describes an extremely wide class of objects, from an ordinary quadratic equation to renormalization in quantum field theory. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 154, No. 2, pp. 316–343, February, 2008.     

Modified Variational Iteration Method for Heat and Wave-Like Equations

In this paper, we apply the modified variational iteration method (MVIM) for solving the heat and wave-like equations. The proposed modification is made by introducing He’s polynomials in the correction functional. The suggested algorithm is quite efficient and is practically well suited for use in these problems. The proposed iterative scheme finds the solution without any discretization, linearization or restrictive assumptions. Several examples are given to verify the reliability and efficiency of the method. The fact that proposed technique solves nonlinear problems without using the Adomian’s polynomials can be considered as a clear advantage of this algorithm over the decomposition method.     

Group classification of systems of nonlinear reaction-diffusion equations with triangular diffusion matrix

We complete the group classification of systems of two coupled nonlinear reaction-diffusion equations with general diffusion matrix begun in author’s previous works. Namely, all nonequivalent equations with triangular diffusion matrix are classified. In addition, we describe symmetries of diffusion systems with nilpotent diffusion matrix and additional terms with first-order derivatives. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 3, pp. 395–411, March, 2007.     

Efficient three-step iterative methods with sixth order convergence for nonlinear equations

In this paper, we present two new three-step iterative methods for solving nonlinear equations with sixth convergence order. The new methods are obtained by composing known methods of third order of convergence with Newton’s method and using an adequate approximation for the derivative, that provides high order of convergence and reduces the required number of functional evaluations per step. The first method is obtained from Potra-Pták’s method and the second one, from Homeier’s method, both reaching an efficiency index of 1.5651. Our methods are comparable with the method of Parhi and Gupta (Appl Math Comput 203:50–55, 2008). Methods proposed by Kou and Li (Appl Math Comput 189:1816–1821, 2007), Wang et al. (Appl Math Comput 204:14–19, 2008) and Chun (Appl Math Comput 190:1432–1437, 2007) reach the same efficiency index, although they start from a fourth order method while we use third order methods and simpler arithmetics. We prove the convergence results and check them with several numerical tests that allow us to compare the convergence order, the computational cost and the efficiency order of our methods with those of the original methods.     

Numerical resolvent methods for constrained problems in mechanics

Resolvent methods are presented for generating systematically iterative numerical algorithms for constrained problems in mechanics. The abstract framework corresponds to a general mixed finite element subdifferential model, with dual and primal evolution versions, which is shown to apply to problems of fluid dynamics, transport phenomena and solid mechanics, among others. In this manner, Uzawa’s type methods and penalization-duality schemes, as well as macro-hybrid formulations, are generalized to non necessarily potential nonlinear mechanical problems.