### Today's Editor:

- Cleve Moler
- The MathWorks, Inc.
- moler@mathworks.com

- 1992 Chauvenet Prize for David Bailey
- Change of Address for Bill Clinton
- Query about Convex Bodies
- 4th Stockholm Optimization Days
- Conference: Fifty Years of the Courant Element
- Assistant Professorships ETH Zuerich
- Postdoc Position at Maryland/NIH
- Positions in Mathematical Sciences at Tulsa U.
- Lecturership at Deakin University, Australia
- Job Opening at Cornell Theory Center
- Graduate Traineeships at Stanford
- Position at Univ. Calif. Santa Barbara
- Post Doc Position at University of Vermont
- Grand Challenge Applications Groups
- New Journal: Annals of Numerical Mathematics
- Contents: Linear Algebra and its Applications
- Contents: Computational and Applied Mathematics
- Contents: SIAM Numerical Analysis
- Contents: SIAM Optimization

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

From: Horst D. Simon <simon@nas.nasa.gov>

Date: Fri, 5 Feb 93 10:22:11 -0800

**Subject: 1992 Chauvenet Prize for David Bailey**

I am very pleased to announce that the 1992 Chauvenet Prize has been awarded

to my colleague David H. Bailey of NASA Ames Research Center. The prize is

awarded annually by the Mathematical Association of America for a noteworthy

or expository survey paper. David received the prize for the paper

"Ramanujan, modular equations, and approximations to pi or how to compute

one million digits of pi". This is a joint paper with J. M. Borwein and P. B.

Borwein, which appeared in the American Mathematical Monthly, Volume 96, 1989,

pages 201 - 219.

The prize committee has described the accomplishment of the paper as follows:

"The article draws the reader into a delightful look at several areas of

mathematics. There is even an intersting comment on how computation of the

digits of pi is used to test the 'global integrity' of new supercomputers.

Anyone interested in the remarkable insights presented by Ramanujan, details

of numerical computation, use of deep results in modern mathematics to

tackle ancient problems, or simply the developments related to an easily

stated but largely open ended problem, will benefit from reading this article.

The sheer joy of mathematics shines clearly throughout the paper."

Readers of NA-digest may be interested to know that previous recipients

of the Chauvenet Prize include Steve Smale (1988), Jim Wilkinson (1987),

Gilbert Strang (1977), and Cornelius Lanczos (1960), as well as a long list

of distinguished researchers in other areas of mathematics.

Congratulations David!

Horst Simon

NASA Ames Research Center

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

From: Horst D. Simon <simon@nas.nasa.gov>

Date: Mon, 1 Feb 93 15:15:28 -0800

**Subject: Change of Address for Bill Clinton**

Hi Folks,

The following is NOT a joke. It is a real service being

provided by President Clinton. If you feel you have something to say,

send them a letter. I heard they will reply to most messages.

=============

From: The White House <75300.3115@compuserve.com>

As you know, this is the first time in history that the

White House has been connected to the public through electronic mail.

We welcome your comments and suggestions for ways to improve your

Public Access E-mail program.

Jock Gill

Electronic Publishing

Public Access E-mail

The White House

Washington, D.C.

75300.3115@Compuserve.com

CLINTON PZ on America Online

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

From: E. B. Saff <esaff@gauss.math.usf.edu>

Date: Thu, 4 Feb 93 15:37:41 EST

**Subject: Query about Convex Bodies**

Given N points in 3 space , does anyone know of an algorithm

for graphing the convex hull of these points? Also is there

an algorithm for computing the volume of this convex body?

Please contact Ed Saff at esaff@math.usf.edu

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

From: A. Forsgren <andersf@math.kth.se>

Date: Mon, 1 Feb 93 19:41:17 +0100

**Subject: 4th Stockholm Optimization Days**

CALL FOR PAPERS

4TH STOCKHOLM OPTIMIZATION DAYS

We invite theoretical, computational and applied papers for the 4th

Stockholm Optimization Days. The conference will take place at KTH

(Royal Institute of Technology) in Stockholm, Sweden, August 16-17,

1993.

We plan to have sessions on dual optimization methods, inventory

control, structural optimization, power planning and large scale

