A Coupling Magneto-Electro-Elastic(MEE)Node-based Smoothed Radial Point Interpolation Method(CM-NS-RPIM)was proposed to solve the free vibration and transient responses of Functionally Graded Magneto-Electro-Elastic(F...A Coupling Magneto-Electro-Elastic(MEE)Node-based Smoothed Radial Point Interpolation Method(CM-NS-RPIM)was proposed to solve the free vibration and transient responses of Functionally Graded Magneto-Electro-Elastic(FGMEE)structures.By introducing the modified Newmark method,the displacement,electrical potential and magnetic potential of the structures under transient mechanical loading were obtained.Based on G space theory and the weakened weak(W2)formulation,the equations of the multi-physics coupling problems were derived.Using triangular background elements,the free vibration and transient responses of three numerical examples were studied.Results proved that CM-NS-RPIM performed better than the standard FEM by reducing the overly-stiff of structures.Moreover,CM-NS-RPIM could reduce the number of nodes while guaranteeing the accuracy.Besides,triangular elements could be generated automatically even for complex geometries.Therefore,the effectiveness and validity of CM-NS-RPIM were demonstrated,which were valuable for the design of intelligence devices,such as energy harvesters and sensors.展开更多
We express the set of exposed points in terms of rotund points and non-smooth points.As long as we have Banach spaces each time＂bigger＂,we consider sets of non-smooth points each time＂smaller＂.
The criterion for k-smooth points of the Orlicz sequence space endowed with the Orlicz norm is proved. The necessary and sufficient conditions of k-smoothness of l M and l （M ） are obtained, respectively. Finally, w...The criterion for k-smooth points of the Orlicz sequence space endowed with the Orlicz norm is proved. The necessary and sufficient conditions of k-smoothness of l M and l （M ） are obtained, respectively. Finally, we give the counterexamples which show that previous results are not true.展开更多
The purpose of this paper is to study and analyze an iterative method for finding a common element of the solution set ~ of the split feasibility problem and the set F（T） of fixed points of a right Bregman strongly ...The purpose of this paper is to study and analyze an iterative method for finding a common element of the solution set ~ of the split feasibility problem and the set F（T） of fixed points of a right Bregman strongly nonexpansive mapping T in the setting of p- uniformly convex Banach spaces which are also uniformly smooth. By combining Mann＇s iterative method and the Halpern＇s approximation method, we propose an iterative algorithm for finding an element of the set F（T）∩Ω moreover, we derive the strong convergence of the proposed algorithm under appropriate conditions and give numerical results to verify the efficiency and implementation of our method. Our results extend and complement many known related results in the literature.展开更多
A kind of mathematical programs with equilibrium constraints （MPEC） is studied. By using the idea of successive approximation, a smoothing nonlinear programming, which is equivalent to the MPEC problem, is proposed....A kind of mathematical programs with equilibrium constraints （MPEC） is studied. By using the idea of successive approximation, a smoothing nonlinear programming, which is equivalent to the MPEC problem, is proposed. Thereby, it is ensured that some classical optimization methods can be applied for the MPEC problem. In the end, two algorithm models are proposed with the detail analysis of the global convergence.展开更多
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 theore...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.展开更多
The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is re...The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is reformulated as a system of non-smooth equations, and then a smoothing function for the system of non-smooth equations is proposed. The condition of convergences of this iteration algorithm is given. Theory analysis and primary numerical results illustrate that this method is feasible and effective.展开更多
基金co-supported by the National Key R&D Program of China(Nos.2018YFF01012401-05)the National Natural Science Foundation of China(No.51975243)+2 种基金Jilin Provincial Department of Education(No.JJKH20180084KJ),Chinathe Fundamental Research Funds for the Central Universities and Jilin Provincial Department of Science&Technology Fund Project,China(Nos.20170101043JC and 20180520072JH)Graduate Innovation Fund of Jilin University,China(No.101832018C184).
文摘A Coupling Magneto-Electro-Elastic(MEE)Node-based Smoothed Radial Point Interpolation Method(CM-NS-RPIM)was proposed to solve the free vibration and transient responses of Functionally Graded Magneto-Electro-Elastic(FGMEE)structures.By introducing the modified Newmark method,the displacement,electrical potential and magnetic potential of the structures under transient mechanical loading were obtained.Based on G space theory and the weakened weak(W2)formulation,the equations of the multi-physics coupling problems were derived.Using triangular background elements,the free vibration and transient responses of three numerical examples were studied.Results proved that CM-NS-RPIM performed better than the standard FEM by reducing the overly-stiff of structures.Moreover,CM-NS-RPIM could reduce the number of nodes while guaranteeing the accuracy.Besides,triangular elements could be generated automatically even for complex geometries.Therefore,the effectiveness and validity of CM-NS-RPIM were demonstrated,which were valuable for the design of intelligence devices,such as energy harvesters and sensors.
文摘We express the set of exposed points in terms of rotund points and non-smooth points.As long as we have Banach spaces each time＂bigger＂,we consider sets of non-smooth points each time＂smaller＂.
基金Project supported by the National Natural Science Foundation of China (Grant No.10971129)
文摘The criterion for k-smooth points of the Orlicz sequence space endowed with the Orlicz norm is proved. The necessary and sufficient conditions of k-smoothness of l M and l （M ） are obtained, respectively. Finally, we give the counterexamples which show that previous results are not true.
文摘The purpose of this paper is to study and analyze an iterative method for finding a common element of the solution set ~ of the split feasibility problem and the set F（T） of fixed points of a right Bregman strongly nonexpansive mapping T in the setting of p- uniformly convex Banach spaces which are also uniformly smooth. By combining Mann＇s iterative method and the Halpern＇s approximation method, we propose an iterative algorithm for finding an element of the set F（T）∩Ω moreover, we derive the strong convergence of the proposed algorithm under appropriate conditions and give numerical results to verify the efficiency and implementation of our method. Our results extend and complement many known related results in the literature.
基金project supported by the National Natural Science Foundation of China(Nos.10501009 and 60471039)the Natural Science Foundation of Guangxi Province(No.0728206)
文摘A kind of mathematical programs with equilibrium constraints （MPEC） is studied. By using the idea of successive approximation, a smoothing nonlinear programming, which is equivalent to the MPEC problem, is proposed. Thereby, it is ensured that some classical optimization methods can be applied for the MPEC problem. In the end, two algorithm models are proposed with the detail analysis of the global convergence.
文摘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.
文摘The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is reformulated as a system of non-smooth equations, and then a smoothing function for the system of non-smooth equations is proposed. The condition of convergences of this iteration algorithm is given. Theory analysis and primary numerical results illustrate that this method is feasible and effective.
