NA Digest Sunday, May 16, 1993 Volume 93 : Issue 20

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: Franklin Luk <luk@cs.rpi.edu>
Date: Tue, 11 May 1993 11:51:57 -0400
Subject: Golub Elected to National Academy of Sciences

We are proud to share with you the wonderful news that
Gene Golub has been elected to the National Academy of Sciences (NAS).
To NA-Netters, Gene needs no introduction.
Let us state simply that Gene is among the *first* computational scientists
elected to the NAS and the National Academy of Engineering.

As fellow computational scientists as well as Gene's former students,
we are thrilled that the prestigious National Academies are giving Gene
the recognition that he so richly deserves.

Sincerely,
Daniel Boley, Richard Brent, Franklin Luk.


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

From: John R. Rice <jrr@cs.purdue.edu>
Date: Tue, 11 May 93 10:58:22 EST
Subject: Honorary Degree for Carl de Boor

It is with great pleasure that I inform you that

Card de Boor
University of Wisconsin, Madison

received an Honorary Doctorate of Science from Purdue
University on May 15, 1993. The citation for the degree is
as follows:

``For fundamental contributions to the mathemati-
cal theory of piecewise polynomials and their
application in geometrical design and functional
approximation''

Please join me in congratulating Carl on his seminal contri-
butions to science.


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

From: Gene Golub <golub@sccm.Stanford.EDU>
Date: Tue, 11 May 93 9:13:20 PDT
Subject: Wallace Givens

Those who work on matrix computations will be sad to hear that Wallace
Givens died on March 5 at the age of 82. Information about his career
is contained in SIMAX vol 12, number 1, January 1991 which was
dedicated to him on the occasion of his 80th birthday. His memory
will remain with us as long as Givens rotations continue to play a
useful role in our work.

Gene Golub & Beresford Parlett


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

From: Werner Liniger <liniger@watson.ibm.com>
Date: Wed, 12 May 93 11:49:33 EDT
Subject: Change of Address for Werner Liniger

Starting June 1,1993, my new postal mailing address will be my home address:

703 Fieldstone Court
Yorktown Heights, NY 10598
U.S.A.

A change in my e-mail address will be communicated later when it becomes
effective.


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

From: Niels R. Walet <walet@walet.physics.upenn.edu>
Date: Mon, 10 May 93 14:12:20 -0500
Subject: Non-linear Equations

I am currently trying to solve a problem of the form
H_i(x) = \lambda f^1_i(x) + \mu f^2_i(x)
M_{ij}(x) f^n_j = \Omega^n f^n_j
Here \lambda and \mu are two parameters that are used to map
out a two dimensional manifold. The problem is in finding
a stable and trustworthy algorithm to do so. This is surprisingly
hard compared to the equivalent one dimensional problem.
Using the vectors f^1 and f^2 as a local basis does not work,
since we have points with degenerate eigenvalues in the problem,
where the coordinate system determined by f^1 and f^2 becomes
singular, while the manifold is smooth.
The ``best'' solution I have found up till now is to write an
alternative set of equations, using an appropriate set of ``good''
coordinates q_i, of the following form:
H_i(x) = \lambda' g^1_i(x) + \mu' g^2_i(x)
q_1(x) = q_1^0
q_2(x) = q_2^0
where
g^1_i(x) = M_{ij}H_j(x)
g^2_i(x) = M_{ij}g^1_j(x)
We now have a completely determined set of non-linear equations,
that can be solved at each point \vec{q}^0. This can be solved
locally, starting from a point x_0 where H_i(x_0) = 0, which
is easy to obtain. Using the routine hybrid from minpack leads to
partial success, i.e. it converges reasonably well at many points
of the surface, but for unknown reasons it does not converge
at some points.
After this lengthy introduction the question is whether anyone
out there has any ideas or suggestions how to solve problems
like this. Has anyone seen similar problems with different
solutions? Any help would be appreciated.

Niels R. Walet tel (215)898-8148
Dept of Physics fax (215)898-2010
University of PA
Philadelphia PA 19104 walet@walet.physics.upenn.edu


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

