NA Digest Sunday, September 11, 1994 Volume 94 : Issue 37

Today's Editor:
Cleve Moler
The MathWorks, Inc.
moler@mathworks.com

Submissions for NA Digest:

Mail to na.digest@na-net.ornl.gov.

Information about NA-NET:

Mail to na.help@na-net.ornl.gov.

-------------------------------------------------------


From: Ulla Miekkala <ulla@lammio.hut.fi>
Date: Wed, 7 Sep 94 09:35:23 +0200
Subject: Honorary Doctorate for Germund Dahlquist

Professor Germund Dahlquist was granted the title of Honorary Doctor of
Technology at Helsinki University of Technology on Friday, Sept. 9, 1994,
in recognition of his outstanding research within numerical mathematics
and for his promotion of this research area in Nordic countries.


On this occasion prof. Dahlquist gave a talk at the Institute of Mathematics
of HUT, the abstract of which follows.


"On a Summation Formula of E.Lindelo"f and Related Orthogonal Polynomials."

Abstract:

In E.Lindelo"f's book "Calcul des Residus", several formulas due to
Plana, Abel and (probably) Lindelo"f himself, are given for the transformation
of a slowly convergent (or even a divergent) series to a complex integral. We
shall see that this can be very efficiently computed by a Gauss-Christoffel
formula for a weight function that is independent of the particular series. In
this way, the summation formulas give about the same accuracy as the Epsilon
algorithm of P.Wynn with about the same amount of computation.

For one of these formulas the orthogonal polynomials, from which the
abscissas and weights in the integration formula are obtained, satisfy a
very neat recurrence formula with integer coefficients. This simplifies the
accurate computation of the abscissas and weights.

Ulla Miekkala


------------------------------

From: Bala V. Vaddi <bvaddi@Eng.Auburn.EDU>
Date: Thu, 8 Sep 1994 15:20:43 -0500
Subject: Parallelization of SQP

Hello everybody:
Has anyone developed a parallel version of "Sequential Quadratic Programming
Algorithm (any version)" for any of the machines CRAY, CM2, CM5, nCube 2, etc.?
If so, would you please pass on the references. Thank you for your earliest
attention.

Bala V. Vaddi
bvaddi@eng.auburn.edu
Dept. of chemical Engg.
Auburn University, Auburn, AL 36830.
205-844-2045.


------------------------------

From: G. Anastassiou <ANASTASG@hermes.msci.memst.edu>
Date: 7 Sep 94 13:22:47 CDT
Subject: New Address for George Anastassiou

George Anastassiou new coordinates:

Professor Dr.George A.Anastassiou
Department of Mathematical Sciences
The University of Memphis
Memphis,TN 38152
U.S.A
Tel.(901)-678-3144 office
(901)-678-2482 secretary
(901)-678-2480 FAX
(901)-371-9752 home
E-Mail:anastasg@hermes.msci.memst.edu


------------------------------

From: Gabriel Wittum <wittum@iwr1.iwr.uni-heidelberg.de>
Date: Tue, 6 Sep 1994 22:04:31 +0200
Subject: Change of Address for Gabriel Wittum

Please note my new address in Stuttgart

Gabriel Wittum
ICA/Numerik
Universitaet Stuttgart
Pfaffenwaldring 27
70550 Stuttgart
Germany

Tel.: +49 - 711 - 685 7090
Fax.: +49 - 711 - 685 7000
email: wittum@ica.uni-stuttgart.de

Mail sent to my old address in Heidelberg, will
reach me with a longer delay.


------------------------------

From: Anthony Chronopoulos <chronos@aalap.cs.wayne.edu>
Date: Fri, 9 Sep 94 11:11:38 EDT
Subject: Temporary Address Change for Anthony Chronopoulos

For the year 1994-1995, my address has changed as follows:

Anthony Theodore Chronopoulos
Department of Computer Science
Wayne State University
State Hall 431
5143 Cass Avenue
Detroit, MI 48202
Phone Number: (313) 577-0731
E-Mail: chronos@cs.wayne.edu


------------------------------

