NA Digest Sunday, October 27, 1996 Volume 96 : Issue 40

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: Daoud S. Daoud <>
Date: Fri, 25 Oct 1996 11:22:37 EET +0200 DST
Subject: Articles on Polynomial Preconditioning and Domain Decomposition

Dear all "na-neters"

I am working on a project concerning the Poynomial Preconditioing and
Domain Decomposition. I would appreciate your kindest to send me copies
of your articles concerning the above two topics.
Kindest Regards

Daoud S Daoud
Dept of Mathematics
Eastern Mediterranean Univ
G Magusa/N-Cyprus
Via-Mersin 10-Turkey
E mail


From: Hans Mittelmann <>
Date: Sat, 26 Oct 1996 11:58:52 -0700
Subject: Benchmarks for Optimization Codes

Recently, I have started a webpage listing benchmark results for
optimization codes, mostly those in the public domain. It is located at

and is really part of the webpage "Decision Tree for Optimization Software", that Peter Spellucci and I are maintaining.

Presently, there are two own benchmarks and one link:

1) Benchmark of some public domain interior point LP solvers
2) Benchmark of LANCELOT and SNOPT on the large CUTE testset
3) Results for PCx on a large number of platforms
(netlib and other testproblems)

Other benchmark results will be added in the near future. Comments are
welcome as are suggestions for other benchmarks to be done or hints to existing
results which could be added resp. be linked to.

Hans D. Mittelmann WWW:
Arizona State University Phone: (602) 965-6595
Department of Mathematics Fax: (602) 965-0461
Tempe, AZ 85287-1804 email:


From: Marcin Paprzycki <>
Date: Sat, 26 Oct 1996 19:03:00 -0500 (CDT)
Subject: Structured Matrix Problems


High Performance Algorithms for Structured Matrix Problems

edited by: Peter Arbenz, Marcin Paprzycki, Ahmed Sameh

The volume has three goals. First, to summarize the state of the art in
the area of high performance solution of structured linear systems as well
as of structured eigenvalue and singular-value problems. Second, to
indicate what research directions are perceived as the most important for
the future. Third to provide a collection of algorithms and ideas that
may enhance future development in this area.

Detailed information about the volume can be found at:

To contribute, please send 6 hard copies of the paper (or PREFERABLY,
submit your paper electronically -- prepared in plain LaTeX or PostScript)

November 22, 1996

to one of the editors. The volume is expected to be published in 1997.

Peter Arbenz Marcin Paprzycki Ahmed Sameh
Inst. of Sci. Comp. Dept. of Math. & CS Dept. of Comp. Sci.
ETH Zurich UTPB Univ. of Minnesota
8092 Zurich Odessa, TX 79762 Minneapolis, MN 55455
Switzerland USA USA


From: Cliff Addison <>
Date: Thu, 24 Oct 1996 10:16:50 +0100
Subject: Change of Address for Cliff Addison

I have moved from the University of Liverpool to the new Fujitsu
European Centre for Information Technology (FECIT). My address and
other contact details are now:

Cliff Addison
Research Manager
Fujitsu European Centre for
Information Technology Ltd.
2 Longwalk Road
Stockley Park, Uxbridge
Middlesex, England UB11 1AB

TEL: +44 (0)181 606 4518
FAX: +44 (0)181 606 4422



From: Vladik Kreinovich <>
Date: Thu, 24 Oct 96 15:53:45 MDT
Subject: Student Paper Award for Reliable Computing

1996 Best Student Paper Award for the "Reliable Computing" Journal

In 1993, the editorial board of the "Interval Computations" journal
(now called "Reliable Computing") announced that papers submitted for
the special student issue will be automatically entered
into an annual Best Student Paper contest.

The referee reports and the reports from the members of the editorial
board of "Reliable Computing" served as the basis for choosing the best paper.
It was a difficult decision to make because we have received several
excellent papers.

