Emerging quantum computing algorithms for quantum chemistry
Digital quantum computers provide a computational framework for solving the Schrödinger
equation for a variety of many‐particle systems. Quantum computing algorithms for the …
equation for a variety of many‐particle systems. Quantum computing algorithms for the …
PARSEC–the pseudopotential algorithm for real‐space electronic structure calculations: recent advances and novel applications to nano‐structures
We describe the formalism, as well as numerical and implementation issues behind
PARSEC–the pseudopotential algorithm for real‐space electronic structure calculations. Its …
PARSEC–the pseudopotential algorithm for real‐space electronic structure calculations. Its …
QuantumATK: an integrated platform of electronic and atomic-scale modelling tools
S Smidstrup, T Markussen… - Journal of Physics …, 2019 - iopscience.iop.org
QuantumATK is an integrated set of atomic-scale modelling tools developed since 2003 by
professional software engineers in collaboration with academic researchers. While different …
professional software engineers in collaboration with academic researchers. While different …
[图书][B] Numerical methods for large eigenvalue problems: revised edition
Y Saad - 2011 - SIAM
This is a revised edition of a book which appeared close to two decades ago. Someone
scrutinizing how the field has evolved in these two decades will make two interesting …
scrutinizing how the field has evolved in these two decades will make two interesting …
Partitioning sparse matrices with eigenvectors of graphs
The problem of computing a small vertex separator in a graph arises in the context of
computing a good ordering for the parallel factorization of sparse, symmetric matrices. An …
computing a good ordering for the parallel factorization of sparse, symmetric matrices. An …
[HTML][HTML] The ubiquitous Kronecker product
CF Van Loan - Journal of computational and applied mathematics, 2000 - Elsevier
The Kronecker product has a rich and very pleasing algebra that supports a wide range of
fast, elegant, and practical algorithms. Several trends in scientific computing suggest that …
fast, elegant, and practical algorithms. Several trends in scientific computing suggest that …
[图书][B] Templates for the solution of algebraic eigenvalue problems: a practical guide
In many large scale scientific or engineering computations, ranging from computing the
frequency response of a circuit to the earthquake response of a buildingto the energy levels …
frequency response of a circuit to the earthquake response of a buildingto the energy levels …
[图书][B] Krylov projection methods for model reduction
EJ Grimme - 1997 - search.proquest.com
This dissertation focuses on efficiently forming reduced-order models for large, linear
dynamic systems. Projections onto unions of Krylov subspaces lead to a class of reduced …
dynamic systems. Projections onto unions of Krylov subspaces lead to a class of reduced …
A Jacobi--Davidson iteration method for linear eigenvalue problems
GLG Sleijpen, HA Van der Vorst - SIAM review, 2000 - SIAM
In this paper we propose a new method for the iterative computation of a few of the extremal
eigenvalues of a symmetric matrix and their associated eigenvectors. The method is based …
eigenvalues of a symmetric matrix and their associated eigenvectors. The method is based …
[HTML][HTML] Eigenvalue computation in the 20th century
GH Golub, HA Van der Vorst - Journal of Computational and Applied …, 2000 - Elsevier
This paper sketches the main research developments in the area of computational methods
for eigenvalue problems during the 20th century. The earliest of such methods dates back to …
for eigenvalue problems during the 20th century. The earliest of such methods dates back to …