Application of the Kudryashov method for finding exact solutions of the high order nonlinear evolution equations

The application of the Kudryashov method for finding exact solutions of the high order nonlinear evolution equations is considered. Some classes of solitary wave solutions for the families of nonlinear evolution equations of fifth, sixth and seventh order are obtained. The efficiency of the Kudryashov method for finding exact solutions of the high order nonlinear evolution equations is demonstrated.     

Oscillation of some nonlinear difference equations

We investigate the oscillatory behavior of all solutions of a new class of first order nonlinear neutral difference equations. Several explicit oscillation criteria are established. Our main results are supported by illustrative examples.     

A multi-iterate method to solve systems of nonlinear equations

We propose an extension of secant methods for nonlinear equations using a population of previous iterates. Contrarily to classical secant methods, where exact interpolation is used, we prefer a least squares approach to calibrate the linear model. We propose an explicit control of the numerical stability of the method.     

An iterative method for solving nonlinear functional equations

An iterative method for solving nonlinear functional equations, viz. nonlinear Volterra integral equations, algebraic equations and systems of ordinary differential equation, nonlinear algebraic equations and fractional differential equations has been discussed.     

Solution of nonlinear fractional differential equations using homotopy analysis method

In this article, the homotopy analysis method has been applied to solve nonlinear differential equations of fractional order. The validity of this method has successfully been accomplished by applying it to find the solution of two nonlinear fractional equations. The results obtained by homotopy analysis method have been compared with those exact solutions. The results show that the solution of homotopy analysis method is good agreement with the exact solution.     

Inexact trust region method for large sparse systems of nonlinear equations

The main purpose of this paper is to prove the global convergence of the new trust region method based on the smoothed CGS algorithm. This method is surprisingly convenient for the numerical solution of large sparse systems of nonlinear equations, as is demonstrated by numerical experiments. A modification of the proposed trust region method does not use matrices, so it can be used for large dense systems of nonlinear equations.     

Steklov-Neumann eigenproblems and nonlinear elliptic equations with nonlinear boundary conditions

We study the solvability of nonlinear second order elliptic partial differential equations with nonlinear boundary conditions. We introduce the notion of “eigenvalue-lines” in the plane; these eigenvalue-lines join each Steklov eigenvalue to the first eigenvalue of the Neumann problem with homogeneous boundary condition. We prove existence results when the nonlinearities involved asymptotically stay, in some sense, below the first eigenvalue-lines or in a quadrilateral region (depicted in Fig. 1) enclosed by two consecutive eigenvalue-lines. As a special case we derive the so-called nonresonance results below the first Steklov eigenvalue as well as between two consecutive Steklov eigenvalues. The case in which the eigenvalue-lines join each Neumann eigenvalue to the first Steklov eigenvalue is also considered. Our method of proof is variational and relies mainly on minimax methods in critical point theory.     

Nonmonotone stabilization methods for nonlinear equations

We are concerned with defining new globalization criteria for solution methods of nonlinear equations. The current criteria used in these methods require a sufficient decrease of a particular merit function at each iteration of the algorithm. As was observed in the field of smooth unconstrained optimization, this descent requirement can considerably slow the rate of convergence of the sequence of points produced and, in some cases, can heavily deteriorate the performance of algorithms. The aim of this paper is to show that the global convergence of most methods proposed in the literature for solving systems of nonlinear equations can be obtained using less restrictive criteria that do not enforce a monotonic decrease of the chosen merit function. In particular, we show that a general stabilization scheme, recently proposed for the unconstrained minimization of continuously differentiable functions, can be extended to methods for the solution of nonlinear (nonsmooth) equations. This scheme includes different kinds of relaxation of the descent requirement and opens up the possibility of describing new classes of algorithms where the old monotone linesearch techniques are replace with more flexible nonmonotone stabilization procedures. As in the case of smooth unconstrained optimization, this should be the basis for defining more efficient algorithms with very good practical rates of convergence.This material is partially based on research supported by the Air Force Office of Scientific Research Grant AFOSR-89-0410, National Science Foundation Grant CCR-91-57632, and Istituto di Analisi dei Sistemi ed Informatica del CNR.     

Delay-dependent dissipativity of nonlinear delay differential equations

In this paper, the delay-dependent dissipativity of nonlinear delay differential equations is studied. A new dissipativity criterion is derived, which is less conservative than those in the existing literature in some cases, especially for equations with small delays.     

Solving nonlinear simultaneous equations with a generalization of Brent's method

We describe an implementation of a generalization of Brent's method for solving systems of nonlinear equations. Some important features of the algorithm, like step control, discretization of derivatives and stopping criteria, are discussed. In particular we give numerical experiences which show that a stopping criterion proposed by D. Gay is efficient.     

Explicit traveling wave solutions of five kinds of nonlinear evolution equations

First of all, by using Bernoulli equations, we develop some technical lemmas. Then, we establish the explicit traveling wave solutions of five kinds of nonlinear evolution equations: nonlinear convection diffusion equations (including Burgers equations), nonlinear dispersive wave equations (including Korteweg-de Vries equations), nonlinear dissipative dispersive wave equations (including Ginzburg-Landau equation, Korteweg-de Vries-Burgers equation and Benjamin-Bona-Mahony-Burgers equation), nonlinear hyperbolic equations (including Sine-Gordon equation) and nonlinear reaction diffusion equations (including Belousov-Zhabotinskii system of reaction diffusion equations).     

