Related papers: An inexact Newton-Krylov method for stochastic eig…
We discretize the stochastic Allen-Cahn equation with additive noise by means of a spectral Galerkin method in space and a tamed version of the exponential Euler method in time. The resulting error bounds are analyzed for the…
In magnetized plasmas of fusion devices the strong magnetic field leads to highly anisotropic physics where solution scales along field lines are much larger than perpendicular to it. Hence, regarding both accuracy and efficiency, a…
The focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton's method. There is a trade-off between solving Newton systems…
In this paper we are interested in the numerical solution of stochastic differential equations with non negative solutions. Our goal is to construct explicit numerical schemes that preserve positivity, even for super linear stochastic…
In the first part of this paper, uniqueness of strong solution is established for the Vlasov-unsteady Stokes problem in 3D. The second part deals with a semi discrete scheme, which is based on the coupling of discontinuous Galerkin…
We consider a control constrained parabolic optimal control problem and use variational discretization for its time semi-discretization. The state equation is treated with a Petrov-Galerkin scheme using a piecewise constant Ansatz for the…
This paper proposes a stochastic variant of a classic algorithm---the cubic-regularized Newton method [Nesterov and Polyak 2006]. The proposed algorithm efficiently escapes saddle points and finds approximate local minima for general…
Iterative Krylov projection methods have become widely used for solving large-scale linear inverse problems. However, methods based on orthogonality include the computation of inner-products, which become costly when the number of…
In computational relativity, critical behaviour near the black hole threshold has been studied numerically for several models in the last decade. In this paper we present a spatial Galerkin method, suitable for finding numerical solutions…
The classical method to solve a quadratic optimization problem with nonlinear equality constraints is to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using Newton's method. This approach however is usually computationally…
In this work we analyze the inverse problem of recovering the space-dependent potential coefficient in an elliptic / parabolic problem from distributed observation. We establish novel (weighted) conditional stability estimates under very…
In this paper we develop an $hp$-adaptive procedure for the numerical solution of general second-order semilinear elliptic boundary value problems, with possible singular perturbation. Our approach combines both adaptive Newton schemes and…
This article presents a constrained policy optimization approach for the optimal control of systems under nonstationary uncertainties. We introduce an assumption that we call Markov embeddability that allows us to cast the stochastic…
In this paper, we shall derive a spectral matrix method for the approximation of the eigenvalues of (weakly) regular and singular Sturm-Liouville problems in normal form with an unbounded potential at the left endpoint. The method is…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
In this paper we develop an $hp$-adaptive procedure for the numerical solution of general, semilinear elliptic boundary value problems in 1d, with possible singular perturbations. Our approach combines both a prediction-type adaptive Newton…
In this paper, we present an energy-preserving exponentially integrable numerical method for stochastic wave equation with cubic nonlinearity and additive noise. We first apply the spectral Galerkin method to discretizing the original…
The Golub-Kahan-Tikhonov method is a popular solution technique for large linear discrete ill-posed problems. This method first applies partial Golub-Kahan bidiagonalization to reduce the size of the given problem and then uses Tikhonov…
Over the last few years there have been dramatic advances in our understanding of mathematical and computational models of complex systems in the presence of uncertainty. This has led to a growth in the area of uncertainty quantification as…
Deep neural networks are powerful tools for approximating functions, and they are applied to successfully solve various problems in many fields. In this paper, we propose a neural network-based numerical method to solve partial differential…