Lapack Users' Guide (Paperback, 3rd Revised edition)

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: a faster singular value decomposition computed by divide-and-conquer; faster routines for solving rank-deficient least squares problems: using QR with column pivoting; using the SVD based on divide-and-conquer; 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; faster routine for the symmetric eigen problem using "relatively robust eigenvector algorithm"; new simple and expert drivers for the generalized nonsymmetric eigenproblem, including error bounds; solver for generalized Sylvester equation, used in computational routines Each Users' Guide comes with a "Quick Reference Guide" card.

General

Imprint:	Society For Industrial & Applied Mathematics,U.S.
Country of origin:	United States
Series:	Software, Environments and Tools, No. 9
Release date:	1987
Authors:	E Anderson • Z Bai • C Bischof • S Blackford • J. Demmel • Jack Dongarra • J Du Croz • Anne Greenbaum • S. Hammarling • A Mckenney
Dimensions:	229 x 152 x 9mm (L x W x T)
Format:	Paperback - Trade
Pages:	428
Edition:	3rd Revised edition
ISBN-13:	978-0-89871-447-0
Categories:	Books > Science & Mathematics > Mathematics > Algebra > General Books > Computing & IT > Computer software packages > Other software packages > Mathematical & statistical software
LSN:	0-89871-447-8
Barcode:	9780898714470

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!