You mean the concept of a sparse matrix ? Well, for e.g. if you use FEM (Finite Element method) you usually end up with a huge linear system which has the nice property that more than 90% of his coefficients are zeros. A sparse matrix will store only the non-zero elements, this is a huge gain from the point of view of memory usage.
Similar considerations applies for using Finite Difference methods.
It's really useful for testing FEA algorithms/code. Tim Davis has done a ton of work developing numerical algorithms for sparse systems, his code is used by software like MATLAB and also bespoke supercomputer systems.
[+] [-] wxs|11 years ago|reply
[+] [-] efremjw|11 years ago|reply
[+] [-] AlexeyBrin|11 years ago|reply
Similar considerations applies for using Finite Difference methods.
[+] [-] zl4000|11 years ago|reply
However, god knows why this site is considered news worthy. I mean it's the same as it was yesterday, and the day before...
[+] [-] Serow225|11 years ago|reply
[+] [-] jayavanth|11 years ago|reply
[+] [-] rsingla|11 years ago|reply
[+] [-] unknown|11 years ago|reply
[deleted]