Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhong-Yi Zhao

dblp:35/2323 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › numerical linear algebra
linear equation solving
0.011991
A new preconditioner for CGS iteration in solving large sparse nonsymmetric linear equations in semiconductor device simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Computational science and engineering › computational physics
semiconductor device simulation
0.011991
A new preconditioner for CGS iteration in solving large sparse nonsymmetric linear equations in semiconductor device simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Mathematical optimization › numerical computation
iterative linear solver
0.011991
A new preconditioner for CGS iteration in solving large sparse nonsymmetric linear equations in semiconductor device simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991

Methods — techniques the papers use, named apart from their topics

incomplete LU factorization by value · 0.0finite element simulation · 0.0ILUV-CGS · 0.0CGS iteration · 0.0
YearPublicationVenuePosition
1991 A new preconditioner for CGS iteration in solving large sparse nonsymmetric linear equations in semiconductor device simulation
abstract
The authors present a new and efficient precondition method (ILUV-CGS), which is an incomplete LU (ILU) factorization by value instead of a sparse nonzero pattern, in conjunction with CGS iteration for solving nonsymmetric linear equations in finite-element simulation of semiconductor devices. To demonstrate the efficiency of this method, the simulations of a group of representative devices with different numerical characteristics have been carried out using the ILUV-CGS algorithm, and these are compared with those of the existing ILU-CGS method. The comparison results are in favor of using the ILUV=CGS method.>
Zhong-Yi Zhao, Qi-Ming Zhang, Gen-Lin Tan, J. M. (Jimmy) Xu
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1