[External Email]

Subject: NA Digest, V. 20, # 31

NA Digest  Sunday, August 16, 2020  Volume 20 : Issue 31

Today's Editor:

        Daniel M. Dunlavy
        Sandia National Labs
        [log in to unmask]

Today's Topics:

        Release 1.2.0.9, librsb, Sparse BLAS Software Library
        SN Partial Differential Equations and Applications, ONLINE, Aug 2020
        Communications in NLA Seminar Series, ONLINE, Sep 2020
        Linear Algebraist Position, Ansys, Livermore, CA
        Postdoc Position, Analysis and numerical solution of PDEs
        Postdoc Position, Isogeometric Reduced Order Methods, EPFL
        Postdoc Position, NA and Scientific Computing, SISSA, Italy
        Postdoc Position, Uncertainty Quantification, Univ of Liverpool
        Contents, Numerical Algorithms, 85 (1)

Subscribe, unsubscribe, change address, or for na-digest archives:
        http://www.netlib.org/na-digest-html/faq.html

Submissions for NA Digest:
        http://icl.utk.edu/na-digest/

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

From: Michele Martone [log in to unmask]
Date: August 12, 2020
Subject: Release 1.2.0.9, librsb, Sparse BLAS Software Library

Version 1.2.0.9 of the "librsb" library for high performance sparse
matrix computations based on the "Recursive Sparse Blocks" (RSB)
format is out and available for download.

librsb is mainly for iterative methods implementors; it features cache
efficient, multithreaded sparse matrix-vector multiplication, and it
is especially fast in the symmetric and transposed variants.  Many
options and further matrix operations are available.

Both Sparse BLAS and the own interfaces are supported (C/C++,
Fortran).  You can also use librsb transparently in a Matlab-style
fashion via the GNU Octave `sparsersb` package and command.

This is a bugfixes release; see detailed changes in the NEWS file.
The source code of librsb is LGPLv3 licensed.

Website for librsb and sparsersb: http://librsb.sf.net/


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

From: Jan Holland [log in to unmask]
Date: August 14, 2020
Subject: SN Partial Differential Equations and Applications, ONLINE, Aug 2020

We're excited to launch the "SN Partial Differential Equations and
Applications" Webinar on August 24!

With this Webinar, our goal is to contribute an initiative to foster
the communication of PDE- related research during these trying
times. Just as the journal of the same name, the SN PDEA Webinar is
aiming to bridge the areas of Mathematical Analysis, Computational
Mathematics and applications of Mathematics in the Sciences.

The first presentation will be given by this year's Felix Klein Prize
winner, Arnulf Jentzen, on applications of Deep Learning methods to
the solution of PDEs. Future speakers include Julio Rossi, Thomas
Bartsch, Weinan E, and Claudio Munoz.

Starting on August 24, Webinars will take place on Mondays on a weekly
basis at 9am EST, 3pm CET. They will be held via Zoom and will be free
to attend.

Registration for the first presentation is now open at
https://zoom.us/meeting/register/tJ0uf-iopzkvGdJJpq42h5f7wOqUcKtCc7y7

More information and updates on the Webinar can be found at
https://www.springer.com/journal/42985/updates/18235540 .


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

From: Communications in NLA [log in to unmask]
Date: August 11, 2020
Subject: Communications in NLA Seminar Series, ONLINE, Sep 2020

A new online seminar series on Numerical Linear Algebra, entitled
"Communications in NLA", will take place every Monday at 15:00 CEST,
starting from September 7, 2020. Each session will consist of 2-3
talks on different topics in Numerical Linear Algebra and will be
broadcast live via Zoom and YouTube.

Special emphasis will be on giving early career researchers the
opportunity to present their work, and we are very pleased to announce
the 2020 Householder Prize winners, Estelle Massart (University of
Oxford) and Stefano Massei (Eindhoven University of Technology) as the
speakers of our first session. Each session will also feature an
extended discussion session organized on Gather.

If you want to register as a listener or apply as a speaker, please
visit our website https://sites.google.com/view/commnla/home .

We are looking forward to welcoming you at our seminar!

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

From: Aubrey Allen [log in to unmask]
Date: August 10, 2020
Subject: Linear Algebraist Position, Ansys, Livermore, CA

