Searcharxiv⌕ Search

arXiv subjects

Adrian Sandu

Publications and source records attributed to Adrian Sandu.

88 records · Page 5Linked to original sources

A Sampling Filter for Non-Gaussian Data Assimilation

Data assimilation combines information from models, measurements, and priors to estimate the state of a dynamical system such as the atmosphere. The Ensemble Kalman filter (EnKF) is a family of ensemble-based data assimilation approaches that has gained wide popularity due its simple formulation, ease of implementation, and good practical results. Most EnKF algorithms assume that the underlying probability distributions are Gaussian. Although this assumption is well accepted, it is too restrictive when applied to large nonlinear models, nonlinear observation operators, and large levels of uncertainty. Several approaches have been proposed in order to avoid the Gaussianity assumption. One of the most successful strategies is the maximum likelihood ensemble filter (MLEF) which computes a maximum a posteriori estimate of the state assuming the posterior distribution is Gaussian. MLEF is designed to work with nonlinear and even non-differentiable observation operators, and shows good practical performance. However, there are limits to the degree of nonlinearity that MLEF can handle. This paper proposes a new ensemble-based data assimilation method, named the "sampling filter", which obtains the analysis by sampling directly from the posterior distribution. The sampling strategy is based on a Hybrid Monte Carlo (HMC) approach that can handle non-Gaussian probability distributions. Numerical experiments are carried out using the Lorenz-96 model and observation operators with different levels of non-linearity and differentiability. The proposed filter is also tested with shallow water model on a sphere with linear observation operator. The results show that the sampling filter can perform well even in highly nonlinear situations were EnKF and MLEF filters diverge.

cs.CE↗

Optimization of Vehicle Dynamics based on Multibody Models using Adjoint Sensitivity Analysis

Multibody dynamics simulations have become widely used tools for vehicle systems analysis and design. As this approach evolves, it becomes able to provide additional information for various types of analyses. One very important direction is the optimization of multibody systems. Sensitivity analysis of multibody system dynamics is essential for design optimization. Dynamic sensitivities, when needed, are often calculated by means of finite differences. However, depending of the number of parameters involved, this procedure can be computationally expensive. Moreover, in many cases the results suffer from low accuracy when real perturbations are used. This paper develops the adjoint sensitivity analysis of multibody systems in the context of penalty formulations. The resulting sensitivities are applied to perform dynamical optimization of a full vehicle system.

cs.CE↗

Dynamic Response Optimization of Complex Multibody Systems in a Penalty Formulation using Adjoint Sensitivity

Multibody dynamics simulations are currently widely accepted as valuable means for dynamic performance analysis of mechanical systems. The evolution of theoretical and computational aspects of the multibody dynamics discipline make it conducive these days for other types of applications, in addition to pure simulations. One very important such application is design optimization. A very important first step towards design optimization is sensitivity analysis of multibody system dynamics. Dynamic sensitivities are often calculated by means of finite differences. Depending of the number of parameters involved, this procedure can be computationally expensive. Moreover, in many cases, the results suffer from low accuracy when real perturbations are used. The main contribution to the state-of-the-art brought by this study is the development of the adjoint sensitivity approach of multibody systems in the context of the penalty formulation. The theory developed is demonstrated on one academic case study, a five-bar mechanism, and on one real-life system, a 14-DOF vehicle model. The five-bar mechanism is used to illustrate the sensitivity approach derived in this paper. The full vehicle model is used to demonstrate the capability of the new approach developed to perform sensitivity analysis and gradient-based optimization for large and complex multibody systems with respect to multiple design parameters.

nlin.CD↗

Solving stochastic chemical kinetics by Metropolis Hastings sampling

This study considers using Metropolis-Hastings algorithm for stochastic simulation of chemical reactions. The proposed method uses SSA (Stochastic Simulation Algorithm) distribution which is a standard method for solving well-stirred chemically reacting systems as a desired distribution. A new numerical solvers based on exponential form of exact and approximate solutions of CME (Chemical Master Equation) is employed for obtaining target and proposal distributions in Metropolis-Hastings algorithm to accelerate the accuracy of the tau-leap method. Samples generated by this technique have the same distribution as SSA and the histogram of samples show it's convergence to SSA.

math.NA↗

Approximate Exponential Algorithms to Solve the Chemical Master Equation

