Abstract:

This paper studies the vulnerability problem of area target based on the background of the combination of multiple submunitions.In this paper, the importance issues of damage probability and damage failure time in the vulnerability of area target is introduced;the performance evaluation of vulnerability of area target through related damages is analyzed;the combination of submunitions about delay capacity and nondelay capacity are considered in damage sources;the demand of computation resources is analyzed for the MonteCarlo simulation of damage probability;a suitable highperformance platform is constructed with this parallel algorithm;and finally,a numerical simulation example is given to test the algorithm’s efficiency.The simulation results show that those problems of computation resources,speed and efficiency can  all be solved effectively by this parallel algorithm.

Key words: combination to combat；vulnerability of area target；MonteCarlo method；parallel algorithm