Ansys is the global leader in engineering simulation, helping the
world's most innovative companies deliver radically better products to
their customers. ANSYS LST is searching for a qualified candidate to
join their team of Linear Algebraists. This team works to solve linear
algebra problems arising in a broad spectrum of application problems
involving direct and iterative solution of linear systems for sparse
and dense problems and associated eigenvalue problems. The R&D
Engineer (II) works most directly with LS-Dyna and MAPDL products, but
may also branch out into other applications in the Mechanical and
Electronic business units.

A successful candidate needs to have demonstrated the ability to work
in a variety of linear algebra areas and will be expected to
communicate with the application specialists often.

Minimum Qualifications:
- Masters degree in Linear Algebra with 5 or more years of experience
- Excellent communication skills so as to communicate with a
  geographically dispersed team
- Experience applying linear algebra technology to engineering
  application problems
- Demonstrated skills to use existing linear algebra software tools and
  the ability to enhance those tools
- Software skills in Fortran and/or C to develop new tools as required
  especially in the distributed memory parallel computing environment

Preferred Qualifications: PhD specializing in Linear Algebra and 3
years or more of experience

Please apply here:
https://careers.ansys.com/job/Livermore-R&D-Engineer-II-CA-94551/664060000/

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

From: Buyang Li [log in to unmask]
Date: August 13, 2020
Subject: Postdoc Position, Analysis and numerical solution of PDEs

A postdoc position is available at Department of Applied Mathematics,
The Hong Kong Polytechnic University. The appointment period can be
one or two years, with the possibility of extension. The start date is
negotiable.  The applicant must hold a PhD degree by the start date.

We are looking for candidates with a strong background in theoretical
analysis or numerical analysis of PDEs. Applicants who have worked on
one of the following topics are welcome to apply:

1. Well-posedness and regularity analysis of time-dependent nonlinear
PDEs (such as Navier-Stokes equations, nonlinear Schrodinger equation,
nonlinear wave equation, shallow or deep water equations, and so on).

2. Numerical analysis for time-dependent nonlinear PDEs;

3. Surface PDEs, surface evolution, curvature flow, evolution of free
boundary, evolution of interface between two phases, or related
topics;

To apply, send a CV to Dr. Buyang Li via email: [log in to unmask] The
CV should contain a publication list and the names of two references.


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

From: Pablo Antolin [log in to unmask]
Date: August 12, 2020
Subject: Postdoc Position, Isogeometric Reduced Order Methods, EPFL

In the framework of an exciting industrial grant between the Chair of
Numerical Modelling and Simulation (MNS) at EPFL (Switzerland), led by
Annalisa Buffa, and the company Akselos, we are looking for a
postdoctoral computational scientist/applied mathematician to work at
EPFL on R&D problems that are relevant to Akselos customers.

Akselos is an MIT spin-off that is providing a revolutionary new
reduced order modeling approach for large-scale engineering
simulations. Akselos has five main offices around the world with
headquarters located on the EPFL campus.

Job description: The component-based reduced basis technology combines
the strengths of domain decomposition and model reduction techniques
in order to reach unprecedented simulation speed (around 1000 times
faster than traditional finite element methods). The successful
candidate will join a 2 year project focused on extending the current
technology in the context of IsoGeometric Analysis applied to
large-scale wind turbine applications.

The prospective Postdoc should have: a PhD degree from a recognised
university either in mathematics, mechanical engineering or related
disciplines; a strong background in scientific computing with
C++. Experience with open source C++ FEA or CFD libraries is a plus
(e.g. libMesh, Deal.II, DUNE, OpenFOAM, PETSc, etc) will be a plus;
creativity and motivation for addressing computational mechanics
problems; excellent English language skills; and experience with
IsoGeometric Analysis and/or model reduction techniques are a plus.

We offer: a one year contract, with possible extension to a second
year; a young and dynamic work environment at one of the top
universities in Europe and of a fast developing company; and a very
competitive salary.

Information & contact: The position is open starting anytime after
November 1st, and applications are welcome until the position will be
filled. To submit your application, please write to
[log in to unmask] and [log in to unmask] sending your CV,
your relevant publications, your graduate transcript(s), a letter of
motivation, and two names for references.

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

From: Gianluigi Rozza [log in to unmask]
Date: August 15, 2020
Subject: Postdoc Position, NA and Scientific Computing, SISSA, Italy

