3 papers
math.NA2020
Accelerating the Distributed Kaczmarz Algorithm by Strong Over-relaxation
Riley Borgard, Steven N. Harding, Haley Duba +4
The distributed Kaczmarz algorithm is an adaptation of the standard Kaczmarz algorithm to the situation in which data is distributed throughout a network represented by a tree. We…
math.CA2019
Almost-nowhere intersection of Cantor sets, and sufficient sampling of their cumulative distribution functions
Allison Byars, Evan Camrud, Steven N. Harding +3
Cantor sets are constructed from iteratively removing sections of intervals. This process yields a cumulative distribution function (CDF), constructed from the invariant measure as…
math.FA2019
Moments of the weighted Cantor measures
Steven N. Harding, Alexander W. N. Riasanovsky
Based on the seminal work of Hutchinson, we investigate properties of {\em -weighted Cantor measures} whose support is a fractal contained in the unit interval. Here, is a v…