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
Demo Data from SIGIR 2026 / reviewers in the wild / expert

R. J. Bowman

dblp:78/387 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1987
—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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 75% Integrated circuit design · 25%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
analog and mixed-signal circuits		 0.011987
Determining the Zeros and Poles of Linear Circuit Networks Using Function Approximation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation
circuit analysis		 0.011987
Determining the Zeros and Poles of Linear Circuit Networks Using Function Approximation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation
circuit simulation		 0.011987
Determining the Zeros and Poles of Linear Circuit Networks Using Function Approximation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation › circuit analysis › analog circuit analysis
pole-zero analysis		 0.011987
Determining the Zeros and Poles of Linear Circuit Networks Using Function Approximation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987

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

levenberg-marquardt nonlinear least squares · 0.0function approximation · 0.0
YearPublicationVenuePosition
1987 Determining the Zeros and Poles of Linear Circuit Networks Using Function Approximation
abstract
A numerical method for determining the significant singularities corresponding to the network function of a linear circuit is presented. This method is based upon function approximation of both the magnitude and phase of frequency response data. A linear network function of the form of a ratio of two polynomials in the Laplacian variable s is assumed. The frequency response data are approximated using the nonlinear least-squares algorithm of Levenberg and Marquardt. The polynomials are then factored into roots and those singularities having a negligible effect are removed. ZAP, a computer program implementing this method, has proven to be a valuable design aid for performing pole-zero analysis in the design of linear integrated circuits.
R. J. Bowman, C. C. Brewster
 IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1