On the effective impedance of finite and infinite networks

DOI10.1007/S11118-021-09901-8zbMATH Open1493.34143arXiv1908.10025OpenAlexW2970568754MaRDI QIDQ2118852FDOQ2118852

Authors: Anna Muranova 

Publication date: 23 March 2022

Published in: Potential Analysis (Search for Journal in Brave)

Abstract: In this paper we deal with the notion of the effective impedance of AC networks consisting of resistances, coils and capacitors. Mathematically such a network is a locally finite graph whose edges are endowed with complex-valued weights depending on a complex parameter $lambda$ (by the physical meaning, $lambda=iomega$, where $omega$ is the frequency of the AC). For finite networks, we prove some estimates of the effective impedance. Using these estimates, we show that, for infinite networks, the sequence of impedances of finite graph approximations converges in certain domains in $mathbbC$ to a holomorphic function of $lambda$, which allows us to define the effective impedance of the infinite network.

Full work available at URL: https://arxiv.org/abs/1908.10025

Recommendations

• On the notion of effective impedance
• Effective impedance over ordered fields
• Infinite networks. II: Resistance in an infinite grid
• Resistances and currents in infinite electrical networks
• Theory of impedance networks: the two-point impedance andLCresonances

zbMATH Keywords

Laplace operatorweighted graphselectrical networkKirchhoff's equationsladder networkeffective impedance

Mathematics Subject Classification ID

Qualitative investigation and simulation of ordinary differential equation models (34C60) Signed and weighted graphs (05C22) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Circuits in qualitative investigation and simulation of models (94C60)

Cites Work

• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Potential theory on infinite networks
• Probability on graphs. Random processes on graphs and lattices.
• Random Walks on Infinite Graphs and Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Synthesis of a Finite Two-terminal Network whose Driving-point Impedance is a Prescribed Function of Frequency
• Introduction to analysis on graphs
• Matrix valued inverse problems on graphs with application to mass-spring-damper systems
• On the impedance of infinite LC ladder networks
• On the notion of effective impedance
• Ladder-type circuits revisited
• Convergence and periodic solutions for the input impedance of a standard ladder network
• Effective impedance over ordered fields

Cited In (8)

• On the differential and linear efficiency of balanced Feistel networks
• Random walks, conductance, and resistance for the connection graph Laplacian
• Theory of impedance networks: the two-point impedance andLCresonances
• On the notion of effective impedance
• Convergence and periodic solutions for the input impedance of a standard ladder network
• On indefinite-impedance matrix
• Characterization of the response maps of alternating-current networks
• Effective impedance over ordered fields

This page was built for publication: On the effective impedance of finite and infinite networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118852)