Subject: NA Digest, V. 16, # 23

NA Digest Monday, June 06, 2016 Volume 16 : Issue 23

Today's Editor:

  Daniel M. Dunlavy
  Sandia National Labs

Today's Topics:

Alan Turing and interval arithmetic
Call for nominations, ICS Prize
Codes for Fast QR Factorization with Column Pivoting
New Book, Nonlinear ODEs. Analytical Approximation and Numerical Methods
Optimization Techniques for Inverse Problems, Italy, Sep 2016
Research Software Engineer Position, STFC, United Kingdom
Research Fellow Position, Computational Modelling of Blast Waves
Special Issue, Frontiers of Mathematics in China
Contents, BIT Numerical Mathematics, 56 (2)

Subscribe, unsubscribe, change address, or for na-digest archives:

Submissions for NA Digest:


From: Rump
Date: June 03, 2016
Subject: Alan Turing and interval arithmetic

Wilkinson mentions in his famous 1971 SIAM Review article [1] in
Section 11 (p. 566):

"Attempts have been made to obtain automatic error bounds on the
computer itself, by means of interval arithmetic and significant digit
arithmetic. It is not generally realized that A.M. Turing thought a
good deal about these modes of operation as early as 1946 and
considered a possibility of including appropriate hardware in the

In his 1970 Turing Lecture he was [2] more specific (p. 140): "While I
was preparing this talk an early Mathematics Division report was
unearthed. It was written by Turing in 1946 for the Executive
Committee of N.P.L. [...] It is perhaps salutary to be reminded that
as early as 1946 Turing had considered the possibility of working with
both interval and significant digit arithmetic ..."

Does anybody know of documents by Turing on interval or siginificant
digit arithmetic?

P.S.: The mentioned report might be Turing's 'Proposal for Development
in the Mathematics Division of an Automatic Computing Engine (ACE)',
however, I could not find something on error bounds in there.

[1] J.H. Wilkinson: Modern Error Analysis, SIAM Review, 13(4),
548-568, 1971.
[2] J.H. Wilkinson: , J. of the ACM, 18(2), 137-147, 1971.


From: Nick Sahinidis
Date: June 03, 2016
Subject: Call for nominations, ICS Prize

The INFORMS Computing Society (ICS) Prize is an annual award for the
best English language paper or group of related papers dealing with
the Operations Research/Computer Science interface. The award is
accompanied by a certificate and a $1,000 honorarium. The award will
be presented at the ICS Business Meeting that will take place during
the INFORMS Annual Meeting in Nashville November 13-16, 2016.

The goals of the prize are:
- To promote the development of high-quality work advancing the state
of the art in the operations research/computer science interface;
- To publicize and reward the contributions of those
authors/researchers who have advanced the state of the art; and
- To increase the visibility of excellent work in the field.

Conditions for eligibility:
- Published in the open literature;
- Pertinent to the interface of operations research and computer
- Written in English.

The nomination package should consist of a cover letter and a copy of
each nominated work. The cover letter should provide the title,
author's name, place and date of publication as well as a
justification for the nomination. Self-nominations are allowed but
discouraged. All nominations should be submitted electronically to by midnight EDT, July 15, 2016. All
submissions will be acknowledged by the committee chair.
Hard-to-reproduce works, such as books, may be submitted in hard copy
form to the mailing address below. In the case of hard copy
submission, three copies of each item in the nomination packet should
be submitted to the chair of the committee, and an e-mail indicating a
hard copy submission should be sent to .


From: Gregorio Quintana, for the HQRRP team
Date: June 02, 2016
Subject: Codes for Fast QR Factorization with Column Pivoting

Householder transformation based QR factorization with column pivoting
is an important algorithm for many problems and applications.
Recently, techniques that use randomized sampling have been developed
that do achieve high performance by casting most computation in terms
of matrix-matrix multiplication.

Two weeks ago we announced to NA Digest a fast C code to compute it
that can be easily linked to LAPACK. This week, we release the
implementation of this algorithm, which we call HQRRP, using the more
modern libflame library. The benefits of libflame is that it allows
the code to closely reflect how the algorithm is explained in our
paper, uses the somewhat more elegant UT transform for the application
of multiple Householder transformations, and exposes an alternative
object based interface. Rather than linking to LAPACK, the user links
to the libflame library (available from, which has full LAPACK
functionality and an LAPACK backward compatibility interface.

The new implementation is also faster than usual QR factorization with
column pivoting. It can be downloaded from


From: HERMANN, Martin
Date: June 02, 2016
Subject: New Book, Nonlinear ODEs. Analytical Approximation and Numerical Methods

Nonlinear Ordinary Differential Equations. Analytical Approximation
and Numerical Methods, Springer India 2016, 320 pages,
ISBN 978-81-322- 2810-3

The book discusses the solutions to nonlinear ordinary differential
equations (ODEs) using analytical and numerical approximation methods.
Recently, analytical approximation methods have been largely used in
solving linear and nonlinear lower-order ODEs. It also discusses using
these methods to solve some strong nonlinear ODEs. There are two
chapters devoted to solving nonlinear ODEs using numerical methods, as
in practice high-dimensional systems of nonlinear ODEs that cannot be
solved by analytical approximate methods are common. Moreover, it
studies analytical and numerical techniques for the treatment of
parameter-depending ODEs.

The book explains various methods for solving nonlinear-oscillator and
structural-system problems, including the energy balance method,
harmonic balance method, amplitude frequency formulation, variational
iteration method, homotopy perturbation method, iteration perturbation
method, homotopy analysis method, simple and multiple shooting method,
and the nonlinear stabilized march method. This book comprehensively
investigates various new analytical and numerical approximation
techniques that are used in solving nonlinear-oscillator and
structural- system problems.


From: Marco Prato
Date: June 02, 2016
Subject: Optimization Techniques for Inverse Problems, Italy, Sep 2016

Modena, Italy, September, 19-21, 2016

The format of the third edition of the workshop is made by a limited
number of extended talks held by international experts in numerical
optimization and inverse problems. The workshop aims at strengthening
the interaction between inverse problems and optimization, providing
space for exchanges of information and ideas from the two areas. Both
theoretical and applied aspects of optimization techniques will be
faced, with particular attention to related developments in specific
inverse problems as machine learning and signal and image restoration.

Speakers: Stefania Bellavia, Università di Firenze; Mario Bertero,
Università di Genova; Laure Blanc-Féraud, Université Nice Sophia
Antipolis; Silvia Bonettini, Università di Ferrara; Alessandro Chiuso,
Università di Padova; Christian Clason, Universität Duisburg-Essen;
Christine De Mol, Université Libre de Bruxelles; Daniela di Serafino,
Seconda Università di Napoli; Marco Donatelli, Università
dell'Insubria; Mário Figueiredo, Instituto Superior Técnico, Lisboa;
Roger Fletcher, University of Dundee; Dmitri Kvasov, Università della
Calabria; Germana Landi, Università di Bologna; Ignace Loris,
Université Libre de Bruxelles; Jean-Christophe Pesquet, Université
Paris-Est; Michele Piana, Università di Genova; Thomas Pock, Graz
University of Technology; Saverio Salzo, Istituto Italiano di

All the information about the workshop can be found at the website


From: Ilian Todorov
Date: June 02, 2016
Subject: Research Software Engineer Position, STFC, United Kingdom

Location: Warrington, United Kingdom
Salary: £29,900 to £43,164 depending on experience
Contract Type: Fixed Term (3 Years), Full Time
Application Closes: 19th June 2016
Interview Date: 5th July 2016 (TBC)
Job Reference: IRC224189

You will join the DL_POLY team at the Computational Chemistry Group,
part of the Scientific Computing Department. You will work with other
research software developers and a range of customers including
scientists, external visitors, engineers and administrative staff.

You need to love code, be versed in application mathematics and
statistical physics and have experience in computational modelling.
You need to be able to work with other members of the team to design
and craft solutions in a portable and sustainable manner with
supplementary user and technical documentation.

The ability to design, specify and implement complex algorithms in
software using high-level programming languages (e.g. Fortran and C)
is essential.

Experience of developing/enhancing models for particle-based
simulation methods and techniques such as reactive force-fields,
charge optimisation/polarisation/penetration, implicit solvation,
multiple time-stepping, direct Poison solvers is highly desirable.

You will have experience and expertise in the area of application
mathematics for chemistry, physics or materials. Apply at


From: Shaun Forth
Date: June 01, 2016
Subject: Research Fellow Position, Computational Modelling of Blast Waves

Cranfield University at the UK's Defence Academy has a vacancy for a
Research Fellow to assist in developing software for computational
modelling of blast waves arising from explosions and their loading on
buildings. The work is applied and focussed on providing tools for
damage assessments in safety engineering and the insurance sector.

Underlying flow solver is a Cartesian grid finite volume scheme using
MUSCL-Hancock time integration and AUSM-DV approximate Riemann solver.

Tasks may include work on a few of the following (depending on project
priorities, the experience of the appointee and their subsequent
development): improved input of street geometries; modelling of
explosive charge shape; improved equations of state and multicomponent
gases; modelling of explosive product afterburning; improving
performance, eg, parallelisation for distributed memory supercomputers
or GPUs; CFD algorithm improvements; improving data output.

Further details at


From: Shmuel Friedland
Date: May 31, 2016
Subject: Special Issue, Frontiers of Mathematics in China

An international journal: Frontiers of Mathematics in China

will publish a special issue on "Tensors: Theory, Computations and

All international researchers are welcome to contribute papers to this
special issue.

Guest Editors:
Shmuel Friedland (USA),
Liqun Qi (Hong Kong),
Yimin Wei,
Qingzhi Yang.

Deadline: 30, September, 2016.


From: Lars Elden
Date: June 02, 2016
Subject: Contents, BIT Numerical Mathematics, 56 (2)

BIT Numerical Mathematics. Volume 56 Number 2

Editorial Preface: "Advances in numerical algebra and scientific
computing", Zhong-Zhi Bai and Lothar Reichel

Rigorous convergence analysis of alternating variable minimization
with multiplier methods for quadratic programming problems with
equality constraints, Zhong-Zhi Bai and Min Tao

A simplified HSS preconditioner for generalized saddle point problems,
Yang Cao, Zhi-Ru Ren and Quan Shi

Analysis of a new dimension-wise splitting iteration with selective
relaxation for saddle point problems, Martin J. Gander, Qiang Niu and
Yingxiang Xu

Projected nonstationary iterated Tikhonov regularization, Guangxin
Huang, Lothar Reichel and Feng Yin

Spectrum analysis of a more general augmentation block preconditioner
for generalized saddle point matrices, Yi-Fen Ke and Chang-Feng Ma

A triple-parameter modified SSOR method for solving singular saddle
point problems, Jing Li and Nai-Min Zhang

Variants of the accelerated parameterized inexact Uzawa method for
saddle-point problems, Zhao-Zheng Liang and Guo-Feng Zhang

The generalized HSS method with a flexible shift-parameter for
non-Hermitian positive definite linear systems, Guo-Yan Meng, Rui-Ping
Wen and Qing-Shan Zhao

Accelerated SOR-like method for augmented linear systems, Patrick Njue
Njeru and Xue-Ping Guo

Computational fluid dynamics for nematic liquid crystals, Alison
Ramage and Andre M. Sonnet

A variant of the deteriorated PSS preconditioner for nonsymmetric
saddle point problems, Juli Zhang and Chuanqing Gu

Nonautonomous systems with transversal homoclinic structures under
discretization, Alina Girod and Thorsten Huls

Analysis and numerical solution of linear delay differential-algebraic
equations, Phi Ha and Volker Mehrmann

Monotone finite point method for non-equilibrium radiation diffusion
equations, Zhongyi Huang and Ye Li

Well-posedness, stability and conservation for a discontinuous
interface problem, Cristina La Cognata and Jan Nordstrom

The error norm of Clenshaw-Curtis and related quadrature formulae,
Sotirios E. Notaris

Simple floating-point filters for the two-dimensional orientation
problem, Katsuhisa Ozaki, Florian Bunger, Takeshi Ogita, Shin'ichi
Oishi and Siegfried M. Rump

Matrix-equation-based strategies for convection-diffusion equations,
Davide Palitta and Valeria Simoncini

Structural-algebraic regularization for coupled systems of DAEs, Lena
Scholz and Andreas Steinbrecher

End of Digest
if (! preg_match( "/\d+/", $volume ) && preg_match( "/\d+/", $issue ) ) { exit( 'Invalid parameters' ); }