A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport

DOI10.1016/j.cpc.2016.05.015zbMath1380.65481arXiv1606.01139OpenAlexW2416223669MaRDI QIDQ1682668

Yunkai Zhou, Baruch Feldman

Publication date: 5 December 2017

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01139

zbMATH Keywords

parallel computingeigensolutionelectronic structurehigh-performance computingelectronic transportshift-invert

Mathematics Subject Classification ID

Related Items (1)

TRANSEC

Uses Software

• PETSc
• ARPACK
• CSparse
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Self-consistent-field calculations using Chebyshev-filtered subspace iteration
• On a conjugate gradient-type method for solving complex symmetric linear systems
• Preconditioning techniques for large linear systems: A survey
• A spectrum slicing method for the Kohn-Sham problem
• Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
• Approximating Spectral Densities of Large Matrices
• Efficient estimation of eigenvalue counts in an interval
• Implicitly restarted Arnoldi with purification for the shift-invert transformation
• Direct Methods for Sparse Linear Systems
• SIPs
• Implementation of the lanczos method for structural vibration analysis on a parallel computer
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
• ARPACK Users' Guide

This page was built for publication: A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport