Hidden Positivity and a New Approach to Numerical Computation of Hausdorff Dimension: Higher Order Methods
Richard S. Falk, Roger D. Nussbaum

TL;DR
This paper introduces a high-order numerical method for accurately computing the Hausdorff dimension of invariant sets of iterated function systems, extending previous approaches with improved convergence and precision.
Contribution
The authors develop a new high-order collocation approach using Chebyshev points and polynomial approximation to compute Hausdorff dimensions with rigorous bounds.
Findings
Rapid convergence of bounds with mesh refinement
Effective high-order approximation of eigenfunctions
Improved accuracy over previous methods
Abstract
In [14], the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In this paper, we extend this approach to incorporate high order approximation methods. We again rely on the fact that we can associate to the IFS a parametrized family of positive, linear, Perron-Frobenius operators , an idea known in varying degrees of generality for many years. Although is not compact in the setting we consider, it possesses a strictly positive eigenfunction with eigenvalue for arbitrary and all other points in the spectrum of satisfy for some constant . Under appropriate assumptions on the IFS, the Hausdorff dimension of the invariant set of the IFS is the value for which . This eigenvalue problem is then approximated by a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Advanced Numerical Analysis Techniques
