Related papers: An adaptive aggregation based domain decomposition…
In this paper, we first propose and analyze a novel mixed-type DG method for the coupled Stokes-Darcy problem on simplicial meshes. The proposed formulation is locally conservative. A mixed-type DG method in conjunction with the…
In this work, we propose a two-stage approach to strengthen piecewise McCormick relaxations for mixed-integer nonlinear programs (MINLP) with multi-linear terms. In the first stage, we exploit Constraint Programing (CP) techniques to…
We discuss the recently proposed multiboson domain-decomposed factorization of the gauge-field dependence of the fermion determinant in lattice QCD. In particular, we focus on the case of a lattice divided in an arbitrary number of thick…
We propose a semi-proximal augmented Lagrangian based decomposition method for convex composite quadratic conic programming problems with primal block angular structures. Using our algorithmic framework, we are able to naturally derive…
We present the Adaptive Aggregation-based Domain Decomposition Multigrid method extended to the twisted mass fermion discretization action. We show comparisons of results as a function of tuning the parameters that enter the twisted mass…
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…
We consider the numerical solution of time-dependent space tempered fractional diffusion equations. The use of Crank-Nicolson in time and of second-order accurate tempered weighted and shifted Gr\"unwald difference in space leads to dense…
We analyze fast diagonal methods for simple bilevel programs. Guided by the analysis of the corresponding continuous-time dynamics, we provide a unified convergence analysis under general geometric conditions, including H\"olderian growth…
In this paper, we consider nonconvex decentralised optimisation and learning over a network of distributed agents. We develop an ADMM algorithm based on the Randomised Block Coordinate Douglas-Rachford splitting method which enables agents…
The computation of many correlation functions in lattice QCD is severely hindered by a signal-to-noise problem. Recent developments in the factorization of both the fermion propagator and determinant pave the way for the implementation of…
We analyze and optimize two-level methods applied to a symmetric interior penalty discontinuous Galerkin finite element discretization of a singularly perturbed reaction-diffusion equation. Previous analyses of such methods have been…
We propose improved estimators to compute the reweighting factors which are needed for lattice QCD calculations that rely on twisted-mass reweighting for the light quark contribution and the Rational Hybrid Monte Carlo (RHMC) algorithm for…
Constrained mechanical multibody systems arise in many important applications like robotics, vehicle and machinery dynamics and biomechanics of locomotion of humans. These systems are described by the Euler-Lagrange equations which are…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…
We show how to extend a recently proposed multi-level Monte Carlo approach to the continuous time Markov chain setting, thereby greatly lowering the computational complexity needed to compute expected values of functions of the state of the…
We discuss the implementation and optimization challenges for a Wilson-Dirac solver with Clover term on QPACE, a parallel machine based on Cell processors and a torus network. We choose the mixed-precision Schwarz preconditioned FGCR…
In the first part of this paper we study approximations of trajectories of Piecewise Deter-ministic Processes (PDP) when the flow is not explicit by the thinning method. We also establish a strong error estimate for PDPs as well as a weak…
It is possible to improve the chiral behaviour and the approach to the continuum limit of correlation functions in lattice QCD with standard and twisted Wilson fermions by taking arithmetic averages of correlators computed in theories…
We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to…
We consider the task of computing solutions of linear systems that only differ by a shift with the identity matrix as well as linear systems with several different right hand sides. In the past Krylov subspace methods have been developed…