NA Digest Saturday, October 21, 1995 Volume 95 : Issue 42

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: Werner Rath <Werner.Rath@Mathematik.TU-Chemnitz.DE>
Date: Tue, 17 Oct 1995 17:08:13 MEZ
Subject: New Code for Linear DAEs with Variable Coefficients Available

I would like to announce the release of GELDA Version 1.1.

GELDA is a software package for the numerical solution of linear
differential-algebraic equations with variable coefficients. The
implementation is based on a new discretization scheme. It can deal
with systems of arbitrary index and with systems that do not have
unique solutions or inconsistencies in the initial values or the

The package includes a computation of all the local invariants of the
system, a regularization procedure and an index reduction scheme and
it can be combined with every solution method for standard index 1
systems. Nonuniqueness and inconsistencies are treated in a least
square sense. In our package we have implemented backward
differentiation formulas (BDF) methods and Runge-Kutta (RK)

DGELDA (a double precision version of GELDA) is available via
anonymous FTP

or the GELDA Home Page

GELDA is a joint work with Peter Kunkel, Volker Mehrmann and Joerg

-- Werner Rath

Werner Rath | Tel.: (049) (0)371-531-3953 (office)
Fakultaet fuer Mathematik | (049) (0)2151-308119 (private)
TU Chemnitz-Zwickau | email:
D-09107 Chemnitz, FRG |


From: Frank Stenger <>
Date: Tue, 17 Oct 1995 15:56:50 -0600
Subject: New Text, Selected Topics in Approximation and Computation

Dear nanet readers,

I would like to take this opportunity to announce the new text,

"Selected Topics in Approximation and Computation".

The authors are Marek A. Kowalski, Krzysztof A. Sikorski, and Frank Stenger.
It was recently published by Oxford. The ISBN number is ISBN 0-19-508059-9,
and the price is $65.00. It is about 350 pages in length. The chapter
headings are:

Chapter 1: Classical Approximation
Chapter 2: Splines
Chapter 3: Sinc Approximation
Chapter 4: Explicit Sinc-Like Methods
Chapter 5: Moment Problems
Chapter 6: n-Widths and s-Numbers
Chapter 7: Optimal Approximation Methods
Chapter 8: Applications


From: Michael Lewis <>
Date: Mon, 16 Oct 1995 13:27:10 -0400
Subject: Short Course in Optimization

ICASE/LaRC Short Course in Optimization with Application
to Multidisciplinary Design Optimization

April 9-13, 1996
Radisson Hotel, Hampton, Virginia

We are pleased to announce that the Institute for Computer Applications
in Science and Engineering (ICASE) and NASA Langley Research Center (LaRC)
will conduct a Short Course in Optimization with Application to
Multidisciplinary Design Optimization (MDO) at the Radisson Hotel in
Hampton, Virginia on April 9-13, 1996.

This course is designed to acquaint engineers and scientists with methods
and algorithms for treating nonlinear optimization problems. It will focus
on the optimization of systems governed by differential equations. Such
problems are becoming increasingly common and important in engineering
and scientific work, especially in MDO. Systems governed by differential
equations exhibit special structure and efficient optimization in such
situations requires specialized nonlinear programming approaches that take
advantage of this structure.

This course is also intended to expose its audience to the state of the
art in nonlinear optimization algorithms. Experience indicates that the
typical user of optimization is familiar with a few optimization algorithms
and software packages, but is unaware of the variety of available
optimization tools that may be more suitable for that user's needs.

A brief synopsis of the course follows:

Natalia Alexandrov, MDO Branch, NASA Langley Research Center
Overview of the short course; general optimization background:
statement of the problem, main classes of algorithms.

R. Michael Lewis, ICASE, NASA Langley Research Center
Overview of optimization subject to differential equation constraints;
adjoints; automatic differentiation; computational experience.

Jean-Francois Barthelemy, MDO Branch, NASA Langley Research Center
Optimization and MDO formulations; computational experience.

Lorenz T. Biegler, Carnegie Mellon University
Sequential quadratic programming methods; Applications: Very
large-scale problems in chemical engineering.

