Matrix-free linear system solving and applications to symbolic computation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Matrix-free linear system solving and applications to symbolic computation

Source

Year of Publication: 1996

Order Number:UMI Order No. GAX96-22917

Author

Austin Anthony Lobo

Rensselaer Polytechnic Institute

Publisher

Rensselaer Polytechnic Institute Troy, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 5

Additional Information:

cited by index terms collaborative colleagues

Tools and Actions:	Review this Doctoral Thesis Save this Doctoral Thesis to a Binder Display Formats: BibTeX EndNote ACM Ref

CITED BY 5

	E. Kaltofen , A. Lobo, On rank properties of Toeplitz matrices over finite fields, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.241-249, July 24-26, 1996, Zurich, Switzerland
	G. Villard, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract), Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.32-39, July 21-23, 1997, Kihei, Maui, Hawaii, United States
	Wayne Eberly, Early termination over small fields, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.80-87, August 03-06, 2003, Philadelphia, PA, USA
	Pascal Giorgi , Claude-Pierre Jeannerod , Gilles Villard, On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.135-142, August 03-06, 2003, Philadelphia, PA, USA
	Emmanuel Thomé, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Journal of Symbolic Computation, v.33 n.5, p.757-775, May 2002