|
Acta Numerica
Journal Prestige (SJR): 6.709  Citation Impact (citeScore): 10 Number of Followers: 5  Hybrid journal (It can contain Open Access articles)ISSN (Print) 0962-4929 - ISSN (Online) 1474-0508 Published by Cambridge University Press  [387 journals]
|
- ANU volume 28 Cover and Front matter
- PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000072
Issue No: Vol. 28 (2019)
- PubDate: 2019-05-01T00:00:00.000Z
- ANU volume 28 Cover and Back matter
- PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000084
Issue No: Vol. 28 (2019)
- PubDate: 2019-05-01T00:00:00.000Z
- Solving inverse problems using data-driven models
- Authors: Simon Arridge; Peter Maass, Ozan Öktem, Carola-Bibiane Schönlieb
Pages: 1 - 174
Abstract: Recent research in inverse problems seeks to develop a mathematically coherent foundation for combining data-driven models, and in particular those based on deep learning, with domain-specific knowledge contained in physical–analytical models. The focus is on solving ill-posed inverse problems that are at the core of many challenging applications in the natural sciences, medicine and life sciences, as well as in engineering and industrial applications. This survey paper aims to give an account of some of the main contributions in data-driven inverse problems.
PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000059
Issue No: Vol. 28 (2019)
- Authors: Simon Arridge; Peter Maass, Ozan Öktem, Carola-Bibiane Schönlieb
- Numerical analysis of hemivariational inequalities in contact mechanics
- Authors: Weimin Han; Mircea Sofonea
Pages: 175 - 286
Abstract: Contact phenomena arise in a variety of industrial process and engineering applications. For this reason, contact mechanics has attracted substantial attention from research communities. Mathematical problems from contact mechanics have been studied extensively for over half a century. Effort was initially focused on variational inequality formulations, and in the past ten years considerable effort has been devoted to contact problems in the form of hemivariational inequalities. This article surveys recent development in studies of hemivariational inequalities arising in contact mechanics. We focus on contact problems with elastic and viscoelastic materials, in the framework of linearized strain theory, with a particular emphasis on their numerical analysis. We begin by introducing three representative mathematical models which describe the contact between a deformable body in contact with a foundation, in static, history-dependent and dynamic cases. In weak formulations, the models we consider lead to various forms of hemivariational inequalities in which the unknown is either the displacement or the velocity field. Based on these examples, we introduce and study three abstract hemivariational inequalities for which we present existence and uniqueness results, together with convergence analysis and error estimates for numerical solutions. The results on the abstract hemivariational inequalities are general and can be applied to the study of a variety of problems in contact mechanics; in particular, they are applied to the three representative mathematical models. We present numerical simulation results giving numerical evidence on the theoretically predicted optimal convergence order; we also provide mechanical interpretations of simulation results.
PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000023
Issue No: Vol. 28 (2019)
- Authors: Weimin Han; Mircea Sofonea
- Derivative-free optimization methods
- Authors: Jeffrey Larson; Matt Menickelly, Stefan M. Wild
Pages: 287 - 404
Abstract: In many optimization problems arising from scientific, engineering and artificial intelligence applications, objective and constraint functions are available only as the output of a black-box or simulation oracle that does not provide derivative information. Such settings necessitate the use of methods for derivative-free, or zeroth-order, optimization. We provide a review and perspectives on developments in these methods, with an emphasis on highlighting recent developments and on unifying treatment of such problems in the non-linear optimization and machine learning literature. We categorize methods based on assumed properties of the black-box functions, as well as features of the methods. We first overview the primary setting of deterministic methods applied to unconstrained, non-convex optimization problems where the objective function is defined by a deterministic black-box oracle. We then discuss developments in randomized methods, methods that assume some additional structure about the objective (including convexity, separability and general non-smooth compositions), methods for problems where the output of the black-box oracle is stochastic, and methods for handling different types of constraints.
PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000060
Issue No: Vol. 28 (2019)
- Authors: Jeffrey Larson; Matt Menickelly, Stefan M. Wild
- Numerical methods for Kohn–Sham density functional theory
- Authors: Lin Lin; Jianfeng Lu, Lexing Ying
Pages: 405 - 539
Abstract: Kohn–Sham density functional theory (DFT) is the most widely used electronic structure theory. Despite significant progress in the past few decades, the numerical solution of Kohn–Sham DFT problems remains challenging, especially for large-scale systems. In this paper we review the basics as well as state-of-the-art numerical methods, and focus on the unique numerical challenges of DFT.
PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000047
Issue No: Vol. 28 (2019)
- Authors: Lin Lin; Jianfeng Lu, Lexing Ying
- Approximation algorithms in combinatorial scientific computing
- Authors: Alex Pothen; S. M. Ferdous, Fredrik Manne
Pages: 541 - 633
Abstract: We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of cardinality matching, edge-weighted matching, vertex-weighted matching and edge-weighted
$b$ -matching, and minimization versions of weighted edge cover and 
$b$ -edge cover. Exact algorithms for these problems are impractical for massive graphs with several millions of edges. For each problem we discuss theoretical foundations, the design of several linear or near-linear time approximation algorithms, their implementations on serial and parallel computers, and applications. Our focus is on practical algorithms that yield good performance on modern computer architectures with multiple threads and interconnected processors. We also include information about the software available for these problems.
PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000035
Issue No: Vol. 28 (2019)
- Authors: Alex Pothen; S. M. Ferdous, Fredrik Manne
- Data assimilation: The Schrödinger perspective
- Authors: Sebastian Reich
Pages: 635 - 711
Abstract: Data assimilation addresses the general problem of how to combine model-based predictions with partial and noisy observations of the process in an optimal manner. This survey focuses on sequential data assimilation techniques using probabilistic particle-based algorithms. In addition to surveying recent developments for discrete- and continuous-time data assimilation, both in terms of mathematical foundations and algorithmic implementations, we also provide a unifying framework from the perspective of coupling of measures, and Schrödinger’s boundary value problem for stochastic processes in particular.
PubDate: 2019-05-01T00:00:00.000Z
DOI: 10.1017/S0962492919000011
Issue No: Vol. 28 (2019)
- Authors: Sebastian Reich
