- Today's Editor:
- Cleve Moler
- The MathWorks, Inc.
- moler@mathworks.com

- Web Application, The Informant
- Triangle Mesh Generator Available
- Mathematical Programming Glossary
- Special Issue of SIAM Numerical Analysis
- Sparse Matrices and Pictures on the WWW
- Contribution to Global Optimization Software Survey
- Short Course in Semiconductor Simulation
- Regional Modelling of Air Pollution in Europe
- The PARA96 Program and Booklet of Abstracts
- Position at Oxford University
- Position at the University of Utah
- Position at J. Gutenberg-University of Mainz
- Position at Johannes Kepler Universitaet
- Position at the University of Karlsruhe
- Contents, Linear Algebra and its Applications

**URL for the World Wide Web:**
http://www.netlib.org/na-net/na_home.html
-------------------------------------------------------

From: George Cybenko <gvc@dartmouth.edu>

Date: Tue, 16 Jul 1996 16:07:58 +0200 (METDST)

**Subject: Web Application, The Informant**

The Informant

Some of my students and I have developed a Web application called

"The Informant". Its URL is http://informant.dartmouth.edu.

This application saves key words that you provide and runs

periodic web searches (using Lycos now and other search engines

in the near future as well) on your behalf. When new web sites

are found that match your key words with a high score, you are sent

email notifying you that new material has been found. You then

reconnect to http://informant.dartmouth.edu and get a customized

page showing the new links. The service is free.

For example, suppose you are interested in sparse eigenvalue problems.

You might enter "sparse eigenvalues" as a search key word. Then

when new material relevant to "sparse eigenvalues" is found on the web

(that you have not already seen), you will get notified via email.

It works like a web clipping service essentially.

There are over 5100 registered users already from around the world

and most feedback has been very positive. The application has

been featured on Netscape's "What's New" button as well as being

the Microsoft Network "Pick of the Day". We welcome new users and

feedback about the application, especially ways in which it can

be improved.

Happy Surfing

George Cybenko

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

From: Jonathan Shewchuk <jrs+@bacchus.nectar.cs.cmu.edu>

Date: Sun, 21 Jul 96 21:24:43 EDT

**Subject: Triangle Mesh Generator Available**

Now available from Netlib:

Triangle Version 1.3

A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.

Triangle generates 2D Delaunay triangulations, Voronoi diagrams, convex

hulls, constrained Delaunay triangulations, and quality conforming

Delaunay triangulations. The latter can be generated with no small

angles, and are thus suitable for finite element analysis. Triangle

includes an implementation of Ruppert's Delaunay refinement algorithm

for 2D meshing. Users can specify constraints on minimum angle and

maximum triangle area, and can refine previously generated meshes based

on a posteriori error estimates. Support is included for holes,

concavities, internal boundaries, and intersecting segments.

The Delaunay triangulations and constrained Delaunay triangulations

produced are exact, but very little speed is sacrificed to gain this

robustness. Hence, Triangle is useful not only for finite element

practitioners, but also for computational geometers who seek a

comparison to validate the robustness of their codes against.

Triangle is accompanied by a simple X program called "Show Me", whose

purpose is to display point sets, planar straight line graphs,

triangulations, partitions, and Voronoi diagrams. It also creates

PostScript output.

Triangle is about 13,000 lines of portable C code, and Show Me about 3,400.

Each is a single, easy-to-compile file.

New features in Version 1.3: Faster file reading. Interface for calling

Triangle from another program. Attributes that allow you to determine which

(segment-bounded) region a triangle falls in. Triangle neighbor lists.

Objects can be numbered from zero. Ability to suppress insertion of new

points on the boundary, thus preserving compatibility with adjacent meshes.

Handles duplicate input points correctly.

Triangle is available through Netlib. Full online documentation for Triangle

is available on the Web at

http://www.cs.cmu.edu/~quake/triangle.html

Jonathan Shewchuk

School of Computer Science

Carnegie Mellon University

jrs@cs.cmu.edu

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

From: Harvey Greenberg <hgreenbe@carbon.cudenver.edu>

Date: Sun, 21 Jul 1996 22:07:10 -0600 (MDT)

**Subject: Mathematical Programming Glossary**

This is to announce the pre-release of a Mathematical

Programming Glossary. You presently get there via my

