Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices (Q836707)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5602050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices |
scientific article; zbMATH DE number 5602050 |
Statements
Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices (English)
0 references
8 September 2009
0 references
matrix functions
0 references
sparse and banded matrices
0 references
decay rates
0 references
linear time algorithms
0 references
Chebyshev polynomials
0 references
Faber polynomials
0 references
density matrix
0 references
trace
0 references
determinant
0 references
numerical examples
0 references
0.7919452786445618
0 references
0.7893689274787903
0 references
0.7892515659332275
0 references
0.7831010818481445
0 references
0.7831007838249207
0 references