We are pleased to announce the results. The 1996 best student paper award
is awarded to the paper "Newton's constant of gravitation and verified
numerical quadrature" by Oliver Holzmann, Bruno Lang, and Holger Schuett.
This paper is published in "Reliable Computing", 1996, Vol. 2, No. 3,
pp. 229-240.

In addition to being a very good paper, it is devoted to an important
application (measuring the gravitational constant) that has led to a
good publicity for interval computations (in "Discover", one of the
major popular science journals).

Congratulations to Oliver Holtzmann, the student author of this paper,
and thanks to all other students authors for their excellent job.

Vladik Kreinovich and Guenter Mayer
co-editors of the student issue

P.S. Detailed information about the journal and about the field in
general can be found on the website


From: Bart DeMoor <>
Date: Thu, 24 Oct 1996 15:26:50 +0200
Subject: New Book on Subspace Identification for Linear System

Title: Subspace Identification for Linear System
Theory, Implementation, Applications

Authors: Peter Van Overschee (Katholieke Universiteit Leuven)
Bart De Moor (Katholieke Universiteit Leuven)

Publisher: Kluwer Academic Publishers, PO Box 17,
3300 AA Dordrecht, The Netherlands

254 pp. Hardbound/ISBN: 0 7923 9717 7

Contains floppy disk with Matlab files for subspace identification

Price: USD: 105, NLG: 195, GBP: 74.75

Publication date: May 1996

More information:

Website with ordering form:


This book focuses on the theory, implementation and applications
of subspace identification algorithms for linear time-invariant
finite-dimensional dynamical systems. These algorithms allow for
a fast, straightforward and accurate determination of linear
multivariable models from measured input-output data.

The theory of subspace identification algorithms is presented in detail.
Several chapters are devoted to deterministic, stochastic and combined
deterministic-stochastic subspace identification algorithms.
For each case, the geometric properties are stated in a main 'subspace'
Theorem. Relations between existing algorithms and literature are
explored, as are the interconnections between different subspace
algorithms. The subspace identification theory is linked to the theory
of frequency weighted model reduction, which leads to new implementations
and insights.

The implementation of subspace identification algorithms is discussed
in terms of the robust and computationally efficient RQ and singular
value decompositions, which are well-established algorithms
from numerical linear algebra. The algorithms are implemented in
combination with a whole set of classical identification algorithms,
processing and validation tools in Xmath's ISID, a commercially available
graphical user interface toolbox. The basic subspace algorithms in
the book are also implemented in a set of Matlab files accompanying
the book.

One application of ISID to an industrial glass tube manufacturing
process is presented in detail, illustrating the power and
user-friendliness of the subspace identification algorithms and of
their implementation in ISID. The identified model allows for an
optimal control of the process, leading to a significant enhancement of
the production quality. The applicability of subspace identification
algorithms in industry is further illustrated with the application of
the Matlab files to ten practical problems. Since all necessary
data and Matlab files are included, the reader can easily step through
these applications, and thus get more insight in the algorithms.


From: Stefan Vandewalle <>
Date: Mon, 21 Oct 1996 14:51:18 +0200
Subject: Domain Decomposition Course

The Belgian Scientific Research Community `Advanced Numerical Methods for
Mathematical Modelling' and the Belgian Interuniversity Pole of Attraction
`Modelling, Simulation and Control of Complex Systems' organise a

18 - 19 December, 1996
at the Katholieke Universiteit Leuven, Belgium

The aim of the course is to introduce the basic ideas of domain decomposition,
to provide insight in their mathematical background and to illustrate how they
can be used in various application areas. The course will last for two days,
with 6 hours of lectures each.

Wednesday December 18th, 1996
Introduction to Domain Decomposition Methods (Barry Smith, Argonne Nat. Lab.)

+ Why Domain Decomposition?
+ Multilevel Overlapping Domain Methods
+ Schur Complement Methods
+ Commonalities Between Domain Decomposition Methods: An Introduction
to the Mathematical Theory