From: Edmond Nadler <enadler@math.wayne.edu>
Date: Fri, 9 Sep 94 09:18:53 EDT
Subject: New Address for Edmond Nadler

Dear Colleagues,

Effective immediately, I can be reached as follows:

Edmond Nadler
Cimatron Ltd.
11 Gush Etzion Street
Givat Shmuel 51905
Israel

email ed@cimatron.co.il
tel. 972-3-531-2131
fax 972-3-531-2140
tel. 972-3-924-2211 (H)


------------------------------

From: Saeed Abbasbandy <babolian%IREARN.BITNET@utkvm1.utk.edu>
Date: Sun, 11 Sep 1994 15:48:03 -0305
Subject: Seeking a Research Position

I am seeking a research position for 6 months in Numerical Methods for
Linear First Kind Integral Equations and Linear Integro-Differential
Equations. I am Ph.D. student and finished Ph.D. courses in Institute of
Mathematics from T.T.U. University at IRAN.
I would be happy to send my CV and reprints of my published papers to
anybody interested.

Thanks for your attention.

Saeed Abbasbandy
Institute of Mathematics,
Teacher Training University,
599 Taleghani Avenue,
Tehran 15614,
IRAN.
Email : babolian@irearn.bitnet


------------------------------

From: Panos Pardalos <pardalos@math.ufl.edu>
Date: Tue, 6 Sep 1994 10:08:37 -0400
Subject: New Book on Quadratic Assignment Problems

Title: QUADRATIC ASSIGNMENT AND RELATED PROBLEMS
Panos M. Pardalos, Henry Wolkowicz, editors.

Publication Info: Providence, R.I. : American Mathematical Society, 1994.
Series Name: DIMACS series in discrete mathematics and theoretical
computer science ; v. 16

ISBN 0-8218-6607-9

The book can be ordered from AMS: 800-321-4267


------------------------------

From: Per Ling <Per.Ling@cs.umu.se>
Date: Fri, 9 Sep 1994 14:26:26 +0200 (MET DST)
Subject: GEMM-Based Level 3 BLAS

I am pleased to announce that the GEMM-Based Level 3 BLAS are now
available from netlib.

GEMM-Based Level 3 BLAS

Bo Kagstrom and Per Ling
Department of Computing Science
Umea University
S-901 87 Umea, Sweden

Charles Van Loan
Department of Computer Science
Cornell University
Ithaca, New York 14853-7501

1. High Performance Model Implementations

The GEMM-Based Level 3 BLAS concept utilizes the fact that it is
possible to formulate the Level 3 BLAS operations in terms of the
Level 3 operation for general matrix multiply and add, _GEMM, and
some Level 1 and Level 2 BLAS operations.
The GEMM-Based Level 3 BLAS model implementations are written in
Fortran 77 and designed to be highly efficient on machines with a
memory hierarchy. They are primarily intended for a single processor
on machines with local or global caches and micro processors with
on-chip caches. But they can also be parallelized using a
parallelizing compiler or parallel underlying BLAS kernels. All
routines are effectively structured to reduce data traffic in a
memory hierarchy.
The user supplies underlying routines, the Level 3 BLAS routine
_GEMM and some Level 1 and Level 2 BLAS kernels. If they are
efficiently optimized for the target machine, the GEMM-Based Level 3
BLAS model implementations offer:

o efficient use of vector instructions (compound instructions,
chaining, etc.), through _GEMM, Level 1 and Level 2 BLAS
routines.

o vector register reuse, through _GEMM and Level 2 BLAS
routines.

o efficient cache reuse, through internal blocking, use of local
arrays, and through _GEMM.

o column-wise referencing, for problems that would cause severe
performance degradation with row-wise referencing (except for
reference patterns in underlying BLAS routines).

o parallelism, through automatic parallelization by a compiler,
or by using parallel underlying BLAS kernels.

o a Level 3 BLAS library based on unconventional underlying
matrix multiply algorithms like, for example, Strassens or
Winograds algorithms.


2. GEMM-Based Level 3 BLAS Benchmark

