This article is available for purchase or by subscription. See below.
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
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.
|
PDF Access Denied
We have not been able to recognize your IP address
44.192.115.114
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
time series analysis, quadratic programming, SPG-QP,
regularization
|
Mathematical Subject Classification 2010
Primary: 37M10, 62-07, 62H30, 65Y05, 90C20
|
Milestones
Received: 20 June 2017
Accepted: 30 October 2017
Published: 17 February 2018
|
|