The spacecraequipment layout optimization design(SELOD)problems with complicated performance con-straints and diversity are studied in this paper.The previous literature uses the gradient-based algorithm to obtain op...The spacecraequipment layout optimization design(SELOD)problems with complicated performance con-straints and diversity are studied in this paper.The previous literature uses the gradient-based algorithm to obtain optimized non-overlap layout schemes from randomly initialized cases eectively.However,these local optimal solutions are too dicult to jump out of their current relative geometry relationships,signicantly limiting their further improvement in performance indicators.Therefore,considering the geometric diversity of layout schemes is put forward to alleviate this limitation.First,similarity measures,including modied cosine similarity and gaussian kernel function similarity,are introduced into the layout optimization process.Then the optimization produces a set of feasible layout candidates with the most remarkable dierence in geometric distribution and the most representative schemes are sampled.Finally,these feasible geometric solutions are used as initial solutions to optimize the physical performance indicators of the spacecra,and diversied layout schemes of spacecraequipment are generated for the engineering practice.The validity and eectiveness of the proposed methodology are demonstrated by two SELOD applications.展开更多
We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the ...We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the parallel model,in which computation speed is a big concern.The partitioning strategy includes the division of the research domain into several semi-equal-sized sub-domains,minimizing the sum weight of edges between different sub-domains.Multilevel schemes for graph partitioning are divided into three phases:coarsening,partitioning,and uncoarsening.In the uncoarsening phase,many refinement algorithms have been proposed previously,such as KL,Greedy,and Boundary refinements.In this study,we propose an N-Best refinement algorithm and show its advantages in our case study of Xiamen Bay.Compared with original partitioning algorithm in previous models,the N-Best algorithm can speed up the computation by 1.9 times,and the simulation results are in a good match with the in-situ data.展开更多
A numerical study was conducted for the vortex-induced vibrations of anelastic circular cylinder at low Reynolds numbers. An Arbitrary Lagrangian-Eulerian (ALE) method wasemployed to deal with the fluid-structure inte...A numerical study was conducted for the vortex-induced vibrations of anelastic circular cylinder at low Reynolds numbers. An Arbitrary Lagrangian-Eulerian (ALE) method wasemployed to deal with the fluid-structure interaction with an H-O type of non-staggered gridsincorporating the domain decomposition method (DDM), which could save the computational CPU time dueto re-meshing. The computational domain was divided into nine sub-domains including one ALEsub-domain and eight Eulerian sub-domains. The convection term and dissipation term in the N-Sequations were discretized using the third-order upwind compact scheme and the fourth-order centralcompact scheme, respectively. The motion of the cylinder was modeled by a spring-damper-mass systemand solved using the Runge-Kutta method. By simulating the non-linear fluid-structure interaction,the ''lock-in'', ''beating'' and ''phase switch'' phenomena were successfully captured, and the resultsagree with experimental data Furthermore, the vortex structure, the unsteady lift and drag on thecylinder, and the cylinder displacement at various natural frequency of the cylinder for Re = 200were discussed in detail, by which a jump transition of the wake structure was captured.展开更多
基金supported by Aerospace Frontier Inspiration Project (Grant No.KY0505072113) from College of Aerospace Science and Engineering,NUDT,which are gratefully acknowledged by the authors.
文摘The spacecraequipment layout optimization design(SELOD)problems with complicated performance con-straints and diversity are studied in this paper.The previous literature uses the gradient-based algorithm to obtain optimized non-overlap layout schemes from randomly initialized cases eectively.However,these local optimal solutions are too dicult to jump out of their current relative geometry relationships,signicantly limiting their further improvement in performance indicators.Therefore,considering the geometric diversity of layout schemes is put forward to alleviate this limitation.First,similarity measures,including modied cosine similarity and gaussian kernel function similarity,are introduced into the layout optimization process.Then the optimization produces a set of feasible layout candidates with the most remarkable dierence in geometric distribution and the most representative schemes are sampled.Finally,these feasible geometric solutions are used as initial solutions to optimize the physical performance indicators of the spacecra,and diversied layout schemes of spacecraequipment are generated for the engineering practice.The validity and eectiveness of the proposed methodology are demonstrated by two SELOD applications.
基金Supported by the National Natural Science Foundation of China (Nos. 40406005,41076001,40440420596)
文摘We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the parallel model,in which computation speed is a big concern.The partitioning strategy includes the division of the research domain into several semi-equal-sized sub-domains,minimizing the sum weight of edges between different sub-domains.Multilevel schemes for graph partitioning are divided into three phases:coarsening,partitioning,and uncoarsening.In the uncoarsening phase,many refinement algorithms have been proposed previously,such as KL,Greedy,and Boundary refinements.In this study,we propose an N-Best refinement algorithm and show its advantages in our case study of Xiamen Bay.Compared with original partitioning algorithm in previous models,the N-Best algorithm can speed up the computation by 1.9 times,and the simulation results are in a good match with the in-situ data.
文摘A numerical study was conducted for the vortex-induced vibrations of anelastic circular cylinder at low Reynolds numbers. An Arbitrary Lagrangian-Eulerian (ALE) method wasemployed to deal with the fluid-structure interaction with an H-O type of non-staggered gridsincorporating the domain decomposition method (DDM), which could save the computational CPU time dueto re-meshing. The computational domain was divided into nine sub-domains including one ALEsub-domain and eight Eulerian sub-domains. The convection term and dissipation term in the N-Sequations were discretized using the third-order upwind compact scheme and the fourth-order centralcompact scheme, respectively. The motion of the cylinder was modeled by a spring-damper-mass systemand solved using the Runge-Kutta method. By simulating the non-linear fluid-structure interaction,the ''lock-in'', ''beating'' and ''phase switch'' phenomena were successfully captured, and the resultsagree with experimental data Furthermore, the vortex structure, the unsteady lift and drag on thecylinder, and the cylinder displacement at various natural frequency of the cylinder for Re = 200were discussed in detail, by which a jump transition of the wake structure was captured.