From: Vincenzo De Florio <edf@minsky.csata.it>
Date: Thu, 13 May 93 17:52:46 METDST
Subject: An Optimization Problem

We need informations about algorithms concerning Optimal
Cutting of Leather. We'll be very grateful for any suggestions
about literature, software, research groups about this argument.

Thank you very much,

Vincenzo De Florio
SASIAM / Tecnopolis


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

From: Peng Li <peng@fourier.csata.it>
Date: Fri, 14 May 93 9:46:41 CET
Subject: Nesting Optimization

Hi,
I'm looking for information about Nesting optimization problem.
I would be very appreciated if someone could tell me where I can
get it and whether the relative routine exists in the public domain.
Also I am interesting to know if there is any package of integer
programming in the PD.
Thanks in advanced for your help.


Peng Li
Tecnopolis-SASIAM
Valenzano (BA)
Italy


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

From: Taketomo Mitsui <a41794a@nucc.cc.nagoya-u.ac.jp>
Date: Mon, 10 May 93 11:38:23 JST
Subject: Inverse Problems in Engineering Sciences

IPES-94

The Second International Symposium
"Inverse Problems in Engineering Sciences"

27 - 30 July, 1994, Osaka, Japan

Objectives:
Inverse problems have become one of the major topics in the various
fields of science. The researchers on these problems are supported by
the development of computational methods and give us new technology
related with, for example, tomography and remote sensing. There are
many mathematical problems left to be solved in the field of inverse
problems, while we often succeed in practical treatments of them. Math-
ematical analyses of them are, undoubtedly, indispensable for further
development of their practical treatments, and such treatments also give
some clues to their mathematical ones.
The cooperation between practitioners in the inverse problems and
mathematicians interested in their theoretical aspects must stimulate
each other to lead fruitful results. For the interdisciplinary discus-
sions in the field of inverse problems, we had the first international
symposium "Inverse Problems in Engineering Sciences (IPES-90)" at Osaka
in 1990 with great success. The symposium of this time is the second
one, whose purpose is expansion of collaboration in the field of inverse
problems for theoretical as well as practical aspects.

Symposium topics:
inverse scattering problems, identification of unknown coefficients in
equations, determination of boundaries or domains, parameter estimation,
ill-posed problems in natural sciences, numerical analysis and synthesis
for these problems.

Chairman: Prof. Takaaki Nishida, Dept. Math., Kyoto Univ.
Date: 27 - 30 July, 1994
Venue: Osaka Institute of Technology, Osaka, Japan

If you are interested in IPES-94, please contact to
Prof. Kenji Tomoeda
Osaka Institute of Technology
5-16-1 Ohmiya Asahi, Osaka 535, Japan
Fax: +81-6-957-2137

Remark:
The Third World Congress on Computational Mechanics (WCCMIII) [see
NA Digest Volume 92 Issue 7] will be held in Chiba, Japan just after
IPES-94.


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

From: Lothar Reichel <reichel@mcs.kent.edu>
Date: Tue, 11 May 93 16:03:12 EDT
Subject: Electronic Transactions on Numerical Analysis

Call for Papers
Electronic Transactions on Numerical Analysis

Scope:

Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal
for the publication of significant new and important developments in numerical
analysis and scientific computing. Papers of the highest quality that deal with
the analysis of algorithms for the solution of continuous models and numerical
linear algebra are appropriate for ETNA, as are papers of similar quality that
discuss implementation and performance of such algorithms. New algorithms for
current or new computer architectures are appropriate provided that they are
numerically sound. However, the focus of the publication should be on the
algorithm rather than on the architecture. The journal is published by the Kent
State University Library in conjunction with the Institute of Computational
Mathematics at Kent State University. Mathematical Reviews will receive all
papers accepted for publication in the journal and review them as appropriate.
ETNA is registered with the Library of Congress and has ISSN 1068-9613.


Dissemination:

