NA Digest Sunday, May 3, 2009 Volume 09 : Issue 18

Today's Editor:
Tamara G. Kolda
Sandia National Labs

Submissions for NA Digest:

Mail to

Information via email about NA-NET:

Mail to


From: Joseph Traub <>
Date: Mon, 27 Apr 2009 10:27:40 -0400 (EDT)
Subject: 2009 Prize for Information-Based Complexity


The recipient of the 2009 Prize for outstanding
contributions to information-based complexity is Thomas
Mueller-Gronbach, Fakultaet fuer Informatik und Mathematik,
Universitaet Passau, Germany.

The prize consists of $3000 and a plaque. The award will be
presented at the Seminar on Algorithms and Complexity for
Continuous Problems at Schloss Dagstuhl,Germany, in September


From: "Field G. Van Zee" <>
Date: Fri, 01 May 2009 17:05:26 -0500
Subject: libflame 3.0 now available

We are happy to announce the third milestone release of libflame, a modern
replacement for the most used functionality of the LAPACK linear algebra

Some improvements since Spring 2008:

- A user's guide is now available from, and
also within the libflame source code distribution in the form of LaTeX source.

- Performance improvements to SuperMatrix, libflame's runtime task scheduling
and SMP/multicore parallel execution system.

- Algorithms-by-blocks (also known as "tiled algorithms") implementations for
LU, Cholesky, and QR factorizations, and SPD/HPD matrix inversion, for all four
basic floating-point datatypes (s,d,c,z), parallelized for multi-threaded (SMP,
NUMA, multicore) architectures via SuperMatrix.

- Support for new BLAS-like operations not present in the BLAS or LAPACK.

- More robust parameter checking.

- In addition to the standard GNU/Linux build system, we now offer
out-of-the-box support for Microsoft Windows.

For a first introduction to libflame we recommend reading:

Field G. Van Zee, Ernie Chan, Robert A. van de Geijn, Enrique S. Quintana-Ortí,
and Gregorio Quintana-Ortí. "Introducing: The libflame Library for Dense Matrix
Computations." IEEE Computing in Science & Engineering, submitted.

available at .

In that paper, we discuss what we view to be the strengths of libflame and give
a number of performance graphs that illustrate how the approach allows one to
quickly re-target the library to a new architecture. For example, extensions to
libflame are available that allow one to use GPU hardware accelerators to solve
20K x 20K SPD systems in seconds and 100K x 100K SPD systems in around 20

Field G. Van Zee
for the FLAME team


From: Guido Kanschat <>
Date: Mon, 27 Apr 2009 16:27:36 -0400
Subject: deal.II version 6.2.0 released

Version 6.2 of deal.II, the object-oriented finite element library
recently awarded the J. H. Wilkinson Prize for Numerical Software, has
been released. It is available for free under an OpenSource license from the
deal.II home-page at

Major new features of version 6.2 are:
- The ability to do anisotropic mesh refinement in both 2d and 3d
- Support for meshes defined on curved manifolds, and the discretization
of partial differential or boundary integral equations on such domains
- 4 new extensively documented tutorial programs demonstrating solving
boundary integral equations, the Boussinesq equations, anisotropic
mesh refinement, and an application from nuclear reactor engineering
- Interfaces to the linear algebra classes in the Trilinos library
- Support for vastly faster matrix assembly on structured meshes
- Some 120 new functions, classes, and bug fixes.

All main features of the previous versions have been continued and improved:
- Support for dimension-independent programming
- Extensive documentation and working example programs
- Multigrid support
- Locally refined grids
- A zoo of different finite elements
- Fast linear algebra
- Built-in support for symmetric multi-processing (SMP) and distributed
- Interfaces to Trilinos, PETSc, METIS, UMFPACK and other external software
- Output for a wide variety of visualization platforms.

Wolfgang Bangerth, Guido Kanschat, Ralf Hartmann, and many others who


From: Christian Rieger <>
Date: Fri, 24 Apr 2009 09:37:12 -0400
Subject: Colloquium: 50 Years Numerische Mathematik, Leibnez, Jun 2009

For details, please see:

Organizing committee: Michael Griebel, Hans-Joachim Bungartz, Christoph
Zenger, Stefan Zimmer


Tuesday, June 16, 2009
Colloquium "50 Years Numerische Mathematik"
9:30 a.m. - 6 p.m., Leibniz Supercomputing Centre, Lecture Hall,
Boltzmannstraße 1

* Alfio Quarteroni, École Polytechnique Fédérale de Lausanne and
Politecnico di Milano
* Douglas N. Arnold, University of Minnesota at Minneapolis
* Marc A. Schweitzer, Universität Bonn
* Wolfgang Dahmen, RWTH Aachen
* Carl W. R. de Boor, University of Wisconsin at Madison
* Beresford N. Parlett, University of California at Berkeley
* G. W. (Pete) Stewart, University of Maryland
* Olof B. Widlund,New York University
* Endre Süli, University of Oxford
* Michael J. Holst, University of California at San Diego
* Roland Glowinski, University of Houston

Tour to the supercomputing facilities at LRZ


From: Christian Rieger <>
Date: Fri, 24 Apr 2009 09:34:38 -0400
Subject: Colloquia on the Occasion of F. L. Bauer 85 Years, Leibnez, Jun 2009

For more details, please see

Organizing committee: Michael Griebel, Hans-Joachim Bungartz, Christoph
Zenger, Stefan Zimmer

Monday, June 15, 2009

Birthday Colloquium F. L. Bauer
Award of the F. L. Bauer-Prize
4 p.m.; Bayerische Akademie der Wissenschaften, Plenarsaal

* Award of the F.L. Bauer-Prize to Stephen Wolfram
Presentation: Ernst W. Mayr, Department of Informatics, TUM
o Laudation
Bruno Buchberger, Johannes Kepler Universität Linz
o Award ceremony
Alfons Kemper, Dean of the Department of Informatics, TUM
o Lecture
Stephen Wolfram, CEO, Wolfram Research Inc.
* Award of the Computational Science and Engineering Prize
(Springer-Verlag) Presentation: Joachim Heinze, Executive
Vice-President of Publishing Mathematical Sciences,
Springer-Verlag Michael Griebel, Universität Bonn


From: Franz Franchetti <>
Date: Thu, 30 Apr 2009 08:13:38 -0400
Subject: Intl Conf on Supercomputing ICS-2009, New York, Jun 2009

23rd International Conference on Supercomputing, June 9-11, 2009
IBM T.J. Watson Research Center, Metro New York City Area, USA
Sponsored by ACM/SIGARCH,

The program is now available online and registration is now open for the 23rd
International Conference on Supercomputing (ICS 2009) at the ICS website at Befitting its status as the premier
international forum for the presentation of research results in high-
performance computing systems, ICS 2009 had a record number of high quality
submissions. The program committee selected the very best 24% of papers for
presentation, but had to reject a number of very high quality submissions.
To allow additional work to be presented this year, this year’s ICS
conference will feature a poster session to provide yet another forum for the
exchange of research ideas.

This year the conference will be held at the IBM T.J. Watson Research Center
in Yorktown Heights, NY, one of the industry’s premier research facilities.
ACM has negotiated a reduced rate for ICS'09 conference attendees at the
Westchester Marriott, one of Westchester County's finest hotels and within
easy reach of the TJ Watson Research Center. The rate will be available from
June 5, 2009 through June 15, 2009. Rooms at the conference rate can be
booked either by calling 1-800-882-1042 and referencing the ICS 2009 group
rate, or they may be booked online at and
entering the group code ICSICSA.

Important Dates
Hotel reservations: May 8, 2009
Early registration: May 10, 2009
Conference: June 9-11, 2009
Workshops & Tutorials: June 8, 2009 and June 12, 2009


