Theory of electric networks: The two-point resistance and impedance F. Y. Wu Northeastern University Boston, Massachusetts USA.

Slides:



Advertisements
Similar presentations
Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Advertisements

Chapter 6 Eigenvalues and Eigenvectors
Refresher: Vector and Matrix Algebra Mike Kirkpatrick Department of Chemical Engineering FAMU-FSU College of Engineering.
Symmetric Matrices and Quadratic Forms
Ch 7.9: Nonhomogeneous Linear Systems
Matrix Operations. Matrix Notation Example Equality of Matrices.
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
化工應用數學 授課教師: 郭修伯 Lecture 9 Matrices
Matrices CS485/685 Computer Vision Dr. George Bebis.
1 Chapter 2 Matrices Matrices provide an orderly way of arranging values or functions to enhance the analysis of systems in a systematic manner. Their.
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
A sinusoidal current source (independent or dependent) produces a current That varies sinusoidally with time.
Differential Equations
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Phys 272 Alternating Current. A.C. Versus D.C (Natural) Frequency, Period, etc…
Compiled By Raj G. Tiwari
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
ORDINARY DIFFERENTIAL EQUATION (ODE) LAPLACE TRANSFORM.
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
ECON 1150 Matrix Operations Special Matrices
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
CHAPTER 2 MATRIX. CHAPTER OUTLINE 2.1 Introduction 2.2 Types of Matrices 2.3 Determinants 2.4 The Inverse of a Square Matrix 2.5 Types of Solutions to.
Chapter 5 Orthogonality.
ELECTRICAL TECHNOLOGY EET 103/4
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Matrices & Determinants Chapter: 1 Matrices & Determinants.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
10.4 Matrix Algebra 1.Matrix Notation 2.Sum/Difference of 2 matrices 3.Scalar multiple 4.Product of 2 matrices 5.Identity Matrix 6.Inverse of a matrix.
Linear algebra: matrix Eigen-value Problems
The V  I Relationship for a Resistor Let the current through the resistor be a sinusoidal given as Is also sinusoidal with amplitude amplitudeAnd.
Loop and cut set Analysis
Network Graphs and Tellegen’s Theorem The concepts of a graph Cut sets and Kirchhoff’s current laws Loops and Kirchhoff’s voltage laws Tellegen’s Theorem.
Mathematics.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
AC Series-Parallel Circuits Chapter 18. AC Circuits 2 Rules and laws developed for dc circuits apply equally well for ac circuits Analysis of ac circuits.
Linear algebra: matrix Eigen-value Problems Eng. Hassan S. Migdadi Part 1.
Chapter 5 MATRIX ALGEBRA: DETEMINANT, REVERSE, EIGENVALUES.
Theory of impedance networks: A new formulation F. Y. Wu FYW, J. Phys. A 37 (2004)
Chapter 24 Sturm-Liouville problem Speaker: Lung-Sheng Chien Reference: [1] Veerle Ledoux, Study of Special Algorithms for solving Sturm-Liouville and.
Review of Matrix Operations Vector: a sequence of elements (the order is important) e.g., x = (2, 1) denotes a vector length = sqrt(2*2+1*1) orientation.
Chapter 2 Determinants. With each square matrix it is possible to associate a real number called the determinant of the matrix. The value of this number.
10.4 Matrix Algebra 1.Matrix Notation 2.Sum/Difference of 2 matrices 3.Scalar multiple 4.Product of 2 matrices 5.Identity Matrix 6.Inverse of a matrix.
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
STROUD Worked examples and exercises are in the text Programme 5: Matrices MATRICES PROGRAMME 5.
2.5 – Determinants and Multiplicative Inverses of Matrices.
CHAPTER 2: DC Circuit Analysis and AC Circuit Analysis Motivation Sinusoids’ features Phasors Phasor relationships for circuit elements Impedance and admittance.
A sinusoidal current source (independent or dependent) produces a current That varies sinusoidally with time.
STROUD Worked examples and exercises are in the text PROGRAMME 5 MATRICES.
Chapter 19 Principles of Electric Circuits, Conventional Flow, 9 th ed. Floyd © 2010 Pearson Higher Education, Upper Saddle River, NJ All Rights.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
CHAPTER 7 Determinant s. Outline - Permutation - Definition of the Determinant - Properties of Determinants - Evaluation of Determinants by Elementary.
Is it possible to geometrize infinite graphs?
ELECTRICAL TECHNOLOGY EET 103/4
Review of Linear Algebra
CS479/679 Pattern Recognition Dr. George Bebis
Review of Matrix Operations
Matrices and vector spaces
ECE 3301 General Electrical Engineering
Systems of First Order Linear Equations
CS485/685 Computer Vision Dr. George Bebis
Boyce/DiPrima 10th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
2. 2 The V-I Relationship for a Resistor Let the current through the resistor be a sinusoidal given as Is also sinusoidal with amplitude amplitude.
Chapter 3 Linear Algebra
Symmetric Matrices and Quadratic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Eigenvalues and Eigenvectors
Subject :- Applied Mathematics
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Presentation transcript:

Theory of electric networks: The two-point resistance and impedance F. Y. Wu Northeastern University Boston, Massachusetts USA

Z Impedance network  

Ohm’s law Z V I Combination of impedances

In the phasor notation, impedance for inductance L is Impedance for capacitance C is where. Impedances