The GEMM-Based Level 3 BLAS Benchmark is a tool for performance
evaluation of Level 3 BLAS implementations. With the announcement of
LAPACK, the need for high performance Level 3 BLAS became apparent.
LAPACK is based on calls to Level 3 BLAS routines. This benchmark
measures and compares performance of user-supplied and permanently
built-in Level 3 BLAS kernels. The built-in GEMM-Based Level 3 BLAS
kernels provide a lower limit on the performance to be expected from
a highly optimized Level 3 BLAS library.
The user-supplied Level 3 BLAS implementations are linked with the
benchmark program. When the program executes, timings are performed
according to specifications given in an input file. The user may
design his/her own tests or use the enclosed input files. The
following output results are optionally presented:

A. A collected mean value result, calculated from the performance
results of each of the user-supplied routines.

B. Tables, showing performance results in megaflops for each
routine and problem configuration and performance comparisons
between different routines.

The purpose of (A) is to provide a performance measure for Level 3
BLAS kernels covering each of the routines and a significant problem
suit. The result should be easy to compare between different
implementations and different machines. We propose two standard tests
with different problem configurations, _MARK01 and _MARK02, which are
enclosed as input files.
The tables in (B) are intended for program developers and others
who are interested in detailed performance information and
performance comparisons between the routines.
All routines are written in Fortran 77 for portability. No changes
should be necessary to run the program correctly on different target
machines.


3. Availability

The source code for the model implementations and the benchmark
program comes in single, double, complex, and double complex
precision data types and is freely available via netlib. Send an
e-mail with the following message

send index
send index from blas/gemm_based

to netlib@research.att.com, for further information on how to obtain
the programs.
The programs are also available via anonymous ftp from
ftp.cs.umu.se. See the file gemm_based.tar.Z under the directory pub.

For further information see:

Kagstrom B. and Van Loan C. "GEMM-Based Level-3 BLAS", Tech. rep.
CTC91TR47, Department of Computer Science, Cornell University,
Dec. 1989.

Kagstrom B., Ling P. and Van Loan C. "High Performance GEMM-Based
Level-3 BLAS: Sample Routines for Double Precision Real Data",
in High Performance Computing II, Durand M. and El Dabaghi F.,
eds., Amsterdam, 1991, North-Holland, pp 269-281.

Kagstrom B., Ling P. and Van Loan C. "Portable High Performance
GEMM-Based Level 3 BLAS, in R. F. Sincovec et al, eds., Parallel
Processing for Scientific Computing, SIAM Publications, 1993,
pp 339-346.


------------------------------

From: Jack Dongarra <dongarra@cs.utk.edu>
Date: Mon, 5 Sep 1994 19:59:53 -0400
Subject: European PVM Users' Group Meeting

CALL FOR PAPERS
First
European PVM Users' Group Meeting
Rome, Italy
October 9-11 1994, Universita' di Roma, Rome

Sponsored by
IBM European Center for Scientific and Engineering Computing
Ecole Normale Superieure de Lyon CASPUR-Universita' di Roma

The first European PVM Users Group Meeting will be held October 9 to
11, 1994, at the Conference Room of the University of Rome, Via Salaria
113, Rome, Italy.
The meeting will provide an opportunity for European users of PVM to
meet each other, share ideas and experiences, and meet some of the
members of the PVM Team.

The conference will include:
* Invited talks by:
Wolfgang Gentzsch (Genias, Germany),
Vaidy Sunderam (Emory University),
Bernard Tourancheau (LIP, France),
* Contributed papers from the PVM user community.
* Technical presentations by the developers of PVM.
(Including a feedback session on future directions and features)
* Vendor presentations on supported PVM products.
* Social activities.
* Tutorial Session (Sunday 9th) by:
Adam Beguelin (CMU, USA),
Robert Manchek (UT, USA).

There will be Conference Registration/Reception at the conference
location. The registration desk opens, for the tutorial session, at
9:00 AM on Sunday and at 9:00 AM on Monday for the conference.

