Algorithm 1 The calculation process of the VMD

Step 1: Initialize $\left\{u_k^1\right\}$、$\left\{{\mathsf{\omega }}_k^1\right\}$、${\mathsf{\lambda }}^1$ and n to zero;

Step 2: n = n + 1, execute the entire loop;

Step 3: Execute the loop k = k + 1 until k = K, update $u_k$: $u_k^{n+1}=\underset{u_k}{\arg \min L}\left(\left\{u_{i<k}^{n+1}\right\},\left\{u_{i\ge k}^n\right\},\left\{u_i^n\right\},{\mathsf{\lambda }}^n\right)$;

Step 4: Execute the loop k = k + 1, until k = K, update ${\mathsf{\omega }}_k$: ${\mathsf{\omega }}_k^{n+1}=\underset{{\mathsf{\omega }}_k}{\arg \min L}\left(\left\{{\mathsf{\omega }}_{i<k}^{n+1}\right\},\left\{{\mathsf{\omega }}_{i\ge k}^n\right\},\left\{{\mathsf{\omega }}_i^n\right\},{\mathsf{\lambda }}^n\right)$;

Step 5: Use ${\mathsf{\lambda }}^{n+1}={\mathsf{\lambda }}_n+\mathsf{\tau }\left(f(t)-{\displaystyle \sum _k{u}_k(t)}\right)$ to update λ;

Step 6: Given the discrimination condition ε > 0, if the iteration stop condition is satisfied, all the cycles are stopped and the result is output; K IMFs are obtained.