Garratt, T. J. (1990). Private communication. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Arnoldi code for computing selected eigenvalues of sparse real.. - Scott (1995) (20 citations) (Correct)
....of their characteristics are listed in Table 4.2. For more details of the origins of these problems the user is referred to Duff et al. 1992) The only test problems used which are not currently included in the Harwell Boeing set are GRT200, GRT400, and TOLSA. GRT200 and GRT400 were supplied by Garratt (1990, 1991) These matrices arise from the detection of Hopf bifurcation points and the main concern for these problems is not the exact values of the eigenvalues but whether the right most eigenvalue lies in the left or right hand plane. As already noted, for the TOLOSA matrix, the eigenvalues of ....
Garratt, T. J. (1990). Private communication.
Computing Selected Eigenvalues of Sparse Unsymmetric Matrices.. - Duff, Scott (1993) (9 citations) (Correct)
....is found after 2541 matrix vector products and 76.6 seconds CPU time. This is an example which illustrates that it can be advantageous to set r to be larger than the number of eigenvalues actually required. The results we obtained for Example 2 using EB12 compare favourably with those obtained by Garratt (1991) using Chebychev acceleration techniques. 15 Table 3.2. A comparison of the simple subspace iteration algorithm and the Chebychev accelerated algorithm for Example 2 (left most eigenvalues) Matrix vector CPU l Iterations max products time n r m Simple Chebychev Simple Chebychev Simple ....
Garratt, T. J. (1991) Private communication.
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