URL for the World Wide Web:
http://www.netlib.org/na-net/na_home.html
-------------------------------------------------------
From: Dirk Laurie <dirk@calvyn.puk.ac.za>
Date: Wed, 20 Mar 1996 11:36:52 +0200 (SAT)
Subject: What Is the Best Set of Independent Rows?
The following problem must be known to some readers of this Digest.
Given an m x n matrix of rank r, which set of r rows has the smallest
condition number? (Condition number = s_1/s_r, where {s_i} are the
singular values of the chosen submatrix in non-increasing order.)
Mail me, I promise to summarize the replys.
Dirk Laurie
------------------------------
From: M. Syamlal <msyaml@wposmtp.metc.doe.gov>
Date: Wed, 20 Mar 1996 14:33:00 -0500
Subject: Sparse Matrix Software
I would appreciate receiving information on iteratively solving large (say,
30,000x30,000) septadiagonal sparse matrices originating from a
structured grid. Is there any recommended public domain or commercial
software for the following? Once a solution is obtained for a certain
LHS matrix and RHS vector:
1. Efficiently find solution for a new RHS vector for the same LHS matrix.
2. Efficiently find solution for a new LHS matrix that is a *small*
perturbation of the old one. In other words, are there algorithms that
can use information from a previous solution cycle for a matrix that is
only slightly different from the present one to speed up the present
solution cycle? Of course this is besides using the previous solution as
a starting guess.
I would appreciate receiving any information, partial or total, references,
leads, etc. on the above. Thanks.
M. Syamlal
EG&G, T.S.W.V., Inc.
Box 880
Morgantown, WV 26505
Tele: (304) 285-4685
FAX: (304) 285-4403
E-Mail: MSYAML@METC.DOE.GOV
------------------------------
From: Evelyne Hubert <Evelyne.Hubert@imag.fr>
Date: Fri, 22 Mar 1996 17:16:37 +0100
Subject: Implicit Non-linear Equations
I would be interested in knowing how you solve numerically
implicit non-linear ordinary differential equations.
For instance, how would you handle the following equations :
(y')^2 + c y = 0 (the leaky bucket)
(y')^3 - 4 x y y' + 8 y^2 =0.
I will appreciate any comments about that sort of equations.
Evelyne Hubert
Computer Algebra Team - LMC, Grenoble
Evelyne.Hubert@imag.fr
------------------------------
From: Linda Neyra <neyra@caam.rice.edu>
Date: Wed, 20 Mar 1996 14:20:31 -0600
Subject: Tapia Profiled in National PBS Broadcast
Tapia Profiled in National PBS Broadcast
Richard Tapia, Rice Professor of Computational and Applied Mathematics
and Director of Outreach Programs for the Center for Research on Parallel
Computation, will be featured in a national PBS broadcast entitled "A
Delicate Balance" as a part of the Blackside Breakthrough series.
Breakthrough, in a six part series, chronicles the rewards and challenges
facing 20 people of color who chose a life in science and mathematics.
The first two segments air Monday, April 8, the second two air Monday,
April 15, and the last two air Monday, April 22, 1996. The "Delicate
Balance" segment features Tapia and two other individuals. It airs
nationally April 22, and in Houston it will air at 9:00 p.m. on PBS.
Since local stations often exercise some flexibility you may wish to
check your local station guide.
------------------------------
From: Todd Veldhuizen <todd@cybervision.kwic.net>
Date: Thu, 21 Mar 96 23:02:26 EST
Subject: Blitz++ Project Web Page Announcement
Web site announcement:
The Blitz++ Numerical Library Project
URL: http://monet.uwaterloo.ca/blitz/
The goal of the Blitz++ project is to develop techniques which will
enable C++ to rival -- perhaps even exceed -- the speed of Fortran for
numerical computing, while preserving an object-oriented interface.
Preliminary results show speed increases of 2-10 times over
conventional C++ numerical libraries, and performance about on par
with carefully hand-crafted C code.
These results are being obtained not through better optimizing
compilers, preprocessors, or language extensions, but through the use
of template techniques. By using templates cleverly, radical
optimizations such as loop fusion, loop unravelling, and algorithm
specialization can be performed automatically at compile time.
The web site provides papers about the techniques, benchmark
results, and source code examples.
Feel free to forward this notice.
Todd Veldhuizen todd@cybervision.kwnet.on.ca
Homepage: http://monet.uwaterloo.ca/~tveldhui/
------------------------------
From: Bob Vanderbei <rvdb@teal.Princeton.EDU>
Date: Mon, 18 Mar 1996 07:40:46 GMT
Subject: Beale-Orchard-Hays Prize
Beale-Orchard-Hays Prize
Call for Nominations:
Nominations are being sought for the Mathematical Programming Society
Beale-Orchard-Hays Prize for Excellence in Computational Mathematical
Programming.
Purpose:
This award is dedicated to the memory of Martin Beale and William
Orchard-Hays, pioneers in computational mathematical programming. To be
eligible a paper or a book must meet the following requirements:
1) It must be on computational mathematical programming. The topics to be
considered include:
a) experimental evaluations of one or more mathematical algorithms,
b) the development of quality mathematical programming software (i.e.
well-documented code capable of obtaining solutions to some important class
of MP problems) coupled with documentation of the applications of the
software to this class of problems (note: the award would be presented for
the paper which describes this work and not for the software itself),
c) the development of a new computational method that improves the
state-of-the art in computer implementations of MP algorithms coupled with
documentation of the experiment which showed the improvement, or
d) the development of new methods for empirical testing of mathematical
programming techniques (e.g., development of a new design for computational
experiments, identification of new performance measures, methods for
reducing the cost of empirical testing).
2) It must have appeared in the open literature.
3) If the paper or book is written in a language other than English, then
an English translation must also be included.
4) Papers eligible for the 1997 award must have been published within the
years 1993 through 1996.
These requirements are intended as guidelines to the screening committee
but are not to be viewed as binding when work of exceptional merit comes
close to satisfying them.
Frequency and Amount of the Award:
The prize is awarded every three years. The 1997 prize of $1500 and a
plaque will be presented in August 1997, at the Swiss Federal Institute of
Technology (EPFL), Lausanne Switzerland, at
the Awards Session of the International Symposium on Mathematical
Programming sponsored by the Mathematical Programming Society.
Judgement criteria:
Nominations will be judged on the following criteria:
1) Magnitude of the contribution to the advancement of computational and
experimental mathematical programming.
2) Originality of ideas and methods.
3) Clarity and excellence of exposition.
Nominations:
Nominations must be in writing and include the title(s) of the paper(s) or
book, the author(s), the place and date of publication and four copies of
the material. Supporting justification and any supplementary materials are
welcome but not mandatory. The awards committee reserves the right to
request further supporting materials from the nominees.
Nominations should be mailed to:
Professor Robert J. Vanderbei
Dept. of Civ. Eng. and Operations Research
ACE-42 Engineering Quad
Princeton University
Princeton, NJ 08544
USA
The deadline for submission of nominations is January 1, 1997.
This call-for-nomination can be viewed online by visiting:
http://www.sor.princeton.edu/~rvdb/BOH97.html
------------------------------
From: Seth Greenblatt <S.A.Greenblatt@reading.ac.uk>
Date: Wed, 20 Mar 1996 12:17:38 +0000 (GMT)
Subject: Numerical Methods for Economics and Finance
Call For Papers
Numerical Methods for Economics and Finance
A Special Issue of _Computational Economics_
Economic and Financial models arising from theory can be extremely
com- plicated. The Econometric models corresponding to them can be
even more complicated. Until recently, researchers have been forced to
make sweeping simplifications before attempting to analyse these
models. Unfortunately, the simplified models often did not behave in
the same manner as the underlying model, so false conclusions could be
drawn.
In recent years, available computing power has grown rapidly. This
growth has allowed direct attack on some difficult problems, with
rewarding results. However, problems always seem to grow faster than
computing power, so in- novative, efficient numerical methods are
crucial to make effective use of the available computing hardware.
For this reason _Computational Economics_ is planning a special issue
on Numerical Methods for Economics and Finance. Topic of interest
include, but are not limited to, numerical methods applied to:
econometric/statistical analysis of economic or financial data, model
solution, simulation, or optim- isation. The numerical method may be a
technique developed specifically for the problem addressed in the
paper or an innovative application of techniques developed elsewhere.
To submit a paper to be considered for inclusion in the special issue,
please send four (4) copies to the issue's Guest Editor:
Dr. Seth A. Greenblatt
Director, Centre for Quantitative Economics and Computing
Department of Economics
Faculty of Letters and Social Sciences
University of Reading
PO Box 218
Whiteknights, Reading RG6 6AA
UNITED KINGDOM
before the 31st of May 1996.
------------------------------
From: Carlos Antonio de Moura <demoura@dee.ufc.br>
Date: Wed, 20 Mar 1996 14:52:12 +0300
Subject: Journal for Universal Computer Sciences
I would like to call your attention to J.UCS - Journal for Universal
Computer Science -, an electronic journal sponsored by Springer Verlag
and IICM (Graz, Austria), available through the net and which has
reached its 1st year, with 12 issues published quite timely. Every
volume will also be available on CD-ROM.
Its refereeing process is quite careful, a worry that has lead to a very
good output of research articles for our first volume.
The "Universal" on its title stands also for a broad area of interest,
and this includes Numerical Mathematics, or Scientific Computing or
Computational Sciences (where are the boundaries, if any?).
So far we didn't have many submissions on this area, and we
would like to change this trend. We are particularly aware of the increasing
need of interaction between numerical and non-numerical computing as regards
to high performance.
Wouldn't you consider to present an article of yours to be featured in one
of our next issues (certainly refereed after a short time after submission)?
You can get more information on J.UCS as well as browse through "published"
issues by sailing on
http://hyperg.iicm.tu-graz.ac.at/home;sk=3EB8A3D1
Carlos A. de Moura
LABORATORIO DE CIENCIAS COMPUTACIONAIS
LaCC-CT/UFC
Fax: 55-85- 288 95 74
http://www.dee.ufc.br/~demoura
demoura@na-net.ornl.gov
------------------------------
From: Jack Dongarra <dongarra@cs.utk.edu>
Date: Wed, 20 Mar 1996 16:02:41 -0500
Subject: ParkBench Meeting
The ParkBench (Parallel Benchmark Working Group) will meet
in Knoxville, Tennessee on Friday April 26th, 1996.
The meeting site will be the Knoxville Downtown Hilton Hotel.
Hilton Hotel
501 W. Church Street
Knoxville, TN
Phone: 423-523-2300
For additional details on the meeting see the following url:
http://www.netlib.org/utk/papers/parkbench-april96.html
Jack Dongarra
------------------------------
From: Iain Duff <I.Duff@letterbox.rl.ac.uk>
Date: Fri, 22 Mar 96 17:41:26 GMT
Subject: Iterative Workshop in Toulouse
CERFACS International Linear Algebra Year .... Iterative Workshop
As announced in an earlier message to the NA-digest [Volume 95, Issues 15
and 47], CERFACS in Toulouse (France) is organizing an International Linear
Algebra Year (ILAY) from September 1, 1995 to September 1, 1996.
Please find below detailed information about the workshop on Iterative Methods
that will be held this June. It is the last of the four workshops that
are being held during this year.
Note also that people interesested in the visitor's programme should contact
Dr Chiara Puglisi (puglisi@cerfacs.fr).
The pre-registration deadline for this workshop is APRIL 30, 1996.
ILAY WORKSHOP ON DIRECT METHODS
DATE: June 10-13, 1996.
PROGRAMME:
Confirmed speakers by days in alphabetical order.
Monday June 10 : Industrial Day
* P. W. Hemker (CWI, the Netherlands),
* F. Lafon (Thomson-CSF, France),
* P. Markowitz (University of Berlin, Germany)
* G. Meurant (CEA, France)
* F.X. Roux (ONERA, France)
Tuesday June 11 : Krylov Methods
* M. Arioli (CNR Pavia, Italy)
* S. Ashby (LLNL, USA)
* T. Chan (UCLA, USA)
* G. Golub (Stanford University, USA)
* A. Greenbaum (New York University, USA),
* M. Heroux (Cray Research, USA),
* T. Manteuffel (University of Colorado, USA)
* D. Silvester (UMIST, UK)
* R. Tuminaro (Sandia National Laboratories, USA)
* H. A. van der Vorst (Utrecht University, the Netherlands),
* A. Wathen (Oxford University, UK),
Wednesday June 12 : Domain Decomposition Methods
* J. Douglas (Purdue University, USA),
* D. E. Keyes (Old Dominion University and NASA Langley Research Center, USA)
* Y. Kuznetsov (Russian Academy of Sciences, Russia)
* Y. Maday (Paris VI, France)
* J. Mandel (University of Colorado, Denver, USA)
* A. Quarteroni (Politecnico di Milano and CRS4, Italy),
* P. Le Tallec (INRIA, France),
Thursday June 13 : Multigrid Methods
* S. Brenner (University of South Carolina, USA),
* P. Deuflhard (ZIB, Germany),
* C. Douglas (IBM T.J. Watson Research Center and Yale University, USA),
* H. Elman (University of Maryland, USA)
* W. Hackbusch (University of Kiel, Germany)
* U. Ruede (Technische Universitaet Muenchen, Germany),
The workshop will be held at the UNESCO Centre in Toulouse.
The local organizing committee comprises C. Douglas (Yale and IBM) and
L. Giraud (CERFACS).
Because of support, we are able to keep the cost to 1500 FFR (for registration,
documentation, lunches, tea and coffee) for the four-day workshop, with a
reduction to 1000 FFR for full-time students, and a fee of 3000 FFR for
non-academics. Reduced price accommodation is available at UNESCO and a
limited amount of very cheap accommodation is available at the meteo
residences near the CERFACS building.
There is a possibility that some support will be available from the US NSF for
younger US participants. If such funds are available we will make an
announcement in the Digest.
Up-to-date information on this workshop (including the abstracts of the talks,
registration forms, etc.) can be found through the WWW page:
http://www.cerfacs.fr/~wlay/LAY/iter.html
Up-to-date information on the other ILAY workshops and the visitor programme
can be obtained through the ILAY home page:
http://www.cerfacs.fr/~wlay/LAY/lay.html
Please contact wlay@cerfacs.fr if you wish to receive additional information.
------------------------------
From: Yves Bourgault <ybourg@cfdws10.concordia.ca>
Date: Wed, 20 Mar 1996 15:50:20 -0500
Subject: Short Course in Numerical Methods in Acoustics
NUMERICAL METHODS IN ACOUSTICS
A 2.5-day Short Course to be held in Montreal, Canada, June 5-7, 1996,
organized by the Computational Fluid Dynamics Laboratory of Concordia
University.
The course addresses the issues in the development of computational tools
for the study of aeroacoustics and their application to noise prediction
and control. The Instructor is Dr. Ramesh Agarwal, Bloomfield Distinguished
Professor and Chairman of the Aerospace Engineering Department at Wichita
State University and formerly Program Director for CFD and MDC Fellow at
the McDonnell Douglas Research Laboratories. The course will cover governing
equations, classical acoustics, aero-acoustics formulations, analytical
solution techniques, numerical methods and applications.
The course starts Wednesday, June 5 at 9:00 am and ends on Friday, June 7
at 1:00 pm. It will be held at the Holiday Inn, 900 St-Charles East,
Longueuil, Qc, J4H 3Y2 (Reservations: 1-800-263-0159, Tel: 514-646-8100,
Fax: 514-646-7786, room rate: $59 CAD+Tax). The course fees (tax-included,
course, course notes and 2 lunches, Wednesday and Thursday) are $640 CAD,
for Canadian and foreign participants; $475 USD for US participants and
$180 CAD, for students enrolled full-time in an academic program (proof
of registration required; limited places available). Payments should be
made by mail, with cheque labeled to Concordia University and identifying
the person attending, and addressed to Professor W.G. Habashi. All payments
must be received prior to the course. As the number of attendees must be
known beforehand, there will be no on-site registration.
For more information, contact:
Professor W.G. Habashi, by fax, e-mail or phone (Tuesday, Thursday and Friday)
Dr. W.G. Habashi
Director, CFD Lab
Department of Mechanical Engineering
Concordia University
1455 de Maisonneuve Blvd. W., ER 301
Montreal, Qc, Canada H3G 1M8
Tel: +1-514-848-3165 Fax: 8601
e-mail: habashiw@cfdlab.concordia.ca
------------------------------
From: G. J. Olsder <g.j.olsder@math.tudelft.nl>
Date: Tue, 19 Mar 1996 17:23:44 +0100 (MET)
Subject: Positions in European ALAPEDES Project
Within the framework of Research Networks, Training and Mobility
of Researchers, a programme of the European Commission, the project
THE ALGEBRAIC APPROACH TO PERFORMANCE EVALUATION OF DISCRETE EVENT SYSTEMS
abbreviated as ALAPEDES, has been favourably selected and applications
are now sollicited. A description of the project can be obtained from
the network coordinator. A recent overview of the theory of discrete
event systems can for instance be found in:
C.G. Cassandras, S. Lafortune and G.J. Olsder, Introduction to the Modelling,
Control and Optimization of Discrete Event Systems, in: Trends in
Control: A European Perspective, A. Isidori (ed.), Springer Verlag,
1995, pp. 217-291.
The NETWORK COORDINATOR is
G.J. Olsder
Delft University of Technology
Faculty of Technical Mathematics and Informatics
PO Box 5031
2600 GA Delft
the Netherlands
phone +31-15-2781912
fax +31-15-2787209
e-mail: g.j.olsder@math.tudelft.nl
The institutes involved in the project are, with the teamleader
of the local research team between parentheses:
1. Delft University of Technology, Delft, the Netherlands (G.J. Olsder);
2. Ecole Nationale Superieure des Mines de Paris, Fontainebleau, France
(G. Cohen);
3a.INRIA Sophia-Antipolis, Sophia-Antipolis, France (F. Baccelli);
3b.INRIA Rocquencourt, Rocquencourt, France (J.-P. Quadrat);
4. Catholic University of Leuven, Leuven, Belgium (B. de Moor);
5. Basic Research Institute in the Mathematical Sciences, Hewlett Packard,
Bristol, United Kingdom (J.H.C. Gunawardena);
6. Laboratoire Informatique Theorique et Programmation, Universite Pierre
et Marie Curie, Paris, France (D. Krob);
7. University of Groningen, Groningen, the Netherlands (R. Smedinga);
8. Universite de Liege, Liege (Luik), Belgium (V. Blondel).
POSITIONS AND APPLICATIONS
The eight partners of the project look for candidates who
as visiting researchers would like to join the project.
Eight positions are available (one for each research team),
each having a duration of three years on the average (minimum
duration: two years, maximum duration: four years). During the contract
period the visiting researchers will typically have two research teams
as a `home-base'.
The European Union requires some conditions regarding the successful
candidates to be fulfilled. The more crucial ones are:
- the visiting researcher must be a holder of a doctoral degree or
of a degree from a university or equivalent institution of higher
education, which qualifies him to embark on a doctoral degree;
- he must be a national of a member state of the European Community or
of an associate state;
- he must not be a national of the state in which the research team
appointing him is situated.
Further information can be obtained from the network coordinator, to
whom the applications should be sent also. Applications should contain
all relevant information. Subject to a successful ending
of the contract negotiations, it is expected that the
project will start during the summer of 1996.
------------------------------
From: IMACS Administration <imacs@cs.rutgers.edu>
Date: Mon, 18 Mar 1996 13:56:59 -0500
Subject: Contents, IMACS Journal of Computational Acoustics
CONTENTS:
JOURNAL OF COMPUTATIONAL ACOUSTICS (an IMACS Journal)
Vol. 3, No. 4 (December 1995)
Some Aspects of the Physics and Numerical Modeling of Biot
Compressional Waves
J.M. Carcione and G. Quiroga-Goode 261
An Evaluation of Finite Volume Direct Simulation and Perturbation
Methods in CAA Applications
R.W. Stoker and M.J. Smith 281
Characterization of a Vertical Surface-Breaking Crack in Plates
K.Y. Lam,- G.R. Liu, and Y.Y. Wang 297
Evaluation of Two Efficient Target Tracking Algorithms for
Matched-Field Processing with Horizontal Arrays
M.J. Wilmut, J.M. Ozard, and P. Brouwer 311
Evaluation of Several Nonreflecting Computational Boundary
Conditions for Duct Acoustics
W.R. Watson, W.E. Zorumski, and S.L. Hodge 327
------------------------------
From: Marilyn Radcliff <radcliff@math.ohio-state.edu>
Date: Fri, 22 Mar 1996 15:53:11 -0500 (EST)
Subject: Contents, Journal of Approximation Theory
Table of Contents: J. Approx. Theory, Volume 84, Number 3, March 1996
Knut M. M\orken
On total positivity of the discrete spline collocation matrix
247--264
Avraham A. Melkman
Another proof of the total positivity of the discrete spline
collocation matrix
265--273
E. Tychopoulos
Lorentz spaces and lie groups
274--289
Thomas Kunkle
Multivariate differences, polynomials, and splines
290--314
Anders Lin\'ner
Unified representations of nonlinear splines
315--350
Ryotaro Sato and Sin-Ei Takahasi
A discrete Korovkin theorem and $BKW$-operators
351-366
Author index for volume 84
367
------------------------------
From: SIAM <tschoban@siam.org>
Date: Tue, 19 Mar 96 11:10:52 EST
Subject: Contents, SIAM Scientific Computing
SIAM Journal on Scientific Computing
MAY 1996, Volume 17, Number 3
CONTENTS
Three-Dimensional Steady Flow in a Dividing Channel Using Finite and
Pseudospectral Differences
Roland Hunt
A Stable Penalty Method for the Compressible Navier-Stokes Equations: I. Open
Boundary Conditions
J.S. Hesthaven and D. Gottlieb
Semicirculant Solvers and Boundary Corrections for First-Order Partial
Differential Equations
Sverker Holmgren and Kurt Otto
The Solution of Multidimensional Real Helmholtz Equations on Sparse Grids
Robert Balder and Christoph Zenger
An Efficient Iterative Solution Method for the Chebyshev Collocation of
Advection-Dominated Transport Problems
A. Pinelli, W. Couzy, M. O. Deville, and C. Benocci
On the Order of Convergence of Preconditioned Nonlinear Conjugate Gradient
Methods
M. Al-Baali and R. Fletcher
Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
Chunguang Sun
A Parallel Algorithm for the Sylvester Observer Equation
Christian H. Bischof, Biswa Nath Datta, and Avijit Purkayastha
Performance of Panel and Block Approaches to Sparse Cholesky Factorization on
the iPSC/860 and Paragon Multicomputers
Edward Rothberg
A Stable High-Order Interpolation Scheme for Superconvergent Data
Steven Pruess and Hongsung Jin
An Assessment of Nonmonotone Linesearch Techniques for Unconstrained
Optimization
Philippe L. Toint
A Regularization Parameter in Discrete Ill-Posed Problems
Teresa Reginska
Computation of Shot-Noise Probability Distributions and Densities
John A. Gubner
Toeplitz-Circulant Preconditioners for Toeplitz Systems and Their Applications
to Queueing Networks with Batch Arrivals
Raymond H. Chan and Wai-Ki Ching
Greengard's N-Body Algorithm Is Not Order N
Srinivas Aluru
On the Removal of Boundary Errors Caused by Runge-Kutta Integration of Nonlinear
Partial Differential Equations
Saul Abarbanel, David Gottlieb, and Mark H. Carpenter
------------------------------
From: IEEE Computer <mehrlich@computer.org>
Date: Tue, 19 Mar 96 11:49:46 est
Subject: Contents, IEEE Computational Science & Engineering
Contents of IEEE COMPUTATIONAL SCIENCE & ENGINEERING magazine,
Vol. 3, No. 1, Spring 1996.
http://www.computer.org/pubs/cs&e/cs&e.htm
Editor-in-Chief: George Cybenko, Dartmouth College,
george.cybenko@dartmouth.edu
Associate EIC: Francis Sullivan, IDA Ctr. for Computing Sciences
ARTICLES
Benchmarking with Real Industrial Applications: The SPEC
High-Performance Group
Rudolf Eigenmann and Siamak Hassanzadeh 18
Lucas: A System for Modeling Land-Use Change
Michael W. Berry, Brett C. Hazen, Rhonda L. MacIntyre, and Richard O.
Flamm 24
Theme Editor's Introduction: Neural Networks in Computational Science
and Engineering
George Cybenko 36
Neuro-Fuzzy Support for Problem-Solving Environments: A Step Toward
Automated Solution of PDEs
Anupam Joshi, Sanjiva Weerawarana, Narendran Ramakrishnan, Elias N.
Houstis, and John R. Rice 44
Fuzzy Parameter Adaptation in Optimization: Some Neural Net Training
Examples
Payman Arabshahi, Jai J. Choi, Robert J. Marks II, and Thomas P.
Caudell 57
Computational Methods in Finance: Option Pricing
Emilio Barucci, Leonardo Landi, and Umberto Cherubini 66
DEPARTMENTS
New Editor-in-Chief 1
Meetingplace
About the Cover 4 [also on Web site]
The Optical "Fingerprints" of Cells: Catching the Bad Guys
--A. Hoekstra, B. Hertzberger, P. Sloot
CSE at Work 6
A New Market for CSE: An Engineer Goes to Wall Street
Site Report 8
Pittsburgh Supercomputing Center
Computing Prescriptions 13 [NEW DEPT.]
Tree-Lookup for Partial Sums, Or, How Can I Find This Stuff
Quickly? --I. Beichl and F. Sullivan
About the Articles 16
Also: guide to articles on neural computing in 3/96 companion
issue of _Computer_ magazine
Interview 81
David J. Kuck: What is Good Parallel Performance, and How Do
We Get It?
Book News & Reviews 86
High Performance Computing Demystified, by David Loshin;
reviewed by Jose' E. Moreira
Conferences & Workshops 88
Announcing the First IEEE-CS Workshop on Computational Science
and Engineering, Oct. 21-22, 1996, Purdue --J. Rice
Supercomputing '95 --R.N. Draper et al.
Neural Networks for Physicists 5 --F. de Forcrand
Product News 92 [also on Web site]
Interfaces 96
Technoculture: Moving from Rejection to Accommodation --Norris
Parker Smith
Calendar [on Web site]
------------------------------
End of NA Digest
**************************
-------