Response to comments on the applicability of the WARP algorithm and a formal prove of the complexity reduction it achieves. (January 2017)

• Record Type: Journal Article
• Authors: Portnoy, Ivan; Melendez, Kevin; Pinzon, Horacio; Sanjuan, Marco
• Is Part Of: Control engineering practice. Volume 58(2017)
• Page Start: 256
• Page End: 259
• Publication Date: 2017-01
• Subjects: WARP -- PCA -- False alarm -- Adaptive fault detection; Automatic control -- Periodicals; 629.89
• DOI: 10.1016/j.conengprac.2016.10.014
• Languages: English
• ISSNs: 0967-0661

Abstract

Abstract: The WARP algorithm (Weighted Adaptive Recursive PCA) is a novel recursive adaptation method (Portnoy et al., 2016) for PCA-based fault detection techniques with a reduced computational complexity suitable for online adaptation required when there is an increase in the false alarm rate in monitoring schemes due to the natural, slow and normal process changes related to model aging and other similar dynamic trends on process behavior. This paper offers a broader discussion on WARP implementation as an adaptive fault detection technique triggered by the outcome of a diagnosis stage and a more comprehensive analysis on the computational complexity reduction it achieves. Furthermore, a comparison on this criterion is made with two state-of-the-art recursive algorithms based on an operation breakdown analysis resulting on WARP exhibiting the best performance, that is the least FLOPs consumption for a complete operating condition update. Finally, clarifies the use of some symbols and provides more implementation details based on feedback received. Highlights: Broader discussion of WARP scope and implementation. A formal computational complexity analysis is carried out. WARP computational cost reduction is mainly reached in the eigenstructure update.