Explanation Formula used: The procedure to solve the system of liner equation using Gauss –elimination, Step-1: The first unknown x 1 is eliminated from the last remaining equations by subtracting multiples of the first equation. Step-2: The second unknown x 2 is eliminated from the last remaining equations by subtracting multiples of the reduced second equation. Step-3: The third unknown x 3 is eliminated from the last remaining equations by subtracting multiples of the reduced third equation. Step-4: The nth unknown x n is eliminated from the last remaining equations by subtracting multiples of the reduced nth equation. Step-5: Continue above step until all system become uncoupled system. Calculation: Consider the system of equation: ( 1 − i ) x 1 + 2 x 2 = 0 …… (1) − x 1 − ( 1 + i ) x 2 = 0 …… (2) Multiple the equation (2) by ( 1 − i ) : − ( 1 − i ) x 1 − ( 1 + i ) ( 1 − i ) x 2 = 0 − ( 1 − i ) x 1 − ( 1 − i 2 ) x 2 = 0 [ i 2 = − 1 ] − ( 1 − i ) x 1 − ( 1 + 1 ) x 2 = 0 − ( 1 − i ) x 1 − 2 x 2

Fundamentals Of Differential Equations And Boundary Value Problems, Books A La Carte Edition (7th Edition)

7th Edition

ISBN: 9780321977182

Author: Nagle, R. Kent, Saff, Edward B., Snider, Arthur David

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 9.2, Problem 9E

To determine

To solve: The system of equation (1−i)x1+2x2=0 and −x1−(1+i)x2=0 using the Gauss-Jordan elimination algorithm.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 9.2, Problem 8E

Chapter 9.2, Problem 10E

Students have asked these similar questions

1.2.17. (!) Let G,, be the graph whose vertices are the permutations of (1,..., n}, with two permutations a₁, ..., a,, and b₁, ..., b, adjacent if they differ by interchanging a pair of adjacent entries (G3 shown below). Prove that G,, is connected. 132 123 213 312 321 231

1.2.19. Let and s be natural numbers. Let G be the simple graph with vertex set Vo... V„−1 such that v; ↔ v; if and only if |ji| Є (r,s). Prove that S has exactly k components, where k is the greatest common divisor of {n, r,s}.

1.2.20. (!) Let u be a cut-vertex of a simple graph G. Prove that G - v is connected. ע

Chapter 9 Solutions

Fundamentals Of Differential Equations And Boundary Value Problems, Books A La Carte Edition (7th Edition)

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

The system of equation ( 1 − i ) x 1 + 2 x 2 = 0 and − x 1 − ( 1 + i ) x 2 = 0 using the Gauss-Jordan elimination algorithm.

Solution Summary: The author explains the procedure to solve the system of liner equation using the Gauss-Jordan elimination algorithm.

Videos

To solve: The system of equation (1−i)x1+2x2=0 and −x1−(1+i)x2=0 using the Gauss-Jordan elimination algorithm.

Want to see the full answer?

Chapter 9 Solutions