𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm to process sparse matrix for transient analysis of linear circuits

✍ Scribed by Hideo Yamashita; Eihachiro Nakamae


Book ID
112080614
Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
553 KB
Volume
97
Category
Article
ISSN
0424-7760

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The block-Toeplitz-matrix based CG-FFT a
✍ R. S. Chen; Edward K. N. Yung; K. F. Tsang; L. Mo πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

## Abstract In this Letter, the inexact preconditioned conjugate‐gradient (CG) algorithm with inner–outer iteration and the block‐Toeplitz‐matrix–based fast–Fourier‐ transform (FFT) technique are applied to dense matrix equations from the mixed potential integral equation (MPIE) to enhance the comp

Sparse approximate inverse preconditione
✍ R. S. Chen; K. F. Tsang; Edward K. N. Yung πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

## Abstract In this paper, the multifrontal method is employed to precondition the conjugate gradient (CG) algorithm with the block Toeplitz matrix based fast Fourier transform (FFT) technique for dense matrix equations from the mixed potential integral equation (MPIE) to enhance the computational

An efficient algorithm for analysis of p
✍ Qiu Huang; Ruey-Wen Liu πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 510 KB

A new efficient algorithm is presented for finding all driving-point characteristic (DP) and transfer characteristic (TC) plots for a broad class of piecewise-linear (PWL) resistive circuits without the need for initial points for each solution branch. The piecewise-linear circuits t o be considered