缩放比例
线性比例尺
基准集
基础(线性代数)
集合(抽象数据类型)
基质(化学分析)
Atom(片上系统)
多维标度
计算机科学
算法
数学
物理
化学
量子力学
分子
并行计算
几何学
色谱法
机器学习
大地测量学
程序设计语言
地理
作者
Chandra Saravanan,Yihan Shao,Roi Baer,Philip N. Ross,Martin Head‐Gordon
摘要
A sparse matrix multiplication scheme with multiatom blocks is reported, a tool that can be very useful for developing linear-scaling methods with atom-centered basis functions. Compared to conventional element-by-element sparse matrix multiplication schemes, efficiency is gained by the use of the highly optimized basic linear algebra subroutines (BLAS). However, some sparsity is lost in the multiatom blocking scheme because these matrix blocks will in general contain negligible elements. As a result, an optimal block size that minimizes the CPU time by balancing these two effects is recovered. In calculations on linear alkanes, polyglycines, estane polymers, and water clusters the optimal block size is found to be between 40 and 100 basis functions, where about 55-75% of the machine peak performance was achieved on an IBM RS6000 workstation. In these calculations, the blocked sparse matrix multiplications can be 10 times faster than a standard element-by-element sparse matrix package.
科研通智能强力驱动
Strongly Powered by AbleSci AI