{'fraction_non_alphanumeric': 0.011347517730496455, 'fraction_numerical': 0.0, 'mean_word_length': 4.983050847457627, '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}}
Estimates of the rate of convergence of a dynamic reconstruction algorithm under incomplete information about the phase state

In this paper, we study a dynamic reconstruction algorithm which reconstructs the unknown unbounded input and all unobservable phase coordinates from the results of measurements of part of the coordinates. An upper and a lower bound for the accuracy of the reconstruction is obtained. We determine the class of inputs for which the upper bound is uniform. We give a condition for optimally matching the algorithm parameters, ensuring the highest order of the upper bound and equating the orders of the upper and lower bounds. Thus, we establish the sharpness of the upper bound.