Thursday December 19th, 1996
Applications of Domain Decomposition Methods

+ General Purpose Software for Linear Solvers using Overlapping
Schwarz Methods (Barry Smith, Argonne Nat. Lab.)
+ Local Coupling in Domain Decomposition: Experiences in
Hydrodynamic Applications (Kian Hien Tan, Delft Hydraulics)
+ Parallel Domain Decomposition Methods for Solving Large
Electro-Magnetic Problems (Frederic Lafon, Thomson CSF)
+ The Dual Schur Complement Method and its Application to
Structural Analysis Problems (Francois-Xavier Roux, ONERA)
+ Domain decomposition and coupling for some CFD problems
(Choi-Hong Lai, Univ. Greenwich)

More information, together with a registration form, can be obtained
at the URL

Stefan Vandewalle email:
Katholieke Universiteit Leuven tel: +32-16-327654
Departement Computerwetenschappen fax: +32-16-327996
Celestijnenlaan 200A, B-3001 Heverlee, Belgium


From: Daoqi Yang <>
Date: Mon, 21 Oct 1996 16:31:52 -0500
Subject: Special Session on Partial Differential Equations

Special Session on Partial Differential Equations:
Theories, Applications and Numerical Approaches
at the AMS Central Section Meeting to be held at
Wayne State University, Detroit, MI, May 2-4 1997.

You are invited to participate in and give a talk on theoretical,
practical, or numerical aspects of partial differential equations
at the AMS Meeting to be held in Wayne State University, Detroit,
Michigan, May 2-4, 1997.

Scope: This Special Session aims at fostering discussion and
cooperation among practitioners and theoreticians in the
field of linear and nonlinear partial differential equations.
Papers for oral presentation are solicited in all research areas
related to theory, applications, and computational aspects of
differential equations.

Submission: Please submit the title and one-page long abstract
of your talk via e-mail to:, or via postal mail
to: Dr. Daoqi Yang, Institute for Mathematics and its Applications,
University of Minnesota, 514 Vincent Hall, 206 SE Church Street,
Minneapolis, Minnesota 55455-0436. The abstract can be typed in
plain text, LaTex, AMSTex or AMSLaTex.

Deadline: The deadline for submission of abstracts is
January 16, 1997.

Organizing Committee of the Special Session:
Frank Massey (Univ of Michigan-Dearborn)
Jennifer Zhao (Univ of Michigan-Dearborn)
Daoqi Yang (Univ of Minnesota)


From: Frederic Nataf <>
Date: Wed, 23 Oct 1996 14:05:46 +0100
Subject: Interface Conditions for Domain Decomposition Methods

Call For Papers
Tenth International Conference on Domain Decomposition Methods
August 10-14, 1997, University of Colorado, Boulder, Colorado

Scope and Objectives:

This Minisymposium will provide a forum for discussing state-of-the-art
in the choice of interface conditions . Papers are solicited in the
following areas:

o Electromagnetism
o Fluid Dynamics
o Solid Mechanics
o Fluid Structure Interaction
o Overlapping/Nonoverlapping subdomains
o Non matching grids
o Coupling of equations/models
o Theoretical results

If you are interested in contributing to "OPTIMIZATION OF INTERFACE CONDITIONS",
please contact Frederic Nataf ON or BEFORE January 8, 1997 and enclose a
short abstract (up to 200 words) of your contribution.

Frederic Nataf,
Centre de Mathematiques Appliquees, CNRS URA756
Ecole Polytechnique Tel: 33 (1) 69 33 45 63
91128 Palaiseau Cedex Fax: 33 (1) 69 33 30 11
France e-mail:


From: Deakin University <>
Date: Thu, 24 Oct 1996 19:09:01 +1000
Subject: Australian Applied Mathematics Conference

The annual conference of
a division of the Australian Mathematical Society
2 - 6 February, 1997