nonlinear programming among other areas.

Invited speakers include:

M Bendsoe, DTH, Copenhagen

R Bixby, Rice Univ., Houston

A Conn, IBM, Yorktown Heights

J Desrosiers, HEC, Montreal

P Gill, UCSD, San Diego

J-L Goffin, McGill, Montreal

N Gould, CERFACS, Toulouse

S Graves, MIT, Boston

B Hager, Univ. Florida, Gainesville

D Hearn, Univ. Florida, Gainesville

N Karmarkar, AT&T, Murray Hill

C Kiwiel, Systems Research Institute, Warsaw

C Lemarechal, INRIA, Paris

W Murray, Stanford Univ.

A Nemirovski, CMI, Moscow

J Nocedal, Northwestern Univ., Evanston

P Pardalos, Univ. Florida, Gainesville

C Sherbrooke, Logistics Management Institute, Bethesda

Ph Toint, FUNDP, Namur

Y Zheng, Univ. Pennsylvania, Philadelphia

Abstracts should be sent by June 1 (preferably by e-mail) to

optdays@math.kth.se

or by mail to

Optimization Days

Division of Optimization and Systems Theory

KTH

S-100 44 Stockholm

Sweden.

Any questions should be directed to the same addresses.

Organizing committee:

P O Lindberg (head)

U Brannlund

A Forsgren

K Svanberg

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

From: Michal Krizek <PRIKRYL@CSEARN.BITNET>

Date: Tue, 02 Feb 93 10:01:18 MDT

**Subject: Conference: Fifty Years of the Courant Element**

Conference on the finite element method

FIFTY YEARS OF THE COURANT ELEMENT

Univ. of Jyvaskyla, Finland, August 30 - September 3, 1993

A 5-day conference on algorithms and theory for the finite element

method. The objective of the conference is to provide a forum for

discussion of new developments in adaptive methods, error estimates,

implementation, parallelization and applications. A limited number

of contributed papers will be selected for presentation.

Invited speakers include the following:

O. Axelsson, I. Babuska, G.F. Carey, J. Douglas, R. Glowinski,

C. Johnson, K. Morgan, K.W. Morton, R. Rannacher, V. Thomee,

O. Widlund, M. Zlamal.

For further information contact FEM 50 Secretariat,

Prof. Pekka Neittaanmaki, Dept. of Mathematics, Univ. of Jyvaskyla,

P.O.Box 35, SF-40351 Jyvaskyla, Finnland.

FAX: 358 41 60 2731

E-mail: neittaanmaki@jylk.jyu.fi

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

From: Rolf Jeltsch <jeltsch@math.ethz.ch>

Date: Sun, 31 Jan 1993 18:33:26 +0100

**Subject: Assistant Professorships ETH Zuerich**

In NA-Digest Vol. 92 Issue 48 one, possibly two, Assistant Professorships

were announced. These positions are highly competitive since

competition is in all fields of mathematics. However ETH Zuerich is

planning the installation of a parallel supercomputer in 1993.

Hence the department of mathematics also welcomes strong

candidates from the area of

scientific numerical computing on parallel computers.

The official deadline for applications is January 31, 1993. However

applications which are only marginally late, 2-3 weeks say, will still

be considered.

For inquiries contact :

Prof. Rolf Jeltsch, Math. Department

ETH Zuerich

CH-8092 Zuerich, Switzerland

Phone +41-1-256 3452

FAX +41-1-252 3401

Here comes the official announcement:

ETH ZURICH

The Swiss Federal Institut of Technology in Zurich (ETHZ) invites appli-

cations for the position of an

ASSISTANT PROFESSOR OF MATHEMATICS

Duties of the new professor include research as well as an active partici-

pation in undergraduate and graduate courses for students of mathematics,

natural sciences and engineering.

Candidates should have a university degree and succesfully completed own

research work. Willingness to teach at all university levels and to cooperate

with colleagues is expected.

The positions of assistant professors have been established to promote the

career of younger scientists. They are available for three years in the first

instance, with the possibility of renewal for additional three years.

Applications with curriculum vitae and a list of publications should be

submitted no later than JANUARY 31, 1993, to the President of the ETH Zurich,

