Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/35573
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cuyt, Annie | en_UK |
dc.contributor.author | Lee, Wen-shin | en_UK |
dc.date.accessioned | 2023-11-21T01:07:25Z | - |
dc.date.available | 2023-11-21T01:07:25Z | - |
dc.date.issued | 2024 | en_UK |
dc.identifier.uri | http://hdl.handle.net/1893/35573 | - |
dc.description.abstract | The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the nonlinear parameters. The matrix pencil method, which reformulates the problem statement into a generalized eigenvalue problem for the nonlinear parameters and a structured linear system for the linear parameters, is generally considered as the more stable method to solve the problem computationally. In Section 2 the matrix pencil associated with the classical complex exponential fitting or sparse interpolation problem is summarized and the concepts of dilation and translation are introduced to obtain matrix pencils at different scales. Exponential analysis was earlier generalized to the use of several polynomial basis functions and some operator eigenfunctions. However, in most generalizations a computational scheme in terms of an eigenvalue problem is lacking. In the subsequent Sections 3–6 the matrix pencil formulation, including the dilation and translation paradigm, is generalized to more functions. Each of these periodic, polynomial or special function classes needs a tailored approach, where optimal use is made of the properties of the parameterized elementary or special function used in the sparse interpolation problem under consideration. With each generalization a structured linear matrix pencil is associated, immediately leading to a computational scheme for the nonlinear and linear parameters, respectively from a generalized eigenvalue problem and one or more structured linear systems. Finally, in Section 7 we illustrate the new methods. | en_UK |
dc.language.iso | en | en_UK |
dc.publisher | BMC | en_UK |
dc.relation | Cuyt A & Lee W (2024) Multiscale matrix pencils for separable reconstruction problems. <i>Numerical Algorithms</i>, 95, pp. 31-72. https://doi.org/10.1007/s11075-023-01564-3 | en_UK |
dc.rights | This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. | en_UK |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en_UK |
dc.subject | Prony problems | en_UK |
dc.subject | Separable problems | en_UK |
dc.subject | Parametric methods | en_UK |
dc.subject | Sparse interpolation | en_UK |
dc.subject | Dilation | en_UK |
dc.subject | Translation | en_UK |
dc.subject | Structured matrix | en_UK |
dc.subject | Generalized eigenvalue problem | en_UK |
dc.title | Multiscale matrix pencils for separable reconstruction problems | en_UK |
dc.type | Journal Article | en_UK |
dc.identifier.doi | 10.1007/s11075-023-01564-3 | en_UK |
dc.citation.jtitle | Numerical Algorithms | en_UK |
dc.citation.issn | 1572-9265 | en_UK |
dc.citation.issn | 1017-1398 | en_UK |
dc.citation.volume | 95 | en_UK |
dc.citation.spage | 31 | en_UK |
dc.citation.epage | 72 | en_UK |
dc.citation.publicationstatus | Published | en_UK |
dc.citation.peerreviewed | Refereed | en_UK |
dc.type.status | VoR - Version of Record | en_UK |
dc.contributor.funder | European Commission (Horizon 2020) | en_UK |
dc.contributor.funder | The Carnegie Trust | en_UK |
dc.author.email | wen-shin.lee@stir.ac.uk | en_UK |
dc.citation.date | 22/06/2023 | en_UK |
dc.contributor.affiliation | Computing Science and Mathematics - Division | en_UK |
dc.contributor.affiliation | Computing Science and Mathematics - Division | en_UK |
dc.identifier.isi | WOS:001019283800001 | en_UK |
dc.identifier.scopusid | 2-s2.0-85162710273 | en_UK |
dc.identifier.wtid | 1945747 | en_UK |
dc.contributor.orcid | 0000-0002-2808-3739 | en_UK |
dc.date.accepted | 2023-04-14 | en_UK |
dcterms.dateAccepted | 2023-04-14 | en_UK |
dc.date.filedepositdate | 2023-10-13 | en_UK |
dc.relation.funderproject | EXPOWER: EXPOnential Analysis EmPOWERing Innovation | en_UK |
dc.relation.funderproject | Advancing exponential analysis: high-resolution information from sparse and regularly sampled data | en_UK |
dc.relation.funderref | Grant Agreement-101008231 | en_UK |
dc.relation.funderref | RIG009853 | en_UK |
rioxxterms.apc | paid | en_UK |
rioxxterms.type | Journal Article/Review | en_UK |
rioxxterms.version | VoR | en_UK |
local.rioxx.author | Cuyt, Annie| | en_UK |
local.rioxx.author | Lee, Wen-shin|0000-0002-2808-3739 | en_UK |
local.rioxx.project | Grant Agreement-101008231|European Commission (Horizon 2020)| | en_UK |
local.rioxx.project | RIG009853|The Carnegie Trust| | en_UK |
local.rioxx.freetoreaddate | 2023-11-17 | en_UK |
local.rioxx.licence | http://creativecommons.org/licenses/by/4.0/|2023-11-17| | en_UK |
local.rioxx.filename | s11075-023-01564-3.pdf | en_UK |
local.rioxx.filecount | 1 | en_UK |
local.rioxx.source | 1572-9265 | en_UK |
Appears in Collections: | Computing Science and Mathematics Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
s11075-023-01564-3.pdf | Fulltext - Published Version | 720.33 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
A file in this item is licensed under a Creative Commons License
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.