0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Lapack 95 Users' Guide (Paperback): V.A. Barker, L.S. Blackford, J. Dongarra, J Du Croz, S. Hammarling, M. Marinova, J.... Lapack 95 Users' Guide (Paperback)
V.A. Barker, L.S. Blackford, J. Dongarra, J Du Croz, S. Hammarling, …
R2,389 Discovery Miles 23 890 Ships in 12 - 17 working days

LAPACK95 is a Fortran 95 interface to the Fortran 77 LAPACK library. It is relevant for anyone who writes in the Fortran 95 language and needs reliable software for basic numerical linear algebra. It improves upon the original user-interface to the LAPACK package, taking advantage of the considerable simplifications that Fortran 95 allows. LAPACK95 Users' Guide provides an introduction to the design of the LAPACK95 package, a detailed description of its contents, reference manuals for the leading comments of the routines, and example programs

Lapack Users' Guide (Paperback, 3rd Revised edition): E Anderson, Z Bai, C Bischof, S Blackford, J. Demmel, Jack Dongarra,... Lapack Users' Guide (Paperback, 3rd Revised edition)
E Anderson, Z Bai, C Bischof, S Blackford, J. Demmel, …
R2,278 Discovery Miles 22 780 Ships in 12 - 17 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Amphibious Soul - Finding The Wild In A…
Craig Foster Paperback R380 R255 Discovery Miles 2 550
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Casio LW-200-7AV Watch with 10-Year…
R999 R884 Discovery Miles 8 840
Professor Snape Wizard Wand - In…
 (8)
R832 Discovery Miles 8 320
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Bestway Beach Ball (51cm)
 (2)
R26 Discovery Miles 260
Venom 2: Let There Be Carnage
Tom Hardy, Woody Harrelson, … DVD R156 Discovery Miles 1 560
Bostik Glu Dots - Extra Strength (64…
R55 Discovery Miles 550
Croxley Create Wood Free Colouring…
R29 Discovery Miles 290
Home Quip Stainless Steel Double Wall…
R181 Discovery Miles 1 810

 

Partners