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)
Computing the zeros and turning points of solutions of second order homogeneous linear ODEs. (English) Zbl 1056.65049
The authors present two algorithms for computing the zeros and turning points of solutions of second order ordinary differential equations (ODEs). Both algorithm rely on fixed point methods. The first one is based on the first-order systems associated with a set of second order ODEs, whilst for the second method the fixed point iterations stem from the second order ODEs. Moreover, it is shown that both methods are quadratically convergent. The efficiency of these methods as well as the combined methods is illustrated by different examples. Comparison with other algorithms is also provided.

65H05Single nonlinear equations (numerical methods)
65L05Initial value problems for ODE (numerical methods)
33F05Numerical approximation and evaluation of special functions
34A34Nonlinear ODE and systems, general
Full Text: DOI