Results 161 to 170 of about 1,836,247 (186)

An accurate computation of the hypergeometric distribution function

ACM Transactions on Mathematical Software, 1993
The computation of the cumulative hypergeometric distribution function is of interest to many researchers who are working in the computational sciences and related areas. Presented here is a new method for computing this function that applies prime number factorization to the factorials.
openaire   +2 more sources

Accurate Computation of Zernike Moments in Polar Coordinates

IEEE Transactions on Image Processing, 2007
An algorithm for high-precision numerical computation of Zernike moments is presented. The algorithm, based on the introduced polar pixel tiling scheme, does not exhibit the geometric error and numerical integration error which are inherent in conventional methods based on Cartesian coordinates. This yields a dramatic improvement of the Zernike moments
Yongqing Xin, Miroslaw Pawlak, Simon X. Liao   +2 more
openaire   +3 more sources

Accurate Computation of the Fundamental Matrix of a Markov Chain

SIAM Journal on Matrix Analysis and Applications, 1995
Summary: Associated with every stochastic matrix is another matrix called the fundamental matrix. The fundamental matrix can be used to obtain mean first-passage-times and other interesting operating characteristics. The fundamental matrix is defined as a matrix inverse, and computing it from the definition can be fraught with numerical errors.
openaire   +2 more sources

Accurately Computing the Shape of Sandpiles

2006
Using an Eikonal formulation, we model the surface of sandpiles formed in regions containing obstacles. The fast marching method is adapted to have the optimal rate of convergence. We also apply the fast marching method to an industrial problem.
Christopher M. Kuster, Pierre A. Gremaud
openaire   +1 more source

Computing accurate Poincaré maps

Physica D: Nonlinear Phenomena, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Accurate and Reliable Computing in Floating-Point Arithmetic

2010
Methods will be discussed on how to compute accurate and reliable results in pure floating-point arithmetic. In particular, verification methods with INTLAB and error-free transformations will be presented in some detail.
openaire   +1 more source

Efficient perspective-accurate silhouette computation

Proceedings of the fifteenth annual symposium on Computational geometry, 1999
Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar 0001, Mihai Pop   +4 more
openaire   +1 more source

Accurate and efficient computations with Wronskian matrices of Bernstein and related bases

Numerical Linear Algebra With Applications, 2022
Beatriz Rubio-Serrano, Esmeralda Mainar, Juan Manuel Pena   +2 more
exaly  

Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases

Revista De La Real Academia De Ciencias Exactas, Fisicas Y Naturales - Serie A: Matematicas, 2022
Beatriz Rubio-Serrano, Esmeralda Mainar, Juan Manuel Pena   +2 more
exaly  

Computing the Motion of the Moon Accurately

1995
The difficulties which one encounters in calculating the motion of the moon are typical for an entire class of problems where the solution is found approximately with the help of Poisson series. On the one side these difficulties are of a practical nature and have to do with the large number of terms which one has to manipulate. On the other side these
openaire   +1 more source