Massively parallel sparse matrix function calculations with NTPoly
From MaRDI portal
Publication:6155393
DOI10.1016/j.cpc.2017.12.010zbMath1524.65192OpenAlexW2781204135MaRDI QIDQ6155393
William Dawson, Takahito Nakajima
Publication date: 12 June 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2017.12.010
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items
Sparse approximate matrix-matrix multiplication for density matrix purification with error control ⋮ ELSI -- an open infrastructure for electronic structure solvers ⋮ Efficient parallel linear scaling method to get the response density matrix in all-electron real-space density-functional perturbation theory ⋮ GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and Hermitian eigenproblems ⋮ Numerical methods for Kohn–Sham density functional theory ⋮ Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure
Cites Work
- \texttt{NWChem}: a comprehensive and scalable open-source solution for large scale molecular simulations
- Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
- Rational approximations of trigonometric matrices with application to second-order systems of differential equations
- Bounds for the entries of matrix functions with applications to preconditioning
- Computing the matrix cosine
- A general parallel sparse-blocked matrix multiply for linear scaling SCF theory
- Communication lower bounds for distributed-memory matrix multiplication
- Spectral quadrature method for accurate \(\mathcal{O}(N)\) electronic structure calculations of metals and insulators
- Testing Matrix Function Algorithms Using Identities
- Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
- Exponential integrators
- Parallel Matrix Multiplication: A Systematic Journey
- A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
- Some Recent Advances in Density Matrix Theory
- Decay Rates for Inverses of Band Matrices
- An Algorithm for Computing the Matrix Cosine
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- ScaLAPACK Users' Guide
- Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications
- Collective dynamics of ‘small-world’ networks
- Functions of Matrices
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Parallel sparse matrix multiplication for linear scaling electronic structure calculations
