default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Polizzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Dongming Li
, James Kestyn, Eric Polizzi:
A method of calculating bandstructure in real-space with application to all-electron and full potential. Comput. Phys. Commun. 295: 109014 (2024)- 2023
- [c4]Ivan Williams, Eric Polizzi:
Automatic Differentiation for Inverse Problems with Applications in Quantum Transport. HPEC 2023: 1-5 - [i14]Ivan Williams, Eric Polizzi:
Automatic Differentiation for Inverse Problems with Applications in Quantum Transport. CoRR abs/2307.09311 (2023) - 2020
- [j11]Braegan S. Spring, Eric Polizzi, Ahmed H. Sameh:
A Feature-complete SPIKE Dense Banded Solver. ACM Trans. Math. Softw. 46(4): 36:1-36:35 (2020) - [i13]Eric Polizzi:
FEAST Eigenvalue Solver v4.0 User Guide. CoRR abs/2002.04807 (2020) - [i12]Julien Brenneck, Eric Polizzi:
An Iterative Method for Contour-Based Nonlinear Eigensolvers. CoRR abs/2007.03000 (2020)
2010 – 2019
- 2018
- [j10]Brendan Gavin, Agnieszka Miedlar, Eric Polizzi:
FEAST eigensolver for nonlinear eigenvalue problems. J. Comput. Sci. 27: 107-117 (2018) - [j9]Brendan Gavin, Eric Polizzi:
Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves. Numer. Linear Algebra Appl. 25(5) (2018) - [j8]Vassilis Kalantzis, James Kestyn, Eric Polizzi, Yousef Saad:
Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems. Numer. Linear Algebra Appl. 25(5) (2018) - [i11]Brendan Gavin, Agnieszka Miedlar, Eric Polizzi:
FEAST Eigensolver for Nonlinear Eigenvalue Problems. CoRR abs/1801.09794 (2018) - [i10]Braegan S. Spring, Eric Polizzi, Ahmed H. Sameh:
A Feature Complete SPIKE Banded Algorithm and Solver. CoRR abs/1811.03559 (2018) - 2017
- [i9]Brendan Gavin, Eric Polizzi:
An improved Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves. CoRR abs/1706.00692 (2017) - 2016
- [j7]Edoardo Di Napoli, Eric Polizzi, Yousef Saad:
Efficient estimation of eigenvalue counts in an interval. Numer. Linear Algebra Appl. 23(4): 674-692 (2016) - [j6]James Kestyn, Eric Polizzi, Ping Tak Peter Tang:
Feast Eigensolver for Non-Hermitian Problems. SIAM J. Sci. Comput. 38(5) (2016) - [c3]Brendan Gavin, Eric Polizzi:
Enhancing the performance and robustness of the FEAST eigensolver. HPEC 2016: 1-6 - [c2]James Kestyn, Vasileios Kalantzis, Eric Polizzi, Yousef Saad:
PFEAST: a high performance sparse eigenvalue solver using distributed-memory linear solvers. SC 2016: 178-189 - [i8]Brendan Gavin, Eric Polizzi:
Enhancing the Performance and Robustness of the FEAST Eigensolver. CoRR abs/1605.08771 (2016) - 2015
- [j5]Stefan Güttel, Eric Polizzi, Ping Tak Peter Tang, Gautier Viaud:
Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver. SIAM J. Sci. Comput. 37(4) (2015) - [i7]James Kestyn, Eric Polizzi, Ping Tak Peter Tang:
FEAST Eigensolver for non-Hermitian Problems. CoRR abs/1506.04463 (2015) - 2014
- [j4]Ping Tak Peter Tang, Eric Polizzi:
FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection. SIAM J. Matrix Anal. Appl. 35(2): 354-390 (2014) - [c1]Ping Tak Peter Tang, James Kestyn, Eric Polizzi:
A new highly parallel non-Hermitian eigensolver. SpringSim (HPS) 2014: 1 - [i6]Ping Tak Peter Tang, James Kestyn, Eric Polizzi:
A New Highly Parallel Non-Hermitian Eigensolver. CoRR abs/1404.2891 (2014) - [i5]Stefan Güttel, Eric Polizzi, Ping Tak Peter Tang, Gautier Viaud:
Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver. CoRR abs/1407.8078 (2014) - 2013
- [i4]Ping Tak Peter Tang, Eric Polizzi:
Subspace Iteration with Approximate Spectral Projection. CoRR abs/1302.0432 (2013) - [i3]Edoardo Di Napoli, Eric Polizzi, Yousef Saad:
Efficient estimation of eigenvalue counts in an interval. CoRR abs/1308.4275 (2013) - 2012
- [j3]Alan R. Levin, Deyin Zhang, Eric Polizzi:
FEAST fundamental framework for electronic structure calculations: Reformulation and solution of the muffin-tin problem. Comput. Phys. Commun. 183(11): 2370-2375 (2012) - [p1]Kyle A. Gallivan, Efstratios Gallopoulos, Ananth Grama, Bernard Philippe, Eric Polizzi, Yousef Saad, Faisal Saied, Danny C. Sorensen:
Parallel Numerical Computing from Illiac IV to Exascale - The Contributions of Ahmed H. Sameh. High-Performance Scientific Computing 2012: 1-44 - [i2]Eric Polizzi:
A High-Performance Numerical Library for Solving Eigenvalue Problems: FEAST Solver v2.0 User's Guide. CoRR abs/1203.4031 (2012) - 2011
- [j2]Karan Mendiratta, Eric Polizzi:
A threaded SPIKE algorithm for solving general banded systems. Parallel Comput. 37(12): 733-741 (2011) - [r1]Eric Polizzi:
SPIKE. Encyclopedia of Parallel Computing 2011: 1912-1920
2000 – 2009
- 2009
- [i1]Eric Polizzi:
A Density Matrix-based Algorithm for Solving Eigenvalue Problems. CoRR abs/0901.2665 (2009) - 2006
- [j1]Eric Polizzi, Ahmed H. Sameh:
A parallel hybrid banded system solver: the SPIKE algorithm. Parallel Comput. 32(2): 177-194 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
