NA Digest Sunday, June 23, 2002 Volume 02 : Issue 25

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

Submissions for NA Digest:

Mail to na.digest@na-net.ornl.gov.

Information via e-mail about NA-NET: Mail to na.help@na-net.ornl.gov.

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

From: Ludwig Elsner <elsner@mathematik.uni-bielefeld.de>
Date: June 21, 2002
Subject: Householder Award for Jing-Rebecca Li

The Householder Award XI (2002) for the best dissertation in numerical linear
algebra for the period 1999-2001 has been awarded to Jing-Rebecca Li, now at
the Courant Instiute, for her dissertation "Model reduction of large linear
systems via low rank grammians". She wrote her dissertation at MIT under
the direction of Jacob White. The award was presented at a banquet during
the Householder Symposium XV in Peebles, Scotland, June 16-21, 2002.

Honorable mentions were:

Andrea Toselli, now at ETH Zurich, for his dissertation "Domain decomposition
methods for vector field problems", written at the Courant Institute under
the supervision of Olaf Widlund.

Hao-min Zhou, now at Caltech, for his dissertation, "Wavelet transformations
and PDE techniques in image compression", written at UCLA under the
supervision of Tony Chan.

Bor Plestenjak, University of Lubljana, Slovenia, for his dissertation
"Continuation methods for multiparameter eigenvalue parameters, written
under the supervision of T. Kosir.

-- L. Elsner
Chair, Householder prize committee


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

From: R Clint Whaley <rwhaley@cs.utk.edu>
Date: Wed, 19 Jun 2002 20:23:56 -0400 (EDT)
Subject: New Release of ATLAS BLAS

The ATLAS team is pleased to announce the newest stable release, 3.4.1.
ATLAS (Automatically Tuned Linear Algebra Software) provides portably
optimal linear algebra software. ATLAS uses the BSD-style license. The
current version provides a complete BLAS API (for both C and Fortran77),
and a small subset of the LAPACK API. For all supported operations,
ATLAS achieves performance on par with machine-specific tuned libraries.

In addition to tuning itself in a general way for cache-based architectures,
ATLAS also features:
* SMP support via Posix threads
* Many architecture-specific optimizations, including:
- AltiVec, SSE, SSE2, and 3DNow! support
- Prefetch on most systems that support it

ATLAS is an open source project (started at the Innovative Computing Laboratory
of the University of Tennessee) hosted on both SourceForge and netlib:
http://math-atlas.sourceforge.net/
http://www.netlib.org/atlas/

Selected improvements from the previous stable release, 3.2.1:
* Optimization of Level 1 BLAS
* Additional architecture-specific support:
- OS X and AltiVec support
- IA64 prefetch
- Julian Ruhe's Athlon kernel boosts performance to ~80% of peak
using the x87 FPU (peak is 2 flops/cycle)
* LAPACK inversion routines supported
* Numerous small speedups and error corrections, see Changelog for details

For further ATLAS information see the FAQ at:
http://math-atlas.sourceforge.net/faq.html


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

From: Haroud <jamila.sam@epfl.ch>
Date: Mon, 17 Jun 2002 13:50:16 +0200
Subject: Workshop in Sophia Antipolis on Global Constrained Optimization

