Randomized Circulant and Gaussian Pre-processing
暂无分享,去创建一个
[1] Erich Kaltofen,et al. On Wiedemann's Method of Solving Sparse Linear Systems , 1991, AAECC.
[2] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[3] Victor Y. Pan,et al. Transformations of Matrix Structures Work Again , 2013, 1303.0353.
[4] James R. Bunch,et al. Stability of Methods for Solving Toeplitz Systems of Equations , 1985 .
[5] R. E. Cline,et al. Generalized inverses of certain Toeplitz matrices , 1974 .
[6] Martin Morf,et al. Doubling algorithms for Toeplitz and related equations , 1980, ICASSP.
[7] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[8] Thomas Kailath,et al. Fast reliable algorithms for matrices with structure , 1999 .
[9] A. Edelman. Eigenvalues and condition numbers of random matrices , 1988 .
[10] Raymond H. Chan,et al. Conjugate Gradient Methods for Toeplitz Systems , 1996, SIAM Rev..
[11] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[12] Alan Edelman,et al. Tails of Condition Number Distributions , 2005, SIAM J. Matrix Anal. Appl..
[13] Victor Y. Pan,et al. Random multipliers numerically stabilize Gaussian and block Gaussian elimination: Proofs and an extension to low-rank approximation ☆ , 2014, 1406.5802.
[14] Victor Y. Pan,et al. Fundamental Computations with Polynomials , 1994 .
[15] B. Anderson,et al. Asymptotically fast solution of toeplitz and related systems of linear equations , 1980 .
[16] M. Morf. Fast Algorithms for Multivariable Systems , 1974 .
[17] Victor Y. Pan,et al. Estimating the Norms of Random Circulant and Toeplitz Matrices and Their Inverses , 2013 .
[18] James Demmel,et al. Communication lower bounds and optimal algorithms for numerical linear algebra*† , 2014, Acta Numerica.
[19] V. Pan,et al. Degeneration of Structured Integer Matrices Modulo an Integer , 2008 .
[20] B. D. Saunders,et al. Efficient matrix preconditioners for black box linear algebra , 2002 .
[21] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[22] Victor Y. Pan,et al. How Bad Are Vandermonde Matrices? , 2015, SIAM J. Matrix Anal. Appl..
[23] J. Demmel. The Probability That a Numerical, Analysis Problem Is Difficult , 2013 .
[24] Zizhong Chen,et al. Condition Numbers of Gaussian Random Matrices , 2005, SIAM J. Matrix Anal. Appl..
[25] V. Pan. Structured Matrices and Polynomials: Unified Superfast Algorithms , 2001 .
[26] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[27] S. Szarek,et al. Chapter 8 - Local Operator Theory, Random Matrices and Banach Spaces , 2001 .
[28] Victor Y. Pan,et al. Randomized preprocessing versus pivoting , 2013 .