In this paper, we introduce a new column selection strategy, named here “Deviation Maximization”, and apply it to compute rank-revealing QR factorizations as an alternative to the well-known block version of the QR factorization with the column pivoting method, called QP3 and currently implemented in LAPACK’s routine. We show that the resulting algorithm, named QRDM, has similar rank-revealing properties of QP3 and better execution times. We present experimental results on a wide data set of numerically singular matrices, which has become a reference in the recent literature.
We provide a numerical package for the computation of a d-variate near G-optimal polynomial regression design of degree m on a finite design space , by few iterations of a basic multiplicative algorithm followed by Tchakaloff-like compression of the discrete measure keeping the reached G-efficiency, via an accelerated version of the Lawson-Hanson algorithm for Non-Negative Least Squares (NNLS) problems. This package can solve on a personal computer large-scale problems where is up to – , being . Several numerical tests are presented on complex shapes in and on hypercubes in .
The world’s largest particle accelerator, located at CERN, produces petabytes of data that need to be analysed efficiently, to study the fundamental structures of our universe. ROOT RDataFrame is an open-source C++ data analysis interface, developed for this purpose. With the increasing heterogeneity in computing facilities, it becomes crucial to efficiently support GPGPUs. In this work, we describe our prototyped CUDA implementation and its migration to SYCL, focusing on a core high-energy physics (HEP) operation in RDataFrame – histogramming. In addition, we provide a comparative performance analysis of two SYCL compilers (AdaptiveCpp and DPC++) against the reference CUDA implementation.
14 November 2018 in Computers & Mathematics with Applications