{
  "id": "1601.01568",
  "version": "v1",
  "published": "2016-01-07T15:38:26.000Z",
  "updated": "2016-01-07T15:38:26.000Z",
  "title": "Approximation of Lyapunov Functions from Noisy Data",
  "authors": [
    "Peter Giesl",
    "Boumediene Hamzi",
    "Martin Rasmussen",
    "Kevin N. Webster"
  ],
  "categories": [
    "math.DS"
  ],
  "abstract": "Methods have previously been developed for the approximation of Lyapunov functions using radial basis functions. However these methods assume that the evolution equations are known. We consider the problem of approximating a given Lyapunov function using radial basis functions where the evolution equations are not known, but we instead have sampled data which is contaminated with noise. We propose an algorithm in which we first approximate the underlying vector field, and use this approximation to then approximate the Lyapunov function. Our approach combines elements of machine learning/statistical learning theory with the existing theory of Lyapunov function approximation. Error estimates are provided for our algorithm.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-01-07T15:38:26.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "noisy data",
      "radial basis functions",
      "evolution equations",
      "lyapunov function approximation",
      "error estimates"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160101568G"
    }
  }
}