We invite everyone with PVM ideas or experiences to submit abstracts
of papers and posters for possible presentation at the Users' Group meeting.
List of topics includes (but is not limited to):
The PVM system:
Tools, Libraries, Extensions and Improvements,
Vendors Implementations, Programming Environments
....
Algorithms:
Numerical Kernels, Scheduling and Load Balancing,
Benchmarking and Pseudo-Applications
....
Real-world Parallel Applications:
CFD, Image Processing, Structural Analysis,
Chemistry, Aerodynamics
....

Authors are requested to submit a 4-pages extended abstract before
September 15, 1994. Abstracts will be reviewed and authors notified of
their acceptance by October 1.

Abstracts should be submitted in postscript form
by e-mail to europvm@lip.ens-lyon.fr.

For additional information send email to netlib@www.netlib.org
and in the email type:
send euro-pvmug94 from pvm3


------------------------------

From: Bruno Lang <lang@wmai02.math.uni-wuppertal.de>
Date: Wed, 7 Sep 94 10:36:40 +0200
Subject: First Announcement for SCAN-95 conference

First Announcement
SCAN-95
IMACS/GAMM International Symposium on
Scientific Computing, Computer Arithmetic, and Validated Numerics
September 26 - 29, 1995
Bergische Universitaet Wuppertal, Germany

Conference Themes:

Numerical and algorithmic aspects of Scientific Computing with
a strong emphasis on the algorithmic validation of results and
on algorithmic and arithmetic tools for this purpose.
"Validation" means qualitative and quantitative assertions
about computed results which are correct in a rigorous
mathematical sense, e.g.

- specification of a domain which contains a solution to a
given problem
- computation of close upper and lower bounds for the solutions
of a problem.

SCAN-95 will provide a forum for the

- presentation of the latest research and developments in
theory, algorithms, and arithmetic design for Validated
Numerics
- demonstration of software for Validated Numerics
- reporting of interesting case studies in industrial and
scientific applications of Validated Numerics.

Conference Site:

Wuppertal, home of the world's unique suspension railway
system, is located 50 km east from Cologne, Germany.

Format:

Plenary sessions for highlighted talks, mostly by invitation
(40 min).
Parallel sessions for contributed papers (25 min).

Important Dates:

*** NOW *** send your electronic AND POSTAL address to

scan95@math.uni-wuppertal.de

to be included in the mailing list for the
second announcement (February 1995)

April 30, 1995 deadline for submitting extended abstracts
for contributed papers

July 15, 1995 deadline for conference registration

September 26, 1995 SCAN-95 starts

Scientific Committee:

G. Alefeld (Karlsruhe), A. Frommer (Wuppertal),
G. Heindl (Wuppertal), R.B. Kearfott (Lafayette),
D. Matula (Dallas), G. Mayer (Rostock), S. Shary (Krasnoyarsk),
H.-J. Stetter (Vienna), T. Yamamoto (Matsuyama)

Organizing Committee:

A. Frommer, B. Lang (Wuppertal)


------------------------------

From: laeld@math.liu.se (Lars Elde'n)
Date: Thu, 8 Sep 94 17:07:59 +0200
Subject: Conference in Honor of Ake Bjorck

FINAL ANNOUNCEMENT
CALL FOR PAPERS AND REGISTRATION INFORMATION

In celebration of Ake Bjorck's 60'th birthday a conference will be
held at Linkoping University, January 9-10, 1995. The theme of the
conference will be

LEAST SQUARES METHODS: THEORY, ALGORITHMS and APPLICATIONS

The following speakers have agreed to give a talk:

Iain Duff Gene Golub Chris Paige Haesun Park
Mike Saunders Pete Stewart Charles Van Loan Jim Varah

CALL FOR PAPERS: There will be a number of contributed 20 min. talks.
No conference proceedings will be published. There are two ways to
submit an abstract:
a) send it by mail to Lars Elde'n at the address below.
b) send an abstract (ASCII file or LATEX) by email to laeld@math.liu.se
Participants and contributors should notice the following dates.

September 25, 1994 Deadline for abstract submission
October 15, 1994 Notification of acceptance
January 9-10, 1995 Conference

A conference dinner and birthday party will be held on the evening of
Monday, January 9.

REGISTRATION: If you want to receive registration forms etc, please
send a message to either of the addresses below. On request, conference
information will also be distributed by ordinary mail. In addition,
forms can be obtained by anonymous ftp (math.liu.se in directory
pub/conference), or via WWW with URL http://math.liu.se/Num/conference/
There will be a registration fee of 850 SEK, covering meals (including
conference dinner) and refreshments (present rate of exchange: 1 US
dollar equals 7.7 SEK). A number of hotel rooms have been reserved for the
conference. We encourage early registration, since due to other
arrangements in Linkoping, the availability of hotel rooms, apart from
those already reserved, may be limited.

CORRESPONDENCE should be addressed to either:

Lars Elde'n Theresia Petersson
Department of Mathematics Conference secretary
Linkoping University Same address as Lars Elde'n
S-581 83 Linkoping, Sweden
e-mail: laeld@math.liu.se thpet@math.liu.se
Phone: +46 13 28 21 83 +46 13 28 14 02
Fax: +46 13 10 07 46 +46 13 10 07 46

ORGANIZING COMMITTEE: Lars Elde'n and Tommy Elfving, Linkoping, Gene
Golub, Stanford, Bo Kagstrom, Umea, and Axel Ruhe, Gothenburg.

NOTE: January 11-13, 1995, a symposium will be held in Stockholm to
celebrate Germund Dahlquist's 70'th birthday. This will be announced
separately. For information, contact Lennart Edsberg, edsberg@nada.kth.se


------------------------------

From: D. F. Griffiths <dfg@mcs.dundee.ac.uk>
Date: Fri, 9 Sep 94 13:11:27 BST
Subject: Dundee NA Conference, 1995

16th
BIENNIAL CONFERENCE
ON
NUMERICAL ANALYSIS

UNIVERSITY OF DUNDEE, SCOTLAND, UK
27-30th June 1995

The A R Mitchell lecture will this year be given by

Professor K W Morton (Oxford)

Other Principal Speakers will include

G H Golub A Griewank D F Griffiths
R Jeltsch C Johnson W Light
B N Parlett L Petzold R D Russell
J M Sanz-Serna D J Silvester E Suli
M H Wright J Zowe

A limited number of submitted papers will be presented. Full
details of submission dates, conference fees, etc. will be
available towards the end of 1994 and posted on the na-net.
They may also be obtained by writing to either
Dr D F Griffiths or Professor G A Watson:

The Organizing Secretaries
Biennial Conference on Numerical Analysis
Department of Mathematics and Computer Science
The University
Dundee, DD1 4HN
Scotland, UK

Tel: +44 (382) 344467 e-mail: dfg@uk.ac.dund.mcs
FAX: +44 (382) 201604 or: na.griffiths@na-net.ornl.gov

The conference will be preceded on Monday, 26th June by the
Leslie Fox Prize meeting at which candidates shortlisted for the prize
will present talks.

Information will be available to www users through the URL

file://ftp.mcs.dundee.ac.uk/pub/na-conf/

and to ftp users at the site
ftp.mcs.dundee.ac.uk
in the directory pub/na-conf. The directory pub/na-reports
also holds a list of Dundee Numerical Analysis Reports since
1984. It is intended that abstracts of forthcoming reports will also
be located in this directory.


------------------------------

From: R. Smith <R_SMITH@UPR1.UPR.CLU.EDU>
Date: Wed, 7 Sep 94 12:22 AST
Subject: Positions at University of Puerto Rico

University of Puerto Rico
Mayaguez Campus
Department of Mathematics

The Department of Mathematics of the University of Puerto Rico
anticipates several openings for tenure track positions for the
coming academic year. For two of the positions, we prefer
candidates with background in mathematics education and/or
computers. For the remaining positions we will consider
applicants in all areas. Candidates should have a doctorate. A
background in Spanish would be an advantage. Send resume' and
three letters of reference to:

