On Accelerating Concurrent PCA Computations for Financial Risk Applications
暂无分享,去创建一个
Mayank Bakshi | Anubhav Jain | Easwar Subramanian | Amit Kalele | Anubhav Jain | E. Subramanian | M. Bakshi | Amit Kalele | Mayank Bakshi
[1] Vidaurre Carmen. Investigation of Non-stationarity in Brain Activity via Robust Principal Component Analysis , 2010 .
[2] B. W. Golub,et al. Measuring Yield Curve Risk Using Principal Components, Analysis, Value, At Risk, And Key Rate Durations , 1997 .
[3] Charles L. Lawson,et al. Basic Linear Algebra Subprograms for Fortran Usage , 1979, TOMS.
[4] C. Alexander,et al. Market risk analysis. Volume IV. Value at risk models , 2009 .
[5] J. G. F. Francis,et al. The QR Transformation - Part 2 , 1962, Comput. J..
[6] Peter G. Harrison,et al. Performance modelling of communication networks and computer architectures , 1992, International computer science series.
[7] J. G. F. Francis,et al. The QR Transformation A Unitary Analogue to the LR Transformation - Part 1 , 1961, Comput. J..
[8] Michael J. Black,et al. Robust Principal Component Analysis for Computer Vision , 2001, ICCV.
[9] Theodore B. Trafalis,et al. Kernel principal component analysis and support vector machines for stock price prediction , 2007 .
[10] Carol Alexander. Market Risk Analysis , 2009 .
[11] V. Kublanovskaya. On some algorithms for the solution of the complete eigenvalue problem , 1962 .
[12] W. Fung,et al. Empirical Characteristics of Dynamic Trading Strategies: The Case of Hedge Funds , 1997 .
[13] D. Sorensen,et al. LAPACK Working Note No. 2: Block reduction of matrices to condensed forms for eigenvalue computations , 1987 .
[14] Karl Pearson F.R.S.. LIII. On lines and planes of closest fit to systems of points in space , 1901 .
[15] D. Sorensen,et al. Block reduction of matrices to condensed forms for eigenvalue computations , 1990 .
[16] Noelle Foreshaw. Options… , 2010 .
[17] Jack Dongarra,et al. LAPACK Users' Guide, 3rd ed. , 1999 .
[18] J. Hull. Options, Futures, and Other Derivatives , 1989 .
[19] B. Parlett,et al. Relatively robust representations of symmetric tridiagonals , 2000 .
[20] B. Parlett,et al. Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices , 2004 .
[21] J. Cuppen. A divide and conquer method for the symmetric tridiagonal eigenproblem , 1980 .
[22] Charles Trzcinka,et al. Sequential Tests of the Arbitrage Pricing Theory: A Comparison of Principal Components and Maximum Likelihood Factors , 1990 .
[23] Radford M. Neal. Pattern Recognition and Machine Learning , 2007, Technometrics.
[24] Jack J. Dongarra,et al. Tridiagonalization of a dense symmetric matrix on multiple GPUs and its application to symmetric eigenvalue problems , 2014, Concurr. Comput. Pract. Exp..
[25] T.B. Trafalis,et al. Kernel principal component analysis and support vector machines for stock price prediction , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).