Within the last year
Within the past 3 years
1 - 10 of 11 articles
Let 0← p ←1 be given and let F be the cumulative distribution function of the F -Distribution with ( M, N, ) degrees of freedom. This FORTRAN 77 routine is a complement to 1 where a method was presented to find the inverse of the F -Distribution function, FINV( M, N, P ), using a series...
An implementation of approximations for Fresnel integrals and associated functions is described. The approximations were originally developed by W. J. Cody, but a Fortran implementation using them has not previously been published.
Let 0 ≤ 1 and F be the cumulative distribution function (cdf) of the F -Distribution. We wish to find x p such that F(x p |n 1 , n 2 ) = p , where n 1 and n 2 are the degrees of freedom. Traditionally, x p is found using a numerical root-finding method, such as Newton's method. In this paper, a...
This paper describes C programs for the support functions copysign(x,y), logb(x), scalb(x,n), nextafter(x,y), finite(x), and isnan(x) recommended in the Appendix to the IEEE Standard for Binary Floating-Point Arithmetic. In the case of logb , the modified definition given in the later IEEE...
Up to now, all known efficient portable implementations of linear congruential random number generators with modulus 2 31 – 1 have worked only with multipliers that are small compared with the modulus. We show that for nonuniform distributions, the rejection method may generate random numbers...
In this paper we present a new binary-programming formulation for the Steiner problem in graphs (SPG), which is well known to be NP-hard. We use this formulation to generate test problems with known optimal solutions. The technique uses the KKT optimality conditions on the corresponding...
A number of algorithms involving Markov chains contain no subtractions. This property makes the analysis of rounding errors particularly simple. To show this, some principles for analyzing the propagation and generation of rounding errors in algorithms containing no subtraction are discussed...
An implementation of a method for numerical multiple integration based on a sequence of imbedded lattice rules is given. Besides yielding an approximation to the integral, this implementation also provides an error estimate which does not require much extra computation. The results of some...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.