Hierarchical matrix computations have attracted significant attention in the science and engineering community as exploiting data-sparse structures can significantly reduce the computational complexity of many important kernels. One particularly popular option within this class is the Hierarchical Off-Diagonal Low-Rank (HODLR) format. In this paper, we show that the off-diagonal blocks of HODLR matrices that are approximated by low-rank matrices can be represented in low precision without degenerating the quality of the overall approximation (with the error growth bounded by a factor of $2$). We also present an adaptive-precision scheme for constructing and storing HODLR matrices, and we prove that the use of mixed precision does not compromise the numerical stability of the resulting HODLR matrix--vector product and LU factorization. That is, the resulting error in these computations is not significantly greater than the case where we use one precision (say, double) for constructing and storing the HODLR matrix. Our analyses further give insight on how one must choose the working precision in HODLR matrix computations relative to the approximation error in order to not observe the effects of finite precision. Intuitively, when a HODLR matrix is subject to a high degree of approximation error, subsequent computations can be performed in a lower precision without detriment. We demonstrate the validity of our theoretical results through a range of numerical experiments.
A fast spectral divide-and-conquer method for banded matrices
基于Nakatsukasa和Higham的谱分治算法[SIAM J. Sci.计算:35(3):A1325-A1349,2013],我们提出了一种计算对称带状矩阵的所有特征值和特征向量的新算法。为了这个目的,我们结合我们以前的工作在所谓的HODLR格式的光谱投影仪的快速计算,与一种新的技术,用于提取这样的HODLR矩阵的范围的基础。数值实验表明,我们的算法具有准线性复杂度,并允许方便地处理大规模矩阵。
A fast direct solver based neural network for solving PDEs
Department of Computer Science & Engineering, International Institute of Information Technology Bangalore (IIIT-B), India(计算机科学与工程系,国际信息学院班加罗尔(IIIT-B),印度);Department of Data Science and Artificial Intelligence, International Institute of Information Technology Bangalore (IIIT-B), India(数据科学与人工智能系,国际信息学院班加罗尔(IIIT-B),印度)
Mixed-Precision Performance Portability of FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices
Oden Institute, The University of Texas at Austin(德克萨斯大学奥斯汀分校奥登研究所);Advanced Micro Devices, Inc.(超威半导体公司);Oden Institute, Walker Department of Mechanical Engineering(德克萨斯大学奥斯汀分校奥登研究所沃克机械工程系);The University of Texas at Austin(德克萨斯大学奥斯汀分校)