| J. J. Dongarra, C. B. Moler, J. R. Bunch, G. W. Stewart, LINPACK User's Guide, SIAM, Philadelphia (1979). |
....patterns found in real scientific codes. Scalar and instruction references are assumed to hit in the cache, and all stream references use non caching loads and stores. Our benchmark suite is depicted in Figure 2. Daxpy, copy, scale, and swap are from the BLAS (Basic Linear Algebra Subroutines) [Law79, Don79]. These vector and matrix computations occur frequently in scientific applications, thus they have been collected into a set of library routines that are highly optimized for various host architectures. Hydro and tridiag are the first and fifth Livermore Loops [McM86] a set of kernels culled ....
Dongarra, J.J., et. al., "Linpack User's Guide", SIAM, Philadelphia, 1979.
....the requisite knowledge without requiring any understanding of compilation techniques and without unduly corrupting the abstract programming model provided by the language. DGEFA is a LINPACK subroutine and a principal computational kernel in the LINPACKD bench mark developed by Dongarra et al. [5]. It performs LU decomposition using Gaussian elimination with partial pivoting. The algorithm, shown in Figure 3a, consists of selecting the largest element as the pivot for a particular column k, computing the row reduction factors for step k by dividing the column elements by the pivot value, ....
J. DONGARRA, J. BUNCH, C. /[OLER, AND G. STEWART, LINPACK User's Guide, SIAM Publications, Philadelphia, PA, 1979.
....that out paces the memory s ability to transfer data. Scalar and instruction accesses are assumed to hit in the cache for the same reason. 5. Benchmark Suite The benchmark kernels used are described in Figure 2. Daxpy, copy, scale, and swap are from the BLAS (Basic Linear Algebra Subroutines) [Law79, Don79]. These vector and matrix computations occur frequently in scientific computations, thus they have been collected into libraries of highly optimized routines for various host architectures. Hydro and tridiag are the first and fifth Livermore Loops [McM86] a set of kernels culled from ....
Dongarra, J.J., et. al., "Linpack User's Guide", SIAM, Philadelphia, 1979.
....algorithms, in particular in numerical linear algebra. The increasing availability of advanced architecture computers has had a signi cant e ect on scienti c computing, including algorithm research and software development especially in numerical linear algebra. The eispack [235] and linpack [79] software libraries were designed for supercomputers used in the 1970 s and early 1980 s. matlab was elaborated as a teaching tool during the period 1977 1984 by Cleve B. Moler at the University of New Mexico. The development of lapack [8] in the late 1980 s was intended to make the eispack and ....
J.J. Dongarra, J.R. Bunch, C.B. Moler, G.W. Stewart, Linpack User's Guide, SIAM, Philadelphia, 1979.
....the estimation of its range and null space, which are exactly the quantities we are trying to estimate. 13 4 Empirical Evaluation of the Proposed Approach We have implemented the linear subspace approach proposed in Section 3 using the LINPACK public domain package for numerical linear algebra [ Dongarra et al. 1979 ] This section discusses the results of our experiments with real and synthetic data. 4.1 Experiments Using Real Data The real data used in our experiments were kindly provided by Boubakeur Boufama; they consist of point matches between pairs of images of a house model (data sets H(a) and ....
J.J. Dongarra, J.R. Bunch, C.B. Moler, and G.W. Stewart. LINPACK User's Guide. Philadelphia, 1979.
....using linear least squares. Thus the whole epipolar geometry can be recovered through linear computations. 4 Empirical Evaluation of the Proposed Approach We have implemented the linear subspace approach proposed in Section 3 using the LINPACK public domain package for numerical linear algebra [ Dongarra et al. 1979 ] This section discusses the results of our experiments with real and synthetic data. 4.1 Experiments Using Real Data The real data used in our experiments were kindly provided by Boubakeur Boufama; they consist of point matches between pairs of images of a house model (data sets H(a) and ....
J.J. Dongarra, J.R. Bunch, C.B. Moler, and G.W. Stewart. LINPACK User's Guide. Philadelphia, 1979.
....L. Crout s method is usually preferred. The kernel of the LU decomposition may be programmed column oriented (kji version) a (i, k) a (i, k) a (k, k) do j=k l, n a(i, j) a(i, j) a(i,k) a(k, j) In the innermost loop the columns of A are used This algorithm is used in the LINPACK ([6]) algorithm sgefa. The innermost loop can be performed by a single call to the BLAS routine saxpy. Each cycle of the k loop represents the rank one modification (k) l( u( where ( is the (n k)x(n k) submatrix, l( is col umn k of L and u( k)r is the k th row of U. This may be realized ....
J.J. Dongan'a, C.B. Moler, J.R. Bunch and G.W. Stewart, LINPACK user's guide, SIAM, Philadelphia, 1979.
....numbers are missing because of lack of data) All performance numbers reflect arithmetic performed in full precision (usually 64 bit) unless noted. On some machines full precision may be single precision, such as the Cray, or double precision, such as the IBM. The first number is for the LINPACK [1] benchmark program for a matrix of order 100 in a Fortran environment. The second number is for solving a system of equations of order 1000, with no restriction on the method or its implementation. The third number is the theoretical peak performance of the machine. LINPACK programs can be ....
J. Dongarra, J. Bunch, C. Moler, and G. W. Stewart. LINPACK User's Guide. SIAM, Philadelphia, PA, 1979.
No context found.
J. J. Dongarra, C. B. Moler, J. R. Bunch, G. W. Stewart, LINPACK User's Guide, SIAM, Philadelphia (1979).
No context found.
J. J. Dongarra, C. B. Moler, J. R. Bunch, and G. W. Stewart, LINPACK User's Guide. Philadelphia, PA: SIAM, 1979.
No context found.
Dongarra J. J., Bunch J., Moler C., Stewart G. W.: Linpack User's Guide. SIAM Press, Philadelphia 1979.
No context found.
J.J. Dongarra, J. Bunch, C. Moler, and G.W.Stewart. LINPACK User's Guide. SIAM, Philadelphia, PA 1979
No context found.
J. Dongarra, J. Bunch,, C.Moler and G.W. Stewart. LINPACK User's Guide. SIAM, Philadelphia, PA 1979
No context found.
J. J. Dongarra, C. B. Moler, J. R. Bunch, and G. W. Stewart, LINPACK User's Guide, SIAM, (1979).
No context found.
J.J. Dongarra, J.R. Bunch, C.B. Moler, and G.W. Stewart, LINPACK User's Guide, Philadelphia, PA: SIAM, 1979.
No context found.
J.J. Dongarra, J.R. Bunch, C.B. Moler, and G.W. Stewart, LINPACK User's Guide. Philadelphia, PA: SIAM, 1979.
No context found.
J. J. Dongarra, J. R. Bunch, C. B. Moler and G. W. Stewart, LINPACK user's guide, SIAM, Philadelphia (1979).
No context found.
J. J. Dongarra, J. R. Bunch, C. B. Moler and G. W. Stewart, LINPACK user's guide (SIAM, Philadelphia, 1979).
No context found.
J.J. Dongarra, J.R. Bunch, C. Moler and G.W. Stewart, Linpack User's Guide, SIAM Philadelphia (1979).
No context found.
J. Dongarra, J. Bunch, C. Moler, and G. W. Stewart. LINPACK User's Guide. SIAM, Philadelphia, PA, 1979.
No context found.
Dongarra, J.J., et. al., "Linpack User's Guide", SIAM, Philadelphia, 1979.
No context found.
J. Dongarra, J. Bunch, C. Moler, and G. W. Stewart. LINPACK User's Guide. SIAM, Philadelphia, PA, 1979.
No context found.
Dongarra, J.J., et. al., "Linpack User's Guide", SIAM, Philadelphia, 1979.
No context found.
J. J. Dongarra, J. Bunch, C. B. Moler, and G. W. Stewart, LINPACK User's Guide, SIAM, Philadelphia, 1979.
No context found.
J. Dongarra, J. R. Bunch, C. B. Moler, and G. W. Stewart. LINPACK User's Guide. SIAM, 1979.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC