Error Analysis and Convergence of Capacity Dimension Algorithms

DOI10.1137/0150018MaRDI QIDQ3034554zbMATH OpenOpenAlexFDO

Authors Fern Y. Hunt

Publication date 1990

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0150018

zbMATH Keywords

box countingbox dimensioncapacity dimensionchaotic attractorsfractal dimensions

Mathematics Subject Classification ID

Ergodic theory (37A99) Topological dynamics (37B99) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Recommendations

• scientific article; zbMATH DE number 3858454
• scientific article; zbMATH DE number 4016032
• New error bounds and their applications to convergence analysis of iterative algorithms
• An approximation of the zero error capacity by a greedy algorithm
• Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
• Asymptotic error of algorithms for solving nonlinear problems
• scientific article; zbMATH DE number 4083384
• Publication:4945754
• scientific article; zbMATH DE number 4037617
• Theoretical error bounds and general analysis of a few Lanczos-type algorithms

Cited in

(9)

• A computation of the limit capacity of the Lorenz attractor
• Estimating dimension from small samples
• On the dimension of the boundary of clumps in a multi-type Boolean model
• Towards numerically estimating Hausdorff dimensions
• The intermittency and extended dimension induced by truncation error
• The statistical properties of dimension calculations using small data sets
• Empirical Testing Of The Infinite Source Poisson Data Traffic Model
• Normal dimension with accuracy and its convergence
• Convergence in capacity and applications

This page was built for publication: Error Analysis and Convergence of Capacity Dimension Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034554)