Gram method for computing least squares approximate solution. Algorithm 12.1 in the textbook uses the QR...

90.2K

Verified Solution

Question

Advance Math

Gram method for computing least squares approximate solution.Algorithm 12.1 in the textbook uses the QR factorization to computethe least squares approximate solution xˆ = A†b, where the m × nmatrix A has linearly independent columns. It has a complexity of2mn2 flops. In this exercise we consider an alternative method:First, form the Gram matrix G = AT A and the vector h = AT b; andthen compute xˆ = G?1h (using algorithm 11.2 in the textbook). Whatis the complexity of this method? Compare it to algorithm 12.1.Remark. You might find that the Gram algorithm appears to be a bitfaster than the QR method, but the factor is not large enough tohave any practical significance. The idea is useful in situationswhere G is partially available and can be computed more efficientlythan by multiplying A and its transpose.

Answer & Explanation Solved by verified expert

3.7 Ratings (291 Votes)

Gram method for computing least squares approximate solutionAlgorithm 121 in the textbook uses the QR factorization to computethe least squares approximate solution See Answer

Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:

Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!

Become a Member