E. Anderson
University of Tennessee
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by E. Anderson.
conference on high performance computing (supercomputing) | 1990
E. Anderson; Z. Bai; Jack J. Dongarra; A. Greenbaum; A. McKenney; J. Du Croz; S. Hammarling; James Demmel; Christian H. Bischof; Danny C. Sorensen
The goal of the LAPACK project is to design and implement a portable linear algebra library for efficient use on a variety of high-performance computers. The library is based on the widely used LINPACK and EISPACK packages for solving linear equations, eigenvalue problems, and linear least-squares problems, but extends their functionality in a number of ways. The major methodology for making the algorithms run faster is to restructure them to perform block matrix operations (e.g., matrix-matrix multiplication) in their inner loops. These block operations may be optimized to exploit the memory hierarchy of a specific architecture. The LAPACK project is also working on new algorithms that yield higher relative accuracy for a variety of linear algebra problems. >
Archive | 1992
E. Anderson; Zhaojun Bai; Christian H. Bischof; James Demmel; Jack J. Dongarra; J. Du Croz; A. Greenbaum; S. Hammarling; A. McKenney; Susan Ostrouchov; Danny C. Sorensen
LAPACK is a transportable library of Fortran 77 subroutines for solving the most common problems in numerical linear algebra: systems of linear equations, linear least squares problems, eigenvalue problems and singular value problems. LAPACK is designed to supersede LINPACK and EISPACK, principally by restructuring the software to achieve much greater efficiency on vector processors, high-performance ``superscalar`` workstations, and shared-memory multi-processors. LAPACK also adds extra functionality, uses some new or improved algorithms, and integrates the two sets of algorithms into a unified package. The LAPACK Users` Guide gives an informal introduction to the design of the algorithms and software, summarizes the contents of the package, describes conventions used in the software and documentation, and includes complete specifications for calling the routines. This edition of the Users` guide describes Release 1.0 of LAPACK.
Philadelphia: Society for Industrial and Applied Mathematics | 1999
E. Anderson; Zhaojun Bai; Christian H. Bischof; Susan Blackford; James Demmel; Jack J. Dongarra; Jeremy Du Croz; A. Greenbaum; Sven Hammarling; A. McKenney; Danny C. Sorensen
Archive | 1999
E. Anderson; Z. Bai; Christian H. Bischof; L. S. Blackford; James Demmel; Jack J. Dongarra; J. Du Croz; Sven Hammarling; A. Greenbaum; A. McKenney; Danny C. Sorensen
siam conference on parallel processing for scientific computing | 1991
E. Anderson; Annamaria Benzoni; Jack J. Dongarra; Steve Moulton; Susan Ostrouchov; Bernard Tourancheau; Robert A. van de Geijn
distributed memory computing conference | 1991
E. Anderson; Annamaria Benzoni; Jack Dongarra; Steve Moulton; Susan Ostrouchov; Bernard Tourancheau; R.A. van de Geijn
Archive | 1999
E. Anderson; Zhaojun Bai; Christian H. Bischof; Susan Blackford; James Demmel; Jack J. Dongarra; J. Du Croz; A. Greenbaum; S. Hammarling; A. McKenney
Archive | 1999
E. Anderson; Zhaojun Bai; Christian H. Bischof; L. S. Blackford; James Demmel; Jack J. Dongarra; J. Du Croz; A. Greenbaum; S. Hammarling; A. McKenney; Danny C. Sorensen
Archive | 1999
E. Anderson; Zhaojun Bai; Christian H. Bischof; L. S. Blackford; James Demmel; Jack J. Dongarra; J. Du Croz; A. Greenbaum; S. Hammarling; A. McKenney; Danny C. Sorensen
Archive | 1999
E. Anderson; Zhaojun Bai; Christian H. Bischof; L. S. Blackford; James Demmel; Jack J. Dongarra; J. Du Croz; A. Greenbaum; S. Hammarling; A. McKenney; Danny C. Sorensen