Related papers: Quantitative touchdown localization for the MEMS p…
In Monte Carlo simulation, lattice field theory with a $\theta$ term suffers from the sign problem. This problem can be circumvented by Fourier-transforming the topological charge distribution $P(Q)$. Although this strategy works well for…
One bottleneck of quantum Monte Carlo (QMC) simulation of strongly correlated electron systems lies at the scaling relation of computational complexity with respect to the system sizes. For generic lattice models of interacting fermions,…
We investigate under which conditions a mixed state on a finite-dimensional multipartite quantum system may be the unique, globally stable fixed point of frustration-free semigroup dynamics subject to specified quasi-locality constraints.…
Since its introduction, the Virtual Element Method (VEM) was shown to be able to deal with a large variety of polygons, while achieving good convergence rates. The regularity assumptions proposed in the VEM literature to guarantee the…
The long-run average payoff per transition (mean payoff) is the main tool for specifying the performance and dependability properties of discrete systems. The problem of constructing a controller (strategy) simultaneously optimizing several…
The efficient placement of signal templates in source-parameter space is a crucial requisite for exhaustive matched-filtering searches of modeled gravitational-wave sources. Unfortunately, the current placement algorithms based on regular…
This paper studies the optimal placement of ceiling-mounted metasurfaces (MTSs) to help focus the wireless signal beam onto the target receiver, as inspired by the theatre spotlight. We assume that a total of $M$ MTSs are deployed, and that…
The presence of corners in the computational domain, in general, reduces the regularity of solutions of parabolic problems and diminishes the convergence properties of the finite element approximation introducing a so-called "pollution…
In this work, we consider solving optimization problems with a stochastic objective and deterministic equality constraints. We propose a Trust-Region Sequential Quadratic Programming method to find both first- and second-order stationary…
One of the major issues in the computational mechanics is to take into account the geometrical complexity. To overcome this difficulty and to avoid the expensive mesh generation, geometrically unfitted methods, i.e. the numerical methods…
We report on low temperature measurements performed on micro-electro-mechanical systems (MEMS) driven deeply into the non-linear regime. The materials are kept in their elastic domain, while the observed non-linearity is purely of…
Identifiability means that iterates generated by optimization algorithms are eventually confined to an identifiable set. This property is computationally useful because minimizing a nonsmooth function near a critical point reduces to…
We present regret minimization algorithms for stochastic contextual MDPs under minimum reachability assumption, using an access to an offline least square regression oracle. We analyze three different settings: where the dynamics is known,…
We analyse and improve the volume-penalty method, a simple and versatile way to model objects in fluid flows. The volume-penalty method is a kind of fictitious-domain method that approximates no-slip boundary conditions with rapid linear…
This paper is concerned with volume-constrained minimization problems derived from Gamow's liquid drop model for the atomic nucleus, involving the competition of a perimeter term and repulsive nonlocal potentials. We consider a large class…
Analysis and processing of data is a vital part of our modern society and requires vast amounts of computational resources. To reduce the computational burden, compressing and approximating data has become a central topic. We consider the…
This tutorial introduces a systematic approach for addressing the key question of quantum metrology: For a generic task of sensing an unknown parameter, what is the ultimate precision given a constrained set of admissible strategies. The…
We consider the approximation of the 2D frictionless contact problem in elasticity using the Virtual Element Methods (VEMs). To overcome the volumetric locking phenomenon in the nearly incompressible case, we adopt a mixed…
We present a new empirical pseudopotential (EPM) calculation approach to simulate the million atom nanostructured semiconductor devices under potential bias using the periodic boundary conditions. To treat the non-equilibrium condition,…
A line of recent work has analyzed the behavior of the Expectation-Maximization (EM) algorithm in the well-specified setting, in which the population likelihood is locally strongly concave around its maximizing argument. Examples include…