Search arXivSearch

arXiv · 2105.07522

Sparse system identification by low-rank approximation

Abstract

In this document, some general results in approximation theory and matrix analysis with applications to sparse identification of time series models and nonlinear discrete-time dynamical systems are presented. The aforementioned theoretical methods are translated into algorithms that can be used for sparse model identification of discrete-time dynamical systems, based on structured data measured from the systems. The approximation of the state-transition operators that are determined primarily by matrices of parameters to be identified based on data measured from a given system, is approached by identifying conditions for the existence of low-rank approximations of submatrices of the trajectory matrices corresponding to the measured data, that can be used to compute approximate sparse representations of the matrices of parameters. One of the main advantages of the low-rank approximation approach presented in this document, concerns the parameter estimation for linear and nonlinear models where numerical or measurement noise could affect the estimates significantly. Prototypical algorithms based on the aforementioned techniques together with some applications to approximate identification and predictive simulation of time series models with symmetries and nonlinear structured dynamical systems in theoretical physics, fluid dynamics and weather forecasting are presented.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fredy Vides. 2021-08-03. Sparse system identification by low-rank approximation. https://arxiv.org/abs/2105.07522

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA