zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A general procedure for the adaptation of multistep algorithms to the integration of oscillatory problems. (English) Zbl 0916.65081

Consider the scalar initial value problem (IPV) in the closed finite interval [a, b] as follows:

P(D)y(x)=f(x,y),D=d dx,y(a)=y o ,,y (m-1) (a)=y o (m-1) ,(1)

where f is a continuous function with continuous derivatives till a certain order m+k and satisfying all conditions for the existence and uniqueness of solutions. P(D) is the operator (D-λ 1 )(D-λ m ), λ 1 ,,λ m are real or complex conjugate constants. The paper presents a general procedure allowing to construct multistep methods with coefficients depending on the step for the exact integration of both homogeneous linear problem and nonhomegenous IVP (1) without truncation error. f is supposed to be a certain Fourier polynomial in one or more frequencies resulting in oscillator solution. Such an algorithm is denoted as adapted to (1). It combines the integration of both the linear part and a particular solution of the complete problem.

The study of methods adapted to linear equations is presented in a unified way especially with respect to consistency and convergence. The results are valid for all presented examples and different existing methods. The adaptation of a multistep code to the exact solution of a forced oscillator in one frequency includes a new procedure for the computation of coefficients. The exact integration of oscillators in two or more frequencies which are confluent or non-confluent include general formulae for the calculation of the coefficients and the local truncation error. Numerical examples illustrate efficiency of the derived results. Some of the ideas are related to the adaptation of the Chebyshev methods without multistep character by J. Panovsky and D. L. Richardson [J. Comput. Appl. Math. 23, 35-51 (1988; Zbl 0649.65048)].

65L06Multistep, Runge-Kutta, and extrapolation methods
65L05Initial value problems for ODE (numerical methods)
34A34Nonlinear ODE and systems, general
34C10Qualitative theory of oscillations of ODE: zeros, disconjugacy and comparison theory