1st International Workshop on
Global Constrained Optimization and Constraint Satisfaction (Cocos'02)

Valbonne - Sophia Antipolis, France
2-4 October 2002
http://liawww.epfl.ch/Cocos02/cocos02.html

WORKSHOP OBJECTIVES

Continuous constraints are often a natural way to represent practical
problems and the knowledge they involve. Such constraints may be
simple or complex, linear or non-linear and may, or may not, involve
transcendental functions. They are widely used to express chemical or
mechanical models, process descriptions, building codes or cost
restrictions for example. Many industrial problems involving
continuous constraints can be modelled as continuous constraint
satisfaction and optimization problems (CSOPs). In practice, such
models are often large in size and non-linear.

This workshop focuses on complete solving techniques for continuous
CSOPs that provide all solutions with full rigor. Less rigorous
solution techniques are not excluded, since they may be part of
complete relevant techniques. Complete solution techniques guarantee
that all the constraints - e.g. security or tolerance criteria - are
satisfied and the global optima identified. Completeness would thus
benefit directly the quality and reliability of decisions or analyses
based on the provided solutions. This has obvious implications in
many industrial and economic areas.

TOPICS:

Relevant topics include, but are by no means restricted to the following:

- Solution techniques for global optimization problems
- Integration of constraint programming with non-linear programming techniques
- Linear programming enclosures of nonlinear programs
- Improved consistency techniques for continuous constraints
- Combination of symbolic methods with mathematical and constraint
programming techniques
- Solution techniques for under-constrained systems
- Adaptation of sparse matrix techniques to the non-linear case
- Enclosures by polytopes or nonlinear boundaries
- Representation and exploitation of monotonicity and convexity properties
- Abstractions based on convex decomposition
- Partial boundary representation based on critical points and
topological abstractions.

IMPORTANT DATES:

15th July 2002: Submission deadline
10th August 2002: Notification of acceptance
31th August 2002: Pre-registration ends
15th September 2002: Final camera-ready copies


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

From: T. Terlaky <terlaky@mcmaster.ca>
Date: Sat, 22 Jun 2002 17:36:16 -0400
Subject: McMaster Optimization Conference

The preliminary program of the

2nd McMaster Optimization Conference:
Theory and Applications
MOPTA-02

is on the WEB
http://www.cas.mcmaster.ca/~mopta/#program
for the MOPTA conference WEB page see
http://www.cas.mcmaster.ca/~mopta/

Early registration deadline is June 30
Registration by using the WEB form:
http://www.eng.mcmaster.ca/forms/mopta_registration.htm

On behalf of the organizers:
Tamas Terlaky (Conference Chair)
terlaky@mcmaster.ca

Enquires should be directed to:
Jan Delsey (Conference secretary)
delsey@mcmaster.ca


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

From: Thomas DeBoni <TMDeBoni@LBL.GOV>
Date: Wed, 19 Jun 2002 09:27:51 -0700
Subject: IBM System Scientific Computing User Group

LAWRENCE LIVERMORE NATIONAL LABORATORY, Livermore, California --
ScicomP 6, a special meeting combining the the sixth meeting of the
IBM System Scientific Computing User Group (SCICOMP), with the summer
meeting of SP-XXL, will take place in Berkeley, California, from
August 19-23, 2002. It will be hosted by UC's Berkeley Laboratory,
Berkeley, California, and the National Energy Research Scientific
Computing Center (NERSC). The early registration deadline is July 29.

The ScicomP meeting series enables computational scientists and
engineers to learn about tools and techniques for developing
applications that achieve maximum performance and scalability on
IBM systems, both SP's and their successors. Technical presentations
will highlight recent results and advanced techniques, and will
provide the kind of information, expertise, and experience that
scientific and technical applications developers need but cannot
easily find elsewhere.

This meeting will include joint sessions for both SCICOMP and SP-XXL
attendees, including a keynote address by a distinguished member of
the high performance computing community.

The ScicomP 6 sessions will feature presentations from IBM research
and development staff, on topics that will include hardware and
software roadmaps for large systems; application development support
software tools; performance programming, measurement, analysis, and
tuning techniques.

ScicomP 6 will also feature user presentations focusing on real
world experiences in porting, maintaining, and running codes on
large scale systems. Coverage will include code migration, scalable
algorithms, hybrid programming models, exploiting system
architectures, and scheduling and execution frameworks.

There will be a day of tutorials presented by IBM staff and others
on topics relevant to user concerns. This meeting will welcome
students, both as regular attendees and as tutorial-only registrants,
at reduced rates. Attendance at a ScicomP meeting conveys membership
in the SCICOMP organization.

SP-XXL will also hold technical sessions at this meeting open to
participants from SP-XXL member sites.

More information on this meeting can be found on the ScicomP 6 web
pages at
http://www.spscicomp.org/ScicomP6/
The agenda will be updated as it develops on the SCICOMP web pages at
http://www.spscicomp.org/ScicomP6/agenda.html
Registration can be done via the web form at
http://www.spscicomp.org/ScicomP6/register.html
Abstracts for proposed User presentations can be submitted via the
web form at
http://www.spscicomp.org/ScicomP6/userpres.html
before the deadline, July 29, 2002.


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

From: Norbert Heuer <norbert@ing-mat.udec.cl>
Date: Thu, 9 May 2002 21:15:07 -0400
Subject: Faculty Positions at University of Concepcion, Chile

UNIVERSITY OF CONCEPCION, CHILE
DEPARTMENT OF MATHEMATICAL ENGINEERING

FACULTY POSITIONS IN APPLIED MATHEMATICS

The Department of Mathematical Engineering at the University of Concepcion
is recruiting for two tenured positions. Appointments at the rank of
Assistant Professor, Associate Professor and Professor are possible.
Successful candidates are expected to pursue an active research program,
perform both graduate and undergraduate teaching, and supervise graduate
students. The Department will consider applicants active in one of the
areas:

Control Theory, Discrete Mathematics, Optimization,
Partial Differential Equations, Stochastic Analysis, or related fields.

The ability of an applicant to complement and extend the existing research
strengths of the department will be an important factor in selection. A
Ph.D. or equivalent in Mathematics or related field is required. The
positions are available as of August 1, 2002 or March 1, 2003. Salary will
be commensurate with experience.

Applicants should submit a vita, two letters of recommendation and selected
reprints to:

Director, Departamento de Ingenieria Matematica, Universidad de Concepcion,
Casilla 160-C, Concepcion, Chile

Applications are considered until the positions are filled. For further
information contact Prof. G. Gatica at ggatica@ing-mat.udec.cl or visit the
department web site at http://www.ing-mat.udec.cl/


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

From: Ronald F Boisvert <boisvert@nist.gov>
Date: Tue, 18 Jun 2002 16:15:52 -0400
Subject: Contents, ACM Transactions on Mathematical Software

Table of Contents
ACM Transactions on Mathematical Software
March 2002, Volume 28, Number 1

For more information, including abstracts and access
to full text, see http://www.acm.org/toms/V28.html.

K. Engelborghs, T. Luzyanina, D. Roose
Numerical bifurcation analysis of delay differential equations
using DDE-BIFTOOL
1-21

Mark S. Gockenbach, Daniel R. Reynolds, Peng Shen, William W. Symes
Efficient and automatic implementation of the adjoint state method
22-44

Wilfried N. Gansterer, Robert C. Ward, Richard P. Muller
An extension of the divide-and-conquer method for a class of
symmetric block-tridiagonal eigenproblems
45-58

Tim Hopkins
Renovating the collected algorithms from ACM
59-74

Ian Robinson, Michael Hill
Algorithm 816: r2d2lri: an algorithm for automatic two-dimensional
cubature
75-100

Enrico Bertolazzi, Gianmarco Manzini
Algorithm 817 P2MESH: generic object-oriented interface between 2-D
unstructured meshes and FEM/FVM-based PDE solvers
101-132


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

From: Maya Neytcheva <maya@tdb.uu.se>
Date: Wed, 19 Jun 2002 09:23:43 +0200 (MET DST)
Subject: Contents, Numerical Linear Algebra with Applications

CONTENTS
Numerical Linear Algebra with Applications
Volume 9, Issues 1-4, 2002

Subspace correction multi-level methods for elliptic eigenvalue problems
Tony F. Chan, Ilya Sharapov (pp, 1-20)

Combination of Jacobi-Davidson and conjugate gradients for the partial
symmetric eigenproblem
Y. Notay (pp. 21-44)

Spectral analysis of parallel incomplete factorizations with implicit
pseudo-overlap
M. Magolu monga Made, Henk A. van der Vorst (pp. 45-64)

An inverse eigenvalue method for frequency isolation in spring-mass systems
Juan C. Egana, Nelson M. Kuhl, Luis C. Santos (pp. 65-79)

On convergence of SOR methods for nonsmooth equations
Xiaojun Chen (pp. 81-92)

Solution of large-scale weighted least-squares problems
Venansius Baryamureeba (pp. 93-106)

On the growth factor in Gaussian elimination for generalized Higham matrices
Alan George, Khakim D. Ikramov, Andrey B. Kucherov (pp. 107-114)

Extension theorems for Stokes and Lame equations for nearly incompressible
media and their applications to numerical solution of problems with highly
discontinuous coefficients
N. S. Bakhvalov, A. V. Knyazev, R. R. Parashkevov (pp. 115-139)

A parallel block overlap preconditioning with inexact submatrix
inversion for linear elasticity problems
Igor E. Kaporin, Igor N. Konshin (pp. 141-162)

The convergence of Jacobi-Davidson iterations for Hermitian eigenproblems
Jasper van den Eshof (pp. 163-179)

H-self-adjoint matrices. Application to radiosity
Michel Leblond (pp. 181-193)

A combination of potential reduction steps and steepest descent steps for
solving convex programming problems
Yixun Shi (pp. 195-221)

On parallel solution of linear elasticity problems. Part II: Methods and
some computer experiments
I. Gustafsson, G. Lindskog (pp. 205-221)

An algebraic multigrid method for finite element discretizations with edge
elements
S. Reitzinger, J. Schoberl (pp. 223-238)

Approximate inverse computation using Frobenius inner product
G. Montero, L. Gonzalez, E. Florez, M. D. Garcia, A. Suarez (pp. 239-247)

Matlab code for sorting real Schur forms
J. H. Brandts (pp. 249-261)

A posteriori error estimation for elliptic eigenproblems
Klaus Neymeyr (pp. 263-279)

Blended kernel approximation in the H-matrix techniques
W. Hackbusch, B. N. Khoromskij (pp. 281-304)

A Lanczos-type algorithm for the QR factorization of regular Cauchy matrices
Dario Fasino, Luca Gemignani (pp. 305-319)

The structured total least-squares approach for non-linearly structured
matrices
P. Lemmerling, S. Van Huffel, B. De Moor (pp. 321-332)


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

From: George Anastassiou <anastasg@msci.memphis.edu>
Date: Thu, 20 Jun 2002 12:17:25 -0500
Subject: Contents, Journal of Computational Analysis and Applications

Journal of Computational Analysis and Applications Vol.4, issue#3,
July 2002.

Table of Contents

1)"An extention of a class of iterative procedures for nonlinear
quasivariational inequalities",Ram U.Verma..................177

