VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS
|
|
- Chester Hutchinson
- 5 years ago
- Views:
Transcription
1 VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS M. Rodríguez Montañés J. Rquelme Santos E. Romero Ramos Isotrol Unversty of Sevlla Unversty of Sevlla Sevlla, Span Sevlla, Span Sevlla, Span Abstract - Ths paper s about the development of a fast but exact enough technque to solve the optmal allocaton and szng of capactors on power systems, no matter the voltage level. The proposed methodology s manly characterzed by assumng a lnear behavour for the reactve problem and havng an objectve functon that mnmzes the sum of the voltage magntude devatons from the specfed voltage lmts squared, for all those buses wth over/under voltages. The proposed approach has been tested on the IEEE 14-bus and 30-bus systems, and on an exstng dstrbuton system wth actual data. Results are compared wth those of usng an exact calculaton of voltages. Keywords - Capactor placement, capactor szng, VAR plannng, senstvty factor, voltage profle. 1 Introducton PO wer dstrbuton from electrc power generators to consumers s accomplshed va the transmsson, subtransmsson, and dstrbuton lnes. Voltage profle mprovement and system losses reducton by capactor nstallaton depend greatly on how capactors are placed and operated n the system [1, 2]. The general capactor placement problem conssts of determnng the optmal locaton and sze of capactors to be nstalled and the effcent control schemes n the buses of the system [3]-[8]. Much mathematcal research on the capactor placement has been studed n dstrbuton systems. A nonlnear programmng such as gradent search method s proposed n [1]. Baran and Wu [2] decomposed capactor placement problem nto a master problem and a slave problem by usng mxed nteger programmng. The master problem determnes the locaton of the capactors and the slave problem determnes the type and sze of the capactors. Smulated annealng s used n [3, 4] after formulatng capactor placement problem as a dscrete combnatonal optmzaton problem. Huang et al. [5] proposes by tabu search (TS)-based soluton algorthm and uses senstvty analyss method to select the canddate nstallaton locatons of capactors to reduce the search space. Also, many researchers proposed genetc algorthm (GA) applcaton to search global optmal soluton of capactor placement problem [6, 7, 8]. Sundhararajan et al. [6] used senstvty analyss to search the locaton of the capactors and GA to determne the sze of the capactors, whch somewhat depends on experences n the selecton of the probablty parameters. Mu et al. [7] suggested the two-stage algorthms that combne the good qualtes of GA and a fast senstvty-based heurstc. Ths paper presents a lnear reasonng for determnng the optmal locatons and szes for capactor placement for voltage profle mprovement. Voltage senstvty ndces have been usually used as ndcators of voltage stablty and several ndces of ths knd have been proposed [9, 10]. One such voltage senstvty ndex, dv/dq, called the reactve voltage senstvty factor (RP V S), was the frst ndex used to predct voltage control problems [11]. Ths ndex also provdes a means of allocatng capactors to mprove bus voltages as we shall show. The analyss of the results after applyng the proposed algorthm to dfferent systems allow to conclude that the new methodology s qute fast and accurate so t can be used not only by the planner of the system, but also on real tme to determne the best way to operate on all the swtched capactors beng on the system to mprove all voltages n a global way. The papers s structured as follows: secton 2 defnes bus voltage senstvty factors and how computng them. Next, n secton 3 the mathematcal problem of optmzaton s posed, focused on mnmzng voltage magntude devatons from the specfed voltage lmts by usng the bus voltage senstvty factors. Once the mnmzaton problem s solved, a heurstc algorthm lookng for establshng the mnmum number of allocatons and swtches s descrbed. Secton 4 apples the new methodology to three dfferent cases, two IEEE test systems and an actual one. Results are fnally commented and analyzed. 2 Bus voltage senstvty factors A senstvty whch gven the varaton of node voltage magntude due to a unt reactve power njecton to node j s called the reactve power voltage senstvty (RP V S j ) and denoted by ( V / Q j ). The lnearzed steady state system power voltage equatons are gven by, [ ][ ] [ ] H N θ P = (1) M L V Q where P and Q are vectors of real and reactve bus power njecton changes, whle θ and V are vectors of bus voltage angle and magntude changes. The Jacoban matrx n (1) s that used when the power flow equatons are solved by the Newton-Raphson technque. Although system voltages are affected by both P and Q, P can be kept constant at each specfed operatng pont and the voltage varatons can be evaluated by consderng the ncremental relatonshp between Q and V. As a consequence, makng null the ncremental changes n P n (1), the followng relaton Q V results, Q = [ L MH 1 N ] V = J R V (2) 15th PSCC, Lege, August 2005 Sesson 16, Paper 4, Page 1
2 Load Lnear Exact Absolute Lnear Exact Absolute Lnear Exact Absolute Buses method method error method method error method method error RP V S 4 RP V S 9 RP V S ,0445 0,0482 0,0037 0,0206 0,0239 0,0033 0,0014 0,0019 0, ,0268 0,0294 0,0026 0,0124 0,0146 0,0022 0,0008 0,0011 0, ,0207 0,0226 0,0019 0,0599 0,0672 0,0073 0,0040 0,0052 0, ,0206 0,0240 0,0034 0,1178 0,1356 0,0178 0,0078 0,0106 0, ,0171 0,0210 0,0039 0,0978 0,1186 0,0208 0,0065 0,0092 0, ,0089 0,0112 0,0023 0,0507 0,0631 0,0124 0,0034 0,0049 0, ,0014 0,0018 0,0004 0,0078 0,0100 0,0022 0,2178 0,2390 0, ,0031 0,0041 0,001 0,0178 0,0230 0,0052 0,0518 0,0619 0, ,0130 0,0173 0,0043 0,0745 0,0979 0,0234 0,0269 0,0366 0,0097 Tabla 1: RPVS factors n each load bus of the IEEE 14-bus test system where J R s called the reduced Jacoban matrx of the system and ts nverse drectly relates the bus voltage magntude and bus reactve power njecton. Adoptng the well-known strong nterdependence between actve powers and bus voltage angles, and between reactve powers and voltage magntudes, the jacoban matrx n (1) s smplfed to, [ H 0 0 L ][ θ V ] = [ P Q and, n consequence, equaton (2) s reduced to, ] (3) Q = L V (4) Fnally, the matrx RP V S, whch s assocated to all the PQ nodes of the system, can be obtaned from ths last system, RP V S = V Q = L 1 (5) The former way of reasonng allows to compute a quas-exact RP V S j factors. The procedure wll be the followng, 1. For a gven load and generator power profle, load flow equatons (1) are solved to know the state varables θ F and V F n all buses. 2. Matrx L s computed from θ F and V F. 3. Matrx RP V S s determned by (5) If the equatons of the Fast Decoupled Load Flow method (FDLF) were the startng pont nstead of the Newton- Raphson power flow equatons, only the lnearzed, decoupled, reactve power model would be requred. Ths one s represented by, B V = Q (6) where B s equal to the magnary part of the nodal admttance matrx changed of sgn. Then, matrx RP V S can be computed from the nverse of B, RP V S =(B ) 1 (7) The man advantage from computng RP V S matrx from (7) nstead of (5) s that matrx B s constant whle matrx L depends on the state varables. Ths mples a lot of savng of computatonal tme when ths ssue becomes mportant. On the contrary, accuracy s reduced due to the assumed smplfcatons after adoptng the FDLF method. Followng n table 1 the RPVS factors n each load bus of the IEEE 14-bus test system are lsted, both usng (5) ( Exact method ) and (7) ( Lnear method ). The bus voltage sensbltes regards to reactve power njectons n buses 4, 9 and 12 are showed, that s, the factors RP V S 4, RP V S 9 and RP V S 12 respectvely, where refers to any load bus. These three nodes have been chosen as there are capactors banks n all of them, so t could be of nterest to quantfy how much voltage magntudes change when the reactve power njecton n any of these three buses s modfed. Absolute errors between the exact and lnear form of obtanng RPVS factors are also dsplayed. It can be concluded from these results, and also thanks to the fnal relatve errors computed when the compensated voltage magntudes are determned (see table 4 n secton 4), that the error by usng the matrx B s almost null. As a consequence, the lnear methodolgy to determne the RPVS factors has been fnally the mplemented one. Nevertheless, the exact RPVS factors are saved to study the accuracy of the results after the whole problem s solved. It must noted that the hgher the load level of the system, the larger the absolute error between the exact and the lnear RPVS factors. Ths result was expected snce the exact method takes nto account the actual voltage magntudes whle the lnear supposes voltage magntudes equal to nomnal voltages. On the other hand, t always results that exact RP V S factors are hgher than the lnear RP V S ones n buses whose voltages are less than the nomnal value, and just the opposte n nodes wth voltages larger than the nomnal. These results allow to conclude that the fnal soluton wth the lnear RPVS factors s always enclosed by the exact soluton. All these consderatons encourage to follow wth the use of the lnear RPVS factors to try to solve the proposed problem. 3 Optmzaton procedure Followng, the optmzaton problem s posed by usng the former RPVS factors. The objectve conssts of deducng the best buses where the new capactors must be allocated and how much reactve power must be njected by 15th PSCC, Lege, August 2005 Sesson 16, Paper 4, Page 2
3 those components n order to get the followng ams: Elmnatng undervoltages Avodng overvoltages n any bus due to the ncreased njected reactve power on the system Mnmzng the number of capactors to be nstalled and the number of swtches on them. If N denotes the total number of buses n the power system, and M the number of load nodes, that s, the usually named PQ nodes, C s the sze of the set S C that comprses all those nodes where capactors can be allocated. Ths set s known n advance to the formulaton of the problem and the nequalty C M s always met. For example, f the problem to solve conssted of determnng the best swtches over already nstalled capactors, set S C would be perfectly defned by those nodes where shunt elements are allocated; n the contrast, f t were a plannng problem, probably the best pont of startng would be to defne S C wth all the beng PQ nodes. Once the load flow equatons have been solved and RPVS factors have been obtaned, the voltage msmatch vector V s computed for each load bus as follows, 1. If V >V max 2. If V <V mn 3. If V mn V = V max V = V mn V V <V <V max V =0 Computng the vector V Mx1 n ths way, the overvoltages and undervoltages n the system are beng quantfed. Then, ths vector s used to defne a frst verson of the objectve functon as, f = M C RP V S j Q j V j where the vector Q Cx1 s obtaned from the RPVS matrx, RP V S MxC Q Cx1 = V Mx1 (9) No consderaton has been done yet n relaton to mnmze the nvestment n new capactors. The followng measures gve answer to ths queston: 2 (8) Buses wth V =0are elmnated from (8) and the related equaton n system (9) s also removed. Ths mples that those buses whose voltages are n lmts are not forced to hold ther actual values. Due to the prevous tem, buses that ntally have ther voltages n lmts could surpass the maxmum specfed voltage V max after the reactve power compensaton. Ths undesrable effect can be avoded by adoptng a practcal maxmum voltage, V pmax, lower than the real maxmum specfed one, that s, V pmax = V pmax tol max. Consderng overvoltages nto the optmzaton problem allows to penalze those capactors more sensble to ncrease even more those overvoltages. So, the fnal mnmzng problem results, M C f = RP V S j Q j V j 2 (10) RP V S M xc Q Cx1 = V M x1 (11) where M s less than M and results after removng nodes wth voltage magntudes n lmts. After solvng ths optmzaton problem, a vector of new njected reactve powers Q Cx1 s deduced. Ths soluton s arranged from large to lowest sze and new swtched capactors are allocated sequentally (followng the order deduced) untl all voltages are n lmts. Ths form of proceedng ensures a mnmum number of new capactors. Agan, RPVS factors are used to recalculate voltage magntudes each tme a new capactor s consdered to be placed, V comp = V F + RP V S j Q j (12) There are some computatonal ssues related to the soluton of (10) and (11). Some negatve solutons could result after the resoluton of the mnmzaton problem, whch mples nductve shunts compensatng capactors. Obvously ths soluton s mpractcable. When ths stuaton occurs, the mnmzaton problem s solved agan after removng those buses j S C wth negatve soluton. Ths s done untl no negatve soluton results. Ths way to proceed guarantees the mnmum number of swtches to compensate undervoltages. As a consequence of ths ssue, agan a practcal mnmum voltage hgher than the real mnmum specfed one must be consdered, V pmn = V pmn + tol mn. Other pont s that swtched capactors banks nstead of fxed capactors could be the avalable compensaton shunts. In ths case, when the Q j soluton s fnally defned as the best reactve power njecton, the number of swtchng tmes for the specfed capactor bank can be easly deduced. Summarzng, the whole process s as follows, 1. Intally, load flow problem s solved to know the state of the system: complex voltages, taps of transformers and reactve power njected by shunt capactors beng nto the system. 2. Matrx of senstvtes s computed and used to defne the objectve functon, ether by a lnear or an exact technque as t has been dscussed n secton Optmzaton problem s solved, equatons (10) and (11), so a vector of new njected reactve powers s deduced. 4. The former soluton s arranged from large to lowest sze. 15th PSCC, Lege, August 2005 Sesson 16, Paper 4, Page 3
4 5. New swtched capactors are allocated sequentally (followng the order deduced n pont 4) untl all voltages, recomputed by (12), are n lmts. 4 Case studes Three dfferent systems wll be analyzed wth the proposed methodology, [A] The IEEE 14-bus test system. [B] The IEEE 30-bus test system. [C] An actual 128-bus system from a Spansh utlty. The voltage lmts n all the cases have been set up at ±5% of nomnal voltage, and the adopted maxmum and mnmum tolerance have been defned n such a way that the allowed voltage nterval s reduced to 1.0 <V < 1.03 for all buses. Also t s supposed any load bus s sensble to allocate a new capactor. The two IEEE test systems have been overloaded n order to have notceable undervoltages. Ths allows to know more about the accuracy of the proposed methodology. Load Buses Intal Voltage V Q Tabla 2: Intal voltages, V vector and Q vector for the IEEE 14-bus test system The ntal load state for the A system results n undervoltage levels for all load buses as t s showed n column one of table 2. From these voltages and the commented practcal voltage lmts, the vector V s computed, whch s lsted n the second column of ths table 2. Then the optmzaton problem (10) and (11) s solved resultng the vector Q depcted n the thrd column of the table 2. Load Intal V Fnal Buses V 5 5,13 5,13,10 Voltage Tabla 3: Soluton for the IEEE 14-bus test system by usng the lnear RP V S factors As t was argued prevously, buses where a negatve njected reactve power results are elmnated from set S C, buses 4 and 9 n ths case. Then the optmzaton problem s agan solved but wth a new number C of possble allocatons for capactors less than the ntal one. Once no any negatve elements of Q s obtaned, ths vector s arranged from large to lowest sze and new swtched capactors are allocated sequentally untl all voltages are n lmts. For ths case ths stuaton s reached after nstallng capactors n buses 5, 13 and 10, and njectng a reactve power of , and Mvar respectvely. The V vector after each compensaton, and the fnal compensated voltages n PQ buses, obtaned by (12), are showed n table 3. As t can be noted, there are no any under/overvoltages. In order to study the accuracy of the method when lnear RP V S factors are used nstead of the exact ones, the whole problem for the A case has been solved by computng the exact RP V S factors. In ths case the optmal placement of capactors are the buses 5, 13 and 11, wth an njected reactve power of , and Mvar respectvely. Ths new soluton only dffers from the prevous one n the last bus where a new capactor should be allocated, resultng bus 11 nstead of bus 10. Ths dfference s due to these nodes are very closed to each other. Table 4 llustrates about the two solutons. Moreover, the fnal voltages by usng the RP V S factors and by solvng the exact load flow equatons are compared n both cases. It can be concluded as the obtaned soluton wth the lnear methodology s exact enough not only to deduce the number of capactors to be nstalled and ther allocaton, but also to compute the fnal voltages. The maxmum relatve error s not hgher than a 2%, whch s very low f we take nto account how much low the ntal voltages were. Ths relatve error has been defned as follows, Relatve error(%) = Comp. voltage Exact comp. voltage 100 Exact comp. voltage where Comp. voltage refers to those compensated voltages obtaned from usng RVPS factors (lnear or exact ones), and Exact comp. voltage are those voltages computed from solvng an exact load flow, both cases wth the new capactors already allocated. Once the accuracy of the proposed methodology has been countersgned n a certan way by the former results, for the other two tested cases not such detaled results wll be wrtten, but only the fnal soluton. For the B case, wth 24 PQ nodes, fve buses have ntally undervoltages lower tan Fgure 1 shows, among others, these ntal voltages. The optmal soluton, by usng the lnear factors, drves to allocate three new capactors n buses 9, 21 and 30, beng the njected reactve power, Q 9,21,30 = [ ] Mvar. The compensated voltage magntudes are also depcted n fgure 1, those usng the lnear RP V S factors as well as the exact ones computed by solvng the load flow equatons. Note as compensated voltages by usng the proposed lnear methodology are very closed to the exact ones once more. The C case has 111 PQ buses, and the smulated load profle gves undervoltages n 27 of them. When the proposed algorthm s appled, the reached soluton conssts of nstallng 5 new capactors njectng a reactve power detaled n table 5. The large amount of reactve power obtaned n bus s justfed by a hgh reactve load connected n ths bus that produces an extremely low ntal voltage of n ths bus. Fgure 2 s the counterpart 15th PSCC, Lege, August 2005 Sesson 16, Paper 4, Page 4
5 Load Q 5,13,10 = Λ Q 5,13,11 = Λ Fnal V Relatve Fnal V Relatve Buses Lnear RV P S Exact Load Flow error (%) Exact RV P S Exact Load Flow error (%) 4 0,9878 0, ,9901 0, ,0061 1, ,0130 1, ,0104 1, ,0034 0, ,0138 1, ,9996 0, ,0161 1, ,9889 0, ,9735 0, ,0131 0, ,9965 0, ,9979 0, ,0183 1, ,0224 0, ,9620 0, ,9645 0, Tabla 4: Comparatve study of fnal voltages for the IEEE 14-bus test system by usng RP V S factors or an exact load flow Fgura 1: Voltage profles for the 30-bus system to 1, now for the C system. Agan, compensated voltages are qute good, beng the most relatve error of 3.26 %. Ths result s qute good takng nto account the hgh level of load of the system. As n the rest of the tested systems the upper lmt of 1.05 s not exceeded. Moreover, the resultng few number of capactors regards to the sze of the system s emphaszed, achevng the man proposed goal, that s, all the voltage magntudes are n lmts. New Capactors Allocaton Injected Reactve Power (Mvar) Tabla 5: Soluton for the actual 128-bus test system 5 Concluson In ths paper, a procedure to solve the capactor placement problem s consdered. A lnear programmng method s employed whch mnmzes the bus voltage devatons from voltage lmts. Ths lnear methodology has been guaranteed to reach realstc solutons not only to solve the optmzaton problem but also to deduce the fnal voltage magntudes, even for very overloaded systems. The mplemented algorthm s smple and fast, so ts use on real tme would be of nterest n order to determne the best way to operate on all the swtched capactors beng on the system to mprove all voltages n a global way. 6 Acknowledgments Authors acknowledge the fnancal support provded by the Spansh Mnster of Scence and Technology under grant ENE Referencas [1] J. J. Granger and S. H. Lee, Optmum sze and locaton of shunt capactors for reducton of losses on dstrbuton feeders, IEEE Trans. Power App. Syst., vol. PAS-100, pp , Mar [2] M. E. Baran and F. F. Wu, Optmal szng of capactors placed on a radal dstrbuton system, IEEE Trans. Power Delvery, vol. 4, pp , Jan [3] H. D. Chang, J. C. Wang, O. Cockngs, and H. D. Shn, Optmal capactor placement n dstrbuton systems; Part 1: A new formulaton of overall problem, IEEE Trans. Power Delvery, vol. 5, pp , Apr th PSCC, Lege, August 2005 Sesson 16, Paper 4, Page 5
6 Fgura 2: Voltage profles for the 128-bus system [4] H. D. Chang, J. C. Wang, O. Cockngs, and H. D. Shn, Optmal capactor placement n dstrbuton systems; Part 2: Soluton algorthms and numercal results, IEEE Trans. Power Delvery, vol. 5, pp , Apr [5] Y. C. Huang, H. T. Yang, and C. L. Huang, Solvng the capactor placement problem n a radal dstrbuton system usng tabu search approach, IEEE Trans. Power Syst., vol. 11, pp , Nov [6] S. Sundhararajan and A. Pahwa, Optmal selecton of capactors for radal dstrbuton systems usng a genetc algorthm, IEEE Trans. Power Syst., vol. 9, pp , Aug [7] K. N. Mu, H. S. Chang, and G. Darlng, Capactor placement, replacement and control n largescale dstrbuton systems by a GA-based two-stage algorthms, IEEE Trans. Power Syst., vol. 12, pp , Aug [8] A. Kalyuzhny, G. Levtn, D. Elmaks, and H. B. Ham, System approach to shunt capactor allocaton n radal dstrbuton systems, Electrc Power Syst. Res., vol. 56, pp. 5160, [9] P.Kundur, Power System Stablty and Control, EPRI Power System Engneerng Seres, McGraw Hll Inc., 1994, p.992. [10] B.Gao, G.K.Monson, P.Kundur, Voltage Stablty Evaluaton Usng Modal Analyss, IEEE Trans. Power Systems, Vo1.7, No.4, November 1992, pp [11] IEEE Specal Tutoral Course - Voltage Stablty. Proceedngs of the 1998 Power Engneerng Socety Summer meetng. San Dego CA p p (4).6. 15th PSCC, Lege, August 2005 Sesson 16, Paper 4, Page 6
Chapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationELE B7 Power Systems Engineering. Power Flow- Introduction
ELE B7 Power Systems Engneerng Power Flow- Introducton Introducton to Load Flow Analyss The power flow s the backbone of the power system operaton, analyss and desgn. It s necessary for plannng, operaton,
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationCapacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search
Capactor Placement In Dstrbuton Systems Usng Genetc Algorthms and Tabu Search J.Nouar M.Gandomar Saveh Azad Unversty,IRAN Abstract: Ths paper presents a new method for determnng capactor placement n dstrbuton
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationA Novel Evolutionary Algorithm for Capacitor Placement in Distribution Systems
DOI.703/s40707-013-0003-x STF Journal of Engneerng Technology (JET), Vol. No. 3, Dec 013 A Novel Evolutonary Algorthm for Capactor Placement n Dstrbuton Systems J-Pyng Chou and Chung-Fu Chang Abstract
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationLecture 20: November 7
0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationTerm Project - select journal paper and outline. Completed analysis due end
EE 5200 - Lecture 30 Fr ov 4, 2016 Topcs for Today: Announcements Term Project - select journal paper and outlne. Completed analyss due end of Week 12. Submt va e-mal as mn-lecture.ppt wth voce narraton.
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationSIO 224. m(r) =(ρ(r),k s (r),µ(r))
SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationA LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,
A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More informationBranch Exchange Approach to Power Loss Reduction in Reconfiguration Problem of Balanced Distribution Networks
Int. J. Mech. Eng. Autom. olume, Number 3, 015, pp. 14-149 Receved: December 8, 014; Publshed: March 5, 015 Internatonal Journal of Mechancal Engneerng and Automaton Branch Exchange Approach to Power Loss
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationComparative Analysis of SPSO and PSO to Optimal Power Flow Solutions
Internatonal Journal for Research n Appled Scence & Engneerng Technology (IJRASET) Volume 6 Issue I, January 018- Avalable at www.jraset.com Comparatve Analyss of SPSO and PSO to Optmal Power Flow Solutons
More informationProceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3,
roceedngs of the 0th WSEAS Internatonal Confenrence on ALIED MATHEMATICS, Dallas, Texas, USA, November -3, 2006 365 Impact of Statc Load Modelng on Industral Load Nodal rces G. REZA YOUSEFI M. MOHSEN EDRAM
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More information2016 Wiley. Study Session 2: Ethical and Professional Standards Application
6 Wley Study Sesson : Ethcal and Professonal Standards Applcaton LESSON : CORRECTION ANALYSIS Readng 9: Correlaton and Regresson LOS 9a: Calculate and nterpret a sample covarance and a sample correlaton
More informationLecture 16 Statistical Analysis in Biomaterials Research (Part II)
3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationOperating conditions of a mine fan under conditions of variable resistance
Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationT E C O L O T E R E S E A R C H, I N C.
T E C O L O T E R E S E A R C H, I N C. B rdg n g En g neern g a nd Econo mcs S nce 1973 THE MINIMUM-UNBIASED-PERCENTAGE ERROR (MUPE) METHOD IN CER DEVELOPMENT Thrd Jont Annual ISPA/SCEA Internatonal Conference
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationSecond Order Analysis
Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationA SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI]
Yugoslav Journal of Operatons Research (00) umber 57-66 A SEPARABLE APPROXIMATIO DYAMIC PROGRAMMIG ALGORITHM FOR ECOOMIC DISPATCH WITH TRASMISSIO LOSSES Perre HASE enad MLADEOVI] GERAD and Ecole des Hautes
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationOptimal Placement and Sizing of DGs in the Distribution System for Loss Minimization and Voltage Stability Improvement using CABC
Internatonal Journal on Electrcal Engneerng and Informatcs - Volume 7, Number 4, Desember 2015 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton and Voltage Stablty Improvement usng
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationCredit Card Pricing and Impact of Adverse Selection
Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationStatistics II Final Exam 26/6/18
Statstcs II Fnal Exam 26/6/18 Academc Year 2017/18 Solutons Exam duraton: 2 h 30 mn 1. (3 ponts) A town hall s conductng a study to determne the amount of leftover food produced by the restaurants n the
More informationUncertainty as the Overlap of Alternate Conditional Distributions
Uncertanty as the Overlap of Alternate Condtonal Dstrbutons Olena Babak and Clayton V. Deutsch Centre for Computatonal Geostatstcs Department of Cvl & Envronmental Engneerng Unversty of Alberta An mportant
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationECEN 667 Power System Stability Lecture 21: Modal Analysis
ECEN 667 Power System Stablty Lecture 21: Modal Analyss Prof. Tom Overbye Dept. of Electrcal and Computer Engneerng Texas A&M Unversty, overbye@tamu.edu 1 Announcements Read Chapter 8 Homework 7 s posted;
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More information6.3.7 Example with Runga Kutta 4 th order method
6.3.7 Example wth Runga Kutta 4 th order method Agan, as an example, 3 machne, 9 bus system shown n Fg. 6.4 s agan consdered. Intally, the dampng of the generators are neglected (.e. d = 0 for = 1, 2,
More informationStatistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA
14 th Internatonal Users Conference Sesson: ALE-FSI Statstcal Energy Analyss for Hgh Frequency Acoustc Analyss wth Zhe Cu 1, Yun Huang 1, Mhamed Soul 2, Tayeb Zeguar 3 1 Lvermore Software Technology Corporaton
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationArmy Ants Tunneling for Classical Simulations
Electronc Supplementary Materal (ESI) for Chemcal Scence. Ths journal s The Royal Socety of Chemstry 2014 electronc supplementary nformaton (ESI) for Chemcal Scence Army Ants Tunnelng for Classcal Smulatons
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationStatistics Chapter 4
Statstcs Chapter 4 "There are three knds of les: les, damned les, and statstcs." Benjamn Dsrael, 1895 (Brtsh statesman) Gaussan Dstrbuton, 4-1 If a measurement s repeated many tmes a statstcal treatment
More informationDetermining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application
7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More information