Prof. Dr. J. Nuesch, ETH Zentrum, CH-8092 Zurich. The ETHZ specifically

encourages female candidates to apply with a view towards increasing the

proportion of female professors.

Note, that applications have to be sent to:

The President of the ETH Zurich

Prof. Dr. J. Nuesch

ETH Zentrum

CH-8092 Zurich.

FAX +41-1-261 5669

Rolf Jeltsch

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

From: Joel Saltz <saltz@cs.umd.edu>

Date: Sun, 31 Jan 93 18:08:29 -0500

**Subject: Postdoc Position at Maryland/NIH**

Maryland/NIH Postdoc

The Computer Science Department at the University of Maryland and

the Division of Computer Research and Technology at the National

Institutes of Health seek a postdoctoral researcher to work with

us to carry out applications driven computational science

research. The research will be motivated by leading edge biomed-

ical applications of interest to the National Institutes of

Health. We seek a researcher with an excellent research back-

ground in compilers, tools or algorithms for high performance

computers. The researcher should also have an intrinsic interest

in tackling challenging biomedical applications. This is a joint

position with both the Computer Science Department at the Univer-

sity of Maryland and the National Institutes of Health.

The postdoc's work will be applications driven; the key will be

to focus on what are likely to be the major applications classes

applicable to emerging problems in computational biology and com-

putational medicine. The aim of this work will be to take into

account the requirements posed by problems in computational

biomedicine in our ongoing efforts to address the closely related

systems software goals of:

developing methods to ease the burden of coding multiproces-

sor machines,

developing methods to produce and support codes that can be

easily ported between architectures,

providing tools for performance tuning and monitoring,

along with tools to predict how programs will perform on new

architectures,

developing techniques for partitioning computational work

between a parallel machine's processors, along with methods

for mapping or dynamically remapping data into the machine's

memory hierarchy,

developing visualization methods needed to allow users to:

interpret their computational results, and

give programmers information needed to optimize the

performance of their programs.

The intent is for the researcher to work in close collaboration

with the research group lead by Joel Saltz in the Computer Sci-

ence Department at the University of Maryland and the group lead

by Robert Martino of the Division of Computer Research and Tech-

nology at the National Institutes of Health.

Applicants should send resumes and references to:

Johanna Weinstein

UMIACS

A.V. Williams Building

University of Maryland

College Park, MD

20742

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

From: J. C. Diaz <diaz@babieco.mcs.utulsa.edu>

Date: Tue, 2 Feb 1993 11:22:56 -0600

**Subject: Positions in Mathematical Sciences at Tulsa U.**

UNIVERSITY OF TULSA

Department of Mathematical and Computer Sciences

The Department of Mathematical and Computer Sciences at the

University of Tulsa invites applications for tenure track posi-

tions in Mathematics beginning in Fall 1993. Salary is open and

competitive. Responsibilities include teaching 6 hours per

semester at the undergraduate and graduate levels and continuing

scholarly activity. Minimum qualifications are a Ph.D. in Mathe-

matical Sciences or a related discipline, and a strong commitment

to teaching and research. The Department has research programs

in Numerical Analysis, Statistics, and Scientific Computing and

is seeking candidates in applied mathematics who will support

these research areas. However, outstanding candidates in other

related areas will also be considered.

The mathematics faculty offers B.S. and B.A. degrees in Mathemat-

ics, an M.S. degree in Applied Mathematics, and collaborates in

the Ph.D. program in Computer Science. In addition to campus and

college computing facilities, the departmental research computing

facilities include desktop computing for each faculty member, a

network of 18 Sun servers and workstations, 2 DEC workstations, a

BBN Butterfly, an Intel Hypercube, and a high-resolution 24-bit

color graphics system on an Alliant FX-40. The department is

also a member of NSFnet.

The department has Computer Science research efforts in Artifi-

cial Intelligence and Knowledge Based Systems, Numerical Learning

Systems, Parallel Computing, Scientific Computing, Databases, and

Computer Graphics. The department is housed in the College of

Engineering and Applied Sciences, creating a strong opportunity

for interdisciplinary collaborations.

Applications will be evaluated beginning March 1, 1993. Late

applications will be accepted until the position is filled. Send

