NA Digest Sunday, June 22, 2014 Volume 14 : Issue 20

Today's Editor:
Daniel M. Dunlavy
Sandia National Labs

Submissions for NA Digest:


From: Des Higham
Date: June 19, 2014
Subject: OBE for Penny Davies

Congratulations to Penny Davies, University of Strathclyde, who has
been awarded the Order of the British Empire (OBE) in the recent
Queen's Birthday Honours List for her "services to mathematics"


From: Tim Davis
Date: June 18, 2014
Subject: Change of address for Tim Davis

After many fruitful years at the University of Florida, I am very
happy to announce that I have taken a position in the Computer Science
and Engineering Department at Texas A&M University. My new address

Tim Davis
Dept of Computer Science and Engineering
3112 TAMU
College Station TX 77843-3112
office: (979) 845-4094

My software repository is still hosted at the University of Florida,
as is the University of Florida Sparse Matrix Collection, at I will post an update when I
move the collection and my software to Texas A&M.

I'm also looking for a postdoc or two, funded by Texas A&M. The
position was posted earlier in the NA Digest: I've received
several excellent applications but I'm still considering additional
candidates. I'm looking for PhD students as well. The postdocs and
PhD students will be working with me in my lab here at Texas A&M,
recently designated by NVIDIA as a CUDA Research Center, in support of
my work in GPU / many-core algorithms.


From: Robert van de Geijn
Date: June 16, 2014
Subject: Notes for MOOC on Introductory Linear Algebra

During Spring 2014, we offered a Massive Open Online Course (MOOC)
titled "Linear Algebra: Foundations to Frontiers (LAFF)". With this
course, we attempt to appeal to computation oriented audiences by
linking abstractions in the mathematics (e.g., viewing matrices by
rows or columns) with abstractions in algorithms and implementations
(partitioning of arrays into rows, columns, and blocks). For the
NADigest audience, this can be described as "from the start, the
layering in the mathematics is linked to the layering in the BLAS and

We now make the materials that were created for this course available.
At the core is a 900 page document that includes homework with
detailed solutions, links to more than 250 short videos, and
programming activities in Python, using IPython Notebooks.

Given feedback from participants in the MOOC, we have concluded that
these materials are valuable to a broad audience that includes
beginning students who have not had a previous exposure to linear
algebra but also professionals with advanced degrees who want to
review the foundations of linear algebra. Beginning graduate students
can use the notes to learn how to think in terms of partitioned
matrices and how performance relates to architecture (an enhancement
activity in the course) in preparation for a graduate level course in
numerical linear algebra. Educators may wish to use the notes in a
"flipped classroom" setting.

For more information, visit


From: Klaus Iglberger
Date: June 20, 2014
Subject: Blaze 2.1 Released

After three month, just in time for ISC'14, version 2.1 of the Blaze
C++ math library has finally been released! The focus of this newest
release is the improvement and extension of the shared memory
parallelization capabilities. And this gives you some new exiting
features: In addition to the OpenMP parallelization, Blaze 2.1 now
also enables shared memory parallelization based on C++11 and Boost
threads. With that, shared memory parallel execution is now available
for virtually every platform and compiler. Additionally, the
underlying architecture for the parallel execution and automatic,
context-depending optimization has been significantly improved. This
not only improves the performance and determinism of the
parallelizations, but also for instance enables an efficient parallel
handling of computations involving block structured vectors and
matrices. Therefore Blaze 2.1 should prove to be the fastest and most
flexible Blaze release yet.


From: Nick Hale
Date: June 21, 2014
Subject: CHEBFUN Version 5 Release

We are pleased to announce the release of Chebfun Version 5, available
for download at

