A modified inner-element edge-based smoothed finite element method(IES-FEM)is developed and integrated with ABAQUS using a user-defined element(UEL)in this study.Initially,the smoothing domain discretization of IES-FE...A modified inner-element edge-based smoothed finite element method(IES-FEM)is developed and integrated with ABAQUS using a user-defined element(UEL)in this study.Initially,the smoothing domain discretization of IES-FEM is described and compared with ES-FEM.A practical modification of IES-FEM is then introduced that used the technique employed by ES-FEM for the nodal strain calculation.The differences in the strain computation among ES-FEM,IES-FEM,and FEM are then discussed.The modified IES-FEM exhibited superior performance in displacement and a slight advantage in stress compared to FEM using the same mesh according to the results obtained from both the regular and irregular elements.The robustness of the IES-FEM to severely deformed meshes was also verified.展开更多
In this paper, we analyze the global and local convergence properties of two predictor-corrector smoothing methods, which are based on the framework of the method in [1], for monotone linear complementarity problems (...In this paper, we analyze the global and local convergence properties of two predictor-corrector smoothing methods, which are based on the framework of the method in [1], for monotone linear complementarity problems (LCPs). The difference between the algorithm in [1] and our algorithms is that the neighborhood of smoothing central path in our paper is different to that in [1]. In addition, the difference between Algorithm 2.1 and the algorithm in [1] exists in the calculation of the predictor step. Comparing with the results in [1], the global and local convergence of the two methods can be obtained under very mild conditions. The global convergence of the two methods do not need the boundness of the inverse of the Jacobian. The superlinear convergence of Algorithm 2.1′ is obtained under the assumption of nonsingularity of generalized Jacobian of φ(x, y) at the limit point and Algorithm 2.1 obtains superlinear convergence under the assumption of strict complementarity at the solution. The effciency of the two methods is tested by numerical experiments.展开更多
In this paper,a bilevel multiobjective programming problem,where the lower level is a convex parameter multiobjective program,is concerned.Using the KKT optimality conditions of the lower level problem,this kind of pr...In this paper,a bilevel multiobjective programming problem,where the lower level is a convex parameter multiobjective program,is concerned.Using the KKT optimality conditions of the lower level problem,this kind of problem is transformed into an equivalent one-level nonsmooth multiobjective optimization problem.Then,a sequence of smooth multiobjective problems that progressively approximate the nonsmooth multiobjective problem is introduced.It is shown that the Pareto optimal solutions(stationary points)of the approximate problems converge to a Pareto optimal solution(stationary point)of the original bilevel multiobjective programming problem.Numerical results showing the viability of the smoothing approach are reported.展开更多
The extraction of spectral parameters is very difficult because of the limited energy resolution for NaI （TI） gamma-ray detectors. For statistical fluctuation of radioactivity under complex environment, some smoothi...The extraction of spectral parameters is very difficult because of the limited energy resolution for NaI （TI） gamma-ray detectors. For statistical fluctuation of radioactivity under complex environment, some smoothing filtering methods are proposed to solve the problem. These methods include adopting method of arithmetic moving average, center of gravity, least squares of polynomial, slide converter of discrete funcion convolution etc. The process of spectrum data is realized, and the results are assessed in H/FWHM（ Peak High/Full Width at Half Maximum） and peak area based on the Matlab programming. The results indicate that different methods smoothed spectrum have respective superiority in different ergoregion, but the Gaussian function theory in discrete function convolution slide method is used to filter the complex y-spectrum on Embedded system nlatform, and the statistical fluctuation of y-snectrum filtered wall.展开更多
The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational in...The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational inequality problem based on a new smoothing approximation function.The proposed algorithm is proved to be well defined and convergent globally under weaker conditions.展开更多
Utilizing the well-known aggregation technique, we propose a smoothing sample average approximation （SAA） method for a stochastic linear complementarity problem, where the underlying functions are represented by exp...Utilizing the well-known aggregation technique, we propose a smoothing sample average approximation （SAA） method for a stochastic linear complementarity problem, where the underlying functions are represented by expectations of stochastic functions. The method is proved to be convergent and the preliminary numerical results are reported.展开更多
Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the giv...Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the given algorithm performed global and superlinear convergence without strict complementarity.For the same linear complementarity problem(LCP),the algorithm needs similar iteration times to the literature.However,its accuracy is improved by at least 4 orders with calculation time reduced by almost 50%,and the iterative number is insensitive to the size of the LCP.Moreover,fewer iterations and shorter time are required for solving the problem by using inexact Newton methods for different initial points.展开更多
A one_step smoothing Newton method is proposed for solving the vertical linear complementarity problem based on the so_called aggregation function. The proposed algorithm has the following good features: (ⅰ) It solve...A one_step smoothing Newton method is proposed for solving the vertical linear complementarity problem based on the so_called aggregation function. The proposed algorithm has the following good features: (ⅰ) It solves only one linear system of equations and does only one line search at each iteration; (ⅱ) It is well_defined for the vertical linear complementarity problem with vertical block P 0 matrix and any accumulation point of iteration sequence is its solution.Moreover, the iteration sequence is bounded for the vertical linear complementarity problem with vertical block P 0+R 0 matrix; (ⅲ) It has both global linear and local quadratic convergence without strict complementarity. Many existing smoothing Newton methods do not have the property (ⅲ).展开更多
The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by ...The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is designed for solving the ELCP. The proposed algorithm is proved to be globally convergent under suitable assumptions.展开更多
In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent im...In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent implicit fixed-point equation, then introduces a smoothing function to obtain its approximation solutions. The convergence analysis of the algorithm was given, and the efficiency of the algorithms was verified by numerical experiments.展开更多
In this paper,we consider the symmetric cone linear complementarity problem with the Cartesian P0-property and present a regularization smoothing method with a nonmonotone line search to solve this problem.It has been...In this paper,we consider the symmetric cone linear complementarity problem with the Cartesian P0-property and present a regularization smoothing method with a nonmonotone line search to solve this problem.It has been demonstrated that the proposed method exhibits global convergence under the condition that the solution set of the complementarity problem is nonempty.This condition is less stringent than those that have appeared in some existing literature.We also show that the method has locally quadratic convergence under appropriate conditions.Some experimental results are reported to illustrate the efficiency of the proposed method.展开更多
By means of Lagrange duality of Hill＇s maximum plastic work principle theory of the convex program, a dual problem under Mises＇ yield condition has been derived and whereby a non-differentiable convex optimization m...By means of Lagrange duality of Hill＇s maximum plastic work principle theory of the convex program, a dual problem under Mises＇ yield condition has been derived and whereby a non-differentiable convex optimization model for the limit analysis is developed. With this model, it is not necessary to linearize the yield condition and its discrete form becomes a minimization problem of the sum of Euclidean norms subject to linear constraints. Aimed at resolving the non-differentiability of Euclidean norms, a smoothing algorithm for the limit analysis of perfect-plastic continuum media is proposed. Its efficiency is demonstrated by computing the limit load factor and the collapse state for some plane stress and plain strain problems.展开更多
Let {Tn } be a renewal process in R＋ representing the successive arrival times of some natural events. We studied this process by using a record process approach under the assumption that the interarrival times T,, =...Let {Tn } be a renewal process in R＋ representing the successive arrival times of some natural events. We studied this process by using a record process approach under the assumption that the interarrival times T,, = Tn, - Ta-1, n = 1, 2...are exponentially i.i.d （independent and identically distributed）. The goal is to test that the first observed events are sporadic events. For testing the hypothesis ＂sporadic＂ we used the non-parametric test based on the probability distribution of the statistic of the number of records N, among{Xx }k-1= where Xk = （ΔTk）-1. We showed that it is independent of the cumulative distribution of the observations and that it is exactly calculated for each n. We illustrated this statistic on a simulated trajectory and we compared it with descriptive smoothing methods. We studied an application to a data set as storms in France and US.展开更多
We propose a new unified path to approximately smoothing the nonsmooth exact penalty function in this paper. Based on the new smooth penalty function, we give a penalty algorithm to solve the constrained optimization ...We propose a new unified path to approximately smoothing the nonsmooth exact penalty function in this paper. Based on the new smooth penalty function, we give a penalty algorithm to solve the constrained optimization problem, and discuss the convergence of the algorithm under mild conditions.展开更多
Two kinds of methods for determining seismic parameters are presented, that is, the potential seismic source zoning method and grid-spatially smoothing method. The Gaussian smoothing method and the modified Gaussian s...Two kinds of methods for determining seismic parameters are presented, that is, the potential seismic source zoning method and grid-spatially smoothing method. The Gaussian smoothing method and the modified Gaussian smoothing method are described in detail, and a comprehensive analysis of the advantages and disadvantages of these methods is made. Then, we take centrai China as the study region, and use the Gaussian smoothing method and potential seismic source zoning method to build seismic models to calculate the mean annual seismic rate. Seismic hazard is calculated using the probabilistic seismic hazard analysis method to construct the ground motion acceleration zoning maps. The differences between the maps and these models are discussed and the causes are investigated. The results show that the spatial smoothing method is suitable for estimating the seismic hazard over the moderate and low seismicity regions or the hazard caused by background seismicity; while the potential seismic source zoning method is suitable for estimating the seismic hazard in well-defined seismotectonics. Combining the spatial smoothing method and the potential seismic source zoning method with an integrated account of the seismicity and known seismotectonics is a feasible approach to estimate the seismic hazard in moderate and low seismicity regions.展开更多
In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space w...In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.展开更多
In this work, we further extended the face-based smoothed finite element method （FS-FEM） for modal analysis of three-dimensional solids using four-node tetrahedron elements. The FS-FEM is formulated based on the smo...In this work, we further extended the face-based smoothed finite element method （FS-FEM） for modal analysis of three-dimensional solids using four-node tetrahedron elements. The FS-FEM is formulated based on the smoothed Calerkin weak form which employs smoothed strains obtained using the gradient smoothing operation on face-based smoothing domains. This strain smoothing operation can provide softening effect to the system stiffness and make the FSFEM provide more accurate eigenfrequency prediction than the FEM does. Numerical studies have verified this attractive property of FS-FEM as well as its ability and effectiveness on providing reliable eigenfrequency and eigenmode prediction in practical engineering application.展开更多
The node-based smoothed finite element method(NS-FEM)is shortly presented for calculations of the static and seismic bearing capacities of shallow strip footings.A series of computations has been performed to assess v...The node-based smoothed finite element method(NS-FEM)is shortly presented for calculations of the static and seismic bearing capacities of shallow strip footings.A series of computations has been performed to assess variations in seismic bearing capacity factors with both horizontal and vertical seismic accelerations.Numerical results obtained agree very well with those using the slip-line method,revealing that the magnitude of the seismic bearing capacity is highly dependent upon the combinations of various directions of both components of the seismic acceleration.An upward vertical seismic acceleration reduces the seismic bearing capacity compared to the downward vertical seismic acceleration in calculations.In addition,particular emphasis is placed on a separate estimation of the effects of soil and superstructure inertia on each seismic bearing capacity component.While the effect of inertia forces arising in the soil on the seismic bearing capacity is non-trivial,and the superstructure inertia is the major contributor to reductions in the seismic bearing capacity.Both tables and charts are given for practical application to the seismic design of the foundations.展开更多
An effective hybrid optimization method is proposed by integrating an adaptive Kriging(A-Kriging)into an improved partial swarm optimization algorithm(IPSO)to give a so-called A-Kriging-IPSO for maximizing the bucklin...An effective hybrid optimization method is proposed by integrating an adaptive Kriging(A-Kriging)into an improved partial swarm optimization algorithm(IPSO)to give a so-called A-Kriging-IPSO for maximizing the buckling load of laminated composite plates(LCPs)under uniaxial and biaxial compressions.In this method,a novel iterative adaptive Kriging model,which is structured using two training sample sets as active and adaptive points,is utilized to directly predict the buckling load of the LCPs and to improve the efficiency of the optimization process.The active points are selected from the initial data set while the adaptive points are generated using the radial random-based convex samples.The cell-based smoothed discrete shear gap method(CS-DSG3)is employed to analyze the buckling behavior of the LCPs to provide the response of adaptive and input data sets.The buckling load of the LCPs is maximized by utilizing the IPSO algorithm.To demonstrate the efficiency and accuracy of the proposed methodology,the LCPs with different layers(2,3,4,and 10 layers),boundary conditions,aspect ratios and load patterns(biaxial and uniaxial loads)are investigated.The results obtained by proposed method are in good agreement with the literature results,but with less computational burden.By applying adaptive radial Kriging model,the accurate optimal resultsebased predictions of the buckling load are obtained for the studied LCPs.展开更多
Formulation and numerical evaluation of a novel twice-interpolation finite element method （TFEM） is presented for solid mechanics problems. In this method, the trial function for Galerkin weak form is constructed th...Formulation and numerical evaluation of a novel twice-interpolation finite element method （TFEM） is presented for solid mechanics problems. In this method, the trial function for Galerkin weak form is constructed through two stages of consecutive interpolation. The primary interpolation follows exactly the same procedure of standard FEM and is further reproduced according to both nodal values and averaged nodal gradients obtained from primary interpolation. The trial functions thus constructed have continuous nodal gradients and contain higher order polynomial without increasing total freedoms. Several benchmark examples and a real dam problem are used to examine the TFEM in terms of accuracy and convergence. Compared with standard FEM, TFEM can achieve significantly better accuracy and higher convergence rate, and the continuous nodal stress can be obtained without any smoothing operation. It is also found that TFEM is insensitive to the quality of the elemental mesh. In addition, the present TFEM can treat the incompressible material without any modification.展开更多
基金the National Natural Science Foundation of China(No.11672238)the 111 Project(No.BP0719007)the Shaanxi Province Natural Science Foundation(No.2020JZ-06)for the financial support.
文摘A modified inner-element edge-based smoothed finite element method(IES-FEM)is developed and integrated with ABAQUS using a user-defined element(UEL)in this study.Initially,the smoothing domain discretization of IES-FEM is described and compared with ES-FEM.A practical modification of IES-FEM is then introduced that used the technique employed by ES-FEM for the nodal strain calculation.The differences in the strain computation among ES-FEM,IES-FEM,and FEM are then discussed.The modified IES-FEM exhibited superior performance in displacement and a slight advantage in stress compared to FEM using the same mesh according to the results obtained from both the regular and irregular elements.The robustness of the IES-FEM to severely deformed meshes was also verified.
文摘In this paper, we analyze the global and local convergence properties of two predictor-corrector smoothing methods, which are based on the framework of the method in [1], for monotone linear complementarity problems (LCPs). The difference between the algorithm in [1] and our algorithms is that the neighborhood of smoothing central path in our paper is different to that in [1]. In addition, the difference between Algorithm 2.1 and the algorithm in [1] exists in the calculation of the predictor step. Comparing with the results in [1], the global and local convergence of the two methods can be obtained under very mild conditions. The global convergence of the two methods do not need the boundness of the inverse of the Jacobian. The superlinear convergence of Algorithm 2.1′ is obtained under the assumption of nonsingularity of generalized Jacobian of φ(x, y) at the limit point and Algorithm 2.1 obtains superlinear convergence under the assumption of strict complementarity at the solution. The effciency of the two methods is tested by numerical experiments.
基金supported by the National Natural Science Foundation of China(Nos.11201039,71171150,and 61273179).
文摘In this paper,a bilevel multiobjective programming problem,where the lower level is a convex parameter multiobjective program,is concerned.Using the KKT optimality conditions of the lower level problem,this kind of problem is transformed into an equivalent one-level nonsmooth multiobjective optimization problem.Then,a sequence of smooth multiobjective problems that progressively approximate the nonsmooth multiobjective problem is introduced.It is shown that the Pareto optimal solutions(stationary points)of the approximate problems converge to a Pareto optimal solution(stationary point)of the original bilevel multiobjective programming problem.Numerical results showing the viability of the smoothing approach are reported.
基金Sponsored by the Natural Science Fundation of Jiangxi Province(Grant No.20114BAB211026 and 20122BAB201028)the Open Science Fund from Key Laboratory of Radioactive Geology and Exploration Technology Fundamental Science for National Defense,East China Institute of Technology(Grant No.2010RGET11)
文摘The extraction of spectral parameters is very difficult because of the limited energy resolution for NaI （TI） gamma-ray detectors. For statistical fluctuation of radioactivity under complex environment, some smoothing filtering methods are proposed to solve the problem. These methods include adopting method of arithmetic moving average, center of gravity, least squares of polynomial, slide converter of discrete funcion convolution etc. The process of spectrum data is realized, and the results are assessed in H/FWHM（ Peak High/Full Width at Half Maximum） and peak area based on the Matlab programming. The results indicate that different methods smoothed spectrum have respective superiority in different ergoregion, but the Gaussian function theory in discrete function convolution slide method is used to filter the complex y-spectrum on Embedded system nlatform, and the statistical fluctuation of y-snectrum filtered wall.
基金Supported by the NNSF of China（11071041）Supported by the Fujian Natural Science Foundation（2009J01002）Supported by the Fujian Department of Education Foundation（JA11270）
文摘The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational inequality problem based on a new smoothing approximation function.The proposed algorithm is proved to be well defined and convergent globally under weaker conditions.
文摘Utilizing the well-known aggregation technique, we propose a smoothing sample average approximation （SAA） method for a stochastic linear complementarity problem, where the underlying functions are represented by expectations of stochastic functions. The method is proved to be convergent and the preliminary numerical results are reported.
基金Supported by the National Natural Science Foundation of China(No.51205286)
文摘Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the given algorithm performed global and superlinear convergence without strict complementarity.For the same linear complementarity problem(LCP),the algorithm needs similar iteration times to the literature.However,its accuracy is improved by at least 4 orders with calculation time reduced by almost 50%,and the iterative number is insensitive to the size of the LCP.Moreover,fewer iterations and shorter time are required for solving the problem by using inexact Newton methods for different initial points.
文摘A one_step smoothing Newton method is proposed for solving the vertical linear complementarity problem based on the so_called aggregation function. The proposed algorithm has the following good features: (ⅰ) It solves only one linear system of equations and does only one line search at each iteration; (ⅱ) It is well_defined for the vertical linear complementarity problem with vertical block P 0 matrix and any accumulation point of iteration sequence is its solution.Moreover, the iteration sequence is bounded for the vertical linear complementarity problem with vertical block P 0+R 0 matrix; (ⅲ) It has both global linear and local quadratic convergence without strict complementarity. Many existing smoothing Newton methods do not have the property (ⅲ).
基金Supported by the NNSF of China(11071041, 11171257)
文摘The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is designed for solving the ELCP. The proposed algorithm is proved to be globally convergent under suitable assumptions.
文摘In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent implicit fixed-point equation, then introduces a smoothing function to obtain its approximation solutions. The convergence analysis of the algorithm was given, and the efficiency of the algorithms was verified by numerical experiments.
基金supported by the National Natural Science Foundation of China(No.12271419).
文摘In this paper,we consider the symmetric cone linear complementarity problem with the Cartesian P0-property and present a regularization smoothing method with a nonmonotone line search to solve this problem.It has been demonstrated that the proposed method exhibits global convergence under the condition that the solution set of the complementarity problem is nonempty.This condition is less stringent than those that have appeared in some existing literature.We also show that the method has locally quadratic convergence under appropriate conditions.Some experimental results are reported to illustrate the efficiency of the proposed method.
基金Project supported by the National Natural Science Foundation of China (Nos.10572031, 10332010)
文摘By means of Lagrange duality of Hill＇s maximum plastic work principle theory of the convex program, a dual problem under Mises＇ yield condition has been derived and whereby a non-differentiable convex optimization model for the limit analysis is developed. With this model, it is not necessary to linearize the yield condition and its discrete form becomes a minimization problem of the sum of Euclidean norms subject to linear constraints. Aimed at resolving the non-differentiability of Euclidean norms, a smoothing algorithm for the limit analysis of perfect-plastic continuum media is proposed. Its efficiency is demonstrated by computing the limit load factor and the collapse state for some plane stress and plain strain problems.
文摘Let {Tn } be a renewal process in R＋ representing the successive arrival times of some natural events. We studied this process by using a record process approach under the assumption that the interarrival times T,, = Tn, - Ta-1, n = 1, 2...are exponentially i.i.d （independent and identically distributed）. The goal is to test that the first observed events are sporadic events. For testing the hypothesis ＂sporadic＂ we used the non-parametric test based on the probability distribution of the statistic of the number of records N, among{Xx }k-1= where Xk = （ΔTk）-1. We showed that it is independent of the cumulative distribution of the observations and that it is exactly calculated for each n. We illustrated this statistic on a simulated trajectory and we compared it with descriptive smoothing methods. We studied an application to a data set as storms in France and US.
文摘We propose a new unified path to approximately smoothing the nonsmooth exact penalty function in this paper. Based on the new smooth penalty function, we give a penalty algorithm to solve the constrained optimization problem, and discuss the convergence of the algorithm under mild conditions.
基金sponsored by the National Key Technology R&D Program,China (2006BAC13B01)
文摘Two kinds of methods for determining seismic parameters are presented, that is, the potential seismic source zoning method and grid-spatially smoothing method. The Gaussian smoothing method and the modified Gaussian smoothing method are described in detail, and a comprehensive analysis of the advantages and disadvantages of these methods is made. Then, we take centrai China as the study region, and use the Gaussian smoothing method and potential seismic source zoning method to build seismic models to calculate the mean annual seismic rate. Seismic hazard is calculated using the probabilistic seismic hazard analysis method to construct the ground motion acceleration zoning maps. The differences between the maps and these models are discussed and the causes are investigated. The results show that the spatial smoothing method is suitable for estimating the seismic hazard over the moderate and low seismicity regions or the hazard caused by background seismicity; while the potential seismic source zoning method is suitable for estimating the seismic hazard in well-defined seismotectonics. Combining the spatial smoothing method and the potential seismic source zoning method with an integrated account of the seismicity and known seismotectonics is a feasible approach to estimate the seismic hazard in moderate and low seismicity regions.
基金supported by the National Natural Science Foundation of China(11401126,71471140 and 11361018)Guangxi Natural Science Foundation(2016GXNSFBA380102 and 2014GXNSFFA118001)+2 种基金Guangxi Key Laboratory of Cryptography and Information Security(GCIS201618)Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ15112 and YQ16112)China
文摘In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
基金Project supported by the National Project 973 (No. 2010CB328005)the National Natural Science Foundation of China (No. 11202074)+2 种基金partially supported by the Open Research Fund Program of the State Key Laboratory of Advanced Technology of Design and Manufacturing for Vehicle Body, Hunan University, P. R. China (No. 31175002)the support of Centre for ACES, Singapore-MIT Alliance (SMA)National University of Singapore for the work
文摘In this work, we further extended the face-based smoothed finite element method （FS-FEM） for modal analysis of three-dimensional solids using four-node tetrahedron elements. The FS-FEM is formulated based on the smoothed Calerkin weak form which employs smoothed strains obtained using the gradient smoothing operation on face-based smoothing domains. This strain smoothing operation can provide softening effect to the system stiffness and make the FSFEM provide more accurate eigenfrequency prediction than the FEM does. Numerical studies have verified this attractive property of FS-FEM as well as its ability and effectiveness on providing reliable eigenfrequency and eigenmode prediction in practical engineering application.
基金part of the TPS projecta Vied-Newton PhD scholarship+1 种基金a Dixon scholarship from Imperial College London,UKthe Dean’s Fund from Imperial College London for financial support(2017-2020)。
文摘The node-based smoothed finite element method(NS-FEM)is shortly presented for calculations of the static and seismic bearing capacities of shallow strip footings.A series of computations has been performed to assess variations in seismic bearing capacity factors with both horizontal and vertical seismic accelerations.Numerical results obtained agree very well with those using the slip-line method,revealing that the magnitude of the seismic bearing capacity is highly dependent upon the combinations of various directions of both components of the seismic acceleration.An upward vertical seismic acceleration reduces the seismic bearing capacity compared to the downward vertical seismic acceleration in calculations.In addition,particular emphasis is placed on a separate estimation of the effects of soil and superstructure inertia on each seismic bearing capacity component.While the effect of inertia forces arising in the soil on the seismic bearing capacity is non-trivial,and the superstructure inertia is the major contributor to reductions in the seismic bearing capacity.Both tables and charts are given for practical application to the seismic design of the foundations.
基金Vietnam National Foundation for Science and Technology Development(NAFOSTED)under Grant number 107.02-2019.330.
文摘An effective hybrid optimization method is proposed by integrating an adaptive Kriging(A-Kriging)into an improved partial swarm optimization algorithm(IPSO)to give a so-called A-Kriging-IPSO for maximizing the buckling load of laminated composite plates(LCPs)under uniaxial and biaxial compressions.In this method,a novel iterative adaptive Kriging model,which is structured using two training sample sets as active and adaptive points,is utilized to directly predict the buckling load of the LCPs and to improve the efficiency of the optimization process.The active points are selected from the initial data set while the adaptive points are generated using the radial random-based convex samples.The cell-based smoothed discrete shear gap method(CS-DSG3)is employed to analyze the buckling behavior of the LCPs to provide the response of adaptive and input data sets.The buckling load of the LCPs is maximized by utilizing the IPSO algorithm.To demonstrate the efficiency and accuracy of the proposed methodology,the LCPs with different layers(2,3,4,and 10 layers),boundary conditions,aspect ratios and load patterns(biaxial and uniaxial loads)are investigated.The results obtained by proposed method are in good agreement with the literature results,but with less computational burden.By applying adaptive radial Kriging model,the accurate optimal resultsebased predictions of the buckling load are obtained for the studied LCPs.
基金supported by the National Natural Science Foundation of China(50474053,50475134 and 50675081)the 863 project (2007AA042142)
文摘Formulation and numerical evaluation of a novel twice-interpolation finite element method （TFEM） is presented for solid mechanics problems. In this method, the trial function for Galerkin weak form is constructed through two stages of consecutive interpolation. The primary interpolation follows exactly the same procedure of standard FEM and is further reproduced according to both nodal values and averaged nodal gradients obtained from primary interpolation. The trial functions thus constructed have continuous nodal gradients and contain higher order polynomial without increasing total freedoms. Several benchmark examples and a real dam problem are used to examine the TFEM in terms of accuracy and convergence. Compared with standard FEM, TFEM can achieve significantly better accuracy and higher convergence rate, and the continuous nodal stress can be obtained without any smoothing operation. It is also found that TFEM is insensitive to the quality of the elemental mesh. In addition, the present TFEM can treat the incompressible material without any modification.
