SearcharxivSearch

arXiv subjects

Amit Apte

Publications and source records attributed to Amit Apte.

17 recordsLinked to original sources

Solving Fokker-Planck equations using the zeros of Fokker-Planck operators and the Feynman-Kac formula

First we show that physics-informed neural networks are not suitable for a large class of parabolic partial differential equations including the Fokker-Planck equation. Then we devise an algorithm to compute solutions of the Fokker-Planck equation using the zeros of Fokker-Planck operator and the Feynman-Kac formula. The resulting algorithm is mesh-free, highly parallelizable and able to compute solutions pointwise, thus mitigating the curse of dimensionality in a practical sense. We analyze various nuances of this algorithm that are determined by the drift term in the Fokker-Planck equation. We work with problems ranging in dimensions from 2 to 10. We demonstrate that this algorithm requires orders of magnitude fewer trajectories for each point in space when compared to Monte-Carlo. We also prove that under suitable conditions the error that is caused by letting some trajectories (associated with the Feynman-Kac expectation) escape our domain of knowledge is proportional to the fraction of trajectories that escape.

math.AP

Computation of covariant lyapunov vectors using data assimilation

Computing Lyapunov vectors from partial and noisy observations is a challenging problem. We propose a method using data assimilation to approximate the Lyapunov vectors using the estimate of the underlying trajectory obtained from the filter mean. We then extensively study the sensitivity of these approximate Lyapunov vectors and the corresponding Oseledets' subspaces to the perturbations in the underlying true trajectory. We demonstrate that this sensitivity is consistent with and helps explain the errors in the approximate Lyapunov vectors from the estimated trajectory of the filter. Using the idea of principal angles, we demonstrate that the Oseledets' subspaces defined by the LVs computed from the approximate trajectory are less sensitive than the individual vectors.

math.DS

Variability of echo state network prediction horizon for partially observed dynamical systems

Study of dynamical systems using partial state observation is an important problem due to its applicability to many real-world systems. We address the problem by studying an echo state network (ESN) framework with partial state input with partial or full state output. Application to the Lorenz system and Chua's oscillator (both numerically simulated and experimental systems) demonstrate the effectiveness of our method. We show that the ESN, as an autonomous dynamical system, is capable of making short-term predictions up to a few Lyapunov times. However, the prediction horizon has high variability depending on the initial condition-an aspect that we explore in detail using the distribution of the prediction horizon. Further, using a variety of statistical metrics to compare the long-term dynamics of the ESN predictions with numerically simulated or experimental dynamics and observed similar results, we show that the ESN can effectively learn the system's dynamics even when trained with noisy numerical or experimental datasets. Thus, we demonstrate the potential of ESNs to serve as cheap surrogate models for simulating the dynamics of systems where complete observations are unavailable.

eess.SY

Learning zeros of Fokker-Planck operators

In this paper we devise a deep learning algorithm to find non-trivial zeros of Fokker-Planck operators when the drift is non-solenoidal. We demonstrate the efficacy of our algorithm for problem dimensions ranging from 2 to 10. This method scales linearly with dimension in memory usage. In the problems we studied, overall computational time seems to scale approximately quadratically with dimension. We present results that indicate the potential of this method to produce better approximations compared to Monte Carlo methods, for the same overall sample sizes, even in low dimensions. Unlike the Monte Carlo methods, the deep network method gives a functional form of the solution. We also demonstrate that the associated loss function is strongly correlated with the distance from the true solution, thus providing a strong numerical justification for the algorithm. Moreover, this relation seems to be linear asymptotically for small values of the loss function.

math.AP

Effects of equatorially-confined shear flow on MRG and Rossby waves

Linear modal stability analysis of a mean zonal shear flow is carried out in the framework of rotating shallow water equations (RSWE), both under the $\beta$-plane approximation and in the full spherical coordinate system. Two base flows -- equatorial easterly (EE) and westerly (EW) -- with Gaussian profiles highly confined to small latitudes are analyzed. At low Froude number, mixed Rossby-gravity (MRG) and Rossby waves are found to be particularly affected by shear, with prominent changes at higher wavenumbers. These waves become practically non-dispersive at large wavenumbers in EE. The perturbations are found to be more confined equatorially in EE than in EW with the degree of confinement being more pronounced in the $\beta$-plane system compared to the full spherical system. At high Froude number, the phase speeds are significantly larger in the $\beta$-plane system for all families of waves. Under the $\beta$-plane approximation, exponentially unstable modes can be excited, having negative (positive) phase speed in EE (EW). Strikingly, this flow is always neutrally stable with the full spherical system. This speaks for the importance of studying the whole spherical system even for equatorially confined shear.

physics.flu-dyn

Probing robustness of nonlinear filter stability numerically using Sinkhorn divergence

