Related papers: Multiple mass solvers
We present methods for obtaining new solutions to the bispectral problem. We achieve this by giving its abstract algebraic version suitable for generalizations. All methods are illustrated by new classes of bispectral operators.
The multi-point Metropolis algorithm is an advanced MCMC technique based on drawing several correlated samples at each step and choosing one of them according to some normalized weights. We propose a variation of this technique where the…
This paper introduces bootstrap multigrid methods for solving eigenvalue problems arising from the discretization of partial differential equations. Inspired by the full bootstrap algebraic multigrid (BAMG) setup algorithm that includes an…
In this paper, we propose and analyze iterative method based on projection techniques to solve a non-singular linear system Ax = b. In particular, for a given positive integer m, m-dimensional successive projection method (mD-SPM) for…
Graphical Processing Units (GPUs) are more and more frequently used for lattice QCD calculations. Lattice studies often require computing the quark propagators for several masses. These systems can be solved using multi-shift inverters but…
In this paper we explore several approaches for sampling weight vectors in the context of weighted sum scalarisation approaches for solving multi-criteria decision making (MCDM) problems. This established method converts a multi-objective…
The Multiple Try Metropolis (MTM) method is a generalization of the classical Metropolis-Hastings algorithm in which the next state of the chain is chosen among a set of samples, according to normalized weights. In the literature, several…
The binomial multichannel algorithm is proposed. Some its properties are discussed.
The Reversible Jump algorithm is one of the most widely used Markov chain Monte Carlo algorithms for Bayesian estimation and model selection. A generalized multiple-try version of this algorithm is proposed. The algorithm is based on…
The aim of this article is to introduce an iterative algorithm for finding a common solution from the set of an equilibrium point for a bifunction and the set of a singularity of an inclusion problem on an Hadamard manifold. We also discuss…
We propose Mstab, a novel Krylov subspace recycling method for the iterative solution of sequences of linear systems with fixed system matrix and changing right-hand sides. This new method is a straight and simple generalization of IDRstab.…
This paper proposes using a method named Double Score Matching (DSM) to do mass-imputation and presents an application to make inferences with a nonprobability sample. DSM is a $k$-Nearest Neighbors algorithm that uses two balance scores…
The paper discusses the efficiency of the classical BiCGStab method and several of its modifications for solving systems with multiple right-hand side vectors. These iterative methods are widely used for solving systems with large sparse…
I will present a method for providing initial guesses to a linear solver for systems with multiple shifts. This can also be extended to the case of multiple sources each with a different shift.
A numerical method is presented to obtain approximate solutions to problems arising from sedimentation models. These processes are widely utilized in minery for recovering water from suspensions coming out of flotation processes. The main…
This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…
We use the bilocal method to derive the large $N$ solution of the most general $QCD_2$.
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm BISOLVE. BISOLVE is a classical elimination method which first projects the solutions of a system onto the $x$-…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…