J. Dongarra, A. Lumsdaine, R. Pozo, and K. A. Remington. IML++ v. 1.2: Iterative Methods Library Reference Guide, April 1996. Available at http://math.nist.gov/iml++/. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
OoLaLa: an Object Oriented Analysis and Design of.. - Luján, Freeman, Gurd (2000) (1 citation) (Correct)
....and discussions, the following aspects have been omitted: the class of the elements of matrices; constructors, and methods that query the attributes. The syntax for declaring attributes and methods is a relaxed Java like syntax. Library References LAPACK [37, 38, 32, 60] SparseLib and IML [30, 78, 31, 85, 53] Paladin [48, 49] JLAPACK [14, 15, 26] OwlPack [20, 19, 18, 24] MTL and ITL [80, 81, 83, 79, 82, 59, 58] PMLP [11, 12, 51] Di pack [17, 75] ISIS [2, 27] Sparspak or Sparspak90 [45] Oblio and Spindle [29, 28, 57] JAMA [68] Jampack [88, 25] BPKIT [21, 22, 23] Table 2: Object ....
J. Dongarra, A. Lumsdaine, R. Pozo, and K. A. Remington. IML++ v. 1.2: Iterative Methods Library Reference Guide, April 1996. Available at http://math.nist.gov/lapack++/.
A Modern Framework for Portable High Performance Numerical Linear.. - Siek (1999) (6 citations) (Correct)
....the optimization does not clutter the algorithm code, but instead the change is encapsulated in the copy block matrix class. Chapter 7 Iterative Template Library (ITL) The Iterative Template Library is collection of sophisticated iterative methods written in C (similar to the IML Library [24]) It contains methods for solving both symmetric and non symmetric linear systems of equations, many of which are described in [4] The ITL methods were constructed in a generic style, allowing for maximum flexibility and separation of concerns about matrix data structure, performance ....
....the iterative method code. This was a significant factor in our ability to implement and optimize such a large group of iterative methods in short time (4 man months) CHAPTER 7. ITERATIVE TEMPLATE LIBRARY (ITL) 85 7. 3 ITL Performance This section compares the performance of the ITL with IML [24], one of the few other comprehensive iterative method packages (which uses SparseLib [26] for the sparse basic linear algebra) Six matrices from the Harwell Boeing collection are used. Computation time (in seconds) per iteration is plotted in Figure 7.4 for each of the following methods: CGS, ....
J. Dongarra, A. Lumsdaine, R. Pozo, and K. A. Remington. Iterative Methods Library Reference Guide, v. 1.2 edition, 1997.
Solving Irregular Sparse Linear Systems On A Multicomputer Using .. - Manneback (Correct)
....methods and preconditioners from which the user can experiment. For sequential architectures, such a toolkit is the so called Templates for the solution of linear systems: building blocks for iterative methods [2] This work has been extended to an object oriented C environment as IML [5]. A major benefit of this package is that it is easy to use, allowing the user to rapidly test and determine which method is the most convenient for a particular application. Unfortunately, until recently there were no similar packages for distributed memory architectures. Some emerging work ....
.... Squared method (CGS) 18] ffl Generalized Minimal Residual method (GMRES) with a restart value of 32 implemented with the modified Gram Schmidt approach [17] ffl BiConjugate Gradient Stabilized method (Bi CGSTAB) 20] ffl Quasi Minimal Residual method (QMR) 9] We ran the IML code [5] of these methods, using ILU preconditioners. The convergence tolerance was set at 10 Gamma6 . With the exception of the sherman1 and sherman5 test problems, all methods fail to converge after 2000 iterations, except for sherman1 and sherman5 problems, for which the iteration count is ....
J. Dongarra, A. Lumsdaine, R. Pozo and K. Remington, IML++ v. 1.2, Iterative methods library reference guide, NIST Washington, ORNL, Univ. of Notre Dame and Univ. of Tennessee at Knoxville, May 1995.
A Framework for Parallel Adaptive Finite Element Methods.. - Gerlach, Sato, Ishikawa (Correct)
....for the solution of sparse linear problems depend only on general matrix and vector operation and don t need direct access to their elements. This is exploited in the design of general solver libraries like IML which make no assumptions about the data format of the vector and matrix classes [5]. After overloading the basic numerical operators for our vector and matrix classes and providing the preconditioners with a solve method, we were able to use this library of C template functions. We encountered one problem when using the IML library, since it uses sometimes vector ....
J. Dongarra, A. Lumsdainm, R. Pozo, K. Ramington: IML++ v.1.2 Iterative Methods Library Reference Guide, available at http://math.nist.gov/iml++/
Oolala - From Numerical Linear Algebra To Compiler Technology For .. - Moreno (2002) (Correct)
No context found.
J. Dongarra, A. Lumsdaine, R. Pozo, and K. A. Remington. IML++ v. 1.2: Iterative Methods Library Reference Guide, April 1996. Available at http://math.nist.gov/iml++/.
Declaration - Include Ilupre (Correct)
No context found.
J. J. Dongarra, A. Lumsdaine, R. Pozo, and K. A. Remington, IML++ Iterative Methods Library Reference Guide, http://gams.nist.gov/acmd/Staff/RPozo/sparselib++.html, 1994.
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