Efficient hybrid method for solving special type of nonlinear partial differential equations

In this article, an efficient hybrid method has been developed for solving some special type of nonlinear partial differential equations. Hybrid method is based on tanh–coth method, quasilinearization technique and Haar wavelet method. Nonlinear partial differential equations have been converted into a nonlinear ordinary differential equation by choosing some suitable variable transformations. Quasilinearization technique is used to linearize the nonlinear ordinary differential equation and then the Haar wavelet method is applied to linearized ordinary differential equation. A tanh–coth method has been used to obtain the exact solutions of nonlinear ordinary differential equations. It is easier to handle nonlinear ordinary differential equations in comparison to nonlinear partial differential equations. A distinct feature of the proposed method is their simple applicability in a variety of two‐ and three‐dimensional nonlinear partial differential equations. Numerical examples show better accuracy of the proposed method as compared with the methods described in past. Error analysis and stability of the proposed method have been discussed.     

He’s homotopy perturbation method for systems of integro-differential equations

In this article, the homotopy perturbation method [He JH. Homotopy perturbation technique. Comput Meth Appl Mech Eng 1999;178:257–62; He JH. A coupling method of homotopy technique and perturbation technique for nonlinear problems. Int J Non-Linear Mech 2000;35(1):37–43; He JH. Comparison of homotopy perturbation method and homotopy analysis method. Appl Math Comput 2004;156:527–39; He JH. Homotopy perturbation method: a new nonlinear analytical technique. Appl Math Comput 2003;135:73–79; He JH. The homotopy perturbation method for nonlinear oscillators with discontinuities. Appl Math Comput 2004;151:287–92; He JH. Application of homotopy perturbation method to nonlinear wave equations Chaos, Solitons & Fractals 2005;26:695–700] is applied to solve linear and nonlinear systems of integro-differential equations. Some nonlinear examples are presented to illustrate the ability of the method for such system. Examples for linear system are so easy that has been ignored.     

ADM-Padé technique for the nonlinear lattice equations

ADM-Padé technique is a combination of Adomian decomposition method (ADM) and Padé approximants. We solve two nonlinear lattice equations using the technique which gives the approximate solution with higher accuracy and faster convergence rate than using ADM alone. Bell-shaped solitary solution of Belov–Chaltikian (BC) lattice and kink-shaped solitary solution of the nonlinear self-dual network equations (SDNEs) are presented. Comparisons are made between approximate solutions and exact solutions to illustrate the validity and the great potential of the technique.     

Existence of periodic solutions of second order nonlinear p-Laplacian difference equations

By using the critical point theory, the existence of periodic solutions to second order nonlinear p-Laplacian difference equations is obtained. The main approach used is a variational technique and the saddle point theorem. The problem is to solve the existence of periodic solutions of second order nonlinear p-Laplacian difference equations.     

On the accurate identification of active set for constrained minimax problems

In this paper, the problem of identifying the active constraints for constrained nonlinear programming and minimax problems at an isolated local solution is discussed. The correct identification of active constraints can improve the local convergence behavior of algorithms and considerably simplify algorithms for inequality constrained problems, so it is a useful adjunct to nonlinear optimization algorithms. Facchinei et al. [F. Facchinei, A. Fischer, C. Kanzow, On the accurate identification of active constraints, SIAM J. Optim. 9 (1998) 14-32] introduced an effective technique which can identify the active set in a neighborhood of a solution for nonlinear programming. In this paper, we first improve this conclusion to be more suitable for infeasible algorithms such as the strongly sub-feasible direction method and the penalty function method. Then, we present the identification technique of active constraints for constrained minimax problems without strict complementarity and linear independence. Some numerical results illustrating the identification technique are reported.     

What's the common ground of all numerical and analytical techniques for nonlinear problems?

In this paper the author attempts to find out in very general meanings the common ground of all numerical and analytical techniques for nonlinear problems. By means of analyzing the finiteness or infiniteness of the fundamental operations necessary for mathematically solving a problem, the author points out that the key of any nonlinear technique is the way to transform a nonlinear problem to an infinite series of sub-problems which can be solved by finite number of fundamental operations.     

A robust neurocontroller incorporating a priori knowledge of plant dynamics