This paper discusses new simulation algorithms for stochastic chemical kinetics that exploit the linearity of the chemical master equation and its matrix exponential exact solution. These algorithms make use of various approximations of the matrix exponential to evolve probability densities in time. A sampling of the approximate solutions of the chemical master equation is used to derive accelerated stochastic simulation algorithms. Numerical experiments compare the new methods with the established stochastic simulation algorithm and the tau-leaping method.

math.NA↗

Application of approximate matrix factorization to high order linearly implicit Runge-Kutta methods

Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve efficiently large systems of differential equations that have a stiff linear part, e.g. reaction-diffusion systems. However, the use of approximate factorization usually leads to loss of accuracy, which makes it attractive only for low order time integration schemes. This paper discusses the application of approximate matrix factorization with high order methods; an inexpensive correction procedure applied to each stage allows to retain the high order of the underlying linearly implicit Runge-Kutta scheme. The accuracy and stability of the methods are studied. Numerical experiments on reaction-diffusion type problems of different sizes and with different degrees of stiffness illustrate the efficiency of the proposed approach.

math.NA↗

High Order Implicit-Explicit General Linear Methods with Optimized Stability Regions

In the numerical solution of partial differential equations using a method-of-lines approach, the availability of high order spatial discretization schemes motivates the development of sophisticated high order time integration methods. For multiphysics problems with both stiff and non-stiff terms implicit-explicit (IMEX) time stepping methods attempt to combine the lower cost advantage of explicit schemes with the favorable stability properties of implicit schemes. Existing high order IMEX Runge Kutta or linear multistep methods, however, suffer from accuracy or stability reduction. This work shows that IMEX general linear methods (GLMs) are competitive alternatives to classic IMEX schemes for large problems arising in practice. High order IMEX-GLMs are constructed in the framework developed by the authors [34]. The stability regions of the new schemes are optimized numerically. The resulting IMEX-GLMs have similar stability properties as IMEX Runge-Kutta methods, but they do not suffer from order reduction, and are superior in terms of accuracy and efficiency. Numerical experiments with two and three dimensional test problems illustrate the potential of the new schemes to speed up complex applications.

math.NA↗

Comparison of POD reduced order strategies for the nonlinear 2D Shallow Water Equations

This paper introduces tensorial calculus techniques in the framework of Proper Orthogonal Decomposition (POD) to reduce the computational complexity of the reduced nonlinear terms. The resulting method, named tensorial POD, can be applied to polynomial nonlinearities of any degree $p$. Such nonlinear terms have an on-line complexity of $\mathcal{O}(k^{p+1})$, where $k$ is the dimension of POD basis, and therefore is independent of full space dimension. However it is efficient only for quadratic nonlinear terms since for higher nonlinearities standard POD proves to be less time consuming once the POD basis dimension $k$ is increased. Numerical experiments are carried out with a two dimensional shallow water equation (SWE) test problem to compare the performance of tensorial POD, standard POD, and POD/Discrete Empirical Interpolation Method (DEIM). Numerical results show that tensorial POD decreases by $76\times$ times the computational cost of the on-line stage of standard POD for configurations using more than $300,000$ model variables. The tensorial POD SWE model was only $2-8\times$ slower than the POD/DEIM SWE model but the implementation effort is considerably increased. Tensorial calculus was again employed to construct a new algorithm allowing POD/DEIM shallow water equation model to compute its off-line stage faster than the standard and tensorial POD approaches.

math.NA↗

An Optimization Framework to Improve 4D-Var Data Assimilation System Performance

This paper develops a computational framework for optimizing the parameters of data assimilation systems in order to improve their performance. The approach formulates a continuous meta-optimization problem for parameters; the meta-optimization is constrained by the original data assimilation problem. The numerical solution process employs adjoint models and iterative solvers. The proposed framework is applied to optimize observation values, data weighting coefficients, and the location of sensors for a test problem. The ability to optimize a distributed measurement network is crucial for cutting down operating costs and detecting malfunctions.

cs.CE↗

Multirate generalized additive Runge Kutta methods

This work constructs a new class of multirate schemes based on the recently developed generalized additive Runge-Kutta (GARK) methods (Sandu and Guenther, 2013). Multirate schemes use different step sizes for different components and for different partitions of the right-hand side based on the local activity levels. We show that the new multirate GARK family includes many well-known multirate schemes as special cases. The order conditions theory follows directly from the GARK accuracy theory. Nonlinear stability and monotonicity investigations show that these properties are inherited from the base schemes provided that additional coupling conditions hold.

math.NA↗

A class of generalized additive Runge-Kutta methods

