Numerical Analysis and Computation Commons^™

Distributed Evolution Of Spiking Neuron Models On Apache Mahout For Time Series Analysis, Andrew Palumbo

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Electrodynamical Modeling For Light Transport Simulation, Michael G. Saunders

Undergraduate Honors Theses

Modernity in the computer graphics community is characterized by a burgeoning interest in physically based rendering techniques. That is to say that mathematical reasoning from first principles is widely preferred to ad hoc, approximate reasoning in blind pursuit of photorealism. Thereby, the purpose of our research is to investigate the efficacy of explicit electrodynamical modeling by means of the generalized Jones vector given by Azzam [1] and the generalized Jones matrix given by Ortega-Quijano & Arce-Diego [2] in the context of stochastic light transport simulation for computer graphics. To augment the status quo path tracing framework with such a modeling …

Computational Fluid Dynamics In A Terminal Alveolated Bronchiole Duct With Expanding Walls: Proof-Of-Concept In Openfoam, Jeremy Myers

Theses and Dissertations

Mathematical Biology has found recent success applying Computational Fluid Dynamics (CFD) to model airflow in the human lung. Detailed modeling of flow patterns in the alveoli, where the oxygen-carbon dioxide gas exchange occurs, has provided data that is useful in treating illnesses and designing drug-delivery systems. Unfortunately, many CFD software packages have high licensing fees that are out of reach for independent researchers. This thesis uses three open-source software packages, Gmsh, OpenFOAM, and ParaView, to design a mesh, create a simulation, and visualize the results of an idealized terminal alveolar sac model. This model successfully demonstrates that OpenFOAM can be …

A Physics-Based Approach To Modeling Wildland Fire Spread Through Porous Fuel Beds, Tingting Tang

Theses and Dissertations--Mechanical and Aerospace Engineering

Wildfires are becoming increasingly erratic nowadays at least in part because of climate change. CFD (computational fluid dynamics)-based models with the potential of simulating extreme behaviors are gaining increasing attention as a means to predict such behavior in order to aid firefighting efforts. This dissertation describes a wildfire model based on the current understanding of wildfire physics. The model includes physics of turbulence, inhomogeneous porous fuel beds, heat release, ignition, and firebrands. A discrete dynamical system for flow in porous media is derived and incorporated into the subgrid-scale model for synthetic-velocity large-eddy simulation (LES), and a general porosity-permeability model is …

An Algorithm For The Machine Calculation Of Minimal Paths, Robert Whitinger

Electronic Theses and Dissertations

Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R³, but also to the general case of finding minimal functionals on hypersurfaces in Rⁿ associated with an arbitrary metric.

Optimizing The Mix Of Games And Their Locations On The Casino Floor, Jason D. Fiege, Anastasia D. Baran

International Conference on Gambling & Risk Taking

We present a mathematical framework and computational approach that aims to optimize the mix and locations of slot machine types and denominations, plus other games to maximize the overall performance of the gaming floor. This problem belongs to a larger class of spatial resource optimization problems, concerned with optimizing the allocation and spatial distribution of finite resources, subject to various constraints. We introduce a powerful multi-objective evolutionary optimization and data-modelling platform, developed by the presenter since 2002, and show how this software can be used for casino floor optimization. We begin by extending a linear formulation of the casino floor …

Stationary And Time-Dependent Optimization Of The Casino Floor Slot Machine Mix, Anastasia D. Baran, Jason D. Fiege

International Conference on Gambling & Risk Taking

Modeling and optimizing the performance of a mix of slot machines on a gaming floor can be addressed at various levels of coarseness, and may or may not consider time-dependent trends. For example, a model might consider only time-averaged, aggregate data for all machines of a given type; time-dependent aggregate data; time-averaged data for individual machines; or fully time dependent data for individual machines. Fine-grained, time-dependent data for individual machines offers the most potential for detailed analysis and improvements to the casino floor performance, but also suffers the greatest amount of statistical noise. We present a theoretical analysis of single …

Statistics In League Of Legends: Analyzing Runes For Last-Hitting, Brian M. Hook

Mathematics: Student Scholarship & Creative Works

While other sports have statisticians to evaluate players and their stats, in electronic sports there is a need for statisticians to evaluate different parts of the game. League of Legends is the most popular of ESports and is the focus of this discussion. The mechanic of focus here is runes which give boosts to the players stats in-game like being able to do extra damage. We will be finding the effectiveness of these runes by looking at gold efficiency, help with last hitting, and extra damage dealt through the use of Python.

