首页> 外文期刊>IEE Proceedings. Part G, Circuits, Devices and Systems >Algorithm for reducing circuit equations in computer applications
【24h】

Algorithm for reducing circuit equations in computer applications

机译:简化计算机应用中的电路方程的算法

获取原文
获取原文并翻译 | 示例
       

摘要

The problem of computer formulation of circuit equations using the modified nodal analysis, especially in microcomputers, is addressed. The modified nodal formulation gives rise to a disproportionately large number of circuit equations even for small-size networks. An algorithm is presented to reduce the circuit equations to a very small number before solving them repeatedly, as in the case of obtaining frequency- and/or time-domain responses. This reduces the memory requirement as well as run time for the solution of network responses. Though this is useful in any computer-aided analysis of networks, it is especially useful in microcomputers where these two facts are significantly important. This also eliminates the need for solving the circuit equations using sparse matrix techniques.
机译:解决了使用改进的节点分析法对电路方程式进行计算机公式化的问题,尤其是在微型计算机中。即使对于小型网络,修改后的节点公式也会产生不成比例的大量电路方程。在获得频域和/或时域响应的情况下,提出了一种算法,可在反复求解之前将电路方程式减少到非常小的数目。这样可以减少内存需求以及网络响应解决方案的运行时间。尽管这在任何计算机辅助的网络分析中都是有用的,但在这两个事实非常重要的微型计算机中,它尤其有用。这也消除了使用稀疏矩阵技术求解电路方程的需要。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号