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

Bangda Zhou

dblp:130/1378 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · unresolved

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 50% High-performance computing · 50%

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

TopicWeightPapersLastEvidence papers
High-performance computing › finite element method
finite element solver
0.212013
A direct finite element solver of linear complexity for large-scale 3-D circuit extraction in multiple dielectrics · DAC 2013
Electronic design automation › physical design › parasitic extraction
interconnect parasitic extraction
0.212013
A direct finite element solver of linear complexity for large-scale 3-D circuit extraction in multiple dielectrics · DAC 2013

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

finite element method · 0.2direct sparse matrix factorization · 0.2
YearPublicationVenuePosition
2013 A direct finite element solver of linear complexity for large-scale 3-D circuit extraction in multiple dielectrics
abstract
We develop a direct finite-element solver of linear (optimal) complexity to extract broadband circuit parameters such as S-parameters of arbitrarily shaped 3-D interconnects in inhomogeneous dielectrics. Numerical experiments demonstrate a clear advantage of the proposed solver as compared with existing finite-element solvers that employ state-of-the-art direct sparse matrix solutions. A linear complexity in both CPU time and memory consumption is achieved with prescribed accuracy satisfied. A finite-element matrix from the analysis of a large-scale 3-D circuit in multiple dielectrics having 5.643 million unknowns is directly factorized in less than 2 hours on a single core running at 2.8 GHz.
Bangda Zhou, Dan Jiao
DAC1