A family of modified Ostrowski’s methods with optimal eighth order of convergence

In this paper, we derive a new family of eighth-order methods for obtaining simple roots of nonlinear equations by using the weight function method. Each iteration of these methods requires three evaluations of the function and one evaluation of its first derivative, so that their efficiency indices are 1.682, which are optimal according to the Kung and Traub’s conjecture (1974) [2]. Numerical comparisons are made to show the performance of the derived method, as is shown in the numerical section.     

Improved King’s methods with optimal order of convergence based on rational approximations

In this paper, we present three-point and four-point methods for solving nonlinear equations. The methodology is based on King’s family of fourth order methods [R.F. King, A family of fourth order methods for nonlinear equations, SIAM J. Numer. Anal. 10 (1973) 876–879] and further developed by using rational function approximations. The three-point method requires four function evaluations and has the order of convergence eight, whereas the four-point method requires five function evaluations and has the order of convergence sixteen. Therefore, the methods are optimal in the sense of Kung–Traub hypothesis. The proposed schemes are compared with closest competitors in a series of numerical examples. Moreover, theoretical order of convergence is verified in the examples.     

Generalized Nesterov’s accelerated proximal gradient algorithms with convergence rate of order o(1/k2)

Computational Optimization and Applications - The accelerated gradient method initiated by Nesterov is now recognized to be one of the most powerful tools for solving smooth convex optimization...     

Modified Ostrowski’s method with eighth-order convergence and high efficiency index

In this paper, based on Newton’s method, we derive a modified Ostrowski’s method with an eighth-order convergence for solving the simple roots of nonlinear equations by Hermite interpolation methods. Per iteration this method requires three evaluations of the function and one evaluation of its first derivative, which implies that the efficiency index of the developed method is 1.682, which is optimal according to Kung and Traub’s conjecture Kung and Traub (1974) [2]. Numerical comparisons are made to show the performance of the derived method, as shown in the illustrative examples.     

New modified optimal families of King’s and Traub-Ostrowski’s methods

Based on quadratically convergent Schröder’s method, we derive many new interesting families of fourth-order multipoint iterative methods without memory for obtaining simple roots of nonlinear equations by using the weight function approach. The classical King’s family of fourth-order methods and Traub-Ostrowski’s method are obtained as special cases. According to the Kung-Traub conjecture, these methods have the maximal efficiency index because only three functional values are needed per step. Therefore, the fourth-order family of King’s family and Traub-Ostrowski’smethod are the main findings of the present work. The performance of proposed multipoint methods is compared with their closest competitors, namely, King’s family, Traub-Ostrowski’s method, and Jarratt’s method in a series of numerical experiments. All the methods considered here are found to be effective and comparable to the similar robust methods available in the literature.     

Some improvements of Ostrowski’s method

In this paper, we present some new variants of Ostrowski’s method with order of convergence eight. For each iteration the new methods require three evaluations of the function and one evaluation of its first derivative and therefore they have the efficiency index equal to 1.682. Numerical tests verifying the theory are also given.     

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.     

An Improvement of Ostrowski’s and King’s Techniques with Optimal Convergence Order Eight

In this paper, we first establish a new class of three-point methods based on the two-point optimal method of Ostrowski. Analysis of convergence shows that any method of our class arrives at eighth order of convergence by using three evaluations of the function and one evaluation of the first derivative per iteration. Thus, this order agrees with the conjecture of Kung and Traub (J. ACM 643–651, 1974) for constructing multipoint optimal iterations without memory. We second present another optimal eighth-order class based on the King’s fourth-order family and the first attained class. To support the underlying theory developed in this work, we examine some methods of the proposed classes by comparison with some of the existing optimal eighth-order methods in literature. Numerical experience suggests that the new classes would be valuable alternatives for solving nonlinear equations.     

A new modification of He’s homotopy perturbation method for rapid convergence of nonlinear undamped oscillators

