Faster inversion and other black box matrix computations using efficient block projections
暂无分享,去创建一个
[1] M. G. Bruin,et al. A uniform approach for the fast computation of Matrix-type Padé approximants , 1996 .
[2] Erich Kaltofen,et al. On Wiedemann's Method of Solving Sparse Linear Systems , 1991, AAECC.
[3] Wayne Eberly. Processor-efficient parallel matrix inversion over abstract fields: two extensions , 1997, PASCO '97.
[4] Jean-Guillaume Dumas,et al. Integer Smith form via the valence: experience with large sparse matrices from homology , 2000, ISSAC.
[5] J. Dixon. Exact solution of linear equations usingP-adic expansions , 1982 .
[6] Erich Kaltofen,et al. Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems , 1993, AAECC.
[7] Erich Kaltofen,et al. On the complexity of computing determinants , 2001, computational complexity.
[8] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.
[9] Mark Giesbrecht,et al. Fast computation of the Smith form of a sparse integer matrix , 2002, computational complexity.
[10] Erich Kaltofen,et al. On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.
[11] Claude-Pierre Jeannerod,et al. On the complexity of polynomial matrix computations , 2003, ISSAC '03.
[12] Mark Giesbrecht,et al. Efficient parallel solution of sparse systems of linear diophantine equations , 1997, PASCO '97.
[13] Erich Kaltofen,et al. LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA , 2002 .
[14] Victor Y. Pan,et al. Improved algorithms for computing determinants and resultants , 2005, J. Complex..
[15] Victor Y. Pan,et al. Fast Rectangular Matrix Multiplication and Applications , 1998, J. Complex..
[16] Numerische Mathematik. Exact Solution of Linear Equations Using P-Adie Expansions* , 2005 .
[17] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[18] George Labahn,et al. The Inverses of Block Hankel and Block Toeplitz Matrices , 1990, SIAM J. Comput..
[19] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[20] V. Pan,et al. TR-2004013: Toeplitz and Hankel Meet Hensel and Newton: Nearly Optimal Algorithms and Their Practical Acceleration with Saturated Initialization , 2004 .
[21] Gilles Villard,et al. Solving sparse rational linear systems , 2006, ISSAC '06.
[22] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[23] Éric Schost,et al. Polynomial evaluation and interpolation on special sets of points , 2005, J. Complex..
[24] B. D. Saunders,et al. Efficient matrix preconditioners for black box linear algebra , 2002 .