Open Access
2018 On a scalable nonparametric denoising of time series signals
Lukáš Pospíšil, Patrick Gagliardini, William Sawyer, Illia Horenko
Commun. Appl. Math. Comput. Sci. 13(1): 107-138 (2018). DOI: 10.2140/camcos.2018.13.107

Abstract

Denoising and filtering of time series signals is a problem emerging in many areas of computational science. Here we demonstrate how the nonparametric computational methodology of the finite element method of time series analysis with H 1 regularization can be extended for denoising of very long and noisy time series signals. The main computational bottleneck is the inner quadratic programming problem. Analyzing the solvability and utilizing the problem structure, we suggest an adapted version of the spectral projected gradient method (SPG-QP) to resolve the problem. This approach increases the granularity of parallelization, making the proposed methodology highly suitable for graphics processing unit (GPU) computing. We demonstrate the scalability of our open-source implementation based on PETSc for the Piz Daint supercomputer of the Swiss Supercomputing Centre (CSCS) by solving large-scale data denoising problems and comparing their computational scaling and performance to the performance of the standard denoising methods.

Citation

Download Citation

Lukáš Pospíšil. Patrick Gagliardini. William Sawyer. Illia Horenko. "On a scalable nonparametric denoising of time series signals." Commun. Appl. Math. Comput. Sci. 13 (1) 107 - 138, 2018. https://doi.org/10.2140/camcos.2018.13.107

Information

Received: 20 June 2017; Accepted: 30 October 2017; Published: 2018
First available in Project Euclid: 28 March 2018

zbMATH: 1385.37084
MathSciNet: MR3778322
Digital Object Identifier: 10.2140/camcos.2018.13.107

Subjects:
Primary: 37M10 , 62-07 , 62H30 , 65Y05 , 90C20

Keywords: quadratic programming , regularization , SPG-QP , time series analysis

Rights: Copyright © 2018 Mathematical Sciences Publishers

Vol.13 • No. 1 • 2018
MSP
Back to Top