On a quarterly basis, accepted manuscripts will be posted in a directory which
is publicly accessible through Internet. The titles and abstract of these
manuscripts will be e-mailed to registered departments and individuals and
posted on public bulletin boards such as NA-digest. An individual who wishes
to obtain a copy of a current or back manuscript can get a copy through
anonymous FTP or by using a netlib-type mailer. We also plan to install
Gopher. All manuscripts will be available in Post Script format. The first
issue of ETNA will appear September 1, 1993. Funds made available by the
Kent State University Library and the Kent State University make free
subscription possible for at least three years. After this time period we
may have to charge an annual fee from institutional subscribers. Since the
operating costs for the journal are low, we envision that this fee will not
be above $100 for institutional subscribers. Everybody at the subscribing
institution will have access to ETNA by FTP, a netlib-type mailer or Gopher.
In addition, articles in ETNA can be obtained through interlibrary loan from
Kent State University Library.

To register to receive ETNA's quarterly titles and abstract lists, please send
an e-mail message to etna@mcs.kent.edu. The subject of the message should be:
ETNA registration. Titles and abstracts of papers published in ETNA will be
e-mailed quarterly to the return addresses of all such requests. Inquiries for
further information should also be e-mailed to etna@mcs.kent.edu.


Submission, Acceptance and Refereeing:

Authors will normally submit papers for publication via e-mail, and they will
be required to submit their manuscript in LaTeX or TeX using macros we provide.
Requests for macros can be sent by e-mail to etna@mcs.kent.edu. All papers will
be refereed. As soon as a paper has been accepted for publication in ETNA, it
will be entered into the ETNA data base. There are no annual page limitations,
and, therefore, we are in a position to publish accepted manuscripts faster
than many other journal. Manuscripts can be submitted NOW by sending them to
the address etna@mcs.kent.edu.

Current Editorial Board:

L. Reichel Kent State University
editor-in-chief reichel@mcs.kent.edu

R.S. Varga Kent State University
editor-in-chief varga@mcs.kent.edu

A. Ruttan Kent State University
managing editor ruttan@mcs.kent.edu

G.S. Ammar Northern Illinois University
J.W. Demmel University of California, Berkeley
J.J. Dongarra University of Tennessee
I.S. Duff Rutherford Appleton Laboratory
M. Eiermann University of Karlsruhe
J.A. George University of Waterloo
G.H. Golub Stanford University
W.B. Gragg Naval Postgraduate School
M.H. Gutknecht Swiss Federal Institute of Technology
V. Mehrmann Technical University of Chemnitz-Zwickau
D.C. Sorensen Rice University
G.W. Stewart University of Maryland
O.B. Widlund New York University


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

From: Julio G. Dix <JD01%SWTEXAS.BITNET@ricevm1.rice.edu>
Date: Fri, 14 May 93 10:48 CDT
Subject: Electronic Journal of Differential Equations

ELECTRONIC JOURNAL OF DIFFERENTIAL EQUATIONS. (EJDE)

The EJDE is published by Southwest Texas State University and
the University of North Texas. This is a strictly electronic journal:
Articles are to be submitted and then provided to the mathematical
community electronically.

SCOPE
The EJDE will accept only first-rate original work, subject to as
rigid a peer review process as is applied by the finest of today's
journals.

DISSEMINATION
Abstracts of articles will be sent to subscribers as soon as accepted
for publication (free of charge). Manuscripts and abstracts will be
posted in a directory which is publicly accessible through Internet.
Also, the American Mathematical Society will provide access to this
journal through the E-math gopher.
Manuscripts will be available as TeX files. Which means that your
local computer needs TeX processing facilities. Manuscripts can be
obtained also as also as DVI or POSTSCRIPT files.
Hard copies will be preserved for posterity. The publishers will
originate and maintain copies at the libraries of both institutions.
Photocopies of articles can be obtained from these libraries using the
Interlibrary Loan system. (We are in the process of obtaining the ISSN
number.)
For information through internet make sure your computer emulates a
VT100 terminal and the type
telnet ejde.math.unt.edu
at the login prompt type "gopher" (without quotations), then select 1
for EJDE and follow the instructions on the screen.

