论文信息 - The order of complexity of RLC-nullor networks - 字舞流文

The order of complexity of RLC-nullor networks

An upper bound on the order of complexity of a solvable RLC-nullor network is found.

J. A. Svoboda | J. Svoboda

[1] A. Dervişoğlu,et al. State equations and initial values in active RLC networks , 1971, IEEE Transactions on Circuit Theory.

[2] H. Ur,et al. Nullor equivalent networks of nonideal operational amplifiers and voltage-controlled sources , 1980 .

[3] E. J. Purslow,et al. Solvability and analysis of linear active networks by use of the state equations , 1970 .

[4] S. Parker,et al. Existence of numerical solutions and the order of linear circuits with dependent sources , 1971 .

[5] M. Chandrashekar,et al. On the existence of solutions to linear active networks: A state‐space approach , 1974 .

[6] Leonard T. Bruton. RC-Active Circuits. Theory and Design , 1980 .

[7] P. Bryant,et al. The order of complexity of electrical networks , 1959 .

[8] L. L. Grigsby,et al. Systems of one port linear components containing through-across type drivers , 1964 .

[9] Norman Balabanian,et al. Electrical Network Theory , 1969 .