相关论文: Extension of the one-dimensional Stoney algorithm …

Schemes with the second-order approximation in time are considered for numerical solving the Cauchy problem for an evolutionary equation of first order with a self-adjoint operator. The implicit two-level scheme based on the Pad\'{e}…

In this paper, we propose an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method for solving Bayesian inverse problems. The method can generate approximate samples from posteriors efficiently. Based on the…

This paper introduces an efficient second-order method for solving the elastic net problem. Its key innovation is a computationally efficient technique for injecting curvature information in the optimization process which admits a strong…

Using an evolutionary algorithm combined with a gradient descent method we design optical cavities with significantly enhanced strong coupling rates between cavity photons and a single quantum emitter. Our approach allows us to find…

In this paper we consider the variable inequality problem, that is, to find a solution of the inclusion given by the sum of a function and a point-to-cone application. This problem can be seen as a generalization of the classical system…

The classical algorithm of Agrawal, Klein and Ravi [SIAM J. Comput., 24 (1995), pp. 440-456], stated in the setting of the primal-dual schema by Goemans and Williamson [SIAM J. Comput., 24 (1995), pp. 296-317] uses the undirected cut…

We develop a novel wave imaging scheme for reconstructing the shape of an inhomogeneous scatterer and we consider the inverse acoustic obstacle scattering problem as a prototype model for our study. There exists a wealth of reconstruction…

We develop and demonstrate two numerical methods for solving the class of open cavity problems which involve a curved, cylindrically symmetric conducting mirror facing a planar dielectric stack. Such dome-shaped cavities are useful due to…

Adaptive Finite Element Method (adaptivity) is known to be an effective numerical tool for some ill-posed problems. The key advantage of the adaptivity is the image improvement with local mesh refinements. A rigorous proof of this property…

The locally modified finite element method, which is introduced in [Frei, Richter: SINUM 52(2014), p. 2315-2334], is a simple fitted finite element method that is able to resolve weak discontinuities in interface problems. The method is…

We present a sharp collocated projection method for solving the immiscible, two-phase Navier-Stokes equations in two- and three-dimensions. Our method is built using non-graded adaptive quadtree and octree grids, where all of the fluid…

Optimization problems in disciplines such as machine learning are commonly solved with iterative methods. Gradient descent algorithms find local minima by moving along the direction of steepest descent while Newton's method takes into…

We present a higher-order finite volume method for solving elliptic PDEs with jump conditions on interfaces embedded in a 2D Cartesian grid. Second, fourth, and sixth order accuracy is demonstrated on a variety of tests including problems…

We introduce a new non-smooth variational model for the restoration of manifold-valued data which includes second order differences in the regularization term. While such models were successfully applied for real-valued images, we introduce…

Analysis of the generalized Weierstrass-Enneper system includes the estimation of the degree of indeterminancy of the general analytic solution and the discussion of the boundary value problem. Several different procedures for constructing…

The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…

We develop a method for optimization in shape spaces, i.e., sets of surfaces modulo re-parametrization. Unlike previously proposed gradient flows, we achieve superlinear convergence rates through a subtle approximation of the shape Hessian,…

We consider the $k$-prize-collecting Steiner tree problem. An instance is composed of an integer $k$ and a graph $G$ with costs on edges and penalties on vertices. The objective is to find a tree spanning at least $k$ vertices which…

The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An…

The ability to efficiently and accurately construct an inverse frame operator is critical for establishing the utility of numerical frame approximations. Recently, the admissible frame method was developed to approximate inverse frame…