The invention provides a mixed aggregation algebraic multi-grid solving method for a
time sequence linear system, and relates to the field of grid data, which comprises the following steps of: aiming at a first
linear system of a
time sequence, setting a hierarchical boundary parameter, constructing a coarse layer matrix through Galerkin projection, caching related topology and communication information, and constructing a second
linear system of the
time sequence; solving the first
system by combining multiple grids with a Krylov iteration method, and recording a reference convergence state; judging whether the
sparse structure of the matrix is consistent with the cache or not, if yes,
multiplexing the cache and only updating the numerical value, then judging whether the current convergence state reaches a degradation threshold or not, if not, re-executing the first construction process to update the cache and then solving, and outputting a complete solution sequence after all systems process. According to the
hybrid aggregation algebraic multi-grid solving method for the time sequence linear
system, the problem that convergence robustness and low construction overhead are difficult to consider when smooth aggregation and non-smooth aggregation are singly adopted is solved, and convergence robustness and low construction overhead can be considered.