This paper proposes a non-intrusive computational method for mechanical dynamic systems involving a large-scale of interval uncertain parameters,aiming to reduce the computational costs and improve accuracy in determi...This paper proposes a non-intrusive computational method for mechanical dynamic systems involving a large-scale of interval uncertain parameters,aiming to reduce the computational costs and improve accuracy in determining bounds of system response.The screening method is firstly used to reduce the scale of active uncertain parameters.The sequential high-order polynomials surrogate models are then used to approximate the dynamic system’s response at each time step.To reduce the sampling cost of constructing surrogate model,the interaction effect among uncertain parameters is gradually added to the surrogate model by sequentially incorporating samples from a candidate set,which is composed of vertices and inner grid points.Finally,the points that may produce the bounds of the system response at each time step are searched using the surrogate models.The optimization algorithm is used to locate extreme points,which contribute to determining the inner points producing system response bounds.Additionally,all vertices are also checked using the surrogate models.A vehicle nonlinear dynamic model with 72 uncertain parameters is presented to demonstrate the accuracy and efficiency of the proposed uncertain computational method.展开更多
The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcom...The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcome the result mesh-sensitivity problem in the dynamic strain softening or strain localization analysis. The equations for the dynamic elastic-plastic problems are derived in terms of the parametric variational principle, which is valid for associated, non-associated and strain softening plastic constitutive models in the finite element analysis. The precise integration method, which has been widely used for discretization in time domain of the linear problems, is introduced for the solution of dynamic nonlinear equations. The new algorithm proposed is based on the combination of the parametric quadratic programming method and the precise integration method and has all the advantages in both of the algorithms. Results of numerical examples demonstrate not only the validity, but also the advantages of the algorithm proposed for the numerical solution of nonlinear dynamic problems.展开更多
A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the ...A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the total inconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making （MCGDM） and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result.展开更多
An efficient active-set approach is presented for both nonnegative and general linear programming by adding varying numbers of constraints at each iteration. Computational experiments demonstrate that the proposed app...An efficient active-set approach is presented for both nonnegative and general linear programming by adding varying numbers of constraints at each iteration. Computational experiments demonstrate that the proposed approach is significantly faster than previous active-set and standard linear programming algorithms.展开更多
From a perspective of theoretical study, there are some faults in the models of the existing object-oriented programming languages. For example, C# does not support metaclasses, the primitive types of Java and C# are ...From a perspective of theoretical study, there are some faults in the models of the existing object-oriented programming languages. For example, C# does not support metaclasses, the primitive types of Java and C# are not objects, etc. So, this paper designs a programming language, Shrek, which integrates many language features and constructions in a compact and consistent model. The Shrek language is a class-based purely object-oriented language. It has a dynamical strong type system, and adopts a single-inheritance mechanism with Mixin as its complement. It has a consistent class instantiation and inheritance structure, and the ability of intercessive structural computational reflection, which enables it to support safe metaclass programming. It also supports multi-thread programming and automatic garbage collection, and enforces its expressive power by adopting a native method mechanism. The prototype system of the Shrek language is implemented and anticipated design goals are achieved.展开更多
A certain number of considerations should be taken into account in the dynamic control of robot manipulators as highly complex non-linear systems.In this article,we provide a detailed presentation of the mechanical an...A certain number of considerations should be taken into account in the dynamic control of robot manipulators as highly complex non-linear systems.In this article,we provide a detailed presentation of the mechanical and electrical impli- cations of robots equipped with DC motor actuators.This model takes into account all non-linear aspects of the system.Then,we develop computational algorithms for optimal control based on dynamic programming.The robot's trajectory must be predefined,but performance criteria and constraints applying to the system are not limited and we may adapt them freely to the robot and the task being studied.As an example,a manipulator arm with 3 degrees of freedom is analyzed.展开更多
Hardware/software partitioning is an important step in the design of embedded systems. In this paper, the hardware/software partitioning problem is modeled as a constrained binary integer programming problem, which is...Hardware/software partitioning is an important step in the design of embedded systems. In this paper, the hardware/software partitioning problem is modeled as a constrained binary integer programming problem, which is further converted equivalently to an unconstrained binary integer programming problem by a penalty method. A local search method, HSFM, is developed to obtain a discrete local minimizer of the unconstrained binary integer programming problem. Next, an auxiliary function, which has the same global optimal solutions as the unconstrained binary integer programming problem, is constructed, and its properties are studied. We show that applying HSFM to minimize the auxiliary function can escape from previous local optima by the increase of the parameter value successfully. Finally, a discrete dynamic convexized method is developed to solve the hardware/software partitioning problem. Computational results and comparisons indicate that the proposed algorithm can get high-quality solutions.展开更多
In this study,we present a novel nodal integration-based particle finite element method(N-PFEM)designed for the dynamic analysis of saturated soils.Our approach incorporates the nodal integration technique into a gene...In this study,we present a novel nodal integration-based particle finite element method(N-PFEM)designed for the dynamic analysis of saturated soils.Our approach incorporates the nodal integration technique into a generalised Hellinger-Reissner(HR)variational principle,creating an implicit PFEM formulation.To mitigate the volumetric locking issue in low-order elements,we employ a node-based strain smoothing technique.By discretising field variables at the centre of smoothing cells,we achieve nodal integration over cells,eliminating the need for sophisticated mapping operations after re-meshing in the PFEM.We express the discretised governing equations as a min-max optimisation problem,which is further reformulated as a standard second-order cone programming(SOCP)problem.Stresses,pore water pressure,and displacements are simultaneously determined using the advanced primal-dual interior point method.Consequently,our numerical model offers improved accuracy for stresses and pore water pressure compared to the displacement-based PFEM formulation.Numerical experiments demonstrate that the N-PFEM efficiently captures both transient and long-term hydro-mechanical behaviour of saturated soils with high accuracy,obviating the need for stabilisation or regularisation techniques commonly employed in other nodal integration-based PFEM approaches.This work holds significant implications for the development of robust and accurate numerical tools for studying saturated soil dynamics.展开更多
This paper surveys the literature for the optimization problems in both discrete and continuous time models in macroeconomics,and provides an overview over some related computational methods to solve the models linear...This paper surveys the literature for the optimization problems in both discrete and continuous time models in macroeconomics,and provides an overview over some related computational methods to solve the models linearly and nonlinearly,and to compute the transition dynamics and the impulse response functions.Also,the introduction of the financial sectors,the continuous time analysis,and the advanced mathematical tools into the general equilibrium framework expands greatly the scope of the interdisciplinary research to mathematics,statistics and econometrics,and creates further space for exploration and collaboration.Finally,some future research issues related to this topic are highlighted.展开更多
Free-interface dual-compatibility modal synthesis method(compatibility of both force and displacement on interfaces)is introduced to large-scale civil engineering structure to enhance computation efficiency. The basic...Free-interface dual-compatibility modal synthesis method(compatibility of both force and displacement on interfaces)is introduced to large-scale civil engineering structure to enhance computation efficiency. The basic equations of the method are first set up, and then the mode cut-off principle and the dividing principle are proposed. MATLAB is used for simulation in different frame structures. The simulation results demonstrate the applicability of this substructure method to civil engineering structures and the correctness of the proposed mode cut-off principle. Studies are also conducted on how to divide the whole structure for better computation efficiency while maintaining better precision. It is observed that the geometry and material properties should be considered, and the synthesis results would be more precise when the inflection points of the mode shapes are taken into consideration. Furthermore, the simulation performed on a large-scale high-rise connected structure further proves the feasibility and efficiency of this modal synthesis method compared with the traditional global method. It is also concluded from the simulation results that the fewer number of DOFs in each substructure will result in better computation efficiency, but too many substructures will be time-consuming due to the tedious synthesis procedures. Moreover, the substructures with free interface will introduce errors and reduce the precision dramatically, which should be avoided.展开更多
Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic...Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic and non-dynamic active-set framework. The computational performance of these methods is compared with the CPLEX standard linear programming algorithms, with two most-violated constraint approaches, and with previously developed COST algorithms for large-scale problems.展开更多
We describe a new active-set, cutting-plane Constraint Optimal Selection Technique (COST) for solving general linear programming problems. We describe strategies to bound the initial problem and simultaneously add mul...We describe a new active-set, cutting-plane Constraint Optimal Selection Technique (COST) for solving general linear programming problems. We describe strategies to bound the initial problem and simultaneously add multiple constraints. We give an interpretation of the new COST’s selection rule, which considers both the depth of constraints as well as their angles from the objective function. We provide computational comparisons of the COST with existing linear programming algorithms, including other COSTs in the literature, for some large-scale problems. Finally, we discuss conclusions and future research.展开更多
We introduce and analyze a family of linear least-squares Monte Carlo schemesfor backward SDEs, which interpolate between the one-step dynamic programmingscheme of Lemor, Warin, and Gobet (Bernoulli, 2006) and the mul...We introduce and analyze a family of linear least-squares Monte Carlo schemesfor backward SDEs, which interpolate between the one-step dynamic programmingscheme of Lemor, Warin, and Gobet (Bernoulli, 2006) and the multi-step dynamicprogramming scheme of Gobet and Turkedjiev (Mathematics of Computation, 2016). Ouralgorithm approximates conditional expectations over segments of the time grid. Wediscuss the optimal choice of the segment length depending on the 'smoothness' of theproblem and show that, in typical situations, the complexity can be reduced compared tothe state-of-the-art multi-step dynamic programming scheme.展开更多
Inspired by the success of the projected Barzilai-Borwein(PBB)method for largescale box-constrained quadratic programming,we propose and analyze the monotone projected gradient methods in this paper.We show by experim...Inspired by the success of the projected Barzilai-Borwein(PBB)method for largescale box-constrained quadratic programming,we propose and analyze the monotone projected gradient methods in this paper.We show by experiments and analyses that for the new methods,it is generally a bad option to compute steplengths based on the negative gradients.Thus in our algorithms,some continuous or discontinuous projected gradients are used instead to compute the steplengths.Numerical experiments on a wide variety of test problems are presented,indicating that the new methods usually outperform the PBB method.展开更多
This paper presents the optimal method of experiment for multidimensional dynamic programming.It becomes possible to solve the general problems of thousanddimensions.
The multi-satellite electromagnetic formation flight system is nonlinear and strongly coupled,which makes modeling and optimization challenging.To simplify electromagnetic force evaluation and dynamics modeling,we int...The multi-satellite electromagnetic formation flight system is nonlinear and strongly coupled,which makes modeling and optimization challenging.To simplify electromagnetic force evaluation and dynamics modeling,we introduce a reference frame consistent with each satellite body frame,in which the electromagnetic dipoles and electromagnetic forces are represented as two-dimensional vectors.Then,the maneuver time is divided into time intervals,and different satellite sets are activated in each interval,converting the multi-satellite formation reconfiguration problem into an optimal trajectory problem of each two-satellite subsystem.To this end,a token-based dynamic programming method with a switching penalty of active satellite sets is proposed to determine the sequence of satellite sets participating in each time interval,thereby enabling all satellites to reach their desired states.For the two-satellite subsystem with the objectives of minimizing maneuver time and energy consumption,the Gauss pseudo-spectral method is employed to generate the optimal reconfiguration trajectory.Numerical simulations verify the effectiveness of the proposed optimization method.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.12272142)Fundamental Research Funds for the Central Universities(Grant No.2172021XXJS048)。
文摘This paper proposes a non-intrusive computational method for mechanical dynamic systems involving a large-scale of interval uncertain parameters,aiming to reduce the computational costs and improve accuracy in determining bounds of system response.The screening method is firstly used to reduce the scale of active uncertain parameters.The sequential high-order polynomials surrogate models are then used to approximate the dynamic system’s response at each time step.To reduce the sampling cost of constructing surrogate model,the interaction effect among uncertain parameters is gradually added to the surrogate model by sequentially incorporating samples from a candidate set,which is composed of vertices and inner grid points.Finally,the points that may produce the bounds of the system response at each time step are searched using the surrogate models.The optimization algorithm is used to locate extreme points,which contribute to determining the inner points producing system response bounds.Additionally,all vertices are also checked using the surrogate models.A vehicle nonlinear dynamic model with 72 uncertain parameters is presented to demonstrate the accuracy and efficiency of the proposed uncertain computational method.
文摘The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcome the result mesh-sensitivity problem in the dynamic strain softening or strain localization analysis. The equations for the dynamic elastic-plastic problems are derived in terms of the parametric variational principle, which is valid for associated, non-associated and strain softening plastic constitutive models in the finite element analysis. The precise integration method, which has been widely used for discretization in time domain of the linear problems, is introduced for the solution of dynamic nonlinear equations. The new algorithm proposed is based on the combination of the parametric quadratic programming method and the precise integration method and has all the advantages in both of the algorithms. Results of numerical examples demonstrate not only the validity, but also the advantages of the algorithm proposed for the numerical solution of nonlinear dynamic problems.
基金supported by the National Natural Science Foundation of China (60904059 60975049)+1 种基金the Philosophy and Social Science Foundation of Hunan Province (2010YBA104)the National High Technology Research and Development Program of China (863 Program)(2009AA04Z107)
文摘A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the total inconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making （MCGDM） and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result.
文摘An efficient active-set approach is presented for both nonnegative and general linear programming by adding varying numbers of constraints at each iteration. Computational experiments demonstrate that the proposed approach is significantly faster than previous active-set and standard linear programming algorithms.
基金The National Science Fund for Distinguished Young Scholars (No.60425206)the National Natural Science Foundation of China (No.60633010)the Natural Science Foundation of Jiangsu Province(No.BK2006094)
文摘From a perspective of theoretical study, there are some faults in the models of the existing object-oriented programming languages. For example, C# does not support metaclasses, the primitive types of Java and C# are not objects, etc. So, this paper designs a programming language, Shrek, which integrates many language features and constructions in a compact and consistent model. The Shrek language is a class-based purely object-oriented language. It has a dynamical strong type system, and adopts a single-inheritance mechanism with Mixin as its complement. It has a consistent class instantiation and inheritance structure, and the ability of intercessive structural computational reflection, which enables it to support safe metaclass programming. It also supports multi-thread programming and automatic garbage collection, and enforces its expressive power by adopting a native method mechanism. The prototype system of the Shrek language is implemented and anticipated design goals are achieved.
文摘A certain number of considerations should be taken into account in the dynamic control of robot manipulators as highly complex non-linear systems.In this article,we provide a detailed presentation of the mechanical and electrical impli- cations of robots equipped with DC motor actuators.This model takes into account all non-linear aspects of the system.Then,we develop computational algorithms for optimal control based on dynamic programming.The robot's trajectory must be predefined,but performance criteria and constraints applying to the system are not limited and we may adapt them freely to the robot and the task being studied.As an example,a manipulator arm with 3 degrees of freedom is analyzed.
基金Supported by the National Natural Science Foundation of China(11301255)the Fund by Collaborative Innovation Center of IoT Industrialization and Intelligent Production,Minjiang University(IIC1703)+1 种基金Foundation of Minjiang University(MYK17032)the Program for New Century Excellent Talents in Fujian Province University
文摘Hardware/software partitioning is an important step in the design of embedded systems. In this paper, the hardware/software partitioning problem is modeled as a constrained binary integer programming problem, which is further converted equivalently to an unconstrained binary integer programming problem by a penalty method. A local search method, HSFM, is developed to obtain a discrete local minimizer of the unconstrained binary integer programming problem. Next, an auxiliary function, which has the same global optimal solutions as the unconstrained binary integer programming problem, is constructed, and its properties are studied. We show that applying HSFM to minimize the auxiliary function can escape from previous local optima by the increase of the parameter value successfully. Finally, a discrete dynamic convexized method is developed to solve the hardware/software partitioning problem. Computational results and comparisons indicate that the proposed algorithm can get high-quality solutions.
基金supported by the Swiss National Science Foundation(Grant No.189882)the National Natural Science Foundation of China(Grant No.41961134032)support provided by the New Investigator Award grant from the UK Engineering and Physical Sciences Research Council(Grant No.EP/V012169/1).
文摘In this study,we present a novel nodal integration-based particle finite element method(N-PFEM)designed for the dynamic analysis of saturated soils.Our approach incorporates the nodal integration technique into a generalised Hellinger-Reissner(HR)variational principle,creating an implicit PFEM formulation.To mitigate the volumetric locking issue in low-order elements,we employ a node-based strain smoothing technique.By discretising field variables at the centre of smoothing cells,we achieve nodal integration over cells,eliminating the need for sophisticated mapping operations after re-meshing in the PFEM.We express the discretised governing equations as a min-max optimisation problem,which is further reformulated as a standard second-order cone programming(SOCP)problem.Stresses,pore water pressure,and displacements are simultaneously determined using the advanced primal-dual interior point method.Consequently,our numerical model offers improved accuracy for stresses and pore water pressure compared to the displacement-based PFEM formulation.Numerical experiments demonstrate that the N-PFEM efficiently captures both transient and long-term hydro-mechanical behaviour of saturated soils with high accuracy,obviating the need for stabilisation or regularisation techniques commonly employed in other nodal integration-based PFEM approaches.This work holds significant implications for the development of robust and accurate numerical tools for studying saturated soil dynamics.
基金Supported by the National Natural Science Foundation of China(72033008,72133002)。
文摘This paper surveys the literature for the optimization problems in both discrete and continuous time models in macroeconomics,and provides an overview over some related computational methods to solve the models linearly and nonlinearly,and to compute the transition dynamics and the impulse response functions.Also,the introduction of the financial sectors,the continuous time analysis,and the advanced mathematical tools into the general equilibrium framework expands greatly the scope of the interdisciplinary research to mathematics,statistics and econometrics,and creates further space for exploration and collaboration.Finally,some future research issues related to this topic are highlighted.
基金Supported by the National Natural Science Foundation of China(No.51108089)Doctoral Programs Foundation of Ministry of Education of China(No.20113514120005)the Foundation of the Education Department of Fujian Province(No.JA14057)
文摘Free-interface dual-compatibility modal synthesis method(compatibility of both force and displacement on interfaces)is introduced to large-scale civil engineering structure to enhance computation efficiency. The basic equations of the method are first set up, and then the mode cut-off principle and the dividing principle are proposed. MATLAB is used for simulation in different frame structures. The simulation results demonstrate the applicability of this substructure method to civil engineering structures and the correctness of the proposed mode cut-off principle. Studies are also conducted on how to divide the whole structure for better computation efficiency while maintaining better precision. It is observed that the geometry and material properties should be considered, and the synthesis results would be more precise when the inflection points of the mode shapes are taken into consideration. Furthermore, the simulation performed on a large-scale high-rise connected structure further proves the feasibility and efficiency of this modal synthesis method compared with the traditional global method. It is also concluded from the simulation results that the fewer number of DOFs in each substructure will result in better computation efficiency, but too many substructures will be time-consuming due to the tedious synthesis procedures. Moreover, the substructures with free interface will introduce errors and reduce the precision dramatically, which should be avoided.
文摘Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic and non-dynamic active-set framework. The computational performance of these methods is compared with the CPLEX standard linear programming algorithms, with two most-violated constraint approaches, and with previously developed COST algorithms for large-scale problems.
文摘We describe a new active-set, cutting-plane Constraint Optimal Selection Technique (COST) for solving general linear programming problems. We describe strategies to bound the initial problem and simultaneously add multiple constraints. We give an interpretation of the new COST’s selection rule, which considers both the depth of constraints as well as their angles from the objective function. We provide computational comparisons of the COST with existing linear programming algorithms, including other COSTs in the literature, for some large-scale problems. Finally, we discuss conclusions and future research.
文摘We introduce and analyze a family of linear least-squares Monte Carlo schemesfor backward SDEs, which interpolate between the one-step dynamic programmingscheme of Lemor, Warin, and Gobet (Bernoulli, 2006) and the multi-step dynamicprogramming scheme of Gobet and Turkedjiev (Mathematics of Computation, 2016). Ouralgorithm approximates conditional expectations over segments of the time grid. Wediscuss the optimal choice of the segment length depending on the 'smoothness' of theproblem and show that, in typical situations, the complexity can be reduced compared tothe state-of-the-art multi-step dynamic programming scheme.
基金supported by the National Natural Science Foundation of China(Grant Nos.10171104,10571171&40233029).
文摘Inspired by the success of the projected Barzilai-Borwein(PBB)method for largescale box-constrained quadratic programming,we propose and analyze the monotone projected gradient methods in this paper.We show by experiments and analyses that for the new methods,it is generally a bad option to compute steplengths based on the negative gradients.Thus in our algorithms,some continuous or discontinuous projected gradients are used instead to compute the steplengths.Numerical experiments on a wide variety of test problems are presented,indicating that the new methods usually outperform the PBB method.
文摘This paper presents the optimal method of experiment for multidimensional dynamic programming.It becomes possible to solve the general problems of thousanddimensions.
文摘The multi-satellite electromagnetic formation flight system is nonlinear and strongly coupled,which makes modeling and optimization challenging.To simplify electromagnetic force evaluation and dynamics modeling,we introduce a reference frame consistent with each satellite body frame,in which the electromagnetic dipoles and electromagnetic forces are represented as two-dimensional vectors.Then,the maneuver time is divided into time intervals,and different satellite sets are activated in each interval,converting the multi-satellite formation reconfiguration problem into an optimal trajectory problem of each two-satellite subsystem.To this end,a token-based dynamic programming method with a switching penalty of active satellite sets is proposed to determine the sequence of satellite sets participating in each time interval,thereby enabling all satellites to reach their desired states.For the two-satellite subsystem with the objectives of minimizing maneuver time and energy consumption,the Gauss pseudo-spectral method is employed to generate the optimal reconfiguration trajectory.Numerical simulations verify the effectiveness of the proposed optimization method.
