相关论文: Comments on the Voigt function implementation in t…

SAXSFit is a computer analysis program that has been developed to assist in the fitting of small-angle x-ray and neutron scattering spectra primarily from nanoparticles (nanopores). The fitting procedure yields the pore or particle size…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

High redshift sources suffer from magnification or demagnification due to weak gravitational lensing by large scale structure. One consequence of this is that the distance-redshift relation, in wide use for cosmological tests, suffers…

A new algorithm to calculate Coulomb wave functions with all of its arguments complex is proposed. For that purpose, standard methods such as continued fractions and power/asymptotic series are combined with direct integrations of the…

Probabilistic circuits (PCs) enable exact and tractable inference but employ data independent mixture weights that limit their ability to capture local geometry of the data manifold. We propose Voronoi tessellations (VT) as a natural way to…

The verification of many algorithms for calculating transcendental functions is based on polynomial approximations to these functions, often Taylor series approximations. However, computing and verifying approximations to the arctangent…

Astronomers are often confronted with funky populations and distributions of objects: brighter objects are more likely to be detected; targets are selected based on colour cuts; imperfect classification yields impure samples. Failing to…

We present a simple wavefront-like approach for computing multiplicatively weighted Voronoi diagrams of points and straight-line segments in the Euclidean plane. If the input sites may be assumed to be randomly weighted points then the use…

This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…

Recently a number of randomized 3/4-approximation algorithms for MAX SAT have been proposed that all work in the same way: given a fixed ordering of the variables, the algorithm makes a random assignment to each variable in sequence, in…

We use visible point vector identities to examine polylogarithms in the neighbourhood of the Riemann zeta function zeroes. New formulas limiting to the trivial zeroes and to the critical line on the zeta function are given. Similar results…

An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters. The predicate is first evaluated…

In this paper we introduce new estimators of the coefficient functions in the varying coefficient regression model. The proposed estimators are obtained by projecting the vector of the full-dimensional kernel-weighted local polynomial…

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…

One of the well-known problems of producing instruments for Extremely Large Telescopes is that their size (and hence cost) scales rapidly with telescope aperture. To try to break this relation alternative new technologies have been…

This paper addresses the minimization of a finite sum of prox-convex functions under Lipschitz continuity of each component. We propose two variants of the splitting proximal point algorithms proposed in \cite{Bacak,Bertsekas}: one…

We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find…

Current and future weak lensing surveys will rely on photometrically estimated redshifts of very large numbers of galaxies. In this paper, we address several different aspects of the demanding photo-z performance that will be required for…

Efficiently merging several models fine-tuned for different tasks, but stemming from the same pretrained base model, is of great practical interest. Despite extensive prior work, most evaluations of model merging in computer vision are…

We present a numerical weak-lensing analysis that is fully relativistic and non-perturbative for the scalar part of the gravitational potential and first-order in the vector part, frame dragging. Integrating the photon geodesics backwards…