Oscillation theorems for differential equations with a nonlinear damping term

In this paper, we are concerned with a class of nonlinear second-order differential equations with a nonlinear damping term. Passage to more general class of equations allows us to remove a restrictive condition usually imposed on the nonlinearity, and, as a consequence, our results apply to wider classes of nonlinear differential equations. Two illustrative examples are considered.     

On the similarity of some three-point methods for solving nonlinear equations

In this short note we discuss certain similarities between some three-point methods for solving nonlinear equations. In particular, we show that the recent three-point method published in [R. Thukral, A new eighth-order iterative method for solving nonlinear equations, Appl. Math. Comput. 217 (2010) 222-229] is a special case of the family of three-point methods proposed previously in [R. Thukral, M.S. Petkovi?, Family of three-point methods of optimal order for solving nonlinear equations, J. Comput. Appl. Math. 233 (2010) 2278-2284].     

Numerical solution of the nonlinear Fredholm integral equations by positive definite functions

A numerical method for solving the nonlinear Fredholom integral equations is presented. The method is based on interpolation by radial basis functions (RBF) to approximate the solution of the Fredholm nonlinear integral equations. Several examples are given and numerical examples are presented to demonstrate the validity and applicability of the method.     

The EHTA for nonlinear evolution equations

Two types of important nonlinear evolution equations are investigated by using the extended homoclinic test approach (EHTA). Some exact soliton solutions including breather type of soliton, periodic type of soliton and two soliton solutions are obtained. These results show that the extended homoclinic test technique together with the bilinear method is a simple and effective method to seek exact solutions for nonlinear evolution equations.     

A new sixth-order scheme for nonlinear equations

In this paper we present a new efficient sixth-order scheme for nonlinear equations. The method is compared to several members of the family of methods developed by Neta (1979) [B. Neta, A sixth-order family of methods for nonlinear equations, Int. J. Comput. Math. 7 (1979) 157-161]. It is shown that the new method is an improvement over this well known scheme.     

The “Gauss-Seidelization” of iterative methods for solving nonlinear equations in the complex plane

In this paper we introduce a process we have called “Gauss-Seidelization” for solving nonlinear equations. We have used this name because the process is inspired by the well-known Gauss-Seidel method to numerically solve a system of linear equations. Together with some convergence results, we present several numerical experiments in order to emphasize how the Gauss-Seidelization process influences on the dynamical behavior of an iterative method for solving nonlinear equations.     

The solution of high-order nonlinear ordinary differential equations by Chebyshev Series

By the use of the Chebyshev series, a direct computational method for solving the higher order nonlinear differential equations has been developed in this paper. This method transforms the nonlinear differential equation into the matrix equation, which corresponds to a system of nonlinear algebraic equations with unknown Chebyshev coefficients, via Chebyshev collocation points. The solution of this system yields the Chebyshev coefficients of the solution function. An algorithm for this nonlinear system is also proposed in this paper. The method is valid for both initial-value and boundary-value problems. Several examples are presented to illustrate the accuracy and effectiveness of the method.     

Exp-function method for traveling wave solutions of nonlinear evolution equations

In this paper, we apply the exp-function method to construct generalized solitary and periodic solutions of nonlinear evolution equations. The proposed technique is tested on the modified Zakharov-Kuznetsov (ZK) and Zakharov-Kuznetsov-Modified-Equal-Width (ZK-MEW) equations. These equations play a very important role in mathematical physics and engineering sciences. The suggested algorithm is quite efficient and is practically well suited for use in these problems. Numerical results clearly indicate the reliability and efficiency of the proposed exp-function method.     

Tensor methods for large sparse systems of nonlinear equations

This paper introduces tensor methods for solving large sparse systems of nonlinear equations. Tensor methods for nonlinear equations were developed in the context of solving small to medium-sized dense problems. They base each iteration on a quadratic model of the nonlinear equations, where the second-order term is selected so that the model requires no more derivative or function information per iteration than standard linear model-based methods, and hardly more storage or arithmetic operations per iteration. Computational experiments on small to medium-sized problems have shown tensor methods to be considerably more efficient than standard Newton-based methods, with a particularly large advantage on singular problems. This paper considers the extension of this approach to solve large sparse problems. The key issue considered is how to make efficient use of sparsity in forming and solving the tensor model problem at each iteration. Accomplishing this turns out to require an entirely new way of solving the tensor model that successfully exploits the sparsity of the Jacobian, whether the Jacobian is nonsingular or singular. We develop such an approach and, based upon it, an efficient tensor method for solving large sparse systems of nonlinear equations. Test results indicate that this tensor method is significantly more efficient and robust than an efficient sparse Newton-based method, in terms of iterations, function evaluations, and execution time. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Work supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational and Technology Research, US Department of Energy, under Contract W-31-109-Eng-38, by the National Aerospace Agency under Purchase Order L25935D, and by the National Science Foundation, through the Center for Research on Parallel Computation, under Cooperative Agreement No. CCR-9120008.Research supported by AFOSR Grants No. AFOSR-90-0109 and F49620-94-1-0101, ARO Grants No. DAAL03-91-G-0151 and DAAH04-94-G-0228, and NSF Grant No. CCR-9101795.