Median filter method for mean curvature flow using a random Jacobi algorithm
<|reference_start|>Median filter method for mean curvature flow using a random Jacobi algorithm: We present an efficient scheme for level set mean curvature flow using a domain discretization and median filters. For this scheme, we show convergence in $L^\infty$-norm under mild assumptions on the number of points in the discretization. In addition, we strengthen the weak convergence result for the MBO thresholding scheme applied to data clustering of Lelmi and one of the authors. This is done through a strong convergence of the discretized heat flow in the optimal regime. Different boundary conditions are also discussed.<|reference_end|>
@article{ullrich2024median,
    title={Median filter method for mean curvature flow using a random Jacobi
  algorithm},
    author={Anton Ullrich, Tim Laux},
    journal={arXiv preprint arXiv:2410.07776},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.07776},
    primaryClass={math.AP cs.NA math.NA}
}