Yunkai Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yunkai Zhou has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Aihui Zhou
Academy of Mathematics and Systems Science SKLMS Chinese Academy of Sciences 100190 Beijing China
2 shared publications James R. Chelikowsky
Department of Computer Science & Engineering ) Center for Computational Materials University of Minnesota 55455 Minneapolis MN USA
2 shared publicationsMurilo L. Tiago
Department of Computer Science & Engineering ) Center for Computational Materials University of Minnesota 55455 Minneapolis MN USA
2 shared publicationsYousef Saad
Department of Mathematics Southern Methodist University 75275 Dallas TX USA
2 shared publications- Yousef Saad
University of Minnesota, Minneapolis, MN, USA
2 shared publications - Alexey T. Zayak
Department of Physics and Astronomy, Center for Photochemical Sciences, Bowling Green State University, Bowling Green, Ohio 43403, United States
1 shared publication
Latest Publications
- 29 March 2026
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 42, 279-293
Generalizing the Hermitian Structure in a Householder Reflector
Householder's classic 1958 paper popularized a Hermitian unitary matrix now well-known as the Householder reflector. The reflector has a special structure $I - 2P$, where $P$ is a rank-1 orthogonal projector. The reflector plays a key role in several significant algorithms for solving least squares and eigenvalue problems. The influential paper, however, left a subtle oversight that still lingers in recent books and course materials. To correct this oversight, we show that the structure $I - 2P$ needs to be extended. In particular, the Hermitian property must be forsaken when the source of reflection and its target do not obey a certain symmetry condition. We introduce extended structures that fulfill the task of reflection without requiring this condition on symmetry. For reflecting a single vector, we extend the $I - 2P$ structure into $I - \eta P$ using a specific $\eta \in \mathbb{C}$. This is in the same spirit of a standard fix of the Householder reflector. For the more general scenario of reflecting multiple vectors simultaneously, we first study the norm-preserving linear targeting problem: we extend the $I - 2P$ structure into $I - (P_1+P_2)$, where only $P_1$ is required to be an orthogonal projector; the $I - (P_1+P_2)$ structure naturally leads to another structure $I-USU^*$, where $U$ has orthonormal columns and $S$ is a square matrix of a suitable size. We further show that the $I - (P_1+P_2)$ structure also arises in a linear targeting problem with a requirement on positive-definiteness instead of norm-preservation.- 29 March 2026
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 42, 279-293
Generalizing the Hermitian Structure in a Householder Reflector
Householder's classic 1958 paper popularized a Hermitian unitary matrix now well-known as the Householder reflector. The reflector has a special structure $I - 2P$, where $P$ is a rank-1 orthogonal projector. The reflector plays a key role in several significant algorithms for solving least squares and eigenvalue problems. The influential paper, however, left a subtle oversight that still lingers in recent books and course materials. To correct this oversight, we show that the structure $I - 2P$ needs to be extended. In particular, the Hermitian property must be forsaken when the source of reflection and its target do not obey a certain symmetry condition. We introduce extended structures that fulfill the task of reflection without requiring this condition on symmetry. For reflecting a single vector, we extend the $I - 2P$ structure into $I - \eta P$ using a specific $\eta \in \mathbb{C}$. This is in the same spirit of a standard fix of the Householder reflector. For the more general scenario of reflecting multiple vectors simultaneously, we first study the norm-preserving linear targeting problem: we extend the $I - 2P$ structure into $I - (P_1+P_2)$, where only $P_1$ is required to be an orthogonal projector; the $I - (P_1+P_2)$ structure naturally leads to another structure $I-USU^*$, where $U$ has orthonormal columns and $S$ is a square matrix of a suitable size. We further show that the $I - (P_1+P_2)$ structure also arises in a linear targeting problem with a requirement on positive-definiteness instead of norm-preservation.- Open Access
- 2 December 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (23) , 3857
On the Aitken–Hotelling–Duncan Formula: Brief History, Direct Derivations, and Effective Conditioning
In the first part of this paper, we examine historical documents related to the well-known Sherman–Morrison–Woodbury (SMW) formula and suggest that Aitken–Hotelling–Duncan (AHD) is an appropriate name for the same formula. In the second part, we present two elementary direct derivations of the formula, including a slow method that utilizes a QR trick and a fast method that makes the common practice of depending on being given an inverse formula for verification unnecessary. In the third part, we develop significant improvements over the classic conditioning bounds of Yip. Numerical experiments show that our bounds can be several orders of magnitude sharper than Yip’s bounds. Yip’s conditioning bounds suggest that numerical instability of the AHD formula may be common. However, for an important formula that has found and continues to find diverse applications, its numerical stability in general is not expected to be pessimistic. Our improved bounds shed a new light on the generally perceived tricky stability issue related to the AHD formula and provide clearer theoretical support for its stable performance observed by different researchers in diverse applications.
- 2 December 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (23) , 3857
Open AccessOn the Aitken–Hotelling–Duncan Formula: Brief History, Direct Derivations, and Effective Conditioning
In the first part of this paper, we examine historical documents related to the well-known Sherman–Morrison–Woodbury (SMW) formula and suggest that Aitken–Hotelling–Duncan (AHD) is an appropriate name for the same formula. In the second part, we present two elementary direct derivations of the formula, including a slow method that utilizes a QR trick and a fast method that makes the common practice of depending on being given an inverse formula for verification unnecessary. In the third part, we develop significant improvements over the classic conditioning bounds of Yip. Numerical experiments show that our bounds can be several orders of magnitude sharper than Yip’s bounds. Yip’s conditioning bounds suggest that numerical instability of the AHD formula may be common. However, for an important formula that has found and continues to find diverse applications, its numerical stability in general is not expected to be pessimistic. Our improved bounds shed a new light on the generally perceived tricky stability issue related to the AHD formula and provide clearer theoretical support for its stable performance observed by different researchers in diverse applications.
- 13 June 2016
- Published by Springer Nature in Science China Mathematics
- Vol. 59 (8) , 1635-1662
Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- 13 June 2016
- Published by Springer Nature in Science China Mathematics
- Vol. 59 (8) , 1635-1662
Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- Open Access
A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport
We present an eigenspectrum partitioning scheme without inversion for the recently described real-space electronic transport code, TRANSEC. The primary advantage of TRANSEC is its highly parallel algorithm, which enables studying conductance in large systems. The present scheme adds a new source of parallelization, significantly enhancing TRANSEC's parallel scalability, especially for systems with many electrons. In principle, partitioning could enable super-linear parallel speedup, as we demonstrate in calculations within TRANSEC. In practical cases, we report better than five-fold improvement in CPU time and similar improvements in wall time, compared to previously-published large calculations. Importantly, the suggested scheme is relatively simple to implement. It can be useful for general large Hermitian or weakly non-Hermitian eigenvalue problems, whenever relatively accurate inversion via direct or iterative linear solvers is impractical.
Open AccessA partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport
We present an eigenspectrum partitioning scheme without inversion for the recently described real-space electronic transport code, TRANSEC. The primary advantage of TRANSEC is its highly parallel algorithm, which enables studying conductance in large systems. The present scheme adds a new source of parallelization, significantly enhancing TRANSEC's parallel scalability, especially for systems with many electrons. In principle, partitioning could enable super-linear parallel speedup, as we demonstrate in calculations within TRANSEC. In practical cases, we report better than five-fold improvement in CPU time and similar improvements in wall time, compared to previously-published large calculations. Importantly, the suggested scheme is relatively simple to implement. It can be useful for general large Hermitian or weakly non-Hermitian eigenvalue problems, whenever relatively accurate inversion via direct or iterative linear solvers is impractical.
- 25 February 2016
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 42 (5) , 1103-1128
A block Chebyshev-Davidson method for linear response eigenvalue problems
- 25 February 2016
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 42 (5) , 1103-1128
A block Chebyshev-Davidson method for linear response eigenvalue problems
- 1 January 2015
- Published by Global Science Press in Communications in Computational Physics
- Vol. 18 (1) , 167-179
On the "Preconditioning" Function Used in Planewave DFT Calculations and Its Generalization
On the “Preconditioning” Function Used in Planewave DFT Calculations and its Generalization - Volume 18 Issue 1 - Yunkai Zhou, James R. Chelikowsky, Xingyu Gao, Aihui Zhou
- 1 January 2015
- Published by Global Science Press in Communications in Computational Physics
- Vol. 18 (1) , 167-179
On the "Preconditioning" Function Used in Planewave DFT Calculations and Its Generalization
On the “Preconditioning” Function Used in Planewave DFT Calculations and its Generalization - Volume 18 Issue 1 - Yunkai Zhou, James R. Chelikowsky, Xingyu Gao, Aihui Zhou
- 1 August 2011
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 217 (24) , 10267-10270
On the eigenvalues of specially low-rank perturbed matrices
- 1 August 2011
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 217 (24) , 10267-10270
On the eigenvalues of specially low-rank perturbed matrices
- 10 December 2010
- Published by Elsevier in Journal of Computational Physics
- Vol. 229 (24) , 9188-9200
A block Chebyshev–Davidson method with inner–outer restart for large eigenvalue problems
- 10 December 2010
- Published by Elsevier in Journal of Computational Physics
- Vol. 229 (24) , 9188-9200
A block Chebyshev–Davidson method with inner–outer restart for large eigenvalue problems
- 16 October 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Vol. 39 (6) , 1224-1236
Dynamic Multiple-Fault Diagnosis With Imperfect Tests
In this paper, we consider a model for the dynamic multiple-fault diagnosis (DMFD) problem arising in online monitoring of complex systems and present a solution. This problem involves real-time inference of the most likely set of faults and their time-evolution based on blocks of unreliable test outcomes over time. In the DMFD problem, there is a finite set of mutually independent fault states, and a finite set of sensors (tests) is used to monitor their status. We model the dependence of test outcomes on the fault states via the traditional D-matrix (fault dictionary). The tests are imperfect in the sense that they can have missed detections, false alarms, or may be available asynchronously. Based on the imperfect observations over time, the problem is to identify the most likely evolution of fault states over time. The DMFD problem is an intractable NP-hard combinatorial optimization problem. Consequently, we decompose the DMFD problem into a series of decoupled subproblems, one for each sample epoch. For a single-epoch MFD, we develop a fast and high-quality deterministic simulated annealing method. Based on the sequential inferences, a local search-and-update scheme is applied to further improve the solution. Finally, we discuss how the method can be extended to dependent faults.
- 16 October 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Vol. 39 (6) , 1224-1236
Dynamic Multiple-Fault Diagnosis With Imperfect Tests
In this paper, we consider a model for the dynamic multiple-fault diagnosis (DMFD) problem arising in online monitoring of complex systems and present a solution. This problem involves real-time inference of the most likely set of faults and their time-evolution based on blocks of unreliable test outcomes over time. In the DMFD problem, there is a finite set of mutually independent fault states, and a finite set of sensors (tests) is used to monitor their status. We model the dependence of test outcomes on the fault states via the traditional D-matrix (fault dictionary). The tests are imperfect in the sense that they can have missed detections, false alarms, or may be available asynchronously. Based on the imperfect observations over time, the problem is to identify the most likely evolution of fault states over time. The DMFD problem is an intractable NP-hard combinatorial optimization problem. Consequently, we decompose the DMFD problem into a series of decoupled subproblems, one for each sample epoch. For a single-epoch MFD, we develop a fast and high-quality deterministic simulated annealing method. Based on the sequential inferences, a local search-and-update scheme is applied to further improve the solution. Finally, we discuss how the method can be extended to dependent faults.
- 20 January 2009
- Published by IOP Publishing in Journal of Physics: Condensed Matter
- Vol. 21 (6) , 064207
Algorithms for the electronic and vibrational properties of nanocrystals
Solving the electronic structure problem for nanoscale systems remains a computationally challenging problem. The numerous degrees of freedom, both electronic and nuclear, make the problem impossible to solve without some effective approximations. Here we illustrate some advances in algorithm developments to solve the Kohn-Sham eigenvalue problem, i.e. we solve the electronic structure problem within density functional theory using pseudopotentials expressed in real space. Our algorithms are based on a nonlinear Chebyshev filtered subspace iteration method, which avoids computing explicit eigenvectors except at the first self-consistent-field iteration. Our method may be viewed as an approach to solve the original nonlinear Kohn-Sham equation by a nonlinear subspace iteration technique, without emphasizing the intermediate linearized Kohn-Sham eigenvalue problems. Replacing the standard iterative diagonalization at each self-consistent-field iteration by a Chebyshev subspace filtering step results in a significant speed-up, often an order of magnitude or more, over methods based on standard diagonalization. We illustrate this method by predicting the electronic and vibrational states for silicon nanocrystals.
- 20 January 2009
- Published by IOP Publishing in Journal of Physics: Condensed Matter
- Vol. 21 (6) , 064207
Algorithms for the electronic and vibrational properties of nanocrystals
Solving the electronic structure problem for nanoscale systems remains a computationally challenging problem. The numerous degrees of freedom, both electronic and nuclear, make the problem impossible to solve without some effective approximations. Here we illustrate some advances in algorithm developments to solve the Kohn-Sham eigenvalue problem, i.e. we solve the electronic structure problem within density functional theory using pseudopotentials expressed in real space. Our algorithms are based on a nonlinear Chebyshev filtered subspace iteration method, which avoids computing explicit eigenvectors except at the first self-consistent-field iteration. Our method may be viewed as an approach to solve the original nonlinear Kohn-Sham equation by a nonlinear subspace iteration technique, without emphasizing the intermediate linearized Kohn-Sham eigenvalue problems. Replacing the standard iterative diagonalization at each self-consistent-field iteration by a Chebyshev subspace filtering step results in a significant speed-up, often an order of magnitude or more, over methods based on standard diagonalization. We illustrate this method by predicting the electronic and vibrational states for silicon nanocrystals.