Dirac method for nonlinear and non-homogenous boundary value problems of plates

The boundary value problem plays a crucial role in the analytical investigation of continuum dynamics. In this paper, an analytical method based on the Dirac operator to solve the nonlinear and non-homogeneous boundary value problem of rectangular plates is proposed. The key concept behind this method is to transform the nonlinear or non-homogeneous part on the boundary into a lateral force within the governing function by the Dirac operator, which linearizes and homogenizes the original boundary, allowing one to employ the modal superposition method for obtaining solutions to reconstructive governing equations. Once projected into the modal space, the harmonic balance method(HBM) is utilized to solve coupled ordinary differential equations(ODEs)of truncated systems with nonlinearity. To validate the convergence and accuracy of the proposed Dirac method, the results of typical examples, involving nonlinearly restricted boundaries, moment excitation, and displacement excitation, are compared with those of the differential quadrature element method(DQEM). The results demonstrate that when dealing with nonlinear boundaries, the Dirac method exhibits more excellent accuracy and convergence compared with the DQEM. However, when facing displacement excitation, there exist some discrepancies between the proposed approach and simulations;nevertheless, the proposed method still accurately predicts resonant frequencies while being uniquely capable of handling nonuniform displacement excitations. Overall, this methodology offers a convenient way for addressing nonlinear and non-homogenous plate boundaries.

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.

Numerical Exploration of Asymmetrical Impact Dynamics: Unveiling Nonlinearities in Collision Problems and Resilience of Reinforced Concrete Structures

This study provides a comprehensive analysis of collision and impact problems’ numerical solutions, focusing ongeometric, contact, and material nonlinearities, all essential in solving large deformation problems during a collision.The initial discussion revolves around the stress and strain of large deformation during a collision, followedby explanations of the fundamental finite element solution method for addressing such issues. The hourglassmode’s control methods, such as single-point reduced integration and contact-collision algorithms are detailedand implemented within the finite element framework. The paper further investigates the dynamic responseand failure modes of Reinforced Concrete (RC) members under asymmetrical impact using a 3D discrete modelin ABAQUS that treats steel bars and concrete connections as bond slips. The model’s validity was confirmedthrough comparisons with the node-sharing algorithm and system energy relations. Experimental parameterswere varied, including the rigid hammer’s mass and initial velocity, concrete strength, and longitudinal and stirrupreinforcement ratios. Findings indicated that increased hammer mass and velocity escalated RC member damage,while increased reinforcement ratios improved impact resistance. Contrarily, increased concrete strength did notsignificantly reduce lateral displacement when considering strain rate effects. The study also explores materialnonlinearity, examining different materials’ responses to collision-induced forces and stresses, demonstratedthrough an elastic rod impact case study. The paper proposes a damage criterion based on the residual axialload-bearing capacity for assessing damage under the asymmetrical impact, showing a correlation betweendamage degree hammer mass and initial velocity. The results, validated through comparison with theoreticaland analytical solutions, verify the ABAQUS program’s accuracy and reliability in analyzing impact problems,offering valuable insights into collision and impact problems’ nonlinearities and practical strategies for enhancingRC structures’ resilience under dynamic stress.

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.

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.

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.

Existence of solutions of nonlinear two-point boundary value problems for 4nth-order nonlinear differential equation

Studies the existence of solutions of nonlinear two point boundary value problems for nonlinear 4n-th-order differential equationy (4n)=f(t,y,y′,y″,...,y (4n-1))(a)with the boundary conditions g 2i(y (2i)(a),y (2i+1)(a))=0,h 2i(y (2i)(c),y (2i+1)(c))=0,(i=0,1,...,2n-1)(b) where the functions f, g i and h i are continuous with certain monotone properties. For the boundary value problems of nonlinear nth order differential equationy (n)=f(t,y,y′,y″,...,y (n-1))many results have been given at the present time. But the existence of solutions of boundary value problem (a),(b) studied in this paper has not been covered by the above researches. Moreover, the corollary of the important theorem in this paper, i.e. existence of solutions of the boundary value problem.y (4n)=f(t,y,y′,y″,...,y (4n-1)) a 2iy (2i)(a)+a 2i+1y (2i+1)(a)=b 2i,c 2iy (2i)(c)+c 2i+1y (2i+1)(c)=d 2i,(i=0,1,...2n-1)has not been dealt with in previous works.

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.

REGULARIZATION METHODS FOR NONLINEAR ILL-POSED PROBLEMS WITH ACCRETIVE OPERATORS

This article is devoted to the regularization of nonlinear ill-posed problems with accretive operators in Banach spaces. The data involved are assumed to be known approximately. The authors concentrate their discussion on the convergence rates of regular solutions.

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.

SOME BOUNDARY VALUE PROBLEMS FOR NONLINEAR DEGENERATE ELLIPTIC EQUATIONS OF SECOND ORDER

The present article deals with some boundary value problems for nonlinear elliptic equations with degenerate rank 0 including the oblique derivative problem. Firstly the formulation and estimates of solutions of the oblique derivative problem are given, and then by the above estimates and the method of parameter extension, the existence of solutions of the above problem is proved. In this article, the complex analytic method is used, namely the corresponding problem for degenerate elliptic complex equations of first order is firstly discussed, afterwards the above problem for the degenerate elliptic equations of second order is solved.

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.

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.

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.

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.

OBLIQUE DERIVATIVE PROBLEMS FOR SECOND ORDER NONLINEAR MIXED EQUATIONS WITH DEGENERATE LINE

The present article deals with oblique derivative problems for some nonlinear mixed equations with parabolic degeneracy, which include the Tricomi problem as a special case. First, the formulation of the problems for the equations is given; next, the representation and estimates of solutions for the above problems are obtained; finally, the existence of solutions for the problems is proved by the successive iteration and the compactness principle of solutions of the problems. In this article, the author uses the complex method, namely, the complex functions in the elliptic domain and the hyperbolic complex functions in hyperbolic domain are used.

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.

ON THE ASYMPTOTIC SOLUTIONS OF BOUNDARY VALUE PROBLEMS FOR A CLASS OF SYSTEMS OF NONLINEAR DIFFERENTIAL EQUATIONS (Ⅰ)

A new method is applied to study the asymptotic behavior of solutions of boundary value problems for a class of systems of nonlinear differential equations u' = nu, epsilon nu' + f(x, u, u')nu' - g(x, u, u') nu = 0 (0 < epsilon much less than 1). The asymptotic expansions of solutions are constructed, the remainders are estimated. The former works are improved and generalized.

Solving the Optimal Control Problems of Nonlinear Duffing Oscillators By Using an Iterative Shape Functions Method

In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,when the performance index is complicated,because one may encounter a two-point boundary value problem of nonlinear differential algebraic equations.To be a numerical method,it is hard to exactly preserve all the specified conditions,which might deteriorate the accuracy of numerical solution.With this in mind,we develop a novel algorithm to find the solution of the optimal control problem of nonlinear Duffing oscillator,which can exactly satisfy all the required conditions for the minimality of the performance index.A new idea of shape functions method(SFM)is introduced,from which we can transform the optimal control problems to the initial value problems for the new variables,whose initial values are given arbitrarily,and meanwhile the terminal values are determined iteratively.Numerical examples confirm the high-performance of the iterative algorithms based on the SFM,which are convergence fast,and also provide very accurate solutions.The new algorithm is robust,even large noise is imposed on the input data.

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.