Robust and Fast Algorithms for Singular Spectral Analysis of Seismic Data

  • R. K. Tiwari
  • R. Rekapalli


As discussed and demonstrated in the previous chapters, researchers have vigorously exploited the proficiency of the SSA based methods for time series analysis. Although the SSA method is well proven for variety of applications in signal analysis, its applicability for handling large data is hampered due to the huge computational time and memory requirements for the singular value decomposition (SVD) of Hankel matrix (Trajectory matrix). The SVD scheme is the main computational process of SSA and for an n × m matrix, it requires O (nm2) floating point operations (Rokhlin et al. 2009). As the length of the data record increases, the size of the trajectory matrix and therefore time and memory required for SVD computation increases rapidly. Consequently, this limits the applicability of SSA based methods. Recently some researchers (Xu and Qiao 2008; Mahmoudvand and Zokaei 2012) have devised methods to reduce the floating point operations (FLOPS) in SVD computation of square Hankel matrix to reduce the computational cost (compared to classical O(n3) method). Further, Oropeza and Sacchi (2011), Tiwari and Rajesh (2014) and Rajesh and Tiwari (2015) have discussed fast and robust algorithms to reduce the computation cost involved in SVD of Hankel matrices to use in singular spectrum based seismic data processing methods. These methods are discussed in the following sections.


  1. Allen, M.R. and Smith, L.A. (1997). Optimal filtering in singular spectrum analysis. Physics Letters A, 234(6), 419–428.ADSCrossRefGoogle Scholar
  2. Golyandina, N. and Zhigljavsky, A. (2013). Basic SSA. In: Singular Spectrum Analysis for Time Series. Springer, Berlin, Heidelberg.Google Scholar
  3. Halko, N., Martinsson, P.G. and Tropp, J.A. (2009). Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions.Google Scholar
  4. Liberty, E., Woolfe, F., Martinsson, P.G., Rokhlin, V. and Tygert, M. (2007). Randomized algorithms for the low-rank approximation of matrices. Proceedings of the National Academy of Sciences, 104(51), 20167–20172.Google Scholar
  5. Mahmoudvand, R. and Zokaei, M. (2012). On the singular values of the Hankel matrix with application in singular spectrum analysis. Chilean Journal of Statistics, 3(1), 43–56.MathSciNetzbMATHGoogle Scholar
  6. Oropeza, V. and Sacchi, M. (2011). Simultaneous seismic data denoising and reconstruction via multichannel singular spectrum analysis. Geophysics, 76(3), V25–V32.ADSCrossRefGoogle Scholar
  7. Rajesh, R. and Tiwari, R.K. (2015). Windowed SSA (Singular Spectral Analysis) for Geophysical Time Series Analysis. Journal of Geological Resource and Engineering, 3, 167–173.Google Scholar
  8. Rekapalli, R., Tiwari, R.K., Dhanam, K. and Seshunarayana, T. (2014). T-x frequency filtering of high-resolution seismic reflection data using singular spectral analysis. Journal of Applied Geophysics, 105, 180–184. Scholar
  9. Rokhlin, V., Szlam, A. and Tygert, M. (2009). A randomized algorithm for principal component analysis. SIAM Journal on Matrix Analysis and Applications, 31(3), 1100–1124.MathSciNetCrossRefGoogle Scholar
  10. Tiwari, R.K. and Rajesh, R. (2014). Factorized Hankel optimal singular spectral approach for erratic and noisy seismic signal denoising. Journal of Applied Geophysics, 111, 95–101.ADSCrossRefGoogle Scholar
  11. Vautard, R., Yiou, P. and Ghil, M. (1992). Singular-spectrum analysis: A toolkit for short, noisy, chaotic signals. Physica D. Nonlinear Phenomena, 58(1–4), 95–126. Scholar
  12. Xu, W. and Qiao, S. (2008). A fast symmetric SVD algorithm for square Hankel matrices. Linear Algebra and its Applications, 428(2), 550–563.MathSciNetCrossRefGoogle Scholar

Copyright information

© Capital Publishing Company 2020

Authors and Affiliations

  • R. K. Tiwari
    • 1
  • R. Rekapalli
    • 1
  1. 1.CSIR-NGRIHyderabadIndia

Personalised recommendations