EDITORIAL BOARD

P. Bates (Brigham Young University)
A. Bloch (Ohio State University)
J. Bona (Pennsylvania State University)
L. Caffarelli (Institute for Advanced Study)
C. Castillo-Chavez (Cornell University)
C. Chui (Texas A & M University)
M. Crandall (University of California at Santa Barbara)
E. Di Benedetto (Northwestern University)
G. B. Ermentrout (University of Pittsburgh)
J. Escobar (Indiana University)
L. C. Evans (University of California at Berkeley)
J. Goldstein (Louisiana State University)
C. Groetsch (University of Cincinnati)
I. Herbst (University of Virginia)
C. Kenig (University of Chicago)
R. Kohn (Courant Institute)
A. Lazer (Miami University)
J. Neuberger (University of North Texas)
P. Rabinowitz (University of Wisconsin)
R. Shivaji (Mississippi State University)
R. Showalter (University of Texas)
H. Smith (Arizona State University)
P. Souganidis (University of Wisconsin)
N. Walkington (Carnegie-Mellon University)
P. Waltman (Emory University)

SUBMISSIONS
Submissions should be files in one of the following formats:
TeX, LaTeX, AMS (LaTeX or TeX). Graphics can be attached using either
PicTeX or Postcript. There is no page charge.
We are accepting manuscripts NOW; send your files via E-mail to
editor@ejde.math.unt.edu
Please keep a copy of your submissions; we are not responsible for
lost files.

COPYRIGHTS
By submitting a manuscript the author(s) agree that the copyright
of the article is transferred to the publisher if and when the
article is accepted for publication.


Thanks for your attention and I am looking forward to see your
sumissions to the EJDE.

Julio G. DiX
Department of Mathematics
Southwest Texas State University.


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

From: Dugald Duncan <dugald%cara.ma.hw.ac.uk@ib.rl.ac.uk>
Date: Fri, 14 May 93 16:02:32 BST
Subject: Scottish Computational Maths Syposium 1993

SCOTTISH COMPUTATIONAL MATHEMATICS SYMPOSIUM 1993

One Day Conference
Monday 13th September 1993
University of Edinburgh
George Square Campus

This is the second annual symposium aiming to bring together
mathematicians and others who develop and/or use computer algorithms to
solve mathematical problems. We have reduced this year's programme to
four speakers to allow more time for discussion between talks and have
included a contributed poster display (see below), which we hope will
cover a wide variety of topics in computational mathematics.

SPEAKERS

J.C. Eilbeck (Heriot-Watt University)
Quantum mechanics, Mathematica and the eigenvalues of tridiagonal matrices

D.J. Higham (Dundee University)
Global errors in numerical time-stepping

K.W. Morton (Oxford University)
Cell vertex methods for steady systems of conservation laws

A.J. Wathen (Bristol University)
The convergence of preconditioned Krylov-subspace iterations for the
Stokes and Navier-Stokes equations

POSTER CONTRIBUTIONS are welcome, but the display space is limited so
please contact us if you want to present one.

PROGRAMME STARTS 10-10:30am

REGISTRATION FEE.
A small fee will be charged to offset costs and will cover tea breaks
and lunch.

FURTHER INFORMATION from the oragnisers

Dr. D.B. Duncan Prof. D.M. Sloan
Department of Mathematics Department of Mathematics
Heriot-Watt University University of Strathclyde
Edinburgh EH14 4AS Glasgow G1 1XH

dugald@uk.ac.hw.ma.cara d.sloan@uk.ac.strath.vaxe


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

From: Nancy Nichols <SMSNICHO@cms.am.cc.reading.ac.uk>
Date: Fri, 14 May 93 16:32:35 BST
Subject: Sixth Leslie Fox Prize

SIXTH LESLIE FOX PRIZE

