A MESHLESS LOCAL PETROV-GALERKIN METHOD FOR GEOMETRICALLY NONLINEAR PROBLEMS

Nonlinear formulations of the meshless local Petrov-Galerkin （MLPG） method are presented for geometrically nonlinear problems. The method requires no mesh in computation and therefore avoids mesh distortion difficulties in the large deformation analysis. The essential boundary conditions in the present formulation axe imposed by a penalty method. An incremental and iterative solution procedure is used to solve geometrically nonlinear problems. Several examples are presented to demonstrate the effectiveness of the method in geometrically nonlinear problems analysis. Numerical results show that the MLPG method is an effective one and that the values of the unknown variable are quite accurate.

Parametric Dirac Delta to Simplify the Solution of Linear and Nonlinear Problems with an Impulsive Forcing Function

The Laplace transform is a very useful tool for the solution of problems involving an impulsive excitation, usually represented by the Dirac delta, but it does not work in nonlinear problems. In contrast with this, the parametric representation of the Dirac delta presented here works both in linear and nonlinear problems. Furthermore, the parametric representation converts the differential equation of a problem with an impulsive excitation into two equations: the first equation referring to the impulse instant (absent in the conventional solution) and the second equation referring to post-impulse time. The impulse instant equation contains fewer terms than the original equation and the impulse is represented by a constant, just as in the Laplace transform, the post-impulse equation is homogeneous. Thus, the solution of the parametric equations is considerably simpler than the solution of the original equation. The parametric solution, involving the equations of both the dependent and independent variables in terms of the parameter, is readily reconverted into the usual equation in terms of the dependent and independent variables only. This parametric representation may be taught at an earlier stage because the principle on which it is based is easily visualized geometrically and because it is only necessary to have a knowledge of elementary calculus to understand it and use it.

Highly Accurate Golden Section Search Algorithms and Fictitious Time Integration Method for Solving Nonlinear Eigenvalue Problems

This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.

Multiple Solutions and Its Morse Index for One-Dimensional Nonlinear Problem

The multiple solutions for one-dimensional cubic nonlinear problem u'+u^3=0,u(0)=u(π)=0are computed,on the basis of the eigenpairs of-φ'_k=λ_(kφk),k=1,2,3....There exist two nonzero solutions±u_k corresponding to each k,and their Morse index MI(k) for 1(?)k(?)20 is to be exactly determined.It isshown by the numerical results that MI(k)(?)k.

SOLUTION WITH SHOCK-BOUNDARY LAYER AND SHOCK-INTERIOR LAYER TO A CLASS OF NONLINEAR PROBLEMS

In this paper,the shock behaviors of solution to a class of nonlinear singularly perturbed problems are considered.Under some appropriate conditions,the outer and interior solutions to the original problem are constructed.Using the special limit and matching theory,the expressions of solutions with the shock behavior near the boundary and some interior points are given and the domain for boundary values is obtained.

A New Strategy for Solving a Class of Constrained Nonlinear Optimization Problems Related to Weather and Climate Predictability

There are three common types of predictability problems in weather and climate, which each involve different constrained nonlinear optimization problems： the lower bound of maximum predictable time, the upper bound of maximum prediction error, and the lower bound of maximum allowable initial error and parameter error. Highly effcient algorithms have been developed to solve the second optimization problem. And this optimization problem can be used in realistic models for weather and climate to study the upper bound of the maximum prediction error. Although a filtering strategy has been adopted to solve the other two problems, direct solutions are very time-consuming even for a very simple model, which therefore limits the applicability of these two predictability problems in realistic models. In this paper, a new strategy is designed to solve these problems, involving the use of the existing highly effcient algorithms for the second predictability problem in particular. Furthermore, a series of comparisons between the older filtering strategy and the new method are performed. It is demonstrated that the new strategy not only outputs the same results as the old one, but is also more computationally effcient. This would suggest that it is possible to study the predictability problems associated with these two nonlinear optimization problems in realistic forecast models of weather or climate.

Improved genetic algorithm for nonlinear programming problems

An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.

EXISTENCE AND UNIQUENESS FOR THIRD ORDER NONLINEAR BOUNDARY VALUE PROBLEMS

In this paper, the existence and uniqueness of solutions for boundary valueproblem x′′′=f(t, x, x′, x″), x(0)=A, x′(0)=B, g(x′(1), x″(1))=0 are studied byusing Volterra type operator and upper and lower solutions. Our results improve someknown works.

Mode decomposition of nonlinear eigenvalue problems and application in flow stability

Direct numerical simulations are carried out with different disturbance forms introduced into the inlet of a flat plate boundary layer with the Mach number 4.5. According to the biorthogonal eigenfunction system of the linearized Navier-Stokes equations and the adjoint equations, the decomposition of the direct numerical simulation results into the discrete normal mode is easily realized. The decomposition coefficients can be solved by doing the inner product between the numerical results and the eigenfunctions of the adjoint equations. For the quadratic polynomial eigenvalue problem, the inner product operator is given in a simple form, and it is extended to an Nth-degree polynomial eigenvalue problem. The examples illustrate that the simplified mode decomposition is available to analyze direct numerical simulation results.

