Loading [MathJax]/jax/element/mml/optable/BasicLatin.js
Sibirskii Zhurnal Vychislitel'noi Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Zh. Vychisl. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sibirskii Zhurnal Vychislitel'noi Matematiki, 2020, Volume 23, Number 2, Pages 127–142
DOI: https://doi.org/10.15372/SJNM20200200202
(Mi sjvm738)
 

This article is cited in 1 scientific paper (total in 1 paper)

The minimization problem for the sum of weighted convolution differences: the case of a given number of elements in the sum

A. V. Kel'manovab, L. V. Mikhailovaa, P. S. Ruzankinba, S. A. Khamidullina

a Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akad. Koptyuga 4, Novosibirsk, 630090 Russia
b Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090 Russia
Full-text PDF (761 kB) Citations (1)
References:
Abstract: We consider an unstudied optimization problem of summing the elements of the two numerical sequences: Y of length N and U of length qN. The objective of the optimization problem is to minimize the sum of differences of weighted convolutions of sequences of variable lengths (which are not less than q). In each of the differences, the first convolution is the unweighted autoconvolution of the sequence U nonlinearly expanded in time (by repetitions of its elements), and the second one is the weighted convolution of an expanded sequence with a subsequence of Y. The number of differences is given. We show that the problem is equivalent to that of approximation of the sequence Y by an element of some exponentially sized set of sequences. Such a set consists of all the sequences of length N which include, as subsequences, a given number M of admissible quasiperiodic (fluctuating) repetitions of the sequence U. Each quasiperiodic repetition is generated by the following admissible transformations of the sequence U: (1) shifting U in time, so that the differences between consecutive shifts do not exceed Tmax, (2) variable expansion of U in time consisting in repeating each element of U, with variable multiplicities of the repetitions. The optimization objective is minimizing the sum of the squares of element-wise differences. We demonstrate that the optimization problem in combination with the corresponding approximation problem are solvable in polynomial time. Specifically, we show that there exists an algorithm which solves the problems in the time \mathcal{O}(T^3_{\max}MN). If T_{\max} is a fixed parameter of the problem, then the algorithm running time is O(MN). In the examples of numerical modeling, we show the applicability of the algorithm to solving applied problems of noise-robust analyzing electrocardiogram-like and photoplethysmogram-like signals.
Key words: numerical sequences, difference of weighted convolutions, variable length convolution, minimum of sum, exact polynomial-time algorithm, numerical modeling, electrocardiogram-like signal, photoplethysmogram-like signal.
Funding agency Grant number
Russian Foundation for Basic Research 19-07-00397
19-01-00308
Ministry of Science and Higher Education of the Russian Federation 0314-2019-0015
Ministry of Education and Science of the Russian Federation
This work was supported by the Russian Foundation for Basic Research (project nos.В 19-07-00397 and 19-01-00308), by RAS Basic Research Program (project no.В 0314-2019-0015), and by “Top-5-100” Program of the Ministry of Education and Science of the Russian Federation.
Received: 12.08.2019
Revised: 20.10.2019
Accepted: 19.12.2019
English version:
Numerical Analysis and Applications, 2020, Volume 13, Issue 2, Pages 103–116
DOI: https://doi.org/10.1134/S1995423920020020
Bibliographic databases:
Document Type: Article
UDC: 519.16 + 519.25
Language: Russian
Citation: A. V. Kel'manov, L. V. Mikhailova, P. S. Ruzankin, S. A. Khamidullin, “The minimization problem for the sum of weighted convolution differences: the case of a given number of elements in the sum”, Sib. Zh. Vychisl. Mat., 23:2 (2020), 127–142; Num. Anal. Appl., 13:2 (2020), 103–116
Citation in format AMSBIB
\Bibitem{KelMikRuz20}
\by A.~V.~Kel'manov, L.~V.~Mikhailova, P.~S.~Ruzankin, S.~A.~Khamidullin
\paper The
minimization problem for the sum of weighted convolution differences: the case of a given
number of elements in the sum
\jour Sib. Zh. Vychisl. Mat.
\yr 2020
\vol 23
\issue 2
\pages 127--142
\mathnet{http://mi.mathnet.ru/sjvm738}
\crossref{https://doi.org/10.15372/SJNM20200200202}
\transl
\jour Num. Anal. Appl.
\yr 2020
\vol 13
\issue 2
\pages 103--116
\crossref{https://doi.org/10.1134/S1995423920020020}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000543438700002}
Linking options:
  • https://www.mathnet.ru/eng/sjvm738
  • https://www.mathnet.ru/eng/sjvm/v23/i2/p127
  • This publication is cited in the following 1 articles:
    1. Liudmila Mikhailova, Communications in Computer and Information Science, 1514, Advances in Optimization and Applications, 2021, 171  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Sibirskii Zhurnal Vychislitel'noi Matematiki
    Statistics & downloads:
    Abstract page:176
    Full-text PDF :66
    References:26
    First page:5
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025