Sufficient Conditions for Iterated Timing Analysis to Converge Locally
Summary :
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. In addition, 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 bases of these results, the following two sufficient conditions for the iterated timing analysis to converge locally are given:
- Publication
- IEICE TRANSACTIONS on transactions Vol.E69-E No.12 pp.1289-1293
- Publication Date
- 1986/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Circuit Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kiichi URAHAMA, "Sufficient Conditions for Iterated Timing Analysis to Converge Locally" in IEICE TRANSACTIONS on transactions,
vol. E69-E, no. 12, pp. 1289-1293, December 1986, doi: .
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. In addition, 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 bases of these results, the following two sufficient conditions for the iterated timing analysis to converge locally are given:
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e69-e_12_1289/_p
Copy
@ARTICLE{e69-e_12_1289,
author={Kiichi URAHAMA, },
journal={IEICE TRANSACTIONS on transactions},
title={Sufficient Conditions for Iterated Timing Analysis to Converge Locally},
year={1986},
volume={E69-E},
number={12},
pages={1289-1293},
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. In addition, 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 bases of these results, the following two sufficient conditions for the iterated timing analysis to converge locally are given:
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Sufficient Conditions for Iterated Timing Analysis to Converge Locally
T2 - IEICE TRANSACTIONS on transactions
SP - 1289
EP - 1293
AU - Kiichi URAHAMA
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1986
AB - 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. In addition, 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 bases of these results, the following two sufficient conditions for the iterated timing analysis to converge locally are given:
ER -
English
