| Nama Pengarang | : | Shixiang Chen, Shiqian Ma, Anthony Man-Cho So, Tong Zhang |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 2) |
| Nomor Halaman | : | 319-352 |
| Abstraksi Narasi | : | We consider optimization problems over the Stiefel manifold whose objective function is the summation of a smooth function and a nonsmooth function. Existing methods for solving this class of problems converge slowly in practice, involve subproblems that can be as difficult as the original problem, or lack rigorous convergence guarantees. In this paper, we propose a manifold proximal gradient method (ManPG) for solving this class of problems. We prove that the proposed method converges globally to a stationary point and establish its iteration complexity for obtaining an ?-stationary point. Furthermore, we present numerical results on the sparse PCA and compressed modes problems to demonstrate the advantages of the proposed method. We also discuss some recent advances related to ManPG for Riemannian optimization with nonsmooth objective functions. |
| Nama Pengarang | : | Leslie F. Greengard, Shidong Jiang, Manas Rachh, Jun Wang |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 2) |
| Nomor Halaman | : | 287-315 |
| Abstraksi Narasi | : | We present a new version of the fast Gauss transform (FGT) for discrete and continuous sources. Classical Hermite expansions are avoided entirely, making use only of the plane-wave representation of the Gaussian kernel and a new hierarchical merging scheme. For continuous source distributions sampled on adaptive tensor product grids, we exploit the separable structure of the Gaussian kernel to accelerate the computation. For discrete sources, the scheme relies on the nonuniform fast Fourier transform (NUFFT) to construct near field plane-wave representations. The scheme has been implemented for either free-space or periodic boundary conditions. In many regimes, the speed is comparable to or better than that of the conventional FFT in work per grid point, despite being fully adaptive. |
| Nama Pengarang | : | Julianne Chung, Silvia Gazzola |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 2) |
| Nomor Halaman | : | 205-284 |
| Abstraksi Narasi | : | This paper surveys an important class of methods that combine iterative projection methods and variational regularization methods for large-scale inverse problems. Iterative methods such as Krylov subspace methods are invaluable in the numerical linear algebra community and have proved important in solving inverse problems due to their inherent regularizing properties and their ability to handle large-scale problems. Variational regularization describes a broad and important class of methods that are used to obtain reliable solutions to inverse problems, whereby one solves a modified problem that incorporates prior knowledge. Hybrid projection methods combine iterative projection methods with variational regularization techniques in a synergistic way, providing researchers with a powerful computational framework for solving very large inverse problems. Although the idea of a hybrid Krylov method for linear inverse problems goes back to the 1980s, several recent advances on new regularization frameworks and methodologies have made this field ripe for extensions, further analyses, and new applications. In this paper, we provide a practical and accessible introduction to hybrid projection methods in the context of solving large (linear) inverse problems. |
| Nama Pengarang | : | Endi Rukmo |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 1) |
| Nomor Halaman | : | 193-201 |
| Abstraksi Narasi | : | Deskripsi abstrak ringkas tidak tersedia untuk artikel ini. |
| Nama Pengarang | : | Zongren Zou, Xuhui Meng, Apostolos F. Psaros, George E. Karniadakis |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 1) |
| Nomor Halaman | : | 161-190 |
| Abstraksi Narasi | : | Uncertainty quantification (UQ) in machine learning is currently drawing increasing research interest, driven by the rapid deployment of deep neural networks across different fields, such as computer vision and natural language processing, and by the need for reliable tools in risk-sensitive applications. Recently, various machine learning models have also been developed to tackle problems in the field of scientific computing with applications to computational science and engineering (CSE). Physics-informed neural networks and deep operator networks are two such models for solving partial differential equations (PDEs) and learning operator mappings, respectively. In this regard, a comprehensive study of UQ methods tailored specifically for scientific machine learning (SciML) models has been provided in [A. F. Psaros et al., J. Comput. Phys., 477 (2023), art. 111902]. Nevertheless, and despite their theoretical merit, implementations of these methods are not straightforward, especially in large-scale CSE applications, hindering their broad adoption in both research and industry settings. In this paper, we present an open-source Python library (u?lhttps://github.com/Crunch-UQ4MI), termed NeuralUQ and accompanied by an educational tutorial, for employing UQ methods for SciML in a convenient and structured manner. The library, designed for both educational and research purposes, supports multiple modern UQ methods and SciML models. It is based on a succinct workflow and facilitates flexible employment and easy extensions by the users. We first present a tutorial of NeuralUQ and subsequently demonstrate its applicability and efficiency in four diverse examples, involving dynamical systems and high-dimensional parametric and time-dependent PDEs. |
| Nama Pengarang | : | Xuehan Zhou |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 1) |
| Nomor Halaman | : | 149-160 |
| Abstraksi Narasi | : | In a recent article in this journal, Gouveia and Stone [``Generating Resonant and Repeated Root Solutions to Ordinary Differential Equations Using Perturbation Methods,” SIAM Rev., 64 (2022), pp. 485--499] described a method for finding exact solutions to resonantly forced linear ordinary differential equations, and for finding the general solution of repeated root linear systems. It is shown here that applying their mathematical justification directly yields a method that is faster and algebraically simpler than the method they described. This method seems to be unknown in the undergraduate textbook literature, although it certainly should be present there as it is elegant and simple to apply, generally giving solutions with much less work than variation of parameters. |
| Nama Pengarang | : | Bjorn Fredrik Nielsen, Zdenek Strakos |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 1) |
| Nomor Halaman | : | 125-146 |
| Abstraksi Narasi | : | We analyze the spectrum of the operator Δ−1[∇⋅(?∇?)] subject to homogeneous Dirichlet or Neumann boundary conditions, where Δ denotes the Laplacian and ?=?(?,?) is a symmetric tensor. Our main result shows that this spectrum can be derived from the spectral decomposition ?=?Λ??, where ?=?(?,?) is an orthogonal matrix and Λ=Λ(?,?) is a diagonal matrix. More precisely, provided that ? is continuous, the spectrum equals the convex hull of the ranges of the diagonal function entries of Λ. The domain involved is assumed to be bounded and Lipschitz. In addition to studying operators defined on infinite-dimensional Sobolev spaces, we also report on recent results concerning their discretized finite-dimensional counterparts. More specifically, even though Δ−1[∇⋅(?∇?)] is not compact, it turns out that every point in the spectrum of this operator can, to an arbitrary accuracy, be approximated by eigenvalues of the associated generalized algebraic eigenvalue problems arising from discretizations. Our theoretical investigations are illuminated by numerical experiments. The results presented in this paper extend previous analyses which have addressed elliptic differential operators with scalar coefficient functions. Our investigation is motivated by both preconditioning issues (efficient numerical computations) and the need to further develop the spectral theory of second order PDEs (core analysis). |
| Nama Pengarang | : | Eva-Maria Walz, Alexander Henzi, Johanna Ziegel, Tilmann Gneiting |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 1) |
| Nomor Halaman | : | 91-122 |
| Abstraksi Narasi | : | How can we quantify uncertainty if our favorite computational tool---be it a numerical, statistical, or machine learning approach, or just any computer model---provides single-valued output only? In this article, we introduce the Easy Uncertainty Quantification (EasyUQ) technique, which transforms real-valued model output into calibrated statistical distributions, based solely on training data of model output--outcome pairs, without any need to access model input. In its basic form, EasyUQ is a special case of the recently introduced isotonic distributional regression (IDR) technique that leverages the pool-adjacent-violators algorithm for nonparametric isotonic regression. EasyUQ yields discrete predictive distributions that are calibrated and optimal in finite samples, subject to stochastic monotonicity. The workflow is fully automated, without any need for tuning. The Smooth EasyUQ approach supplements IDR with kernel smoothing, to yield continuous predictive distributions that preserve key properties of the basic form, including both stochastic monotonicity with respect to the original model output and asymptotic consistency. For the selection of kernel parameters, we introduce multiple one-fit grid search, a computationally much less demanding approximation to leave-one-out cross-validation. We use simulation examples and forecast data from weather prediction to illustrate the techniques. In a study of benchmark problems from machine learning, we show how EasyUQ and Smooth EasyUQ can be integrated into the workflow of neural network learning and hyperparameter tuning, and we find EasyUQ to be competitive with conformal prediction as well as more elaborate input-based approaches. |
| Nama Pengarang | : | Gabriel R. Barrenechea, Volker John, Petr Knobloch |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 66 (No. 1) |
| Nomor Halaman | : | 3-88 |
| Abstraksi Narasi | : | Convection-diffusion-reaction equations model the conservation of scalar quantities. From the analytic point of view, solutions of these equations satisfy, under certain conditions, maximum principles, which represent physical bounds of the solution. That the same bounds are respected by numerical approximations of the solution is often of utmost importance in practice. The mathematical formulation of this property, which contributes to the physical consistency of a method, is called the discrete maximum principle (DMP). In many applications, convection dominates diffusion by several orders of magnitude. It is well known that standard discretizations typically do not satisfy the DMP in this convection-dominated regime. In fact, in this case it turns out to be a challenging problem to construct discretizations that, on the one hand, respect the DMP and, on the other hand, compute accurate solutions. This paper presents a survey on finite element methods, with the main focus on the convection-dominated regime, that satisfy a local or a global DMP. The concepts of the underlying numerical analysis are discussed. The survey reveals that for the steady-state problem there are only a few discretizations, all of them nonlinear, that at the same time both satisfy the DMP and compute reasonably accurate solutions, e.g., algebraically stabilized schemes. Moreover, most of these discretizations have been developed in recent years, showing the enormous progress that has been achieved lately. Similarly, methods based on algebraic stabilization, both nonlinear and linear, are currently the only finite element methods that combine the satisfaction of the global DMP and accurate numerical results for the evolutionary equations in the convection-dominated scenario. |
| Nama Pengarang | : | Purnomo, Aloys Budi |
| Nama Majalah/Jurnal | : | Inspirasi |
| Volume / Nomor Edisi | : | VII (No. 76) |
| Nomor Halaman | : | 48-51 |
| Abstraksi Narasi | : | - |