Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials. (Q1427839): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcp.2003.08.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049704318 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59816106 / rank
 
Normal rank
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Chebyshev matrix polynomials
    0 references
    fast resummation algorithms
    0 references
    numerical examples
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references