default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeiyue Shao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Yuqi Liu, Xinyu Shan, Meiyue Shao:
A Contour Integral-Based Algorithm for Computing Generalized Singular Values. CoRR abs/2401.00121 (2024)- [i9]Zhengbang Zhou, Huanhuan Ma, Wentiao Wu, Weiguo Gao, Jinlong Yang, Meiyue Shao, Wei Hu:
A fast low-rank inversion algorithm of dielectric matrix in GW approximation. CoRR abs/2403.12340 (2024) - [i8]Yuqi Liu, Jose E. Roman, Meiyue Shao:
Improving performance of contour integral-based nonlinear eigensolvers with infinite GMRES. CoRR abs/2403.19309 (2024) - [i7]Bowen Gao, Yuxin Ma, Meiyue Shao:
Mixed precision iterative refinement for least squares with linear equality constraints and generalized least squares problems. CoRR abs/2406.16499 (2024) - [i6]Yuqi Liu, Yuxin Ma, Meiyue Shao:
On a shrink-and-expand technique for block eigensolvers. CoRR abs/2409.05572 (2024) - 2023
- [j13]Daniel Kressner, Yuxin Ma
, Meiyue Shao:
A mixed precision LOBPCG algorithm. Numer. Algorithms 94(4): 1653-1671 (2023) - [j12]Meiyue Shao:
Householder Orthogonalization with a Nonstandard Inner Product. SIAM J. Matrix Anal. Appl. 44(2): 481-502 (2023) - [c4]Meiyue Shao, Dossay Oryspayev, Chao Yang, Pieter Maris, Brandon G. Cook:
Fault-Tolerant LOBPCG for Nuclear CI Calculations. HPC Asia 2023: 88-95 - [i5]Daniel Kressner, Yuxin Ma, Meiyue Shao:
A mixed precision LOBPCG algorithm. CoRR abs/2302.12528 (2023) - 2022
- [i4]Weiguo Gao, Yuxin Ma, Meiyue Shao:
A mixed precision Jacobi SVD algorithm. CoRR abs/2209.04626 (2022) - 2021
- [i3]Meiyue Shao:
Householder orthogonalization with a non-standard inner product. CoRR abs/2104.04180 (2021)
2010 – 2019
- 2018
- [j11]Meiyue Shao, Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver. Comput. Phys. Commun. 222: 1-13 (2018) - [j10]Meiyue Shao, Felipe H. da Jornada, Lin Lin, Chao Yang, Jack Deslippe, Steven G. Louie:
A Structure Preserving Lanczos Algorithm for Computing the Optical Absorption Spectrum. SIAM J. Matrix Anal. Appl. 39(2): 683-711 (2018) - [j9]Jed A. Duersch, Meiyue Shao, Chao Yang, Ming Gu:
A Robust and Efficient Implementation of LOBPCG. SIAM J. Sci. Comput. 40(5): C655-C676 (2018) - [c3]Wei Hu, Meiyue Shao, Andrea Cepellotti, Felipe H. da Jornada, Lin Lin, Kyle Thicke, Chao Yang, Steven G. Louie:
Accelerating Optical Absorption Spectra and Exciton Energy Computation via Interpolative Separable Density Fitting. ICCS (2) 2018: 604-617 - 2017
- [j8]Eugene Vecharynski, Jiri Brabec, Meiyue Shao, Niranjan Govind, Chao Yang:
Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory. Comput. Phys. Commun. 221: 42-52 (2017) - [j7]Hasan Metin Aktulga, Md. Afibuzzaman, Samuel Williams, Aydin Buluç, Meiyue Shao, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations. IEEE Trans. Parallel Distributed Syst. 28(6): 1550-1563 (2017) - 2016
- [j6]Fabien Bruneval, Tonatiuh Rangel, Samia M. Hamed, Meiyue Shao, Chao Yang, Jeffrey B. Neaton:
molgw 1: Many-body perturbation theory software for atoms, molecules, and clusters. Comput. Phys. Commun. 208: 149-161 (2016) - [c2]Brandon Cook, Pieter Maris, Meiyue Shao, Nathan Wichmann, Marcus Wagner, John O'Neill, Thanh Phung, Gaurav Bansal:
High Performance Optimizations for Nuclear Physics Code MFDn on KNL. ISC Workshops 2016: 366-377 - [i2]Meiyue Shao, Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
Accelerating Nuclear Configuration Interaction Calculations through a Preconditioned Block Iterative Eigensolver. CoRR abs/1609.01689 (2016) - [i1]Meiyue Shao, Chao Yang:
BSEPACK User's Guide. CoRR abs/1612.07848 (2016) - 2015
- [j5]Robert A. Granat, Bo Kågström, Daniel Kressner, Meiyue Shao:
Algorithm 953: Parallel Library Software for the Multishift QR Algorithm with Aggressive Early Deflation. ACM Trans. Math. Softw. 41(4): 29:1-29:23 (2015) - 2014
- [j4]Daniel Kressner, Marija Miloloza Pandur, Meiyue Shao:
An indefinite variant of LOBPCG for definite matrix pencils. Numer. Algorithms 66(4): 681-703 (2014) - [j3]Meiyue Shao, Weiguo Gao, Jungong Xue:
Aggressively Truncated Taylor Series Method for Accurate Computation of Exponentials of Essentially Nonnegative Matrices. SIAM J. Matrix Anal. Appl. 35(2): 317-338 (2014) - 2011
- [j2]Xiaoye S. Li, Meiyue Shao:
A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting. ACM Trans. Math. Softw. 37(4): 43:1-43:20 (2011) - [r1]Xiaoye Sherry Li, James Demmel, John R. Gilbert, Laura Grigori, Meiyue Shao:
SuperLU. Encyclopedia of Parallel Computing 2011: 1955-1962 - 2010
- [j1]Meiyue Shao, Weiguo Gao, Yunxin Zhang:
Robust projection method for Fredholm integral equation of the second kind. Int. J. Comput. Math. 87(15): 3455-3466 (2010) - [c1]Bo Kågström, Daniel Kressner, Meiyue Shao:
On Aggressive Early Deflation in Parallel Variants of the QR Algorithm. PARA (1) 2010: 1-10
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-10 22:16 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:
