NA Digest Sunday, November 10, 1996 Volume 96 : Issue 42

Today's Editor:
Cleve Moler
The MathWorks, Inc.

Submissions for NA Digest:

Mail to

Information about NA-NET:

Mail to

URL for the World Wide Web: -------------------------------------------------------

From: Michael Overton <overton@OVERTON.CS.NYU.EDU>
Date: Mon, 4 Nov 1996 08:43:53 -0500 (EST)
Subject: Positive Semidefinite Constraints

In response to last week's question about positive semidefinite matrix
constraints: the semidefinite restriction should be imposed as a constraint
on the symmetric matrix variable. Although this constraint is not
differentiable, it is convex and can be handled extremely efficiently by
interior-point optimization methods. A good reference is Vandenberghe and
Boyd's survey article in SIAM Review, March 1996, p.49.

-- Michael Overton


From: Edmond Nadler <>
Date: Thu, 7 Nov 1996 10:45:58 +0200
Subject: Change of Address for Edmond Nadler

Fellow NA-Netters,

I have moved to a new company involved in computer vision,
where I'm responsible for CAD.

Edmond Nadler

New contact information:

CogniTens Ltd.
P.O. Box 1713
Ramat HaSharon 47282

Telephone #s:
Office +972 3 547 2223
Fax +972 3 547 2224
Home +972 3 924 2211



From: Francoise Chtelin <>
Date: Fri, 8 Nov 1996 17:23:32 +0100 (MET)
Subject: Change of Address for Francoise Chatelin

Effective October 1, 1996, my new academic position is
Francoise Chatelin
Professor of Applied Mathematics
University of Social Sciences, Toulouse I

My professional address is
42 av. Gaspard Coriolis
31057 Toulouse Cedex
Ph: +33 (0)5 61 19 30 26
Fax: +33 (0)5 61 19 30 00


From: Daniel Zwillinger <>
Date: Fri, 08 Nov 1996 19:46:43 -0500
Subject: Update of Handbook of Differential Equations

My "Handbook of Differential Equations" (Academic Press, 1992) is
going into it's Third Edition. The Third Edition will include
sections on sympletic integration and the use of wavelets. If you can
think of any other topics that should be included, please let me know!
Newer references for existing chapters would also be appreciated.

An errata list for the second edition can be anonymous ftp'ed from (note that the 'zwilling' directory is
auto-mounted). If you are aware of any additional errata, would you
please let me know?


From: Jaap Hollenberg <>
Date: Thu, 7 Nov 1996 00:17:45 +0100
Subject: HPCN Conference Update

The HPCN 1997 Conference in Vienna (April 28 - 30) is taking shape. However,
due to some technical problems the HPCN97 WEB pages
( which contain all the submission
details were not available for some time. Therefore, after many requests,
the organising committee has decided to add 10 more days to the deadline.

We would really like to encourage you to submit a paper for this very
important event in HPCN!!

Deadline for submission is now November 19 1996.

Programme Secretariat (For submission only!!)
HPCN Europe 1997
Programme Secretariat
Laura Lotty
Kruislaan 403
1098 SJ Amsterdam
Fax. +31 20 5257490
More information can be find at:

For other questions please contact:

Conference Secretariat
HPCN Europe 1997
Conference Secretariat
Lodewijk Bos
Stationsstraat 38
3511 EG Utrecht
Tel. +31 30 2311038
Fax. +31 30 2321967


From: Leszek Plaskota <>
Date: Fri, 8 Nov 1996 11:11:10 +0100 (MET)
Subject: New Book on Noisy Information and Computational Complexity


`Noisy information and computational complexity'
by Leszek Plaskota
Cambridge University Press 1996

This is the first book in which noisy information is studied in
the context of computational complexity, in other words it deals with
the computational complexity of mathematical problems for which available
information is partial, noisy and priced. The author develops a general
theory of computational complexity of continuous problems with noisy
information and gives a number of applications; deterministic as well as
stochastic noise is considered. He presents optimal algorithms, optimal
information, and complexity bounds in different settings; worst case,
average case, mixed worst-average and average-worst, and asymptotic.
Particular topics include the existence of optimal linear (affine)
algorithms, optimality properties of smoothing spline, regularization
and least squares algorithms (with the optimal choice of the smoothing
and regularization parameters), adaption versus nonadaption, and
relations between different settings.

The book integrates the work of researchers over the last decade in such
areas as computational complexity, approximation theory and statistics,
and includes many new results as well. About two hundred exercises are
supplied with a view to increasing the reader's understanding of
the subject. The material is organized in such a way that it can be used
either as a textbook for advanced courses, or as a standard reference for
professional computer scientists, statisticians, applied mathematicians,
engineers, control theorists, and economists.

number of pages: 320
ISBN 0-521-55368-7
price: US$ 59.95, UK(pounds) 40.00.


From: David Watkins <>
Date: Fri, 08 Nov 96 14:23:57 -0800
Subject: Conference Report: ODE to Linear Algebra and Rational Approximation

ODE to Linear Algebra and Rational Approximation

On November 1st and 2nd, 1996, approximately fifty well wishers
gathered at the Naval Postgraduate School in Monterey, California,
to celebrate the 60th birthday of William B. Gragg (b. 7:01 am,
November 2nd, 1936, in Bakersfield, CA).

Over the years Bill Gragg has demonstrated a remarkable knack
for discovering connections between seemingly unrelated areas.
Examples are the connections between the Pade table, the Lanczos
algorithm, and the partial realization problem of linear system
theory and the connection between Levinson's algorithm for solving
Toeplitz systems and Szego's recursions for generating orthogonal
polynomials on the unit circle. The focus of the conference was on
these and other areas of mathematics and scientific computing where
Bill has made contributions, including ordinary differential
equations, linear algebra, and rational approximation. The broad
range of topics covered in the thirty-one presentations serves as a
strong testimony to Bill's influence. A complete summary of the
proceedings is beyond this correspondent's capacity, but a partial
list of topics will surely help to give the flavor: tridiagonals,
QR algorithm, SVD, moment matching, Pade conjecture,
Lanczos algorithms, Lanczos-Pade connection, partial realization,
orthogonal polynomials, control, Riccati equations,
unitary eigenvalue problem, fast Toeplitz (Hankel, Vandermonde,
Cauchy, etc.) solvers, isometric Arnoldi process, growth factors in
Gaussian elimination, and on and on. A complete list of speakers
and titles is available at the Gragg Conference Homepage:

One particularly memorable talk was Leslie Foster's presentation on
pivoting strategies for Gaussian elimination. Les produced a notebook
from a numerical analysis course that he took from Bill in the Fall of
1970 at UC San Diego. He displayed a page from the day on which Bill
had outlined some of the known facts about growth factors in Gaussian
elimination. Then he proceeded to inform us about the substantial
progress that has been made since 1970 in this active area.

We also enjoyed Gerhard Opfer's slides of the unusual home in Lexington
that Bill owned when he was a professor at the University of Kentucky.

All had a merry time at the Conference Banquet Friday night. The most
prevalent beverage at the cocktail hour was Guiness. After dinner
many of the attendees shared stories (mostly true, I believe) about
Bill Gragg the mathematician and Bill Gragg the human being.

Thanks to conference organizers Greg Ammar, Carlos Borges, Daniela
Calvetti, and Lothar Reichel for putting on a great party.

David Watkins


From: Giuseppe Italiano <>
Date: Wed, 6 Nov 1996 10:40:33 +0100 (MET)
Subject: Workshop on Algorithm Engineering


Venice, Italy
September 11--13, 1997

The Workshop on Algorithm Engineering will be held in Venice (Italy)
on September 11-13, 1997. The workshop is devoted to researchers and
developers interested in the practical aspects of algorithms and their
implementation issues. In particular, it will bring together
researchers, practitioners and developers in the field of algorithm
engineering to foster cooperation and exchange of ideas. Relevant
themes of the workshop are the design, experimental testing and tuning
of sequential, parallel and distributed algorithms to the point where
they are readily available for practical deployment. The Workshop will
be partly sponsored by ALCOM-IT, a European Union ESPRIT LTR Project.
More information on the workshop, including details of local
arrangements, will be available on the WAE 97 Web page, at the URL

Abstract submission: Authors should submit an extended abstract (max
10 pages). Authors are strongly encouraged to submit their
extended abstracts electronically. A detailed description of the
electronic submission process will be available on the World-Wide-Web,
and will be accessible through the WAE 97 Web page listed above. For
those unsure of the printability of their Postscript, a test printing
service will be made available (with details available at the Web
page). Authors who do not wish to submit electronically are invited to
send 6 copies (printed double-sided if possible) of an extended
abstract and a cover letter to Giuseppe F. Italiano at the address below.

Program Committee: Giorgio Ausiello (Univ. of Rome), Andrew
V. Goldberg (NEC Research Institute), Giuseppe F. Italiano (Univ. of
Venice), Mike Juenger (Univ. Koeln), and Kurt Mehlhorn
(Max-Planck-Institut fuer Informatik).

Local Arrangements: The Organizing Committee consists of
Agostino Cortesi, Dora Giammarresi, Salvatore Orlando, and Marcello
Pelillo, from University ``Ca' Foscari'' of Venice, Venice, Italy.

For more information:

Giuseppe F. Italiano
Dipartimento di Matematica Applicata e Informatica
Universita` ``Ca' Foscari'' di Venezia
via Torino 155, 30173 Venezia Mestre, Italy
Tel: +39-41-2908427
Fax: +39-41-2908419


From: Ann Johns <>
Date: Fri, 8 Nov 1996 12:06:33 -0600 (CST)
Subject: Summer Program in Biophysical Computing and Computational Dynamics

University of Minnesota Supercomputer Institute
Undergraduate Internship Program
in Biophysical Computing and Computational Dynamics

Program Announcement
Summer 1997

The Supercomputer Institute is pleased to announce an Undergraduate
Internship Program in Biophysical Computing and Computational Dynamics for
Summer 1997.

The program is sponsored by the Supercomputer Institute at the University
of Minnesota and by the Research Experiences for Undergraduates Program of
the National Science Foundation. Research projects are available in
biochemistry, chemistry, chemical physics, molecular biology, molecular
geophysics, pharmacology, and physiology. There are opportunities for
computer science students as well as for majors in these and related

The program's objective is to promote undergraduate involvement in
ongoing and new research in biophysical computing and computational
dynamics and in new software development efforts for scientific computing
and graphics support for such research, as well as to carry out useful and
interesting research. Our program provides an opportunity for a
challenging and enriching educational experience for undergraduate students
who are interested in pursuing graduate or professional education and
research in scientific computing and graphics.

Summer appointments will be full-time, ten-week appointments. The 1997
program will run from June 16 through August 22, 1997. The stipend is
$3,750 for ten weeks, which includes travel and living expenses. A student
interested in becoming an intern must be an undergraduate student at the
time of the internship to be eligible and must be a citizen or permanent
resident of the United States and its possessions.

Undergraduates will work with faculty on a wide variety of projects.
Faculty from various disciplines have individually contributed projects on
topics that fall within the areas delineated above and will be responsible
for supervising the undergraduate students in their daily work. A document
describing available projects and opportunities is available and is updated
frequently. Students should indicate their interests in specific projects
on their application forms.

All applications are judged competitively based on the qualifications of
the applicant and the availability of a suitable project. To obtain an
application form and project list contact: Undergraduate Internship
Coordinator, University of Minnesota Supercomputer Institute, 1200
Washington Avenue South, Minneapolis, MN 55415-1227. Phone: (612)
626-7620. E-mail: You may also want to reference our
World Wide Web site at


The University of Minnesota is committed to the policy that all persons
shall have equal access to its programs, facilities, and employment without
regard to race, color, creed, religion, national origin, sex, age, marital
status, disability, public assistance status, veteran status, or sexual

Ann Johns, Administrative Director (612)624-1556-phone
University of Minnesota (612)624-8861-fax
Supercomputer Institute
1200 Washington Ave. S.
Room 2051
Minneapolis, MN 55415


From: Panayot Vassilevski <>
Date: Sun, 10 Nov 96 08:59:42 +0200
Subject: Workshop on Large Scale Scientific Computations in Bulgaria

1st International Workshop on

Dates: June 7--June 11, 1997.
Place: Resort ``sv. Konstantin i Elena'' near Varna, Bulgaria.

ORGANIZED BY: The Central Laboratory on Parallel Processing (CLPP),
Bulgarian Academy of Sciences (BAS) in cooperation with
the Institute of Mathematics and Informatics (IMI), BAS.


Oleg P. Iliev (IMI),
Svetozar D. Margenov (CLPP) and
Panayot S. Vassilevski (CLPP)

The format of the workshop is expected to be similar to the
IMACS International Symposium on Iterative Methods in Linear Algebra,
held in Blagoevgrad (June 1995).

This first in a row workshop is planned to have special emphasis on:

``Numerical Simulation of Groundwater Contaminant
Transport and its Environmental Applications''

in the form of training seminar.

For this particular topic we acknowledge the support by
the ROSTE Venice office of UNESCO.


(o) Adaptive methods for coupled elliptic systems and
convection--diffusion problems;

(o) MG/DD (multigrid and domain decomposition) methods for
linear/non--linear coupled elliptic and convection--diffusion problems;

(o) Multiscale methods; theory and computation.

(o) Conservative schemes and mixed finite element computations;

(o) Parallel performance;

(o) Modeling of contaminant transport in hydrology and related applications;

LIST OF INVITED SPEAKERS (with preliminary confirmed participation):

Wolfgang Dahmen, RWTH, Aachen, Germany;
Michael Griebel, University of Bonn, Germany;
Sergey V. Nepomnyaschikh, Computing Center, Novosibirsk, Russia;
Joe Pasciak, Texas A & M University, College Station, TX, USA;
Michael Sch{\" a}fer, University of Darmstadt, Germany;
Petr Vabishchevich, Institute of Mathematical Modeling, Moscow, Russia;
Ragnar Winther, University of Oslo, Norway;

MORE INFORMATION: Ms Sylvia Grozdanova, Conference secretary
address: CLPP--BAS, ``Acad. G. Bonchev'' street, block 25A,
BG--1113 Sofia, Bulgaria;
FAX: (--359--2--707--273); e--mail:


From Sun Nov 10 08:00:00 1996
Received: from by with SMTP (cf v2.9t-netlib)
id HAA25960; Sun, 10 Nov 1996 07:59:57 -0500
Date: Sun, 10 Nov 1996 13:04:04 GMT
Message-Id: <>
Subject: Numerical Evaluation of an Integral

The following problem was first posed by Glasser
(Problem 95-7, SIAM Review, V 38,N 2,p.324,1996)

Evaluate K(a), where

K(a) = \int_0^{\infinity} [ (exp(-x) + exp(x))^a - exp(-ax) - exp(ax) ] dx

and 0 < a < 2, in terms of Gamma functions.

It was noted therein that K(5/3) is approximately 4.45

The solution is published ( Ismail and others,see above ref.). Several solvers
noted that a more accurate answer is 4.626291112. They did not indicate
whether this approximation is obtained by numerical integration.

My quesyion is: What is the best double precision approximation to K(5/3)?

Venkat Sastry

Dr. Venkat V S S Sastry,
Applied Mathematics and Operational Research Group,
Royal Military College of Science,
Shrivenham, Wilts.,
SN6 8LA, U.K.

Tel: + 44 (0)1793 785315
Fax: + 44 (0)1793 784196


From: Bill Harrod <>
Date: Sun, 3 Nov 1996 12:40:08 -0600
Subject: Position at Cray Research

The Scientific/Math Libraries Group at Cray Research has an open position
for an individual with extensive experience in scientific computing
to work on the development and support of iterative and direct
sparse solvers. This individual will work with Cray applications analysts
and customers on efficient design and implementation of sparse solvers
for use in scientific and engineering applications.

Training and experience should include:

- A Ph.D. in Mathematics, Computer Science or related field.

- A strong background in numerical linear algebra and numerical PDEs,
especially direct and iterative methods for sparse linear systems.

- Experience in efficient implementation of scientific
library routines for distributed and shared memory parallel/vector machines.

- An excellent understanding of high performance architectures and the
issues involved in optimizing algorithms for these systems.

- FORTRAN or C++ programming experience on high performance, scalable

Please send a cover letter and resume to:

Bill Harrod
Cray Research
655F Lone Oak Drive
Eagan, MN 55121



From: Walter Gander <>
Date: Mon, 4 Nov 1996 11:37:45 +0100
Subject: Professor at ETH Zurich

The Swiss Federal Institute of Technology in Zurich (ETH Zurich)
invites applications for a new position of a

Professor of Computer Science

in the area of DISTRIBUTED SYSTEMS. Cooperation with other research
groups, particularly also in Electrical Engineering, will be

Applicants should have an outstanding research record as well as
teaching experience. They are invited to send a curriculum vitae, a
list of publications, the names of at least three references, and a
brief description of their research plans before 10 January 1997 to
the President of ETH Zurich, Prof. Dr. J. N"uesch, ETH Zentrum,
CH-8092 Zurich. In view of the current composition of its faculty, the
ETH Zurich specifically encourages female candidates to apply.

Information on ETH Zurich and its Department of Computer Science is
available on WWW ( For further information on
the open position please contact Prof. Dr. C.A. Zehnder, Head,
Department of Computer Science, ETH Zentrum, CH-8092 Zurich


From: Tim Kelley <>
Date: Mon, 4 Nov 1996 07:56:27 -0500
Subject: Position at North Carolina State

North Carolina State University
Department of Mathematics

The Department of Mathematics at North Carolina State University
expects to make an faculty appointment at the level of assistant
professor or higher in computational fluid dynamics
starting July 1, 1997 or as soon as possible thereafter.
Applicants for a junior level position should have research
experience beyond the Ph. D. Applicants for a senior position
should have an outstanding research record and a well established
research program.

We hope that the successful applicant will interact with one or more
or our active groups in simulation, design, and control of chemical
vapor deposition reactors, simulation of granular flow,
modeling and control of magnetorheological fluids,
and flow through porous media. Excellence in teaching and the
qualifications to teach a broad range of courses in applied and numerical
mathematics, as well as calculus, are essential.

The intellectual climate for applied mathematics and
numerical analysis at NCSU is lively and challenging. Our group
consists of over thirty faculty members (within a Department of
over sixty faculty) and many graduate students and

The group has research programs in biomathematics, differential algebraic
equations, integral equations, numerical linear algebra, numerical
optimization/nonlinear equations, ordinary and partial differential
equations, control, and parallel computing.

The successful applicant will have the opportunity to become a member
of the Center for Research in Scientific Computation which facilitates
interaction between the faculty in the Mathematics Department and
other research institutions and industry.

Faculty in the NCSU Mathematics Department have access to the high
performance computing and visualization facilities at the North
Carolina Supercomputing Program.

Applicants should send a vita and have three letters of recommendation
sent to
C. T. Kelley
Department of Mathematics, Box 8205,
North Carolina State University Raleigh, NC 27695-8205.
Phone: 919-515-7163.
FAX: 919-515-3798.

North Carolina State University is an equal opportunity and
affirmative action employer. In its commitment to diversity and
equity, North Carolina State University seeks applications from
women, minorities, and the disabled.


From: Folkert Tangerman <>
Date: Mon, 4 Nov 1996 13:10:53 -0500
Subject: Positions at Stony Brook

University at Stony Brook,
Stony Brook, New York
Department of Applied Mathematics and Statistics

The department expects to have postdoctoral positions in computational
applied mathematics available for the 1997-98 academic year.
Qualified candidates should have computational experience in one
or more areas of: fluid dynamics, parallel computing, hyperbolic
conservation laws, flows in elastic and plastic media, and flows in
porous media.

Additional information concerning the department and its activities
is available from the WWW home page

Applicants should send vita, descriptions of research interests, and
three recommendation letters to: James Glimm, Chair, Department of
Applied Mathematics and Statistics, SUNY at Stony Brook, Stony Brook,
NY 11794-3600.

SUNY at Stony Brook is an equal opportunity/affirmative action
employer and educator and encourages applications from women and

Folkert M. Tangerman | phones: 516 -632-9340
Dept of Applied Math& Statistics | -757-1989 (home)
SUNY Stony Brook | FAX: 516-632-8490
Stony Brook, NY 11794-3600 | email :


From: Shirley Sommers <>
Date: Wed, 06 Nov 1996 10:14:33 EST
Subject: Position at Kent State University

Kent State University
Department of Mathematics and Computer Science
Kent, OH 44242

Tenure-Track Positions

We invite applications for three tenure-track positions at the
rank of assistant professor effective August 18, 1997. We plan
to fill one position in each of the following areas:
applied mathematics, algebra, and analysis.
Candidates are required to have a Ph.D. within the mathematical sciences.

The Kent Campus is a spacious, residential campus serving more than
21,000 students. It is situated in a small university town within 30
miles of the major metropolitan area of Cleveland. The Department
of Mathematics and Computer Science is in the College of
Arts and Sciences and houses programs through the doctoral level in
applied mathematics, computer science, pure mathematics, and statistics.
It currently consists of 23 faculty in the mathematical sciences
and 11 in computer science. The department recently moved to a
new building and has an extensive network of computers and
work stations for faculty and student use.

Candidates with strong potential for excellence in research and teaching
are invited to apply. Such applicants should send a cover letter,
a curriculum vitae, and a dissertation abstract or published
papers, if any, and have three letters of references sent to the
Mathematics Search Committee at the above address.
In the cover letter applicants are requested say for which
of the three positions they are applying.
Further, applicants are requested to use the AMS standardized application
format; forms are available through the American Mathematical Society.
Applications may be submitted via email to
Screening of applicants will begin January 27, 1997, and will
continue until the position is filled.
Kent State University is an Equal Opportunity, Affirmative Action Employer.


From: George Karypis <>
Date: Fri, 8 Nov 1996 18:20:53 -0600 (CST)
Subject: Postdoctoral Positions at University of Minnesota

Postdoctoral Positions for Research on Parallel Algorithms

Applications are invited for postdoctoral positions at
the Center for parallel Computing, Department of Computer Science
at the University of Minnesota.
Candidates will perform research on parallel algorithms and develop
scalable parallel libraries. Candidates will also participate in
collaborative projects with the Army High Performance Computing
Research Center. These positions will be under the
direction of Professors Vipin Kumar and George Karypis.
Projects in progress include parallel algorithms for graph partitioning,
adaptive mesh refinement, mesh generation, preconditioners for iterative
sparse linear system solvers, and data mining.
Additional details on the ongoing projects are available from

Candidates must have a PhD in computer science, mathematics, or a
related discipline. Expertise in parallel computing is essential,
and expertise in scientific computing is highly desirable.
The positions are for a period of one year, and will be renewable
subject to availability of funds and satisfactory performance.
The salary will be competitive and based upon qualifications and experience.
Positions are available immediately. Applications will be accepted
until poistions are filled.

To apply, please submit a resume, and names of three references to

Postdoctoral Position Search Committee
Computer science Department
EE/CSci 4-192
200 Union Street, S.E.
University of Minnesota
Minneapolis, MN 55455
Attn: Professor Vipin Kumar

Candidates are also encouraged to send their application via e-mail
to Vipin Kumar ( or George Karypis (

George Karypis email:
Assistant Professor, tel: 612-626-8069; fax: 612-626-1596
University of Minnesota, URL:


From: IEEE Computer Society <>
Date: Sun, 03 Nov 96 23:01:27 est
Subject: Contents, Computational Science & Engineering

Vol. 3, No. 3, Fall 1996.

Editor-in-Chief: George Cybenko, Dartmouth College,
Associate EIC: Francis Sullivan, IDA Ctr. for Computing Sciences


Adifor 2.0: Automatic Differentiation of Fortran 77 Programs
Christian Bischof, Alan Carle, Peyvand Khademi, and Andrew Mauer 18

A Parallel Cellular Tool for Interactive Modeling and Simulation
Giandomenico Spezzano, Domenico Talia, Salvatore Di Gregorio, Rocco
Rongo, and William Spataro 33

THEME SECTION ARTICLES: Computer Science Support for Science and

> From Scientific Software Libraries to Problem-Solving Environments
John R. Rice and Ronald F. Boisvert 44

What Should Computer Scientists Teach to Physical Scientists and
Engineers? Part 2
Response to Wilson: Teach Computing in Context
--Elizabeth R. Jessup and Roscoe C. Giles 54
Response to Wilson: A Week Won't Do It --David F. McQueeney 58
Response to Wilson: Forget Multiple Tools, Use Mathematica
--Tom Issaevitch 59
Reply --Gregory V. Wilson 62

Taking Stock, Looking Ahead: Part 2 [theme essays] 63
High-Performance Languages for Parallel Computing --Hans P. Zima
Outline of a Roadmap for Compiler Technology --David A. Padua
Programming without Bothering about Data Structures?
--Harry Wijshoff
Inside Parallel Computers: Trends in Interconnection Networks
--Howard Jay Siegel and Craig B. Stunkel
Modernizing High-Performance Computing for the Military
--Anita K. Jones


> From the Editor-in-Chief 1
Scientific Standards for Experimental Computing

Site Report 4
Computational Fluid Dynamics at CRS4, Italy

Computing Prescriptions 9
Making Connections --I. Beichl and F. Sullivan

CSE Education 13
Students Get Hands-On Research Experience at SDSC

News Analysis 75
NSF HPC Centers: Proposals Are In! --F. Brett Berlin

CSE at Work 76
Real CSE Problems from Industry --Fadil Santosa

Conferences & Workshops 78
A Multigrid Tutorial with Applications to Molecular Dynamics
--Tamar Schlick and Achi Brandt
1996 ACES Conference --John L. Volakis
ILAY Workshop on Iterative Methods
--Michele Benzi and Craig Douglas

Technology News 80

Interfaces 88
Reciprocity in High-Performance Trade --Norris Parker Smith


From: Baltzer Science <>
Date: Thu, 7 Nov 1996 15:32:17 +0100
Subject: Contents, Numerical Algorithms

Numerical Algorithms
Volume 13 (1996) Nos. 1,2
Published October 1996


An automatic integration procedure for infinite range integrals involving
oscillatory kernels. T. Hasegawa and A. Sidi.

Computing a family of reprodusing kernels for statistical applications.
C. Thomas-Agnan.

Isotropic refinement and recoarsening in two dimensions.
D. Hempel.

Preconditioned Barzilai-Borwein method for the numerical solution of partial
differential equations.
B. Molina and M. Raydan.

A globally convergent method for solving nonlinear equations without
the differentiability condition.
A. Pietrus.

On the comparison of four different implementations of a
third-order ENO scheme of box type for the computation of compressible
D. Hietel, A. Meister and T. Sonar.

Approximating dominant singular triplets of large sparse matrices
via modified moments.
S. Varadhan, M.W. Berry and G.H. Golub.

Book Reviews


From: Hans Schneider <>
Date: Sat, 9 Nov 1996 18:58:55 -0600 (CST)
Subject: Contents, Linear Algebra and Its Applications

Journal : Linear Algebra and Its Applications

Volume Number : 247
Issue Number : 1 - 3
Year : 1996

Page 1
Time-Dependent Linear DAE's with Discontinuous Inputs
P. J. Rabier, W. C. Rheinboldt

Page 31
Dualistic Differential Geometry of Positive Definite Matrices and Its
Applications to Related Problems
A. Ohara, N. Suda, S. Amari

Page 55
On Maximal Sign-Nonsingular Matrices
T. J. Lundy, J. S. Maybee, J. Van Buskirk

Page 83
A Reverse Hadamard Inequality
S. Ambikkumar, S. W. Drury

Page 97
Convergence Properties of Block GMRES and Matrix Polynomials
V. Simoncini, E. Gallopoulos

Page 121
Polynomial Maps with Strongly Nilpotent Jacobian Matrix and the
Jacobian Conjecture
A. van den Essen, E. Hubbers

Page 133
Algebraic Representations for Finite-State Machines. II. Module
T. L. Moeller, J. Milstein

Page 151
Degree of Indecomposability of Certain Highly Regular Zero-One
D. de Caen

Page 159
On Almost Nilpotent-By-Abelian Lie Algebras
K. Bowman, D. A. Towers

Page 169
On Approximation Problems with Zero-Trace Matrices
K. Zietak

Page 185
An Elementary Prooof of Barnett's Theorem About the Greatest Common
Divisor of Several Univariate Polynomials
P. L. Gonzalez-Vega

Page 203
Block Matrices and Multispherical Structure of Distance Matrices
T. L. Hayden, J. Lee, J. Wells, P. Tarazaga

Page 217
Finding Norms of Hadamard Multipliers
C. C. Cowen, P. A. Ferguson, D. K. Jackman, E. A. Sexauer, C. Vogt, H.
J. Woolf

Page 237
Parallel Chaotic Extrapolated Jacobi-Like Methods
R. Fuster, V. Migallon, J. Penades

Page 251
The Maximum Row Length Nonsingularity Radius
B. I. Wainberg, H. J. Woerdeman

Page 265
On Linear Preservers of Immanants
M. P. Coelho

Page 273
On a Character Formula Involving Borel Subgroups
M. Maliakas

Page 277
On the Smith Normal Form of D-Optimal Designs
C. Koukouvinos, M. Mitrouli, J. Seberry

Page 297
Upper and Lower Bounds for Inverse Elements of Finite and Infinite
Tridiagonal Matrices
P. N. Shivakumar, J. Chuanxiang

Page 317
On Polynomials Nonnegative on the Unit Circle and Related Questions
Y. V. Genin

Page 327
A Note on Linear Transformations which Leave Controllable Multi-Input
Descriptor Systems Controllable
O. Fung

Page 337
On the Matrix Equation X+ATX-1A=1
X. Zhan, J. Xie

Page 347
Factorization of Banded Lower Triangular Infinite Matrices
I. Gohberg, M. A. Kaashoek, L. Lerer

Page 359
Hermitian Solutions of the Equation X=Q+NX-1N
A. Ferrante, B. C. Levy

Page 375


End of NA Digest