A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices (Q2923368): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ATLAS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041636959 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1212.3521 / rank | |||
Normal rank | |||
Latest revision as of 09:55, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices |
scientific article |
Statements
A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices (English)
0 references
15 October 2014
0 references
fast algorithms
0 references
matrix compression
0 references
recursive skeletonization
0 references
sparse QR decomposition
0 references
weighted least squares
0 references
deferred correction
0 references
radial basis functions
0 references
updating/downdating
0 references
numerical examples
0 references
hierarchically block separable matrices
0 references
QR factorization
0 references