=  -Y transformation: (1899) Star-triangle relation: (1944) Ising model = =

 -Y relation (Star-triangle, Yang-Baxter relation) A.E. Kenelly, Elec. World & Eng. 34, 413 (1899)

z1z1 z1z1 z1z1 z1z1 z2z2

z1z1 z1z1 z1z1 z1z1 z2z

r1r1 r1r1 r1r1 r1r1 r2r I I/2 I r1r1 r1r1 r1r1 r1r1 r2r2

1 2 r r r r r r r r r r r r

1 2 r r r r r r r r r r r r I I/3 I 1 2 r r r r r r r r r r r r I/6

Infinite square network I/4 I

V 01 =(I/4+I/4)r I/4 I I

Infinite square network

Problems: Finite networks Tedious to use Y-  relation 1 2 (a) (b) Resistance between (0,0,0) & (3,3,3) on a 5×5×4 network is

I0I Kirchhoff’s law z 01 z 04 z 02 z 03 Generally, in a network of N nodes, Then set Solve for V i

2D grid, all r=1, I(0,0)=I 0, all I(m,n)=0 otherwise I0I0 (0,0) (0,1) (1,1) (1,0) Define Then Laplacian

Harmonic functions Random walks Lattice Green’s function First passage time Related to: Solution to Laplace equation is unique For infinite square net one finds For finite networks, the solution is not straightforward.

General I1I1 I2I2 I3I3 N nodes The sum of each row or column is zero !

Properties of the Laplacian matrix All cofactors are equal and equal to the spanning tree generating function G of the lattice (Kirchhoff). Example y3y3 y1y1 y2y2 G=y 1 y 2 +y 2 y 3 +y 3 y 1

Spanning Trees: x x x x xx yy y y y y y y x G(1,1) = # of spanning trees Solved by Kirchhoff (1847) Brooks/Smith/Stone/Tutte (1940)

x x yy G(x,y)= + x x x xx x ++ yyyyyy =2xy 2 +2x 2 y N=4

General I1I1 I2I2 I3I3 N nodes The sum of each row or column is zero !

I2I2 I1I1 ININ network Problem: L is singular so it cannot be inverted. Day is saved: Kirchhoff’s law says Hence only N-1 equations are independent → no need to invert L

Solve V i for a given I Kirchhoff solution Since only N-1 equations are independent, we can set V N =0 & consider the first N-1 equations! The reduced (N-1)×(N-1) matrix, the tree matrix, now has an inverse and the equation can be solved.

Example y3y3 y1y1 y2y2 or The evaluation of L  & L  in general is not straightforward!

II   Kirchhoff result: Writing Where L  is the determinant of the Laplacian with the  -th row & column removed. L  = the determinant of the Laplacian with the  -th and  -th rows & columns removed. But the evaluation of L  for general network is involved.

For resistors, z and y are real so L is Hermitian, we can then consider instead the eigenvalue equation Solve V i (  ) for given I i and set  =0 at the end. This can be done by applying the arsenal of linear algebra and deriving at a very simple result for 2-point resistance.

Eigenvectors and eigenvalues of L 0 is an eigenvalue with eigenvector L is Hermitian L has real eigenvalues Eigenvectors are orthonormal

Consider where Let This gives

Example r1r1 r1r1 r1r1 r1r1 r2r2

For resistors let = orthonormal Theorem for resistor networks: This is the main result of FYW, J. Phys. A37 (2004) which makes use of the fact that L is hermitian and is orthonormal

Corollary :

Example: complete graphs N=3 N=2 N=4

1 23 N-1 r rrr N  

If nodes 1 & N are connected with r (periodic boundary condition)

New summation identities New product identity

M×N network N=6 M=5 r s s I N unit matrix s r rr

M, N →∞

Resistance between two corners of an N x N square net with unit resistance on each edge whereEuler constant N=30 (Essam, 1997)

Finite lattices Free boundary condition Cylindrical boundary condition Moebius strip boundary condition Klein bottle boundary condition

Klein bottle Moebius strip

Free Cylinder

Klein bottle Moebius strip

Klein bottle Moebius strip Free Cylinder Torus on a 5×4 network embedded as shown

Resistance between (0,0,0) and (3,3,3) in a 5×5 × 4 network with free boundary

In the phasor notation, impedance for inductance L is Impedance for capacitance C is where. Impedances

For impedances, Y are generally complex and the matrix L is not hermitian and its eigenvectors are not orthonormal; the resistor result does not apply. But L^*L is hermitian and has real eigenvelues. We have with

Theorem Let L be an N x N symmetric matrix with complex Matrix elements and Then, there exist N orthnormal vectors satisfying the relation where * denotes complex conjugate and

Remarks: For nondegenerate one has simply For degenerateone can construct as linear combinations of

For impedances let = orthonormal Theorem for impedance networks: This is the result of WJT and FYW, J. Phys. A39 (2006)

The physical interpretation of is the occurrence of a resonance such as in a parallel combination of inductance L and capacitance C the impedance is Z = =

Generally in an LC circuit there can exist multiple resonances at frequencies where In the circuit shown, 15 resonance frequencies at M=6 N=4

Summary An elegant formulation of computing two- point impedances in a network, a problem lingering since the Kirchhoff time. Prediction of the occurrence of multi- resonances in a network consisting of reactances L and C, a prediction which may have practical relevance.

FYW, J. Phys. A 37 (2004) W-J Tzeng and FYW, J. Phys. A 39 (2006),