Yunkai Zhou

Dr. Yunkai Zhou

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 December 2006 in Physical Review E
Verified
Journal Article
Closed access
PDF file
YZYunkai Zhou
Yunkai Zhou
YSYousef Saad
Yousef Saad
MTMurilo L. Tiago
Murilo L. Tiago
JCJames R. Chelikowsky
James R. Chelikowsky
Solving the Kohn-Sham eigenvalue problem constitutes the most computationally expensive part in self-consistent density functional theory (DFT) calculations. In a previous paper, we have proposed a nonlinear Chebyshev-filtered subspace iteration method, which avoids computing explicit eigenvectors except at the first self-consistent-field (SCF) iteration. The 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. It reaches self-consistency within a similar number of SCF iterations as eigensolver-based approaches. However, replacing the standard diagonalization at each SCF iteration by a Chebyshev subspace filtering step results in a significant speedup over methods based on standard diagonalization. Here, we discuss an approach for implementing this method in multi-processor, parallel environment. Numerical results are presented to show that the method enables to perform a class of highly challenging DFT calculations that were not feasible before.

27 March 2008 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
YZYunkai Zhou
Yunkai Zhou
YSYousef Saad
Yousef Saad

10 December 2010 in Journal of Computational Physics
Verified
Journal Article
Closed access
YZYunkai Zhou
Yunkai Zhou

16 October 2009 in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
Verified
Journal Article
Closed access
SRSui Ruan
Sui Ruan
YZYunkai Zhou
Yunkai Zhou
FYFeili Yu
Feili Yu
KPKrishna Pattipati
Krishna Pattipati
PWPeter Willett
Peter Willett
APAnn Patterson-Hine
Ann Patterson-Hine
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.

1 January 2015 in Communications in Computational Physics
Verified
Journal Article
Closed access
PDF file
YZYunkai Zhou
Yunkai Zhou
JCJames R. Chelikowsky
James R. Chelikowsky
XGXingyu Gao
Xingyu Gao
AZAihui Zhou
Aihui Zhou
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

25 February 2016 in Advances in Computational Mathematics
Verified
Journal Article
Closed access
PDF file
Zhongming TengZhongming Teng
Zhongming Teng
YZYunkai Zhou
Yunkai Zhou
RLRen-Cang Li
Ren-Cang Li