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...
Moon Bag [Black]
R57 Discovery Miles 570
Datadart Nylon Stems-Small
R19 Discovery Miles 190
Elektra Health 8075 Electrode Hot Steam…
 (9)
R700 R569 Discovery Miles 5 690
Alva 3-Panel Infrared Radiant Indoor Gas…
R1,499 R1,199 Discovery Miles 11 990
Bostik Glu Dots - Extra Strength (64…
R55 Discovery Miles 550
Mountain Backgammon - The Classic Game…
Lily Dyu R575 R460 Discovery Miles 4 600
Sony PlayStation Portal Remote Player…
R5,299 Discovery Miles 52 990
Samsung EO-IA500BBEGWW Wired In-ear…
R299 R199 Discovery Miles 1 990
Spider-Man: 5-Movie Collection…
Tobey Maguire, Kirsten Dunst, … Blu-ray disc  (1)
R466 Discovery Miles 4 660
Bug-A-Salt 3.0 Black Fly
 (1)
R999 Discovery Miles 9 990

 

Partners