(a) Approximate the time required to execute the forward phase of GaussJordan

Chapter 9, Problem 5

(choose chapter or problem)

(a) Approximate the time required to execute the forward phase of GaussJordan elimination for a system of 100,000 equations in 100,000 unknowns using a computer that can execute 1 gigaflop per second. Do the same for the backward phase. (See Table 1.) (b) How many gigaflops per second must a computer be able to execute to find the -decomposition of a matrix of size 10,000 10,000 in less than 0.5 s? (See Table 1.)

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Becoming a subscriber
Or look for another answer

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back