From: Suvrit Sra <>
Date: Wed, 29 Apr 2009 11:09:25 -0400
Subject: Numerical Math in Machine Learning, Montreal, Jun 2009

We invite participation NUMML 2009, our Workshop, to be held as a part of the
International Conference in Machine Learning (ICML), in Montreal, Canada, on
18th June, 2009.

Title: NUMML 2009 Numerical Mathematics in Machine Learning

Please visit
for further details

Submission deadline: 4th May, 2009

Most machine learning (ML) algorithms rely fundamentally on concepts of
numerical mathematics. Standard reductions to black-box computational
primitives do not usually meet real-world demands and have to be
modified at all levels. The increasing complexity of ML problems
requires layered approaches, where algorithms are components rather than
stand-alone tools fitted individually with much human effort. In this
modern context, predictable run-time and numerical stability behavior of
algorithms become fundamental. Unfortunately, these aspects are widely
ignored today by ML researchers, which limits the applicability of ML
algorithms to complex problems, and therefore the practical scope of ML
as a whole.

The Organizers
(Matthias Seeger, Suvrit Sra, and John Cunningham)


From: Peter Hertling <>
Date: Wed, 29 Apr 2009 09:49:58 +0200
Subject: Computability and Complexity in Analysis, Slovenia, Aug 2009

Third Call for Papers and Announcement

Sixth International Conference on
Computability and Complexity in Analysis 2009 (CCA 2009)
August 18-22, 2009, Ljubljana, Slovenia

Invited Speakers
* Mark Braverman (Cambridge, USA)
* Vladik Kreinovich (El Paso, USA)
* Dana Scott (Pittsburgh, USA)
* Ning Zhong (Cincinnati, USA)

* Martín Escardó (Birmingham, UK)
* Bas Spitters and Russell O'Connor (Eindhoven, The Netherlands)

Authors are invited to submit a PDF version of an
extended abstract (typically 10-12 pages) on the
following web page:

These extended abstracts should be prepared using
the LNCS stylefile of Springer Verlag; see

Accepted papers will be published in an electronic proceedings
volume in the DROPS series of Schloss Dagstuhl.
In addition, a technical report containing the accepted
papers will be available at the conference.
It is planned to publish a special issue of some journal
dedicated to CCA 2009 after the conference.

Submission deadline: May 11, 2009
Notification of authors: June 15, 2009
Final Version: July 13, 2009


From: "Neville Ford" <>
Date: Thu, 30 Apr 2009 07:53:18 +0100
Subject: stochastic Delay Differential Equations at Univ of Chester, UK, Sep 2009

Research meeting on Stochastic Delay Differential Equations at
University of Chester, UK

Title: Numerical and analytical solution of stochastic delay
differential equations, 7th - 10th September 2009
To be held at the Department of Mathematics, University of Chester,
Parkgate Road, Chester CH1 4BJ, UK

The Main speakers are:

John Appleby - Dublin City University
Evelyn Buckwar - Heriot-Watt University, Edinburgh, UK
Bernt Øksendal - University of Oslo, Norway
Xuerong Mao - University of Strathclyde, UK.
Michael Scheutzow - Technische Universität Berlin
Michael Tretyakov - University of Leicester, UK
Robert Schlicht - Helmholtz Zentrum Muenchen, Neuherberg, Germany
Markus Riedle - University of Manchester, UK.

Full details are available at the meeting homepage:

The Leverhulme International Network, based in Chester and led by
Professor Neville Ford, has been established for 3 years from 2008 to
2011, with the aim of bringing together experts from the areas of
mathematical modelling, mathematical analysis, numerical and
computational methods and stochastic analysis of functional differential
equations. This is the 2nd of 4 network workshop meetings to enable
methodologies to be shared and new working methods and collaborations to
be established.