One new open position as research associate at SISSA, International
School for Advanced Studies, Mathematics Area, mathLab, Trieste, Italy
(mathlab.sissa.it) is available with deadline on September 11, 2020 by
1PM (Rome time): info to apply:
https://www.sissa.it/bandi/selezione-pubblica-titoli-conferimento-di-n-1-assegno-di-
ricerca-area-matematica-ref-prof-6

The position is in the framework of European Research Council H2020
Project AROMA-CFD: Advanced Reduced Order Methods with Applications in
Computational Fluid Dynamics, GA 681447, PI Prof.  Gianluigi Rozza
(people.sissa.it/grozza).  Topics at large: computational fluid
dynamics, fluid-structure interactions, multi-physics, optimisation,
control, reduced order methods, data assimilation, uncertainty
quantification, computational mechanics, scientific computing,
programming, offline-online computing, automatic learning, with a
special focus on the creation of new computing technologies.
Competences: scientific computing and programming, numerical analysis,
CFD; Further appreciated competences: data science, computer science,
HPC, automatic learning.

First availability to start: ASAP

Duration: one year (extension is possible)

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

From: Marco De Angelis [log in to unmask]
Date: August 11, 2020
Subject: Postdoc Position, Uncertainty Quantification, Univ of Liverpool

The project will develop strategies that work efficiently and scalably
with aleatory, epistemic, and mixed uncertainties. You should have
programming experience, a strong quantitative background, and a PhD in
Engineering, Mathematics, Computer Science, or a quantitative science.
Just a couple of days left to apply. If you are interested, use the link:

https://my.corehr.com/pls/ulivrecruit/erq_jobspec_details_form.jobspec?p_id=020270

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

From: Claude Brezinski [log in to unmask]
Date: August 12, 2020
Subject: Contents, Numerical Algorithms, 85 (1)

Table of Contents
Numerical Algorithms, Vol. 85, No. 1

A class of modified modulus-based synchronous multisplitting iteration
methods for linear complementarity problems, Weiwei Xu, Lei Zhu,
Xiaofei Peng, Hao Liu, Junfeng Yin.

Numerical methods for the two-dimensional Fokker-Planck equation
governing the probability density function of the tempered fractional
Brownian motion, Xing Liu, Weihua Deng.

A time two-grid algorithm based on finite difference method for the
two-dimensional nonlinear time-fractional mobile/immobile transport
model, Wenlin Qiu, Da Xu, Jing Guo, Jun Zhou.

A full-Newton step infeasible interior-point method based on a
trigonometric kernel function without centering steps, Behrouz
Kheirfam, Masoumeh Haghighi.

An efficient method for computing the outer inverse through
Gauss-Jordan elimination, Jie Ma, Feng Gao, Yongshu Li.

Efficient modified stabilized invariant energy quadratization
approaches for phase-field crystal equation, Zhengguang Liu, Xiaoli
Li.

Regions of convergence and dynamics of Schroeder-like iteration
formulae as applied to complex polynomial equations with multiple
roots, Tomohiro Suzuki, Hiroshi Sugiura, Takemitsu Hasegawa.

Double descent and intermittent color diffusion for landscape
exploration, Luca Dieci, Manuela Manetta, Haomin Zhou.

Richardson extrapolation for the discrete iterated modified projection
solution, Rekha P. Kulkarni, Gobinda Rakshit.

Estimates for the differences of positive linear operators and their
derivatives, Ana-Maria Acu, Ioan Rasa.

An optimal error bound for a finite element approximation of spatially
extended predator-prey interaction model, Ahmed A. Al Ghafli, Hassan
J. Al Salman.

A comparison of methods for traversing regions of non-convexity in
optimization problems, Michael Bartholomew-Biggs, Salah Beddiaf, Bruce
Christianson.

An iterated quasi-interpolation approach for derivative approximation,
Zhengjie Sun, Zongmin Wu, Wenwu Gao.

On convergence of continuous half-explicit Runge-Kutta methods for a
class of delay differential-algebraic equations, Vu Hoang Linh, Nguyen
Duy Truong.

Numerical approximation for a class of singularly perturbed delay
differential equations with boundary and interior layer(s), Pratima
Rai, Kapil K. Sharma.

Accurate computations for eigenvalues of products of
Cauchy-polynomial-Vandermonde matrices, Zhao Yang, Rong Huang, Wei
Zhu.

On perturbed hybrid steepest descent method with minimization or
superiorization for subdifferentiable functions, Mohsen Hoseini,
Shahram Saeidi, Do Sang Kim.


-------------------------------------------------------
End of Digest
**************************