Using the recently developed Sinkhorn algorithm for approximating the Wasserstein distance between probability distributions represented by Monte Carlo samples, we demonstrate exponential filter stability of two commonly used nonlinear filtering algorithms, namely, the particle filter and the ensemble Kalman filter, for deterministic dynamical systems. We also establish numerically a relation between filter stability and filter convergence by showing that the Wasserstein distance between filters with two different initial conditions is proportional to the bias or the RMSE of the filter.

math.OC

Stability of Non-linear Filter for Deterministic Dynamics

This papers shows that nonlinear filter in the case of deterministic dynamics is stable with respect to the initial conditions under the conditions that observations are sufficiently rich, both in the context of continuous and discrete time filters. Earlier works on the stability of the nonlinear filters are in the context of stochastic dynamics and assume conditions like compact state space or time independent observation model, whereas we prove filter stability for deterministic dynamics with more general assumptions on the state space and observation process. We give several examples of systems that satisfy these assumptions. We also show that the asymptotic structure of the filtering distribution is related to the dynamical properties of the signal.

math.OC

Some Large Deviations Asymptotics in Small Noise Filtering Problems

We consider nonlinear filters for diffusion processes when the observation and signal noises are small and of the same order. As the noise intensities approach zero, the nonlinear filter can be approximated by a certain variational problem that is closely related to Mortensen's optimization problem(1968). This approximation result can be made precise through a certain Laplace asymptotic formula. In this work we study probabilities of deviations of true filtering estimates from that obtained by solving the variational problem. Our main result gives a large deviation principle for Laplace functionals whose typical asymptotic behavior is described by Mortensen-type variational problems. Proofs rely on stochastic control representations for positive functionals of Brownian motions and Laplace asymptotics of the Kallianpur-Striebel formula.

math.PR

Thermalization of local observables in the $α$-FPUT chain

Most studies on the problem of equilibration of the Fermi-Pasta-Ulam-Tsingou (FPUT) system have focused on equipartition of energy being attained amongst the normal modes of the corresponding harmonic system. In the present work, we instead discuss the equilibration problem in terms of local variables, and consider initial conditions corresponding to spatially localized energy. We estimate the time-scales for equipartition of space localized degrees of freedom and find significant differences with the times scales observed for normal modes. Measuring thermalization in classical systems necessarily requires some averaging, and this could involve one over initial conditions or over time or spatial averaging. Here we consider averaging over initial conditions chosen from a narrow distribution in phase space. We examine in detail the effect of the width of the initial phase space distribution, and of integrability and chaos, on the time scales for thermalization. We show how thermalization properties of the system, quantified by its equilibration time, defined in this work, can be related to chaos, given by the maximal Lyapunov exponent. Somewhat surprisingly we also find that the ensemble averaging can lead to thermalization of the integrable Toda chain, though on much longer time scales.

cond-mat.stat-mech

Asymptotic Properties of Linear Filter for Noise Free Dynamical System

It is known that Kalman-Bucy filter is stable with respect to initial conditions under the conditions of uniform complete controllability and uniform complete observability (Bishop et. al 2017, Ocone et. al 1996). In this paper, we prove the stability of Kalman-Bucy filter for the case of noise free dynamical system. The earlier stability results cannot be applied for this case, as the system is not controllable at all. We further show that the optimal linear filter for certain class of non-Gaussian initial conditions is asymptotically proximal to Kalman-Bucy filter. It is also shown that the filter corresponding to non-zero system noise in the limit of small system noise approaches the filter corresponding to zero system noise in the case of Gaussian initial conditions.

math.OC

A Discrete View of the Indian Monsoon to Identify Spatial Patterns of Rainfall

We propose a representation of the Indian summer monsoon rainfall in terms of a probabilistic model based on a Markov Random Field, consisting of discrete state variables representing low and high rainfall at grid-scale and daily rainfall patterns across space and in time. These discrete states are conditioned on observed daily gridded rainfall data from the period 2000-2007. The model gives us a set of 10 spatial patterns of daily monsoon rainfall over India, which are robust over a range of user-chosen parameters as well as coherent in space and time. Each day in the monsoon season is assigned precisely one of the spatial patterns, that approximates the spatial distribution of rainfall on that day. Such approximations are quite accurate for nearly 95% of the days. Remarkably, these patterns are representative (with similar accuracy) of the monsoon seasons from 1901 to 2000 as well. Finally, we compare the proposed model with alternative approaches to extract spatial patterns of rainfall, using empirical orthogonal functions as well as clustering algorithms such as K-means and spectral clustering.

stat.AP

Spatio-temporal Patterns of Indian Monsoon Rainfall