Scientific queries to: Neville Ford (
Other queries to Nicola Williams (


From: Jiang Zhu <>
Date: Thu, 30 Apr 2009 15:16:54 -0400
Subject: Brazil-China Conference on Scientific Computing, Brazil, Sep 2009

has been postponed to be held in September 21-25, 2009,
LNCC, Petropolis, Rio de Janeiro State, Brazil.

- Submission of abstract: June 20, 2009
- Acceptance notification: July 20, 2009
- Submission of full paper: December 31, 2009.


From: Jerzy Wasniewski <>
Date: Fri, 1 May 2009 15:52:45 +0200 (CEST)
Subject: Novel Data Formats and Algorithms for HPC, Poland, Sep 2009

A Workshop
on Novel Data Formats and Algorithms
for High Performance Computing
organized by
Fred Gustavson and Jerzy Wasniewski}

Abstract: Recently, several novel data formats were introduced into the
area of High Performance Computing with the intent of producing new
algorithms as well as improving their performance. Recursion, via the
divide-and-conquer paradigm, introduced variable blocking to complement
the standard fixed block algorithms. In particular, new data structures
for dense linear algebra became an active research area. This Workshop
will focus on both new data structures and/or new or existing algorithms
for in general high performance computing.

This workshop will be held at the conference
Wroclaw, Poland,
September 13-16 2009,

A limited number of contributed, 20 minute talks will be selected for
this workshop. Extended abstracts no more than two pages should be sent
before May 15, 2009. The text can be in Latex, Postscript, PDF or pure
ASCII. Please send the text to email: "". The acceptance of
this abstract will be sent just after receiving it.

After acceptance, full papers according to the rules of the Springer
LNCS ( and PPAM 2009
Conference ( may be submitted. In order
to be published in the Springer LNCS proceedings. They should be no
longer than 10 pages. Please send then by June 1, 2009. These submitted
papers will be read and evaluated by at least two reviewers.

Summary of important dates and notes:
May 15, 2009 -- abstracts maximum two pages,
May 15, 2009 -- acceptance of this abstracts,
May 31, 2009 -- papers submission and after the papers go to reviewers,
August 15, 2009 -- the papers go back to authors for corrections,
September 9-12, 2009 -- the conference,
October 31, 2009 -- camera ready papers.

For more information related to PPAM 2009 Conference, including the
payments, registration, hotel reservation etc., please visit the PPAM
2009 website, "".

The workshop organizers:

Fred Gustavson Jerzy Wasniewski
Emeritus, IBM Researcher and Danish Technical University
Yorktown Height, NJ, USA Department of Informatics
and Adjunct, Umea Univ. and Mathematical Modeling
Umea, Sweden Lyngby, Copenhagen, Denmark
email: email:


From: "Kirsten Wilden" <>
Date: Tue, 28 Apr 2009 20:30:52 -0400
Subject: SIAM/ACM Geometric and Physical Modeling, San Francisco, Oct 2009


incorporating the 2009 SIAM Conference on Geometric Design
and the 2009 ACM Symposium on Solid and Physical Modeling

October 5-8, 2009
San Francisco, California, USA
Hilton San Francisco Financial District

Conference website:

It is now time to submit abstracts for minisymposia and contributed
presentations in lecture or poster format. The submission system is
open. The deadline is May 15, 2009.

Details and submission information are available below and at:

David Baraff, Pixar Animation Studios
Ted D. Blacker, Sandia National Laboratories
Leonidas Guibas, Stanford University
Baining Guo, Microsoft Research Asia
Stefanie Hahmann, Grenoble Institute of Technology, France
Bert Jüttler, Johannes Kepler University, Austria


From: Kirsten Wilden <>
Date: Sat, 2 May 2009 10:24:24 -0400
Subject: ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, Jan 2010

ACM-SIAM Symposium on Discrete Algorithms (SODA10)
January 17-19, 2010
Hyatt Regency Austin
Austin, Texas

This symposium focuses on research topics related to efficient algorithms
and data structures for discrete problems. In addition to the design of such
methods and structures, the scope also includes their use, performance
analysis, and the mathematical problems related to their development or
limitations. Performance analyses may be analytical or experimental and may
address worst-case or expected-case performance. Studies can be theoretical
or based on data sets that have arisen in practice and may address
methodological issues involved in performance analysis.

The Call for Presentations for this symposium is available at:

Submission Deadlines:
June 29, 2009, 4:59 PM Eastern Daylight Time - Pre-Submission Deadline
July 6, 2009, 4:59 PM Eastern Daylight Time - Final Submission Deadline

Program Committee Chair:
Moses Charikar, Princeton University

For additional information, contact the SIAM Conferences Department at


From: Omar Lakkis <>
Date: Wed, 29 Apr 2009 12:41:12 -0400
Subject: EPSRC Ph D (D Phil) scholarship at Sussex

One EPSRC funded PhD position is available at the Department of Mathematics,
University of Sussex.

We are seeking for an academically strong graduate to work on an
interdisciplinary project in the area of Mathematical Epidemiology in the
framework of a D.Phil./Ph.D.

Experience in one or more of the following is an advantage: (1) mathematical
modelling of biological processes, (2) network/graph theory and (3) computer

Grant applies to UK nationals (or equivalent) only.

For more details:


From: Raimondas Ciegis <>
Date: Tue, 28 Apr 2009 15:21:09 +0300 (EEST)
Subject: Contents, Mathematical Modelling and Analysis 14(2)

The Baltic Journal on Mathematical Applications, Numerical Analysis
and Differential Equations
ISSN 1392-6292, ISSN 1648-3510 online, Electronical edition:

Raimondas {\v C}iegis (Editor) Volume 14, Number 2, 2009
(p.139-270 )

M. Annunziato. A Finite Difference Method for Piecewise Deterministic
Processes with Memory. II. 139-158

S. Asmuss and N. Budkina. On Smoothing Problems with One Additional
Equality Condition. 159-168

J. Cepitis, H. Kalis and A. Reinfelds. Numerical Investigations of
Single Mode Gyrotron Equation. 169-178

I. Kangro and O. Vaarmann. Some Iterative Regularized Methods for
Highly Nonlinear Least Squares Problems. 179-186

T. Raus and U. H{\"a}marik. New Rule for Choice of the Regularization
Parameter in (Iterated) Tikhonov Method. 187-198

M. Romanovas, L. Klingbeil, M. Traechtler and Y. Manoli. Application
of Fractional Sensor Fusion Algorithms for Inertial MEMS
Sensing. 199-209

L. Shishkina and G. Shishkin. Conservative Numerical Method for a
System of Semilinear Singularly Perturbed Parabolic Reaction-Diffusion
Equations. 211-228

A. {\v S}tikonas and O. {\v S}tikonienë. Characteristic Functions for
Sturm-Liouville Problems with Nonlocal Boundary Conditions. 229-246

I. Yermachenko. Two-Point Boundary Value Problems at
Resonance. 247-257

J. {\v Z}ilinskas. Multidimensional Scaling with City-Block Distances
Based on Combinatorial Optimization and Systems of Linear
Equations. 259-270


From: "Fikret Aliev, Tamer Ba&#351;ar" <>
Date: Wed, 29 Apr 2009 07:03:11 -0400
Subject: Contents, Intl Journal of Applied and Computational Mathematics 8(1)

Applied and Computational Mathematics, Vol.8, No.1, 2009
(ISSN 1683-3511,

Advances for the Pooling Problem: Modeling, Global Optimization, and
Computational Studies (Survey)
Ruth Misener and Christodoulos A. Floudas

Classification via Mathematical Programming (Survey)
Panos M. Pardalos, O. Erhun Kundakcioglu

On Linear Stationary System Identification at Regular and Irregular
Alexander S. Apostolyuk, Vladimir B. Larin

Robust Optimal Control on Imperfect Measurements of Dynamic Systems States
R. Gabasov, F.M. Kirillova, E.I. Poyasok

Feedback Control Design For Subsonic Cavity Flows
X. Yuan, E. Caraballo, J. Little, M. Debiasi, A. Serrani, H. Özbay,
J.H. Myatt, and M. Samimy

Optimization Methods and the k-Committees Algorithm for Clustering of
Sequence Data
J.L. Yearwood, A.M. Bagirov, A.V. Kelarev

Statistical Approach for an Optimal Placement of the Letters of Different
Alphabets on a Computer
A.Abbasov, A.Hajiyev, G. Afandiyev

Linear Control Systems: Feedback and Separation Principles
D. Petrova, A. Cheremensky

On a statistical interrelation between boiling point and elastic modulus
Eugen Grycko and Werner Kirsch

Computation of the eigenpairs for a linear differential operator using a
variational approximation with finite elements and numerical quadrature
Rahhal Janane

Cole-Hopf Transformation as Numerical Tool for the Burgers Equation
Taku Ohwada

70th Birthday of prof. Otto Moeschlin


From: Laura Smith <>
Date: Wed, 29 Apr 2009 14:53:38 +0100
Subject: Contents, Inverse Problems, 25(5): May 2009


Volume 25, Issue 5, May 2009

Article numbers: 055001--059801

Individual articles are free for 30 days following their publication on
the web. This issue is available at:


Inverse transport theory and applications
Guillaume Bal


F John's stability conditions versus A Carasso's SECB constraint for
backward parabolic problems
Jinwoo Lee and Dongwoo Sheen

A non-local boundary value problem method for the Cauchy problem for
elliptic equations
Dinh Nho H\`ao, Nguyen Van Duc and D Lesnic

Fixed domain approaches in shape optimization problems with Dirichlet
boundary conditions
P Neittaanm\"aki, A Pennanen and D Tiba

Iterative multi-resolution retrieval of non-measurable equivalent currents
for the imaging of dielectric objects
P Rocca, M Donelli, G L Gragnani and A Massa

Iterative and range test methods for an inverse source problem for
acoustic waves
Carlos Alves, Rainer Kress and Pedro Serranho

Physics-based models for measurement correlations: application to an
inverse Sturm--Liouville problem
Guillaume Bal and Kui Ren

Identifiability problems of defects with the Robin condition
Carlo Domenico Pagani and Dario Pierotti

Time reversal in thermoacoustic tomography---an error estimate
Yulia Hristova

A self-parametrizing partition model approach to tomographic inverse
T Bodin, M Sambridge and K Gallagher

On uniqueness in diffuse optical tomography
Bastian Harrach


059801Recovering the mass and the charge of a Reissner--Nordstr\"om black
hole by an inversescattering experiment
Thierry Daud\'e and Fran{\c{c}}ois Nicoleau


From: Tim Davis <>
Date: Mon, 27 Apr 2009 13:01:14 -0400
Subject: The Mouseholder QR, part 6 of 8

Burns original:

That wee bit heap o' leaves an' stibble,
Has cost thee mony a weary nibble!
Now thou's turn'd out, for a' thy trouble,
But house or hald,
To thole the winter's sleety dribble,
An' cranreuch cauld!

Modern English, non-poetic:

That little heap of leaves and stubble has cost you many a weary
nibble! Now you're turned out, for all your trouble, from house and
all you own, to suffer the winter's sleety rain and hoar-frost cold.

Matrix translation, where "Sturm" with an umlaut is "Storm" in English:

That wee bit heap o' profs' old papers,
Has cast no root from thine old capers!
Not one's turn'd up, for a' thy vectors,
Are badly scaled
To fool my Sturm-based rank detectors,
As eigens flail!

End of NA Digest