The Complexity of Accurate Floating Point Computation or Can we Compute Eigenvalues In Polynomial Time? James Demmel Mathematics and Computer Science - Theory of value - Document - PDFSEARCH.IO

First Page	Meta Content
	The Complexity of Accurate Floating Point Computation or Can we Compute Eigenvalues In Polynomial Time? James Demmel Mathematics and Computer Science Add to Reading List Document Date: 2002-08-13 17:34:17 Open Document File Size: 109,59 KB Share Result on Facebook IndustryTerm conventional algorithms / / Organization National Science Foundation / UC Berkeley / / Person Ming Gu / Yozo Hida / Ivan Slapni / Stan Eisenstat / Zlatko Drma / / ProgrammingLanguage E / FP / / SocialTag Numerical linear algebra Matrix theory Eigenvalues and eigenvectors Matrix Pivot element Floating point Singular value decomposition Algorithm Algebra Linear algebra

The Complexity of Accurate Floating Point Computation or Can we Compute Eigenvalues In Polynomial Time? James Demmel Mathematics and Computer ScienceAdd to Reading List