New estimates for the recursive low-rank truncation of block-structured matrices (Q2634610): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00211-015-0716-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031215441 / rank | |||
Normal rank | |||
Revision as of 22:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New estimates for the recursive low-rank truncation of block-structured matrices |
scientific article |
Statements
New estimates for the recursive low-rank truncation of block-structured matrices (English)
0 references
17 February 2016
0 references
The author describes a cheap algorithm for the best approximation of a given matrix by a low-rank one. The algorithm uses a recursive truncation and is an obvious divide and conquer method, based on the QR and SVD decomposition.
0 references
low-rank truncation
0 references
singular value decomposition
0 references
block decomposition
0 references
recursive truncation
0 references
