DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM
|
|
- Avice Poole
- 6 years ago
- Views:
Transcription
1 Fr Est Journl o Mthtil Sins (FJMS) Volu 6 Nur Pgs 8- Pulish Onlin: Sptr This ppr is vill onlin t Pushp Pulishing Hous DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF MATRICES AND UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM IRAWATI n TITO WALUYO PURBOYO Algr Rsrh Group Fulty o Mthtis n Nturl Sins Institut Tknologi Bnung Bnung Inonsi -il: irwti@thiti Astrt In this ppr w invstigt th thory n th pross o oputing ignvlu n ignvtor using sipl lgorith n rliz it in oputr progr W opr th sipl lgorith with th lssil on to s th tivnss o oth lgoriths Th ritri or opring th two lgoriths r th sp n th ury o th oputr progr λ Mthtis Sujt Clssiition: 6F A8 Kywors n phrss: sipl lgorith ignvlus ignvtors Riv My Th Thory For th ollowing trix A lt us s th hrtristi qution ( ) λ ( ) With sustitut λ ( ) into th qution w gt ( ) ( )( ) n w hv Nxt w gt ( )
2 86 IRAWATI n TITO WALUYO PURBOYO So ( ) hs Δ ( ) s isriinnt But th hrtristi qution hs isriinnt Δ ( ) ( ) whih n hng into Δ n w hv Δ So Δ ( ) W n s tht th hrtristi qutions λ ( ) λ ( ) n ( ) hv th s isriinnt So w n us th qution ( ) to in th ignvlu n th ignvtor o A Proposition Lt A with R Thn () is th ignoupl o A i n only i is th init root o ( ) () Th oupl ( ) is th ignoupl o A i n only i is th root o () I t lst on o th oiints o ( ) is not zro thn its ignsp is o insion on I ll o th oiint o ( ) x r zro thn is n ignoupl o A or so x n y not ll y zro Proo Lt v n v For rl nur is th slop o v n th slop o v is ininit () ( ) Lt n ignoupl o A or init nur so w hv
3 DEVELOPING COMPUTER PROGRAM FOR COMPUTING 87 ( ) W gt So W hv ( ) So is init root o ( ) ( ) Lt init root o ( ) W hv ( ) So ( ) Th lst qution n writtn s An w hv ( ) It ns tht is n ignoupl o A () ( ) Lt n ignoupl o A
4 IRAWATI n TITO WALUYO PURBOYO 88 W hv So so th root o is Bus o w gt tht th root o is ininit So is root o ( ) Lt λ th root o Bus th root o is ininit n th root is thn w gt Lt Bus o is th ignoupl o A () Lt hv t lst on non-zro oiint so w hv hs t ost two roots Nxt lt us s λ n λ I v n v r ignvtors thn th ignvlu orrspons to v is n th ignvlu orrspons to v is
5 DEVELOPING COMPUTER PROGRAM FOR COMPUTING 89 Bus tht vry non-zro vtor y x in R n writtn uniquly s onstnt ultipl ithr o v or rl nur or o v tht is R s s y x ; or ; R s s y x Thn vry ignoupl or is on insionl For th son sttnt lt ll o th oiint o r zro n so λ n vry init is th root o In this s A For init w gt [ ] v For n ininit [ ] v So y x is n ignoupl o A or x n y not ll zro In th nxt proposition w xpn th rsult in tringulr tris A with ; R Proposition Lt A with ; R () Th oupl is n ignoupl o A i n only i is root o [ ]
6 IRAWATI n TITO WALUYO PURBOYO 9 () Th oupl is n ignoupl o A i n only i is init root o [ ] () Th oupl is n ignoupl o A i n only i is root o () Th oupl is n ignoupl o A i n only i is root o Proo () ( ) Lt is th ignoupl o A or init suh tht W gt It ns tht : us
7 DEVELOPING COMPUTER PROGRAM FOR COMPUTING 9 By writing w hv (us ) [ ] So [ ] An w gt is root o [ ] ( ) Lt is th root o [ ] W hv tht (us ) (us ) So
8 IRAWATI n TITO WALUYO PURBOYO 9 An w gt So is n ignoupl o A () ( ) Lt is n ignoupl o A or init rl nur suh tht So w hv This ns So [ ]
9 DEVELOPING COMPUTER PROGRAM FOR COMPUTING 9 W hv tht is init root o [ ] ( ) Lt is init root o [ ] Thn w hv So W hv An inlly w gt So is n ignoupl o A () ( ) Lt n ignoupl o A Thn So
10 IRAWATI n TITO WALUYO PURBOYO 9 As th root o w gt Bus o w gt tht hs n ininit root ( ) Lt λ th root o Fro w gt Lt So is n ignoupl o A () ( ) Lt n ignoupl o A W hv So
11 DEVELOPING COMPUTER PROGRAM FOR COMPUTING 9 Th roots o n gottn ro Bus o hs n ininit root So is root o ( ) Lt λ root o Bus o is th root o w gt Lt Bus o w hv is n ignsp o A Th Coputr Progr Th progr is writtn in Dlphi lngug Th oputr progr or lssil lgorith Th qution or th lssil lgorith onsists o:
12 96 IRAWATI n TITO WALUYO PURBOYO Th hrtristi qution λ t λ Th qution or gtting ignvlus λ ( ) ( ) For vry ignvlu λ w in th ignvtor ro th ollowing qution x Av λv whr v with x y R y Th oputr progr or th sipl lgorith Th qution or th sipl lgorith onsists o: Th qution Th root o th qution in ( ) ( ) ( ) I is init thn th ignoupl is I is ininit thn th ignoupl is
13 DEVELOPING COMPUTER PROGRAM FOR COMPUTING 97 Th sp oprison o th two progrs Th tris Mtrix Dt Th root in Th root o th hr polynoil Eignoupl Ti or sipl lgorith in illison Ti or lssil lgorith in illison Ininit n Ininit 9 9 n n 9 6 n n 6 9 i n i i n i i i i i 8 i n i i n i i i i i 6 It n sn tht th ti n or th sipl lgorith is shortr thn or th lssil lgorith
14 IRAWATI n TITO WALUYO PURBOYO 98 In th ollowing tl w opr th two lgoriths or tris Mtrix Dt Roots in Th root o th hrtristi polynoil Th ignoupl Ti or sipl progr in illison Ti or lssil progr in illison Ininit
15 DEVELOPING COMPUTER PROGRAM FOR COMPUTING Ininit It lso n sn tht th ti n or th sipl lgorith is shortr thn or th lssil lgorith Rrns [] R B Ash A Prir o Astrt Mthtis Th Mthtil Assoition o Ari Wshington 998 pp 7- [] D S Duit n R M Foot Astrt Algr Prnti Hll Nw Jrsy 99 pp -8 [] J L Golrg Mtrix Thory with Applition MGrw-Hill Nw York 99 pp -9
16 IRAWATI n TITO WALUYO PURBOYO [] M Goluitsky n M Dllnitz Linr Algr n Dirntil Equtions using MATLAB Brooks/Col Pulishing Copny Cliorni 999 pp -67 [] B Jo Linr Algr W H Frn n Copny Nw York 99 pp 6-6 [6] A Jons S A Morris n K R Prson Astrt Algr n Fous Ipossiilitis Springr-Vrlg Nw York 99 pp - [7] S Lng Introution to Linr Algr Springr-Vrlg Nw York 98 pp -8 [8] S Lipshutz n M L Lipson Aljr Linir Pnrit Erlngg Jkrt pp 7-68 [9] T A Nwton A sipl lgorith or ining ignvlus n ignvtors or tris Ar Mth Monthly 97() (99) [] S Ron Avn Linr Algr Springr-Vrlg Nw York Vol 99 pp -6 [] D S Wtkins Funntls o Mtrix Coputtions John Wily n Sons In Cn 99 pp 99-9
(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely
. DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,
More information1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More informationCycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
More informationHIGHER ORDER DIFFERENTIAL EQUATIONS
Prof Enriqu Mtus Nivs PhD in Mthmtis Edution IGER ORDER DIFFERENTIAL EQUATIONS omognous linr qutions with onstnt offiints of ordr two highr Appl rdution mthod to dtrmin solution of th nonhomognous qution
More informationPH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.
Dy : Mondy 5 inuts. Ovrviw of th PH47 wsit (syllus, ssignnts tc.). Coupld oscilltions W gin with sss coupld y Hook's Lw springs nd find th possil longitudinl) otion of such syst. W ll xtnd this to finit
More informationDesigning A Concrete Arch Bridge
This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr
More informationOutline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
More informationProperties of Hexagonal Tile local and XYZ-local Series
1 Proprtis o Hxgonl Til lol n XYZ-lol Sris Jy Arhm 1, Anith P. 2, Drsnmik K. S. 3 1 Dprtmnt o Bsi Sin n Humnitis, Rjgiri Shool o Enginring n, Thnology, Kkkn, Ernkulm, Krl, Ini. jyjos1977@gmil.om 2 Dprtmnt
More informationCOMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
More informationInstructions for Section 1
Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks
More informationMAT 403 NOTES 4. f + f =
MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook
More informationMath 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
More informationThe Z transform techniques
h Z trnfor tchniqu h Z trnfor h th rol in dicrt yt tht th Lplc trnfor h in nlyi of continuou yt. h Z trnfor i th principl nlyticl tool for ingl-loop dicrt-ti yt. h Z trnfor h Z trnfor i to dicrt-ti yt
More informationA 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata
A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,
More informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008
Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is
More informationAlgorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt
More informationFSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *
CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if
More informationMASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS
MASTER CLASS PROGRAM UNIT SPECIALIST MATHEMATICS SEMESTER TWO WEEK WRITTEN EXAMINATION SOLUTIONS FOR ERRORS AND UPDATES, PLEASE VISIT WWW.TSFX.COM.AU/MC-UPDATES QUESTION () Lt p ( z) z z z If z i z ( is
More informationPlanar Upward Drawings
C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook
More informationSimilarity Search. The Binary Branch Distance. Nikolaus Augsten.
Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity
More informationECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
More informationResearch Article On the Genus of the Zero-Divisor Graph of Z n
Intrntionl Journl o Comintoris, Artil ID 7, pgs http://x.oi.org/.1/14/7 Rsrh Artil On th Gnus o th Zro-Divisor Grph o Z n Huong Su 1 n Piling Li 2 1 Shool o Mthmtil Sins, Gungxi Thrs Eution Univrsity,
More informationb. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
More informationIntegration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals
Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion
More informationWhy the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
More informationAPPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS
Intrntionl Journl o Sintii nd Rrh Publition Volum, Iu 5, M ISSN 5-353 APPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS S.M.Khirnr, R.M.Pi*, J.N.Slun** Dprtmnt o Mthmti Mhrhtr
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
More informationPresent state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
More informationCh 1.2: Solutions of Some Differential Equations
Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of
More informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both
More information12. Traffic engineering
lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}
More informationEE1000 Project 4 Digital Volt Meter
Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s
More informationGarnir Polynomial and their Properties
Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,
More informationVECTOR ANALYSIS APPLICATION IN ROTATING MAGNETIC FIELDS
22-578 VECTOR ANALYSIS APPLICATION IN ROTATING MAGNETIC FIELDS runo Osorno Dprtnt of Eltril And Coputr Enginring Cliforni Stt Univrsity Northridg 18111 Nordhoff St Northridg CA 9133-8436 Eil:runo@s.sun.du
More informationMore Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations
Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},
More informationSeven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
More information, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
More informationResearch Scholar, Vinoba Bhave University, Hazaribag, Jharkhand
Volum Issu July 0 ISSN: X Intrntionl Journl of Advnd Rsrh in Computr Sin nd Softwr Enginring Rsrh Ppr Avill onlin t: www.ijrss.om Dominting Funtion Thory from Nwton to Linitz s Approh of Indfinit Intgrtion
More informationFloating Point Number System -(1.3)
Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igts in th bs xnsion
More informationFloating Point Number System -(1.3)
Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igits in th bs xnsion
More informationSAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2
AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.
More informationLimits Indeterminate Forms and L Hospital s Rule
Limits Indtrmint Forms nd L Hospitl s Rul I Indtrmint Form o th Tp W hv prviousl studid its with th indtrmint orm s shown in th ollowin mpls: Empl : Empl : tn [Not: W us th ivn it ] Empl : 8 h 8 [Not:
More informationSomething found at a salad bar
Nme PP Something found t sld r 4.7 Notes RIGHT TRINGLE hs extly one right ngle. To solve right tringle, you n use things like SOH-H-TO nd the Pythgoren Theorem. n OLIQUE TRINGLE hs no right ngles. To solve
More informationLecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:
Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin
More informationSolutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
More informationOutline. Binary Tree
Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or
More informationTOPIC 5: INTEGRATION
TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function
More informationINTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)
Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..
More informationChapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1
Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd
More information# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.
How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0
More informationS i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
More informationCS September 2018
Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o
More informationAn undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
More informationPaths. Connectivity. Euler and Hamilton Paths. Planar graphs.
Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,
More informationa b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...
Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th
More informationCSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018
CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs
More informationIIT JEE MATHS MATRICES AND DETERMINANTS
IIT JEE MTHS MTRICES ND DETERMINNTS THIRUMURUGN.K PGT Mths IIT Trir 978757 Pg. Lt = 5, th () =, = () = -, = () =, = - (d) = -, = -. Lt sw smmtri mtri of odd th quls () () () - (d) o of ths. Th vlu of th
More informationMulti-Section Coupled Line Couplers
/0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr
More informationOutline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl
More informationModule graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
More informationGraphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1
CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml
More informationConstructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationUNIT # 08 (PART - I)
. r. d[h d[h.5 7.5 mol L S d[o d[so UNIT # 8 (PRT - I CHEMICL INETICS EXERCISE # 6. d[ x [ x [ x. r [X[C ' [X [[B r '[ [B [C. r [NO [Cl. d[so d[h.5 5 mol L S d[nh d[nh. 5. 6. r [ [B r [x [y r' [x [y r'
More information0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
More informationCSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata
CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl
More informationECE 330 POWER CIRCUITS AND ELECTROMECHANICS LECTURE 17 FORCES OF ELECTRIC ORIGIN ENERGY APPROACH(1)
ECE 330 POWER CIRCUITS AND ELECTROMECHANICS LECTURE 17 FORCES OF ELECTRIC ORIGIN ENERGY APPROACH(1) Aknowledgent-These hndouts nd leture notes given in lss re bsed on teril fro Prof. Peter Suer s ECE 330
More informationGeneralized Kronecker Product and Its Application
Vol. 1, No. 1 ISSN: 1916-9795 Generlize Kroneker Prout n Its Applition Xingxing Liu Shool of mthemtis n omputer Siene Ynn University Shnxi 716000, Chin E-mil: lxx6407@163.om Astrt In this pper, we promote
More informationON AN INEQUALITY FOR THE MEDIANS OF A TRIANGLE
Journl of Siene nd Arts Yer, No. (9), pp. 7-6, OIGINAL PAPE ON AN INEQUALITY FO THE MEDIANS OF A TIANGLE JIAN LIU Mnusript reeived:.5.; Aepted pper:.5.; Pulished online: 5.6.. Astrt. In this pper, we give
More informationLecture 4. Conic section
Lctur 4 Conic sction Conic sctions r locus of points whr distncs from fixd point nd fixd lin r in constnt rtio. Conic sctions in D r curvs which r locus of points whor position vctor r stisfis r r. whr
More informationCOMP108 Algorithmic Foundations
Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht
More informationME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören
ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(
More informationAcceptance Single Sampling Plan with fuzzy parameter with The Using of Poisson Distribution
Worl Amy of Sin, Enginring n Thnology 49 9 Aptn Singl Smpling ln with fuzzy prmtr with Th sing of oisson Distriution Ezztllh Bloui Jmhnh,*, Bhrm Sghpour-Gilh, Gholmhossin Yri 3 h.d Stunt, Sin n Rsrh Brnh,
More information(a) v 1. v a. v i. v s. (b)
Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous
More informationNumbering Boundary Nodes
Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out
More informationExam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
More informationJournal of Inequalities in Pure and Applied Mathematics
Journl o Inequlities in Pure nd Applied Mthemtics http://jipm.vu.edu.u/ Volume 6, Issue 4, Article 6, 2005 MROMORPHIC UNCTION THAT SHARS ON SMALL UNCTION WITH ITS DRIVATIV QINCAI ZHAN SCHOOL O INORMATION
More information( ) { } [ ] { } [ ) { } ( ] { }
Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or
More informationExtension Formulas of Lauricella s Functions by Applications of Dixon s Summation Theorem
Avll t http:pvu.u Appl. Appl. Mth. ISSN: 9-9466 Vol. 0 Issu Dr 05 pp. 007-08 Appltos Appl Mthts: A Itrtol Jourl AAM Etso oruls of Lurll s utos Appltos of Do s Suto Thor Ah Al Atsh Dprtt of Mthts A Uvrst
More information12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)
12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundmntl Algorithms for Sstm Modling, Anlsis, nd Optimiztion Edwrd A. L, Jijt Rohowdhur, Snjit A. Sshi UC Brkl EECS 144/244 Fll 2011 Copright 2010-11, E. A. L, J. Rohowdhur, S. A. Sshi, All rights rsrvd
More information5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs
Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl
More informationBinomials and Pascal s Triangle
Binomils n Psl s Tringl Binomils n Psl s Tringl Curriulum R AC: 0, 0, 08 ACS: 00 www.mthltis.om Binomils n Psl s Tringl Bsis 0. Intif th prts of th polnomil: 8. (i) Th gr. Th gr is. (Sin is th highst
More informationThe Mathematics of Harmonic Oscillators
Th Mhcs of Hronc Oscllors Spl Hronc Moon In h cs of on-nsonl spl hronc oon (SHM nvolvng sprng wh sprng consn n wh no frcon, you rv h quon of oon usng Nwon's scon lw: con wh gvs: 0 Ths s sos wrn usng h
More informationJournal of Al-Nahrain University Vol.11(1), April, 2008, pp Science 3 OF THE EHRHART POLYNOMIALS OF A POLYHEDRON IN
ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc ON FINDING TH COFFICINTS c OF TH HRHART POLYNOMIALS OF A POLYHDRON IN Shth Ass Al-Nr Mnl N Al-Hrr n Vin A Al Al-Slhy Dprtnt of Appli Scinc Univrsity
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationLinear Algebra Existence of the determinant. Expansion according to a row.
Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit
More informationFormal Concept Analysis
Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst
More informationSOME COPLANAR POINTS IN TETRAHEDRON
Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More informationTrees as operads. Lecture A formalism of trees
Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn
More information22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 8: Effect of a Vertical Field on Tokamak Equilibrium
.65, MHD Thory of usion Systms Prof. ridrg Lctur 8: Effct of Vrticl ild on Tokmk Equilirium Toroidl orc lnc y Mns of Vrticl ild. Lt us riw why th rticl fild is imortnt. 3. or ry short tims, th cuum chmr
More informationModified Farey Trees and Pythagorean Triples
Modified Frey Trees d Pythgore Triples By Shi-ihi Kty Deprtet of Mthetil Siees, Fulty of Itegrted Arts d Siees, The Uiversity of Tokushi, Tokushi 0-0, JAPAN e-il ddress : kty@istokushi-ujp Abstrt I 6,
More informationSteinberg s Conjecture is false
Stinrg s Conjtur is als arxiv:1604.05108v2 [math.co] 19 Apr 2016 Vinnt Cohn-Aa Mihal Hig Danil Král Zhntao Li Estan Salgao Astrat Stinrg onjtur in 1976 that vry planar graph with no yls o lngth our or
More informationVibration with more (than one) degrees of freedom (DOF) a) longitudinal vibration with 3 DOF. b) rotational (torsional) vibration with 3 DOF
irtion with ore (thn one) degrees of freedo (DOF) ) longitudinl irtion with DOF ) rottionl (torsionl) irtion with DOF ) ending irtion with DOF d) the D (plnr) irtion of the fleil supported rigid od with
More informationCalculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx
Clulus Chet Sheet Integrls Definitions Definite Integrl: Suppose f ( ) is ontinuous Anti-Derivtive : An nti-derivtive of f ( ) on [, ]. Divide [, ] into n suintervls of is funtion, F( ), suh tht F = f.
More informationCIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7
CIVL / -D Boundr Vlu Prolms - Rctngulr Elmnts / RECANGULAR ELEMENS - In som pplictions, it m mor dsirl to us n lmntl rprsnttion of th domin tht hs four sids, ithr rctngulr or qudriltrl in shp. Considr
More information