Darrell W. Hajek
Interim Director
Department of Mathematics - UPR
Box 5000
Mayaguez, PR 00681-5000


------------------------------

From: Andy Philpott <ESC_PHILPOTT@ccnov2.auckland.ac.nz>
Date: 9 Sep 1994 9:51:19 GMT+1200
Subject: Postdoctoral Position at University of Auckland

THREE-YEAR POSTDOCTORAL POSITION IN MATHEMATICAL PROGRAMMING

Department of Engineering Science
University of Auckland
Auckland, New Zealand

The Department of Engineering Science, University of Auckland
is seeking to fill an available Postdoctoral position in
Mathematical Programming from January 1995 to December 1997.
The position will be financed by the New Zealand Foundation of Research,
Science and Technology.
The purpose of this research fellowship is to investigate the application of
interior-point methods to problems arising in integer programming and
stochastic linear programming problems. The emphasis will be on seeking
ways of exploiting structure in interior-point methods to produce fast codes
for specially structured members of these classes of problem.

We are looking for a candidate with a doctorate in Mathematical
Programming, Operations Research or a related discipline where
Mathematical Optimization is an essential part of the candidate's
background. In addition it will be required that the candidate has
experience in the implementation of mathematical programming codes in
Fortran and (or) C.

The salary will be (NZ)39,500 dollars per annum ((NZ)1.00 dollar = (US)0.60
dollars). Up to (NZ)2500 dollars is available for relocation expenses.
Candidates who wish to apply should send a copy of their resume to

Professor David Ryan
Department of Engineering Science
University of Auckland
Private Bag 92019
Auckland
New Zealand

along with the names and addresses (including email addresses if possible)
of two referees who may be contacted to give a confidential appraisal of the
candidate.

The closing date for applications is October 15, 1994.

Further information and details of the research proposal can be obtained
from

Professor D.M. Ryan (ryan@esu2.auckland.ac.nz)
or Dr A.B. Philpott (a.philpott@auckland.ac.nz).
Dr Andrew B. Philpott
Department of Engineering Science
University of Auckland
Private Bag 92019
Auckland
New Zealand

Ph: 64-9-373-7599 Ext 8394
Fax: 64-9-373-7468


------------------------------

From: Panos Pardalos <pardalos@math.ufl.edu>
Date: Tue, 6 Sep 1994 10:04:55 -0400
Subject: Contents, Journal of Global Optimization

Table of Contents
JOURNAL OF GLOBAL OPTIMIZATION (Kluwer Academic Publishers)
Vol. 5 No. 2 (1994)


H. EDWIN ROMEIJN and ROBERT L. SMITH / Simulated Annealing for Constrained
Global Optimization
101-126.

DING-ZHU DU and PANOS M. PARDALOS / A Continuous Version of a Result of Du
and Hwang
127-129.

M. VOLLE / Calculus Rules for Global Approximate Minima and Applications
to Approximate Subdifferential Calculus
131-157.

M. POGU and J. E. SOUZA DE CURSI / Global Optimization by Random
Perturbation of the Gradient Method with a Fixed Parameter
159-180.

M. M. KOSTREVA and QUAN ZHENG / Integral Global Optimization Method for
Solution of Nonlinear Complementarity Problems
181-193.

RUDOLF MATHAR and ANTANAS ZILINSKAS / A Class of Test Functions for Global
Optimization
195-199.

Book Reviews
A. LINBECK/ Nobel Lectures: Economic Sciences 1969-1980 and
K. MAELER/ Nobel Lectures: Economic Sciences 1981-1990 (P. PARDALOS)
J.MORE' and S. WRIGHT/ Optimization Software Guide (S. VAVASIS)


JOURNAL OF GLOBAL OPTIMIZATION (JOGO)

If you have access to ftp (or gopher) you can retrieve the JOGO aims & scope,
editorial board etc. in the file jogo.inf and the latest table of contents
in the file jogo.toc from the directory Kluwer/journals/mathematics.
The new address of the ftp server is ftp.std.com, to gopher world.std.com.

------------------------------

