Related papers: A Python code for calculating the mean-value (Bald…
The classical completeness problem raised by Beurling and independently by Wintner asks for which $\psi\in L^2(0,1)$, the dilation system $\{\psi(kx):k=1,2,\cdots\}$ is complete in $L^2(0,1)$, where $\psi$ is identified with its extension…
Integrals involving highly oscillatory Bessel functions are notoriously challenging to compute using conventional integration techniques. While several methods are available, they predominantly cater to integrals with at most a single…
Hypervolume indicator is a commonly accepted quality measure for comparing Pareto approximation set generated by multi-objective optimizers. The best known algorithm to calculate it for $n$ points in $d$-dimensional space has a run time of…
This paper studies the risk-averse mean-variance optimization in infinite-horizon discounted Markov decision processes (MDPs). The involved variance metric concerns reward variability during the whole process, and future deviations are…
The present paper deals with the generalization of Midpoint Ellipse Drawing Algorithm (MPEDA) to minimize the error in the existing MPEDA in cartesian form. In this method, we consider three different values of h, i.e., 1, 0.5 and 0.1. For…
Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and…
Counting lattice points within a rational polytope is a foundational problem with applications across mathematics and computer science. A key approach is Barvinok's algorithm, which decomposes the lattice point generating function of cones…
In this note we outline the Monte Carlo project {\tt KrkMC}. The goal of this project is to construct a QCD Parton Shower accurate to NLO level in both coefficient function and splitting function (shower) parts. We discuss in detail one of…
In this paper, we propose and study a fast multilevel dimension iteration (MDI) algorithm for computing arbitrary $d$-dimensional integrals based on tensor product approximations. It reduces the computational complexity (in terms of the CPU…
We give polynomial-time dynamic-programming algorithms finding the areas of words in the presentations $\langle a, b \mid a, b \rangle$ and $\langle a, b \mid a^k, b^k; \ k \in \mathbb{N} \rangle$ of the trivial group. In the first of these…
The recently proposed Broximal Point Method (BPM) [Gruntkowska et al., 2025] offers an idealized optimization framework based on iteratively minimizing the objective function over norm balls centered at the current iterate. It enjoys…
A new technique is presented to solve a class of linear boundary value problems (BVP). Technique is primarily based on an operational matrix developed from a set of modified Bernoulli polynomials. The new set of polynomials is an…
We explore the possibility of modifying the multiplicity of the basic cluster in the entropy functional used in the cluster variation method so that truncation errors owing to finite size of the basic cluster may be corrected. The numerical…
An optimal experimental set-up maximizes the value of data for statistical inferences and predictions. The efficiency of strategies for finding optimal experimental set-ups is particularly important for experiments that are time-consuming…
The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…
We consider Markov decision processes (MDPs) with $\omega$-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning vertices from where the objective can be ensured with…
Multivariate normal (MVN) probabilities arise in myriad applications, but they are analytically intractable and need to be evaluated via Monte-Carlo-based numerical integration. For the state-of-the-art minimax exponential tilting (MET)…
We introduce a Bayesian approach for modeling Voigt profiles in absorption spectroscopy and its implementation in the python package, BayesVP, publicly available at https://github.com/cameronliang/BayesVP. The code fits the absorption line…
We propose a multilevel Markov chain Monte Carlo (MCMC) method for the Bayesian inference of random field parameters in PDEs using high-resolution data. Compared to existing multilevel MCMC methods, we additionally consider level-dependent…
The article presents and evaluates a scalable algorithm for validating solutions of linear programming problems on cluster computing systems. The main idea of the method is to generate a regular set of points (validation set) on a…