Related papers: A fully adaptive multilevel stochastic collocation…
Elastic geodesic grids deploy from flat to spatial configurations via complex nonlinear motion that is difficult to represent robustly for simulation. We present a geometric guidance framework that discretizes deployment as synchronized,…
We propose and analyze novel adaptive algorithms for the numerical solution of elliptic partial differential equations with parametric uncertainty. Four different marking strategies are employed for refinement of stochastic Galerkin finite…
This paper considers a general data-fitting problem over a networked system, in which many computing nodes are connected by an undirected graph. This kind of problem can find many real-world applications and has been studied extensively in…
This chapter provides an overview of state-of-the-art adaptive finite element methods (AFEMs) for the numerical solution of second-order elliptic partial differential equations (PDEs), where the primary focus is on the optimal interplay of…
In this paper, the elliptic PDE-constrained optimization problem with box constraints on the control is studied. To numerically solve the problem, we apply the 'optimize-discretize-optimize' strategy. Specifically, the alternating direction…
Historically, analysis for multiscale PDEs is largely unified while numerical schemes tend to be equation-specific. In this paper, we propose a unified framework for computing multiscale problems through random sampling. This is achieved by…
This paper is concerned with the numerical approximation of quantities of interest associated with solutions to parametric elliptic partial differential equations (PDEs). The key novelty of this work is in its focus on the quantities of…
Stochastic gradient methods have been a popular and powerful choice of optimization methods, aimed at minimizing functions. Their advantage lies in the fact that that one approximates the gradient as opposed to using the full Jacobian…
We propose a method for the approximation of solutions of PDEs with stochastic coefficients based on the direct, i.e., non-adapted, sampling of solutions. This sampling can be done by using any legacy code for the deterministic problem as a…
Realistic physical phenomena exhibit random fluctuations across many scales in the input and output processes. Models of these phenomena require stochastic PDEs. For three-dimensional coupled (vector-valued) stochastic PDEs (SPDEs), for…
A framework previously introduced in [3] for solving a sequence of stochastic optimization problems with bounded changes in the minimizers is extended and applied to machine learning problems such as regression and classification. The…
This manuscript presents an adaptive high order discretization technique for elliptic boundary value problems. The technique is applied to an updated version of the Hierarchical Poincar\'e-Steklov (HPS) method. Roughly speaking, the HPS…
This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats. Both the subspaces giving rise to low-rank approximations…
In this paper, we discuss adaptive approximations of an elliptic eigenvalue optimization problem in a phase-field setting by a conforming finite element method. An adaptive algorithm is proposed and implemented in several two dimensional…
We formulate and analyze an adaptive algorithm for isogeometric analysis with hierarchical B-splines for weakly-singular boundary integral equations. We prove that the employed weighted-residual error estimator is reliable and converges at…
In this paper we propose several adaptive gradient methods for stochastic optimization. Unlike AdaGrad-type of methods, our algorithms are based on Armijo-type line search and they simultaneously adapt to the unknown Lipschitz constant of…
In this paper we propose local approximation spaces for localized model order reduction procedures such as domain decomposition and multiscale methods. Those spaces are constructed from local solutions of the partial differential equation…
This article describes a new, fully adaptive Particle-Multiple-Mesh numerical simulation code developed primarily for simulations of small regions (such as a group of galaxies) in a cosmological context. It integrates the equations of…
We consider computing eigenspaces of an elliptic self-adjoint operator depending on a countable number of parameters in an affine fashion. The eigenspaces of interest are assumed to be isolated in the sense that the corresponding…
We consider a sparse grid collocation method in conjunction with a time discretization of the differential equations for computing expectations of functionals of solutions to differential equations perturbed by time-dependent white noise.…