From: SIAM <nelson@siam.org>
Date: Thu, 08 Sep 94 11:43:12 EST
Subject: Contents, SIAM Matrix Analysis and Applications

Contents
SIAM J. ON MATRIX ANALYSIS AND APPLICATIONS

The Sparse Basis Problem and Multilinear Algebra
Richard A. Brualdi, Shmuel Friedland, and Alex Pothen

Duality and Black Box Interpolation I: The One Variable Nonderogatory Case
Vaidyanath Mani and Robert E. Hartwig

Existence and Uniqueness of Optimal Matrix Scalings
V. Balakrishnan and S. Boyd

On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
A. W. Bojanczyk, R. P. Brent, F. R de Hoog, and D. R. Sweet

Displacement Structure and Completion Problems
Tiberiu Constantinescu, Ali H. Sayed, and Thomas Kailath

A Divide and Conquer Algorithm for the Bidiagonal SVD
Min Gu and Stanley C. Eisenstat

On the Sensitivity of Solution Components in Linear Systems of Equations
S. Chandrasekaran and I.C.F. Ipsen

An Index Theorem for Monotone Matrix-Valued Functions
Werner Kratz

Computing Most Nearly Rank-Reducing Structured Matrix Perturbations
Mark Wicks and Raymond DeCarlo

Downdating the Rank-Revealing URV Decomposition
Haesun Par and Lars Elden

Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations
Marlis Hochbruck and Gerhard Starke

A Divide and Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
Ming Gu and Stanley C. Eisenstat

Algebraic Analysis of the Hierarchical Basis Preconditioner
Howard C. Elman and Xuejun Zhang

Constructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues
Moody T. Chu

Application of the Smith Normal Form to the Structure of Lattice Rules
J. N. Lyness and P. Keast

Strict Approximation of Matrices
K. Zietak

A Cartesian Parallel Nested Dissection Algorithm
Michael T. Heath and Padma Raghavan

On the Iterative Solution of Hermite Collocation Equations
Yu-ling Lai, Apostolos Hadjidimos, Elias N. Houstis, and John R. Rice

Perturbations, Singular Values, and Ranks of Partial Triangular Matrices
Leiba Rodman and Hugo J. Woerdeman

External Descriptions and Staircase Forms in Implicit Systems
Vassilis Syrmos, Petr Zagalak, and Vladimir Kucera

A Remark on Minc's Maximal Eigenvector Bound for Positive Matrices
Geoff A. Latham

On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric
Trnasforms in Matrix Displacement Decomposition
Enrico Bozzo and Carmine Di Fiore

New Perturbtion Bounds for the Unitary Polar Factor
Ren-Cang Li

Singular Values of Companion Matrices and Bounds on Zeros of Polynomials
Fuad Kittaneh


------------------------------

From: SIAM <tschoban@siam.org>
Date: Thu, 08 Sep 94 13:45:31 EST
Subject: Contents, SIAM Numerical Analysis

Contents
SIAM Journal on Numerical Analysis
Volume 31, Number 6, December 1994

The Chebyshev-Legendre Method: Implementing Legendre Methods on
Chebyshev Points
Wai Sun Don and David Gottlieb

Overcoming Holder Continuity in Ill-Posed Continuation Problems
Alfred S. Carasso

Invariant Manifolds and Singularly Perturbed Boundary Value Problems
S.-K. Tin, N. Kopell, and C. K. R. T. Jones

On the Convergence to Steady State of Solutions of Nonlinear
Hyperbolic-Parabolic Systems
Gunilla Kreiss, Heinz-Otto Kreiss, and N. Anders Petersson

Finite Difference Scheme for Parabolic Problems on Composite Grids
with Refinement in Time and Space
Richard E. Ewing, Raytcho D. Lazarov, and Apostol T. Vassilev

Preconditioning Nonconforming Finite Element Methods
Charles I. Goldstein

Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
Howard C. Elman and Gene H. Golub

Schwarz Analysis of Iterative Substructuring Algorithms for
Elliptic Problems in Three Dimensions
Maksymilian Dryja, Barry F. Smith, and Olof B. Widlund

