Open Access. Powered by Scholars. Published by Universities.®

Algebra Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Algebra

Stability Of Cauchy's Equation On Δ+., Holden Wells Aug 2023

Stability Of Cauchy's Equation On Δ+., Holden Wells

Electronic Theses and Dissertations

The most famous functional equation f(x+y)=f(x)+f(y) known as Cauchy's equation due to its appearance in the seminal analysis text Cours d'Analyse (Cauchy 1821), was used to understand fundamental aspects of the real numbers and the importance of regularity assumptions in mathematical analysis. Since then, the equation has been abstracted and examined in many contexts. One such examination, introduced by Stanislaw Ulam and furthered by Donald Hyers, was that of stability. Hyers demonstrated that Cauchy's equation exhibited stability over Banach Spaces in the following sense: functions that approximately satisfy Cauchy's equation are approximated with the same level of error by functions …


Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates Aug 2018

Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates

Electronic Theses and Dissertations

Ever since Shor's algorithm was introduced in 1994, cryptographers have been working to develop cryptosystems that can resist known quantum computer attacks. This push for quantum attack resistant schemes is known as post quantum cryptography. Specifically, my contributions to post quantum cryptography has been to the family of schemes known as Multivariate Public Key Cryptography (MPKC), which is a very attractive candidate for digital signature standardization in the post quantum collective for a wide variety of applications. In this document I will be providing all necessary background to fully understand MPKC and post quantum cryptography as a whole. Then, I …


Application Of Symplectic Integration On A Dynamical System, William Frazier May 2017

Application Of Symplectic Integration On A Dynamical System, William Frazier

Electronic Theses and Dissertations

Molecular Dynamics (MD) is the numerical simulation of a large system of interacting molecules, and one of the key components of a MD simulation is the numerical estimation of the solutions to a system of nonlinear differential equations. Such systems are very sensitive to discretization and round-off error, and correspondingly, standard techniques such as Runge-Kutta methods can lead to poor results. However, MD systems are conservative, which means that we can use Hamiltonian mechanics and symplectic transformations (also known as canonical transformations) in analyzing and approximating solutions. This is standard in MD applications, leading to numerical techniques known as symplectic …


Takens Theorem With Singular Spectrum Analysis Applied To Noisy Time Series, Thomas K. Torku May 2016

Takens Theorem With Singular Spectrum Analysis Applied To Noisy Time Series, Thomas K. Torku

Electronic Theses and Dissertations

The evolution of big data has led to financial time series becoming increasingly complex, noisy, non-stationary and nonlinear. Takens theorem can be used to analyze and forecast nonlinear time series, but even small amounts of noise can hopelessly corrupt a Takens approach. In contrast, Singular Spectrum Analysis is an excellent tool for both forecasting and noise reduction. Fortunately, it is possible to combine the Takens approach with Singular Spectrum analysis (SSA), and in fact, estimation of key parameters in Takens theorem is performed with Singular Spectrum Analysis. In this thesis, we combine the denoising abilities of SSA with the Takens …


Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov Jan 2013

Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov

Electronic Theses and Dissertations

In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.