Related papers: A uniform preconditioner for a Newton algorithm fo…
In this paper we study the application of the Sobolev gradients technique to the problem of minimizing several Schr\"odinger functionals related to timely and difficult nonlinear problems in Quantum Mechanics and Nonlinear Optics. We show…
Recently, Garcke et al.[Garcke, Hinze, Kahle, A stable and linear time discretization for a thermodynamically consistent model for two-phase incompressible flow, Applied Numerical Mathematics 99, pp. 151-171, 2016] developed a consistent…
In this paper, we propose a descent method for composite optimization problems with linear operators. Specifically, we first design a structure-exploiting preconditioner tailored to the linear operator so that the resulting preconditioned…
We study stochastic optimization from a joint continuous-discrete point of view. Starting from a second-order stochastic differential equation interpreted as a noisy accelerated gradient flow, we discretize the dynamics by a fully implicit…
The authors propose a recycling Krylov subspace method for the solution of a sequence of self-adjoint linear systems. Such problems appear, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically…
In this paper, we consider an efficient iterative approach to the solution of the discrete Helmholtz equation with Dirichlet, Neumann and Sommerfeld-like boundary conditions based on a compact sixth order approximation scheme and…
We leverage the proximal Galerkin algorithm (Keith and Surowiec, Foundations of Computational Mathematics, 2024, DOI: 10.1007/s10208-024-09681-8), a recently introduced mesh-independent algorithm, to obtain a high-order finite element…
This study proposes a Newton based multiple objective optimization algorithm for hyperparameter search. The first order differential (gradient) is calculated using finite difference method and a gradient matrix with vectorization is formed…
Interior point methods are widely used for different types of mathematical optimization problems. Many implementations of interior point methods in use today rely on direct linear solvers to solve systems of equations in each iteration. The…
Biot's consolidation model in poroelasticity has a number of applications in science, medicine, and engineering. The model depends on various parameters, and in practical applications these parameters ranges over several orders of…
In this article, we derive a new, fast, and robust preconditioned iterative solution strategy for the all-at-once solution of optimal control problems with time-dependent PDEs as constraints, including the heat equation and the non-steady…
In this paper we consider a class of fictitious domain finite element methods known from the literature. These methods use standard finite element spaces on a fixed unfitted triangulation combined with the Nitsche technique and a ghost…
In this paper we consider a three-field formulation of the Biot model which has the displacement, the total pressure, and the pore pressure as unknowns. For parameter-robust stability analysis, we first show a priori estimates of the…
Adaptive cubic regularization methods for solving nonconvex problems need the efficient computation of the trial step, involving the minimization of a cubic model. We propose a new approach in which this model is minimized in a low…
We describe a fully discrete mixed finite element method for the linearized rotating shallow water model, possibly with damping. While Crank-Nicolson time-stepping conserves energy in the absence of drag or forcing terms and is not subject…
Uniform preconditioners for operators of negative order discretized by (dis)continuous piecewise polynomials of any order are constructed from a boundedly invertible operator of opposite order discretized by continuous piecewise linears.…
In this paper, we propose a primal-dual splitting algorithm for a broad class of structured composite monotone inclusions that involve finitely many set-valued operators, compositions of set-valued operators with bounded linear operators,…
This paper aims at developing two versions of the generalized Newton method to compute not merely arbitrary local minimizers of nonsmooth optimization problems but just those, which possess an important stability property known as tilt…
We design two classes of ultra-fast meta-solvers for linear systems arising after discretizing PDEs by combining neural operators with either simple iterative solvers, e.g., Jacobi and Gauss-Seidel, or with Krylov methods, e.g., GMRES and…
In this note we present a multigrid preconditioning method for solving quadratic optimization problems constrained by a fractional diffusion equation. Multigrid methods within the all-at-once approach to solve the first order-order…