NODAL AND LOOP ANALYSIS TECHNIQUES. Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSIS

Size: px
Start display at page:

Download "NODAL AND LOOP ANALYSIS TECHNIQUES. Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSIS"

Transcription

1 NODAL AND LOOP ANALYSS TECHNQUES LEANNG GOALS NODAL ANALYSS LOOP ANALYSS Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSS One of the systematic ways to determine every voltage and current in a circuit The variables used to describe the circuit will be Node oltages -- The voltages of each node with respect to a pre-selected reference node

2 T S NSTUCTE TO STAT THE PESENTATON WTH A ECAP OF A POBLEM SOLED BEFOE USNG SEES/ PAALLEL ESSTO COMBNATONS COMPUTE ALL THE OLTAGES AND CUENTS N THS CCUT k k k SECOND: BACKTACK USNG KL, KCL OHM S OHM' S : a KCL : OHM' S : b k * OTHE OPTONS... FST EDUCE TO A SNGLE LOOP CCUT k * KCL : 5 OHM'S : C k * 5 b k a () 9

3 THE NODE ANALYSS PESPECTE S S S a KL a a a KL a b b b 5 KL c c EFEENCE 5 b WHAT S THE PATTEN??? THEE AE FE NODES. F ONE NODE S SELECTED AS EFEENCE, THEN THEE AE FOU OLTAGES WTH ESPECT TO THE EFEENCE NODE. 5 b c ONCE THE OLTAGES AE KNOWN, THE CUENTS CAN BE COMPUTED USNG OHM S LAW. THEOEM: F ALL NODE OLTAGES WTH ESPECT TO A COMMON EFEENCE NODE AE KNOWN, THEN ONE CAN DETEMNE ANY OTHE ELECTCAL AABLE FO THE CCUT. v v m v N v DLL QUESTON ca A GENEAL EW THE EFEENCE DECTON FO CUENTS S ELEANT v ' v i' USNG THE LEFT-GHT EFEENCE DECTON THE OLTAGE DOP ACOSS THE ESSTO MUST HAE THE POLATY SHOWN ' ii OHM'S LAW v i v m PASSE SGN CONENTON ULES! N F THE CUENT EFEENCE DECTON S EESED... THE PASSE SGN CONENTON WLL ASSGN THE EESE EFEENCE POLATY TO THE OLTAGE ACOSS THE ESSTO ' v OHM'S LAW i v N m

4 DEFNNG THE EFEENCE NODE S TAL THE STATEMENT S MEANNGLES S UNTL THE EFEENCE PONT S DEFNED. BY CONENTON THE GOUND SYMBOL SPECFES THE EFEENCE PONT. ALL NODE OLTAGES AE MEASUED WTH ESPECT TO THAT EFEENCE PONT? THE STATEGY FO NODE ANALYSS S a b c. DENTFY ALL NODES AND SELECT A EFEENCE NODE. DENTFY KNOWN NODE OLTAGES. AT EACH NODE WTH UNKNOWN OLTAGE, WTE A KCL EQUATON (e.g.,sum OF CUENT LEANG a : a s a a b 9k b : 5 b a b b c k k c : 6 c b c 9k k 5 EFEENCE. EPLACE CUENTS N TEMS OF NODE OLTAGES AND GET ALGEBAC EQUATONS N THE NODE OLTAGES... SHOTCUT: SKP WTNG THESE EQUATONS... AND PACTCE WTNG THESE DECTLY

5 WHEN WTNG A NODE EQUATON... AT EACH NODE, ONE CAN CHOSE ABTAY DECTONS FO THE CUENTS a b a b c d d c AND SELECT ANY FOM OF KCL. WHEN THE CUENTS AE EPLACED N TEMS OF THE NODE OLTAGES, THE NODE EQUATONS THAT ESULT AE THE SAME O EQUALENT. CUENTS LEANG a b b d b c CUENTS NTO NODE a b b d b c a b a b c ' d d ' ' CUENTS LEANG c ' ' ' b a b d c b CUENTS NTO NODE ' ' ' b a b d c b WHEN WTNG THE NODE EQUATONS, WTE THE EQUATON DECTLY N TEMS OF THE NODE OLTAGES. BY DEFAULT, USE KCL N THE FOM SUM-OF-CUENTS-LEANG =. THE EFEENCE DECTON FO THE CUENTS DOES NOT AFFECT THE NODE EQUATON. CCUTS WTH ONLY NDEPENDENT SOUCES HNT: THE FOMAL MANPULATON OF EQUATONS MAY BE SMPLE F ONE USES CONDUCTANCES NSTEAD OF NODE USNG NODE i A v v v WTH CONDUCTANCES EODENG TEMS EODENG TEMS i A Gv G( v v) THE MODEL FO THE CCUT S A SYSTEM OF ALGEBAC EQUATONS THE MANPULATON OF SYSTEMS OF ALGEBAC EQUATONS CAN BE EFFCENTLY DONE USNG MAT ANALYSS.

6 EAMPLE WTE THE KCL NODE WE SUALZE THE CUENTS LEANG AND WTE THE KCL EQUATON EPEAT THE POCESS AT NODE i v v v v O SUALZE CUENTS GONG NTO NODE ANOTHE EAMPLE OF WTNG NODE EQUATONS B B 5mA A MAK THE NODES (TO NSUE THAT NONE AE MSSNG) A 8k k 8k k C SELECT AS EFEENCE k 8k 8k B 5mA k WTE KCL AT EACH NODE N TEMS OF A A NODE A B B

7 A MODEL S SOLED BY MANPULATON OF EQUATONS AND USNG MAT ANALYSS NUMECAL MODEL LEANNG EAMPLE USE GAUSSAN ELMNATON THE NODE EQUATONS i A ma, i B k, ma THE MODEL EPLACE ALUES AND SWTCH NOTATON TO UPPE CASE ALTENATE MANPULATON ADD EQS [ ] * /k * / GHT HAND SDE S OLTS. COEFFS AE NUMBES * / (and add equations) 6[ ] SOLUTON USNG MAT ALGEBA PLACE N MAT FOM AND DO THE MAT ALGEBA... USE MAT ANALYSS TO SHOW SOLUTON PEFOM THE MAT MANPULATONS A Adj( A) A FO THE ADJONT EPLACE EACH ELEMENT BY TS COFACTO SAMPLE 8k k

8 AN EAMPLE OF NODE ANALYSS earranging v COULD WTE EQUATONS BY v CONDUCTANCES CONNECTED TO NODE CONDUCTANCES BETWEEN & CONDUCTANCES BETWEEN & CONDUCTANCES BETWEEN & WTNG EQUATONS BY NSPECTON FO CCUTS WTH ONLY NDEPENDENT SOUCES THE MAT S ALWAYS SYMMETC THE DAGONAL ELEMENTS AE POSTE THE OFF-DAGONAL ELEMENTS AE NEGATE Conductances connected to node Conductances between and Conductances between and Conductances between and ALD ONLY FO CCUTS WTHOUT DEPENDENT SOUCES

9 LEANNG : ma : ma k BY NSPECTON k k k k ma USNG KCL ma LEANNG ETENSON 6mA Node : ma 6mA 6 : 6mA k N MOST CASES THEE AE SEEAL DFFEENT WAYS OF SOLNG A POBLEM 8mA k (6 ma) ma k (6 ma) ma k NODE EQS. BY NSPECTON 6mA k ma k 6 Once node voltages are known k k CUENTS COULD BE COMPUTED DECTLY USNG KCL AND CUENT DDE!!

10 CCUTS WTH DEPENDENT SOUCES CCUTS WTH DEPENDENT SOUCES CANNOT BE MODELED BY NSPECTON. THE SYMMETY S LOST. A POCEDUE FO MODELNG WTE THE NODE EQUATONS USNG DEPENDENT SOUCES AS EGULA SOUCES. FO EACH DEPENDENT SOUCE WE ADD ONE EQUATON EPESSNG THE CONTOLLNG AABLE N TEMS OF THE NODE OLTAGES. NUMECAL EAMPLE LEANNG EAMPLE v v k k v v ma k k * / k * / v i o v i A v v v v MODEL FO CONTOLLNG AABLE v i o EPLACE AND EAANGE v v v v i A [ ] ADDNG THE EQUATONS 5 [ ] 5 LEANNG EAMPLE: CCUT WTH OLTAGE-CONTOLLED CUENT EPLACE AND EAANGE WTE NODE EQUATONS. TEAT DEPENDENT SOUCE AS EGULA SOUCE CONTNUE WTH GAUSSAN ELMNATON... O USE MAT ALGEBA EPESS CONTOLLNG AABLE N TEMS OF NODE OLTAGES FOU EQUATONS N OU UNKNOWNS. SOLE USNG FAOTE TECHNQUE.

11 USNG MATLAB TO SOLE THE NODE EQUATONS k, k, i [ A/ ] A ma, i k, B ma, DEFNE THE COMPONENTS OF THE CCUT DEFNE THE MAT G Entries in a row are separated by commas (or plain spaces). ows are separated by semi colon» =;=;=; =; %resistances in Ohm» ia=.;ib=.; %sources in Amps» alpha=; %gain of dependent source» G=[(/+/), -/, ; %first row of the matrix -/, (/+alpha+/), -(alpha+/); %second row, -/, (/+/)], %third row. End in comma to have the echo G = DEFNE GHT HAND SDE ECTO» =[ia;-ia;ib]; %end in ";" to skip echo SOLE LNEA EQUATON» =G\ % end with carriage return and get the echo = LEANNG ETENSON: FND NODE OLTAGES EAANGE AND MULTPLY BY k [ ] * / and add eqs. NODE EQUATONS : ma k k : O CONTOLLNG AABLE (N TEMS ON NODE OLTAGES) O k EPLACE ma k k k k k

12 LEANNG ETENSON FND THE OLTAGE O NODE EQUATONS x x ma k * / x O O * /k k k x O [ ] x x NOTCE EPLACEMENT OF DEPENDENT SOUCE N TEMS OF NODE OLTAGE [ ] O [ ] CCUTS WTH NDEPENDENT OLTAGE SOUCES nodes plus the reference. n principle one needs equations... but two nodes are connected to the reference through voltage sources. Hence, those node voltages are known!!! Hint: Each voltage source connected to the reference node saves one node equation One more example. Only one KCL is necessary k [ ] k SOLNG THE EQUATONS 6[ ] ( 6[ ] ) ( THESE AE THE EMANNG TWO NODE EQUATONS ).5[ ]

13 THE SUPENODE TECHNQUE We will use this example to introduce the concept of a SUPENODE SUPENODE Conventional node analysis requires all currents at a 6 ma S S k eqs, unknowns...panic!! The current through the source is not related to the voltage of the source. S Math solution: add one equation 6[ ] Efficient solution: enclose the source, and all elements in parallel, inside a surface. Apply KCL to the surface!!! ma ma k 6 The source current is interior to the surface and is not required. We STLL need one more equation. 6[ Only eqs in two unknowns!!! ] ALGEBAC DETALS The Equations () () 6mA ma k 6[ ] /k Solution. Eliminate denominators in Eq().Multiply by... [ ] 6[ ]. Add equations to eliminate [ ] [ ]. Use Eq() to compute 6[ ] [ ]

14 s S FND THE NODE OLTAGES AND THE POWE SUPPLED BY THE OLTAGE SOUCE s S k, [ ], s k [ ma], s 6[ ma] [ ] ma k k * /k [ ] adding: 6[ ] [ ] TO COMPUTE THE POWE SUPPLED BY OLTAGE SOUCE WE MUST KNOW THE CUENT THOUGH T. 6mA 8mA k k P [ ] 8[ ma] 6mW BASED ON PASSE SGN CONENTON, THE POWE S ECEED BY THE SOUCE!! LEANNG EAMPLE FND O SUPENODE, 6 SUPENODE KNOWN NODE OLTAGES CONSTANT

15 LEANNG ETENSON SUPENODE 6 SOUCES CONNECTED TO THE EFEENCE CONSTANT EQUATON S NOT NEEDED FO O SUPENODE k k k ( ) k 6 * / 5 8 OHM'S LAW and add * / k O. 8mA k WTE THE NODE EQUATONS supernode dentify all nodes, select a reference and label nodes. Nodes connected to reference through a voltage source oltage sources in between nodes and possible supernodes EQUATON BOOKKEEPNG: KCL@ _, KCL@ supernode, constraints equations and one known node Supernodes can be more complex KCL@_ 5 (Careful not to omit any current) CONSTANTS DUE TO OLTAGE SOUCES S 5 S 5 S 5 EQUATONS N FE UNKNOWNS.

16 CCUTS WTH DEPENDENT SOUCES PESENT NO SGNFCANT ADDTONAL COMPLETY. THE DEPENDENT SOUCES AE TEATED AS EGULA SOUCES. WE MUST ADD ONE EQUATON FO EACH CONTOLLNG AABLE LEANNG EAMPLE FND O OLTAGE SOUCE CONNECTED TO EFEENCE : KCL@ 6 x k k CONTOLLNG AABLE N TEMS OF NODE OLTAGES k * / 6 O ma k x 6 k EPLACE

17 SUPE NODE WTH DEPENDENT SOUCE OLTAGE SOUCE CONNECTED TO EFEENCE SUPENODE CONSTANT KCL AT SUPENODE x 6 CONTOLLNG AABLE N TEMS OF NODES x ( 6) * /k CUENT CONTOLLED OLTAGE SOUCE CONSTANT DUE TO SOUCE k CONTOLLNG AABLE N TEMS OF NODES x k k KCL AT SUPENODE ma ma [ ] * / and add 8[ ] O ma k x k x k

18 An example with dependent sources k k S k x a x nodes are connected to the reference through voltage sources DENTFY AND LABEL NODES EPESS CONTOLLNG AABLE N TEMS OF NODE OLTAGES S a x k S k k v k ( a has units of [olt/amp] EPLACE x N (8 a) S k * a k EPLACE N KCL ) What happens when a=8? S ( a a / ) LEANNG EAMPLE FND THE OLTAGE : k AT SUPE NODE ma k k k k k k : ma CONTOLLNG AABLE SOLE EQUATONS NOW AABLE OF NTEEST O 6

19 LEANNG EAMPLE Find the current o FND NODES AND SUPE node: 6 (constraint eq.) 5 k k k k k 5 : 5 k k CONTOLLNG AABLES k 7 eqs in 7 variables AABLE OF NTEEST O 5 k LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FST DETEMNES ALL CUENTS N A CCUT AND THEN T USES OHM S LAW TO COMPUTE NECESSAY OLTAGES THEE AE STUATON WHEE NODE ANALYSS S NOT AN EFFCENT TECHNQUE AND WHEE THE NUMBE OF EQUATONS EQUED BY THS NEW METHOD S SGNFCANTLY SMALLE

20 Apply node analysis to this circuit There are non reference nodes There is one super node There is one node connected to the reference through a voltage source We need three equations to compute all node voltages BUT THEE S ONLY ONE CUENT FLOWNG THOUGH ALL COMPONENTS AND F THAT CUENT S DETEMNED ALL OLTAGES CAN BE COMPUTED WTH OHM S LAW STATEGY:. Apply KL (sum of voltage drops =) [ ] 8[ ]. Use Ohm s Law to express voltages in terms of the loop current. [ ] 8[ ] ESULT S ONE EQUATON N THE LOOP CUENT!!! SHOTCUT Skip this equation Write this one directly LOOPS, MESHES AND LOOP CUENTS a b 7 c f 6 e 5 d A BASC CCUT EACH COMPONENT S CHAACTEZED BY TS OLTAGE ACOSS AND TS CUENT THOUGH A LOOP S A CLOSED PATH THAT DOES NOT GO TWCE OE ANY NODE. THS CCUT HAS THEE LOOPS. fabef ebcde abcdefa A MESH S A LOOP THAT DOES NOT ENCLOSE ANY OTHE LOOP. fabef, ebcde AE MESHES. A LOOP CUENT S A (FCTTOUS) CUENT THAT S ASSUMED TO FLOW AOUND A LOOP.,, AE LOOP CUENTS A MESH CUENT S A LOOP CUENT ASSOCATED TO A MESH., AE MESH CUENTS. CLAM: N A CCUT, THE CUENT THOUGH ANY COMPONENT CAN BE EPESSED N TEMS OF THE LOOP CUENTS. EAMPLES a f FACT: NOT EEY LOOP CUENT S EQUED TO COMPUTE ALL THE CUENTS THOUGH COMPONENTS. a b e b c b 7 c f 6 e 5 d A BASC CCUT THE DECTON OF THE LOOP CUENTS S SGNFCANT. USNG TWO LOOP CUENTS a f be bc FO EEY CCUT THEE S A MNMUM NUMBE OF LOOP CUENTS THAT AE NECESSAY TO COMPUTE EEY CUENT N THE CCUT. SUCH A COLLECTON S CALLED A MNMAL SET (OF LOOP CUENTS).

21 FO A GEN CCUT LET: B NUMBE OF BANCHES N NUMBE OF NODES THE MNMUM EQUED NUMBE OF LOOP CUENTS S L B ( N ) DETEMNATON OF LOOP CUENTS KL ON LEFT MESH KL ON GHT MESH MESH CUENTS AE ALWAYS NDEPENDENT AN EAMPLE USNG OHM S LAW v i, v i, v ( i i ) v i, v i 5 5 EPLACNG AND EAANGNG B 7 N 6 L 7 (6 ) TWO LOOP CUENTS AE EQUED. THE CUENTS SHOWN AE MESH CUENTS. HENCE THEY AE NDEPENDENT AND FOM A MNMAL SET. N MAT FOM i v S i v 5 S THESE AE LOOP EQUATONS FO THE CCUT WTE THE MESH EQUATONS v i BOOKKEEPNG BANCHES = 8 NODES = 7 LOOP CUENTS NEEDED = AND WE AE TOLD TO USE MESH CUENTS! THS DEFNES THE LOOP CUENTS TO BE USED DENTFY ALL OLTAGE DOPS WTE KL ON EACH MESH v i TOP MESH: v BOTTOM: v USE OHM S LAW v ( i i v ) S v vs v v 5 v5 v vs v i i 5

22 DEELOPNG A SHOTCUT WTE THE MESH EQUATONS WHENEE AN ELEMENT HAS MOE THAN ONE LOOP CUENT FLOWNG THOUGH T, WE COMPUTE NET CUENT N THE DECTON OF TAEL 5 DAW THE MESH CUENTS. OENTATON CAN BE ABTAY, BUT BY CONENTON THEY AE DEFNED CLOCKWSE. NOW WTE KL FO EACH MESH AND APPLY OHM S LAW TO EEY ESSTO. AT EACH LOOP, FOLLOW THE PASSE SGN CONENTON USNG LOOP CUENT EFEENCE DECTON. ( ) 5 ( ) LEANNG EAMPLE: FND o USNG LOOP ANALYS AN ALTENATE SELECTON OF LOOP CUENTS SHOTCUT: POLATES AE NOT NEEDED. APPLY OHM S LAW TO EACH ELEMENT AS KL S BENG WTTEN EAANGE k 9k NOW O * / and add k 6. 5mA 5 k ma EPESS AABLE OF NTEEST AS FUNCTON OF LOOP CUENTS O EAANGE THS SELECTON S MOE EFFCENT k * / 9k 9 * / and substract k 8 ma

23 F THE CCUT CONTANS ONLY NDEPENDENT SOUCES, THE MESH EQUATONS CAN BE WTTEN BY NSPECTON. A PACTCE EAMPLE MUST HAE ALL MESH CUENTS WTH THE SAME OENTATON N LOOP K THE COEFFCENT OF k S THE SUM OF ESSTANCES AOUND THE LOOP. LOOP coefficient of coefficient of coefficient of k HS 6[ ] THE GHT HAND SDE S THE ALGEBAC SUM OF OLTAGE SOUCES AOUND THE LOOP (OLTAGE SES - OLTAGE DOPS) THE COEFFCENT OF j S THE SUM OF ESSTANCES COMMON TO BOTH k AND j AND WTH A NEGATE SGN. LOOP coefficient of coefficient of 9k k coefficient of k HS 6[ ] LOOP k LOOP 9k Loop (6 k ) ( k ) (k k ) LEANNG ETENSON. DAW THE MESH CUENTS. WTE MESH EQUATONS MESH ( k k k) k [ ] MESH k (k ) (6 ). SOLE EQUATONS 8 [ ma] 8 9[ ma] * / [ ma] O and add DDE BY k. GET NUMBES FO COEFFCENTS ON THE LHS AND ma ON THE HS. [ ] 5

24 WTE THE MESH EQUATONS k k k k. DAW MESH CUENTS 9 BOOKKEEPNG: B = 7, N =. WTE MESH EQUATONS. USE KL MESH : k ( ) MESH : k( ) k( ) MESH : 9 ( ) k( ) MESH : k( ) k 9 CHOOSE YOU FAOTE TECHNQUE TO SOLE THE SYSTEM OF EQUATONS EQUATONS BY NSPECTON 8k 8k k k k k 9 k 9 CCUTS WTH NDEPENDENT CUENT SOUCES KL THEE S NO ELATONSHP BETWEEN AND THE SOUCE CUENT! HOWEE... MESH CUENT S CONSTANED MESH EQUATON MESH BY NSPECTON ma k 8k k (ma) 9 ma O [ 8k CUENT SOUCES THAT AE NOT SHAED BY OTHE MESHES (O LOOPS) SEE TO DEFNE A MESH (LOOP) CUENT AND EDUCE THE NUMBE OF EQUED EQUATONS ] TO OBTAN, APPLY KL TO ANY CLOSED PATH THAT NCLUDES

25 LEANNG EAMPLE COMPUTE O USNG MESH ANALYSS KL FO o TWO MESH CUENTS AE DEFNED BY CUENT SOUCES ma ma MESH USE KL TO COMPUTE o BY NSPECTON k(ma) k( ma) k k k k ma LEANNG ETENSONS WE ACTUALLY NEED THE CUENT ON THE GHT MESH. HENCE, USE MESH ANALYSS. MESH : ma MESH : 5[ ] k( ) 5mA ma ma O [ ] 5 MESH : ma MESH : k k O 6 ma 8[ ]

26 CUENT SOUCES SHAED BY LOOPS - THE SUPEMESH APPOACH. WTE CONSTANT EQUATON DUE TO MESH CUENTS SHANG CUENT SOUCES ma. WTE EQUATONS FO THE OTHE MESHES ma. DEFNE A SUPEMESH BY (MENTALLY) EMONG THE SHAED CUENT SOUCE. SELECT MESH CUENTS 5. WTE KL FO THE SUPEMESH 6 k k k( ) k ( ) SUPEMESH NOW WE HAE THEE EQUATONS N THEE UNKNOWNS. THE MODEL S COMPLETE. CUENT SOUCES SHAED BY MESHES - THE GENEAL LOOP APPOACH THE STATEGY S TO DEFNE LOOP CUENTS THAT DO NOT SHAE CUENT SOUCES. EEN F T MEANS ABANDONNG MESHES FO CONENENCE, STAT USNG MESH CUENTS UNTL EACHNG A SHAED SOUCE. AT THAT PONT, DEFNE A NEW LOOP. N ODE TO GUAANTEE THAT T GES AN NDEPENDENT EQUATON, ONE MUST MAKE SUE THAT THE LOOP NCLUDES COMPONENTS THAT AE NOT PAT OF PEOUSLY DEFNED LOOPS. A POSSBLE STATEGY S TO CEATE A LOOP BY OPENNG THE CUENT SOUCE. THE LOOP EQUATONS FO THE LOOPS WTH CUENT SOUCES AE ma ma THE LOOP EQUATON FO THE THD LOOP S 6[ ] k k( ) k( ) k ( ) THE MESH CUENTS OBTANED WTH THS METHOD AE DFFEENT FOM THE ONES OBTANED WTH A SUPEMESH. EEN FO THOSE DEFNED USNG MESHES.

27 FND OLTAGES ACOSS ESSTOS S S S For loop analysis we notice S Three independent current sources. Four meshes. One current source shared by two meshes. Careful choice of loop currents should make only one loop equation necessary. Three loop currents can be chosen using meshes and not sharing any source. Now we need a loop current that does not go over any current source and passes through all unused components. HNT: F ALL CUENT SOUCES AE EMOED THEE S ONLY ONE LOOP LEFT SOLE FO THE CUENT. USE OHM S LAW TO COMPUTE EQUED OLTAGES ( ) MESH EQUATONS FO LOOPS WTH CUENT SOUCES s S S KL OF EMANNG LOOP S ( ) ( ) ( ) ( ) ( ) ( ) A COMMENT ON METHOD SELECTON The same problem can be solved by node analysis but it requires equations S S - + S S S S S S S

28 CCUTS WTH DEPENDENT SOUCES Treat the dependent source as though it were independent. Add one equation for the controlling variable COMBNE EQUATONS. DDE BY k. MESH CUENTS DETEMNED BY SOUCES ma k MESH : MESH : x k x k( ) k ( ) k( ) k ( ) CONTOLLNG AABLES x k( ) 8 SOLE USNG MATLAB 8 PUT N MAT FOM Since we divided by k, the HS is ma and all the coefficients are numbers. 8 >> is the MATLAB prompt. What follows is the command entered. DEFNE THE MAT» =[,,,; %FST OW,, -, ; %SECOND OW,,,-; %THD OW,-,-,] %FOUTH OW = DEFNE THE GHT HAND SDE ECTO» =[;;8;] = 8 - SOLE AND GET THE ANSWE» =\ The answers are in ma =

29 LEANNG ETENSON: Dependent Sources Find o USNG MESH CUENTS USNG LOOP CUENTS We treat the dependent source as one more voltage source x LOOP k( ) k MESH k k( ) MESH 6 k( ) and solve... x k LOOP k( ) x NOW WE EPESS THE CONTOLLNG AABLE N TEMS OF THE LOOP CUENTS x k( ) k k k k ma,. 5mA NOTCE THE DFFEENCE BETWEEN MESH CUENT AND LOOP CUENT EEN THOUGH THEY AE ASSOCATED WTH THE SAME PATH EPLACE AND EAANGE O SOLUTONS 9[ ] x k 8k.5mA,. 5mA The selection of loop currents simplifies expression for x and computation of o. DEPENDENT CUENT SOUCE. CUENT SOUCES NOT SHAED BY MESHES WE AE ASKED FO o. WE ONLY NEED TO SOLE FO EPLACE AND EAANGE x x k k( ) 8k k ma ma 8 We treat the dependent source as a conventional source Equations for meshes with current sources O [ ] Then KL on the remaining loop(s) And express the controlling variable, x, in terms of loop currents

30 DAW MESH CUENTS WTE MESH EQUATONS. MESH : k x k k( ) MESH : k k( ) CONTOLLNG AABLE N TEMS OF LOOP CUENTS x EPLACE AND EAANGE k SOLE FO k 6mA O k [ ] n the following, we shall solve using loop analysis two circuits that had previously been solved using node analysis. This is one circuit. We recap first the node analysis approach and then we solve using loop analysis.

31 LEANNG EAMPLE FND THE OLTAGE o ECAP OF NODE : k AT SUPE NODE ma k k k k k ma k : CONTOLLNG AABLE SOLE EQUATONS NOW 6 AABLE OF NTEEST O DETEMNE o USNG LOOP ANALYSS Write loop equations Loop : ma Loop : ma Loop : k k( ) Loop : k( ) k Controlling variable: k( ) k k 6 ma, ma k 8 ariable of nterest O k STAT SELECTON USNG MESHES SELECT A GENEAL LOOP TO AOD SHANG A CUENT SOUCE

32 LEANNG EAMPLE Find the current o ECAP OF NODE node: 6 (constraint eq.) 5 k k k k k 5 : 5 k k CONTOLLNG AABLES k AABLE OF NTEEST 7 eqs in 7 variables O 5 k Find the current o using mesh analysis Write loop/mesh equations Select mesh currents Loop: k k( ) k( ) Loop : k ( ) 6 k ( ) 5 Loop : Loop : k( ) Loop 5: k ( ) k ( ) Loop 6: k ( ) k k ( ) Controlling variables k 8 eqs in 8 unknowns 5 6 ariable of interest: O 6

33 APPLCATON MANUAL SPEED CONTOL FO DC MOTO Battery i Speed is proportional to applied voltage, M Potentiometer Arm is movable and allows to change and keeping their sum constant: pot Assumption speed i (no load) battery Potentiometer is not affected by connection to amplifier Circuit diagram [rpm] K K M M M speed [rpm] K M battery Design Example A k A Analysis of solution O Model using node analysis S An 8-volt source is to be used in conjunction with two standard resistors to design a voltage divider that will output 5 when connected to a μa load. While keeping the consumed power as low as possible, we wish to minimize the error between the actual output and the required 5 volts. P Standard= Off-the-shelf available only in certain values O s O A, 5, 8 O O S O O S O Find, eg..: 5 O 5 or : O Design equations O O.98 esistor values should be high Why not use very large values? Use trial and error. Pick Highest possible, determine and analyze resulting circuit. 5 7 k 5 / k O Closest k Are there other factors that we should consider; e.g., is o really constant? Tolerances?

34

NODAL AND LOOP ANALYSIS TECHNIQUES

NODAL AND LOOP ANALYSIS TECHNIQUES NODAL AND LOOP ANALYSIS TECHNIQUES LEANING GOALS NODAL ANALYSIS LOOP ANALYSIS Deelop systematic techniques to determine all the oltages and currents in a circuit NODE ANALYSIS One of the systematic ways

More information

RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS

RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS RESSTE CRCUTS MULT NODE/LOOP CRCUT ANALYSS DEFNNG THE REFERENCE NODE S TAL 4 THESTATEMENT 4 S MEANNGLES UNTL THE REFERENCE PONT S DEFNED BY CONENTON THE GROUND SYMBOL SPECFES THE REFERENCE PONT. ALL NODE

More information

LOOP ANALYSIS. determine all currents and Voltages in IT IS DUAL TO NODE ANALYSIS - IT FIRST DETERMINES ALL CURRENTS IN A CIRCUIT

LOOP ANALYSIS. determine all currents and Voltages in IT IS DUAL TO NODE ANALYSIS - IT FIRST DETERMINES ALL CURRENTS IN A CIRCUIT LOOP ANALYSS The second systematic technique to determine all currents and oltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE NECESSARY

More information

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE

More information

BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis

BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING Drect Current Crcuts : Methods of Analyss Ismal Mohd Kharuddn, Zulkfl Md Yusof Faculty of Manufacturng Engneerng Unerst Malaysa Pahang Drect Current Crcut

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

arxiv: v1 [math.co] 21 Jan 2016

arxiv: v1 [math.co] 21 Jan 2016 PROOF OF BIJECTION FOR COMBINATORIAL NUMBER SYSTEM axv:60.05794v [math.co] Jan 06 ABU BAKAR SIDDIQUE, SAADIA FARID, AND MUHAMMAD TAHIR Abstact. Combnatoal numbe system epesents a non-negatve natual numbes

More information

4.2. Co-terminal and Related Angles. Investigate

4.2. Co-terminal and Related Angles. Investigate .2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as

More information

Interactive NURBS Tutorial in Virtual Reality

Interactive NURBS Tutorial in Virtual Reality Inteacte NURBS Ttoal n Vtal Realty Eng 477 Poect Fa Octobe 10 2006 Edmond Nadle enadle@mch.ed 734 913-6970 Eng 477 Poect Fa Octobe 10 2006 Eng 477 Poect Fa Octobe 10 2006 NURBS Ces and Sfaces = Non-Unfom

More information

ELECTRICAL CIRCUIT AND MACHINE ENT 249/3. Methods of Analysis

ELECTRICAL CIRCUIT AND MACHINE ENT 249/3. Methods of Analysis ELECTRICAL CIRCUIT AND MACHINE ENT 49/ Methods of Analysis Introduction Nodal Analysis KCL & Ohm s Law Nodal Analysis with Voltage Sources (Supernode) KCL, Ohm s & KVL Law Mesh Analysis - KVL & Ohm s Law

More information

A SAS Macro for Finding Optimal k-means Clustering in One Dimension with Size Constraints

A SAS Macro for Finding Optimal k-means Clustering in One Dimension with Size Constraints Pape SD-02 A SAS Maco fo Fndng Optmal k-means Clusteng n One Dmenson wth Sze Constants Fengao Hu, Geoga Regents Unvesty; Robet E. Johnson, Vandeblt Unvesty ABSTRACT Wang and Song (2011) poposed a k-means

More information

Refraction Ray Normal

Refraction Ray Normal Ray Nomal wave cests θ Bounday θ θ θ less dense, n1 moe dense, n2 (>n1) Moe Smply: θ θ Note: (Lght) Rays bend towads the nomal when gong fom a egon of low ndex of efacton to a egon of hgh ndex of efacton

More information

Method of analysis. Bởi: Sy Hien Dinh

Method of analysis. Bởi: Sy Hien Dinh Method of analysis Bởi: Sy Hien Dinh INTRODUCTION Having understood the fundamental laws of circuit theory (Ohm s law and Kirchhhoff s laws), we are now prepared to apply to develop two powerful techniques

More information

Lecture 3. ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Fourth Edition, by Allan R. Hambley, 2008 Pearson Education, Inc.

Lecture 3. ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Fourth Edition, by Allan R. Hambley, 2008 Pearson Education, Inc. Lecture 3 Circuit i Laws, Voltage & Current Dividers ELECTICAL ENGINEEING: PINCIPLES AND APPLICATIONS, Fourth Edition, by Allan. Hambley, 008 Pearson Education, Inc. KICHHOFF S CUENT LAW The net current

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

A Bayesian Approach toward Active Learning for Collaborative Filtering

A Bayesian Approach toward Active Learning for Collaborative Filtering A Bayesan Appoach towad Actve Leanng fo Collaboatve Flteng Rong Jn Depatment of Compute Scence and Engneeng Mchgan State Unvesty ong@cse.cmu.edu Abstact Collaboatve flteng s a useful technque fo eplotng

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

The mesh-current method

The mesh-current method The mesh-current method Equivalent resistance Voltage / current dividers Source transformations Node voltages Mesh currents Superposition Mirror image of the node-voltage method. Define mesh currents flowing

More information

Any modern computer system will incorporate (at least) two levels of storage:

Any modern computer system will incorporate (at least) two levels of storage: 1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe

More information

One-Dimensional Linear Local Prototypes for Effective Selection of Neuro-Fuzzy Sugeno Model Initial Structure

One-Dimensional Linear Local Prototypes for Effective Selection of Neuro-Fuzzy Sugeno Model Initial Structure One-Dmensonal Lnea Local Pototypes fo Effectve Selecton of euo-fuzzy Sugeno Model Intal Stuctue Jace Kabzńs Insttute of Automatc Contol, Techncal Unvesty of Lodz, Stefanowsego 8/22, 90 924 Lodz, Poland,

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

FUNDAMENTALS OF RADIOMETRY

FUNDAMENTALS OF RADIOMETRY 1 FUNDAMENTALS OF RADIOMETRY Lectue 5 Radomety 2 Quanttatve measuement of the popetes of EM adaton nteacton wth matte o emsson fom t Radomety deals wth total EM adaton We extend the concept of adans n

More information

Computer Science 141 Computing Hardware

Computer Science 141 Computing Hardware Compute Science 141 Computing Hadwae Fall 2006 Havad Univesity Instucto: Pof. David Books dbooks@eecs.havad.edu [MIPS Pipeline Slides adapted fom Dave Patteson s UCB CS152 slides and May Jane Iwin s CSE331/431

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Planar Curve Representation and Matching

Planar Curve Representation and Matching Plana Cuve Repesentaton and Matchng Mahe Al-Khayat and Fahad Kamanga Compute Scence and Engneeng Depatment Unvesty of Texas at Alngton Alngton, Texas 7609, USA [al-khay kamanga]@cse.uta.edu Abstact In

More information

Effectiveness evaluation of electronic warfare command and control system based on grey AHP method

Effectiveness evaluation of electronic warfare command and control system based on grey AHP method Avalable onlne www.jocp.com Jounal of hemcal and Phamaceutcal Reseach, 014, 6(7):535-54 Reseach Atcle ISSN : 0975-7384 ODEN(USA) : JPR5 Effectveness evaluaton of electonc wafae command and contol system

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

Assessment of Track Sequence Optimization based on Recorded Field Operations

Assessment of Track Sequence Optimization based on Recorded Field Operations Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment

More information

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation

More information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

i v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ

i v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ 5V 6 v 6 î v v Ω î Ω v v 8Ω V î v 5 6Ω 5 Mesh : 6ˆ ˆ = Mesh : ˆ 8ˆ = Mesh : ˆ ˆ ˆ 8 0 = 5 Solvng ˆ ˆ ˆ from () = Solvng ˆ ˆ ˆ from () = 7 7 Substtutng () and (5) nto () (5) and (6) 9 ˆ = A 8 ˆ = A 0 ()

More information

5.0 Quality Assurance

5.0 Quality Assurance 5.0 Dr. Fred Omega Garces Analytcal Chemstry 25 Natural Scence, Mramar College Bascs of s what we do to get the rght answer for our purpose QA s planned and refers to planned and systematc producton processes

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

Strongly Connected Components. Uses for SCC s. Two Simple SCC Algorithms. Directed Acyclic Graphs

Strongly Connected Components. Uses for SCC s. Two Simple SCC Algorithms. Directed Acyclic Graphs CSE Intoduction to Algoithms Depth Fist Seach and Stongly Connected Components W.L. Ruzzo, Summe 00 Undiected Depth-Fist Seach It s not just fo tees DFS() back edge tee edge if maked then etun; mak ; #

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Robust Proper Clustering Structure Fuzzy Modeling for Function Approximation

Robust Proper Clustering Structure Fuzzy Modeling for Function Approximation Robust Pope lusteng Stuctue Fuzzy Modelng fo Functon Appoxmaton hh-hng Hsao Depatment of Electcal Engneeng Kao Yuan Unvesty Kaohsung ounty,tawan RO hsao@ooneentustedutw Shun-Feng Su Depatment of Electcal

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number. Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show

More information

ART GALLERIES WITH INTERIOR WALLS. March 1998

ART GALLERIES WITH INTERIOR WALLS. March 1998 ART GALLERIES WITH INTERIOR WALLS Andé Kündgen Mach 1998 Abstact. Conside an at galley fomed by a polygon on n vetices with m pais of vetices joined by inteio diagonals, the inteio walls. Each inteio wall

More information

Volumetric Textures. Esteban W. Gonzalez Clua 1 Marcelo Dreux 2

Volumetric Textures. Esteban W. Gonzalez Clua 1 Marcelo Dreux 2 Volumetc Textues Esteban W. Gonzalez Clua 1 Macelo Deux 2 1 PUC-Ro - Depatment of Compute Scence Rua Maquês de São Vcente, 255, 22443-900, Ro de Janeo, RJ, Bazl esteban @nf.puc-o.b 2 PUC-RIO Mechancal

More information

TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics

TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics TESSELLATIONS This is a sample (daft) chapte fom: MATHEMATICAL OUTPOURINGS Newslettes and Musings fom the St. Mak s Institute of Mathematics James Tanton www.jamestanton.com This mateial was and can still

More information

OPL: a modelling language

OPL: a modelling language OPL: a modellng language Carlo Mannno (from OPL reference manual) Unversty of Oslo, INF-MAT60 - Autumn 00 (Mathematcal optmzaton) ILOG Optmzaton Programmng Language OPL s an Optmzaton Programmng Language

More information

Multidimensional Testing

Multidimensional Testing Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of

More information

Recognition of Shapes for Object Retrieval in Image Databases by Discrete Curve Evolution and Two Consecutive Primitive Edges

Recognition of Shapes for Object Retrieval in Image Databases by Discrete Curve Evolution and Two Consecutive Primitive Edges Poceedngs of the Intenatonal MultConfeence of Engnees and Compute Scentsts 009 Vol I IMECS 009 Mach 8-0 009 Hong Kong Recognton of Shapes fo Object Reteval n Image Databases by Dscete Cuve Evoluton and

More information

Topic 4 Root Finding

Topic 4 Root Finding Couse Instucto D. Ramond C. Rump Oice: A 337 Phone: (915) 747 6958 E Mail: cump@utep.edu Topic 4 EE 4386/531 Computational Methods in EE Outline Intoduction Backeting Methods The Bisection Method False

More information

Derivation of the Nodal Forces Equivalent to Uniform Pressure for Quadratic Isoparametric Elements RAWB, Last Update: 30 September 2008

Derivation of the Nodal Forces Equivalent to Uniform Pressure for Quadratic Isoparametric Elements RAWB, Last Update: 30 September 2008 Deivation of the odal oces Equivalent to Unifom Pessue fo Quadatic sopaametic Elements RWB, Last Update: 0 Septembe 008 The displacement vecto u at an point within a single element, E, is lineal elated

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

An Extension to the Local Binary Patterns for Image Retrieval

An Extension to the Local Binary Patterns for Image Retrieval , pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science

More information

FFT Library. Module user s Guide C28x Foundation Software

FFT Library. Module user s Guide C28x Foundation Software FFT Lbay Module use s Gude C8x Foundaton Softwae Texas Instuments Inc., May 00 Texas Instuments Inc., May 00 IMPORTAT OTICE Texas Instuments and ts subsdaes (TI) eseve the ght to make changes to the poducts

More information

Administrivia. CMSC 411 Computer Systems Architecture Lecture 5. Data Hazard Even with Forwarding Figure A.9, Page A-20

Administrivia. CMSC 411 Computer Systems Architecture Lecture 5. Data Hazard Even with Forwarding Figure A.9, Page A-20 Administivia CMSC 411 Compute Systems Achitectue Lectue 5 Basic Pipelining (cont.) Alan Sussman als@cs.umd.edu as@csu dedu Homewok poblems fo Unit 1 due today Homewok poblems fo Unit 3 posted soon CMSC

More information

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

More information

Lecture 27: Voronoi Diagrams

Lecture 27: Voronoi Diagrams We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the

More information

GARBAGE COLLECTION METHODS. Hanan Samet

GARBAGE COLLECTION METHODS. Hanan Samet gc0 GARBAGE COLLECTION METHODS Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

10/29/2010. Rendering techniques. Global Illumination. Local Illumination methods. Today : Global Illumination Modules and Methods

10/29/2010. Rendering techniques. Global Illumination. Local Illumination methods. Today : Global Illumination Modules and Methods Rendeing techniques Compute Gaphics Lectue 10 Can be classified as Local Illumination techniques Global Illumination techniques Global Illumination 1: Ray Tacing and Radiosity Taku Komua 1 Local Illumination

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits

More information

COSC 6385 Computer Architecture. - Pipelining

COSC 6385 Computer Architecture. - Pipelining COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped

More information

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension 17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Animated Deformations with Radial Basis Functions

Animated Deformations with Radial Basis Functions Anmated Defomatons wth Radal Bass Functons Jun-yong Noh Compute Scence Depatment IMSC Unesty of Southen Calfona noh@gaphcs.usc.edu Douglas Fdaleo Compute Scence Depatment IMSC Unesty of Southen Calfona

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

An Optimization Procedure In A Production Line Of Sokat Soap Industry, Ikotun, Lagos State. Adamawa State, Nigeria.

An Optimization Procedure In A Production Line Of Sokat Soap Industry, Ikotun, Lagos State. Adamawa State, Nigeria. An Optmzaton Pocedue In A Poducton Lne Of Sokat Soap Industy, Ikotun, Lagos State. 1 O.S. Balogun, 2 A.A. Olatun and 3 A.A. Momoh 1 Depatment of Statstcs and Opeatons Reseach, Modbbo Adama Unvesty of Technology,

More information

High level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization

High level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton

More information

Gravitational Shift for Beginners

Gravitational Shift for Beginners Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational

More information

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the

More information

2D Transformations. Why Transformations. Translation 4/17/2009

2D Transformations. Why Transformations. Translation 4/17/2009 4/7/9 D Tansfomations Wh Tansfomations Coodinate sstem tansfomations Placing objects in the wold Move/animate the camea fo navigation Dawing hieachical chaactes Animation Tanslation + d 5,4 + d,3 d 4,

More information

COEN-4730 Computer Architecture Lecture 2 Review of Instruction Sets and Pipelines

COEN-4730 Computer Architecture Lecture 2 Review of Instruction Sets and Pipelines 1 COEN-4730 Compute Achitectue Lectue 2 Review of nstuction Sets and Pipelines Cistinel Ababei Dept. of Electical and Compute Engineeing Maquette Univesity Cedits: Slides adapted fom pesentations of Sudeep

More information

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume

More information

LU Decomposition Method Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America

LU Decomposition Method Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America nbm_sle_sm_ludecomp.nb 1 LU Decomposton Method Jame Trahan, Autar Kaw, Kevn Martn Unverst of South Florda Unted States of Amerca aw@eng.usf.edu nbm_sle_sm_ludecomp.nb 2 Introducton When solvng multple

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

All lengths in meters. E = = 7800 kg/m 3

All lengths in meters. E = = 7800 kg/m 3 Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:

More information

CISC 662 Graduate Computer Architecture Lecture 6 - Hazards

CISC 662 Graduate Computer Architecture Lecture 6 - Hazards CISC 662 Gaduate Compute Achitectue Lectue 6 - Hazads Michela Taufe http://www.cis.udel.edu/~taufe/teaching/cis662f07 Powepoint Lectue Notes fom John Hennessy and David Patteson s: Compute Achitectue,

More information

A fault tree analysis strategy using binary decision diagrams

A fault tree analysis strategy using binary decision diagrams Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:

More information

Output Primitives. Ellipse Drawing

Output Primitives. Ellipse Drawing Output Pimitives Ellipse Dawing Ellipses. An ellipses is an elongated cicle and can be dawn with modified cicle dawing algoithm.. An ellipse has set of fied points (foci) that will have a constant total

More information

UCB CS61C : Machine Structures

UCB CS61C : Machine Structures inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called

More information

FACE VECTORS OF FLAG COMPLEXES

FACE VECTORS OF FLAG COMPLEXES FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Prof. Feng Liu. Fall /17/2016

Prof. Feng Liu. Fall /17/2016 Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Prioritized Traffic Recovery over GMPLS Networks

Prioritized Traffic Recovery over GMPLS Networks Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing

More information

Goal. Rendering Complex Scenes on Mobile Terminals or on the web. Rendering on Mobile Terminals. Rendering on Mobile Terminals. Walking through images

Goal. Rendering Complex Scenes on Mobile Terminals or on the web. Rendering on Mobile Terminals. Rendering on Mobile Terminals. Walking through images Goal Walking though s -------------------------------------------- Kadi Bouatouch IRISA Univesité de Rennes I, Fance Rendeing Comple Scenes on Mobile Teminals o on the web Rendeing on Mobile Teminals Rendeing

More information

Lecture 8 Introduction to Pipelines Adapated from slides by David Patterson

Lecture 8 Introduction to Pipelines Adapated from slides by David Patterson Lectue 8 Intoduction to Pipelines Adapated fom slides by David Patteson http://www-inst.eecs.bekeley.edu/~cs61c/ * 1 Review (1/3) Datapath is the hadwae that pefoms opeations necessay to execute pogams.

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Reader & ReaderT Monad (11A) Young Won Lim 8/20/18

Reader & ReaderT Monad (11A) Young Won Lim 8/20/18 Copyight (c) 2016-2018 Young W. Lim. Pemission is ganted to copy, distibute and/o modify this document unde the tems of the GNU Fee Documentation License, Vesion 1.2 o any late vesion published by the

More information

1 N-Queen Problem as a CSP (23 points + 5 bonus)

1 N-Queen Problem as a CSP (23 points + 5 bonus) Spin Semeste, 2011 CSCE 421/821: Foundations of Constaint Pocessin B.Y. Chouei Homewok 4 Assined: Monda, Fe 28, 2011 Due: Monda, Ma 7, 2011 Total value: 100 points (+ 5 onus points). Penalt of 20 points

More information

Shortest Paths for a Two-Robot Rendez-Vous

Shortest Paths for a Two-Robot Rendez-Vous Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information