The primary objective of this paper is to analyze a set of canonical spatial patterns that approximate the daily rainfall across the Indian region, as identified in the companion paper where we developed a discrete representation of the Indian summer monsoon rainfall using state variables with spatio-temporal coherence maintained using a Markov Random Field prior. In particular, we use these spatio-temporal patterns to study the variation of rainfall during the monsoon season. Firstly, the ten patterns are divided into three families of patterns distinguished by their total rainfall amount and geographic spread. These families are then used to establish `active' and `break' spells of the Indian monsoon at the all-India level. Subsequently, we characterize the behavior of these patterns in time by estimating probabilities of transition from one pattern to another across days in a season. Patterns tend to be `sticky': the self-transition is the most common. We also identify most commonly occurring sequences of patterns. This leads to a simple seasonal evolution model for the summer monsoon rainfall. The discrete representation introduced in the companion paper also identifies typical temporal rainfall patterns for individual locations. This enables us to determine wet and dry spells at local and regional scales. Lastly, we specify sets of locations that tend to have such spells simultaneously, and thus come up with a new regionalization of the landmass.

stat.AP

Parameter Estimation in Models with Complex Dynamics

Mathematical models of real life phenomena are highly nonlinear involving multiple parameters and often exhibiting complex dynamics. Experimental data sets are typically small and noisy, rendering estimation of parameters from such data unreliable and difficult. This paper presents a study of the Bayesian posterior distribution for unknown parameters of two chaotic discrete dynamical systems conditioned on observations of the system. The study shows how the qualitative properties of the posterior are affected by the intrinsic noise present in the data, the representation of this noise in the parameter estimation process, and the length of the data-set. The results indicate that increasing length of dataset does not significantly increase the precision of the estimate, and this is true for both periodic and chaotic data. On the other hand, increasing precision of the measurements leads to significant increase in precision of the estimated parameter in case of periodic data, but not in the case of chaotic data. These results are highly useful in designing laboratory and field-based studies in biology in general, and ecology and conservation in particular.

nlin.CD

Degenerate Kalman filter error covariances and their convergence onto the unstable subspace

The characteristics of the model dynamics are critical in the performance of (ensemble) Kalman filters. In particular, as emphasized in the seminal work of Anna Trevisan and co-authors, the error covariance matrix is asymptotically supported by the unstable-neutral subspace only, i.e., it is spanned by the backward Lyapunov vectors with non-negative exponents. This behavior is at the core of algorithms known as Assimilation in the Unstable Subspace, although a formal proof was still missing. This paper provides the analytical proof of the convergence of the Kalman filter covariance matrix onto the unstable-neutral subspace when the dynamics and the observation operator are linear and when the dynamical model is error-free, for any, possibly rank-deficient, initial error covariance matrix. The rate of convergence is provided as well. The derivation is based on an expression that explicitly relates the error covariances at an arbitrary time to the initial ones. It is also shown that if the unstable and neutral directions of the model are sufficiently observed and if the column space of the initial covariance matrix has a non-zero projection onto all of the forward Lyapunov vectors associated with the unstable and neutral directions of the dynamics, the covariance matrix of the Kalman filter collapses onto an asymptotic sequence which is independent of the initial covariances. Numerical results are also shown to illustrate and support the theoretical findings.

math.OC

Observers for compressible Navier-Stokes equation

We consider a multi-dimensional model of a compressible fluid in a bounded domain. We want to estimate the density and velocity of the fluid, based on the observations for only velocity. We build an observer exploiting the symmetries of the fluid dynamics laws. Our main result is that for the linearised system with full observations of the velocity field, we can find an observer which converges to the true state of the system at any desired convergence rate for finitely many but arbitrarily large number of Fourier modes. Our one-dimensional numerical results corroborate the results for the linearised, fully observed system, and also show similar convergence for the full nonlinear system and also for the case when the velocity field is observed only over a subdomain.

math.OC

Rank deficiency of Kalman error covariance matrices in linear time-varying system with deterministic evolution

We prove that for linear, discrete, time-varying, deterministic system (perfect model) with noisy outputs, the Riccati transformation in the Kalman filter asymptotically bounds the rank of the forecast and the analysis error covariance matrices to be less than or equal to the number of non-negative Lyapunov exponents of the system. Further, the support of these error covariance matrices is shown to be confined to the space spanned by the unstable-neutral backward Lyapunov vectors, providing the theoretical justification for the methodology of the algorithms that perform assimilation only in the unstable-neutral subspace. The equivalent property of the autonomous system is investigated as a special case.

math.OC

Effect of discrete time observations on synchronization in Chua model and applications to data assimilation

Recent studies show indication of the effectiveness of synchronization as a data assimilation tool for small or meso-scale forecast when less number of variables are observed frequently. Our main aim here is to understand the effects of changing observational frequency and observational noise on synchronization and prediction in a low dimensional chaotic system, namely the Chua circuit model. We perform {\it identical twin experiments} in order to study synchronization using discrete-in-time observations generated from independent model run and coupled unidirectionally to the model through $x$, $y$ and $z$ separately. We observe synchrony in a finite range of coupling constant when coupling the x and y variables of the Chua model but not when coupling the z variable. This range of coupling constant decreases with increasing levels of noise in the observations. The Chua system does not show synchrony when the time gap between observations is greater than about one-seventh of the Lyapunov time. Finally, we also note that prediction errors are much larger when noisy observations are used than when using observations without noise.

nlin.CD