Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFinite-difference-based simulation and adjoint optimization of gas networks
163
0
0.0
(
0
)
Added by
Julius Reiss
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The stable operation of gas networks is an important optimization target. While for this task commonly finite volume methods are used, we introduce a new finite difference approach. With a summation by part formulation for the spatial discretization, we get well-defined fluxes between the pipes. This allows a simple and explicit formulation of the coupling conditions at the node. From that, we derive the adjoint equations for the network simply and transparently. The resulting direct and adjoint equations are numerically efficient and easy to implement. The approach is demonstrated by the optimization of two sample gas networks.
rate research
Read More
Mode-based model-reduction is used to reduce the degrees of freedom of high dimensional systems, often by describing the system state by a linear combination of spatial modes. Transport dominated phenomena, ubiquitous in technical and scientific applications, often require a large number of linear modes to obtain a small representation error. This difficulty, even for the most simple transports, originates from the inappropriateness of the decomposition structure in time dependent amplitudes of purely spatial modes. In this article an approach is discussed, which decomposes a flow field into several fields of co-moving frames, where each one can be approximated by a few modes. The method of decomposition is formulated as an optimization problem. Different singular-value-based objective functions are discussed and connected to former formulations. A boundary treatment is provided. The decomposition is applied to generic cases and to a technically relevant flow configuration of combustion physics.
Global spectral analysis (GSA) is used as a tool to test the accuracy of numerical methods with the help of canonical problems of convection and convection-diffusion equation which admit exact solutions. Similarly, events in turbulent flows computed by direct numerical simulation (DNS) are often calibrated with theoretical results of homogeneous isotropic turbulence due to Kolmogorov, as given in Turbulence -U. Frisch, Cambridge Univ. Press, UK (1995). However, numerical methods for the simulation of this problem are not calibrated, as by using GSA of convection and/or convection-diffusion equation. This is with the exception in A critical assessment of simulations for transitional and turbulence flows-Sengupta, T.K., In Proc. of IUTAM Symp. on Advances in Computation, Modeling and Control of Transitional and Turbulent Flows, pp 491-532, World Sci. Publ. Co. Pte. Ltd., Singapore (2016), where such a calibration has been advocated with the help of convection equation. For turbulent flows, an extreme event is characterized by the presence of length scales smaller than the Kolmogorov length scale, a heuristic limit for the largest wavenumber present without being converted to heat. With growing computer power, recently many simulations have been reported using a pseudo-spectral method, with spatial discretization performed in Fourier spectral space and a two-stage, Runge-Kutta (RK2) method for time discretization. But no analyses are reported to ensure high accuracy of such simulations. Here, an analysis is reported for few multi-stage Runge-Kutta methods in the Fourier spectral framework for convection and convection-diffusion equations. We identify the major source of error for the RK2-Fourier spectral method using GSA and also show how to avoid this error and specify numerical parameters for achieving highest accuracy possible to capture extreme events in turbulent flows.
Parametric sensitivity analysis is a critical component in the study of mathematical models of physical systems. Due to its simplicity, finite difference methods are used extensively for this analysis in the study of stochastically modeled reaction networks. Different coupling methods have been proposed to build finite difference estimators, with the split coupling, also termed the stacked coupling, yielding the lowest variance in the vast majority of cases. Analytical results related to this coupling are sparse, and include an analysis of the variance of the coupled processes under the assumption of globally Lipschitz intensity functions [Anderson, SIAM Numerical Analysis, Vol. 50, 2012]. Because of the global Lipschitz assumption utilized in [Anderson, SIAM Numerical Analysis, Vol. 50, 2012], the main result there is only applicable to a small percentage of the models found in the literature, and it was conjectured that similar results should hold for a much wider class of models. In this paper we demonstrate this conjecture to be true by proving the variance of the coupled processes scales in the desired manner for a large class of non-Lipschitz models. We further extend the analysis to allow for time dependence in the parameters. In particular, binary systems with or without time-dependent rate parameters, a class of models that accounts for the vast majority of systems considered in the literature, satisfy the assumptions of our theory.
We introduce a hybrid method to couple continuous Galerkin finite element methods and high-order finite difference methods in a nonconforming multiblock fashion. The aim is to optimize computational efficiency when complex geometries are present. The proposed coupling technique requires minimal changes in the existing schemes while maintaining strict stability, accuracy, and energy conservation. Results are demonstrated on linear and nonlinear scalar conservation laws in two spatial dimensions.
We consider a scalar function depending on a numerical solution of an initial value problem, and its second-derivative (Hessian) matrix for the initial value. The need to extract the information of the Hessian or to solve a linear system having the Hessian as a coefficient matrix arises in many research fields such as optimization, Bayesian estimation, and uncertainty quantification. From the perspective of memory efficiency, these tasks often employ a Krylov subspace method that does not need to hold the Hessian matrix explicitly and only requires computing the multiplication of the Hessian and a given vector. One of the ways to obtain an approximation of such Hessian-vector multiplication is to integrate the so-called second-order adjoint system numerically. However, the error in the approximation could be significant even if the numerical integration to the second-order adjoint system is sufficiently accurate. This paper presents a novel algorithm that computes the intended Hessian-vector multiplication exactly and efficiently. For this aim, we give a new concise derivation of the second-order adjoint system and show that the intended multiplication can be computed exactly by applying a particular numerical method to the second-order adjoint system. In the discussion, symplectic partitioned Runge--Kutta methods play an essential role.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
