A highly efficient algorithm for the generation of random fractal aggregates (Q979119)

From MaRDI portal
Revision as of 08:23, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A highly efficient algorithm for the generation of random fractal aggregates
scientific article

    Statements

    A highly efficient algorithm for the generation of random fractal aggregates (English)
    0 references
    0 references
    0 references
    25 June 2010
    0 references
    The technique of generation of random fractal aggregates (RFA) with pre-determined fractal dimension is reported and validated. The method is highly efficient, of \(O(N_{\text{total}})\), where \(N_{\text{total}}\) is the number of particles within the RFA, and is numerically simple to implement. Further, the algorithm poses no limit on the magnitude of the fractal dimension.
    0 references
    fractal
    0 references
    box-counting dimension
    0 references
    radius of gyration
    0 references

    Identifiers