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 EDBT 2026 / reviewers in the wild / expert

Juan J. Obregon

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

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

Systems, architecture and hardware · 1

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 · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
circuit simulation		 0.011997
Newton-Raphson iteration speed-up algorithm for the solution of nonlinear circuit equations in general-purpose CAD programs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Electronic design automation › circuit simulation
nonlinear circuit analysis		 0.011997
Newton-Raphson iteration speed-up algorithm for the solution of nonlinear circuit equations in general-purpose CAD programs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997

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

newton-raphson iteration · 0.0convergence acceleration · 0.0
YearPublicationVenuePosition
1997 Newton-Raphson iteration speed-up algorithm for the solution of nonlinear circuit equations in general-purpose CAD programs
abstract
The Newton-Raphson method is usually adopted for the solution of nonlinear circuit equations. However, it is well known that convergence of Newton's scheme is highly dependent on the initial guess, and often fails when convenient modifications are lacking. Typical Newton convergence problems in electronic circuits analysis are identified. An algorithm speeding up the convergence of the Newton scheme and making it less dependent on the initial guess is presented. The method is simple and a general-purpose one, applicable to all kinds of circuit equations. Numerical results are presented, and a comparison with previous work is done.
Edouard Ngoya, Jean Rousset, Juan J. Obregon
 IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3