Orbit uncertainty propagation and sensitivity analysis with separated representations
From MaRDI portal
(Redirected from Publication:1682185)
Abstract: Most approximations for stochastic differential equations with high-dimensional, non-Gaussian inputs suffer from a rapid (e.g., exponential) increase of computational cost, an issue known as the curse of dimensionality. In astrodynamics, this results in reduced accuracy when propagating an orbit-state probability density function. This paper considers the application of separated representations for orbit uncertainty propagation, where future states are expanded into a sum of products of univariate functions of initial states and other uncertain parameters. An accurate generation of separated representation requires a number of state samples that is linear in the dimension of input uncertainties. The computation cost of a separated representation scales linearly with respect to the sample count, thereby improving tractability when compared to methods that suffer from the curse of dimensionality. In addition to detailed discussions on their construction and use in sensitivity analysis, this paper presents results for three test cases of an Earth orbiting satellite. The first two cases demonstrate that approximation via separated representations produces a tractable solution for propagating the Cartesian orbit-state uncertainty with up to 20 uncertain inputs. The third case, which instead uses Equinoctial elements, reexamines a scenario presented in the literature and employs the proposed method for sensitivity analysis to more thoroughly characterize the relative effects of uncertain inputs on the propagated state.
Recommendations
- Uncertainty propagation in orbital mechanics via tensor decomposition
- Propagation of large uncertainty sets in orbital dynamics by automatic domain splitting
- Adaptive Gaussian mixture method for uncertainty propagation in space surveillance
- On a set of \(J_2\) equinoctial orbital elements and their use for uncertainty propagation
- Implicit-Runge-Kutta-based methods for fast, precise, and scalable uncertainty propagation
Cites work
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- A least-squares method for sparse low rank approximation of multivariate functions
- Algorithms for Numerical Analysis in High Dimensions
- Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
- Complete triangular structures and Lie algebras
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Fundamentals of astrodynamics and applications. With technical contributions by Wayne D. McClain.
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
- Making best use of model evaluations to compute sensitivity indices
- Model reduction based on proper generalized decomposition for the stochastic steady incompressible Navier-Stokes equations
- Multivariate regression and machine learning with sums of separable functions
- Non-intrusive low-rank separated approximation of high-dimensional stochastic models
- Numerical methods for stochastic computations. A spectral method approach.
- Orbit uncertainty propagation and sensitivity analysis with separated representations
- Partitioned treatment of uncertainty in coupled domain problems: a separated representation approach
- Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Sensitivity Analysis in Practice
- Some basic hypergeometric orthogonal polynomials that generalize Jacobi polynomials
- Sparse tensor Galerkin discretization of parametric and random parabolic PDEs---analytic regularity and generalized polynomial chaos approximation
- Tensor Decompositions and Applications
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- The elements of statistical learning. Data mining, inference, and prediction
- Uncertainty propagation in orbital mechanics via tensor decomposition
Cited in
(11)- Orbit uncertainty propagation and sensitivity analysis with separated representations
- Higher-order sensitivity matrix method for probabilistic solution to uncertain Lambert problem and reachability set problem
- Adaptive Gaussian mixture method for uncertainty propagation in space surveillance
- Uncertainty maps for motion around binary asteroids
- Transition methods for stochastic simulation of parametric uncertainty in inverse problems of orbital dynamics
- Uncertainty propagation in orbital mechanics via tensor decomposition
- Orbit prediction for IRAS using vector and analytic techniques
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Propagation of large uncertainty sets in orbital dynamics by automatic domain splitting
- State uncertainty propagation and sensitivity analysis of the post-impact binary asteroid system
- Nonlinear methods of statistic simulation of virtual parameter values for investigating uncertainties in orbits determined from observations
This page was built for publication: Orbit uncertainty propagation and sensitivity analysis with separated representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682185)
