I recently upgraded to a “GeForce GT 640” graphics card, which have Nvidia chipsets. As explained in the two previous posts, I reinstalled the version 5.5 CUDA package from Nvidia. Now, I compiled the sample programs that come with CUDA 5.5, and tested matrix product computation performance on the GPU, or graphics card. I get… Continue reading GPU compute speed with Nvidia CUDA
Month: January 2014
More on Video drivers in Linux
I read some more about NVIDIA graphics drivers. I wanted to know why the workaround mentioned in my previous post worked, which was installing the CUDA package I downloaded about a month ago in order to get the X window System working again. After each boot-up or attempt to boot and run the X window… Continue reading More on Video drivers in Linux
Beware of changing graphics drivers in Linux …
I write this to relate my experience installing proprietary drivers, and updating graphics drivers or changing them, in Linux. Late in 2013, I installed NVIDIA’s CUDA package to use the GPU as form of “parallel processor” to be used with the CPU and an extension of the C language to enhance performance when computations benefit… Continue reading Beware of changing graphics drivers in Linux …
rho_1 of Riemann zeta to 99,998 decimals using PARI/gp
14.1347251417 3469379045 7251983562 4702707842 5711569924 3175685567 4601499634 2980925676 4949010393 1715610127 7920297154 8797436766 1426914698 8225458250 5363239447 1377804133 8123720597 0549621955 8658602005 5556672583 6010773700 2054109826 6150754278 0517442591 3062544819 7865107230 4938725629 7383215774 2039521572 5674809332 1400349904 6803434626 7314420920 3773854871 4137831735 6396995365 4281130796 8053149168 8529067820 8229804926 4338666734 6233200787 5876179200 5604868054 3568014444 2465106559 7568665903 2286865105 4485944432 0624072727 0320942745 2221304874 8720924123 8514183514 6054279015… Continue reading rho_1 of Riemann zeta to 99,998 decimals using PARI/gp
Experimenting with Euler-McLaurin summation for zeta, Update
When using the Euler-MacLaurin formula to compute the zeta function along the critical line to very high precision, I’ve found that using the analytic expression for the Bernoulli numbers does save time for the term involving the Bernoulli numbers. So, in my computations of zeta near the first non-trivial zeta zero, the lion’s share of… Continue reading Experimenting with Euler-McLaurin summation for zeta, Update
The FFTW library (Discrete Fourier Transform)
This week, I built from source code a discrete Fast Fourier Transform library known as “The Fastest Fourier Transform in the West”, or FFTW for short. This library can be used along with the GCC C or Fortran compilers on many operating systems and architectures to compute the Discrete Fourier Transform. I tested it with… Continue reading The FFTW library (Discrete Fourier Transform)
Experimenting with Euler-McLaurin summation for zeta function
If we look at MathWorld at the page for the Bernoulli numbers, we find one analytic formula for the even Bernoulli numbers (eqn. 41 or 42). I’ve been using this analytic expression in formula 1 of Section 6.4 of Edwards’ book on the Riemann zeta function. I can do this with PARI/gp. One term that… Continue reading Experimenting with Euler-McLaurin summation for zeta function