相关论文: Comments on the Voigt function implementation in t…
Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…
Weak gravitational lensing of background galaxies offers an excellent opportunity to study the intervening distribution of matter. While much attention to date has focused on the two-point function of the cosmic shear, the three-point…
We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both on real-life preference-aggregation data and on synthetic…
Weak lensing measurements are starting to provide statistical maps of the distribution of matter in the universe that are increasingly precise and complementary to cosmic microwave background maps. The probability distribution (PDF)…
In this paper, we provide a detailed analysis of the global convergence properties of an extensively studied and extremely effective fixed-point algorithm for the Kullback-Leibler approximation of spectral densities, proposed by Pavon and…
The spectral representation separates the contributions of geometrical arrangement (topology) and intrinsic constituent properties in a composite. The aim of paper is to present a numerical algorithm based on the Monte Carlo integration and…
Approximate $p$-point Leibniz derivation formulas as well as interpolatory Simpson quadrature sums adapted to oscillatory functions are discussed. Both theoretical considerations and numerical evidence concerning the dependence of the…
We previously demonstrated near-field speckle scanning based x-ray imaging to be an easy-to-implement phase sensing method capable of providing both high sensitivity and high resolution. Yet, this performance combination could only be…
Software realization of the complex spectra decomposition on unknown number of similarcomponents is proposed.The algorithm is based on non-linear minimizing the sum of squared residuals of the spectrum model. For the adequacy checking the…
In this paper, we consider the problem of approximating the spectral distribution for a class of random operators over sofic groups. For this purpose, we make use of the concept of locally and empirically converging measures defined by…
The Bethe approximation, or loopy belief propagation algorithm is a successful method for approximating partition functions of probabilistic models associated with a graph. Chertkov and Chernyak derived an interesting formula called Loop…
Mega-pixel charge-integrating detectors are common in near-IR imaging applications. Optimal signal-to-noise ratio estimates of the photocurrents, which are particularly important in the low-signal regime, are produced by fitting linear…
The ESA Euclid mission will provide high-quality imaging for about 1.5 billion galaxies. A software pipeline to automatically process and analyse such a huge amount of data in real time is being developed by the Science Ground Segment of…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
The search for exoplanets is an active field in astronomy, with direct imaging as one of the most challenging methods due to faint exoplanet signals buried within stronger residual starlight. Successful detection requires advanced image…
A novel phase retrieval algorithm for broadband hyperspectral phase imaging from noisy intensity observations is proposed. It utilizes advantages of the Fourier Transform spectroscopy in the self-referencing optical setup and provides,…
Considered here is an efficient technique to compute approximate profiles of solitary wave solutions of fractional Korteweg-de Vries equations. The numerical method is based on a fixed-point iterative algorithm along with extrapolation…
This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…
In this work we develop a new algorithm for the efficient computation of the Voigt/complex error function. In particular, in this approach we propose a two-domain scheme where the number of the interpolation grid-points is dependent on the…
Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…