Version 5 has involved a complete rewrite of the code with a focus on
clarity to make it more accessible and extensible. The code is hosted
on GitHub (, and we welcome new developers
to get involved.

Chebfun is an open-source software system for numerical computing with
functions. The mathematical basis is piecewise polynomial
interpolation implemented with what we call “Chebyshev technology”.
The foundations are described, with Chebfun examples, in the book
Approximation Theory and Approximation Practice (L. N. Trefethen, SIAM
2013). Chebfun has extensive capabilities for dealing with linear and
nonlinear differential and integral operators, and also includes
continuous analogues of linear algebra notions like QR and singular
value decomposition. The Chebfun2 extension works with functions of
two variables defined on a rectangle in the x-y plane.

To get a sense of the breadth and power of Chebfun, a good place to
start is by looking at our Examples at
or the introductory Guide at

New features in V5 include:
- First official release of Chebfun2 for bivariate computing
- Powerful new bivariate rootfinding algorithms
- Major speedups of conv, polyfit, abs, inv, and pde15s
- O(nlogn) codes leg2cheb, cheb2leg for coefficient conversion
- Option for algorithms based on first kind Chebyshev points
- A Chebfun constructor option 'equi' for equispaced data
- A 'periodic' flag for Fourier interpolants instead of Chebyshev
- Ultraspherical spectral methods for ODEs
- Improved graphical interface (chebgui) for ODE capabilities

Please contact us with any questions/comments at


From: Joseph Young
Date: June 20, 2014
Subject: Release of Optizelle 1.1.2 for nonlinear optimization

Optizelle [op-tuh-zel] is an open source software library designed to
solve general purpose nonlinear optimization problems.

Optizelle features
- State of the art algorithms
- Unconstrained -- steepest descent, preconditioned
nonlinear-CG, BFGS, Newton-CG, SR1, trust-region Newton
(truncated-CG and truncated-MINRES), Barzilai-Borwein
two-point approximation
- Equality constrained -- inexact composite-step SQP
- Inequality constrained -- primal-dual interior point method
for cone constraints (linear, second-order cone, and
semidefinite), log-barrier method for cone constraints
- Constrained -- any combination of the above

- Open source
- Released under the 2-Clause BSD License
- Free and ready to use with both open and closed sourced codes

- Multilanguage support
- Interfaces to C++, MATLAB/Octave, and Python

- Robust computations and repeatability
- Can stop, archive, and restart the computation from any
optimization iteration

- User-defined parallelism
- Fully compatible with OpenMP, MPI, or GPUs


From: Martin Peters
Date: June 17, 2014
Subject: New Book Edition, Scientific Computing with MATLAB and Octave

The new (fourth) edition of TCSE 2 Quarteroni/Saleri/Gervasio -
Scientific Computing with MATLAB and Octave has now been
published - ISBN 978-3-642-45366-3.

For a description, see


From: Organizing Comittee
Date: June 16, 2014
Subject: Young Researchers in Pure & Applied Math, Brazil, Dec 2014

In Brazil, due to its continental dimensions with several universities
distant from major research centers, many new Ph.D. graduates join
these universities and end up distancing themselves from their
original research groups. This often hinders the development of their
research and, consequently, their ongoing professional career. For
this reason, young researchers decided to create an appropriate
framework to share research results, thus giving rise to 'I Brazilian
Congress of Young Researchers in Pure and Applied Mathematics'.

Thematic Sessions: Algebra, Functional Analysis, Numerical Analysis,
'Set Theory, Topology and Banach Spaces', Biomathematics, Partial
Differential Equations, Mathematical Physics, Geometry, Discrete
Mathematics, Probability and Statistics, Optimization, Operations
Research, Orthogonal Polynomials, Singularities and Foliations,
Dinamical Systems


Date: December, 10-12 2014

The event will take place at the Institute of Mathematics and
Statistics, University of Sao Paulo, Sao Paulo, Brazil.


From: Phan Thanh An
Date: June 18, 2014
Subject: High Performance Scientific Computing, Vietnam, Mar 2015

Modeling, Simulation and Optimization of Complex Processes
March 16-20, 2015, Hanoi, Vietnam

- mathematical modeling
- numerical simulation
- methods for optimization and control
- parallel computing: architectures, algorithms, tools and environments
- software development
- applications of scientific computing in
physics, mechanics, hydrology,
chemistry, biology, medicine,
transport, logistics, site location,
communication, scheduling,
industry, business, finance...

Proceedings: The conference proceedings with selected high-quality
contributions will be published by Springer.

Deadline for registration and submission of abstracts: September
29, 2014.
Notification of acceptance for presentation: December 22, 2014.
Deadline for applying a business visa through the organizers:
January 6, 2015.
Deadline for hotel reservation: January 6, 2015.

Conference web page:
Conference email address:


From: Kirsten Wilden
Date: June 18, 2014
Subject: SIAM Applications of Dynamical Systems (DS15), USA, May 2015

SIAM Conference on Applications of Dynamical Systems (DS15)
Snowbird Ski and Summer Resort, Snowbird, Utah, USA
May 17-21, 2015
Twitter hashtag: #SIAMDS15

Invited Speakers:
Andrea Bertozzi, University of California, Los Angeles, USA
Bard Ermentrout, University of Pittsburgh, USA
Jeff Gore, Massachusetts Institute of Technology, USA
Hod Lipson, Cornell University, USA
Jeff Moehlis, University of California, Santa Barbara, USA
Adilson E. Motter, Northwestern University, USA
Alan Perelson, Los Alamos National Laboratory, USA
Andrew Stuart, University of Warwick, United Kingdom

The Call for Presentations for this conference is available at:

October 20, 2014: Minisymposium proposals
November 17, 2014: Abstracts for minisymposia, contributed
lectures and poster submissions
November 3, 2014: SIAM Student Travel Award and Post-doc/Early
Career Travel Award Applications

For additional information, contact the SIAM Conference Department


From: Pamela Bye
Date: June 20, 2014
Subject: IMA Mathematics of Robotics, UK, Sep 2015

9 – 11 September 2015, St Anne’s College, University of Oxford

Areas of interest include, but are not limited to:
Topology. Kinematics. Algebraic topology of configuration spaces of
robot mechanisms. Topological aspects of path planning and sensor
networks. Differential topology and singularity theory of robot
mechanism and moduli spaces. Algebraic Geometry. Varieties generated
by linkages and constraints. Geometry of stiffness and inertia
matrices. Rigid-body motions. Computational approaches to algebraic
geometry. Dynamical Systems and Control. Dynamics of robots and
mechanisms. Simulation of multi-body systems, e.g. swarm
robots. Geometric control of robots. Optimal control and other
optimisation problems. Combinatorial and Stochastic Methods. Rigidity
of structures. Path planning algorithms. Modular robots.
Statistics. Stochastic control. Localisation. Navigation with
uncertainty. Statistical learning theory. Cognitive
Robotics. Mathematical aspects of Artificial Intelligence,
Developmental Robotics and other Neuroscience based approaches

Submission deadline: 15 March 2015
Notification of acceptance: 1 June 2015
Final version due: 1 August 2015
Conference Dates: 9 – 11 September 2015

Please visit the conference webpage for further information:


From: Klemens Fellner
Date: June 18, 2014
Subject: University Assistant Position, Inst of Math & Sci Comp

Institute of Mathematics and Scientific Computing is filling 2

University Assistant with doctorate
(40 hours a week; fixed-term employment for the period of 6 years;
Envisaged Job Starting Date 01 October 2014)

For more information follow the link:


From: Paul Constantine
Date: June 19, 2014
Subject: Postdoc Position, Sensitivity Analysis, MIT

Applications are invited for a postdoctoral position in MIT's
Aerospace Computational Design Laboratory and Center for Computational
Engineering. The successful candidate will join a project seeking to
apply emerging active subspace methods to large-scale, data-intensive
inverse problems arising in physical and engineering models. It is
sponsored by the Department of Energy's Advanced Scientific Computing
Research (ASCR) program.

Candidates should have (i) a PhD or equivalent in a computational
science-related field; (ii) an interest in methods for sensitivity
analysis, dimension reduction, computational statistics, and/or
data-intensive applications; and (iii) experience developing modern
and high-quality numerical software.

Please send applications to Prof. Qiqi Wang ( and
Prof. Youssef Marzouk ( Review of applications will
begin immediately.


From: Edward Hall
Date: June 20, 2014
Subject: PhD Position, Sci Comp, Power Generation, Uni Leicester

Applications are invited for a 3.5-year tax-free EPSRC CASE
studentship of ~£15850 p.a. in the College of Science and
Engineering. The studentship is available to UK Home students, with
some exceptions. Please check your eligibility at
before applying.

The project aims to advance on the current scientific computing
methods for power plant turbomachine design. It includes an
industrial placement in Rugby at ALSTOM UK LTD, a world-leader in
power plant construction. The successful applicant will join a team
of applied mathematicians and engineers.

Mathematically, such an advancement hinges on the novel use of a
posteriori error bounds for hyperbolic and/or convection-dominated
systems of partial differential equations. This project will extend
these cutting edge mathematical ideas to compressible and
incompressible flows and implement them in industrial software.

The project will begin on the 1st of October 2014 or as soon as
possible thereafter.

To apply for the post, please email a CV, evidence of academic
attainment, and contact details for 2 academic referees to Dr. E.H.
Georgoulis at Informal enquiries are welcome.


From: Weihua Geng
Date: June 20, 2014
Subject: MBMB Special Issue, Computational Structural Biology

The journal Molecular Based Mathematical Biology (MBMB) will publish a
special issue entitled “Computational structural biology: models,
methods and applications”. The purpose of this special issue is to
create a medium for researchers from mathematical and biological
sciences and other related disciplines to report novel mathematical
models, computational algorithms, and biological applications to the
structures study of macromolecules, such as DNA, RNA, and proteins.

Potential topics include, but are not limited to:
- Geometric and topological modeling of macromolecules
- Biomolecular solvation, explicit and implicit solvation models
- Protein folding, protein-protein interactions
- Brownian dynamics, molecular dynamics, and Monte Carlo modeling of
biomolecular systems
- Modeling and simulation of Ion-channels and membrane
- Electrostatics computing and applications, N-body problems
- Biomolecular simulations and software developments
- Multiscale modeling
- Mathematical methods for molecular imaging and visualization

Before submission authors should carefully read over the author
guidelines, which are located at
All manuscripts are subject to the standard peer review process before
publication. Please note the publisher has waived the Article
Processing Charges for this special issue, but articles will be
open-access in accordance with the overall goals of the
journal. Prospective authors should submit an electronic copy of their
manuscript via email to

Important Dates: Manuscript Due: September 1, 2014;
First Round of Reviews: October 15, 2014;
Anticipated Publication Date: December 31, 2014.


From: Axel Ruhe
Date: June 18, 2014
Subject: Contents, BIT Numerical Mathematics, 54 (2)

Volume 54 . Number 2 . June 2014

Preface to BIT 54:2, A. Ruhe 303

On the approximation of high-dimensional differential equations in the
hierarchical Tucker format, A. Arnold, T. Jahnke, 305

Accurate and efficient LDU decomposition of almost diagonally dominant
Z-matrices, A. Barreras, J.M. Peña, 343

Adaptive-order rational Arnoldi-type methods in computational
electromagnetism, A. Bodendiek, M. Bollhöfer, 357

A new approach for calculating the real stability radius, M.A.
Freitag, A. Spence, 381

Construction of scrambled polynomial lattice rules over F2 with small
mean squareweighted L2 discrepancy, T. Goda, 401

Optimal second order rectangular elasticity elements with weakly
symmetric stress, M. Juntunen, J. Lee, 425

Low-rank tensor completion by Riemannian optimization, D. Kressner,
M. Steinlechner, B. Vandereycken, 447

A finite element method for a biharmonic equation based on gradient
recovery operators, B.P. Lamichhane, 469

Optimal recovery of isotropic classes of rth differentiable
multivariate functions, B. Ling, Y. Liu, 485

A GCV based Arnoldi-Tikhonov regularization method, P. Novati,
M.R. Russo, 501

A new iterative algorithm for mean curvature-based variational image
denoising, L. Sun, K. Chen, 523

Higher order numerical methods for solving fractional differential
equations, Y. Yan, K. Pal, N.J. Ford, 555


From: Badih Ghusayni
Date: June 17, 2014
Subject: Contents, Intl J of Mathematics and Computer Science, 9 (1)

Contents of Vol. 9, no. 1, International Journal of Mathematics and
Computer Science (

1) J. O. Omolehin, I. Abdullahi, K. Rauf,P. L. Dickmu, Fibonacci
Scheme on Gradient Method for Some Control Problems.

2) Victor S. Adamchik, Contributions to the Theory of the Barnes

3) Badih Ghusayni, The completed zeta function and the Riemann

End of Digest