A numerically accessible criterion for the breakdown of quasi-periodic solutions and its rigorous justification (Q4930115)
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 5792541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A numerically accessible criterion for the breakdown of quasi-periodic solutions and its rigorous justification |
scientific article; zbMATH DE number 5792541 |
Statements
A numerically accessible criterion for the breakdown of quasi-periodic solutions and its rigorous justification (English)
0 references
28 September 2010
0 references
quasi-periodic solution
0 references
breakdown of analyticity
0 references
numerically efficient algorithm
0 references
implicit function theorem
0 references
Sobolev norm
0 references
0.7665988206863403
0 references
0.7538269758224487
0 references
0.7272680997848511
0 references
0.7234143018722534
0 references
0.6965985894203186
0 references