Rigorous Quantitative Analysis of Multigrid, I: Constant
Coefficients Two-Level Cycle with L2-Norm
Achi Brandt

Multilevel Adaptive Methods for Elliptic Eigenproblems: A Two-Level
Convergence Theory
Stephen F. McCormick

Uniform Convergence of Multigrid V-Cycle Iterations for Indefinite
and Nonsymmetric Problems
James H. Bramble, Do Y. Kwak, and Joseph E. Pasciak

Multigrid Solution of the Incompressible Navier-Stokes Equations in
General Coordinates
S. Zeng and P. Wesseling

First-Order System Least Squares for Second-Order Partial
Differential Equations: Part I
Z. Cai, R. Lazarov, T. A. Manteuffel, and S. F. McCormick


------------------------------

From: SIAM <tschoban@siam.org>
Date: Fri, 09 Sep 94 11:38:55 EST
Subject: Contents, SIAM Review

Contents
SIAM Review
Volume 36, Number 4, December 1994

Articles

Systems of Convolution Equations, Deconvolution, Shannon Sampling,
and the Wavelet and Gabor Transforms
Stephen D. Casey and David F. Walnut

The P and H-P Versions of the Finite Element Method, Basic
Principles and Properties
Ivo Babuska and Manil Suri

Poynting's Vector: Comments on a Recent Paper by Clark Jeffries
F. N. H. Robinson

Response to a Commentary by F. N. H. Robinson
Clark Jeffries

Classroom Notes in Applied Mathematics

Symbolic Computations in Operations Research
Kevin Y. K. Ng

Odd-Even Factorization Results for Eigenvalue Problems
D. A. Nield

The Probability Integral Transform and Related Results
John E. Angus

Problems and Solutions

Book Reviews

A History of Complex Dynamics from Schroder to Fatou and Julia
(Daniel S. Alexander) R. B. Burckel
Nonlinear Ordinary Differential Equations (R. Grimshaw) Nathaniel
Chafee
The Theory of Linear Models (Bent Jorgensen) T. C. Chang
Large Sample Methods in Statistics: an Introduction with
Applications (Pranab K. Sen and Julio M. Singer) T. C. Chang
Invertible Point Transformations and Nonlinear Differential
Equations (Willi-Hans Steeb) Richard Churchill
Linear Programs and Related Problems (Evar D. Nering and Albert W.
Tucker) R. W. Cottle
Numerical Methods for Stochastic Control Problems in Continuous
Time (Harold J. Kushner and Paul G. Dupuis) T. E. Duncan
Hilbert's Tenth Problem (Y. V. Matiyasevich) Jens Erik Fenstad
Qualitative Theory of Dynamical Systems (L. Dingjun and T. Libang)
Kevin Hockett
Russian-English, English-Russian Dictionary on Probability,
Statistics, and Combinatorics (K. A. Borokov) R. Clarissa Howison
Numerical Computation Using C (Robert Glassey) David R. Kincaid
Numerical Methods Based on Sinc and Analytic Functions (Frank
Stenger) Kelly M. McArthur
Applied Integral Transforms (M. Ya. Antimirov, A. A. Kolyshin, and
Remi Vaillancourt) Gunter H. Meyer
Functional and Numerical Methods in Viscoplasticity (I. R. Ionescu
and M. Sofonea) N. H. Pavel
The Visual Mind (M. Emmer) Marjorie Senechal
An Introduction to the Bootstrap (Bradley Efron and Robert J.
Tibshirani) Siva Sivaganesan
Parallel Numerical Algorithms (T. L. Freeman and C. Philips) Henk
van der Vorst
Oriented Matroids (A. Bjorner, M. Las Vergnas, B. Sturmfels, N.
White, and G. Ziegler) Goeff Whittle
Time Series Analysis of Higher Order Crossings (B. Kedem) Sidney
Yakowitz
Interior-Point Polynomial Algorithms in Convex Programming (Y.
Nesterov and A. Nemirovskii) Yinyu Ye

Chronicle

Author Index





------------------------------

End of NA Digest

**************************
-------