TY - GEN
T1 - Accelerated algorithm for BTT identification parameter with GMC sparse regularization
AU - Zhu, Yuda
AU - Qiao, Baijie
AU - Wang, Yanan
AU - Pan, Bo
AU - Chen, Lin
AU - Chen, Xuefeng
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Accurate identification of vibration parameters from blade tip timing (BTT) undersampled signals is essential for rotating blade vibration monitoring. However, the traditional parameter identification method of BTT signal depends on the prior. The existing sparse regularization method underestimates the reconstructed signal amplitude and has low computational efficiency. This paper resorts to an accelerated algorithm for BTT identification parameters based on generalized minimax-concave (GMC) sparse regularization to accurately and quickly identify amplitude and frequency parameters from undersampled signals. For amplitude underestimation, the non-convex GMC penalty is introduced so that the sparsity of the estimation is improved, and the convexity of the cost function is preserved. Moreover, Nesterov's accelerated iterative computation strategy is resorted to rapidly improving the convergence performance of obtaining the global optimum. The simulation results show that by reconstructing the BTT signal, the presented parameter identification algorithm based on accelerated generalized minimax-concave (AGMC) improves the computational rate with the inherited merits of accuracy.
AB - Accurate identification of vibration parameters from blade tip timing (BTT) undersampled signals is essential for rotating blade vibration monitoring. However, the traditional parameter identification method of BTT signal depends on the prior. The existing sparse regularization method underestimates the reconstructed signal amplitude and has low computational efficiency. This paper resorts to an accelerated algorithm for BTT identification parameters based on generalized minimax-concave (GMC) sparse regularization to accurately and quickly identify amplitude and frequency parameters from undersampled signals. For amplitude underestimation, the non-convex GMC penalty is introduced so that the sparsity of the estimation is improved, and the convexity of the cost function is preserved. Moreover, Nesterov's accelerated iterative computation strategy is resorted to rapidly improving the convergence performance of obtaining the global optimum. The simulation results show that by reconstructing the BTT signal, the presented parameter identification algorithm based on accelerated generalized minimax-concave (AGMC) improves the computational rate with the inherited merits of accuracy.
KW - accelerated generalized minimax-concave
KW - blade tip timing
KW - parameter identification
KW - undersampled signals
UR - https://www.scopus.com/pages/publications/85150429140
U2 - 10.1109/ICSMD57530.2022.10058283
DO - 10.1109/ICSMD57530.2022.10058283
M3 - 会议稿件
AN - SCOPUS:85150429140
T3 - 2022 International Conference on Sensing, Measurement and Data Analytics in the Era of Artificial Intelligence, ICSMD 2022 - Proceedings
BT - 2022 International Conference on Sensing, Measurement and Data Analytics in the Era of Artificial Intelligence, ICSMD 2022 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd International Conference on Sensing, Measurement and Data Analytics in the Era of Artificial Intelligence, ICSMD 2022
Y2 - 22 December 2022 through 24 December 2022
ER -