Assume that a computer can solve 200 upper-triangular matrix problems of 3000 variables in 3000 unknowns per second. Estimate how long it would take to solve one, not necessarily upper-triangular, problem of 5000 equations in 5000 unknowns.
Added by Scott -.
Close
Step 1
In an upper-triangular matrix, all the elements below the main diagonal are zero. Therefore, we only need to perform operations on the non-zero elements, which are located on or above the main diagonal. The number of operations required to solve an Show more…
Show all steps
Your feedback will help us improve your experience
Kelan H and 61 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Assume that a computer solves a 1000-variable, upper-triangular, linear system by back substitution in 0.5 seconds. Estimate the time needed to solve a general (full) system by Gaussian elimination (LU-factorization). Use the counts from the notes: 2n^3/3 + O(n^2) for GE and n^2 for backward substitution.
Adi S.
A certain computer can execute 10 gigaflops per second. Use Formula (5) to find the time required to solve the system using Gauss-Jordan elimination. (a) A system of 1000 equations in 1000 unknowns. (b) A system of 10,000 equations in 10,000 unknowns. (c) A system of 100,000 equations in 100,000 unknowns.
Numerical Methods
Comparison of Procedures for Solving Linear Systems
A certain computer can execute 100 gigaflops per second. Use Formula (5) to find the time required to solve the system using Gauss-Jordan elimination. (a) A system of 10,000 equations in 10,000 unknowns. (b) A system of 100,000 equations in 100,000 unknowns. (c) A system of 1,000,000 equations in 1,000,000 unknowns.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD