On the Computation of Neumann Series

A. V. Aho and N. J. A. Sloane, “Some doubly exponential sequences,” Fibonacci Quarterly , vol. 11, no. 4, pp. 429–437, 1973

1973

Earlier work this paper cites.

J. K. Yan, “Advances in computer-generated imagery for flight simulation,” IEEE Computer Graphics and Applications , vol. 5, no. 8, pp. 37 – 51, August 1985

1985

Earlier work this paper cites.

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics . Reading, MA: Addison-Wesley Publishing Company, 1989

1989

Earlier work this paper cites.

D. Westreich, “Evaluating the matrix polynomial 𝐈 + 𝐀 + … + 𝐀 N − 1 \mathbf{I}+\mathbf{A}+\ldots+\mathbf{A}^{N-1} ,” IEEE Transactions on Circuits and Systems , vol. 36, no. 1, pp. 162–164, jan 1989

1989

Earlier work this paper cites.

R. Hall, Illumination and Color in Computer Generated Imagery . Berlin, New York, Paris: Springer, 1989

1989

Earlier work this paper cites.

Y. Y. Zeevi, M. Porat, and G. A. Geri, “Computer image generation for flight simulators: The gabor approach,” Springer The Visual Computer , vol. 6, no. 2, pp. 93 – 105, March 1990

1990

Earlier work this paper cites.

S. C. D. Roy and S. Minocha, “On the evaluation of a matrix polynomial,” IEEE Transactions on Circuits and Systems I: , vol. 39, no. 7, pp. 567 – 570, jul 1992

1992

Earlier work this paper cites.

L. Lei and T. Nakamura, “A fast algorithm for evaluating the matrix polynomial 𝐈 + 𝐀 + … + 𝐀 N − 1 \mathbf{I}+\mathbf{A}+\ldots+\mathbf{A}^{N-1} ,” IEEE Transactions on Circuit and Systems I: Fundamental Theory and Applications , vol. 39, no. 4, pp. 299 – 300, apr 1992

1992

Earlier work this paper cites.

V. S. Dimitrov and B. Donevsky, “A limited disproof to the conjecture of evaluating the matrix polynomial 𝐈 + 𝐀 + … + 𝐀 N − 1 \mathbf{I}+\mathbf{A}+\ldots+\mathbf{A}^{N-1} ,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications , vol. 41, no. 3, pp. 247 – 248, mar 1994

1994

Earlier work this paper cites.

V. S. Dimitrov and T. Cooklev, “Hybrid algorithm for the computation of the matrix polynomial 𝐈 + 𝐀 + … + 𝐀 N − 1 \mathbf{I}+\mathbf{A}+\ldots+\mathbf{A}^{N-1} ,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications , vol. 42, no. 7, pp. 377–380, jul 1995

1995

Cited alongside, same era.

G. W. Stewart, Matrix Algorithms: Basic Decompositions . College Park, MD: Society for Industrial and Applied Mathematics, 1998, vol. 1

1998

Cited alongside, same era.

P. Lecocq, S. Michelin, D. Arques, and A. Kemeny, “Mathematical approximation for real-time lighting rendering through participating media,” oct 2000, the Eighth Pacific Conference on Computer Graphics and Applications

2000

Cited alongside, same era.

S. M. Ross, Probability and Statistics For Engineers and Scientists , 3rd ed. Berkeley, CA: Elsevier Academic Press, 2004

2004

Cited alongside, same era.

M. Chandraker, J. Bai, T.-T. Ng, and R. Ramamoorthi, “On the duality of forward and inverse light transport,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 33, no. 10, pp. 2122 – 2128, October 2011

2011

Later among the works it cites.

R. Azarderakhsh, K. Järvinen, and V. Dimitrov, “Fast inversion in G ​ F ​ ( 2 m ) {GF(2^{m})} with normal basis using hybrid-double multipliers,” IEEE Transaction on Computers , vol. 63, no. 4, pp. 1041 – 1047, oct 2012

2012

Later among the works it cites.

M. Wu, B. Yin, A. Vosoughi, C. Studer, J. R. Cavallaro, and C. Dick, “Approximate matrix inversion for high-throughput data detection in the large-scale MIMO uplink,” May 2013, IEEE International Symposium on Circuits and Systems (ISCAS)

2013

Later among the works it cites.

H. Prabhu, O. Edfors, J. Rodrigues, L. Liu, and F. Rusek, “Hardware efficient approximative matrix inversion for linear pre-coding in massive MIMO,” June 2014, IEEE International Symposium on Circuits and Systems (ISCAS)

2014