O(1) Computation of Legendre Polynomials and Gauss-Legendre Nodes and Weights for Parallel Computing

By I. Bogaert, B. Michiels, J. Fostier. 2012

56 citations recorded by the source corpus.

Subfields: Atomic and Molecular Physics, and Optics, Computational Theory and Mathematics, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Atomic and Molecular Physics, and Optics

1. Tamás Sarlós

In Computational Theory and Mathematics

1. Alex Smola
2. Tamás Sarlós
3. Quoc V. Le
4. David P. Woodruff
5. Charalampos E. Tsourakakis
6. Michael W. Mahoney
7. Joel A. Tropp
8. Per-Gunnar Martinsson

In Information Systems

1. Quoc V. Le
2. Tamás Sarlós
3. Alex Smola
4. Julian McAuley

Citations in the corpus

• Fastfood: Approximate Kernel Expansions in Loglinear Time (2014, background): “Recent work of Bogaert et al. (2012) shows that (quite surprisingly) this is possible in O (1) time for L n ( t ) regardless of the degree of the polynomial.”