This paper presents a nonlinear controller design method that integrates linear optimal control techniques and nonlinear neural networks. The multilayered neural networks (MNN's) are incorporated into a model-based linear optimal controller (LOR) to add nonlinear effects on the LOR. The proposed controller can tolerate a wider range of uncertainties than the LOR alone, because the MNN can compensate nonlinear system uncertainties that are not considered in the LOR design. The control performance is improved by using a priori knowledge of the plant dynamics as the system equation and the corresponding LOR. Using the similar technique, a nonlinear servo controller is designed by combining the MNN-based controller and the linear optimal servo controller. Computer simulations are performed to show the applicability and the limitation of the new nonlinear controllers.     

Statistical Inference in Single-Index and Partially Nonlinear Models

A finite series approximation technique is introduced. We first applythis approximation technique to a semiparametric single-index model toconstruct a nonlinear least squares (LS) estimator for an unknown parameterand then discuss the confidence region for this parameter based on theasymptotic distribution of the nonlinear LS estimator. Meanwhile, acomputational algorithm and a small sample study for this nonlinear LSestimator are developed. Additionally, we apply the finite seriesapproximation technique to a partially nonlinear model and obtain some newresults.     

A regularization of the Frank—Wolfe method and unification of certain nonlinear programming methods

The Frank—Wolfe linearization technique is a popular feasible direction algorithm for the solution of certain linearly constrained nonlinear problems. The popularity of this technique is due in part to its ability to exploit special constraint structures, such as network structures, and in part to the fact that it decomposes nonseparable problems over Cartesian product sets. However, the linearization which induces these advantages is also the source of the main disadvantages of the method: a sublinear rate of convergence and zigzagging behaviour. In order to avoid these disadvantages, a regularization penalty term is added to the objective of the direction generating subproblem. This results in a generic feasible direction method which also includes certain known nonlinear programming methods.     

Complexity and algorithms for convex network optimization and other nonlinear problems

Nonlinear optimization algorithms are rarely discussed from a complexity point of view. Even the concept of solving nonlinear problems on digital computers is not well defined. The focus here is on a complexity approach for designing and analyzing algorithms for nonlinear optimization problems providing optimal solutions with prespecified accuracy in the solution space. We delineate the complexity status of convex problems over network constraints, dual of flow constraints, dual of multi-commodity, constraints defined by a submodular rank function (a generalized allocation problem), tree networks, diagonal dominant matrices, and nonlinear Knapsack problem's constraint. All these problems, except for the latter in integers, have polynomial time algorithms which may be viewed within a unifying framework of a proximity-scaling technique or a threshold technique. The complexity of many of these algorithms is furthermore best possible in that it matches lower bounds on the complexity of the respective problems. In general nonseparable optimization problems are shown to be considerably more difficult than separable problems. We compare the complexity of continuous versus discrete nonlinear problems and list some major open problems in the area of nonlinear optimization. MSC classification: 90C30, 68Q25     

Existence of solutions of certain nonconvex optimal control problems governed by nonlinear integral equations

Optimal control problems with nonlinear equations usually do not have a solution, i.e. an optimal control. Nevertheless, if the cost functional is uniformly concave with respect to the state, the solution may exist. Using the Balder's technique based on a Youngmeasure relaxation, Bauer's external principle and investigation of extreme Young measures; the existence is demonstrated here for optimal control processes described by nonlinear integral equations     

Approximate general and explicit solutions of nonlinear BBMB equations by Exp-Function method

In this work, we implement a relatively new analytical technique, the Exp-Function method, for solving special form of generalized nonlinear Benjamin–Bona–Mahony–Burgers equation (BBMB) which may contain high nonlinear terms.     

A general criterion to determine the number of change-points

A general criterion is proposed to determine the number K of the change-points in a parametric nonlinear multi-response model. Schwarz criterion is a particular case. The change-points depend on regressor values and not on instant of measure. We prove that the proposed estimator for K is consistent. Simulation results, using Monte Carlo technique, for nonlinear models which have numerous applications, support the relevance of the theory.     

Lebesgue piecewise affine approximation of nonlinear systems

This paper addresses a piecewise affine (PWA) approximation problem, i.e., a problem of finding a PWA system model which approximates a given nonlinear system. First, we propose a new class of PWA systems, called the Lebesgue PWA approximation systems, as a model to approximate nonlinear systems. Next, we derive an error bound of the PWA approximation model, and provide a technique for constructing the approximation model with specified accuracy. Finally, the proposed method is applied to a gene regulatory network with nonlinear dynamics, which shows that the method is a useful approximation tool.     

Amplitude modulation of nonlinear waves in a thick elastic tube filled with an inviscid fluid

In the present work, employing the nonlinear equations of an incompressible, isotropic and elastic thick tube and the approximate equations of an incompressible inviscid fluid, and then utilizing the reductive perturbation technique the amplitude modulation of weakly nonlinear waves is examined. It is shown that the amplitude modulation of these waves is governed by a nonlinear Schrödinger(NLS) equation. The range of modulational instability of the monochromatic wave solution with the initial deformation, material and geometrical characteristics is discussed for some elastic materials.     

Approximations of the nonlinear Volterra's population model by an efficient numerical method

In this paper, we apply the new homotopy perturbation method to solve the Volterra's model for population growth of a species in a closed system. This technique is extended to give solution for nonlinear integro‐differential equation in which the integral term represents the total metabolism accumulated fromtime zero. The approximate analytical procedure only depends on two components. The newhomotopy perturbationmethodwas applied to nonlinear integro‐differential equations directly and by converting the problem into nonlinear ordinary differential equation. We also compare this method with some other numerical results and show that the present approach is less computational and is applicable for solving nonlinear integro‐differential equations and ordinary differential equations as well. Copyright © 2011 John Wiley & Sons, Ltd.     

Asymptotics of eigenvalues of the nonlinear eigenvalue problem arising from the near mixed-mode crack-tip stress-strain field problems

In the present paper, approximate analytical and numerical solutions to nonlinear eigenvalue problems arising in nonlinear fracture mechanics in studying stress-strain fields near a crack tip under mixed-mode loading are presented. Asymptotic solutions are obtained by the perturbation method (the artificial small parameter method). The artificial small parameter is the difference between the eigenvalue corresponding to the nonlinear eigenvalue problem and the eigenvalue related to the linear “undisturbed” problem. It is shown that the perturbation technique is an effective method of solving nonlinear eigenvalue problems in nonlinear fracture mechanics. A comparison of numerical and asymptotic results for different values of the mixity parameter and hardening exponent shows good agreement. Thus, the perturbation theory technique for studying nonlinear eigenvalue problems is offered and applied to eigenvalue problems arising in fracture mechanics analysis in the case of mixed-mode loading.     

Existence and regularity of solution of mixed boundary value problem of a Busemann-equation with nonlinear absorb term

The Busemann-equation is a classical equation coming from fluid dynamics. The well-posed problem and regularity of solution of Busemann-equation with nonlinear term are interesting and important. The Busemann-equation is elliptic in y>0 and is degenerate at the line y=0 in R². With a special nonlinear absorb term, we study a nonlinear degenerate elliptic equation with mixed boundary conditions in a piecewise smooth domain. By means of elliptic regularization technique, a delicate prior estimate and compact argument, we show that the solution of mixed boundary value problem of Busemann-equation is smooth in the interior and Lipschitz continuous up to the degenerate boundary on some conditions. The result is better than the result of classical boundary degenerate elliptic equation.     

Exact solutions for a class of nonlinear evolution equations: A unified ansätze approach

In this paper, we propose a modified generalized transformation for constructing analytic solutions to nonlinear differential equations. This improved unified ansätze is utilized to acquire exact solutions that are general solutions of simpler equations that are either integrable or possess special solutions. The ansätze is constructed via the choice of an integrable differential operator or a basis set of functions. The technique is implemented to obtain several families of exact solutions for a class of nonlinear evolution equations with nonlinear term of any order. In particular, the Klein–Gordon, the Sine–Gordon and Landau–Ginburg–Higgs equations are chosen as examples to illustrate the method.     

ELASTIC MEMBRANE EQUATION WITH MEMORY TERM AND NONLINEAR BOUNDARY DAMPING:GLOBAL EXISTENCE,DECAY AND BLOWUP OF THE SOLUTION

In this paper we consider the Elastic membrane equation with memory term and nonlinear boundary damping.Under some appropriate assumptions on the relaxation function h and with certain initial data,the global existence of solutions and a general decay for the energy are established using the multiplier technique.Also,we show that a nonlinear source of polynomial type is able to force solutions to blow up in finite time even in presence of a nonlinear damping.