| Nama Pengarang | : | Daan Huybrechs, Lloyd N. Trefethen |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 4) |
| Nomor Halaman | : | 683-693 |
| Abstraksi Narasi | : | In this short, conceptual paper we observe that closely related mathematics applies in four contexts with disparate literatures: (1) sigmoidal and RBF approximation of smooth functions, (2) rational approximation of analytic functions with singularities, (3) ??-mesh refinement for solution of \pdes, and (4) double exponential (DE) and generalized Gauss quadrature. The relationships start from the change of variables ?=log?(?), and they suggest possibilities for new analyses and new methods in several areas. Concerning (2) and (3), we show that both problems feature the same effect of “linear tapering” near the singularity---of clustered poles in rational approximation and of polynomial orders in ??-mesh refinement. Concerning (4), we note that the tapering effect appears here too, and that the change of variables interpretation sheds new light on why the DE and generalized Gauss methods are effective at integrating arbitrary singularities. |
| Nama Pengarang | : | Stephen Coombes, Mustafa ?ayli, Rüdiger Thul, Rachel Nicks, Mason A. Porter, Yi Ming Lai |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 4) |
| Nomor Halaman | : | 619-679 |
| Abstraksi Narasi | : | There is enormous interest---both mathematically and in diverse applications---in understanding the dynamics of coupled-oscillator networks. The real-world motivation of such networks arises from studies of the brain, the heart, ecology, and more. It is common to describe the rich emergent behavior in these systems in terms of complex patterns of network activity that reflect both the connectivity and the nonlinear dynamics of the network components. Such behavior is often organized around phase-locked periodic states and their instabilities. However, the explicit calculation of periodic orbits in nonlinear systems (even in low dimensions) is notoriously hard, so network-level insights often require the numerical construction of some underlying periodic component. In this paper, we review powerful techniques for studying coupled-oscillator networks. We discuss phase reductions, phase--amplitude reductions, and the master stability function for smooth dynamical systems. We then focus, in particular, on the augmentation of these methods to analyze piecewise-linear systems, for which one can readily construct periodic orbits. This yields useful insights into network behavior, but the cost is that one needs to study nonsmooth dynamical systems. The study of nonsmooth systems is well developed when focusing on the interacting units (i.e., at the node level) of a system, and we give a detailed presentation of how to use saltation operators, which can treat the propagation of perturbations through switching manifolds, to understand dynamics and bifurcations at the network level. We illustrate this merger of tools and techniques from network science and nonsmooth dynamical systems with applications to neural systems, cardiac systems, networks of electromechanical oscillators, and cooperation in cattle herds. |
| Nama Pengarang | : | Thomas Nagel, Tymofiy Gerasimov, Jere Remes, Dominik Kern |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 67 (No. 1) |
| Nomor Halaman | : | 176-193 |
| Abstraksi Narasi | : | This paper is intended to serve as a low-hurdle introduction to nonlocality for graduate students and researchers with an engineering mechanics or physics background who did not have a formal introduction to the underlying mathematical basis. We depart from simple examples motivated by structural mechanics to form a physical intuition and demonstrate nonlocality using concepts familiar to most engineers. We then show how concepts of nonlocality are at the core of one of the most active current research fields in applied mechanics, namely, in phase-field modeling of fracture. From a mathematical perspective, these developments rest on the concept of convolution in both its discrete and its continuous forms. The previous mechanical examples may thus serve as an intuitive explanation of what convolution implies from a physical perspective. In the supplementary material we highlight a broader range of applications of the concepts of nonlocality and convolution in other branches of science and engineering by generalizing from the examples explained in detail in the main body of the article. |
| Nama Pengarang | : | Rachel E. Scherr |
| Nama Majalah/Jurnal | : | The Physics Teacher |
| Volume / Nomor Edisi | : | 61 (No. 6) |
| Nomor Halaman | : | 428–431 |
| Abstraksi Narasi | : | One way for science teaching to have significance beyond the classroom is for science education to be in the service of community organizing and ethical decision-making.1–3 Power plants have tremendous social significance both locally and globally. In what follows, we will consider the energy dynamics of two electrical power production facilities: (1) the largest coal-fired electrical power production facility in the United States and (2) one of the facilities that provides significant electrical power to the authors. Rather than analyzing power plants apart from their material and social context, we suggest an analysis that includes the relationships between the power plant and the surrounding human, plant, and animal communities, as well as lands, waters, and air. Our intent is to model an approach to energy learning that begins to prepare students to engage in ethical decision-making about energy resources. |
| Nama Pengarang | : | Nicholas S. Moore, Eric C. Cyr, Peter Ohm, Christopher M. Siefert, Raymond S. Tuminaro |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 67 (No. 1) |
| Nomor Halaman | : | 141-175 |
| Abstraksi Narasi | : | Sparse matrix computations are ubiquitous in scientific computing. Given the recent interest in scientific machine learning, it is natural to ask how sparse matrix computations can leverage neural networks (NNs). Unfortunately, multilayer perceptron (MLP) NNs are typically not natural for either graph or sparse matrix computations. The issue lies with the fact that MLPs require fixed-sized inputs, while scientific applications generally generate sparse matrices with arbitrary dimensions and a wide range of different nonzero patterns (or matrix graph vertex interconnections). While convolutional NNs could possibly address matrix graphs where all vertices have the same number of nearest neighbors, a more general approach is needed for arbitrary sparse matrices, e.g., those arising from discretized partial differential equations on unstructured meshes. Graph neural networks (GNNs) are one such approach suitable to sparse matrices. The key idea is to define aggregation functions (e.g., summations) that operate on variable-size input data to produce data of a fixed output size so that MLPs can be applied. The goal of this paper is to provide an introduction to GNNs for a numerical linear algebra audience. Concrete GNN examples are provided to illustrate how many common linear algebra tasks can be accomplished using GNNs. We focus on iterative and multigrid methods that employ computational kernels such as matrix-vector products, interpolation, relaxation methods, and strength-of-connection measures. Our GNN examples include cases where parameters are determined a priori as well as cases where parameters must be learned. The intent of this paper is to help computational scientists understand how GNNs can be used to adapt machine learning concepts to computational tasks associated with sparse matrices. It is hoped that this understanding will further stimulate data-driven extensions of classical sparse linear algebra tasks. |
| Nama Pengarang | : | Tyrus Berry, Suddhasattwa Das |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 67 (No. 1) |
| Nomor Halaman | : | 107-137 |
| Abstraksi Narasi | : | A dynamical system is a transformation of a phase space, and the transformation law is the primary means of defining as well as identifying the dynamical system and is the object of focus of many learning techniques. However, there are many secondary aspects of dynamical systems—invariant sets, the Koopman operator, and Markov approximations—that provide alternative objectives for learning techniques. Crucially, while many learning methods are focused on the transformation law, we find that forecast performance can depend on how well these other aspects of the dynamics are approximated. These different facets of a dynamical system correspond to objects in completely different spaces—namely, interpolation spaces, compact Hausdorff sets, unitary operators, and Markov operators, respectively. Thus, learning techniques targeting any of these four facets perform different kinds of approximations. We examine whether an approximation of any one of these aspects of the dynamics could lead to an approximation of another facet. Many connections and obstructions are brought to light in this analysis. Special focus is placed on methods of learning the primary feature—the dynamics law itself. The main question considered is the connection between learning this law and reconstructing the Koopman operator and the invariant set. The answers are tied to the ergodic and topological properties of the dynamics, and they reveal how these properties determine the limits of forecasting techniques. |
| Nama Pengarang | : | Nina M. Gottschling, Vegard Antun, Anders C. Hansen, Ben Adcock |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 67 (No. 1) |
| Nomor Halaman | : | 73-104 |
| Abstraksi Narasi | : | Methods inspired by artificial intelligence (AI) are starting to fundamentally change computational science and engineering through breakthrough performance on challenging problems. However, the reliability and trustworthiness of such techniques is a major concern. In inverse problems in imaging, the focus of this paper, there is increasing empirical evidence that methods may suffer from hallucinations, i.e., false, but realistic-looking artifacts; instability, i.e., sensitivity to perturbations in the data; and unpredictable generalization, i.e., excellent performance on some images, but significant deterioration on others. This paper provides a theoretical foundation for these phenomena. We give mathematical explanations for how and when such effects arise in arbitrary reconstruction methods, with several of our results taking the form of “no free lunch” theorems. Specifically, we show that (i) methods that overperform on a single image can wrongly transfer details from one image to another, creating a hallucination; (ii) methods that overperform on two or more images can hallucinate or be unstable; (iii) optimizing the accuracy-stability tradeoff is generally difficult; (iv) hallucinations and instabilities, if they occur, are not rare events and may be encouraged by standard training; and (v) it may be impossible to construct optimal reconstruction maps for certain problems. Our results trace these effects to the kernel of the forward operator whenever it is nontrivial, but also apply to the case when the forward operator is ill-conditioned. Based on these insights, our work aims to spur research into new ways to develop robust and reliable AI-based methods for inverse problems in imaging. |
| Nama Pengarang | : | Johannes O. Royset |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 67 (No. 1) |
| Nomor Halaman | : | 3-70 |
| Abstraksi Narasi | : | Uncertainty is prevalent in engineering design and data-driven problems and, more broadly, in decision making. Due to inherent risk-averseness and ambiguity about assumptions, it is common to address uncertainty by formulating and solving conservative optimization models expressed using measures of risk and related concepts. We survey the rapid development of risk measures over the last quarter century. From their beginning in financial engineering, we recount their spread to nearly all areas of engineering and applied mathematics. Solidly rooted in convex analysis, risk measures furnish a general framework for handling uncertainty with significant computational and theoretical advantages. We describe the key facts, list several concrete algorithms, and provide an extensive list of references for further reading. The survey recalls connections with utility theory and distributionally robust optimization, points to emerging applications areas such as fair machine learning, and defines measures of reliability. |
| Nama Pengarang | : | Grace D Agostino, Hermann J. Eberl |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 67 (No. 2) |
| Nomor Halaman | : | 375-398 |
| Abstraksi Narasi | : | We present and discuss the Streeter–Phelps equations, which were the first river quality model. If the parameters are constants, then the model in its linear formulation can be solved explicitly. This reveals, however, that depending on parameters and initial data, the model might predict negative oxygen concentrations, which marks a breakdown of the model. To address this shortcoming, we introduce a nonlinear modification which, in the case of constant parameters, we can study in the phase plane. In real-world applications, parameters are never constant and are usually known not exactly, but instead with some uncertainty. We show how we can use the solutions for the constant parameter case to obtain estimates for the unknown solutions from estimates of the model parameters, using differential inequalities. |
| Nama Pengarang | : | C. Falco, R. E. Baker, J. A. Carrillo |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 67 (No. 2) |
| Nomor Halaman | : | 353-372 |
| Abstraksi Narasi | : | Over the past few decades, nonlocal models have been widely used to describe aggregation phenomena in biology, physics, engineering, and the social sciences. These are often derived as mean-field limits of attraction-repulsion agent-based models and consist of systems of nonlocal partial differential equations. Using differential adhesion between cells as a biological case study, we introduce a novel local model of aggregation-diffusion phenomena. This system of local aggregation-diffusion equations is fourth-order, resembling thin-film or Cahn–Hilliard type equations. In this framework, cell sorting phenomena are explained through relative surface tensions between distinct cell types. The local model emerges as a limiting case of short-range interactions, providing a significant simplification of earlier nonlocal models while preserving the same phenomenology. This simplification makes the model easier to implement numerically and more amenable to calibration to quantitative data. In addition, we discuss recent analytical results based on the gradient flow structure of the model, along with open problems and future research directions. |