Meiyue Shao
YOU?
Author Swipe
View article: Mixed Precision Iterative Refinement for Least Squares With Linear Equality Constraints and Generalized Least Squares Problems
Mixed Precision Iterative Refinement for Least Squares With Linear Equality Constraints and Generalized Least Squares Problems Open
Recent development on mixed precision techniques has largely enhanced the performance of various linear algebra solvers, one of which is the solver for the least squares problem. By transforming least squares problems into augmented linear…
View article: A Mixed Precision Jacobi SVD Algorithm
A Mixed Precision Jacobi SVD Algorithm Open
We propose a mixed precision Jacobi algorithm for computing the singular value decomposition (SVD) of a dense matrix. After appropriate preconditioning, the proposed algorithm computes the SVD in a lower precision as an initial guess and t…
View article: On a shrink-and-expand technique for symmetric block eigensolvers
On a shrink-and-expand technique for symmetric block eigensolvers Open
In symmetric block eigenvalue algorithms, such as the subspace iteration algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm, a large block size is often employed to achieve robustness and rapid con…
View article: Mixed precision iterative refinement for least squares with linear equality constraints and generalized least squares problems
Mixed precision iterative refinement for least squares with linear equality constraints and generalized least squares problems Open
Recent development on mixed precision techniques has largely enhanced the performance of various linear algebra solvers, one of which being the solver for the least squares problem $\min_{x}\lVert b-Ax\rVert_{2}$. By transforming least squ…
View article: A fast low-rank inversion algorithm of dielectric matrix in GW approximation
A fast low-rank inversion algorithm of dielectric matrix in GW approximation Open
The dielectric response function and its inverse are crucial physical quantities in materials science. We propose an accurate and efficient strategy to invert the dielectric function matrix. The GW approximation, a powerful approach to acc…
View article: A Contour Integral-Based Algorithm for Computing Generalized Singular Values
A Contour Integral-Based Algorithm for Computing Generalized Singular Values Open
We propose a contour integral-based algorithm for computing a few singular values of a matrix or a few generalized singular values of a matrix pencil. Mathematically, the generalized singular values of a matrix pencil are the eigenvalues o…
View article: A mixed precision LOBPCG algorithm
A mixed precision LOBPCG algorithm Open
The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positivedefinite matrix A . In this work,…
View article: A mixed precision LOBPCG algorithm
A mixed precision LOBPCG algorithm Open
The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A. In this work,…
View article: A mixed precision Jacobi SVD algorithm
A mixed precision Jacobi SVD algorithm Open
We propose a mixed precision Jacobi algorithm for computing the singular value decomposition (SVD) of a dense matrix. After appropriate preconditioning, the proposed algorithm computes the SVD in a lower precision as an initial guess, and …
View article: Householder orthogonalization with a non-standard inner product
Householder orthogonalization with a non-standard inner product Open
Householder orthogonalization plays an important role in numerical linear algebra. It attains perfect orthogonality regardless of the conditioning of the input. However, in the context of a non-standard inner product, it becomes difficult …
View article: Ab Initio No Core Shell Model with Leadership-Class Supercomputers
Ab Initio No Core Shell Model with Leadership-Class Supercomputers Open
Nuclear structure and reaction theory is undergoing a major renaissance with advances in many-body methods, strong interactions with greatly improved links to Quantum Chromodynamics (QCD), the advent of high performance computing, and impr…
View article: Accelerating Optical Absorption Spectra and Exciton Energy Computation for Nanosystems via Interpolative Separable Density Fitting
Accelerating Optical Absorption Spectra and Exciton Energy Computation for Nanosystems via Interpolative Separable Density Fitting Open
We present an efficient way to solve the Bethe-Salpeter equation (BSE), a model for the computation of absorption spectra in molecules and solids that includes electron-hole excitations. Standard approaches to construct and diagonalize the…
View article: A Robust and Efficient Implementation of LOBPCG
A Robust and Efficient Implementation of LOBPCG Open
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is widely\nused to compute eigenvalues of large sparse symmetric matrices. The algorithm\ncan suffer from numerical instability if it is not implemented with care. This\nis e…
View article: Accelerating Optical Absorption Spectra and Exciton Energy Computation via Interpolative Separable Density Fitting
Accelerating Optical Absorption Spectra and Exciton Energy Computation via Interpolative Separable Density Fitting Open
View article: A Structure Preserving Lanczos Algorithm for Computing the Optical Absorption Spectrum
A Structure Preserving Lanczos Algorithm for Computing the Optical Absorption Spectrum Open
We present a new structure preserving Lanczos algorithm for approximating the optical absorption spectrum in the context of solving full Bethe-Salpeter equation without Tamm-Dancoff approximation. The new algorithm is based on a structure …
View article: Properties of Definite Bethe–Salpeter Eigenvalue Problems
Properties of Definite Bethe–Salpeter Eigenvalue Problems Open
View article: BSEPACK User's Guide
BSEPACK User's Guide Open
This is the user manual for the software package BSEPACK (Bethe--Salpeter Eigenvalue Solver Package).
View article: A structure preserving Lanczos algorithm for computing the optical absorption spectrum
A structure preserving Lanczos algorithm for computing the optical absorption spectrum Open
We present a new structure preserving Lanczos algorithm for approximating the optical absorption spectrum in the context of solving full Bethe-Salpeter equation without Tamm-Dancoff approximation. The new algorithm is based on a structure …
View article: molgw 1: Many-body perturbation theory software for atoms, molecules, and clusters
molgw 1: Many-body perturbation theory software for atoms, molecules, and clusters Open
View article: Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT
Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT Open
We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the produ…
View article: Structure preserving parallel algorithms for solving the Bethe–Salpeter eigenvalue problem
Structure preserving parallel algorithms for solving the Bethe–Salpeter eigenvalue problem Open
View article: Development of the FHR advanced natural circulation analysis (Fancy) code
Development of the FHR advanced natural circulation analysis (Fancy) code Open
The University of California, Berkeley (UCB) is performing thermal hydraulics safety analysis to develop the technical basis for design and licensing of fluoride-salt-cooled, high-temperature reactors (FHRs). FHR designs investigated by UC…