2)"The far-field equations in linear elasticity for disconnected rigid
bodies and cavities",Drossos Gintides and Kiriakie Kiriaki..193

3)"Vibrations of elastic strings:Mathematical aspects,Part Two",
L.A.Medeiros,J.Limaco and S.B.Menezes.......................211

4)"A V.Markov-type Inequality for multivariate polynomials on a convex
body",Michael Ganzburg......................................265


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

From: T. Terlaky <terlaky@mcmaster.ca>
Date: Sat, 22 Jun 2002 17:09:07 -0400
Subject: Contents, Optimization and Engineering

Optimization and Engineering -- OPTE

International Multidisciplinary Journal to
Promote Optimization Theory & Applications
in Engineering Sciences

Volume 2, Number 4, December 2001
Special Issue on Surrogate Modeling and
Space Mapping for Engineering Optimization

Guest Editors: John W. Bandler and Kaj Madsen,

John W. Bandler and Kaj Madsen
Editorial---Surrogate Modelling and Space
Mapping for Engineering Optimization 367

Mohamed H. Bakr, John W. Bandler,
Kaj Madsen and Jacob S=F8ndergaard
An Introduction to the
Space Mapping Technique 369

Stephen J. Leary, Atul Bhaskar and Andy J. Keane
A Constraint Mapping Approach to the
Structural Optimization of an Expensive
Model using Surrogates 385

