Message Length Effects for Solving Polynomial Systems on a Hypercube

dc.contributor.author	Pelz, Wolfgang	en
dc.contributor.author	Watson, Layne T.	en
dc.contributor.department	Computer Science	en
dc.date.accessioned	2013-06-19T14:36:04Z	en
dc.date.available	2013-06-19T14:36:04Z	en
dc.date.issued	1986	en
dc.description.abstract	Comparisons between problems solved on uniprocessor systems and those solved on distributed computing systems generally ignore the overhead associated with information transfer from one process to another. This paper considers the solution of polynomial systems of equations via a globally convergent homotopy algorithm on a hypercube and some timing results for different situations.	en
dc.format.mimetype	application/pdf	en
dc.identifier	http://eprints.cs.vt.edu/archive/00000033/	en
dc.identifier.sourceurl	http://eprints.cs.vt.edu/archive/00000033/01/TR-86-26.pdf	en
dc.identifier.trnumber	TR-86-26	en
dc.identifier.uri	http://hdl.handle.net/10919/19819	en
dc.language.iso	en	en
dc.publisher	Department of Computer Science, Virginia Polytechnic Institute & State University	en
dc.relation.ispartof	Historical Collection(Till Dec 2001)	en
dc.rights	In Copyright	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.title	Message Length Effects for Solving Polynomial Systems on a Hypercube	en
dc.type	Technical report	en
dc.type.dcmitype	Text	en

Files

Now showing 1 - 1 of 1