Thesis (Ph. D.)--University of Wisconsin--Madison, 1982. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 74-75).

Thesis (Ph. D.)--Illinois State University, 2004. / Title from title page screen, viewed May 23, 2006. Dissertation Committee: Cynthia W. Langrall (chair), Roger P. Day, Edward S. Mooney, Michael J. Plantholt. Includes bibliographical references (leaves 122-126) and abstract. Also available in print.

by Luk Wai Shing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1993. / Includes bibliographical references (leaves 44-45). / ABSTRACT --- p.i / ACKNOWLEDGMENTS --- p.ii / Chapter CHAPTER 1. --- INTRODUCTION --- p.1 / Chapter CHAPTER 2. --- DRAWBACKS OF CLASSICAL THEORY --- p.4 / Chapter 2.1 --- Review of Sequential Iterative Methods --- p.4 / Chapter 2.2 --- Visualization Techniques --- p.8 / Chapter 2.3 --- Review of Deflation --- p.10 / Chapter CHAPTER 3. --- THE IMPROVEMENT OF THE ABERTH METHOD --- p.11 / Chapter 3.1 --- The Durand-Kerner method and the Aberth method --- p.11 / Chapter 3.2 --- The generalized Aberth method --- p.13 / Chapter 3.3 --- The modified Aberth Method for multiple-zero --- p.13 / Chapter 3.4 --- Choosing the initial approximations --- p.15 / Chapter 3.5 --- Multiplicity estimation --- p.16 / Chapter CHAPTER 4. --- THE HIGHER-ORDER ITERATIVE METHODS --- p.18 / Chapter 4.1 --- Introduction --- p.18 / Chapter 4.2 --- Convergence analysis --- p.20 / Chapter 4.3 --- Numerical Results --- p.28 / Chapter CHAPTER 5. --- PARALLEL DEFLATION --- p.32 / Chapter 5.1 --- The Algorithm --- p.32 / Chapter 5.2 --- The Problem of Zero Component --- p.34 / Chapter 5.3 --- The Problem of Round-off Error --- p.35 / Chapter CHAPTER 6. --- HOMOTOPY ALGORITHM --- p.36 / Chapter 6.1 --- Introduction --- p.36 / Chapter 6.2 --- Choosing Q(z) --- p.37 / Chapter 6.3 --- The arclength continuation method --- p.38 / Chapter 6.4 --- The bifurcation problem --- p.40 / Chapter 6.5 --- The suggested improvement --- p.41 / Chapter CHAPTER 7. --- CONCLUSION --- p.42 / REFERENCES --- p.44 / APPENDIX A. PROGRAM LISTING --- p.A-l / APPENDIX B. COLOR PLATES --- p.B-l

by Kwok, Wong-chuen Tony. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1993. / Includes bibliographical references (leaves [85-86]). / Acknowledgement / Abstract / Chapter I --- Laguerre's Method in Polynomial Zero-finding / Chapter 1 --- Background --- p.1 / Chapter 2 --- Introduction and Problems of Laguerre´ةs Method --- p.3 / Chapter 2.1 --- Laguerre´ةs Method in Symmetrie-Cluster Problem / Chapter 2.2 --- Cyclic Behaviour / Chapter 2.3 --- Supercluster Problem / Chapter 3 --- Proposed Enhancement to Laguerre 's Method --- p.9 / Chapter 3.1 --- Analysis of Adding a Zero or Pole / Chapter 3.2 --- Proposed Algorithm / Chapter 4 --- Conclusion --- p.17 / Chapter II --- Homotopy Methods applied to Polynomial Zero-finding / Chapter 1 --- Introduction --- p.18 / Chapter 2 --- Overcoming Bifurcation --- p.22 / Chapter 3 --- Comparison of Homotopy Algorithms --- p.27 / Chapter 4 --- Conclusion --- p.29 / Appendices / Chapter I --- Laguerre's Method in Polynomial Zero-finding / Chapter 0 --- Naming of Testing Polynomials / Chapter 1 --- Finding All Zeros using Proposed Laguerre's Method / Chapter 2 --- Experiments: Selected Pictures of Comparison of Proposed Strategy with Other Strategy / Chapter 3 --- Experiments: Tables of Comparison of Proposed Strategy with Other Strategy / Chapter 4 --- Distance Colorations and Target Colorations / Chapter II --- Homotopy Methods applied to Polynomial Zero-finding / Chapter 1 --- Comparison of Algorithms using Homotopy Method / Chapter 2 --- Experiments: Selected Pictorial Comparison / Chapter III --- An Example Demonstrating Effect of Round-off Errors References

No description available.

No description available.

We consider a variety of types of vertex sequences, which are defined in terms of a requirement that the next vertex in the sequence must meet. For example, let S = (v1, v2, …, vk ) be a sequence of distinct vertices in a graph G such that every vertex vi in S dominates at least one vertex in V that is not dominated by any of the vertices preceding it in the sequence S. Such a sequence of maximal length is called a dominating sequence since the set {v1, v2, …, vk } must be a dominating set of G. In this paper we survey the literature on dominating and other related sequences, and propose for future study several new types of vertex sequences, which suggest the beginning of a theory of vertex sequences in graphs.