Prabhat Hajela, Rensselaer Polytechnical Institute
Applications: Optimization algorithms for aerospace design;
experience with genetic algorithms.

John T. Betts, Boeing Information and Support Services
Applications: Algorithms for large-scale nonlinear programming
in trajectory optimization and control.

If you wish to attend or would like further information, please contact.

Emily Todd, Conference Manager email:
ICASE, Mail Stop 132C FAX: (804) 864-6134
NASA Langley Research Center PHONE: (804) 864-2175
Hampton, VA 23681-0001


From: Zdzislaw Jackiewicz <>
Date: Wed, 18 Oct 1995 21:22:54 -0700
Subject: Volterra Centennial

First Announcement

The Second International Conference on
The Numerical Solution of Volterra and Delay Equatiuons
to be held May 27 - 30, 1996, at Arizona State University

Organized by
Alan Feldstein and Zdzislaw Jackiewicz
Department of Mathematics and
Center for Systems Science and Engineering
Arizona State University
Tempe, Arizona 85287-1804

Invited Speakers

C. T. H. Baker (Manchester) A. Iserles (Cambridge)
A. Bellen (Trieste) Ch. Lubich (Tubingen)
H. Brunner (Newfoundland) L. R. Petzold (Minneapolis)
J. C. Butcher (Auckland) M. N. Spijker (Leiden)
P. E. Crouch (Tempe) S. Thompson (Radford)
W. H. Enright (Toronto) P. J. van der Houwen (Amsterdam)
F. Hoppensteadt (Tempe) M. Zennaro (Trieste)

The Conference will commemorate the one-hundreth anniversary of the
publication by Vito Volterra of his seminal papers on integral equations and
will be devoted to the computational and applied aspects of Volterra and
delay equations. These include functional differential equations (delay,
advanced and neutral), Volterra integral equations, and Volterra
integro-differential equations. These will be both invited lectures and
contributed talks at the meeting. In addition, there will be ample time for
minisymposia and informal discussions. The Conference will emphasize the
following topics:

* Convergence and order properties of numerical methods
* Stability analysis and construction of highly stable methods
* Implementation problems: software development and testing
* Applications of Volterra and delay equations

This Conference will be preceed by the Volterra Centennial Symposium
(devoted mainly to the qualitative aspects of Volterra equations), May 23 -
25, 1996, at the University of Texas at Arlington.

Interested persons are requested to announce their intention to participate
and/or present contributed papers and/or organize a minisymposia by
contacting the organizers.

Phones: A. Feldstein Z. Jackiewicz
(602) 965-3779(office) (602) 965-0082
(602) 965-4600(home)

FAX: (602) 965-8119


From: Trini Flores <>
Date: Thu, 19 Oct 95 15:38:15 EST
Subject: SIAM Conference on Optimization

May 20-22, 1996
Victoria Conference Centre
Victoria, British Columbia, Canada

The deadline for submission of a contributed
presentation for the conference is MONDAY, NOVEMBER 6, 1996.

For those of you who have not yet sent in your contributed
abstract, we invite you to participate in this exciting
conference. Send in a title, a brief abstract, and authors names
and addresses to Indicate your preference of
presentation either for a poster or a 20-minute presentation, and
include a list of keywords (at most 5) in order of importance.

Additional information regarding the conference can be accessed
electronically through the World Wide Web. Point your browser to:

See you in Victoria, BC!

The Conference Organizing Committee


From: Gil Strang <>
Date: Mon, 16 Oct 95 15:48:44 BST
Subject: Workshop Course on Wavelets and Filter Banks


taught by Gilbert Strang (MIT) and Truong Nguyen (Wisconsin)
Saturday-Sunday-Monday(holiday) January 13-15, 1996
University of South Florida at TAMPA

TEXT: Participants will receive the new textbook (publication date 1/1/96)

Wellesley-Cambridge Press, Box 812060, Wellesley MA 02181

We will aim for the right balance in this Workshop. The text gives
an overall perspective of the field - which has grown with amazing speed
in theory and applications. The topics will include

