Eric Polizzi
YOU?
Author Swipe
View article: Low‐Rank SPIKE Framework for Solving Large Sparse Linear Systems With Applications
Low‐Rank SPIKE Framework for Solving Large Sparse Linear Systems With Applications Open
The SPIKE family of linear system solvers provides parallelism using a block tridiagonal partitioning. Typically SPIKE‐based solvers are applied to banded systems, resulting in structured off‐diagonal blocks with nonzeros elements restrict…
View article: Low-Rank SPIKE Framework for Solving Large Sparse Linear Systems with Applications
Low-Rank SPIKE Framework for Solving Large Sparse Linear Systems with Applications Open
The SPIKE family of linear system solvers provides parallelism using a block tridiagonal partitioning. Typically SPIKE-based solvers are applied to banded systems, resulting in structured off-diagonal blocks with non-zeros elements restric…
View article: One-dimensional Plasmons and Hybridized Coupled Polaritons in Carbon Nanotubes
One-dimensional Plasmons and Hybridized Coupled Polaritons in Carbon Nanotubes Open
This paper presents real-time time-dependent density functional theory (TDDFT) ab-initio simulations of selected armchair carbon nanotubes (CNTs). By scaling the lengths of CNTs, we provide a comprehensive analysis of the Tomonaga-Luttinge…
View article: FEAST nonlinear eigenvalue algorithm for $GW$ quasiparticle equations
FEAST nonlinear eigenvalue algorithm for $GW$ quasiparticle equations Open
The use of Green's function in quantum many-body theory often leads to nonlinear eigenvalue problems, as Green's function needs to be defined in energy domain. The $GW$ approximation method is one of the typical examples. In this article, …
View article: A method of calculating bandstructure in real-space with application to all-electron and full potential
A method of calculating bandstructure in real-space with application to all-electron and full potential Open
We introduce a practical and efficient approach for calculating the all-electron full potential bandstructure in real space, employing a finite element basis. As an alternative to the k-space method, the method involves the self-consistent…
View article: Automatic Differentiation for Inverse Problems with Applications in Quantum Transport
Automatic Differentiation for Inverse Problems with Applications in Quantum Transport Open
A neural solver and differentiable simulation of the quantum transmitting boundary model is presented for the inverse quantum transport problem. The neural solver is used to engineer continuous transmission properties and the differentiabl…
View article: From Fundamental First-Principle Calculations to Nanoengineering Applications: A Review of the NESSIE Project
From Fundamental First-Principle Calculations to Nanoengineering Applications: A Review of the NESSIE Project Open
This paper outlines how modern first-principle calculations can adequately address the needs for ever higher levels of numerical accuracy and high-performance in large-scale electronic structure simulations, and pioneer the fundamental stu…
View article: An Iterative Method for Contour-Based Nonlinear Eigensolvers
An Iterative Method for Contour-Based Nonlinear Eigensolvers Open
Contour integration techniques have become a popular choice for solving the linear and non-linear eigenvalue problems. They principally include the Sakurai-Sugiura methods, the Beyn's algorithm, the FEAST/NLFEAST algorithms and other ratio…
View article: FEAST Eigenvalue Solver v4.0 User Guide
FEAST Eigenvalue Solver v4.0 User Guide Open
The FEAST library package represents an unified framework for solving various family of eigenvalue problems and achieving accuracy, robustness, high-performance and scalability on parallel architectures. Its originality lies with a new tra…
View article: A Feature Complete SPIKE Banded Algorithm and Solver
A Feature Complete SPIKE Banded Algorithm and Solver Open
New features and enhancements for the SPIKE banded solver are presented. Among all the SPIKE algorithm versions, we focus our attention on the recursive SPIKE technique which provides the best trade-off between generality and parallel effi…
View article: Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems
Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems Open
Summary This paper discusses techniques for computing a few selected eigenvalue–eigenvector pairs of large and sparse symmetric matrices. A recently developed class of techniques to solve this type of problems is based on integrating the m…
View article: An improved Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves
An improved Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves Open
The FEAST eigenvalue algorithm is a subspace iteration algorithm that uses contour integration in the complex plane to obtain the eigenvectors of a matrix for the eigenvalues that are located in any user-defined search interval. By computi…
View article: Enhancing the performance and robustness of the FEAST eigensolver
Enhancing the performance and robustness of the FEAST eigensolver Open
The FEAST algorithm is a subspace iteration method that uses a spectral projector as a rational filter in order to efficiently solve interior eigenvalue problems in parallel. Although the solutions from the FEAST algorithm converge rapidly…
View article: Feast Eigensolver for Non-Hermitian Problems
Feast Eigensolver for Non-Hermitian Problems Open
A detailed new upgrade of the FEAST eigensolver targeting non-Hermitian eigenvalue problems is presented and thoroughly discussed. It aims at broadening the class of eigenproblems that can be addressed within the framework of the FEAST alg…