zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Quasilinearization for initial value problems involving differential equations with “maxima”. (English) Zbl 1255.65128
Summary: An approximate method for solving initial value problems for first order scalar nonlinear differential equations with “maxima” is given. This method uses lower and upper solutions of the given problem, and in a sense is a variant of the method of quasilinearization. The main features of proposed method are that it is constructive in nature, and the obtained successive approximations of the unknown solution converge quadratically. Each successive approximation is a solution of an appropriately chosen initial value problem. In fact, a new scheme for constructing the initial value problems is suggested. An example which illustrates the advantages of the suggested algorithm is also included.
MSC:
65L05Initial value problems for ODE (numerical methods)
34K05General theory of functional-differential equations