Shadowing and the viability kernel algorithm

Janosch Rieger

doi:10.1007/s00245-009-9083-z

Shadowing and the viability kernel algorithm

Janosch Rieger

Research output: Contribution to journal › Article › Research › peer-review

8 Citations (Scopus)

Abstract

The aim of this paper is to derive estimates for the accuracy of the Viability Kernel Algorithm for systems which have shadowing properties. Recently developed shadowing results are applied in order to prove for a certain class of right hand sides that the algorithm has the same convergence properties as fully discretized numerical methods on a finite time interval.

Original language	English
Pages (from-to)	429-441
Number of pages	13
Journal	Applied Mathematics and Optimization
Volume	60
Issue number	3
DOIs	https://doi.org/10.1007/s00245-009-9083-z
Publication status	Published - 2009
Externally published	Yes

Keywords

Shadowing
Viability kernel algorithm

Access to Document

10.1007/s00245-009-9083-z

Link to publication in Scopus

Cite this

@article{b4bc0589d9214546ad82a5c8ac8b63db,

title = "Shadowing and the viability kernel algorithm",

abstract = "The aim of this paper is to derive estimates for the accuracy of the Viability Kernel Algorithm for systems which have shadowing properties. Recently developed shadowing results are applied in order to prove for a certain class of right hand sides that the algorithm has the same convergence properties as fully discretized numerical methods on a finite time interval.",

keywords = "Shadowing, Viability kernel algorithm",

author = "Janosch Rieger",

year = "2009",

doi = "10.1007/s00245-009-9083-z",

language = "English",

volume = "60",

pages = "429--441",

journal = "Applied Mathematics and Optimization",

issn = "0095-4616",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Shadowing and the viability kernel algorithm

AU - Rieger, Janosch

PY - 2009

Y1 - 2009

N2 - The aim of this paper is to derive estimates for the accuracy of the Viability Kernel Algorithm for systems which have shadowing properties. Recently developed shadowing results are applied in order to prove for a certain class of right hand sides that the algorithm has the same convergence properties as fully discretized numerical methods on a finite time interval.

AB - The aim of this paper is to derive estimates for the accuracy of the Viability Kernel Algorithm for systems which have shadowing properties. Recently developed shadowing results are applied in order to prove for a certain class of right hand sides that the algorithm has the same convergence properties as fully discretized numerical methods on a finite time interval.

KW - Shadowing

KW - Viability kernel algorithm

UR - http://www.scopus.com/inward/record.url?scp=84897583130&partnerID=8YFLogxK

U2 - 10.1007/s00245-009-9083-z

DO - 10.1007/s00245-009-9083-z

M3 - Article

AN - SCOPUS:84897583130

VL - 60

SP - 429

EP - 441

JO - Applied Mathematics and Optimization

JF - Applied Mathematics and Optimization

SN - 0095-4616

IS - 3

ER -