3 citations · 3 across the 6 of their papers we have counts for
6 papers
The Persistence Landscapes of Affine Fractals
Michael J. Catanzaro, Lee Przybylski, Eric S. Weber
We develop a method for calculating the persistence landscapes of affine fractals using the parameters of the corresponding transformations. Given an iterated function system of af…
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…
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…
Stability of the Kaczmarz Reconstruction for Stationary Sequences
Caleb Camrud, Evan Camrud, Lee Przybylski +1
The Kaczmarz algorithm is an iterative method to reconstruct an unknown vector from inner products . We consider the problem of how additive noise a…
A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
Chinmay Hegde, Fritz Keinert, Eric S. Weber
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a modified Kaczmarz algorithm for solving systems of linear equations in a distr…
The Dual Kaczmarz Algorithm
Anna Aboud, Emelie Curl, Steven N. Harding +2
The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector in a (separable) Hilbert space from the…