BN.com Gift Guide

Fundamentals of Matrix Computations / Edition 3

Hardcover (Print)
Rent
Rent from BN.com
$32.86
(Save 75%)
Est. Return Date: 02/18/2015
Used and New from Other Sellers
Used and New from Other Sellers
from $100.46
Usually ships in 1-2 business days
(Save 23%)
Other sellers (Hardcover)
  • All (7) from $100.46   
  • New (5) from $100.46   
  • Used (2) from $179.94   

Overview

This new, modernized edition provides a clear and thorough introduction to matrix computations,a key component of scientific computing

Retaining the accessible and hands-on style of its predecessor, Fundamentals of Matrix Computations, Third Edition thoroughly details matrix computations and the accompanying theory alongside the author's useful insights. The book presents the most important algorithms of numerical linear algebra and helps readers to understand how the algorithms are developed and why they work.

Along with new and updated examples, the Third Edition features:

  • A novel approach to Francis' QR algorithm that explains its properties without reference to the basic QR algorithm
  • Application of classical Gram-Schmidt with reorthogonalization
  • A revised approach to the derivation of the Golub-Reinsch SVD algorithm
  • New coverage on solving product eigenvalue problems
  • Expanded treatment of the Jacobi-Davidson method
  • A new discussion on stopping criteria for iterative methods for solving linear equations

Throughout the book, numerous new and updated exercises—ranging from routine computations and verifications to challenging programming and proofs—are provided, allowing readers to immediately engage in applying the presented concepts. The new edition also incorporates MATLAB to solve real-world problems in electrical circuits, mass-spring systems, and simple partial differential equations, and an index of MATLAB terms assists readers with understanding the basic concepts related to the software.

Fundamentals of Matrix Computations, Third Edition is an excellent book for courses on matrix computations and applied numerical linear algebra at the upper-undergraduate and graduate level. The book is also a valuable resource for researchers and practitioners working in the fields of engineering and computer science who need to know how to solve problems involving matrix computations.

Read More Show Less

Editorial Reviews

Booknews
A textbook for graduate and advanced undergraduate students who are familiar with elementary linear algebra and conversant in a high-level programming language such as Fortran, Pascal, or C. Concerned with the teaching efficient and accurate matrix computations, which underlie most scientific computer codes. Annotation c. Book News, Inc., Portland, OR (booknews.com)
From The Critics
This text explains matrix computations and the accompanying theory in detail, for practicing scientists and graduate and advanced undergraduate students. This second edition makes use of MATLAB for many of the exercises and examples, although Fortran exercises from the first edition have been retained. The new edition contains a new chapter on iterative methods, and an introduction to new methods for solving large, sparse eigenvalue problems including the popular implicitly-restarted Arnoldi and Jacobi-Davidson methods. Watkins teaches mathematics at Washington State University. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

Meet the Author

DAVID S. WATKINS, PhD, is Professor in the Department of Mathematics at Washington State University. He has published more than 100 articles in his areas of research interest, which include numerical linear algebra, numerical analysis, and scientific computing.

Read More Show Less

Table of Contents

Preface.

Acknowledgments.

1 Gaussian Elimination and Its Variants.

1.1 Matrix Multiplication.

1.2 Systems of Linear Equations.

1.3 Triangular Systems.

1.4 Positive Definite Systems; Cholesky Decomposition.

1.5 Banded Positive Definite Systems.

1.6 Sparse Positive Definite Systems.

1.7 Gaussian Elimination and the LU Decomposition.

1.8 Gaussain Elimination and Pivoting.

1.9 Sparse Gaussian Elimination.

2 Sensitivity of Linear Systems.

2.1 Vector and Matrix Norms.

2.2 Condition Numbers.

2.3 Perturbing the Coefficient Matrix.

2.4 A Posteriori Error Analysis Using the Residual.

2.5 Roundoff Errors; Backward Stability.

2.6 Propagation of Roundoff Errors.

2.7 Backward Error Analysis of Gaussian Elimination.

2.8 Scaling.

2.9 Componentwise Sensitivity Analysis.

3 The Least Squares Problem.

3.1 The Discrete Square Problem.

3.2 Orthogonal Matrices, Rotators and Reflectors.

3.3 Solution of the Least Squares Problem.

3.4 The Gram-Schmidt Process.

3.5 Geometric Approach.

3.6 Updating the QR Decomposition.

4 The Singular Value Decomposition.

4.1 Introduction.

4.2 Some Basic Applications of Singular Values.

4.3 The SVD and the Least Squares Problem.

4.4 Sensitivity of the Least Squares Problem.

5 Eigenvalues and Eigenvectors I.

5.1 Systems of Differential Equations.

5.2 Basic Facts.

5.3 The Power Method and Some Simple Extensions.

5.4 Similarity Transforms.

5.5 Reduction to Hessenberg and Tridiagonal Forms.

5.6 Francis's Algorithm.

5.7 Use of Francis's Algorithm to Calculate Eigenvectors.

5.8 The SVD Revisted.

6 Eigenvalues and Eigenvectors II.

6.1 Eigenspaces and Invariant Subspaces.

6.2 Subspace Iteration and Simultaneous Iteration.

6.3 Krylov Subspaces and Francis's Algorithm.

6.4 Large Sparse Eigenvalue Problems.

6.5 Implicit Restarts.

6.6 The Jacobi-Davidson and Related Algorithms.

7 Eigenvalues and Eigenvectors III.

7.1 Sensitivity of Eigenvalues and Eigenvectors.

7.2 Methods for the Symmetric Eigenvalue Problem.

7.3 Product Eigenvalue Problems.

7.4 The Generalized Eigenvalue Problem.

8 Iterative Methods for Linear Systems.

8.1 A Model Problem.

8.2 The Classical Iterative Methods.

8.3 Convergence of Iterative Methods.

8.4 Descent Methods; Steepest Descent.

8.5 On Stopping Criteria.

8.6 Preconditioners.

8.7 The Conjugate-Gradient Method.

8.8 Derivation of the CG Algorithm.

8.9 Convergence of the CG Algorithm.

8.10 Indefinite and Nonsymmetric Problems.

References.

Index.

Index of MATLAB Terms.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)