vitae, transcripts (for recent graduates), and three letters of

reference to:

Dr. Richard A. Redner

Search Committee Chairman

Mathematical and Computer Sciences

University of Tulsa

600 S. College; Tulsa, OK 74104-3189

(email: redner@euler.mcs.utulsa.edu)

The University of Tulsa, an equal opportunity/affirmative action

employer, is committed to diversifying its faculty and staff.

Members of underrepresented groups (people of color, people with

disabilities, women, veterans, etc.) are strongly urged to apply.

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

From: Peter Eris Kloeden <kloeden@deakin.edu.au>

Date: Wed, 03 Feb 93 13:00:01 +1100

**Subject: Lecturership at Deakin University, Australia**

The following position was advertised in the ``Australian''

newspaper on february 3rd 1993.

LECTURER IN MATHEMATICS

Deakin University, Geelong, Victoria, Australia

Applications are invited for a position of lecturer (level B)

in the School of Computing and Mathematics on the Geelong campus.

The successful applicant will be required to lecture in numerical

analysis and other mathematics or statistics units at undergraduate

and honours level in both on-campus and off-campus modes, to

supervise postgraduate students and to be actively involved in

research.

A Ph.D with a demonstrable research record in some computational

aspect of mathematics or statistics is required.

The position is available from early 1993 and is tenurable.

Applications close on 19th February 1993.

Salary range A$41,000---A$48,688 pa.

Reference number 93/05

Submit applications with names and addresses of 3 referees to

Personnel Officer - Appointments

Personnel Branch

Deakin University,

Geelong 3217

Victoria

Australia

For further information contact Professor A. Goscinski,

Head of School of Computing & Mathematics,

phone +61(52)272088, InterNet ang@deakin.edu.au

or Professor P. Kloeden, Professor of Mathematics,

phone +61(52)272631, InterNet kloeden@deakin.edu.au

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

From: Adolfy Hoisie <hoisie@TC.Cornell.EDU>

Date: Thu, 4 Feb 1993 16:21:41 -0500

**Subject: Job Opening at Cornell Theory Center**

The Cornell Theory Center has an anticipated opening for a professional in

the area of Parallel Algorithms and Performance. The ideal candidate

would hold an advanced degree in a scientific discipline and be

experienced in the effective implementations of mathematical algorithms on

various parallel architectures. The succesful candidate will be part of a

team involved in research and development projects in the area of parallel

mathematical algorithms, analysis of grand challenge applications, and

benchmarking and performance assessment of parallel architectures. The

ability to work in a moderatly structured environment, and to interact

freely with the other members of the team is of extreme importance.

Cornell Theory Center offers a very attractive working environment

and competitive salaries. Currently, the center has two 64-processor

Kendall Square Research machines and a set of RS/6000 workstations

clustered with a variety of high-speed interconnects. In addition, the

center is collaborating with IBM's Highly Parallel Scalable Supercomputing

Laboratory to help advance its parallel technology.

For inquiries contact Adolfy Hoisie, hoisie@tc.cornell.edu,

na.hoisie@na-net.ornl.gov.

Interested applicants may send cover letters and resumes to: Julia Addy,

Personnel Manager, 529 Eng. & Theory Center Bldg., Cornell Theory Center,

Cornell University, Ithaca, NY 14853-3801

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

From: Andrew Stuart <stuart@sccm.Stanford.EDU>

Date: Fri, 5 Feb 93 12:20:45 -0800

**Subject: Graduate Traineeships at Stanford**

STANFORD UNIVERSITY --- SCCM PROGRAM

PROGRAM IN SCIENTIFIC COMPUTING AND COMPUTATIONAL MATHEMATICS

NSF GRADUATE RESEARCH TRAINEESHIPS

Applicants are sought for several National Science Foundation

Graduate Research Traineeships (GRTs) in the SCCM Program at

Stanford University. These GRTs provide financial support for

5 years. It is anticiapted that two traineeships will be

available from fall 1993 and a further three from fall 1994.

The SCCM Program provides an interdisciplinary graduate

training based around a core of material in mathemtical

and numerical analysis together with the study of related

application areas, application specific computational methods

and related issues in computer science.

