摘要
在模拟电路符号网络函数分析的代数法中，矩阵行列式的计算直接关系到符号分析程序的效率。在置换法和展开法的基础上，提出了一种新的计算符号行列式值的两端收缩算法，并在符号分析程序中实现。还给出了与该算法有关的数据结构，以及几种算法的比较结果。
Based on both substitution and permutation method,a new algorithm called two ends contraction is presented to calculate symbolic coefficient determinant,which is implemented in symbolic analysis program for analog circuits Data structures associated with the implementation of the algorithm are described A comparison is made on three algorithms and the results are discussed
出处
《微电子学》
CAS
CSCD
北大核心
1998年第2期73-77,共5页
Microelectronics
