International Linear Algebra Year 
BIT : special issues for ILAY

The first issue (BIT Volume 36, No. 3, 1996), edited by Francoise Chaitin-Chatelin, contains papers related to the Workshop on Eigenvalues and Stability. The second issue (BIT Volume 37, No. 3, September 1997), edited by Iain Duff, Nick Gould, Luc Giraud, and Craig Douglas, contains papers from the ILAY Workshops on Direct Methods, Iterative Methods, and Linear Algebra in Optimization. The contents of both journals are given below.

You can get your copy of BIT 36:3 for US $30. Alternatively, get the issue for free if you make an indvidual subscription to BIT for 1997, which will include also the second special issue. The reduced individual subscription price is US $90 (regular $180), and applies only on condition that the subscription is paid by a private person using a private mailing address.

Send your order with a check or money order enclosed to: BIT Numerical Mathematics, Postbox 113, DK-1004 Copenhagen K, DENMARK (FAX +45-33 12 50 33).

Contents BIT Volume 36, No. 3, 1996

Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
J. Baglama, D. Calvetti, and L. Reichel, pp. 400-421

Computing the field of values and pseudospectra using the Lanczos method with continuation
T. Braconnier and N. J. Higham, pp. 422-440

A curve tracing algorithm for computing the pseudospectrum
M. Brühl, pp. 441-454

Convergence in finite precision of successive iteration methods under high nonnormality
F. Chaitin-Chatelin and S. Gratton, pp. 455-469

Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
J. Cullum, pp. 470-493

On conjugate gradient-like methods for eigen-like problems
A. Edelman and S. T. Smith, pp. 494-508

An inverse iteration method using multigrid for quantum chemistry
J.-L. Fattebert, pp. 509-522

On the condition number of linear least squares problems in a weighted Frobenius norm.
S. Gratton, pp. 523-530

Meromorphic resolvents and power bounded operators
O. Nevanlinna, pp. 531-541

Invariant subspaces for tightly clustered eigenvalues of tridiagonals
B. N. Parlett, pp. 542-562

Solution of large eigenvalue problems in electronic structure calculations
Y. Saad, A. Stathopoulos, J. Chelikowsky, K. Wu, and S. Ögüt, pp. 563-578

Arnoldi-Riccati method for large eigenvalue problems
V. Simoncini and M. Sadkane, pp. 579-594

Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
G. L. G. Sleijpen, A. G. L. Booten, D. R. Fokkema, and H. A. Van der Vorst, pp. 595-633

Contents BIT Volume 37, No. 3, 1997

Matrix enlarging methods and their application
F. L. Alvarado

Using domain decomposition to find graph bisectors
C. Ashcraft and J. W. H. Liu

Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
P. C. Hansen, Tz. Ostromsky, A. Sameh, and Z. Zlatev

Two improved algorithms for envelope and wavefront reduction
G. Kumfert and A. Pothen

A greedy algorithm for the optimal basis problem
O. Burdakov

A proximal point algorithm for minimax problems
A. Dax

Multigrid methods for the computation of singular solutions and stress intensity factors II: Crack singularities
S. C. Brenner and L.-Y. Sung

Wavelet sparse approximate inverse preconditioners
T. F. Chan, W. P. Tang, and W. L. Wan

A characterization of mapping unstructured grids onto structured grids and using multigrid as a preconditioner
C. C. Douglas, S. Malhotra, and M. H. Schultz

An accelerated domain decomposition procedure based on Robin transmission conditions
J. Douglas, Jr. and C.-S. Huang

Matrices, moments and quadrature II; how to compute the norm of the error in iterative methods
G. H. Golub and G. Meurant

Numerical behaviour of the modified Gram-Schmidt GMRES implementation
A. Greenbaum, M. Rozloznik, and Z. Strakos

Two different approaches for matching nonconforming grids: the mortar element method and the FETI method
C. Lacour and Y. Maday

Patch-adaptive multilevel iteration
H. Lötzbeyer and U. Rüde

Nonlinear structural finite element analysis using the preconditioned Lanczos method on serial and parallel computers
Th. Rottner, I. Lenhardt, G. Alefeld, and K. Schweizerhof