O C ] 1 4 M ay 2 01 9 Approximating Orthogonal Matrices with Effective Givens Factorization
暂无分享,去创建一个
[1] Nicolas Tremblay,et al. Approximate Fast Graph Fourier Transforms via Multilayer Sparse Approximations , 2016, IEEE Transactions on Signal and Information Processing over Networks.
[2] Pierre Vandergheynst,et al. Geometric Deep Learning: Going beyond Euclidean data , 2016, IEEE Signal Process. Mag..
[3] Sushant Sachdeva,et al. Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[4] Gal Chechik,et al. Coordinate-descent for learning orthogonal matrices through Givens rotations , 2014, ICML.
[5] Vikas K. Garg,et al. Multiresolution Matrix Factorization , 2014, ICML.
[6] Pascal Frossard,et al. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.
[7] Stanford,et al. Learning to Discover Social Circles in Ego Networks , 2012 .
[8] A. Arenas,et al. Self-similar community structure in a network of human interactions. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[9] B. Hall. Lie Groups, Lie Algebras, and Representations , 2003 .
[10] G. Golub,et al. Eigenvalue computation in the 20th century , 2000 .
[11] Jack J. Dongarra,et al. Guest Editors Introduction to the top 10 algorithms , 2000, Comput. Sci. Eng..
[12] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[13] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .
[14] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[15] Arnold Schönhage,et al. Zur quadratischen Konvergenz des Jacobi-Verfahrens , 1964 .
[16] W. Givens. Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form , 1958 .
[17] C. Jacobi. Über ein leichtes Verfahren die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen*). , 2022 .