Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials. (Q1427839): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59816106, #quickstatements; #temporary_batch_1711031506070 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Kernel polynomial approximations for densities of states and spectral functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of multiplications necessary to compute certain functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the evaluation of matrix polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5689624 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4360625 / rank | |||
Normal rank | |||
Revision as of 14:34, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials. |
scientific article |
Statements
Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials. (English)
0 references
14 March 2004
0 references
Chebyshev matrix polynomials
0 references
fast resummation algorithms
0 references
numerical examples
0 references
