Input : Matrix A = [aij]ïi,j=1 € Rn×n. Output: LU factorization of A stored in for j = 1,...,n do for k = 1,..., j - 1 do for i=k+1,..., n do | aij = aij - aikakj — for k=j+1,..., n do | akj akj = akj/ajj return A

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Determine the total number of flops for each algorithm. Include the number of flops per line aside from the computation of whole number of flop. follow the sample below
Algorithm 4 (Row-oriented forwards substitution) Given L E Cnxn (assumed lower
triangular) and be Cr, we overwrite b with the solution to Ly = b:
1: procedure FORWARDSUB(L, b)
2:
for i= 1,...,n do
3:
for j = 1,..., i - 1 do
bi bilij bj
4:
5:
end for
6:
bi
bi/li,i
7:
end for
Sample
8: end procedure
The flop count for this algorithm is slightly less trivial to compute:
n
Σ(Σ)-Σ(Σω)
² ((1)) = 2 Σ(i-1) = 2 (2₁-
--n) = n tn - 2n = n -n=0(n).
(Σ-Σ
i=1
i=1
n(n+1)
= 2
+
2
Transcribed Image Text:Algorithm 4 (Row-oriented forwards substitution) Given L E Cnxn (assumed lower triangular) and be Cr, we overwrite b with the solution to Ly = b: 1: procedure FORWARDSUB(L, b) 2: for i= 1,...,n do 3: for j = 1,..., i - 1 do bi bilij bj 4: 5: end for 6: bi bi/li,i 7: end for Sample 8: end procedure The flop count for this algorithm is slightly less trivial to compute: n Σ(Σ)-Σ(Σω) ² ((1)) = 2 Σ(i-1) = 2 (2₁- --n) = n tn - 2n = n -n=0(n). (Σ-Σ i=1 i=1 n(n+1) = 2 + 2
n
Input : Matrix A = [aij]ij=1 € Rnxn
Output: LU factorization of A stored in A.
1 for j = 1,...,n do
2
for k= 1,..., j - 1 do
3
|
for i=k+1,..., n do
| aij =
Aij ai ka kj
4
-
5
for k=j+1,...,n do
akj = akj/ajj
6
7 return A
Transcribed Image Text:n Input : Matrix A = [aij]ij=1 € Rnxn Output: LU factorization of A stored in A. 1 for j = 1,...,n do 2 for k= 1,..., j - 1 do 3 | for i=k+1,..., n do | aij = Aij ai ka kj 4 - 5 for k=j+1,...,n do akj = akj/ajj 6 7 return A
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY