Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9780898714470 Academic Inspection Copy

LAPACK Users' Guide

Description
Table of
Contents
Sales
Points
Google
Preview
LAPACK is a library of numerical linear algebra subroutines designed for high performance on workstations, vector computers and shared memory multiprocessors. Release 3.0 of LAPACK introduces new routines and extends the functionality of existing routines. The most significant new routines and functions include: 1) a faster singular value decomposition computer by divide-and-conquer; 2) faster routines for solving rank-deficient least squares problems - using QR routines with column pivoting, using the SVD based on divide-and-conquer; 3) new routines for the generalized symmetric eigenproblem - faster routines based on divide-and-conquer, routines based on bisection/inverse iteration, for computing part of the spectrum; 4) faster routine for the symmetric eigenproblem using "relatively robust eigenvector algorithm"; 5) new simple and expert drivers for the generalized nonsymmetric eigenproblem, including error bounds; and 6) solver for generalized Sylvester equation, used in 5) 7) computational routines used in 5).
Preface to the Third Edition Preface to the Second Edition Part 1: Guide. Chapter 1: Essentials Chapter 2: Contents of LAPACK Chapter 3: Performance of LAPACK Chapter 4: Accuracy and Stability Chapter 5: Documentation and Software Conventions Chapter 6: Installing LAPACK Routines Chapter 7: Troubleshooting Appendix A: Index of Driver and Computational Routines Appendix B: Index of Auxiliary Routines Appendix C: Quick Reference Guide to the BLAS Appendix D: Converting from LINPACK or EISPACK Appendix E: LAPACK Working Notes Part 2: Specifications of Routines. Bibliography Index by Keyword Index by Routine Name.
Royalties form the sale of this book are contributed to the SIAM Student Travel Fund.
Google Preview content