Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Computer Sciences
Modeling Tolerance In Dynamic Social Networks, Amanda Luby
Modeling Tolerance In Dynamic Social Networks, Amanda Luby
Honors Theses, 1963-2015
The study of social networks has become increasingly important in recent years. Multi-agent systems research has proven to be an effective way of representing both static and dynamic social networks in order to model and analyze many different situations. Previous implementations of multi-agent systems have observed a phenomenon called tolerance between agents through simulation studies, which is defined as an agent maintaining an unrewarding connection. This concept has also arisen in the social sciences through the study of networks. We aim to bridge this gap between simulation studies in multi-agent systems and real-world observations. This project explores how local interactions …
Bifurcation And Non-Convergence In The Hansen-Patrick Root-Finding Method, Preston Hardy
Bifurcation And Non-Convergence In The Hansen-Patrick Root-Finding Method, Preston Hardy
Honors Theses, 1963-2015
The Hansen-Patrick Root-Finding Method is a one-parameter family of cubically convergent root-finding methods. The parameter is called alpha and can be any complex number. With a few different values of alpha, Hansen-Patrick becomes equivalent to other, more well-known root-finding methods. For example, when alpha equals -1, Hansen-Patrick becomes equivalent to Halley’s Method. There has been previous research into the dynamical systems that arise when varying the initial starting point or varying a family of functions. This paper deals with what happens when the initial point and function are fixed but the root-finding method varies. We are interested in spurious cycles …
Achieving Numerical Reproducibility In The Parallelized Floating Point Dot Product, Alyssa Anderson
Achieving Numerical Reproducibility In The Parallelized Floating Point Dot Product, Alyssa Anderson
Honors Theses, 1963-2015
The world depends on computers every day to do accurate real-world mathematics. Computers must store real numbers in a finite representation that approximates real numbers, called floating point representation. However, simply by changing the order in which we add a list of floating point numbers can provide a different result that may even be less accurate than another ordering. This is because floating point addition is not associative. That is, (a + b) + c is not necessarily equal to a + (b + c). Parallel computing techniques introduce the ability to reorder computations, thus producing a difference in results …