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

Makiko Kakizaki

dblp:07/182 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1985
—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.011985
A Modified Newton Method for the Steady-State Analysis · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1985
Electronic design automation
circuit simulation
0.011985
A Modified Newton Method for the Steady-State Analysis · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1985
Electronic design automation › circuit simulation
nonlinear circuit analysis
0.011985
A Modified Newton Method for the Steady-State Analysis · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1985
Electronic design automation › circuit simulation
steady-state analysis
0.011985
A Modified Newton Method for the Steady-State Analysis · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1985

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

state elimination · 0.0newton method · 0.0damped newton method · 0.0
YearPublicationVenuePosition
1985 A Modified Newton Method for the Steady-State Analysis
abstract
The Newton algorithm is one of the most promising methods for determining the steady-state response of nonlinear circuits. However, the method has ever larger memory storage capacity requirements, as the circuit size increases. State elimination is efficient to reduce the required memory storage. In this paper, an automatic state elimination method is proposed. The Newton method has another problem, since it fails to converge to a steady-state solution in certain cases. A damped Newton method, which considers nonlinearity of the system, is discussed as a method to improve convergence. For autonomous systems, such as oscillatory circuits, another modification is discussed for improving reliability and convergence. The Newton algorithm with these modifications has been implemented in Toshiba's version of SPICE2, and experimental results have shown reduction in memory storage capacity requirements, less computational effort and convergence improvements.
Makiko Kakizaki, Tsutomu Sugawara
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1