On the realizability of fundamental circuit matrices
β Scribed by Yoji Kajitani
- Publisher
- Elsevier Science
- Year
- 1970
- Tongue
- English
- Weight
- 672 KB
- Volume
- 290
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper presents a necessary and sufltcient condition for the realizability of the fundamental circuit matrix without construction of the corresponding graph. The result affords an eficient algorithm of realizing the graphs with a given fundamental circuit matrix. The idea is mainly based upon the well-known fact that each row of the fundamental circuit matrix determines a path contained in the reference tree. The restrictions of the referejlce tree are represented in terms of logical functions and the result is stated by the topological conditions of the graph induced by the functions.
I. htroduction
π SIMILAR VOLUMES
We show that Hua's fundamental theorem of the geometry of rectangular matrices can be proved without the bijectivity assumption when the underlying field is the field of real numbers. We also give a counterexample showing that this generalization is not possible in the complex case.  2002 Elsevier
## Abstract Upper bounds are established on the number of conductances required for realizing a real symmetric matrix **Y** as the shortβcircuit conductance matrix of a resistive __n__βport network containing no negative conductances, and for the realization of a real matrix **K** as the potential
## Abstract __Electrodeposition is used for the preparation of nanoparticles and nanostructures that allow, in principle, surface plasmon excitation. The (photo)electrodeposition process of Rh and Au nanoparticles as well as of heterodimeric enzymes onto silicon surfaces is investigated and the res