Related papers: An Elementary Proof of Dodgson's Condensation Meth…
In this paper we are interested in the solution of Compressed Sensing (CS) problems where the signals to be recovered are sparse in coherent and redundant dictionaries. CS problems of this type are convex with non-smooth and non-separable…
With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe…
We introduce a new preconditioner for a recently developed pressure-robust hybridized discontinuous Galerkin (HDG) finite element discretization of the Stokes equations. A feature of HDG methods is the straightforward elimination of…
Studies in thermodynamics often require the reduction of some first or second order partial derivatives in terms of a smaller basic set. A simple algorithm to perform such a reduction is presented here, together with a review of earlier…
Inspired by the connection between the Dodgson's condensation algorithm and Hirota's difference equation, we consider condensation algorithms for Pfaffians from the perspectives of discrete integrable systems. The discretisation of Pfaffian…
Contraction theory is a recently developed dynamic analysis and nonlinear control system design tool based on an exact differential analysis of convergence. This paper extends contraction theory to local and global stability analysis of…
We focus here on a class of fourth-order parabolic equations that can be written as a system of second-order equations by introducing an auxiliary variable. We design a novel second-order fully discrete mixed finite element method to…
This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the…
We propose a robust a posteriori error estimator for the hybridizable discontinuous Galerkin (HDG) method for convection-diffusion equations with dominant convection. The reliability and efficiency of the estimator are established for the…
Clustering, like covariate selection for classification, is an important step to compress and interpret the data. However, clustering of covariates is often performed independently of the classification step, which can lead to undesirable…
Although the linear method is one of the most robust algorithms for optimizing non-linearly parametrized wavefunctions in variational Monte Carlo, it suffers from a memory bottleneck due to the fact at each optimization step a generalized…
We propose a two-step Newton's method for refining an approximation of a singular zero whose deflation process terminates after one step, also known as a deflation-one singularity. Given an isolated singular zero of a square analytic…
Exact calculation of the condensate fraction in multi-dimensional inhomogeneous interacting Bose systems which do not possess continuous symmetries is a difficult computational problem. We have developed an iterative procedure which allows…
We derive a numerical method for Darcy flow, hence also for Poisson's equation in mixed (first order) form, based on discrete exterior calculus (DEC). Exterior calculus is a generalization of vector calculus to smooth manifolds and DEC is…
We present a new algorithm which is named the Dynamical Functional Particle Method, DFPM. It is based on the idea of formulating a finite dimensional damped dynamical system whose stationary points are the solution to the original…
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
Generated Jacobian Equations have been introduced by Trudinger [Disc. cont. dyn. sys (2014), pp. 1663-1681] as a generalization of Monge-Amp{\`e}re equations arising in optimal transport. In this paper, we introduce and study a damped…
We propose new iterative methods for computing nontrivial extremal generalized singular values and vectors. The first method is a generalized Davidson-type algorithm and the second method employs a multidirectional subspace expansion…
A consolidating method for analyzing series of observations based on a fitted model of a mixture of catalysts of the main components is proposed, which makes it possible to study any number of markers. Contrasting the longitudinal approach,…
This article presents a new method to compute matrices from numerical simulations based on the ideas of sparse sampling and compressed sensing. The method is useful for problems where the determination of the entries of a matrix constitutes…