Existence and Non-existence of Positive Solutions for a Discrete Fractional Boundary Value Problem

In this work, we deal with two-point boundary problem for a finite nabla fractional difference equation. First, we establish an associated Green''s function and state some of its properties. Under suitable conditions, we deduce the existence and non-existence of positive solutions to the considered problem. Finally, we construct a few examples to illustrate the established results.     

Low-temperature Thermoluminescence Glow Curves in NaCl Crystals Doped with Yttrium

Thermoluminescence glow curves were recorded in undoped and yttrium-doped NaCl crystals X-irradiated at liquid nitrogen temperature (LNT). An attempt is made to assign the glow peaks observed to different centres such as V_k-centres and yttrium related centres etc.     

Efficient algorithms for computing rank-revealing factorizations on a GPU

Standard rank-revealing factorizations such as the singular value decomposition (SVD) and column pivoted QR factorization are challenging to implement efficiently on a GPU. A major difficulty in this regard is the inability of standard algorithms to cast most operations in terms of the Level-3 BLAS. This article presents two alternative algorithms for computing a rank-revealing factorization of the form $\mathsf{A}=\mathsf{U}\mathsf{T}{\mathsf{V}}^{\ast }$, where $\mathsf{U}$ and $\mathsf{V}$ are orthogonal and $\mathsf{T}$ is trapezoidal (or triangular if $\mathsf{A}$ is square). Both algorithms use randomized projection techniques to cast most of the flops in terms of matrix-matrix multiplication, which is exceptionally efficient on the GPU. Numerical experiments illustrate that these algorithms achieve significant acceleration over finely tuned GPU implementations of the SVD while providing low rank approximation errors close to that of the SVD.