### Table 5: Storage requirements and elapsed solution time for vari- ous problem sizes using a complex-symmetric pro le solver (with- out pivoting) on a Sun SPARCstation10. Mesh (Unknowns) Storage (Mbytes) Solution time (min:s)

1995

"... In PAGE 26: ... very e ective for sequential machines. Table5 presents the storage requirements and elapsed times for performing direct solution of various problem sizes using a complex-symmetric pro le solver. A compar- ison of these direct solution times with iterative solution times presented in Tables 3-4 demonstrates that even for large two-dimensional problems, iterative solution using hierarchical basis preconditioners is faster by about 3 to 6 times depending on the frequency of analysis.... ..."

Cited by 8

### Table 1 are extensions of these three basic solutions, and have direct relevance to the

"... In PAGE 13: ... Such a control may be maintained through evaluation of management on the basis of (i) technical competence, leadership and administrative ability, (ii) compliance with regulations and statutes, (iii) ability to plan and respond to changing circumstances, (iv) adequacy of and compliance with internal policies, (v) depth and succession, (vi) tendencies towards self-dealing, and (vii) demonstrated willingness to serve the legitimate needs of the community 13 . Table1 presents a summary of these strategies. 3.... ..."

### Table 14: Direct coarse grid solution, test4.i We now look at a V1;1 multigrid cycle with a direct coarse grid solver. Take some band matrix or sparse matrix data structure and apply a direct solver. Take care

1996

Cited by 6

### TABLE III Solution parameters.

### TABLE III Experimental statistics

2001

Cited by 82

### Table 1: Solution time for an anisotropic problem with two orderings. Solution Ordering

1995

"... In PAGE 3: ... A zero initial guess was used, and the matrix was solved to a reduction of 10?12 in the l2 norm of the residual. Table1 shows the solution time when the matrix was ordered in two ways: natural x-y ordering numbered the nodes in the x direction rst, and natural y-x ordering numbered the nodes in the y direction rst. Theorem 1 will show why the incomplete factorization in the x-y direction was poorer, despite both preconditioners having the same level of ll, and... ..."

Cited by 16

### Table 1: Confusion matrix for recognition of walking direction

1999

"... In PAGE 5: ...Table 1: Confusion matrix for recognition of walking direction walking-directions are shown in Table1 . Each column shows the best matches for each sequence.... ..."

Cited by 112