DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

Similar documents
(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

1 Introduction to Modulo 7 Arithmetic

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

HIGHER ORDER DIFFERENTIAL EQUATIONS

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

Designing A Concrete Arch Bridge

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Properties of Hexagonal Tile local and XYZ-local Series

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Instructions for Section 1

MAT 403 NOTES 4. f + f =

QUESTIONS BEGIN HERE!

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

The Z transform techniques

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS

Planar Upward Drawings

QUESTIONS BEGIN HERE!

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Research Article On the Genus of the Zero-Divisor Graph of Z n

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

APPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Present state Next state Q + M N

Ch 1.2: Solutions of Some Differential Equations

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

12. Traffic engineering

EE1000 Project 4 Digital Volt Meter

Garnir Polynomial and their Properties

VECTOR ANALYSIS APPLICATION IN ROTATING MAGNETIC FIELDS

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

Seven-Segment Display Driver

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Research Scholar, Vinoba Bhave University, Hazaribag, Jharkhand

Floating Point Number System -(1.3)

Floating Point Number System -(1.3)

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

Limits Indeterminate Forms and L Hospital s Rule

Something found at a salad bar

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Solutions 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

Outline. Binary Tree

TOPIC 5: INTEGRATION

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

CS September 2018

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

a 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...

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

IIT JEE MATHS MATRICES AND DETERMINANTS

Multi-Section Coupled Line Couplers

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Constructive Geometric Constraint Solving

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

UNIT # 08 (PART - I)

0.1. Exercise 1: the distances between four points in a graph

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

ECE 330 POWER CIRCUITS AND ELECTROMECHANICS LECTURE 17 FORCES OF ELECTRIC ORIGIN ENERGY APPROACH(1)

Generalized Kronecker Product and Its Application

ON AN INEQUALITY FOR THE MEDIANS OF A TRIANGLE

Lecture 4. Conic section

COMP108 Algorithmic Foundations

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

Acceptance Single Sampling Plan with fuzzy parameter with The Using of Poisson Distribution

(a) v 1. v a. v i. v s. (b)

Numbering Boundary Nodes

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Journal of Inequalities in Pure and Applied Mathematics

( ) { } [ ] { } [ ) { } ( ] { }

Extension Formulas of Lauricella s Functions by Applications of Dixon s Summation Theorem

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

Fundamental Algorithms for System Modeling, Analysis, and Optimization

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Binomials and Pascal s Triangle

The Mathematics of Harmonic Oscillators

Journal of Al-Nahrain University Vol.11(1), April, 2008, pp Science 3 OF THE EHRHART POLYNOMIALS OF A POLYHEDRON IN

Walk Like a Mathematician Learning Task:

Linear Algebra Existence of the determinant. Expansion according to a row.

Formal Concept Analysis

SOME COPLANAR POINTS IN TETRAHEDRON

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

Trees as operads. Lecture A formalism of trees

22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 8: Effect of a Vertical Field on Tokamak Equilibrium

Modified Farey Trees and Pythagorean Triples

Steinberg s Conjecture is false

Vibration with more (than one) degrees of freedom (DOF) a) longitudinal vibration with 3 DOF. b) rotational (torsional) vibration with 3 DOF

Calculus 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

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

Transcription:

Fr Est Journl o Mthtil Sins (FJMS) Volu 6 Nur Pgs 8- Pulish Onlin: Sptr This ppr is vill onlin t http://pphjo/journls/jsht 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 ( )

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

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

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

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 [ ]

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

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

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 [ ]

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

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

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:

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

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 9 7 6 7 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

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 6 6 6 6 6 9 67 Ininit 7 6 7 9 667 7 9 9 6 6 8 6 7 6 6

DEVELOPING COMPUTER PROGRAM FOR COMPUTING 99 78 66 Ininit 6 67 7 6 7 6 7 6 66 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

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