For further information please contact

Gene Golub

golub@sccm.stanford.edu

415-723-3124

or

Andrew Stuart

stuart@sccm.stanford.edu

415-723-8142

or write to

Mary Washburn

SCCM Admissions Co-ordinator

Department of Computer Science

Stanford University

CA94305-2140.

NOTE: -THESE GRTs ARE SUBJECT TO NSF FINAL BUDGETARY APPROVAL

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

From: Alan Laub <laub@riccati.ece.ucsb.edu>

Date: Fri, 5 Feb 93 14:43:50 PST

**Subject: Position at Univ. Calif. Santa Barbara**

University of California, Santa Barbara

Electrical and Computer Engineering

Applications are invited for two tenure-track assistant

professor positions, available effective 07/01/93. One

position is in the area of massively parallel algorithms

(with applications in control, communications, or signal

processing). The other position (higher level appointment

is possible for outstanding individuals) is in the area of

computer engineering, preferably in computer architectures,

digital design, and VLSI testing. Normally, completion of

a doctorate is required at the time of the appointment.

Candidates should have an established research reputation

or outstanding research potential, the ability to attract

external research funding, and a strong commitment to

teaching at the undergraduate and graduate levels.

Applicants should send their resumes and the names and

addresses of at least four professional references to:

Faculty Search Committee

Department of Electrical and Computer Engineering

University of California

Santa Barbara, CA 93106-9560

Applications will be received until the positions are

filled. UCSB is an Equal Opportunity/Affirmative Action

employer.

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

From: David Dougherty <ddougher@emba.uvm.edu>

Date: Sat, 6 Feb 93 13:01:28 PST

**Subject: Post Doc Position at University of Vermont**

POST-DOC AVAILABLE AT UNIVERSITY OF VERMONT

A post-doc position is available immediately at the University

of Vermont. This is a one-year appointment with a possibility of

extension. The successful candidate will work at the intersection

of high-performance distributed computing, groundwater modeling,

and nonlinear optimization. Evidence of expertise in, or

related to, at least two of these areas is necessary.

Applicants should send (1) a current curriculum vitae, (2) an

abstract of the dissertation, and (3) three letters of

recommendation to Professor David E. Dougherty, Department of

Civil Engineering, University of Vermont, Burlington,

VT 5405-0156. E-mail submittals will be accepted at

ddougher@emba.uvm.edu (voice: 802-656-1920,

fax: 802-656-8446).

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

From: Bob Voigt <rvoigt@nsf.gov>

Date: Fri, 5 Feb 1993 14:13:26 -0500

**Subject: Grand Challenge Applications Groups**

GRAND CHALLENGE APPLICATIONS GROUPS

Fiscal Year 1993

Program Announcement

A Component of the U.S. High Performance Computing and Communications Program

NATIONAL SCIENCE FOUNDATION

The National Science Foundation (NSF) announces opportunities for

group oriented research for Fiscal Year 1993 in connection with the U.S.

High Performance Computing and Communications (HPCC) Program. Six to eight

proposals are expected to receive funding as Grand Challenge Application

Groups as a result of the opportunities described in this announcement.

Seven awards were made under this activity in Fiscal Year 1992.

Activities supported under this announcement are expected to achieve

significant progress on (1) fundamental problems in science and engineering

whose solution could be advanced by applying high performance computing

techniques and resources, and (2) enabling technologies which facilitate

those advances. In addition, it is anticipated that these activities will

generate significant new research in mathematics, computer science,

engineering and other scientific disciplines. This HPCC activity will

provide funding for multidisciplinary groups of scientists, engineers,

mathematicians and computer scientists to apply emerging high performance

computing and communications systems to advance the solution of diverse

science and engineering problems. The emphasis will be on support for

groups requiring HPCC capabilities, where such focused, cross disciplinary

support is generally unavailable or difficult to obtain. Any area of

science and engineering supported by NSF is eligible for funding under this

solicitation.

Proposers interested in submitting a formal proposal must submit 12 copies

of a preproposal by March 15, 1993.

The deadline for receipt of proposals is June 16, 1993.

The full text of this announcement is available on STIS as document 93-10.

