{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T16:42:53Z","timestamp":1764002573742},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RTG 2088"],"award-info":[{"award-number":["RTG 2088"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RTG 2088"],"award-info":[{"award-number":["RTG 2088"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RTG 2088"],"award-info":[{"award-number":["RTG 2088"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk&lstrok;odowska-Curie Actions","doi-asserted-by":"publisher","award":["EXPOWER"],"award-info":[{"award-number":["EXPOWER"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we introduce two algorithms for stable approximation with and recovery of short cosine sums. The used signal model contains cosine terms with arbitrary real positive frequency parameters and therefore strongly generalizes usual Fourier sums. The proposed methods both employ a set of equidistant signal values as input data. The ESPRIT method for cosine sums is a Prony-like method and applies matrix pencils of Toeplitz + Hankel matrices while the ESPIRA method is based on rational approximation of DCT data and can be understood as a matrix pencil method for special Loewner matrices. Compared to known numerical methods for recovery of exponential sums, the design of the considered new algorithms directly exploits the special real structure of the signal model and therefore usually provides real parameter estimates for noisy input data, while the known general recovery algorithms for complex exponential sums tend to yield complex parameters in this case.<\/jats:p>","DOI":"10.1007\/s11075-022-01432-6","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T04:27:24Z","timestamp":1669609644000},"page":"437-470","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application"],"prefix":"10.1007","volume":"92","author":[{"given":"Nadiia","family":"Derevianko","sequence":"first","affiliation":[]},{"given":"Gerlind","family":"Plonka","sequence":"additional","affiliation":[]},{"given":"Raha","family":"Razavi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"issue":"5","key":"1432_CR1","first-page":"open access","volume":"3","author":"R Beinert","year":"2017","unstructured":"Beinert, R., Plonka, G.: Sparse phase retrieval of one-dimensional signals by Prony\u2019s method. Front. Appl. Math. Stat. 3(5), open access (2017)","journal-title":"Front. Appl. Math. Stat."},{"key":"1432_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.acha.2005.01.003","volume":"19","author":"G Beylkin","year":"2005","unstructured":"Beylkin, G., Monz\u00f3n, L.: On approximation of functions by exponential sums. Appl. Comput. Harmon. Anal. 19, 17\u201348 (2005)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1432_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.acha.2009.04.003","volume":"27","author":"G Beylkin","year":"2009","unstructured":"Beylkin, G., Monz\u00f3n, L.: Nonlinear inversion of a band-limited Fourier transform. Appl. Comput Harmon. Anal. 27, 351\u2013366 (2009)","journal-title":"Appl. Comput Harmon. Anal."},{"key":"1432_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jcp.2013.03.022","volume":"246","author":"JP Boyd","year":"2013","unstructured":"Boyd, J.P.: A comparison of companion matrix methods to find roots of a trigonometric polynomial. J. Comput. Physics 246, 96\u2013112 (2013)","journal-title":"J. Comput. Physics"},{"key":"1432_CR5","unstructured":"Brezinski, C., Redivo-Zaglia, M.: Extrapolation Methods: Theory and Practice. North-Holland, Amsterdam (1991)"},{"key":"1432_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0377-0427(95)00157-3","volume":"66","author":"C Brezinski","year":"1996","unstructured":"Brezinski, C., Matos, A.C.: A derivation of extrapolation algorithms based on error estimates. J. Comput. Appl Math. 66, 5\u201326 (1996)","journal-title":"J. Comput. Appl Math."},{"key":"1432_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.cam.2014.07.007","volume":"284","author":"C Brezinski","year":"2015","unstructured":"Brezinski, C., Redivo-Zaglia, M.: New representations of pad\u00e9, Pad\u00e9-type, and partial Pad\u00e9 approximants. J. Comput. Appl. Math. 284, 69\u201377 (2015)","journal-title":"J. Comput. Appl. Math."},{"key":"1432_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1134\/S0965542520010078","volume":"60","author":"A Cuyt","year":"2020","unstructured":"Cuyt, A., Lee, W.-s., Wu, M.: High accuracy trigonometric approximations of the real Bessel functions of the first kind. Comput. Math. and Math. Phys. 60, 119\u2013127 (2020)","journal-title":"Comput. Math. and Math. Phys."},{"key":"1432_CR9","unstructured":"Cuyt, A., Lee, W.-s.: Parametric spectral analysis: scale and shift. preprint 2020, arXiv:2008.02125v2"},{"issue":"03","key":"1432_CR10","first-page":"543","volume":"20","author":"N Derevianko","year":"2022","unstructured":"Derevianko, N., Plonka, G.: Exact reconstruction of extended exponential sums using rational approximation of their Fourier coefficients. Analysis Appl. 20(03), 543\u2013577 (2022)","journal-title":"Analysis Appl."},{"key":"1432_CR11","doi-asserted-by":"publisher","unstructured":"Derevianko, N., Plonka, G., Petz, M.: From ESPRIT to ESPIRA: Estimation of signal parameters by iterative rational approximation. IMA J. Numer. Anal., online first, https:\/\/doi.org\/10.1093\/imanum\/drab108https:\/\/doi.org\/10.1093\/imanum\/drab108","DOI":"10.1093\/imanum\/drab108 10.1093\/imanum\/drab108"},{"key":"1432_CR12","unstructured":"Driscoll, T.A., Hale, N., Trefethen, L.N. (eds.): Chebfun user\u2019s guide. Pafnuty Publications, Oxford (2014). see also www.chebfun.org"},{"key":"1432_CR13","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/29.56027","volume":"38","author":"Y Hua","year":"1990","unstructured":"Hua, Y., Sarkar, T.K.: Matrix pencil method for estimating parameters of exponentially damped\/undamped sinusoids in noise. IEEE Trans Acoust. Speech Signal Process. 38, 814\u2013824 (1990)","journal-title":"IEEE Trans Acoust. Speech Signal Process."},{"key":"1432_CR14","doi-asserted-by":"crossref","unstructured":"Izat, J.A., Choma, M.A.: Theory of optical coherence tomography. In: Drexler, W., Fujimoto, J. G. (eds.) Optical Coherence Tomography. Biomedical and Medical Physics, Biomedical Engineering, pp 47\u201372. Springer (2008)","DOI":"10.1007\/978-3-540-77550-8_2"},{"key":"1432_CR15","doi-asserted-by":"crossref","unstructured":"Keller, I., Plonka, G.: Modifications of Prony\u2019s method for the recovery and sparse approximation of generalized exponential sums. In: Fasshauer, G.E., Neamtu, M., Schumaker, L. (eds.) Approximation Theory XVI. AT 2019, pp 123\u2013152. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-57464-2_7"},{"key":"1432_CR16","unstructured":"Klein, G.: Applications of Linear Barycentric Rational Interpolation. PhD thesis Fribourg, Switzerland (2012)"},{"issue":"2","key":"1432_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/S0097539792237784","volume":"24","author":"YN Lakshman","year":"1995","unstructured":"Lakshman, Y. N., Saunders, B.D.: Sparse polynomial interpolation in nonstandard bases. SIAM J. Comput. 24(2), 387\u2013397 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1432_CR18","doi-asserted-by":"publisher","first-page":"A1494","DOI":"10.1137\/16M1106122","volume":"40","author":"Y Nakatsukasa","year":"2018","unstructured":"Nakatsukasa, Y., Sete, O., Trefethen, L.N.: The AAA algorithm for rational approximation. SIAM J. Sci. Comput. 40(3), A1494\u2013A1522 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1432_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0916008","volume":"16","author":"MR Osborne","year":"1995","unstructured":"Osborne, M. R., Smyth, G.K.: A modified Prony algorithm for exponential function fitting. SIAM J. Sci Comput. 16(1), 119\u2013138 (1995)","journal-title":"SIAM J. Sci Comput."},{"key":"1432_CR20","doi-asserted-by":"crossref","unstructured":"Pereyra, V., Scherer, G.: Exponential data fitting. In: Exponential Data Fitting and Its Applications, pp. 1\u201326. Bentham Sci. Publ (2010)","DOI":"10.2174\/978160805048211001010001"},{"key":"1432_CR21","doi-asserted-by":"publisher","unstructured":"Petz, M., Plonka, G., Derevianko, N.: Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients. Sampl. Theory Signal Process. Data Anal. 19(7). https:\/\/doi.org\/10.1007\/s43670-021-00007-1https:\/\/doi.org\/10.1007\/s43670-021-00007-1, open access (2021)","DOI":"10.1007\/s43670-021-00007-1 10.1007\/s43670-021-00007-1"},{"issue":"4","key":"1432_CR22","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1007\/s00041-018-9635-1","volume":"25","author":"G Plonka","year":"2019","unstructured":"Plonka, G., Pototskaia, V.: Computation of adaptive Fourier series by sparse approximation of exponential sums. J Fourier Anal. Appl. 25(4), 1580\u20131608 (2019)","journal-title":"J Fourier Anal. Appl."},{"key":"1432_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04306-3","volume-title":"Numerical Fourier Analysis","author":"G Plonka","year":"2018","unstructured":"Plonka, G., Potts, D., Steidl, G., Tasche, M.: Numerical Fourier Analysis. Basel, Birkh\u00e4user (2018)"},{"issue":"2","key":"1432_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1142\/S0219530518500240","volume":"17","author":"G Plonka","year":"2019","unstructured":"Plonka, G., Stampfer, K., Keller, I.: Reconstruction of stationary and non- stationary signals by the generalized Prony method. Anal. Appl. 17(2), 179\u2013210 (2019)","journal-title":"Anal. Appl."},{"key":"1432_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.laa.2004.07.015","volume":"394","author":"G Plonka","year":"2005","unstructured":"Plonka, G., Tasche, M.: Fast and numerically stable algorithms for discrete cosine transforms. Linear Algebra Appl. 394, 309\u2013345 (2005)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1432_CR26","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/gamm.201410011","volume":"37","author":"G Plonka","year":"2014","unstructured":"Plonka, G., Tasche, M.: Prony methods for recovery of structured functions. GAMM Mitt. 37(2), 239\u2013258 (2014)","journal-title":"GAMM Mitt."},{"issue":"4","key":"1432_CR27","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1016\/j.laa.2012.10.036","volume":"439","author":"D Potts","year":"2013","unstructured":"Potts, D., Tasche, M.: Parameter estimation for nonincreasing exponential sums by Prony-like methods. Linear Algebra Appl. 439(4), 1024\u20131039 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1432_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.laa.2013.02.006","volume":"441","author":"D Potts","year":"2014","unstructured":"Potts, D., Tasche, M.: Sparse polynomial interpolation in Chebyshev bases. Linear Algebra Appl. 441, 61\u201387 (2014)","journal-title":"Linear Algebra Appl."},{"key":"1432_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.apnum.2014.10.003","volume":"88","author":"D Potts","year":"2015","unstructured":"Potts, D., Tasche, M.: Fast ESPRIT algorithms based on partial singular value decompositions. Appl. Numer Math. 88, 31\u201345 (2015)","journal-title":"Appl. Numer Math."},{"key":"1432_CR30","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/29.32276","volume":"37","author":"R Roy","year":"1989","unstructured":"Roy, R., Kailath, T.: ESPRIT estimation of signal parameters via rotational invariance techniques. IEEE Trans Acoust. Speech Signal Process. 37, 984\u2013995 (1989)","journal-title":"IEEE Trans Acoust. Speech Signal Process."},{"key":"1432_CR31","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00365-020-09501-6","volume":"52","author":"K Stampfer","year":"2020","unstructured":"Stampfer, K., Plonka, G.: The generalized operator-based Prony method. Constr. Approx. 52, 247\u2013282 (2020)","journal-title":"Constr. Approx."},{"issue":"6","key":"1432_CR32","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1109\/TSP.2002.1003065","volume":"50","author":"M Vetterli","year":"2002","unstructured":"Vetterli, M., Marziliano, P., Blu, T.: Sampling signals with finite rate of innovation. IEEE Trans. Signal Process. 50(6), 1417\u20131428 (2002)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1432_CR33","doi-asserted-by":"publisher","first-page":"C185","DOI":"10.1137\/21M1420277","volume":"44","author":"H Wilber","year":"2022","unstructured":"Wilber, H., Damle, A., Townsend, A.: Data-driven algorithms for signal processing with trigonometric rational functions. SIAM J. Sci. Comput. 44(3), C185\u2013C209 (2022)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"1432_CR34","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1007\/s10444-019-09692-y","volume":"45","author":"R Zhang","year":"2019","unstructured":"Zhang, R., Plonka, G.: Optimal approximation with exponential sums by a maximum likelihood modification of Prony\u2019s method. Adv. Comput. Math. 45(3), 1657\u20131687 (2019)","journal-title":"Adv. Comput. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01432-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01432-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01432-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T08:31:27Z","timestamp":1673253087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01432-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1432"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01432-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,28]]},"assertion":[{"value":"8 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}