Multirate Signal Processing: Filtering, Decimation, Polyphase
Analysis and Design of Filter Banks
Matrix Analysis: Toeplitz Matrices and MATLAB Implementation
Wavelet Transform: Pyramid and Cascade Algorithms
Daubechies Wavelets, Orthogonal and Biorthogonal Wavelets
Audio and Image Compression, Quantization Effects
Transient Detection and Radar Processing
Non-Destructive Evaluation, Digital Communication
Perfect Reconstruction: Cosine-Modulated Filter Banks
Spectral Factorization and Transmultiplexers
Time-Frequency and Time-Scale Analysis
Imaging and Scientific Visualization

The goal of the Workshop is to be as useful as possible to all
participants. Please request information by an email message
with subject Workshop to the organizer

Gilbert Strang:

We will reply about the program and registration and housing.
The tuition cost will be reduced by 50% for graduate students.
We are very glad to answer all questions.


From: Manuel Bronstein <>
Date: Fri, 20 Oct 1995 13:41:47 +0100
Subject: International Symposium on Symbolic and Algebraic Computation

[A postscript copy of this announcement is available by anonymous ftp from

Also check the ISSAC'96 homepage for latest info (URL below)

I S S A C ' 9 6
International Symposium on Symbolic and Algebraic Computation
July 24-26, 1996 Zurich, Switzerland
Sponsored by ACM SIGSAM and ACM SIGNUM

ISSAC is an annual international symposium that provides an opportunity to
learn of new developments and to present original research results in all
areas of symbolic mathematical computation.

TOPICS OF THE MEETING include, but are not limited to:

Algorithmic mathematics: algebraic, symbolic, and symbolic-numeric algorithms
in all areas of mathematics;

Computer science: theoretical and practical questions in symbolic mathematical
computation, including:
- computer algebra systems and problem solving environments,
- programming languages and libraries for symbolic computation
- user interfaces,
- data structures,
- parallel computing,
- software architectures,
- concrete analysis and benchmarking,
- complexity of computer algebra algorithms,
- artificial intelligence techniques,
- automatic differentiation and code generation;

Applications: problem treatments incorporating algebraic, symbolic or
symbolic-numeric computation in an essential or novel way,
including engineering, economics and finance, physical and
biological sciences, computer science, logic, mathematics,
statistics, and use in education.

ISSAC'96 will be held in the main building of the Swiss Federal Institute
of Technology (ETH) in Zurich, Switzerland. Accomodations will be available
at nearby hotels. The planned activities include invited presentations,
original research papers, tutorial courses, vendor exhibits and software
demonstrations. Proceedings will be distributed at the symposium.

Proposals for workshops, tutorial courses, demonstrations, panel discussions
or related activities are welcomed. User-groups, editorial boards
or other associations desiring meeting space during the course of the
symposium are encouraged to contact the conference organizers.

General Chair: Program Chair:
Erwin Engeler Bob Caviness
Mathematics Computer & Information Sciences
ETH Zentrum HG 103 Smith Hall
CH-8092 Zurich, Switzerland University of Delaware Newark DE 19716, USA

Exhibit Chair: Local Arrangements Chair:
Max Engeli Michael Kalkbrener
Institute of Machine Tools and Manufacturing Mathematics
ETH Zentrum CLA ETH Zentrum HG
CH-8092 Zurich, Switzerland CH-8092 Zurich, Switzerland

Program Committee:
John Cannon (AU - Vice Chair) Bob Caviness (USA - Chair)
Marie-Francoise Coste-Roy (F) Keith Geddes (CND)
Patrizia Gianni (I) Richard Liska (CZ)
Austin Lobo (USA) Bud Mishra (USA)
Marko Petkovsek (SLO) Felix Ulmer (F)


From: Maya Neytcheva <>
Date: Fri, 20 Oct 1995 17:36:54 +0100
Subject: Conference on Algebraic Multilevel Iteration Methods

Announcement and call for papers
June 13-15, 1996, University of Nijmegen, The Netherlands

Owe Axelsson, Nijmegen, The Netherlands
Dietrich Braess, Bochum, Germany
Tony F. Chan, Los Angeles, California
Richard E. Ewing, College Station, Texas
Wolfgang Hackbusch, Kiel, Germany
Piet Hemker, Amsterdam, The Netherlands
Yuri A. Kuznetsov, Moscow, Russia
Ulrich Langer, Linz, Austria
Jean-Francois Maitre, Lyon, France
Panayot S. Vassilevski, Sofia, Bulgaria
David M. Young, Austin, Texas, honorary member
Harry Yserentant, Tubingen, Germany

Prof. Owe Axelsson
Faculty of Mathematics and Informatics
Toernooiveld 1, NL-6525 ED Nijmegen
The Netherlands
fax: +31 (0)24 3652140

Owe Axelsson, Ben Polman, Rob Stevenson, Maya Neytcheva, Mariana Nikolova

The purpose of the conference is to provide a forum for the presentation
and the discussion of recent progress in the analysis, implementation and
applications in various fields of algebraic multilevel iteration methods
in a broad sense. This includes their implementation on massively parallel

TOPICS covered include Algebraic Multilevel Iteration methods for
* second and fourth order elliptic scalar equations and systems of equations
* mixed variable variational problems
* nonselfadjoint problems and indefinite matrix problems
* inner-outer iteration methods
* parallel implementations, efficiency measures, scalability
* robust implementations, i.e. convergence uniform with respect to meshsize
parameter and singular perturbation parameters
* applications for Navier's equations and Stokes problem
* applications outside partial differential equation problems
* applications for nonlinear problems, such as electromagnetic field,
plastic flow, Navier-Stokes, and Miscible displacement problems.

Deadline for submission of contribution papers: December 15, 1995.
Notification of acceptance: March 15, 1996.


From: Ling Ma <>
Date: Fri, 20 Oct 1995 15:17:08 -0400 (EDT)
Subject: New Ph.D program in Scientific Computing at Carnegie Mellon

The Department of Mathematics at Carnegie Mellon University
has just established a new Ph.D program in Scientific Computing.
Details of this program can be found on the web at the URL:

A number of Research Associate positions and Teaching Assistantships
will be available starting the Fall of 1996. Interested students
should visit the following URL:

or contact:

Prof. Noel Walkington
Director of Graduate Studies
Dept of Mathematics
Carnegie Mellon University
Pittsburgh, PA 15213

for further inquiries.


From: Christopher Beattie <>
Date: Tue, 17 Oct 1995 15:59:22 -0400
Subject: Position at Virginia Tech

Virginia Polytechnic Institute and State University

Department of Mathematics

Applications are solicited for a tenure-track assistant
professorship in numerical analysis. Candidates must have
a PhD in mathematics or equivalent, with a strong record
or demonstrated potential in research and teaching. We seek
candidates who will augment an existing faculty focus in
numerical treatment of PDEs, optimization, and computational
linear algebra.

Send a letter of application, curriculum vitae, summary
of research plans, together with four letters of recommendation
(one of which addresses teaching skills), to:
Numerical Analysis Search Committee,
Department of Mathematics,
Virginia Tech,
Blacksburg, VA 24061-0123.
Review of applications will begin on December 20, 1995
and will continue until the position is filled.

Virginia Tech has a strong commitment to the principle of diversity
and, in that spirit, seeks a broad spectrum of candidates including
women, minorities, and people with disabilities. Individuals with
disabilities desiring accommodations in the application process should
contact Christopher Beattie, Department of Mathematics, 540-231-6536
(TDD/PC 1-800-828 1120- Voice 1-800-828-1140).


From: Are Magnus Bruaset <>
Date: Tue, 17 Oct 1995 15:46:40 +0100
Subject: Postdoctoral Position at SINTEF Applied Mathematics, Oslo


As part of ongoing strategic research programs, SINTEF Applied
Mathematics (in Oslo, Norway) seeks a qualified person to fill a
one-year position dedicated to multilevel methods and domain
decomposition strategies for numerical solution of partial differential
equations (PDEs), typically for use on parallel computers. The position
is available in the period January - December 1996.

The applicant should have finished a PhD degree in which multilevel and
domain decomposition methods have played a significant role. Moreover,
the candidate should have practical experiences with such methods at an
implementation level. We are looking for a person that can implement
advanced numerical software within an object-oriented framework. In
particular, the candidate's code development shall take place in close
cooperation with the development of the Diffpack libraries for numerical
solution of PDEs. For this reason, it is necessary to document high
competence of advanced C++ programming for applications related to
PDEs. For further information on the Diffpack project, please see the
Web page

The Diffpack project and related activities take place in close
cooperation with the University of Oslo.

Candidates who wish to apply should send a copy of their
resume to

Are Magnus Bruaset
SINTEF Applied Mathematics
P.O. Box 124 Blindern
N-0314 Oslo

along with the names and addresses (including email addresses if
possible) of two referees who may be contacted to give a confidential
appraisal of the candidate. Further information can be collected from

Dr. Bruaset (email
Professor Aslak Tveito (email,
Department of Informatics, University of Oslo.

The closing date for applications is November 15, 1995.


From: AOH Axelsson <>
Date: Sun, 15 Oct 1995 17:18:08 +0100
Subject: Contents, Numerical Linear Algebra with Applications

Numerical Linear Algebra with Applications
Volume 2, Issue 2, 1995
Special issue dedicated to Beresford Parlett and William Kahan
Part 1

Matrix Shapes Invariant Under the Symmetric QR Algorithm
P. Arbenz and G.H. Golub

Efficient Reduction Algorithms for Bordered Band Matrices
S. van Huffel and H. Park

Approximate Solutions and Eigenvalue Bounds from Krylov Subspaces
Ch.C. Paige, B.N. Parlett and H. van der Vorst

Orthogonal Projections and Total Least Squares
R.D.Fierro and J.R.Bunch

Minimization of the Norm, the Norm of the Inverse and the Condition
Number of a Matrix by Completition
L. Elsner, C. He and V. Mehrmann

Stability of Block $LU$ Factorization
J.W. Demmel, N.J. Higham and R.S. Schreiber

Numerical Linear Algebra with Applications
Volume 2, Issue 3, 1995
Special issue dedicated to Beresford Parlett and William Kahan
Part 2

Some Inverse Eigenproblems for Jacobi and Arrow Matrices
C.F. Borges, R. Frezza and W.B. Gragg

Krylov Subspace Approximation of Eigenpairs and Matrix Functions in
Exact and Computer Arithmetic
Vl. Druskin and L. Knizhnerman

Progress in the Numerical Solution of the Nonsymmetric
Eigenvalue Problem
Zhaojun Bai

Trust Regions Based on Conic Functions in Linear and Nonlinear
J.L. Nazareth

On Parlett's Matrix Norm Inequality for the Cholesky Decomposition
Allan Edelman and W.F. Mascarenhas

Regions of Convergence of the Rayleigh Quotient Iteration Method
R.D. Pantazis, D.B. Szyld

Optimal Backward Perturbation Bounds for the Linear Least Square
Bertil Walden, Rune Karlson and Ji-guang Sun

On the Solution of Block Hessenberg Systems
G.W. Stewart

Dynamical Analysis of Numerical Systems
S. Batterson

Numerical Linear Algebra with Applications
Volume 2, Issue 4, 1995

A Special algorithm for envelope of sparse matrices
Barnard Pothen and Horst D. Simon

A Comparison Result for Multisplittings and Waveform
Relaxation Methods
Andreas Frommer and Bert Pohl

Optimal Algebraic Multilevel Preconditioning for Local Refinement
along a Line
S. Margenov and J. Maubach

Peaceman-Rachford Procedure and Domain Decomposition for Finite
Element Problems
William Layton and Patrick Rabier


From: Richard Brualdi <>
Date: Mon, 16 Oct 1995 14:15:06 -0500 (CDT)
Subject: Contents, Linear Algebra and its Applications

Contents Volumes 223/224

Special Issue Dedicated to Miroslav Fiedler and Vlastimil Ptak

Preface 1

Zdenek Vavrin (Prague, The Czech Republic)
Miroslav Fiedler and Vlastimil Ptak: Life and Work 3

Daniel Alpay and Vladimir Bolotnikov (Beer-Sheva, Israel)
Two-Sided Interpolation for Matrix Functions With Entries
in the Hardy Space 31

T. Ando (Sapporo, Japan)
Majorization Relations for Hadamard Products 57

H. Arizmendi (Mexico D. F., Mexico) and V. Muller
(Praha, Czech Republic)
On Algebras Without Generalized Topological Divisors of Zero 65

Wayne W. Barrett, Michael E. Lundquist (Provo, Utah),
Charles R. Johnson, and Hugo J. Woerdeman
(Williamsburg, Virginia)
Completing a Block Diagonal Matrix With a Partially
Prescribed Inverse 73

LeRoy B. Beasley and Shumin Ye (Logan, Utah)
Linear Operators Preserving L-Matrices 89

Roberto Bevilacqua, Nazzareno Bonanni, and Enrico Bozzo
(Pisa, Italy)
On Algebras of Toeplitz Plus Hankel Matrices 99

Rajendra Bhatia (New Delhi, India) and Chandler Davis
(Toronto, Canada)
A Cauchy-Schwarz Inequality for Operators With Applications 119

Alberto Borobia (Madrid, Spain)
On the Nonnegative Eigenvalue Problem 131

Richard A. Brualdi (Madison, Wisconsin) and
Amelia Fonseca (Lisboa, Portugal)
Colorability of Induced Matroids 141

Aniekan A. Ebiefung (Chattanooga, Tennessee)
Existence Theory and Q-Matrix Characterization for the
Generalized Linear Complementarity Problem 155

Miroslav Englis (Prague, Czech Republic)
Toeplitz Operators and the Berezin Transform on H2 171

M. I. Gekhtman and M. Shmoish (Rehovot, Israel)
On Invertibility of Nonsquare Generalized Bezoutians 205

Andrea Gombani (Padova, Italy)
On the Schmidt Pairs of Multivariable Hankel Operators
and Robust Control 243

Michael M. Green (Stony Brook, New York) and
Alan N. Willson, Jr. (Los Angeles, California)
Transistor Circuits and Potentially Stable Operating Points 267

Peter Gritzmann (Trier, Germany), Victor Klee (Seattle,
Washington), and Bit-Shun Tam (Taiwan, Republic of China)
Cross-Positive Matrices Revisited 285

Martin H. Gutknecht (Zurich, Switzerland) and
Marlis Hochbruck (Tubingen, Germany)
The Stability of Inversion Formulas for Toeplitz Matrices 307

Sy-Ming Guu (Taiwan, Republic of China) and
Richard W. Cottle (Stanford, California)
On a Subclass of P0 325

Georg Heinig (Safat, Kuwait)
Matrix Representations of Bezoutians 337

Roger A. Horn (Salt Lake City, Utah)
Norm Bounds for Hadamard Products and an Arithmetic-
Geometric Mean Inequality for Unitarily Invariant Norms 355

Charles R. Johnson (Williamsburg, Virginia), William D. McCuaig
(Toronto, Ontario, Canada), and David P. Stanford
(Williamsburg, Virginia)
Sign Patterns that Allow Minimal Semipositivity 363

Charles R. Johnson (Williamsburg, Virginia) and
Pablo Tarazaga (Mayaguez, Puerto Rico)
Connections Between the Real Positive Semidefinite and Distance
Matrix Completion Problems 375

Jaroslav Kautsky and Radka Turcajova (Adelaide, Australia)
Discrete Biorthogonal Wavelet Transforms as Block Circulant Matrices 393

Udo R. Krieger (Darmstadt, Germany)
On a Two-Level Multigrid Solution Method for Finite Markov Chains 415

Monique Laurent (Paris, France) and Svatopluk Poljak
(Passau, Germany)
On a Positive Semidefinite Relaxation of the Cut Polytope 439

Chi-Kwong Li (Williamsburg, Virginia) and Nam-Kiu Tsing
(Hong Kong, People's Republic of China)
Linear Maps Relating Different Unitary Similarity Orbits or
Different Generalized Numerical Ranges 463

Raphael Loewy (Haifa, Israel) and Stephen Pierce
(San Diego, California)
Linear Preservers of Balanced Nonsingular Inertia Classes 483

Ivo Marek (Praha, Czech Republic)
On Square Roots of M-Operators 501

Reinhard Nabben (Bielefeld, Germany) and Richard S. Varga
(Kent, Ohio)
On Classes of Inverse Z-Matrices 521

Barry W. Peyton (Oak Ridge, Tennessee), Alex Pothen
(Norfolk, Virginia), and Xiaoqing Yuan (North York, Ontario, Canada)
A Clique-Tree Algorithm for Partitioning a Chordal Graph
Into Transitive Subgraphs 553

Jiri Rohn (Prague, Czech Republic)
Checking Bounds on Solutions of Linear Interval Equations is NP-Hard 589

Karla Rost (Chemnitz, Germany) and Zdenek Vavrin
(Praha, Czech Republic)
Recursive Solution of Lowner-Vandermonde Systems of Equations. II 597

Ronald L. Smith (Chattanooga, Tennessee)
Some Results on a Partition of Z-Matrices 619

P. G. Spain (Glasgow, Scotland)
A Discrete Variation on Kronecker's Theorem 631

P. G. Spain (Glasgow, Scotland)
Tracking Poles, Representing Hankel Operators, and the Nehari Problem 637

Roman Sznajder and M. Seetharama Gowda (Baltimore, Maryland)
Generalizations of P0- and P-Properties, Extended Vertical
and Horizontal Linear Complementarity Problems 695

Reha H. Tutuncu and Michael J. Todd (Ithaca, New York)
Reducing Horizontal Linear Complementarity Problems 717

George Visick (Northwood, Middlesex, England)
A Weak Majorization Involving the Matrices A B and AB 731

Author Index 745


From: SIAM <>
Date: Wed, 18 Oct 95 16:42:37 EST
Subject: Contents, SIAM Discrete Mathematics

SIAM Journal on Discrete Mathematics
NOVEMBER 1995, Volume 8, Number 4

On-Line and First-Fit Coloring of Graphs That Do Not Induce $P_5$
Henry A. Kierstead, Stephen G. Penrice, and William T. Trotter

On the lambda-Number of $Q_n$ and Related Graphs
Marshall A. Whittlesey, John P. Georges, and David W. Mauro

The Median Procedure in a Formal-Theory of Consensus
F. R. McMorris and R. C. Powers

Symmetric Matrices Representable by Weighted Trees Over a
Cancellative Abelian Monoid
Hans-Jurgen Bandelt and Michael Anthony Steel

Correlation of Boolean Functions and Pathology in Recursion Trees
Ingo Althofer and Imre Leader

Lower Bounds on Formula Size of Boolean Functions Using Hypergraph
Ilan Newman and Avi Wigderson

Feasible Offset and Optimal Offset for General Single-Layer Channel
Ronald I. Greenberg and Jau-Der Shih

Canonical Encoders for Sliding Block Decoders
Jonathan Ashley and Brian Marcus

Treewidth and Pathwidth of Permutation Graphs
Hans L. Bodlaender, Ton Kloks, and Dieter Kratsch

Salvage-Embeddings of Complete Trees
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, and
Arnold L. Rosenberg

Upper and Lower Bounds on Constructing Alphabetic Binary Trees
Maria Klawe and Brendan Mumey

On Families of Sets of Integral Vectors Whose Representatives Form
Sum-Distinct Sets
Dusan B. Jevtic

An Approximation Algorithm for Preemptive Scheduling on
Parallel-Task Systems
Ramesh Krishnamurti and Bhagirath Narahari

Altshuler's Sphere $M^9_963$ Revisited
Jurgen Bokowski and Peter Schuchert

Equidistribution in All Dimensions of Worst-Case Point Sets for the
Traveling Salesman Problem
Timothy Law Snyder and J. Michael Steele

Author Index


End of NA Digest