Interval-based tracing of strange attractors

Dominique Michelucci; Sebti Foufou

doi:10.1142/S0218195906001914

Interval-based tracing of strange attractors

Dominique Michelucci, Sebti Foufou

Computer Science

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

Abstract

The method described here relies on interval arithmetic and graph theory to compute guaranteed coverings of strange attractors like Hénon attractor. It copes with infinite intervals, using either a geometric method or a new directed projective interval arithmetic.

Original language	English (US)
Pages (from-to)	27-39
Number of pages	13
Journal	International Journal of Computational Geometry and Applications
Volume	16
Issue number	1
DOIs	https://doi.org/10.1142/S0218195906001914
State	Published - Feb 2006

Keywords

Directed projective interval arithmetic
Hénon map
Interval arithmetic
Strange attractors
Strongly connected components

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Theory and Mathematics
Computational Mathematics
Applied Mathematics

Access to Document

10.1142/S0218195906001914

Cite this

@article{91150c8c888144ae832c45da6b0b3a34,

title = "Interval-based tracing of strange attractors",

abstract = "The method described here relies on interval arithmetic and graph theory to compute guaranteed coverings of strange attractors like H{\'e}non attractor. It copes with infinite intervals, using either a geometric method or a new directed projective interval arithmetic.",

keywords = "Directed projective interval arithmetic, H{\'e}non map, Interval arithmetic, Strange attractors, Strongly connected components",

author = "Dominique Michelucci and Sebti Foufou",

year = "2006",

month = feb,

doi = "10.1142/S0218195906001914",

language = "English (US)",

volume = "16",

pages = "27--39",

journal = "International Journal of Computational Geometry and Applications",

issn = "0218-1959",

publisher = "World Scientific",

number = "1",

}

TY - JOUR

T1 - Interval-based tracing of strange attractors

AU - Michelucci, Dominique

AU - Foufou, Sebti

PY - 2006/2

Y1 - 2006/2

N2 - The method described here relies on interval arithmetic and graph theory to compute guaranteed coverings of strange attractors like Hénon attractor. It copes with infinite intervals, using either a geometric method or a new directed projective interval arithmetic.

AB - The method described here relies on interval arithmetic and graph theory to compute guaranteed coverings of strange attractors like Hénon attractor. It copes with infinite intervals, using either a geometric method or a new directed projective interval arithmetic.

KW - Directed projective interval arithmetic

KW - Hénon map

KW - Interval arithmetic

KW - Strange attractors

KW - Strongly connected components

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

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

U2 - 10.1142/S0218195906001914

DO - 10.1142/S0218195906001914

M3 - Article

AN - SCOPUS:33644527908

SN - 0218-1959

VL - 16

SP - 27

EP - 39

JO - International Journal of Computational Geometry and Applications

JF - International Journal of Computational Geometry and Applications

IS - 1

ER -

Interval-based tracing of strange attractors

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this