Guaranteed Accuracy in Numerical Linear Algebra
days for Media Mail
delivery. Brand New,
Perfect Condit... [more] Please allow 4-14 business
days for Media Mail
delivery. Brand New,
Perfect Condition, 100%
Money Back Guarantee, Over
1,000,000 customers served [less]
Own This Book? Sell It
9780792323525
ISBN:0792323521
Publisher: Springer Summary: This volume deals with the theory of algorithms for solving systems of linear algebraic equations having a non-full-rank matrix of coefficients. This involves a range of interesting problems, such as the bidiagonalization of matrices, the computation of singular values and eigenvalues, procedures for the deflation of singular values, etc. The algorithms which are discussed in this book lead to computer programs, whic [read more]- 30-Day No-Hassle Returns
- Fast, Same-Day Customer Service
- The Best Prices on Textbook Rentals
- Find student loan options quickly and easily
- Compare loans to find the best fit for you
- Apply for the loan that meets your needs
9780792323525
ISBN:
0792323521
Publisher: Springer
This volume deals with the theory of algorithms for solving systems of linear algebraic equations having a non-full-rank matrix of coefficients. This involves a range of interesting problems, such as the bidiagonalization of matrices, the computation of singular values and eigenvalues, procedures for the deflation of singular values, etc. The algorithms which are discussed in this book lead to computer programs, which guarantee the accuracy of the computations, leading to unambiguous solutions. Some of the algorithms and techniques described are new; for example, the bounds which include underflow effects. Also discussed is a new approach for computing reliable eigenvectors from Sturm sequences of a symmetric tridiagonal matrix, and a procedure for characterizing unitary transformations which maintain Hessenberg form. For researchers whose work involves numerical methods of linear algebra.
- Track your recent orders.
- See our shipping rates & policies.
- Return an item (here's our Return Policy).