It may be obtained by e-mail by sending a message to stisserv@nsf.gov (or

BITNET: stisserv@NSF) with the text of the message:

Request: stis

Topic: index

You will receive a list of all documents on STIS and instructions for

retrieving them.

Inquiries relative to this announcement should be addressed via electronic

mail to: rvoigt@nsf.gov (Internet) or rvoigt@nsf (Bitnet).

The Grand Challenge Applications Groups represent one, but not the only

approach to support HPCC activities.

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

From: C. Brezinski <brezinsk@citil.citilille.fr>

Date: Di, 7 Fev 93 17:12:57 +0100

**Subject: New Journal: Annals of Numerical Mathematics**

ANNALS OF NUMERICAL MATHEMATICS

``Annals of Numerical Mathematics'' consists of volumes dedicated to the

presentation of the current level and the main trends of the development

of specific areas of numerical mathematics. Each volume contains original

papers, survey articles, selected and tested computer programs,.....

``Annals of Numerical Mathematics'' plays an active role in the publication

of well-refereed conference proceedings or selected papers thereof and in

publishing volumes of contributed papers on well defined topics of numerical

mathematics from highly theoretical to the algorithmic and also to the very

applied.

Every volume has one or more Guest Editors who are responsible for the

collection of papers to appear in that volume, for the refereeing process

and for the time schedule. All papers are subject to peer refereeing and

there is no page charge. Each author of a paper published will receive

25 reprints of his contribution.

Interested conference organizers as well as potential Guest Editors in all

areas of numerical mathematics are cordially invited to put forward their

suggestions to the Editor-in-Chief:

Prof. C. Brezinski

Paris Drouot, BP 18

75433 - Paris cedex 09

France

fax: (33) 20 43 68 69

email: brezinsk@frcitl81.bitnet

brezinsk@citil.citilille.fr

Editorial board: C.K. Chui (Texas A&M Univ., College Station, USA),

P. Deuflhard (Konrad Zuse Zentrum, Berlin, Germany), T.O. Espelid

(Univ. of Bergen, Norway), L.F. Shampine (Southern Methodist Univ.,

Dallas, USA), E. Van de Velde (Caltech, Pasadena, USA), G.A. Watson

(Univ. of Dundee, Scotland), M.F. Wheeler (Rice Univ., Houston, USA),

O. Widlund (Courant Inst., New York, USA).

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

From: Richard Brualdi <brualdi@math.wisc.edu>

Date: Mon, 1 Feb 93 12:58:10 CST

**Subject: Contents: Linear Algebra and its Applications**

Contents LAA Volume 179, January 15, 1993

Joseph R. Siler (Pittsburg, Kansas) and Richard D. Hill

(Pocatello, Idaho)

Reflectors on Vector Spaces 1

Enzhong Fu and Thomas L. Markham (Columbia, South Carolina)

On the Eigenvalues and Diagonal Entries of a Hermitian Matrix 7

Rajendra Bhatia and Tirthankar Bhattacharyya

(New Delhi, India)

A Generalization of the Hoffman-Wielandt Theorem 11

Isaiah L. Kantor (Lund, Sweden)

Description of the Optimal Solution Set of the Linear

Programming Problem and the Dimension Formula 19

Magolu monga-Made (Brussels, Belgium)

Analytical Bounds for Block Approximate Factorization Methods 33

Arieh Lev (Tel-Aviv, Israel)

Products of Cyclic Conjugacy Classes in the Groups

PSL(n, F) 59

George-Othon Glentis and Nicholas Kalouptsidis

(Athens, Greece)

Efficient Algorithms for the Solution of Block Linear Systems

With Toeplitz Entries 85

D. A. Gregory, S. Kirkland, and N. J. Pullman

(Kingston, Ontario, Canada)

Power Convergent Boolean Matrices 105

Miroslav Fiedler (Czech Republic)

Structure Ranks of Matrices 119

Miroslav Fiedler (Czech Republic) and

Thomas L. Markham (Columbia, South Carolina)

A Characterization of the Moore-Penrose Inverse 129

Wenchao Huang (Madison Wisconsin)

On the Sandwich Semigroups of Circulant Boolean Matrices 135

