Why Newton's method is hard for travelling waves: small denominators, KAM theory, Arnold's linear Fourier problem, non-uniqueness, constraints and erratic failure (Q871062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.matcom.2006.10.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021848228 / rank | |||
Normal rank | |||
Revision as of 20:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Why Newton's method is hard for travelling waves: small denominators, KAM theory, Arnold's linear Fourier problem, non-uniqueness, constraints and erratic failure |
scientific article |
Statements
Why Newton's method is hard for travelling waves: small denominators, KAM theory, Arnold's linear Fourier problem, non-uniqueness, constraints and erratic failure (English)
0 references
15 March 2007
0 references
nonlinear equations
0 references
bifurcation
0 references
small denominators
0 references
fifth-order Korteweg-de Vries equation
0 references
KAM theory
0 references
numerical examples
0 references
nonlinear travelling waves
0 references
Kolmogorov-Arnold-Moser theory
0 references
algorithms
0 references
