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.

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.

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.

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.

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.

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.

SYMMETRIES， BāCKLUND TRANSFORMATIONS AND BOUNDARY－INITIAL VALUE PROBLEMS FOR NONLINEAR CHROMATOGRAPH

In the present paper, an equation of nonlinear chromatography is derived from the physical chemistry A recursion formula of the symmetries of the equation as well as an infinite number of symmetries is found. A series of Backlund transformations of the equation are constructed by means of the symmetries. The exact solutions of two boundary-initial value problems on the half straight line for the equation are given m terms of the solutions of the corresponding linear problems.

A simultaneous space-time wavelet method for nonlinear initial boundary value problems

A high-precision and space-time fully decoupled numerical method is developed for a class of nonlinear initial boundary value problems. It is established based on a proposed Coiflet-based approximation scheme with an adjustable high order for the functions over a bounded interval, which allows the expansion coefficients to be explicitly expressed by the function values at a series of single points. When the solution method is used, the nonlinear initial boundary value problems are first spatially discretized into a series of nonlinear initial value problems by combining the proposed wavelet approximation and the conventional Galerkin method, and a novel high-order step-by-step time integrating approach is then developed for the resulting nonlinear initial value problems with the same function approximation scheme based on the wavelet theory. The solution method is shown to have the N th-order accuracy, as long as the Coiflet with [0, 3 N-1]compact support is adopted, where N can be any positive even number. Typical examples in mechanics are considered to justify the accuracy and efficiency of the method.

PERIODIC BOUNDARY VALUE PROBLEMS FOR NONLINEAR IMPULSIVEINTEGRODIFFERENTIAL EQUATIONS OF MIXED TYPE IN BANACH SPACES

In this paper, the author obtains an existence theorem of minimal and maximal solutions for the periodic boundary value problems of nonlinear impulsive integrodifferential equations of mixed type in Banach space by means of the monotone iterative technique and cone theory based on a comparison result.

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.

ON THE EXISTENCE AND NODAL CHARACTER OF SOLUTIONS OF SINGULAR NONLINEAR BOUNDARY VALUE PROBLEMS

In this paper we prove the existence of k-node solution of singular nonlinear boundary value problems for each k is-an-element-of N union {0}.

ON THE EXISTENCE AND NODAL CHARACTER OF THE SOLUTIONS OF SINGULAR NONLINEAR BOUNDARY VALUE PROBLEMS

1. Introduction We consider the singular nonlinear boundary value problem where l=v+3/v-1,l+1 is the critical exponent of the embedding of weighted Sobolev space Wt21,2（O, +∞） into Lt2q（O, ∞）, v>2. When v=N-1 we can get the radial solutions of problem where 2*=2N/N-2 is the critical exponent of the Sobolev embedding H1（Rn）→LQ（RN）. Kurtz has discussed the existence of κ-node solution of （1.1）, （1.2） for each κ∈N U{0} when the growth rate of |u|l-1u+f（u） is lower then |u|v+3/v-1 i.e.

SOLVING 2-D NONLINEAR COUPLED HEAT AND MOISTURE TRANSFER PROBLEMS VIA A SELF-ADAPTIVE PRECISE ALGORITHM IN TIME DOMAIN

A self-adaptive precise algorithm in the time domain was employed to solve 2-D nonlinear coupled heat and moisture transfer problems. By expanding variables at a discretized time interval, the variations of variables can be described more precisely,and a nonlinear coupled initial and boundary value problem was converted into a series of recurrent linear boundary value problems which are solved by FE technique. In the computation, no additional assumption and the nonlinear iteration are required, and a criterion for self-adaptive computation is proposed to maintain sufficient computing accuracy for the change sizes of time steps. In the numerical comparison, the variations of material properties with temperature, moisture content, and both temperature and moisture content are taken into account, respectively. Satisfactory results have been obtained, indicating that the proposed approach is capable of dealing with complex nonlinear problems.

Nonlinear implicit iterative method for solving nonlinear ill-posed problems

In the paper, we extend the implicit iterative method for linear ill-posed operator equations to solve nonlinear ill-posed problems. We show that under some conditions the error sequence of solutions of the nonlinear implicit iterative method is monotonically decreasing and, with this monotonicity, prove convergence of the new method for both the exact and perturbed equations.

Surrogate dual method for multi-dimensional nonlinear knapsack problems

Multi-dimensional nonlinear knapsack problems are often encountered in resource allocation, industrial planning and computer networks. In this paper, a surrogate dual method was proposed for solving this class of problems. Multiply constrained problem was relaxed to a singly constrained problem by using the surrogate technique. To compute tighter bounds of the primal problem, the cutting plane method was used to solve the surrogate dual problem, where the surrogate relaxation problem was solved by the 0-1 linearization method. The domain cut technique was employed to eliminate the duality gap and thus to guarantee the convergence of tile algorithm. Numerical results were reported for large-scale multi-dimensional nonlinear knapsack problems.

A POSITIVE INTERIOR-POINT ALGORITHM FOR NONLINEAR COMPLEMENTARITY PROBLEMS

A new iterative method,which is called positive interior-point algorithm,is presented for solving the nonlinear complementarity problems.This method is of the desirable feature of robustness.And the convergence theorems of the algorithm is established.In addition,some numerical results are reported.