The Adjudicating Committee (N.K. Nichols, C.M. Elliott and C.T.H. Baker)
have selected six papers, from the nineteen entries that were submitted for
the Sixth Leslie Fox Prize, to be presented by their authors at a
meeting to be held at the University of Oxford on Thursday, June 24, 1993.
The submitted papers were all of an excellent standard and the selection
process was as difficult as ever.

You are cordially invited to attend this meeting and also the Symposium in
Honour of Leslie Fox which is being held in conjunction with the prize
meeting in Oxford on June 24 and 25. At the prize meeting, some of the best
young numerical analysts will be talking about their research. The selected
speakers, in alphabetical order, are:

A. Edelman (University of California, Berkeley)
"Eigenvalue Roulette and Random Test Matrices"

D.J. Higham (University of Dundee)
"The Dynamics of Variable Stepsize Runge-Kutta Algorithms"

Z. Jia (University of Bielefeld)
"Generalized Block Lanczos Methods for Large Unsymmetric Eigenproblems"

Y. Li (Cornell University)
"On the Convergence of Reflective Newton Methods for Large-scale
Nonlinear Minimization Subject to Bounds"

P. Lin (Oxford University)
"Characteristic Galerkin Schemes for Scalar Conservation Laws in
Two Space Dimensions"

R. Mathias (University of Minnesota)
"The Stability of Parallel Prefix Matrix Multiplication with
Applications to Tridiagonal Matrices"


After the prizes are awarded, Professor Gene Golub will be giving an invited
talk. This will be followed by a sherry reception in Balliol College.
A fee of #20 (#10 for students) will be charged, including lunch in Balliol
College, morning and afternoon coffee/tea, and the reception. The Symposium
in Honour of Leslie Fox will continue on Friday, June 25, with talks by
a number of friends and colleagues associated with Leslie's career.
A dinner will be held in Balliol College on the evening of June 24 to
which all are welcome.

If you wish to attend the Leslie Fox Prize Meeting and/or the Symposium
in Honour of Leslie Fox, please contain Joan Himpson at the address given
below. The prize talks are open freely, but bookings for lunch and the
reception will be needed in advance. Further information about the
Symposium programme can be obtained from the Chairman of the Adjudicating
Committee, Dr. N.K. Nichols, or from Joan Himpson at the Oxford University
Computing Laboratory.

Any funds raised from the meeting are to be contributed to the Leslie Fox
Prize Fund. This year a special effort is being made to establish the
Fund on a sound financial basis, to ensure the continuation of the Prizes in
the future. Additional donations to the capital fund are, therefore,
particularly welcome this year.

For more information, contact
Joan Himpson, Oxford University Computing Laboratory,
8/11 Keble Road, Oxford OX1 3QD UK
e-mail: Joan.Himpson@comlab.oxford.ac.uk


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

From: Gene Golub <golub@sccm.Stanford.EDU>
Date: Fri, 14 May 93 10:54:45 PDT
Subject: International Meeting on Vector and Parallel Processing

FIRST ANNOUNCEMENT AND CALL FOR PAPERS
FIRST INTERNATIONAL MEETING ON VECTOR AND PARALLEL PROCESSING

Faculdade de Engenharia da Universidade do Porto
Porto, Portugal

1993 29th September - 1st October

The Meeting is interdisciplinary in nature, bringing together people from
Science, Engineering and Industry to explore some of the many challenges and
promises of vector and parallel processing. The event aims at disseminating
state-of-the art knowledge on the topic and at providing a forum for
presentation and discussion of basic research and applications in this area.
The focus of the scientific section of the Meeting will be some invited
lectures to describe the concepts behind vector/parallel processing and to
highlight some of the major trends in the field. After these main talks,
contributed papers of approximately 20 minutes duration will be presented.

Topics of Interest

Topics include, but are not limited to:

-General architecture concepts, enabling technologies
-Operating systems, languages, environments and software tools
-Software and hardware performance
-Numerical algorithms
-Applications in Science and Engineering
-Industrial systems and applications

Paper Submissions