Projection and Contraction Methods for Nonlinear Complementarity Problem

We applied the projection and contraction method to nonlinear complementarity problem (NCP). Moveover, we proposed an inexact implicit method for (NCP) and proved the convergence.

Search-extension method for finding multiple solutions of nonlinear problem

Based on the eigensystem {λj, φj} of -△, the multiple solutions for nonlinear problem △u + f(u)= 0 in Ω,u = 0 on Ω are approximated. A new search-extension method (SEM) is proposed, which consists of three algorithms in three level subspaces.Numerical experiments for f(u)= u3 in a square and L-shape domain are presented. The results show that there exist at least 3κ - 1 distinct nonzero solutions corresponding to each κ-ple eigenvalue of -△ (Conjecture 1).

A New Homotopy Method for Nonlinear Complementarity Problems

In this paper, we present a new homotopy method for the nonlinear complementarity problems. Without the regularity or non-singulary assumptions for▽F(x), we prove that our homotopy equations have a bounded solution curve. The numerical tests confirm the efficiency of our proposed method.

CLASSIFICATION OF BIFURCATIONS FOR NONLINEAR DYNAMICAL PROBLEMS WITH CONSTRAINTS

Bifurcation of periodic solutions widely existed in nonlinear dynamical systems is a kind oftonstrained one in intrinsic quality because its amplitude is always non-negative Classification of the bifurcations with the type of constraint was discussed. All its six types of transition sets are derived, in which three types are newly found and a method is proposed for analyzing the constrained bifurcation.

A mixed Newton-Tikhonov method for nonlinear ill-posed problems

Newton type methods are one kind of the efficient methods to solve nonlinear ill-posed problems, which have attracted extensive attention. However, computational cost of Newton type methods is high because practical problems are complicated. We propose a mixed Newton-Tikhonov method, i.e., one step Newton-Tikhonov method with several other steps of simplified Newton-Tikhonov method. Convergence and stability of this method are proved under some conditions. Numerical experiments show that the proposed method has obvious advantages over the classical Newton method in terms of computational costs.

THE MIXED PROBLEM FOR A CLASS OF NONLINEAR SYMMETRIC HYPERBOLIC SYSTEMS WITH DISCONTINUOUS DATA

This paper studies the nonlinear mixed problem for a class of symmetric hyperbolic systems with the boundary condition satisfying the dissipative condition about discontinuous data in higher dimension spaces, establishes the local existence theorem by using the method of a prior estimates, and obtains the structure of singularities of the solutions of such problems.

An efficient algorithm for multi-dimensional nonlinear knapsack problems

Multi-dimensional nonlinear knapsack problem is a bounded nonlinear integer programming problem that maximizes a separable nondecreasing function subject to multiple separable nondecreasing constraints. This problem is often encountered in resource allocation, industrial planning and computer network. In this paper, a new convergent Lagrangian dual method was proposed for solving this problem. Cutting plane method was used to solve the dual problem and to compute the Lagrangian bounds of the primal problem. In order to eliminate the duality gap and thus to guarantee the convergence of the algorithm, domain cut technique was employed to remove certain integer boxes and partition the revised domain to a union of integer boxes. Extensive computational results show that the proposed method is efficient for solving large-scale multi-dimensional nonlinear knapsack problems. Our numerical results also indicate that the cutting plane method significantly outperforms the subgradient method as a dual search procedure.

Nonlinear Riemann Problem for Nonlinear Elliptic Systems in Sobolev Space W_(1,p)(D)

The nonlinear Riemann problems were converted into nonlinear singular integral equ ations and the existence of the solution for the problem was proved by means of contract principle.

A Class of Singularly Perturbed Nonlinear Shock Problems

用匹配的 asymptotic 扩大的方法，不可思议地使不安的非线性的问题的一个班的吃惊解决方案是吃惊答案和他们的边界条件的 discussed.The 关系是 obtained.And 已知的结果被概括。

Generalized Strongly Nonlinear Quasi-Complementarity Problems

Using the algorithm in this paper, we prove the existence of solutions to the gene-ralized strongly nonlinear quasi-complementarity problems and the convergence of theiterative sequences generated by the algorithm. Our results improve and extend thecorresponding results of Noor and Chang-Huang. Moreover, a more general iterativealgorithm for finding the approximate solution of generalized strongly nonlinear quasi-complementarity problems is also given. It is shown that the approximate solution ob-tained by the iterative scheme converges to the exact solution of this quasi-com-plementarity problem.

MULTIPLICITY RESULTS FOR AN INHOMOGENEOUS NONLINEAR ELLIPTIC PROBLEM

The author proves that there exist three solutions u(0), u(1) and u(2) in the following problem [GRAPHICS] where some conditions are imposed on Q and f. Here, 0 < u(0) < u(1), u(2) changes sign.