Search

The paper considers utilization of rocket motor propellant grains that consist of two propellants. The idea is to achieve approximately neutral burning using an outer surface inhibited cylindrical shape and complex contact surface between propellants. An existing propellant grain with complex geometry has been analytically modeled in terms of determination of evolution of corresponding burning surface areas. The analytical and experimental results' diagrams of this grain have been found to have a saw-tooth shape because of the segments that separate the two propellants, causing potential problems in the burning process during the relatively short active phase, showing an obvious need for further optimization. This has created an opportunity for development of improved propellant grain geometry and corresponding mathematical model for determination of main interior ballistic parameters. Comparison between calculation results based on both models and experimentally determined chamber pressure data shows very good agreement. Therefore, two-component propellant grains have significant application possibilities using the suggested modeling approaches. [ABSTRACT FROM AUTHOR]

Abstract: We investigate the effects of a linear cut-off on front propagation in the Nagumo equation at a so-called Maxwell point, where the corresponding front solution in the absence of a cut-off is stationary. We show that the correction to the propagation speed induced by the cut-off is positive in this case; moreover, we determine the leading-order asymptotics of that correction in terms of the cut-off parameter, and we calculate explicitly the corresponding coefficient. Our analysis is based on geometric techniques from dynamical systems theory and, in particular, on the method of geometric desingularization (‘blow-up’). [Copyright &y& Elsevier]

We investigate the effects of a Heaviside cutoff on the dynamics of traveling fronts in a family of scalar reaction-diffusion equations with degenerate polynomial potential that includes the classical Zeldovich equation. We prove the existence and uniqueness of front solutions in the presence of the cutoff, and we derive the leading-order asymptotics of the corresponding propagation speed in terms of the cutoff parameter. For the Zeldovich equation, an explicit solution to the equation without cutoff is known, which allows us to calculate higher-order terms in the resulting expansion for the front speed; in particular, we prove the occurrence of logarithmic (switchback) terms in that case. Our analysis relies on geometric methods from dynamical systems theory and, in particular, on the desingularization technique known as 'blow-up.' [ABSTRACT FROM AUTHOR]

Abstract: ‘Cut-offs’ were introduced to model front propagation in reaction–diffusion systems in which the reaction is effectively deactivated at points where the concentration lies below some threshold. In this article, we investigate the effects of a cut-off on fronts propagating into metastable states in a class of bistable scalar equations. We apply the method of geometric desingularization from dynamical systems theory to calculate explicitly the change in front propagation speed that is induced by the cut-off. We prove that the asymptotics of this correction scales with fractional powers of the cut-off parameter, and we identify the source of these exponents, thus explaining the structure of the resulting expansion. In particular, we show geometrically that the speed of bistable fronts increases in the presence of a cut-off, in agreement with results obtained previously via a variational principle. We first discuss the classical Nagumo equation as a prototypical example of bistable front propagation. Then, we present corresponding results for the (equivalent) cut-off Schlögl equation. Finally, we extend our analysis to a general family of reaction–diffusion equations that support bistable fronts, and we show that knowledge of an explicit front solution to the associated problem without cut-off is necessary for the correction induced by the cut-off to be computable in closed form. [ABSTRACT FROM AUTHOR]