Search arXivSearch

arXiv · 1504.06204

Order Reduction of the Radiative Heat Transfer Model for the Simulation of Plasma Arcs

Abstract

An approach to derive low-complexity models describing thermal radiation for the sake of simulating the behavior of electric arcs in switchgear systems is presented. The idea is to approximate the (high dimensional) full-order equations, modeling the propagation of the radiated intensity in space, with a model of much lower dimension, whose parameters are identified by means of nonlinear system identification techniques. The low-order model preserves the main structural aspects of the full-order one, and its parameters can be straightforwardly used in arc simulation tools based on computational fluid dynamics. In particular, the model parameters can be used together with the common approaches to resolve radiation in magnetohydrodynamic simulations, including the discrete-ordinate method, the P-N methods and photohydrodynamics. The proposed order reduction approach is able to systematically compute the partitioning of the electromagnetic spectrum in frequency bands, and the related absorption coefficients, that yield the best matching with respect to the finely resolved absorption spectrum of the considered gaseous medium. It is shown how the problem's structure can be exploited to improve the computational efficiency when solving the resulting nonlinear optimization problem. In addition to the order reduction approach and the related computational aspects, an analysis by means of Laplace transform is presented, providing a justification to the use of very low orders in the reduction procedure as compared with the full-order model. Finally, comparisons between the full-order model and the reduced-order ones are presented.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lorenzo Fagiano, Rudolf Gati. 2015-04-23. Order Reduction of the Radiative Heat Transfer Model for the Simulation of Plasma Arcs. https://doi.org/10.1016/j.jqsrt.2015.10.002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC