The IBM Sequoia computer can operate at speeds in excess of 16 petaflops per second (1 petaflop = 1015 flops). Use Ta- ble 1 to estimate the time required to perform the following operations on an invertible 100,000 × 100,000 matrix A. (a) Execute the forward phase of Gauss-Jordan elimination. (b) Execute the backward phase of Gauss-Jordan elimina- tion. (c) LU-decomposition of A.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter6: Vector Spaces
Section6.2: Linear Independence, Basis, And Dimension
Problem 3AEXP
icon
Related questions
Question
100%
Table 1
Approximate Cost for an n x n Matrix A with Large n
Algorithm
Cost in Flops
Gauss-Jordan elimination (forward phase)
Gauss-Jordan elimination (backward phase) n?
LU-decomposition of A
Forward substitution to solve Ly = b
Backward substitution to solve Ux = y
A-' by reducing [A |I] to [! | A-']
* 2n3
Compute A-'b
* 2n
3
Transcribed Image Text:Table 1 Approximate Cost for an n x n Matrix A with Large n Algorithm Cost in Flops Gauss-Jordan elimination (forward phase) Gauss-Jordan elimination (backward phase) n? LU-decomposition of A Forward substitution to solve Ly = b Backward substitution to solve Ux = y A-' by reducing [A |I] to [! | A-'] * 2n3 Compute A-'b * 2n 3
4. The IBM Sequoia computer can operate at speeds in excess
of 16 petaflops per second (1 petaflop = 1015 flops). Use Ta-
ble 1 to estimate the time required to perform the following
operations on an invertible 100,000 × 100,000 matrix A.
(a) Execute the forward phase of Gauss-Jordan elimination.
(b) Execute the backward phase of Gauss-Jordan elimina-
tion.
(c) LU-decomposition of A.
(d) Find A-l by reducing [A | I] to [I | A¬'].
Transcribed Image Text:4. The IBM Sequoia computer can operate at speeds in excess of 16 petaflops per second (1 petaflop = 1015 flops). Use Ta- ble 1 to estimate the time required to perform the following operations on an invertible 100,000 × 100,000 matrix A. (a) Execute the forward phase of Gauss-Jordan elimination. (b) Execute the backward phase of Gauss-Jordan elimina- tion. (c) LU-decomposition of A. (d) Find A-l by reducing [A | I] to [I | A¬'].
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Similar questions
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Elementary Linear Algebra (MindTap Course List)
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:
9781305658004
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax