We have a system Lx = b, b 0 where L is a 100000 x 100000...

 

Transcribed Image Text:

We have a system Lx = b, b 0 where L is a 100000 x 100000 lower- triangular matrix and b is a 100000 × 1 vector. The computer system on which we would like to solve this system has two constraints - one, we cannot store the matrix L in memory, but can only store individual rows of the matrix in memory, and two, writes into memory are much more expensive than reads from memory. Can you write an algorithm to solve this system respecting the first constraint and ensuring that you make as few writes to memory as possible. We have a system Lx = b, b 0 where L is a 100000 x 100000 lower- triangular matrix and b is a 100000 × 1 vector. The computer system on which we would like to solve this system has two constraints - one, we cannot store the matrix L in memory, but can only store individual rows of the matrix in memory, and two, writes into memory are much more expensive than reads from memory. Can you write an algorithm to solve this system respecting the first constraint and ensuring that you make as few writes to memory as possible.

Answer rating: 100% (QA)

To solve the system Lx b with the given constraints we can use the forward substitution method for l... View the full answer