SUFFICIENT CONDITIONS FOR ITERATED TIMING ANALYSIS TO CONVERGE LOCALLY.

Kiichi Urahama

    Research output: Contribution to journalArticlepeer-review

    Abstract

    This paper investigates the convergence property of a circuit simulation technique called an iterated timing analysis. A block strictly row-wise or column-wise diagonal dominant matrix is defined, and these matrices are shown to be nonsingular. Both block Jacobi method and block Gauss-Seidel iteration are proved to converge for the equation whose coefficient matrix is one of these matrices. On the basis of these results, the following two sufficient conditions for the iterated timing analysis to converge locally are given: (i) the capacitance matrix of the circuit is block strictly row-wise or column-wise diagonally dominant and a time step is sufficiently small, (ii) the conductance matrix of the circuit has the same property and a time step is sufficiently large.

    Original languageEnglish
    Pages (from-to)1289-1293
    Number of pages5
    JournalTransactions of the Institute of Electronics and Communication Engineers of Japan. Section E
    VolumeE69
    Issue number12
    Publication statusPublished - Dec 1986

    All Science Journal Classification (ASJC) codes

    • Engineering(all)

    Fingerprint

    Dive into the research topics of 'SUFFICIENT CONDITIONS FOR ITERATED TIMING ANALYSIS TO CONVERGE LOCALLY.'. Together they form a unique fingerprint.

    Cite this