Beno=93 =90t Colson and Philippe L. Toint
Exploiting Band Structure in Unconstrained
Optimization Without Derivatives 399

Natalia M. Alexandrov and Robert Michael Lewis
An Overview of First=ADOrder Model
Management for Engineering Optimization 413

Serhat Hosder, Layne T. Watson, Bernard
Grossman, William H. Mason, Hongman Kim,
Raphael T. Haftka and Steven E. Cox
Polynomial Response Surface
Approximations for the Multidisciplinary
Design Optimization of a High Speed
Civil Transport 431

Jens I. Madsen and Mikael Langthjem
Multifidelity Response Surface
Approximations for the Optimum Design
of Diffuser Flows 453

J.J.M. Rijpkema, L.F.P. Etman
Use of Design Sensitivity Information in
Response Surface and Kriging Metamodels 469


Optimization and Engineering -- OPTE

Volume 3, Number 1, March 2002

A. Potchinkov and R. Reemtsen
Bicriterial Design of Digital Filters 5

G.M. Ostrovski, L.E.K. Achenie,
A.M. Karalapakkam and Yu. M. Volin
Flexibility Analysis of Chemical Processes:
Selected Global Optimization Sub-Problems 31

X.L. Sun and D. Li
Optimality Condition and Branch and Bound
Algorithm for Constrained Redundancy
Optimization in Series Systems 53

Karl Doerner and Erwin Laure
High Performance Computing in the
Optimization of Software Test Plans 67


For more information see:
http://www.cas.mcmaster.ca/~terlaky/OPTE/opte.html
http://www.wkap.nl/journalhome.htm/1389-4420



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

End of NA Digest

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