相关论文: How to determine approximate Mixmaster parameters …
Probabilistic k-nearest neighbour (PKNN) classification has been introduced to improve the performance of original k-nearest neighbour (KNN) classification algorithm by explicitly modelling uncertainty in the classification of each feature…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…
Discrete Markov random fields form a natural class of models to represent images and spatial data sets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
We consider finite element approximations of unique continuation problems subject to elliptic equations in the case where the normal derivative of the exact solution is known to reside in some finite dimensional space. To give quantitative…
The molecule solution of an equation related to the lattice Boussinesq equation is derived with the help of determinantal identities. It is shown that this equation can for certain sequences be used as a numerical convergence acceleration…
It is important to estimate the errors of probabilistic inference algorithms. Existing diagnostics for Markov chain Monte Carlo methods assume inference is asymptotically exact, and are not appropriate for approximate methods like…
Estimating the marginal likelihoods is an essential feature of model selection in the Bayesian context. It is especially crucial to have good estimates when assessing the number of planets orbiting stars when the models explain the noisy…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
We present a simple algebraic method for the analytic continuation of harmonic sums with integer real or purely imaginary indices near negative and positive integers. We provide a MATHEMATICA code for exact expansion of harmonic sums in a…
We consider hard-potential cutoff multi-species Boltzmann operators modeling microscopic binary elastic collisions and bimolecular reversible chemical reactions inside a gaseous mixture. We prove that the spectral gap estimate derived for…
Physical models often contain unknown functions and relations. In order to gain more insights into the nature of physical processes, these unknown functions have to be identified or reconstructed. Mathematically, we can formulate this…
The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…
This work addresses the problem of (global) maximal regularity for quasilinear evolution equations with sublinear gradient growth and right-hand side in Lebesgue spaces, complemented with Neumann boundary conditions. The proof relies on a…
This work is devoted to the obtaining of a new numerical scheme based in quadrature formulas for the Lebesgue-Stieltjes integral for the approximation of Stieltjes ordinary differential equations. This novel method allows us to numerically…
We present a novel Krylov subspace method for approximating $L_f(A, E) \vc{b}$, the matrix-vector product of the Fr\'echet derivative $L_f(A, E)$ of a large-scale matrix function $f(A)$ in direction $E$, a task that arises naturally in the…
This paper is devoted to study the approximation properties and rate of approximation of the Szasz-Mirakjan-Kantrovich-Stancu type polynomials generated by the Dunkl generalization of the exponential function with respect to q -calculus. We…
We propose a discrete lattice version of the Fokker-Planck kinetic equation along lines similar to the Lattice-Boltzmann scheme. Our work extends an earlier one-dimensional formulation to arbitrary spatial dimension $D$. A generalized…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
We consider the problem of discretizing evolution operators of linear delay equations with the aim of approximating their spectra, which is useful in investigating the stability properties of (nonlinear) equations via the principle of…