Symbolic analyzer for large lumped and distributed networks

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A symbolic linear analyzer that integrates the analysis of both lumped and distributed networks is presented in this paper. This is achieved by implementing a consistent set of notations and a unified mathematical framework. The merits of sparse symbolic matrices are utilized to develop a complete symbolic sparse toolbox that includes all basic elements of electrical circuits. A new storage scheme called Row-Indexed Semi-Symetric (RISS) sparse is proposed and implemented for symbolic network matrices. Several existing and newly developed matrix solvers are implemented and their performances are compared. These solvers are used in the proposed symbolic solver to provide a multi-path analysis root that can be optimized for a particular problem. The overall performance of the proposed symbolic analyzer is assessed practically using several application examples. The obtained results are found in agreement with the results obtained from previously reported analyses and thus confirm validity of the adopted formula approximation method. A polynomial fitting shows that the time complexity of a variable size RC network is super-quadratic with the number of network sections. A substantial reduction in the analysis time of a large ladder RC network is demonstrated with the implementation of macromodeling techniques.

Cite

CITATION STYLE

APA

Al-Taee, M. A., Al-Naima, F. M., & Al-Jewad, B. Z. (2007). Symbolic analyzer for large lumped and distributed networks. In Trends in Mathematics (Vol. 41, pp. 375–394). Springer International Publishing. https://doi.org/10.1007/978-3-7643-7984-1_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free