The Second circular and Registration form for this conference have
been posted to all members of ANZIAM and to Mathematics and
Engineering Departments Australia wide and to other interested
parties. If you do not receive a copy within the next week feel
free to email us to have one sent.

VENUE: Erskine House, Lorne, Victoria

INVITED SPEAKERS: Prof Phil Davis, Brown University, USA
Prof James Greenberg, Carnegie Mellon
University, USA
Prof Tony Guttmann, University of Melbourne,
Prof Alexei Pokrovskii, Russian Academy of
Sciences, Moscow, Russia
Prof Andrew Stuart, Stanford University, USA
Prof Andrew Willmott, Keele University, UK

Papers are invited in all areas of Applied Mathematics, including
modelling and applications to real-world phenomena.
Templates in both html and LaTeX forms are available from the home

The conference's commitment to student participation is reflected
in the awarding of the T.M. Cherry Prize. This is awarded to the best
paper presented as a lecture by a student.

The registration fee is AU$200 for ordinary ANZIAM members,
AU$240 for non-members and AU$100 for Student and Senior members.

Post: AMC97
School of Computing & Mathematics
Deakin University, Geelong, Victoria, 3217
FAX: (052) 272 028


From: Chaoqun Liu <>
Date: Thu, 24 Oct 1996 12:00:18 -0500 (CDT)
Subject: AFOSR Conference on Large Eddy Simulation

August 4-8, 1997
Louisiana Tech University, Ruston, Louisiana, USA

I am pleased to announce that the FIRST AFOSR INTERNATIONAL CONFERENCE ON
DNS/LES (FAICDL), sponsored by the US Air Force Office of Scientific
Research (AFOSR), will be hosted by Louisiana Tech University, Ruston,
Louisiana, USA on August 4-8, 1997.

The conference encourages participants to present all
topics related to DNS and LES which include :

. DNS/LES toward understanding fundamental flow physics
. DNS/LES for complex flows
. DNS/LES for flow transition
. DNS/LES for fully developed turbulent flow
. DNS/LES for aeroacoustics
. DNS/LES for heat transfer applications
. DNS/LES for combustion applications
. LES for for atmospheric boundary layers
. DNS/LES for engineering applications
. DNS/LES for transition and turbulence modeling
. Development on filter and subgrid model for LES
. Boundary condition treatment for DNS/LES
. Numerical algorithm developments for DNS/LES
. Parallel computation implementations/applications for DNS/LES

The conference is open to any individual and organizations.
A few fellowships for supporting graduate students to attend the
conference will be provided by the US AFOSR and are open for
application now. Applications should be sent to Dr. Chaoqun Liu
for consideration.

The scientific committee includes:
Chaoqun Liu, Chair (Louisiana Tech )
Len Sakell, Co-Chair (Air Force Office of Scientific Research)
Joe Shang (Wright-Patterson AFB)
Craig Streett ( NASA Langley Research Center)
Ronald Joslin ( NASA Langley Research Center)
Lou Povinelli ( NASA Lewis Research Center)
Nagi Mansour ( NASA Ames Research Center)
Thorwald Herbert (Ohio State University)
Ugo Piomelli (University of Maryland)
George Karniadakis (Brown University)
Hermann Fasel (University of Arizona)
Doyle D. Knight (Rutgers University )
Kenneth Jansen (RPI)
Helen Reed (Arizona State University)
Zhining Liu (Louisiana Tech )
Marcel Lesieur (France)
Arne Johansson (Sweden)
Reda Mankbadi (Egypt)
Frans Nieuwstadt (Netherlands)
Yutaka MIYAKE (Japan)
Zhaoshun Zhang (China)
San-Yih Lin (ChengKung University )
Jeff Chasnov (Hong Kong)

FIRST CALL FOR PAPERS: The conference proceedings will be formally published
by a scientific publisher. The deadline for the extended abstract (2-3 pages)
is March 1, 1997, the acceptance notice will be sent out before May 1, 1997,
and the deadline for the camera-ready paper is June 15, 1997.

