Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Homotopy Continuation"”.
-
An Sn Application of Homotopy Continuation in Neutral Particle Transport
… dissertation is to investigate the usefulness of homotopy continuation applied in the context of neutral particle transport where traditional methods of acceleration degrade. This occurs in higher dimensional heterogeneous problems [51]. We focus on utilizing homotopy continuation as a means of …
-
Application of the homotopy continuation method to low-eccentricity preliminary orbit determination
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1991.
-
The solution of variable-geometry truss problems using new homotopy continuation methods
… On the other hand, recently developed methods in homotopy continuation for polynomials are not only global, but also exhaustive; i.e., they do not require good initial guesses and they also guarantee convergence to all solutions. Homotopies are a traditional part of topology and have only recently …
-
New Techniques for Polynomial System Solving
… use of numerical analysis techniques such as the homotopy continuation methods and Newton's method. In each case several conversion techniques have been developed, optimized and implemented. Finally, the efficiency of the developed techniques and strategies is examined using standard cryptographic …
-
Optimal Control for Autonomous Motor Behavior
… issue is addressed by using a shaping protocol: homotopy-continuation), whereby the solution of an easier variant of the problem is used as initial guess for a harder variant of the problem, gradually finding a solution to the original domain. In dynamic environments, effective behavior requires …
-
Optimization by Gaussian smoothing with application to geometric alignment
It is well-known that global optimization of a nonconvex function, in general, is computationally intractable. Nevertheless, many objective functions that we need to optimize may be nonconvex. In practice, when working with such a nonconvex function, a very natural heuristic is to employ a …