Ihde, Steven L., authorBates, Dan, advisorPeterson, Chris, committee memberYoung, Peter, committee member2007-01-032007-01-032011http://hdl.handle.net/10217/51875Polynomial systems are ubiquitous in today's scientific world. These systems need to be solved quickly and efficiently. One key solution method comes from Numerical Algebraic Geometry, specifically Homotopy Continuation. This method involves following paths from the solutions of a simpler system to the solutions of the target system. If we can follow fewer or better conditioned paths to the solution set, the result is better efficiency. Our goal is to precondition the original system in order to achieve such efficiency. Using dual spaces and H-bases, we are able to remove poorly conditioned paths and at worst replace them with, possibly more, better conditioned paths. At best we can trim the system down so that we track only the paths that lead to solutions. These techniques require only numerical linear algebra and are therefore easily computed. In this thesis we will introduce H-bases and dual spaces, show some promising preliminary results, and discuss further work in this area.born digitalmasters thesesengCopyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.dual basispolynomial systemsnumerical algebraic geometryhomotopy continuationH-basisText