web page. It will become a regular publication soon,

but now I welcome your comments to make it better.

Please feel free to pass this announcement on to other

news groups or individuals.

Thanks,

Harvey

Please drop by my web page, http://www-math.cudenver.edu/~hgreenbe

(There have been changes as recently as July 20.)

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

From: SIAM <gallaghe@siam.org>

Date: Mon, 22 Jul 96 09:07:35 EST

**Subject: Special Issue of SIAM Numerical Analysis**

The SIAM Journal on Numerical Analysis (SINUM) will be publishing a

special issue edited by Eitan Tadmor on the topic of Approximate

Solution of Nonlinear Conservation Laws and Related Equations. This

issue is dedicated to Ami Harten, who served as a SINUM editor and was

a leading researcher in this area until his untimely death in August

1994.

The deadline for submission to the issue is January 1997. Contributors

should send five copies of their paper, with a cover letter indicating

that the paper is for the SINUM special issue, to SIAM, P.O. Box 7541,

Phila., PA 19101. Questions can be addressed to sinum@siam.org.

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

From: Tim Davis <davis@cise.ufl.edu>

Date: Mon, 22 Jul 1996 12:34:35 -0400

**Subject: Sparse Matrices and Pictures on the WWW**

We have a new web site for viewing and downloading matrices in our sparse

matrix collection at the Univ. of Florida (including copies of matrices from

the Harwell/Boeing collection, and other collections). Each matrix has its own

web page, with two GIF images each: one of the pattern of entries (some of

are sometimes numerically zero) and one of the pattern of numerical values

(which will be in color, to denote the absolute values of the entries).

We've also included some statistical information, courtesy of the "info"

routine in SPARSKIT2. We plan on adding other information, such performance

of ordering & factorization codes, later on.

The advantage of the GIF images is that they are very small. You don't have

to download 10's of megabytes of information just to get a image of the matrix.

