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)
Numerical analysis. An introduction. (English) Zbl 0877.65001
Boston: Birkhäuser. xiii, 506 p. DM 118.00; öS 862.00; sFr 98.00 (1997).

No doubt, this is an excellent book of 506 pages on Numerical analysis written by an experienced teacher and researcher in this area. So, what are the differences to other existing excellent and classical books on this subject? As the author states, the first four chapters (Machine arithmetic and related matters, Approximation and interpolation, Numerical differentiation and integration, Nonlinear equations) could serve as a text for a basic introductory course and the three remaining chapters (One- and multistep methods and Two-point boundary value problems for ordinary differential equations) could provide a text for some advanced course. Therefore the appendix “An introduction” is misleading.

Nevertheless, the concept will be OK for a graduate program in Numerical analysis in the U.S.A. which is completed by courses at least on Numerical linear algebra. In Germany, if not in Europe, it ought to be more common to include in such a textbook Gaussian elimination and basic iterative methods for linear systems of equations, overdetermined linear systems, and adaptive numerical integration and hence to reduce the size of the last three chapters.

65-01Textbooks (numerical analysis)
65DxxNumerical approximation and computational geometry (primarily algorithms)
65HxxNonlinear algebraic or transcendental equations (numerical methods)
65LxxNumerical methods for ODE