images PREFACE

This text describes in detail the numerical techniques and algorithms that are part of modern circuit simulators, with a focus on the most commonly used simulation modes: DC Analysis and Transient Analysis. After a general introduction in Chapter 1, network equation formulation is covered in chapter 2, with emphasis on modified nodal analysis (MNA). The coverage also includes the network cycle space and bond space, element stamps, and the question of unique solvability of the system. Solving linear resistive circuits is the focus of chapter 3, which gives a comprehensive treatment of the most relevant aspects of linear system solution techniques. This includes the standard methods of Gaussian elimination (GE) and LU factorization, as well as some in-depth treatment of numerical error in floating point systems, pivoting for accuracy, sparse matrix methods, and pivoting for sparsity. Indirect solution methods, such as Gauss-Jacobi (GJ) and Gauss-Seidel (GS) are also covered. As well, some discussion of node tearing and partitioning is given, in recognition of the recent trend of increased usage of parallel software on multi-core computers.

Solving nonlinear resistive circuits is covered in Chapter 4, with a focus on Newton's method. A detailed study is given of Newton's method, including its links to the fixed point method and the conditions that govern its convergence. A ...

Get Circuit Simulation now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.