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 linear algebra. (English) Zbl 0874.65013
Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. xii, 361 p. $ 34.50 (1997).
This is a text for an one-semester course for graduate students interested in applying methods from numerical linear algebra to scientific computational problems from natural and engineering sciences. The emphasis is on understanding the algorithms involved, the authors are eager to explain why things happen in a certain way, and often use well-chosen small numerical examples. The text is organised into 40 lectures in a pedagogically interesting order, each giving a new aspect, but still selfcontained enough to be readable separately. Topics covered include (in this order): Vectors and matrices: orthogonality, norms, singular value decomposition (SVD) QR factorization, Gram Schmidt, Householder, least squares. Conditioning, floating point arithmetic, stability. Systems of equations: Gauss elimination, pivoting, stability, Cholesky. Eigenvalues: reduction to Hessenberg form, QR algorithm, algorithm for SVD. Iterative algorithms: Arnoldi, GMRES, Lanczos, conjugate gradients.

65FxxNumerical linear algebra
65-01Textbooks (numerical analysis)