Participants interested in submitting papers or posters for the scientific
sessions, are asked to submit an extended abstract before May 31. This abstract
(limited to 1500 words ) should include the summary, as it will appear in the
final paper. The full paper may be attached to the extended abstract. Every
submission should include the name, affiliation, mail address, phone number,
E-mail address and fax number (if available) of one of the authors
who will act as the contact point.

Exhibition

In addition to the regular sessions there will be demonstrations of commercial
hardware and software systems. All national and foreign firms are invited to
take part in this exhibition. Proposals for demonstrations should be sent to
the contact address (see below) not later than July 5.

Deadlines

Extended abstracts due: May 31
Notification of acceptance: July 5
Final papers due: August 16
Demonstrations proposals: July 5
Demonstration acceptance: July 19

Language

The official language of the Meeting is English.

Support

Support from the following scientific entities has already been confirmed:

Faculdade de Engenharia da Universidade do Porto
Fundacao de Calculo Cientifico Nacional
Institute of Electrical and Electronics Engineers
Instituto de Engenharia Mecanica e Gestao Industrial
Ordem dos Engenheiros

Organizing Committee

Ligia Maria Ribeiro
Filomena Dias d'Almeida
Joao Falcao e Cunha
Joao Pecas Lopes
Jose Laginha Palma

Additional Information

If you would like to be on the mailing list to receive additional information
on the meeting, please write to the contact address.

Contact Address

Ligia Maria Ribeiro email: lmr@fe.up.pt
FEUP-CICA fax: 351-2- 318787
Rua dos Bragas phone: 351-2-2082071
4099 Porto Codex
Portugal


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

From: Christopher TH BAKER <cthbaker@manchester.ac,uk>
Date: Wed, 12 May 93 13:20:46 BST
Subject: Position at the University of Manchester

Temporary Position in Numerical Analysis at The University of Manchester,
Oxford Rd., Manchester M13 9PL England.

The Department of Mathematics has funds to support a temporary lectureship
at the starting point of the lecturer scale for the academic session
1993-4 (end September 93 to start October 94) to cover certain teaching
duties in the Mathematics Dept., probably exclusively in
Numerical Analysis, and to pursue mathematical research interests.
It might be possible to appoint for a shorter time at a
higher point on the lecturer scale; the starting point is understood to
be \Pounds 13400 per 12 months (under review). Nationals of non-EC countries
would probably require a work permit. Interested persons should send a
brief cv. marked for the attention of Prof Christopher Baker to
Mrs Jackie Furby at the above address, or Fax Intl + 44 -61 275 5819,
or e-mail: mbbmath@uk.ac.mcc.cms
stating the names of two referees and including a statement of
nationality and dates of availability.
A file nagroup.dvi describing the research interests of the Numerical
Analysis Group is available by anonymous ftp from Internet address
130.88.16.10 in /pub/na.


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

From: Dave Dodson <dodson@wagner.convex.com>
Date: Fri, 14 May 93 15:56:53 -0500
Subject: Position at Convex Computer Corporation

CONVEX COMPUTER CORPORATION
Senior Mathematical Software Development

Background: CONVEX Computer Corporation designs, develops, manufactures,
and markets affordable supercomputers for the high-performance engineering
and scientific computing marketplace. CONVEX's Mathematical Software Group
is chartered with producing efficient, robust mathematical software,
packaged as subroutine libraries, that can be incorporated into customers'
FORTRAN programs to ease program development, conversion, and optimization.

Responsibilities: You will lead a project to develop and maintain highly
efficient mathematical software subroutines for inclusion in product such
as the CONVEX VECLIB Library. Responsibilities include planning,
coordinating, and executing project activities, tracking and reporting
project status, and coordinating with other development teams.

Job Requirements: U.S. Citizenship or Permanent Residency. Strong
background in numerical analysis and scientific computing, including
computational linear algebra or the Finite Element Method. Five or more
years experience in applying computers to real world problems. Five or
more years of FORTRAN programming experience.

Desired Experience: Experience in mathematical library software development.
Familiarity with parallel, vector, or RISC processors. A working knowledge
of UNIX and an assembly language. Software project management experience.