This work generalizes the additively partitioned Runge-Kutta methods by allowing for different stage values as arguments of different components of the right hand side. An order conditions theory is developed for the new family of generalized additive methods, and stability and monotonicity investigations are carried out. The paper discusses the construction and properties of implicit-explicit and implicit-implicit,methods in the new framework. The new family, named GARK, introduces additional flexibility when compared to traditional partitioned Runge-Kutta methods, and therefore offers additional opportunities for the development of flexible solvers for systems with multiple scales, or driven by multiple physical processes.

math.NA↗

Efficient methods for computing observation impact in 4D-Var data assimilation

This paper presents a practical computational approach to quantify the effect of individual observations in estimating the state of a system. Such an analysis can be used for pruning redundant measurements, and for designing future sensor networks. The mathematical approach is based on computing the sensitivity of the reanalysis (unconstrained optimization solution) with respect to the data. The computational cost is dominated by the solution of a linear system, whose matrix is the Hessian of the cost function, and is only available in operator form. The right hand side is the gradient of a scalar cost function that quantifies the forecast error of the numerical model. The use of adjoint models to obtain the necessary first and second order derivatives is discussed. We study various strategies to accelerate the computation, including matrix-free iterative solvers, preconditioners, and an in-house multigrid solver. Experiments are conducted on both a small-size shallow-water equations model, and on a large-scale numerical weather prediction model, in order to illustrate the capabilities of the new methodology.

cs.CE↗

Low-rank Approximations for Computing Observation Impact in 4D-Var Data Assimilation

We present an efficient computational framework to quantify the impact of individual observations in four dimensional variational data assimilation. The proposed methodology uses first and second order adjoint sensitivity analysis, together with matrix-free algorithms to obtain low-rank approximations of ob- servation impact matrix. We illustrate the application of this methodology to important applications such as data pruning and the identification of faulty sensors for a two dimensional shallow water test system.

cs.CE↗

Extrapolation-based implicit-explicit general linear methods

For many systems of differential equations modeling problems in science and engineering, there are natural splittings of the right hand side into two parts, one non-stiff or mildly stiff, and the other one stiff. For such systems implicit-explicit (IMEX) integration combines an explicit scheme for the non-stiff part with an implicit scheme for the stiff part. In a recent series of papers two of the authors (Sandu and Zhang) have developed IMEX GLMs, a family of implicit-explicit schemes based on general linear methods. It has been shown that, due to their high stage order, IMEX GLMs require no additional coupling order conditions, and are not marred by order reduction. This work develops a new extrapolation-based approach to construct practical IMEX GLM pairs of high order. We look for methods with large absolute stability region, assuming that the implicit part of the method is A- or L-stable. We provide examples of IMEX GLMs with optimal stability properties. Their application to a two dimensional test problem confirms the theoretical findings.

math.NA↗

Partitioned and implicit-explicit general linear methods for ordinary differential equations

Implicit-explicit (IMEX) time stepping methods can efficiently solve differential equa- tions with both stiff and nonstiff components. IMEX Runge-Kutta methods and IMEX linear multistep methods have been studied in the literature. In this pa- per we study new implicit-explicit methods of general linear type (IMEX-GLMs). We develop an order conditions theory for high stage order partitioned GLMs that share the same abscissae, and show that no additional coupling order conditions are needed. Consequently, GLMs offer an excellent framework for the construction of multi-method integration algorithms. Next, we propose a family of IMEX schemes based on diagonally-implicit multi-stage integration methods and construct practical schemes of order three. Numerical results confirm the theoretical findings.

math.NA↗

Implicit Simulation Methods for Stochastic Chemical Kinetics

In biochemical systems some of the chemical species are present with only small numbers of molecules. In this situation discrete and stochastic simulation approaches are more relevant than continuous and deterministic ones. The fundamental Gillespie's stochastic simulation algorithm (SSA) accounts for every reaction event, which occurs with a probability determined by the configuration of the system. This approach requires a considerable computational effort for models with many reaction channels and chemical species. In order to improve efficiency, tau-leaping methods represent multiple firings of each reaction during a simulation step by Poisson random variables. For stiff systems the mean of this variable is treated implicitly in order to ensure numerical stability. This paper develops fully implicit tau-leaping-like algorithms that treat implicitly both the mean and the variance of the Poisson variables. The construction is based on adapting weakly convergent discretizations of stochastic differential equations to stochastic chemical kinetic systems. Theoretical analyses of accuracy and stability of the new methods are performed on a standard test problem. Numerical results demonstrate the performance of the proposed tau-leaping methods.

cs.CE↗