Teaching Numerical Methods In The Context Of Galaxy Mergers, Maria Kourjanskaia

Physics

Methods of teaching numerical methods to solve ordinary differential equations in the context of galaxy mergers were explored. The research published in a paper by Toomre and Toomre in 1972 describing the formation of galactic tails and bridges from close tidal interactions was adapted into a project targeting undergraduate physics students. Typically undergraduate physics students only take one Computational Physics class in which various techniques and algorithms are taught. Although it is important to study computational physics techniques, it is just as important to apply this knowledge to a problem that is representative of what computational physics researchers are investigating …

Hpcnmf: A High-Performance Toolbox For Non-Negative Matrix Factorization, Karthik Devarajan, Guoli Wang

COBRA Preprint Series

Non-negative matrix factorization (NMF) is a widely used machine learning algorithm for dimension reduction of large-scale data. It has found successful applications in a variety of fields such as computational biology, neuroscience, natural language processing, information retrieval, image processing and speech recognition. In bioinformatics, for example, it has been used to extract patterns and profiles from genomic and text-mining data as well as in protein sequence and structure analysis. While the scientific performance of NMF is very promising in dealing with high dimensional data sets and complex data structures, its computational cost is high and sometimes could be critical for …

Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera

Publications

In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n�1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.

Factorized Runge-Kutta-Chebyshev Methods, Stephen O'Sullivan

Conference papers

The second-order extended stability Factorized Runge-Kutta-Chebyshev (FRKC2) class of explicit schemes for the integration of large systems of PDEs with diffusive terms is presented. FRKC2 schemes are straightforward to implement through ordered sequences of forward Euler steps with complex stepsizes, and easily parallelised for large scale problems on distributed architectures.

Preserving 7 digits for accuracy at 16 digit precision, the schemes are theoretically capable of maintaining internal stability at acceleration factors in excess of 6000 with respect to standard explicit Runge-Kutta methods. The stability domains have approximately the same extents as those of RKC schemes, and are a third longer …

General Solution Of The Wind Triangle Problem And The Critical Tailwind Angle, Nihad E. Daidzic

Aviation Department Publications

A general analytical solution of the navigational wind-triangle problem and the calculation of the critical tailwind angle are presented in this study among other findings. Any crosswind component will effectively create a headwind component on fixed course tracks. The meaning of a route track is lost with excessive crosswinds representing the bifurcation point between the possible and the impossible navigational solutions. Any wind of constant direction and speed will effectively reduce groundspeed and increase time-of-flight on closed-loop multi-segment flights. Effective wind track component consists, in general, of true and induced components. The average groundspeed of multiple-leg flights is a harmonic …

Stereographic Visualization Of Bose-Einstein Condensate Clouds To Measure The Gravitational Constant, Ed Wesley Wells

College of Graduate Studies: Theses & Dissertations

This thesis describes a set of tools that can be used for the rapid design of atom interferometer schemes suitable for measuring Newton's Universal Gravitation constant also known as "Big G". This tool set is especially applicable to Bose--Einstein--condensed systems present in NASA's Cold Atom Laboratory experiment to be deployed to the International Space Station in 2017. These tools include a method of approximating the solutions of the nonlinear Schrödinger or Gross--Pitaevskii equation (GPE) using the Lagrangian Variational Method. They also include a set of software tools for translating the approximate solutions of the GPE into images of the optical …

Generating Combinatorial Objects- A New Perspective, Alexander Chizoma Nwala

Computer Science Theses & Dissertations

Combinatorics is the science of "possibilities." This definition, while not formal is a fair statement because all too often, in order to gain insight into the solution of many counting problems, we explore the possibilities. In some cases we seek to know how many options, while in other cases we seek to enumerate or list the options. Irrespective of the scenario, combinatorics plays a vital role today. In many instances such as exploring the options for choosing a new password for a combination lock, we employ combinatorics. In considering the possible license plate permutations for a state, or to see …

A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky

Publications

The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasiseparable, semiseparable and well-free Vandermonde-like matrices having O(n2) complexity. To do so we identify structures of displacement operators in terms of generators and the recurrence relations(2-term and 3-term) between the columns of the basis transformation matrices for quasiseparable, semiseparable and well-free polynomials. Finally we …

Selection Of Step Size For Total Variation Minimization In Ct, Anna N. Yeboah

College of Graduate Studies: Theses & Dissertations

