Classification of possible finite-time singularities by functional renormalization

Revisiting the Predictability of the Haicheng and Tangshan Earthquakes

We analyze a set of precursory data measured before but compiled in retrospect of the MS7.5 Haicheng earthquake in February 1975 and the MS7.6–7.8 Tangshan earthquake in July 1976. We propose a robust and simple coarse-graining method that aggregates and counts how all the anomalies together (levelling, geomagnetism, soil resistivity, earth currents, gravity, earth stress, well water radon, well water level) develop as a function of time. We demonstrate strong evidence for the existence of an acceleration of the number of anomalies leading up to the major Haicheng and Tangshan earthquakes. In particular for the Tangshan earthquake, the frequency of occurrence of anomalies is found to be well described by the log-periodic power law singularity (LPPLS) model, previously proposed for the prediction of engineering failures and later adapted to the prediction of financial crashes. Using a mock real-time prediction experiment and simulation study, based on this methodology of monitoring accelerated rates of physical anomalies measured at the surface, we show the potential for an early warning system with a lead time of a few days.

Self-similar factor approximants

The problem of reconstructing functions from their asymptotic expansions in powers of a small variable is addressed by deriving an improved type of approximants. The derivation is based on the self-similar approximation theory, which presents the passage from one approximant to another as the motion realized by a dynamical system with the property of group self-similarity. The derived approximants, because of their form, are called self-similar factor approximants. These complement the obtained earlier self-similar exponential approximants and self-similar root approximants. The specific feature of self-similar factor approximants is that their control functions, providing convergence of the computational algorithm, are completely defined from the accuracy-through-order conditions. These approximants contain the Padé approximants as a particular case, and in some limit they can be reduced to the self-similar exponential approximants previously introduced by two of us. It is proved that the self-similar factor approximants are able to reproduce exactly a wide class of functions, which include a variety of nonalgebraic functions. For other functions, not pertaining to this exactly reproducible class, the factor approximants provide very accurate approximations, whose accuracy surpasses significantly that of the most accurate Padé approximants. This is illustrated by a number of examples showing the generality and accuracy of the factor approximants even when conventional techniques meet serious difficulties.