Fast Approximate Data Assimilation for High-Dimensional Problems

08/08/2017
by   Xiao Lin, et al.
0

Currently, real-time data assimilation techniques are overwhelmed by data volume , velocity and increasing complexity of computational models. In this paper, we propose a novel data assimilation approach which only requires a small number of samples and can be applied to high-dimensional systems. This approach is based on linear latent variable models and leverages machinery to achieve fast implementation. It does not require computing the high-dimensional sample covariance matrix, which provides significant computational speed-up. Since it is performed without calculating likelihood function, it can be applied to data assimilation problems in which likelihood is intractable. In addition, model error can be absorbed implicitly and reflected in the data assimilation result. Two numerical experiments are conducted, and the proposed approach shows promising results.

READ FULL TEXT

page 15

page 16

research
01/27/2022

Fast Moving Natural Evolution Strategy for High-Dimensional Problems

In this work, we propose a new variant of natural evolution strategies (...
research
08/16/2020

An efficient numerical method for condition number constrained covariance matrix approximation

In high-dimensional data setting, the sample covariance matrix is singul...
research
11/02/2018

RSVP-graphs: Fast High-dimensional Covariance Matrix Estimation under Latent Confounding

In this work we consider the problem of estimating a high-dimensional p ...
research
04/05/2022

Sliced gradient-enhanced Kriging for high-dimensional function approximation

Gradient-enhanced Kriging (GE-Kriging) is a well-established surrogate m...
research
12/21/2020

Two-directional simultaneous inference for high-dimensional models

This paper proposes a general two directional simultaneous inference (TO...
research
07/08/2023

Fast Empirical Scenarios

We seek to extract a small number of representative scenarios from large...
research
01/14/2019

High-dimensional structure learning of binary pairwise Markov networks: A comparative numerical study

Learning the undirected graph structure of a Markov network from data is...

Please sign up or login with your details

Forgot password? Click here to reset