The site is "under construction" (aren't they all...?), but you're welcome

to take a look at what we have so far. The location may change, so for now,

simply look at my home page:

http://www.cise.ufl.edu/~davis

and follow the link from there. If you don't find it, try again later, since

we take it off-line to work on it from time to time.

Tim Davis (davis@cise.ufl.edu)

Justo Casablanca (jmc@cise.ufl.edu)

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

From: Janos Pinter <pinter@tuns.ca>

Date: Fri, 26 Jul 1996 15:22:52 -0300 (ADT)

**Subject: Contribution to Global Optimization Software Survey**

Dear Colleagues:

I have been asked to prepare a survey paper on existing global

optimization software. If you would like your software (or anyone's

work you know of) to be mentioned in this review, then please send

information (a brief ASCII description, and possibly also research

articles, user guide/info, demo disk, references, pointers to your home

page, etc. - as you find appropriate) to my address. Sending only an e-mail

message to me is certainly fine, but in case of lengthier submissions, I

would much appreciate hard copies containing supporting info.

It would be of great help, if you were kind to 'self-assess' your

contribution, esp. since I may not have your software (Some pointers:

problem types and sizes solvable, educational/professional versions,

existing interface, ease of use, test results, scope of applications...)

You are kindly asked to pass around this message to anyone whom you think

make worthwile (software related) contributions to this subject.

Since the time frame is relatively short (I was asked to do the job a few

days ago, and the submission deadline is Sept 15), your prompt reaction

will be much appreciated.

Thanks in advance for your assistance, and have a great summer!

Janos Pinter

Pinter Consulting Services

Adjunct Professor

Faculty of Management

Dalhousie University

PCS address:

129 Glenforest Drive, Halifax, NS, Canada B3M 1J2

Phone: 1-(902)-443-5910

e-mail: pinter@tuns.ca

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

From: Rich Richardson <buck@runner.jpl.utsa.edu>

Date: Fri, 19 Jul 1996 13:03:34 -0500

**Subject: Short Course in Semiconductor Simulation**

TOPICS IN SEMICONDUCTOR CIRCUIT, DEVICE, AND PROCESS SIMULATION

A Short Course offered November 11-13, 1996 at the

University of Texas at Austin

Audience: This course will provide engineers and managers

with a deeper understanding of the underlying mathematical

principles behind current process, device, and circuit

simulators, enabling them to apply this knowledge to better

utilize simulation as an integral part of the design process.

Faculty: G. Carey, W. Richardson, and B. Mulvaney.

Material: The course will emphasize simulation methods for

circuit analysis, semiconductor devices, and process modeling:

mathematical models, numerical techniques, simulation

'pitfalls', applications studies, and solution strategies

of current simulators. The course will consist of approximately

20 hours of lectures based on the new text by the lecturers:

CIRCUIT, PROCESS, AND DEVICE SIMULATION: MATHEMATICAL AND

NUMERICAL ASPECTS (Wiley, 1996). For further information see

http://ceswww.utexas.edu.

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

From: Zahari Zlatev <luzz@sun2.dmu.dk>

Date: Thu, 25 Jul 1996 10:00:45 +0100

**Subject: Regional Modelling of Air Pollution in Europe**

Dear Colleagues,

Some of you, people involved in large-scale applications,

might be interested to participate in the first REMAPE Workshop.

and to get contacts with groups which are actively working in

this area. REMAPE stands for Regional Modelling of Air Pollution

in Europe. This is a sub-project of EUROTRAC-2. REMAPE will

continue all activities of EUMAC (from EUROTRAC-1), but new

activities will also be started.

The workshop will be held at the University of Copenhagen,

September 26-27, 1996. All research groups, which are planning

to have projects in REMAPE, are encouraged to participate.

However, our meeting is open and we are inviting other

researchers to come and/or to give talks. All topics related

to long-range transport, meso-scale modelling, model validations,

chemical mechanisms, cloud processes, emission modelling,

simulations (related to control strategies and studies of

effects from different receptors) and large-scale computations on

modern vector and parallel computers are relevant for this workshop.

The number of particpants will be limited to no more than 75

(for technical reasons). The dead line for registration and/or

sending abstracts is August 15 1996. The registration fee will be 400 DKR.

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

To get more detailed information about this meeting contact:

Zahari Zlatev

National Environmental Research Institute

Frederiksborgvej 399, P. O. Box 358

Telephone: + 45 4630 1149

Fax: + 45 4630 1214

E-mail: luzz@sun2.dmu.dk

or zlatev@unidhp1.uni-c.dk

or neuzz@aauc32.uni-c.dk

I am giving you two alternative e-mail addresses, because our

local computer net is still having sometimes problems due to the

introduction of a "fire-wall".

I hope to see some of you at the workshop in Copenhagen.

Best regards, Zahari Zlatev

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

From: Jerzy Wasniewski <unijw@unidhp1.uni-c.dk>

Date: Fri, 26 Jul 1996 11:51:40 +0200 (METDST)

**Subject: The PARA96 Program and Booklet of Abstracts**

The PARA96 program, booklet (practical information, abstracts and a

list of participants) and maps are available on the PARA96 WEBsite and

anonymous ftp.

If you have not already sent a completed registration form, please do

so as soon as possible.

The PARA96 information, can be found at the PARA96 Website:

http://webhotel.uni-c.dk/para/para96.html

The PARA96 anonymous ftp is:

ftp webhotel.uni-c.dk

anonymous

your_name

cd para | cd para/Maps

Best regards,

Jerzy

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

From: Bill McColl <Bill.McColl@comlab.ox.ac.uk>

Date: Wed, 24 Jul 96 14:16:27 BST

**Subject: Position at Oxford University**

UNIVERSITY OF OXFORD

Computing Laboratory

Professorship of Numerical Analysis

The electors intend to proceed to an election to the Professorship of

Numerical Analysis, which will fall vacant with effect from 1 October

1997, upon the retirement of Professor K.W. Morton.

A non-stipendiary professorial fellowship at Balliol College is

attached to the professorship.

Applications (ten copies, or one only from overseas candidates),

naming three referees, should be received not later than 16 September

1996 by the Registrar, University Offices, Wellington Square, Oxford

OX1 2JD, from whom further particulars may be obtained.

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

From: Chris Johnson <crj@sci2.cs.utah.edu>

Date: Thu, 25 Jul 1996 13:03:44 -0600

**Subject: Position at the University of Utah**

The Center for Scientific Computing and Imaging within the Department of

Computer Science at the University of Utah is looking to hire a full-time

computer professional beginning July 1996 and continuing for one year.

(Employment may extend past one year contingent on funding and excellent

performance reviews.)

A Bachelors degree and two years experience is required. The Center would

prefer the applicant to have expertise in C++ programming and have strong

verbal and writing skills. Duties include: optimizing existing C++ codes;

writing C++/Tck/Tk/OpenGl scientific computing modules at both the systems

and applications level; and documenting software. The Center also requests

that the applicant be familiar with scientific computing and visualization,

have experience working on large software systems, also have experience in

Unix systems management, and multithreaded program development.

Please send a resume and names of references to:

Chris Johnson

Department of Computer Science

University of Utah

Salt Lake City, UT 84112

Email: crj@cs.utah.edu

WWW: http://www.cs.utah.edu/~sci

Phone: (801) 581-7705

Fax: (801) 581-5843

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

From: Claus Schneider <SCHNEIDER@MAT.Mathematik.Uni-Mainz.DE>

Date: Fri, 19 Jul 1996 15:56:26 +0100

**Subject: Position at J. Gutenberg-University of Mainz**

The Department of Mathematics (Johannes Gutenberg-University Mainz,

Mainz in the Rhine valley close to Francfort (cf. also F.L.Bauer's report

in the latest NADigest)) is currently seeking an excellent mathematician for

the position of a

Full Professor (C4) in Applied Mathematics.

Researchers with experience in any or all (try the impossible) of

the following categories are invited to apply

Numerical solution of PDE's

Numerical solution of inverse problems

Numerical solution of combinatorical optimization problems.

15 September 1996 is the deadline for applications. The official announcement

of the position (in German and p.c.) has been published in DIE ZEIT. It is also

available via email (Schneider@mathematik.uni-mainz.de).

Interested individuals are encouraged to contact the Dean of the Department:

Prof Dr K-J Scheiba

Dekan des Fachbereichs Mathematik

Johannes Gutenberg-Universit/"at

D--55099 Mainz

Germany

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

From: Heinz W. Engl <engl@indmath.uni-linz.ac.at>

Date: Tue, 23 Jul 1996 20:31:17 EDT

**Subject: Position at Johannes Kepler Universitaet**

We might have money available for funding an additional postdoctoral

research position in inverse problems at the Johannes Kepler Universitaet

in Linz, Austria, for about six months starting this October or November.

We are interested in researchers whose interests and experience match

ours closely enough for successful joint research to be possible within

this relatively short period. We are currently mostly interested in

regularization methods for nonlinear ill-posed inverse problems

(also large scale, in combination with efficient solvers for the

direct problems; see our WWW-page, address belo, for details).

Those who are interested and match these criteria should contact

me with details about their interest and experience urgently by

E-Mail.

Heinz W. Engl

Prof.Dr.Heinz W. Engl E-Mail: engl@indmath.uni-linz.ac.at

Industriemathematik or na.engl@na-net.ornl.gov

Institut fuer Mathematik secretary: nikolaus@indmath.uni-linz.ac.at

Johannes-Kepler-Universitaet Phone: +43-(0)732-2468; ext.9219 or 693,

Altenbergerstrasse 69 secretary: 9220; home: +43-(0)732-245518

A-4040 Linz Fax: +43-(0)732-2468855

Oesterreich / Austria Telex: 2-2323 uni li a

World Wide Web: http://www.indmath.uni-linz.ac.at/

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

From: Roland Vollmar <vollmar@ira.uka.de>

Date: Wed, 24 Jul 1996 11:23:32 +0200

**Subject: Position at the University of Karlsruhe**

An der Universitaet Karlsruhe (TH) ist die

Leitung des Universitaetsrechenzentrums

ab 1. Oktober 1997 (in der Nachfolge von Herrn Prof. Dr. A. Schreiner)

wieder zu besetzen.

Die Leitungsfunktion ist verbunden mit einer

Professur (C4) fuer "Rechnersysteme und Infrastruktur der

Informationsverarbeitung",

in deren Rahmen auch Aufgaben in Forschung und Lehre innerhalb einer der

Fakultaeten der Universitaet wahrzunehmen sind.

Das Rechenzentrum der Universitaet Karlsruhe ist eines der groessten seiner

Art; das Spektrum der Einrichtung reicht vom Supercomputer bis zur modernsten

Glasfaservernetzung. Es ist eine zentrale Einrichtung der Universitaet und hat

Aufgaben im Bereich der Kommunikationssysteme, des Hoechstleistungsrechnens,

der zentralen und dezentralen Dienste zu erfuellen.

Erwartet werden hervorragende wissenschaftliche Qualifikation und besondere

Erfahrungen in der Personalfuehrung und im Management wissenschaftlicher

Projekte in entsprechenden Positionen der Wirtschaft oder des Wissenschafts-

bereichs.

Die Hochschule ist bestrebt, den Anteil von Professorinnen zu erhoehen und

begruesst deshalb die Bewerbung von Frauen.

Bewerbungen mit detaillierter Darstellung des beruflichen Werdegangs (Veroef-

fentlichungen, Projekte und Lehrtaetigkeit) werden

bis zum 27. September 1996

erbeten an den Vorsitzenden der Berufungskommission, Prof. Dr. R. Vollmar,

Am Fasanengarten 5, D-76128 Karlsruhe, Tel.: (++49 721)6084312,

Fax: (++49 721)698675, email: vollmar@ira.uka.de.

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

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

Date: Wed, 24 Jul 1996 14:34:50 -0500 (CDT)

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

LINEAR ALGEBRA AND ITS APPLICATIONS

Contents of volume 240

Arioli, M., Codenotti, B., and Fassino, C.: The Pade Method for Computing

the Matrix Exponential, 240:111_130

Botha, J. D.: Factorizations of a Matrix Into Symmetric Matrices With

Prescribed Nullities, 240:79_86

Carvalho, L. A. V.: On Quadratic Liapunov Functionals for Linear Difference

Equations, 240:41_64

Chalmers, B. L. and Shekhtman, B.: Extension Constants of Unconditional

Two -Dimensional Operators, 240:173_182

Codenotti, B.: See Arioli M.

Cohen.: An Algebraic Approach to Certain Differential Eigenvalue Problems,

240: 183_198

Fassino, C.: See Arioli M.

Gibson, Peter M.: Sign-Nonsingular Skew-Symmetric Matrices, 240:207_229

Hofmeister, Thomas and Lefmann, Hanno: Computing Sparse Approximations

Deterministically, 240:9_19

Horn, Roger A., Li, Chi-Kwong, and Merino, Dennis I.: Distances Between the

Graphs of Matrices, 240:65_77

Johnson, Charles R. and Zhang, Fuzhen: An Operator Inequality and Matrix

Normality, 240:105_110

Kalantari, Bahman and Khachiyan, Leonid: On the Complexity of Nonnegative-

Matrix Scaling, 87_103

Khachiyan, Leonid: See Kalantari, Bahman

Lefmann, Hanno: See Hofmeister, Thomas

Li, Chi-Kwong: See Horn, Roger A.

Maesumi, Mohsen: An Efficient Lower Bound for the Generalized Spectral

Radius of a Set of Matrices, 240:1_7

Merino, Dennis I.: See Horn, Roger A.

Neumaier, Arnold: See Olschowka, Markus

Olschowka, Markus and Neumaier, Arnold: A New Pivoting Stragegy for Gaussian

Elimination, 240:131_151

Shekhtman, B.: See Chalmers, B. L.

Stoorvogel, Anton A.: Stabilizing Solutions of the H=8C Algebraic Riccati

Equation, 240:153_172

Strakos_, Zdene_k: Review of Iterative Solution Methods, by O. Axelsson,

240:231_233

Wang, Jin-Hsien: Factorization of Matrices Into Quadratic Ones. III,

240:21_39

LINEAR ALGEBRA AND ITS APPLICATIONS

Contents of volume 241-3

Proceedings of the Fourth Conference of the International Linear Algebra

Society (Rotterdam, 1994)

Preface

Daniel Alpay (Beer-Sheva, Israel) and Harry Dym (Rehovot, Israel): On a

New Class of Realization Formulas and Their Application

P. Amodio (Bari, Italy) and M. Paprzycki (Odessa, Texas): Parallel Solution

of Almost Block Diagonal Systems on a Hypercube

T. Ando (Sapporo, Japan): Hadamard Products and Golden_Thompson Type

Inequalities

Joseph A. Ball (Blacksburg, Virginia) and Jeongook Kim (Kwangju, Korea):

Bitangential Interpolation Problems for Symmetric Rational Matrix Functions

A. Ben Artzi (Tel-Aviv, Israel) and I. Gohberg (Ramat-Aviv, Israel): Monotone

Power Method in Indefinite Metric and Inertia Theorem for Matrices

Rafael Cant (Valncia, Spain) and Joan-Josep Climent (Alacant, Spain):

Singular Graph and Extension of Jordan Chains of an M-Matrix

Luz M. DeAlba (Des Moines, Iowa): Inertia of the Stein Transformation With

Respect to Some Nonderogatory Matrices

G. N. de Oliveira (Coimbra, Portugal): Linear Preservers of Schur Functions

J. A. Dias da Silva (Lisboa, Portugal): Multilinear Algebra: Recent

Applications

Robert L. Ellis (College Park, Maryland), Israel Gohberg (Ramat Aviv, Israel)

and David C. Lay (College Park, Maryland): On a Class of Block Toeplitz

Matrices

Sven Feldmann (Leipzig, Germany) and Georg Heinig (Safat, Kuwait): Vander-

monde Factorization and Canonical Representations of Block Hankel Matrices

J. Ferrer and Ma. I. Garca-Planas (Barcelona, Spain): Structural Stability

of Quadruples of Matrices

G. Freiling, G. Jank (Aachen, Germany), and H. Abou-Kandil (Cachan, France):

Generalized Riccati Difference and Differential Equations

Shmuel Friedland (Chicago, Illinois): Discrete Groups of Unitary Isometries

and Balls in Hyperbolic Manifolds

K. A. Gallivan, S. Thirumalai (Urbana, Illinois), P. Van Dooren, and V.

Vermaut (Louvain, Belgium): High Performance Algorithms for Toeplitz and

Block Toeplitz Matrices

S. Gonze1lez, J. C. Gutirrez, and C. Martnez (Oviedo, Spain): On Regular

Bernstein Algebras

Bernard Hanzon (Amsterdam, The Netherlands) and Ralf L. M. Peeters

(Maastricht, The Netherlands): A Faddeev Sequence Method for Solving

Lyapunov and Sylvester Equations

Daniel Hershkowitz (Haifa, Israel), Wenchao Huang (Madison, Wisconsin),

Michael Neumann (Storrs, Connecticut), and Hans Schneider (Madison,

Wisconsin): Minimization of Norms and the Spectral Radius of a Sum of

Nonnegative Matrices Under Diagonal Equivalence

O. V. Holtz and V. A. Strauss (Chelyabinsk, Russia): Classification of

Normal Operators in Spaces With Indefinite Scalar Product of Rank 2

Matthew Hudelson (Pullman, Washington), Victor Klee (Seattle, Washington),

and David Larman (London, England): Largest j-Simplices in d-Cubes: Some

Relatives of the Hadamard Maximum Determinant Problem

Yasuhiko Ikebe (Fukushima, Japan), Nobuyoshi Asai, Yoshinori Miyazaki, and

DongSheng Cai (Tsukuba City, Ibaraki, Japan): The Eigenvalue Problem for

Infinite Complex Symmetric Tridiagonal Matrices With Application

Hiroshi Inaba and Weiben Wang (Saitama, Japan): Block Decoupling for Linear

Systems Over Rings

Charles R. Johnson (Williamsburg, Virginia), Raphael Loewy (Haifa, Israel),

D. D. Olesky, and P. van den Driessche (Victoria, British Columbia,

Canada: Maximizing the Spectral Radius of Fixed Trace Diagonal Perturbations

of Nonnegative Matrices

Charles R. Johnson (Williamsburg, Virginia) and Ronald L. Smith (Chattanooga,

Tennessee): The Completion Problem for M-Matrices and Inverse M-Matrices

D. S. Johnson, A. C. Pugh (Loughborough, United Kingdom), E. Rogers (South

Hampton, United Kingdom), G. E. Hayton (Leeds, United Kingdom), and D. H.

Owens (Exeter, United Kingdom): A Polynomial Matrix Theory for a Certain

Class of Two-Dimensional Linear Systems

Nicos Karcanias and John Leventides (London, United Kingdom): Grassmann

Invariants, Matrix Pencils, and Linear System Properties

Jos Mas (Valncia, Spain), Violeta Migalln, Jos Penades (Alacant, Spain),

and Daniel B. Szyld (Philadelphia, Pennsylvania): Nonstationary

Parallel Relaxed Multisplitting Methods

Volker Mehrmann (Chemnitz, Federal Republic of Germany): A Step Toward a

Unified Treatment of Continuous and Discrete Time Control Problems

J. J. Seidel (Eindhoven, The Netherlands): A Sound Equilibrium for Linear

Algebra

V. Simoncini (Bologna, Italy): Ritz and Pseudo-Ritz Values Using Matrix

Polynomials

Garret Sobczyk (Puebla, M=E9xico): Structure of Factor Algebras and

Clifford Algebra

Ji-guang Sun (Ume=E5, Sweden): Perturbation Analysis of System Hessenberg

and Hessenberg- Triangular Forms

B. Uhrin (Budapest, Hungary): Inner Aperiodicities and Partitions of Sets

David S. Watkins (Pullman, Washington): The Transmission of Shifts and

Shift Blurring in the QR Algorithm

H. Bart (Rotterdam, The Netherlands), M. A. Kaachoek, and A. C. M. Ran

(Amsterdam, The Netherlands): Conference Report

Author Index

Zha, Hongyuan: A Note on the Existence of the Hyperbolic Singular Value

Decomposition, 240:199_205

LINEAR ALGEBRA AND ITS APPLICATIONS

Contents of Volume 244

Shu-Chu Chang (Taiwan, Republic of China)

Double Coset Decomposition for SL (r + s, Z) With Respect to Congruence

Subgroups 1

Jian Shen (Anhui, The People's Republic of China)

Some Estimated Formulas for the Frobenius Numbers 13

Jian Shen (Anhui, The People's Republic of China)

A Bound on the Exponent of Primitivity in Terms of Diameter 21

Luca Dieci (Atlanta, Georgia)

Considerations on Computing Real Logarithms of Matrices,

Hamiltonian Logarithms, and Skew-Symmetric Logarithms 35

Ji-guang Sun (Ume, Sweden)

On Two Functions of a Matrix With Positive Definite Hermitian Part 55

Guoliang Chen, Musheng Wei, and Yifeng Xue (Shanghai, China)

Perturbation Analysis of the Least Squares Solution in Hilbert Spaces 69

Dnes Petz (Budapest, Hungary)

Monotone Metrics on Matrix Spaces 81

Peter M. Gibson (Huntsville, Alabama)

Sign-Nonsingular Skew-Symmetric Matrices With the Most Nonzero Entries 97

Mei-Hsiu Chi (Chiayi, Taiwan)

The Long-Run Behavior of Markov Chains 111

David A. Gregory, Kevin N. Vander Meulen (Kingston, Ontario, Canada), and Bryan L. Shader (Laramie, Wyoming)

Skew Rank Decompositions 123

Zlatko Drmac (Boulder, Colorado)

On Relative Residual Bounds for the Eigenvalues of a Hermitian Matrix 155

Gong-ning Chen, Bin Zhao, and Hui-pin Zhang (Beijing, People's Republic of

China) The General Rational Interpolation Problem in the Scalar Case and

Its Hankel Vector 165

Ton Geerts (Maren-Kessel, The Netherlands)

Higher-Order Continuous-Time Implicit Systems: Consistency and Weak

Consistency, Impulse Controllability, Geometric Concepts, and Invertibility

Properties 203

Jian Shen (Anhui, The People's Republic of China)

A Problem on the Exponent of Primitive Digraphs 255

Nir Cohen (Haifa, Israel) and Jerome Dancis (College Park, Maryland)

Maximal Rank Hermitian Completions of Partially Specified Hermitian Matrices 265

Steve Kirkland (Regina, Saskatchewan, Canada)

On the Minimum Perron Value for an Irreducible Tournament Matrix 277

David London (Haifa, Israel)

On Diagonals of Matrices Doubly Stochastically Similar to a Given Matrix 305

Alexander Yastrebov (Yaroslavl, Russia)

On a Construction of the Cliffordean Algebra 341

William H. Pierce (Louisville, Kentucky)

A Self-Correcting Matrix Iteration for the Moore-Penrose Generalized Inverse 357

Diethard Klatte (Zrich, Switzerland) and Gisbert Thiere

(Halle, Germany)

A Note of Lipschitz Constants for Solutions of Linear Inequalities and Equations 365

Author Index 375

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

End of NA Digest

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

-------