Masatoshi Fujii (Osaka, Japan), Takayuki Furuta (Tokyo, Japan),

and Eizaburo Kamei (Osaka, Japan)

Furuta's Inequality and Its Application to Ando's Theorem 161

Xiao-Wen Chang and Jia-Song Wang

(Nanjing, People's Republic of China)

The Symmetric Solution of the Matrix Equations AX+YA=C,

AXAT+BYBT=C, and (ATXA, BTXB)=(C, D) 171

Ren-cang Li (Berkeley, California)

A Perturbation Bound for Definite Pencils 191

Teresa Cortes (Zaragoza, Spain)

A Note on the Lattice Definability of Bernstein Algebras 203

Joel E. Cohen (New York, New York), Yoh Iwasa (Fukuoka, Japan),

Gh. Rautu (Bucuresti, Romania), Mary Beth Ruskai,

(Lowell, Massachusetts), Eugene Seneta (Sydney, Australia),

and Gh. Zbaganu (Bucuresti, Romania)

Relative Entropy Under Mappings by Stochastic Matrices 211

Bernd Fritzsche and Bernd Kirstein (Leipzig, Germany)

Inverse Problems for Positive Hermitian Block Toeplitz

Matrices and Nondegenerate Schur Sequences 237

G. Corach (Buenos Aires, Argentina), H. Porta (Urbana, Illinois),

and L. Recht (Caracas, Venezuela)

Jacobi Fields on Space of Positive Operators 271

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

From: Marijcke Haccou <M.HACCOU@elsevier.nl>

Date: Mon, 1 Feb 1993 14:33:21 +0100

**Subject: Contents: Computational and Applied Mathematics**

Contents of the Special Issue on Numerical Methods for

Ordinary Differential Equations.

Journal of Computational and Applied Mathematics. Vol.45(1-2).

J.C. BUTCHER, J.R. CASH & P.J. VAN DER HOUWEN

Preface

W. AUZINGER, R. FRANK & G. KIRLINGER

Modern convergence theory for stiff initial value problems

A. BELLEN, Z. JACKIEWICZ & M. ZENNARO

Time point relaxation Runge-Kutta methods for ordinary

differential equations

K. BURRAGE

Efficient block predictor-corrector methods with a small

number of corrections

K. BURRAGE & R.P.K. CHAN

On smoothing and order reduction effects for implicit

Runge-Kutta formulae

J.C. BUTCHER & P.B. JOHNSTON

Estimating local truncation errors for Runge-Kutta methods

M. CALVO, J.I. M,ONTIJANO & L. RANDEZ

A0-stability of variable stepsize BDF methods

J.R. CASH & S. SENNANI

A new approach to solving non-stiff initial value problems

J.R. CASH & H.H.M. SILVA

On the numerical solution of a class of singular two-point

boundary value problems

G.J. COOPER & R. VIGNESVARAN

Some schemes for the implementation of implicity Runge-Kutta

methods

M.R. CRISCI, P.J. VAN DER HOUWEN, E. RUSSO & A. VECCHIO

Stability of parallel Volterra-Runge-Kutta methods

L. DIECI

On the decoupling of dichotomic linear hamiltonians.

Considerations on integrating symmetric differential

Riccati equations

T. EIROLA

Aspects of backward error analysis of numerical ODE's

I. GLADWELL & M. PAPRZYCKI

Parallel solution of almost block diagonal systems

on the CRAY Y-MP using Level 3 BLAS

D.J.HIGHAM

The tolerance proportionality of adaptive ODE solvers

L.LIU & R.D.RUSSELL

Linear system solvers for boundary value ODEs

B.P. SOMMEIJER

Parallel-iterated Runge-Kutta methods for stiff

ordinary differential equations

R. VERMIGLIO

Multistep high order interpolants of Runge-Kutta

methods

K. WRIGHT

Parallel implemention of block bi-diagonal matrices

in the solution of ordinary differential boundary

value problems

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

From: SIAM <pluta@siam.org>

Date: Wed, 03 Feb 93 12:34:47 EST

**Subject: Contents: SIAM Numerical Analysis**

Tentative

Table of Contents

SIAM Journal on Numerical Analysis

Volume 30, Number 3, June 1993

Second-Order Convergence of a Projection Scheme for the

Incompressible Navier-Stokes Equations with Boundaries

Thomas Y. Hou and Brian T. R. Wetton

Fast Iterative Solution of Stabilised Stokes Systems Part I: Using

Simple Diagonal Preconditioners

Andrew Wathen and David Silvester

Convergence of Fourier Methods for the Navier-Stokes Equations

Weinan E

Convergence of Finite Difference Schemes for Conservation Laws in

Several Space Dimensions: A General Theory

Frederic Coquel and Philippe Le Floch

A Maximum Principle Satisfying Modification of Triangle Based

Adaptive Stencils for the Solution of Scalar Hyperbolic

Conservation Laws

Xu-Dong Liu

A Collocation Method for the Numerical Solution of Laplace's

Equation with Nonlinear Boundary Conditions on a Polygon

Robert L. Doucette

The Computation of Water Waves Modelled by Nekrasov's Equation

G. A. Chandler and I. G. Graham

A New Time Discretization for the Radiative Transfer Equations:

Analysis and Comparison with the Classical Discretization

T. Nkaoua and R. Sentis

On the Uniform Convergence of the Scharfetter-Gummel Discretization

in One Dimension

Eugene C. Gartland, Jr.

A Regularization Method for the Numerical Inversion of the Laplace

Transform

Chen Wei Dong

Implementation of Linear Multistep Methods for Solving Constrained

Equations of Motion

Florian A. Potra

Optimal Equivalent Preconditioners

Thomas Manteuffel and James Otto

Parallel Factorizations for Tridiagonal Matrices

P. Amodio, L. Brugnano, and T. Politi

Preconditioned Iterative Methods for Solving Toeplitz-plus-Hankel

Systems

Ta-Kang Ku and C.-C. Jay Kuo

Galerkin-Petrov Methods for Bergman Space Toeplitz Operators

Albrecht Bottcher and Hartmut Wolf

Inverse Interval Matrix

J. Rohn

Discrete Variable Methods for the m-Dependent Variable Nonlinear,

Extremal Problem in the Calculus of Variations, II

John Gregory and Cantian Lin

Numerical Evaluation of Line Integrals

K. Atkinson and E. Venturino

The Generic Dimension of the Space of C1 Splines of Degree d >= 8

on Tetrahedral Decompositions

Peter Alfeld, Larry L. Schumaker, and Walter Whiteley

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

From: SIAM <gallaghe@siam.org>

Date: Fri, 05 Feb 93 10:46:34 EST

**Subject: Contents: SIAM Optimization**

SIAM Journal on Optimization

May 1993 Volume 3, Number 2

CONTENTS

A Finite Smoothing Algorithm for Linear l_1 Estimation

Kaj Madsen and Hans Bruun Nielsen

Uniformly Extremal Solutions in Sobolev Function Spaces for the

Quadratic Case: Characterization and Applications

L. S. Thakur

Partially Finite Programming in L_1 and the Existence of Maximum

Entropy Estimates

J. M. Borwein and A. S. Lewis

Reverse Auction and the Solution of Inequality Constrained

Assignment Problems

Dimitri P. Bertsekas, David A. Castanon, and Haralampos Tsaknakis

A Globally and Superlinearly Convergent Algorithm for Convex

Quadratic Programs with Simple Bounds

Thomas F. Coleman and Laurie A. Hulbert

A New Method for Optimal Truss Topology Design

Aharon Ben-Tal and Martin P. Bendsoe

Quantitative Stability of Variational Systems II. A Framework for

Nonlinear Conditioning

Hedy Attouch and Rojer J.-B. Wets

Partial-Update Newton Methods for Unary, Factorable, and Partially

Separable Optimization

Donald Goldfarb and Siyun Wang

Large-Step Interior Point Algorithms for Linear Complementarity

Problems

Masakazu Kojima, Yoshifumi Kurita, and Shinji Mizuno

On the Superlinear Convergence of Interior-Point Algorithms for a

General Class of Problems

Yin Zhang, Richard Tapia, and Florian Potra

Pointwise Broyden Methods

C. T. Kelley and E. W. Sachs

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

End of NA Digest

**************************

-------