In this paper we present a new efficient modification of the homotopy perturbation method with x ³ force nonlinear undamped oscillators for the first time that will accurate and facilitate the calculations. The He’s homotopy perturbation method is modified by adding a term to linear operator depends on the equation and boundary conditions. We find that this modified homotopy perturbation method works very well for the wide range of time and boundary conditions for nonlinear oscillator. Only two or three iteration leads to high accuracy of the solutions. We then conduct a comparative study between the new modification and the homotopy perturbation method for strongly nonlinear oscillators. Numerical illustrations are investigated to show the accurate of the techniques. The new modified method accelerates the rapid convergence of the solution, reduces the error solution and increases the validity range. The new modification introduces a promising tool for many nonlinear problems.     

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.     

Irreducibility and extensions of Ostrowski’s Theorem

In this paper an extension of Ostrowski’s Theorem for complex square irreducible matrices is presented. Also extensions of similar statements for square complex matrices are analyzed and completed. Most of the statements in this work cover also the case of reducible matrices.     

A new proof of Stetsenko’s theorem

A short proof of V.A. Stetsenko’s theorem on weakly read-many Boolean functions is given, which is based on the technique of representing read-once functions in the form of trees.     

Rate of convergence of Euler’s approximations for SDEs with non-Lipschitz coefficients

We prove that Euler＇s approximations for stochastic differential equations driven by infinite many Brownian motions and with non-Lipschitz coefficients converge almost surely. Moreover, the rate of convergence is obtained.     

Uniform convergence of Green’s functions

Given a sequence of regular planar domains converging in the sense of kernel, we prove that the corresponding Green’s functions converge uniformly on the complex sphere, provided the limit domain is also regular, and the connectivity is uniformly bounded.     

A generalization of lebesgue’s convergence criterion for fourier series

For generalized Dirichlet integrals of type \(\int_0^1\ f(x)(e^{irx}-e^{airx}){dx\over x}\) a somewhat sharpened version of Lebesgue’s well-known convergence criterion for Fourier series is proven. Integrals of this type are of importance in the general theory of eigenfunction expansions inaugurated by investigations of Birkhoff, Tamarkin, and Stone.     

The convergence of the modified Gauss–Seidel methods for consistent linear systems

In this paper we present a convergence analysis for the modified Gauss–Seidel methods given in Gunawardena et al. (Linear Algebra Appl. 154–156 (1991) 125) and Kohno et al. (Linear Algebra Appl. 267 (1997) 113) for consistent linear systems. We prove that the modified Gauss–Seidel method converges for some values of the parameters in the preconditioned matrix.     

A new generalization of Hermite’s reciprocity law

Given a partition \(\lambda \) of n, the Schur functor \({\mathbb {S}}_\lambda \) associates to any complex vector space V, a subspace \({\mathbb {S}}_\lambda (V)\) of \(V^{\otimes n}\). Hermite’s reciprocity law, in terms of the Schur functor, states that \({\mathbb {S}}_{(p)}\left( {\mathbb {S}}_{(q)}({\mathbb {C}}^2)\right) \simeq {\mathbb {S}}_{(q)}\left( {\mathbb {S}}_{(p)}({\mathbb {C}}^2)\right) . \) We extend this identity to many other identities of the type \({\mathbb {S}}_{\lambda }\left( {\mathbb {S}}_{\delta }({\mathbb {C}}^2)\right) \simeq {\mathbb {S}}_{\mu }\left( {\mathbb {S}}_{\epsilon }({\mathbb {C}}^2)\right) \).     

A new family of Runge–Kutta type methods for the numerical integration of perturbed oscillators

Summary. Our task in this paper is to present a new family of methods of the Runge–Kutta type for the numerical integration of perturbed oscillators. The key property is that those algorithms are able to integrate exactly, without truncation error, harmonic oscillators, and that, for perturbed problems the local error contains the perturbation parameter as a factor. Some numerical examples show the excellent behaviour when they compete with Runge–Kutta–Nystr?m type methods. Received June 12, 1997 / Revised version received July 9, 1998