A collocation method for the numerical Fourier analysis of quasi-periodic functions. I: Numerical tests and examples (Q986639): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.3934/dcdsb.2010.14.41 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3934/dcdsb.2010.14.41 / rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987206780 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3934/dcdsb.2010.14.41 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987206780 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.3934/DCDSB.2010.14.41 / rank | |||
Normal rank |
Latest revision as of 11:21, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A collocation method for the numerical Fourier analysis of quasi-periodic functions. I: Numerical tests and examples |
scientific article |
Statements
A collocation method for the numerical Fourier analysis of quasi-periodic functions. I: Numerical tests and examples (English)
0 references
11 August 2010
0 references
This paper, the first one in a series of two consecutive papers in this journal, describes the implementation of a very accurate and efficient method for the numerical computation of frequencies and amplitudes of quasi-periodic functions. In the second paper of the series a complete error analysis of the methodology is presented. For most of the details the paper is self-contained. After an introduction, Section 2 introduces notation and considers in detail issues like leakage and aliasing that have to be taken into account in the procedure. Section 3 is devoted to the methodology and algorithmics. The Fourier analysis procedure consists of essentially three steps: {\parindent=6mm \begin{itemize}\item[1.] First approximation of frequencies by means of a FFT conveniently filtered. \item[2.] Computation of approximate amplitudes from the approximated frequencies by means of a collocation method in the frequency domain. \item[3.] Simultaneous improvement of frequencies and amplitudes by means of an iterative algorithm. \end{itemize}} The iterative part prevents some frequencies to hide nearby ones of lower amplitude, and the whole procedure is exact in the determination of the spectrum for finite trigonometric polynomials (except for roundoff). In the case of an infinite number of frequencies (linear combination of a basic set), the procedure provides high accuracy when determining a finite set of the important ones. Also an algorithm for the determination of the basic frequencies is given. Section 4 of the paper provides a couple of very illustrative and detailed examples to show the robustness of the procedure, the first and simplest one considering a short trigonometric polynomial and the second one for a two-parameter family of quasi-periodic functions including Gaussian noise in the data. Using the procedure, in Section 5 and 6 the paper analyzes a couple of examples where the purpose is to illustrate the use of frequency analysis as an indicator of regular and chaotic orbits in Taylor-Chirikov-like standard maps and the analysis of the stability region about \(L_5\) for a Sun-Jupiter RTBP. The discussions about results and numerical computations of these sections and others given in Section 7 are worth reading independently.
0 references
numerical Fourier analysis
0 references
fast Fourier transform
0 references
collocation method
0 references
quasi-periodic functions
0 references