A higher order unscented transform
From MaRDI portal
Abstract: We develop a new approach for estimating the expected values of nonlinear functions applied to multivariate random variables with arbitrary distributions. Rather than assuming a particular distribution, we assume that we are only given the first four moments of the distribution. The goal is to summarize the distribution using a small number of quadrature nodes which are called -points. We achieve this by choosing nodes and weights in order to match the specified moments of the distribution. The classical scaled unscented transform (SUT) matches the mean and covariance of a distribution. In this paper, introduce the higher order unscented transform (HOUT) which also matches any given skewness and kurtosis tensors. It turns out that the key to matching the higher moments is the rank-1 tensor decomposition. While the minimal rank-1 decomposition is NP-complete, we present a practical algorithm for computing a non-minimal rank-1 decomposition and prove convergence in linear time. We then show how to combine the rank-1 decompositions of the moments in order to form the -points and weights of the HOUT. By passing the -points through a nonlinear function and applying our quadrature rule we can estimate the moments of the output distribution. We prove that the HOUT is exact on arbitrary polynomials up to fourth order. Finally, we numerically compare the HOUT to the SUT on nonlinear functions applied to non-Gaussian random variables including an application to forecasting and uncertainty quantification for chaotic dynamics.
Recommendations
- A robust unscented transformation for uncertain moments
- A new method for the nonlinear transformation of means and covariances in filters and estimators
- On the convergence rate of the unscented transformation
- Higher order sigma point filter: a new heuristic for nonlinear time series filtering
- An inequality unscented transformation for estimating the statistical moments
Cites work
- scientific article; zbMATH DE number 3370931 (Why is no real title available?)
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A literature survey of low-rank tensor approximation techniques
- A proper generalized decomposition for the solution of elliptic problems in abstract form by using a functional Eckart-Young approach
- Catastrophic filter divergence in filtering nonlinear dissipative systems
- Cubature Kalman Filters
- Deterministic Nonperiodic Flow
- Most tensor problems are NP-hard
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Sparse-grid quadrature nonlinear filtering
- Spectral Methods for Uncertainty Quantification
- Subtracting a best rank-1 approximation may increase tensor rank
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Theoretical Numerical Analysis
- Unscented Rauch--Tung--Striebel Smoother
Cited in
(3)
This page was built for publication: A higher order unscented transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010093)