{'fraction_non_alphanumeric': 0.015194681861348529, 'fraction_numerical': 0.0, 'mean_word_length': 5.349397590361446, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
AGGREGATION METHOD FOR SOLVING LARGEDIMENSIONAL DYNAMIC PROBLEMS IN SYSTEM ANALYSIS

Software development, which includes models of complex systems, implies the emergence of tasks with a large number of desired quantities and relationships between quantities. The solution of dynamic problems of large dimension is always complicated by the limited RAM of an electronic computing device or too much time spent on finding a solution. Therefore, for dynamic problems of large dimension, solution methods are always used to simplify this process. In some situations, dividing the initial task into several tasks of smaller dimensions is sufficient, but this is not always possible. Then the solution may be approximate, but the question of the accuracy of such a solution remains open. Today there are many algorithms that help to lower the dimension in a multidimensional dynamic problem using differential equations. Dynamic tasks of large dimension are specific, so there are many approaches, but the most convenient and affordable today is aggregation.