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

@@ Property / DOI @@
-.1016/j.jcp.2003.08.027
@@ Property / DOI: 10.1016/j.jcp.2003.08.027 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcp.2003.08.027
+Normal rank
@@ Property / OpenAlex ID @@
+W2049704318
@@ Property / OpenAlex ID: W2049704318 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59816106
@@ Property / Wikidata QID: Q59816106 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel polynomial approximations for densities of states and spectral functions
+Normal rank
@@ Property / cites work @@
+On the number of multiplications necessary to compute certain functions
+Normal rank
@@ Property / cites work @@
+On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
+Normal rank
@@ Property / cites work @@
+A note on the evaluation of matrix polynomials
@@ Property / cites work: A note on the evaluation of matrix polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4360625
@@ Property / cites work: Q4360625 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCP.2003.08.027
@@ Property / DOI: 10.1016/J.JCP.2003.08.027 / rank @@
+Normal rank