The Theory of Matrices in Numerical Analysis and over 2 million other books are available for Amazon Kindle . Learn more
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

The Theory of Matrices in Numerical Analysis Paperback – Jul 1975


See all 7 formats and editions Hide other formats and editions
Amazon Price New from Used from
Kindle Edition
"Please retry"
Hardcover
"Please retry"
£10.63
Paperback, Jul 1975
£37.15 £0.01
Unknown Binding
"Please retry"
--This text refers to an alternate Paperback edition.


Product details

  • Paperback: 257 pages
  • Publisher: Dover Publications Inc.; New edition edition (July 1975)
  • Language: English
  • ISBN-10: 0486617815
  • ISBN-13: 978-0486617817
  • Product Dimensions: 20.9 x 14.4 x 1.5 cm
  • Amazon Bestsellers Rank: 3,896,493 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, and more.

Inside This Book (Learn More)
Browse and search another edition of this book.
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Customer Reviews

There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: 1 review
8 of 12 people found the following review helpful
A classic 5 Jun 2008
By Uttar - Published on Amazon.com
Format: Paperback
Table of contents

1. SOME BASIC IDENTITIES AND INEQUALITIES
1.0 Objectives; Notation
1.1 Elementary Matrices
1.2 Some Factorizations
1.3 Projections, and the General Reciprocal
1.4 Some Determinantal Identities
1.5 Lanczos Algorithm for Tridiagonalization
1.6 Orthogonal Polynomials
References
Problems and Exercises

2. NORMS, BOUNDS, AND CONVERGENCE
2.0 The Notion of a Norm
2.1 Convex Sets and Convex Bodies
2.2 Norms and Bounds
2.3 Norms, Bounds, and Spectral Radii
2.4 Nonnegative Matrices
2.5 Convergence; Functions of Matrices
References
Problems and Exercises

3. LOCALIZATION THEOREMS AND OTHER INEQUALITIES
3.0 Basic Definitions
3.1 Exclusion Theorems
3.2 Inclusion and Separation Theorems
3.3 Minimax Theorems and the Field of Values
3.4 Inequalities of Wielandt Kantorovich
References
Problems and Exercises

4. THE SOLUTION OF LINEAR SYSTEMS: METHODS OF SUCCESSIVE APPROXIMATION
4.0 Direct Methods and Others
4.1 The Inversion of Matrices
4.2 Methods of Projection
4.3 Norm-Reducing Methods
References
Problems and Exercises

5. DIRECT METHODS OF INVERSION
5.0 Uses of the Inverse
5.1 The Method of Modification
5.2 Triangularization
5.3 A More General Formulation
5.4 Orthogonal Triangularization
5.5 Orthogonalization
5.6 Orthogonalization and Projection
5.7 The Method of Conjugate Gradients
References
Problems and Exercises

6. PROPER VALUES AND VECTORS: NORMALIZATION AND REDUCTION OF THE MATRIX
6.0 Purpose of Normalization
6.1 The Method of Krylov
6.2 The Weber-Voetter Method
6.3 The Method of Danilevskii
6.4 The Hessenberg and the Lanczos Reductions
6.5 Proper Values and Vectors
6.6 The Method of Samuelson and Bryan
6.7 The Method of Leverrier
References
Problems and Exercises

7. PROPER VALUES AND VECTORS: SUCCESSIVE APPROXIMATION
7.0 Methods of Successive Approximation
7.1 The Method of Jacobi
7.2 The Method of Collar and Jahn
7.3 Powers of a Matrix
7.4 Simple Iteration (the Power Method)
7.5 Multiple Roots and Principal Vectors
7.6 Staircase Iteration (Treppeniteration)
7.7 The LR-Transformation
7.8 Bi-iteration
7.9 The QR-Transformation
References
Problems and Exercises

BIBLIOGRAPHY
INDEX
Was this review helpful? Let us know


Feedback