An algorithmic approach to the Conley index theory (Q1961334)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1389698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic approach to the Conley index theory |
scientific article; zbMATH DE number 1389698 |
Statements
An algorithmic approach to the Conley index theory (English)
0 references
17 January 2000
0 references
The paper is devoted to the following questions: (1) Can the techniques which were developed to prove chaos in the Lorenz system be applied to other problems in differential equations? (2) For a given continuous dynamical system and a compact set, is it possible to verify in finite time whether the set is an isolating neighborhood? To this end the author introduces a class of representable sets and multivalued representable maps which may be performed by an algorithm. Using these objects the author investigates questions (1) and (2) mentioned above.
0 references
Conley index
0 references
chaos
0 references
isolating neighborhood
0 references
0.9470874
0 references
0.87725294
0 references
0.86712146
0 references