Please send an extended abstract with a short vita no later than March 1,
1997 to :

Prof. Chaoqun Liu
FAICDL Chairman
Department of Mathematics and Statistics
Louisiana Tech University
P.O. Box 3189
Ruston, LA 71272-0001, USA
Tel : (318) 257-2257
Fax : (318) 257-3935
email :

For more information, please contact Dr. Chaoqun Liu at (318) 257-2257
or look at


From: Jeanne C. Butler <>
Date: Fri, 25 Oct 1996 15:07:06 -0500
Subject: Supercomputing Program for Undergraduate Research

Cornell Theory Center

1997 Supercomputing Program for Undregraduate Reserach (SPUR)

JUNE 1 - AUGUST 1, 1997

This program offers undergraduate students the opportunity to pursue a
computational science research project while developing skills in the use
of high-performance computing technologies. Students apply to work on a
specific research project under the guidance of a faculty or staff member
at Cornell University. The proposed projects below explore current research
problems in a diversity of areas, such as chemistry, solar convection,
pollution control, fractals, and population modeling. Several of the
projects include a strong visualization component.

Successful applicants will attend, full time, a nine-week training and
research program at Cornell University and will pursue the research
projects using the high-performance computing resources of the Cornell
Theory Center. Students will receive a stipend of $2,000, travel allowance,
room (shared dorm room), and partial board (allowance at campus dining

Applicants must be undergraduate students (graduating not before December,
1997) who are U.S. citizens or permanent residents. Students must have
relevant coursework for their research areas, as well as coursework or
programming experience in Fortran or C. Students who participated in
previous SPURs are not eligible.

Women, minorities, and persons with disabilities are strongly encouraged to
apply. Students from four-year colleges with limited research facilities
are also encouraged to apply.

Applicants must submit a completed application form, two letters of
recommendation, and college transcript(s). Applications must be received by
February 28, 1997. Students will be notified of their acceptance no later
than March 15.

For more information or to receive a hard copy brochure with application
form, contact:

Jeanne Butler
Conference Assistant
427 Rhodes Hall
Cornell Theory Center
Ithaca, NY 14853-3801
Telephone: 607/254-8813
Fax: 607/254-8888

Information and an application are also available via the World Wide Web at:

It is anticipated that this program will be sponsored by the National
Science Foundation; the program is dependent upon approval of funding
through the Research Experiences for Undergraduates Program.


From: Ben Polman <>
Date: Mon, 21 Oct 1996 16:46:42 +0200
Subject: Position at University of Nijmegen

Position at the Faculty of Mathematics and Informatics,
University of Nijmegen

Ph.D. position

There is an opening at the Faculty of Mathematics and Informatics,
University of Nijmegen, the Netherlands of a ph.d. position
(``onderzoeker in opleiding'').
It concerns Functional Languages in Numerical Analysis; a testcase and is a
joint project between prof. O. Axelsson (Numerical Mathematics) and
profs H. Barendregt and M.J. Plasmeijer (Informatics).

The major purpose of the project is to provide evidence that parallel
codes for large scale problems as arising in scientific computing can be
efficiently implemented using functional languages. Specifically, when
solving very large scale systems of equations such as occur for the
Helmholtz equation in 2D and 3D for several frequencies of the
irradiating waves used in ultrasound tomography, for instance, there is a
need to develop new and faster algorithms, which can give an accurate answer
in real time during the examination of the object (such as a human body).
To this end parallel computing must be used with scalable algorithms.
A new class of additive preconditioning multilevel iteration methods
will be developed and compared with previous multiplicative type of
methods. To simplify the programming and to optimize the code for a parallel
environment, existing functional languages will be further developed and used
in an interactive way with program transformation techniques for the iteration
solution code. Such a mode of working requires intensive collaboration from
teams from both mathematics and computer science. For this, the
required supervising personnel as well as hardware, is available locally.

For this position we are searching for a candidate who has finished or will
finish shortly his/her university studies in numerical mathematics or in
informatics and who is at most 26 years of age.
The project requires someone who has extensive knowledge of numerical
mathematics, who has excellent university marks (''cum laude'') and who has a
documented interest for computer science and parallel algorithms.

Appointment will be in temporary service with NWO, the Netherlands
Organization for Scientific Research, for at most four years.
Salary will be Dfl. 2.144 in the first year, rising to Dfl. 3.775
in the fourth year. Women and candidates coming from one of the member
states of the European Union are particularly asked to apply.

Anyone interested in this position who fulfills the above requirements is
requested to apply, preferably via e-mail, to Owe Axelsson
before November 11, 1996.
Adress: O. Axelsson, Faculty of Mathematics and Informatics,
Toernooiveld 1, 6525 ED, Nijmegen, The Netherlands.


From: Mayer Humi <mhumi@WPI.EDU>
Date: Mon, 21 Oct 1996 15:11:50 -0400 (EDT)
Subject: Position at Worcester Polytechnic Institute


Worcester Polytechnic Institute (WPI) is an innovative technological
university in engineering, science, management, humanities, arts and
social sciences with an enrollment of 2,500 undergraduate and 400
full-time graduate students, located in central Massachusetts.

The WPI Mathematical Sciences Department, currently with 22 full time faculty,
provides undergraduate and graduate education through the doctoral level.
Active areas of faculty research include applied mathematics, optimal control,
stochastic processes, statistics, operations research, discrete mathematics,
scientific computation and mathematics education. The department has an
expanding industrial partnership projects program and has been in the
national forefront in educational innovations. Its support facilities include
state of the art research computers and networked workstation laboratories.
For more information see

WPI seeks a dynamic individual who can promote growth in the department's
internationally recognized research program by personal participation and by
attracting several outstanding faculty to fill anticipated openings.
Applicants must have a strong international research reputation. The new
department head will be expected to take a leadership role in educational
innovation. He/she will have the opportunity to expand and develop new
research activities, educational programs, and cooperation with industry.

The beginning date for the appointment will be July 1, 1997.

Nominations for and applications from persons holding a Ph.D. should
be directed to the

Mathematical Sciences Department Head Search Committee,
Dept. E , Office of Human Resources,
Worcester Polytechnic Institute,
100 Institute Road, Worcester, MA 01609-2280


email .

To enrich education through diversity, WPI is an affirmative action,
equal opportunity employer.


From: Daoqi Yang <>
Date: Mon, 21 Oct 1996 15:50:33 -0400
Subject: Position at Wayne State University

Applications are invited for an anticipated tenure-track position
at the rank of Assistant/Associate Professor in computational
mathematics with an emphasis in symbolic computation and its
interaction with algebra and combinatorics. There is also the
possibility of another tenure track position in any area of
specialization. Visiting positions for 1997-98 in any field of
mathematics are also anticipated. Ph.D. in mathematics required.
Applications should include a signed, detailed vita, description
of current research interests, and four letters of recommendation,
including one addressing teaching. Solid evidence of excellence
in teaching at the undergraduate level is preferred over a
statement of teaching philosophy. Send applications to:
Professor William S. Cohn, Department of Mathematics,
Wayne State University, Detroit, Michigan 48202.


From: Achim Schroll <>
Date: Tue, 22 Oct 1996 16:16:43 +0200
Subject: Positions at RWTH, Aachen

RWTH - AACHEN - University of Technology, Germany

announces several positions for postgraduate students within the fields of

Mechanical Engineering,
with specialization in Applied Mechanics/Aeronautics,
Applied and Numerical Mathematics, and
Technical Physics.

Subject to the final granting by the Deutsche Forschungsgemeinschaft a new


SFB 1580:


will start his research work on January 1997 for a first 3 years period.
The collaborative research center has two project areas:

Project area A: Aerodynamics of High Lift and Cruise Configurations

Modulation of vortices for high lift configurations.
Vortex sheets at take of and landing. Elastic high lift
configurations. Multi-scale methods for flow problems.
Wake-jet interaction. Flow transition at wings with
variable geometry. Shock tube transonic tunnel for true
Reynolds number experiments.

Project area B: Interaction of Structural Dynamics and Aerodynamics

Mathematical modelling of supporting wing structures.
Correct mathematical formulation of aeroelastic problems.
Numerical methods for fully coupled aerostructural problems.
Concepts for supporting wing structures and aeroelastic
models for testing. Aeroelastic measuring techniques and
experiments in low speed and transonic wind tunnels.

The level of consistency between reality, mathematical modelling and
numerical simulation is aimed as highly as possible. Therefore a highly
interdisciplinary work is necessary, where each experiment has its
corresponding mathematical and/or numerical partner projects and vice

The successfull candidate is expected to hold a recent and excellent
university degree equivalent to diploma from RWTH - Aachen.
Candidates should be interested to participate in a highly interdisciplinary
project and should be willing to prepare a PhD thesis. In order to promote
women's presence in the Aeronautical Sciences excellent female
candidates are encouraged to apply.

The positions are for 3 years initially (starting in January '97)
and can possibly be extended. For more information please visit
our Web sites:

Applications must be sent to the co-ordinater of the SFB 1580:

Prof. Dr.-Ing. J. Ballmann
RWTH-Aachen, Mechanik,
Templergraben 64,
D-52056 Aachen, Germany.


From: Edit Kurali <>
Date: Fri, 25 Oct 1996 18:07:46 -0400 (EDT)
Subject: Contents, Journal of Approximation Theory

Table of Contents: J. Approx. Theory, Volume 87, Number 1, October 1996

R. K. Beatson and N. Dyn
Multiquadric $B$-splines

Abdullah \c{C}avu\c{s}
Approximation by generalized Faber series in Bergman spaces on finite
regions with a quasiconformal boundary

B. J. C. Baxter and N. Sivakumar
On shifted cardinal interpolation by Gaussians and multiquadrics

Franz Peherstorfer and Robert Steinbauer
Orthogonal polynomials on arcs of the unit circle II. Orthogonal
polynomials with periodic reflection coefficients

A. Boivin and A. H. Nersessian
An example in tangential meromorphic approximation

A. B. J. Kuijlaars
A note on weighted polynomial approximation with varying weights


From: Carlos A. de Moura <>
Date: Tue, 22 Oct 1996 09:47:54 -0200
Subject: Contents, Computational and Applied Mathematics

Matematica Aplicada e Computacional
Computational and Applied Mathematics
VOLUME 15 (1996), #3

Edited by Birkhauser-Boston and
SBMAC- Brazilian Soc for Computational and Applied Mathematics


P. Schneider &
J.E. Souza Cursi
B.V. Kapitonov
B.V. Kapitonov
Wilfried Grecksch &
Bjorn Schumalfuss
F.E. Menzaque &
C. Patarra
C.J.B. Barros &
L.A.B. San Martin


From: Ake Bjorck <>
Date: Wed, 23 Oct 1996 15:41:39 +0200 (MET DST)
Subject: Contents, BIT

CONTENTS BIT Volume 36, No. 3 (1996)
ISSN 0006-3835

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

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

A curve tracing algorithm for computing the pseudospectrum
M. Br\"uhl, pp. 441--454

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

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

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

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

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

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

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

Solution of large eigenvalue problems in electronic structure
Y. Saad, A. Stathopoulos, J. Chelikowsky, K. Wu, and
S. \"O{\u g}\"ut, pp. 563--578

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

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

Contributions in LaTeX are preferred. Information for subscription and style
files are available from the Editor or from the WWW server for BIT at:


End of NA Digest