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 methods and software. With disc. (English) Zbl 0744.65002
Prentice-Hall Series in Computational Mathematics. Englewood Cliffs, NJ: Prentice-Hall. xii, 495 p. (1989).

A major motivation for writing this text was to update and expand the material in the book by G. E. Forsythe, M. A. Malcolm, and the second author [Computer methods for mathematical computations (1977; Zbl 0361.65002)]. We liked its philosophy and informal style as well as the inclusion of programs. Our original intent was to produce a revision of that book but with Forsythe deceased and Malcolm involved in other activities the current authors decided to begin afresh. The publisher granted us permission to extract those portions of the original book that seemed appropriate. In practice this meant that several of the problems have been retained. The text is almost all new, although we were certainly inspired by the original. We would also like to acknowledge our debt to all those authors who have written on this subject before us; perhaps we may have made a few matters a little clearer or a little sounder. {From the preface}

Contents: 1. Introduction; 2. Computer arithmetic and computational errors; 3. Linear systems of equations; 4. Interpolation; 5. Numerical quadrature; 6. Linear least-squares data fitting; 7. Solutions of nonlinear equations; 8. Ordinary differential equations; 9. Optimization and nonlinear least squares; 10. Simulation and random numbers; 11. Trigonometric approximation and the fast Fourier transform.

65-01Textbooks (numerical analysis)
65HxxNonlinear algebraic or transcendental equations (numerical methods)
65LxxNumerical methods for ODE
65KxxNumerical methods in mathematical programming and optimization
65CxxProbabilistic methods, simulation and stochastic differential equations (numerical analysis)
65TxxNumerical methods in Fourier analysis
65FxxNumerical linear algebra
65DxxNumerical approximation and computational geometry (primarily algorithms)