Education: Preference will be given to applicants with an advanced degree
in a relevant discipline.

Special Skills: Excellent interpersonal and communication skills are
required. The applicant should be able to deal directly with customers
to determine software design requirements and solve problems.

For immediate consideration, please send your resume, in confidence, to
David Gray
CONVEX Computer Corporation
P.O. Box 833851
Richardson, Texas 75083-3851
email: dgray@convex.com (please follow up with hard copy)

CONVEX is an equal oportunity employer, M/F/D/V.


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

From: E. B. Saff <esaff@szego.math.usf.edu>
Date: Mon, 10 May 93 10:45:53 EDT
Subject: Contents, Constructive Approximation

CONSTRUCTIVE APPROXIMATION
Special Issue: WAVELETS
Issue Editors: R.A. DeVore and C.A. Micchelli


Contents
Volume 9 Numbers 2-3 1993

Preface, 121
Ronald A. DeVore and Charles A. Micchelli

On the Construction of Multivariate(Pre) Wavelets, 123-166
Carl de Boor, Ronald A. DeVore, and Amos Ron

On Trigonometric Wavelets, 167-190
C.K. Chui and H.N. Mhaskar

Orlicz Spaces, Spline Systems, and Brownian Motion, 191-208
Z. Ciesielski

Compactly Supported Bidimensional Wavelet Bases with Hexagonal
Symmetry, 209-236
A. Cohen and J.-M. Schlenker

Wavelet-Galerkin Methods: An Adapted Biorthogonal Wavelet Basis,
237-262
Stephan Dahlke and llona Weinreich

Banded Matrices with Banded Inverses, II: Locally Finite
Decomposition of Spline Spaces, 263-281
Wolfgang Dahmen and Charles A. Miccchelli

Irregular Sampling of Wavelet and Short-Time Fourier Transforms,
283-297
Karlheinz Grochenig

A Bernstein-Type Inequality Associated with Wavelet
Decomposition, 299-318
Rong-Qing Jia

A Note on Orthogonal Polynomial Bases and Wavelets, 319-325
D. Offin and K. Oskolkov

Wavelets and Self-Affine Tilings, 327-346
Robert S. Strichartz

Construction of Compact p-Wavelets, 347-370
Grant V. Welland and Matthew Lundberg


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

From: Ron Boisver <boisvert@cam.nist.gov>
Date: Fri, 14 May 93 11:05:26 EDT
Subject: Contents, ACM Transactions on Mathematical Software

Table of Contents
ACM Transactions on Mathematical Software
Volume 19 Number 2 (June 1993)

Computing Selected Eigenvalues of Sparse Unsymmetric Matrices Using
Subspace Iteration
I.S. Duff and J.A. Scott

The Generalized Schur Decomposition of an Arbitrary Pencil A-\lambda B:
Robust Software with Error Bounds and Applications. Part I: Theory and
Algorithms
James Demmel and Bo Kagstrom

The Generalized Schur Decomposition of an Arbitrary Pencil A-\lambda B:
Robust Software with Error Bounds and Applications. Part II: Software
and Applications
James Demmel and Bo Kagstrom

On Computing Condition Numbers for the Nonsymmetric Eigenproblem
Z. Bai, J. Demmel and A. McKenney

Algorithm 718: A FORTRAN Subroutine to Solve the Eigenvalue Allocation
Problem for Single-Input Systems
George Miminis and Michael Reid

Enhancements of ANALYZE: A Computer-Assisted Analysis System for Linear
Programming
Harvey J. Greenberg

Implementation and Computational Results for the Hierarchical Algorithm
for Making Sparse Matrices Sparser
S. Frank Chang and S. Thomas McCormick

Generating a Sample from a k-Cell Table with Changing Probabilities
in O(log_2 k) Time
George S. Fishman and L. Stephen Yarberry

A Noniterative Thinning Algorithm
Christian Neusius and Jan Olszewski


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

End of NA Digest

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