Very Large Matrix Processing Task
(Redirected from very large matrix problem)
Jump to navigation
Jump to search
A Very Large Matrix Processing Task is a large matrix processing task for a very large matrix dataset.
- Context:
- It can range from being a Sparse Very Large Matrix Processing Task to being a Dense Very Large Matrix Processing Task.
- It can be solved by a Very Large Matrix Processing System.
- See: Matrix Analysis.
References
2011
- (Mahoney, 2011) ⇒ Michael W. Mahoney. (2011). “Randomized Algorithms for Matrices and Data.” Now Publishers Inc.. ISBN:1601985061, 9781601985064
- QUOTE: Randomized algorithms for very large matrix problems have received a great deal of attention in recent years. Much of this work was motivated by problems in large-scale data analysis, largely since matrices are popular structures with which to model data drawn from a wide range of application domains, and the success of this line of work opens the possibility of performing matrix-based computations with truly massive data sets. ...
... By focusing on ubiquitous and fundamental problems such as least squares approximation and low-rank matrix approximation ...
- QUOTE: Randomized algorithms for very large matrix problems have received a great deal of attention in recent years. Much of this work was motivated by problems in large-scale data analysis, largely since matrices are popular structures with which to model data drawn from a wide range of application domains, and the success of this line of work opens the possibility of performing matrix-based computations with truly massive data sets. ...