Medical image reconstruction by total variation minimization is a newly developed area in computed tomography (CT). In compressed sensing literature, it hasbeen shown that signals with sparse representations in an orthonormal basis may be reconstructed via l1-minimization. Furthermore, if an image can be approximately modeled to be piecewise constant, then its gradient is sparse. The application of l1-minimization to a sparse gradient, known as total variation minimization, may then be used to recover the image. In this paper, the steepest descent method is employed to update the approximation of the image. We propose a way to estimate an optimal step …

Random Number Generation: Types And Techniques, David F. Dicarlo

Senior Honors Theses

What does it mean to have random numbers? Without understanding where a group of numbers came from, it is impossible to know if they were randomly generated. However, common sense claims that if the process to generate these numbers is truly understood, then the numbers could not be random. Methods that are able to let their internal workings be known without sacrificing random results are what this paper sets out to describe. Beginning with a study of what it really means for something to be random, this paper dives into the topic of random number generators and summarizes the key …

Preconditioning Visco-Resistive Mhd For Tokamak Plasmas, Daniel R. Reynolds, Ravi Samtaney, Hilari C. Tiedeman

Mathematics Research

No abstract provided.

Block Preconditioning Of Stiff Implicit Models For Radiative Ionization In The Early Universe, Daniel R. Reynolds, Robert Harkness, Geoffrey So, Michael L. Norman

Mathematics Research

No abstract provided.

Quantitative Characterization Of Microstructure Features For 1st Generation Advanced High Strength Steels, Margarita Vidrio, Ellen Liu, Donsheng Li, Kyoo Sil Choi, Xin Sun

STAR Program Research Presentations

The role of Advanced High Strength Steels (AHSS) in the automotive industry is important because of its affordability and excellent mechanical properties. The 1st generation of AHSS achieves its preferred combination of strength and ductility by embedding harder martensite grains into softer ferritic matrix. Ductility and strength of these steels are important to safety, formability, application, and life. However, a noticeable degree of inconsistent forming behaviors has been observed in the 1st generation AHSS in production, which seems to be related to the microstructure-level inhomogeneity. The objective of this project is to grain fundamental understandings on how different microstructure level …

Convergence Of The Sinc Method Applied To Volterra Integral Equations, M. Zarebnia, J. Rashidinia

Applications and Applied Mathematics: An International Journal (AAM)

A collocation procedure is developed for the linear and nonlinear Volterra integral equations, using the globally defined Sinc and auxiliary basis functions. We analytically show the exponential convergence of the Sinc collocation method for approximate solution of Volterra integral equations. Numerical examples are included to confirm applicability and justify rapid convergence of our method.

Parallel And Distributed Simulation Of Parabolic And Telegraphic Equations., Ewedafe Simon Uzezi

Student Works (2010-2019)

In this thesis, a parallel implementation of explicit/implicit parallel algorithms such as the stationary iterative methods and the class of iterating alternating methods which includes: Alternating Direction Implicit (ADI), Iterative Alternating Direction Explicit (IADE), for D’Yakonov (IADE-DY), Double sweep Mitchell and Fairweather (MF-DS) and Alternating Group Explicit (AGE) method for solving 1-Dimensional (1-D), 2-Dimensional (2-D) Parabolic (special examples including 1-D, 2-D Bio-Heat Equation) and 1-D, 2-D and 3-D Telegraphic Equations on a distributed environment of Message Passing Interface (MPI) and Parallel Virtual Machine (PVM) platform is presented. To correlate the communication activity with computation, we counted events between significant MPI/PVM …

Multirate Time-Frequency Distributions, John R. O'Hair

Theses and Dissertations

Multirate systems, which find application in the design and analysis of filter banks, are demonstrated to also be useful as a computational paradigm. It is shown that any problem which can be expressed a set of vector-vector, matrix-vector or matrix-matrix operations can be recast using multirate. This means all of numerical linear algebra can be recast using multirate as the underlying computational paradigm. As a non-trivial example, the multirate computational paradigm is applied to the problem of Generalized Discrete Time- Frequency Distributions GDTFD to create a new family of fast algorithms. The first of this new class of distributions is …

An Interval Newton Method, E R. Hansen, R I. Greenberg

Computer Science: Faculty Publications and Other Works

We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three subalgorithms. The first is a Gauss-Seidel-type step. The second is a real (noninterval) Newton iteration. The third solves the linearized equations by elimination. We explain why each subalgorithm is desirable and how they fit together to provide solutions in as little as one-third or one-quarter the time required by Krawczyk's method [7] in our implementations.