| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 46 (No. 2) |
| Nomor Halaman | : | 202-229 |
| Abstraksi Narasi | : | The current paper surveys and develops numerical methods for Markovian multitype branching processes in continuous time. Particular attention is paid to the calculation of means, variances, extinction probabilities, and marginal distributions in the presence of a Poisson stream of immigrant particles. The Poisson process assumption allows for temporally complex patterns of immigration and facilitates application of marked Poisson processes and Campbell's formulas. The methods and formulas derived are applied to four models: two population genetics models, a model for vaccination against an infectious disease in a community of households, and a model for the growth of resistant HIV virus in patients undergoing drug therapy. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 46 (No. 2) |
| Nomor Halaman | : | 189-201 |
| Abstraksi Narasi | : | In this paper, we present an application of a linear complementarity problem where M is a P-matrix but, in general, is neither an H-matrix nor a positive definite matrix. This application occurs originally in [J. Rohn, Linear Algebra Appl., 126 (1989), pp. 39--78], which is less known to the LCP community. Its focus is in computing the exact interval enclosures of the components of the solution set of an interval linear system. We extend the idea such that the calculations can be done by a computer with rigorous error control. |
| Nama Pengarang | : | Emily Ribando-Gros, Rui Wang, Jiahui Chen, Yiying Tong, Guo-Wei Wei |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 3) |
| Nomor Halaman | : | 575-601 |
| Abstraksi Narasi | : | As key subjects in spectral geometry and combinatorial graph theory, respectively, the (continuous) Hodge Laplacian and the combinatorial Laplacian share similarities in revealing the topological dimension and geometric shape of data and in their realization of diffusion and minimization of harmonic measures. It is believed that they also both associate with vector calculus, through the gradient, curl, and divergence, as argued in the popular usage of “Hodge Laplacians on graphs” in the literature. Nevertheless, these Laplacians are intrinsically different in their domains of definitions and applicability to specific data formats, hindering any in-depth comparison of the two approaches. For example, the spectral decomposition of a vector field on a simple point cloud using combinatorial Laplacians defined on some commonly used simplicial complexes does not give rise to the same curl-free and divergence-free components that one would obtain from the spectral decomposition of a vector field using either the continuous Hodge Laplacians defined on differential forms in manifolds or the discretized Hodge Laplacians defined on a point cloud with boundary in the Eulerian representation or on a regular mesh in the Eulerian representation. To facilitate the comparison and bridge the gap between the combinatorial Laplacian and Hodge Laplacian for the discretization of continuous manifolds with boundary, we further introduce boundary-induced graph (BIG) Laplacians using tools from discrete exterior calculus (DEC). BIG Laplacians are defined on discrete domains with appropriate boundary conditions to characterize the topology and shape of data. The similarities and differences among the combinatorial Laplacian, BIG Laplacian, and Hodge Laplacian are then examined. Through an Eulerian representation of 3D domains as level-set functions on regular grids, we show experimentally the conditions for the convergence of BIG Laplacian eigenvalues to those of the Hodge Laplacian for elementary shapes. |
| Nama Pengarang | : | Nicholas H. Nelsen, Andrew M. Stuart |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 3) |
| Nomor Halaman | : | 535-571 |
| Abstraksi Narasi | : | Supervised operator learning centers on the use of training data, in the form of input-output pairs, to estimate maps between infinite-dimensional spaces. It is emerging as a powerful tool to complement traditional scientific computing, which may often be framed in terms of operators mapping between spaces of functions. Building on the classical random features methodology for scalar regression, this paper introduces the function-valued random features method. This leads to a supervised operator learning architecture that is practical for nonlinear problems yet is structured enough to facilitate efficient training through the optimization of a convex, quadratic cost. Due to the quadratic structure, the trained model is equipped with convergence guarantees and error and complexity bounds, properties that are not readily available for most other operator learning architectures. At its core, the proposed approach builds a linear combination of random operators. This turns out to be a low-rank approximation of an operator-valued kernel ridge regression algorithm, and hence the method also has strong connections to Gaussian process regression. The paper designs function-valued random features that are tailored to the structure of two nonlinear operator learning benchmark problems arising from parametric partial differential equations. Numerical results demonstrate the scalability, discretization invariance, and transferability of the function-valued random features method. |
| Nama Pengarang | : | Liliana Borcea, Josselin Garnier, Alexander V. Mamonov |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 3) |
| Nomor Halaman | : | 501-532 |
| Abstraksi Narasi | : | Waveform inversion is concerned with estimating a heterogeneous medium, modeled by variable coefficients of wave equations, using sources that emit probing signals and receivers that record the generated waves. It is an old and intensively studied inverse problem with a wide range of applications, but the existing inversion methodologies are still far from satisfactory. The typical mathematical formulation is a nonlinear least squares data fit optimization and the difficulty stems from the nonconvexity of the objective function that displays numerous local minima at which local optimization approaches stagnate. This pathological behavior has at least three unavoidable causes: (1) The mapping from the unknown coefficients to the wave field is nonlinear and complicated. (2) The sources and receivers typically lie on a single side of the medium, so only backscattered waves are measured. (3) The probing signals are band limited and with high frequency content. There is a lot of activity in the computational science and engineering communities that seeks to mitigate the difficulty of estimating the medium by data fitting. In this paper we present a different point of view, based on reduced order models (ROMs) of two operators that control the wave propagation. The ROMs are called data driven because they are computed directly from the measurements, without any knowledge of the wave field inside the inaccessible medium. This computation is noniterative and uses standard numerical linear algebra methods. The resulting ROMs capture features of the physics of wave propagation in a complementary way and have surprisingly good approximation properties that facilitate waveform inversion. |
| Nama Pengarang | : | Abigail Hickok, Benjamin Jarman, Michael Johnson, Jiajie Luo, Mason A. Porter |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 3) |
| Nomor Halaman | : | 481-500 |
| Abstraksi Narasi | : | It is important to choose the geographical distributions of public resources in a fair and equitable manner. However, it is complicated to quantify the equity of such a distribution; important factors include distances to resource sites, availability of transportation, and ease of travel. We use persistent homology, which is a tool from topological data analysis, to study the availability and coverage of polling sites. The information from persistent homology allows us to infer holes in a distribution of polling sites. We analyze and compare the coverage of polling sites in Los Angeles County and five cities (Atlanta, Chicago, Jacksonville, New York City, and Salt Lake City), and we conclude that computation of persistent homology appears to be a reasonable approach to analyzing resource coverage. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 46 (No. 1) |
| Nomor Halaman | : | 115-127 |
| Abstraksi Narasi | : | In this paper we present a hyperbolic partial differential equation (PDE) in one space and one time dimension. This equation arose in a study of numerical schemes for simulating evolving river topographies. The solution of this PDE, whose initial data are specified along a characteristic, is very similar to that of the canonical diffusion equation. This interesting example provides insight into the solution of hyperbolic PDEs when data is specified in this pathological way as well as illustrating some connections between the parabolic and hyperbolic classes of evolution equations. |
| Nama Pengarang | : | Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 3) |
| Nomor Halaman | : | 403-477 |
| Abstraksi Narasi | : | We survey optimization problems that involve the cardinality of variable vectors in constraints or the objective function. We provide a unified viewpoint on the general problem classes and models, and we give concrete examples from diverse application fields such as signal and image processing, portfolio selection, and machine learning. The paper discusses general-purpose modeling techniques and broadly applicable as well as problem-specific exact and heuristic solution approaches. While our perspective is that of mathematical optimization, a main goal of this work is to reach out to and build bridges between the different communities in which cardinality optimization problems are frequently encountered. In particular, we highlight that modern mixed-integer programming, which is often regarded as impractical due to the commonly unsatisfactory behavior of black-box solvers applied to generic problem formulations, can in fact produce provably high-quality or even optimal solutions for cardinality optimization problems, even in large-scale real-world settings. Achieving such performance typically involves drawing on the merits of problem-specific knowledge that may stem from different fields of application and, e.g., can shed light on structural properties of a model or its solutions, or can lead to the development of efficient heuristics. We also provide some illustrative examples. |
| Nama Pengarang | : | |
| Nama Majalah/Jurnal | : | The Physics Teacher |
| Volume / Nomor Edisi | : | 61 (No. 6) |
| Nomor Halaman | : | 519–521 |
| Abstraksi Narasi | : | Deskripsi abstrak ringkas tidak tersedia untuk artikel ini. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 46 (No. 1) |
| Nomor Halaman | : | 87-111 |
| Abstraksi Narasi | : | We study stochastic linear-quadratic (LQ) optimal control problems over an infinite time horizon, allowing the cost matrices to be indefinite. We develop a systematic approach based on semidefinite programming (SDP). A central issue is the stability of the feedback control. We show that this can be effectively examined through the complementary duality of the SDP. Furthermore, we establish several implication relations among the SDP complementary duality, the (generalized) Riccati equation, and the optimality of the LQ control problem. Based on these relations, we propose a numerical procedure that provides a thorough treatment of the LQ control problem via primal-dual SDP: it identifies a stabilizing feedback control that is optimal or determines that the problem possesses no optimal solution. For the latter case, we develop an -approximation scheme that is asymptotically optimal. |