The aim of this review is to discuss some applications of orthogonal polynomials in quantum information processing. The hope is to keep the paper self-contained so that someone wanting a brief introduction to the theory of orthogonal polynomials and continuous time quantum walks on graphs may find it in one place. In particular, we focus on the associated Jacobi operators and discuss how these can be used to detect perfect state transfer (PST). We also discuss how orthogonal polynomials have been used to give results which are analogous to those given by Karlin and McGregor when studying classical birth and death processes. Finally, we show how these ideas have been extended to quantum walks with more than nearest-neighbour interactions using exceptional orthogonal polynomials (XOPs). We also provide a (non-exhaustive) list of related open questions.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
{"title":"Orthogonal polynomials and perfect state transfer.","authors":"Rachel Bailey","doi":"10.1098/rsta.2024.0414","DOIUrl":"https://doi.org/10.1098/rsta.2024.0414","url":null,"abstract":"<p><p>The aim of this review is to discuss some applications of orthogonal polynomials in quantum information processing. The hope is to keep the paper self-contained so that someone wanting a brief introduction to the theory of orthogonal polynomials and continuous time quantum walks on graphs may find it in one place. In particular, we focus on the associated Jacobi operators and discuss how these can be used to detect perfect state transfer (PST). We also discuss how orthogonal polynomials have been used to give results which are analogous to those given by Karlin and McGregor when studying classical birth and death processes. Finally, we show how these ideas have been extended to quantum walks with more than nearest-neighbour interactions using exceptional orthogonal polynomials (XOPs). We also provide a (non-exhaustive) list of related open questions.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2306","pages":"20240414"},"PeriodicalIF":3.7,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145252100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Antonio Acuaviva, Ada Chan, Summer Eldridge, Chris Godsil, Matthew How-Chun-Lun, Christino Tamon, Emily Wright, Xiaohong Zhang
The chiral quantum walk is an emerging tool for state transfer as it helps circumvent the barrier of no-go theorems in quantum transport. Yet, it remains largely unexplored. We prove a conjecture that universal monogamy violations for perfect quantum transfer in large graphs require couplings beyond the simple imaginary [Formula: see text]. This motivates our constructions of new monogamy violations on sparse graph products. Then, we show a novel violation of periodicity and the first known examples of one-way perfect quantum transfer via transcendental couplings.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
{"title":"State transfer in chiral quantum walks.","authors":"Antonio Acuaviva, Ada Chan, Summer Eldridge, Chris Godsil, Matthew How-Chun-Lun, Christino Tamon, Emily Wright, Xiaohong Zhang","doi":"10.1098/rsta.2024.0420","DOIUrl":"https://doi.org/10.1098/rsta.2024.0420","url":null,"abstract":"<p><p>The chiral quantum walk is an emerging tool for state transfer as it helps circumvent the barrier of no-go theorems in quantum transport. Yet, it remains largely unexplored. We prove a conjecture that universal monogamy violations for perfect quantum transfer in large graphs require couplings beyond the simple imaginary [Formula: see text]. This motivates our constructions of new monogamy violations on sparse graph products. Then, we show a novel violation of periodicity and the first known examples of one-way perfect quantum transfer via transcendental couplings.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2306","pages":"20240420"},"PeriodicalIF":3.7,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145252123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recent progress in quantum computing shows the need to incorporate many branches of mathematics (graph theory, matrix theory, optimization, theory of orthogonal polynomials and more) into physics, computer science and chemistry. At the 2024 SIAM Quantum Intersections Convening, Bert de Jong (Lawrence Berkeley National Laboratory) gave a talk entitled 'Quantum Science Needs Mathematicians' (Report of the SIAM Quantum Intersections Convening. Integrating Mathematical Scientists into Quantum Research, 7-9 October 2024, Tysons, Virginia (doi:10.11337/25M1741017)), since despite the growing demand for research in these domains, the mathematical sciences community has remained largely disengaged from quantum research, with only a few isolated areas of active involvement. This issue brings together researchers from different areas of mathematics to show the relation between spectral graph theory, the theory of orthogonal polynomials and numerical analysis. This interconnectedness highlights the versatility and importance of these areas of mathematics in the context of quantum computing.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
量子计算的最新进展表明,需要将数学的许多分支(图论、矩阵论、优化、正交多项式理论等)纳入物理学、计算机科学和化学。在2024年SIAM量子交叉点会议上,Bert de Jong(劳伦斯伯克利国家实验室)做了题为“量子科学需要数学家”的演讲(SIAM量子交叉点会议报告)。将数学科学家整合到量子研究中,2024年10月7-9日,弗吉尼亚州泰森斯(doi:10.11337/25M1741017)),因为尽管这些领域的研究需求不断增长,但数学科学界仍然基本上脱离量子研究,只有少数孤立的领域积极参与。本期杂志汇集了来自不同数学领域的研究人员,展示了谱图理论、正交多项式理论和数值分析之间的关系。这种相互联系突出了这些数学领域在量子计算背景下的多功能性和重要性。本文是专题“数值分析、谱图理论、正交多项式和量子算法”的一部分。
{"title":"Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms.","authors":"Anastasiia Minenkova, Gamal Mograby, Hanmeng Zhan","doi":"10.1098/rsta.2024.0426","DOIUrl":"10.1098/rsta.2024.0426","url":null,"abstract":"<p><p>Recent progress in quantum computing shows the need to incorporate many branches of mathematics (graph theory, matrix theory, optimization, theory of orthogonal polynomials and more) into physics, computer science and chemistry. At the 2024 SIAM Quantum Intersections Convening, Bert de Jong (Lawrence Berkeley National Laboratory) gave a talk entitled 'Quantum Science Needs Mathematicians' (Report of the SIAM Quantum Intersections Convening. Integrating Mathematical Scientists into Quantum Research, 7-9 October 2024, Tysons, Virginia (doi:10.11337/25M1741017)), since despite the growing demand for research in these domains, the mathematical sciences community has remained largely disengaged from quantum research, with only a few isolated areas of active involvement. This issue brings together researchers from different areas of mathematics to show the relation between spectral graph theory, the theory of orthogonal polynomials and numerical analysis. This interconnectedness highlights the versatility and importance of these areas of mathematics in the context of quantum computing.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2306","pages":"20240426"},"PeriodicalIF":3.7,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12508770/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145252120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jay Karlsen, Dain G Farrimond, Tommy J Lodge, Samuel E Rigby, Andrew Tyas, Sam D Clarke, Timothy R Brewer
This paper details the development of a rapid inverse approach to determine the yield and location of an explosion through trilateration of empirical laws for blast wave arrival time. A rigorous sensitivity analysis of measurement uncertainty is first performed. From this, a probabilistic framework is proposed that utilizes Monte Carlo sampling of datasets to mitigate the effects of the variability and uncertainties typically present in blast events. Subsequently, the trilateration method is successfully applied to two existing datasets. Analysing well-controlled small-scale laboratory experiments, charge mass is predicted within 6.3% of the true yield, and position within 3.65 charge radii of the true centre. Social media footage of the 2020 Beirut explosion is then used to assess performance against data collected under in-field conditions. The predicted yield of 0.52 kt[Formula: see text] shows good agreement with the literature, and charge position is predicted to within the radius of the crater. Trilateration is shown to be able to rapidly and reliably determine explosive yield and centre, despite large levels of sensor noise. The sub-second computation time of this approach offers the possibility to better model and predict the damage and injury patterns immediately after an explosion, facilitating more effective disaster response planning.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.
{"title":"Trilateration of blast wave arrival time: an inverse method for determining explosive yield and position.","authors":"Jay Karlsen, Dain G Farrimond, Tommy J Lodge, Samuel E Rigby, Andrew Tyas, Sam D Clarke, Timothy R Brewer","doi":"10.1098/rsta.2024.0040","DOIUrl":"10.1098/rsta.2024.0040","url":null,"abstract":"<p><p>This paper details the development of a rapid inverse approach to determine the yield and location of an explosion through trilateration of empirical laws for blast wave arrival time. A rigorous sensitivity analysis of measurement uncertainty is first performed. From this, a probabilistic framework is proposed that utilizes Monte Carlo sampling of datasets to mitigate the effects of the variability and uncertainties typically present in blast events. Subsequently, the trilateration method is successfully applied to two existing datasets. Analysing well-controlled small-scale laboratory experiments, charge mass is predicted within 6.3% of the true yield, and position within 3.65 charge radii of the true centre. Social media footage of the 2020 Beirut explosion is then used to assess performance against data collected under in-field conditions. The predicted yield of 0.52 kt<sub>[Formula: see text]</sub> shows good agreement with the literature, and charge position is predicted to within the radius of the crater. Trilateration is shown to be able to rapidly and reliably determine explosive yield and centre, despite large levels of sensor noise. The sub-second computation time of this approach offers the possibility to better model and predict the damage and injury patterns immediately after an explosion, facilitating more effective disaster response planning.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2305","pages":"20240040"},"PeriodicalIF":3.7,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12461223/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145138325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we leverage the structured foundation of deep image prior to delve into the complexities of positron emission tomography (PET) image reconstruction. We aim to underscore the potential of deep learning in overcoming inherent challenges associated with PET imaging. Acknowledging the limitations of conventional supervised learning in this domain, we propose an innovative unsupervised approach employing deep neural networks to enhance PET reconstruction. A central focus of our study revolves around the spectral bias issue that arises during PET image reconstruction. To tackle this challenge, we introduce a comprehensive framework that incorporates Gaussian Fourier features and Uniform Positional encoding. Our approaches undergo rigorous testing on both Brainweb data and naive rat data, revealing a noticeable improvement in image reconstruction performance. This underscores the efficacy of our framework in advancing PET imaging methodologies.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.
{"title":"Boosting positron emission tomography reconstruction with positional encoding-based deep image prior.","authors":"Saima Ashraf, Qianxue Shan, Wuqing Ning, Dong Liu","doi":"10.1098/rsta.2024.0049","DOIUrl":"https://doi.org/10.1098/rsta.2024.0049","url":null,"abstract":"<p><p>In this paper, we leverage the structured foundation of deep image prior to delve into the complexities of positron emission tomography (PET) image reconstruction. We aim to underscore the potential of deep learning in overcoming inherent challenges associated with PET imaging. Acknowledging the limitations of conventional supervised learning in this domain, we propose an innovative unsupervised approach employing deep neural networks to enhance PET reconstruction. A central focus of our study revolves around the spectral bias issue that arises during PET image reconstruction. To tackle this challenge, we introduce a comprehensive framework that incorporates Gaussian Fourier features and Uniform Positional encoding. Our approaches undergo rigorous testing on both Brainweb data and naive rat data, revealing a noticeable improvement in image reconstruction performance. This underscores the efficacy of our framework in advancing PET imaging methodologies.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2305","pages":"20240049"},"PeriodicalIF":3.7,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145138216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Microtexture regions (MTRs) are collections of grains with similar crystallographic orientation. When present in aerospace components, they can potentially limit component life. As such, a non-destructive evaluation (NDE) method to detect and characterize MTR is desired. One potential solution is to use an electromagnetic NDE method known as eddy current testing (ECT), which is sensitive to local conductivity variations associated with MTR. Recent work has shown that MTR boundaries and orientation can be determined from ECT data using a variant of matching component analysis (MCA) combined with a regularization method originally developed for image deblurring. However, this method has only been demonstrated on simulated ECT data. In this work, we apply the previously developed method to experimental ECT data of a large grain titanium specimen. We show that we are able to determine grain boundaries and orientation from experimental ECT data, serving as a first step to full MTR characterization.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.
{"title":"Segmentation of experimental eddy current testing data via matching component analysis.","authors":"Laura Homa, Matthew Cherry, John Wertz","doi":"10.1098/rsta.2024.0048","DOIUrl":"https://doi.org/10.1098/rsta.2024.0048","url":null,"abstract":"<p><p>Microtexture regions (MTRs) are collections of grains with similar crystallographic orientation. When present in aerospace components, they can potentially limit component life. As such, a non-destructive evaluation (NDE) method to detect and characterize MTR is desired. One potential solution is to use an electromagnetic NDE method known as eddy current testing (ECT), which is sensitive to local conductivity variations associated with MTR. Recent work has shown that MTR boundaries and orientation can be determined from ECT data using a variant of matching component analysis (MCA) combined with a regularization method originally developed for image deblurring. However, this method has only been demonstrated on simulated ECT data. In this work, we apply the previously developed method to experimental ECT data of a large grain titanium specimen. We show that we are able to determine grain boundaries and orientation from experimental ECT data, serving as a first step to full MTR characterization.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2305","pages":"20240048"},"PeriodicalIF":3.7,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145138331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.
{"title":"Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees.","authors":"Zecheng Zhang, Hao Liu, Wenjing Liao, Guang Lin","doi":"10.1098/rsta.2024.0054","DOIUrl":"https://doi.org/10.1098/rsta.2024.0054","url":null,"abstract":"<p><p>We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2305","pages":"20240054"},"PeriodicalIF":3.7,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145138208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper examines the current challenges in computed tomography (CT), with a critical exploration of existing methodologies from a mathematical perspective. Specifically, it aims to identify research directions to enhance image quality in low-dose, cost-effective cone beam CT (CBCT) systems, which have recently gained widespread use in general dental clinics. Dental CBCT offers a substantial cost advantage over standard medical CT, making it affordable for local dental practices; however, this affordability brings significant challenges related to image quality degradation, further complicated by the presence of metallic implants, which are particularly common in older patients. This paper investigates metal-induced artefacts stemming from mismatches in the forward model used in conventional reconstruction methods and explains an alternative approach that bypasses the traditional Radon transform model. Additionally, it examines both the potential and limitations of deep learning-based methods in tackling these challenges, offering insights into their effectiveness in improving image quality in low-dose dental CBCT.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.
{"title":"Deep learning-based artefact reduction in low-dose dental cone beam computed tomography with high-attenuation materials.","authors":"Hyoung Suk Park, Kiwan Jeon, J K Seo","doi":"10.1098/rsta.2024.0045","DOIUrl":"10.1098/rsta.2024.0045","url":null,"abstract":"<p><p>This paper examines the current challenges in computed tomography (CT), with a critical exploration of existing methodologies from a mathematical perspective. Specifically, it aims to identify research directions to enhance image quality in low-dose, cost-effective cone beam CT (CBCT) systems, which have recently gained widespread use in general dental clinics. Dental CBCT offers a substantial cost advantage over standard medical CT, making it affordable for local dental practices; however, this affordability brings significant challenges related to image quality degradation, further complicated by the presence of metallic implants, which are particularly common in older patients. This paper investigates metal-induced artefacts stemming from mismatches in the forward model used in conventional reconstruction methods and explains an alternative approach that bypasses the traditional Radon transform model. Additionally, it examines both the potential and limitations of deep learning-based methods in tackling these challenges, offering insights into their effectiveness in improving image quality in low-dose dental CBCT.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2305","pages":"20240045"},"PeriodicalIF":3.7,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12461222/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145138373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Volterra series has been used in nonlinear system identification (NLSI) for decades; its frequency-domain counterpart allows a generalization of 'resonance curves' for nonlinear systems-so-called higher-order frequency-response functions (HFRFs). Estimating the terms in the series has often proved to be a challenge; however, the (comparatively) recent uptake of machine-learning technology into engineering dynamics has led to advances in the identification of the series-both for the Volterra kernels themselves and for the HFRFs. The current paper provides an overview of a number of approaches based on neural networks, Gaussian processes (GPs) and reproducing kernel Hilbert spaces (RKHSs), and presents new results for multi-input multi-output (MIMO) systems based on neural networks.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.
{"title":"Machine-learning perspectives on Volterra system identification.","authors":"Keith Worden, Timothy Rogers, Oliver Preston","doi":"10.1098/rsta.2024.0053","DOIUrl":"https://doi.org/10.1098/rsta.2024.0053","url":null,"abstract":"<p><p>The Volterra series has been used in nonlinear system identification (NLSI) for decades; its frequency-domain counterpart allows a generalization of 'resonance curves' for nonlinear systems-so-called higher-order frequency-response functions (HFRFs). Estimating the terms in the series has often proved to be a challenge; however, the (comparatively) recent uptake of machine-learning technology into engineering dynamics has led to advances in the identification of the series-both for the Volterra kernels themselves and for the HFRFs. The current paper provides an overview of a number of approaches based on neural networks, Gaussian processes (GPs) and reproducing kernel Hilbert spaces (RKHSs), and presents new results for multi-input multi-output (MIMO) systems based on neural networks.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2305","pages":"20240053"},"PeriodicalIF":3.7,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145138392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniela Calvetti, Andrea N Arnold, Alexander P Hoover, Giorgio Davico, Erkki Somersalo
It has been hypothesized that during a motion task the central nervous system controls the skeletal muscles partitioning them into synergetic groups, hence effectively reducing the dimensionality of the control problem. The identification of muscle groups that are co-activated remains an open problem: its solution could have important implications in the design of training or rehabilitation protocols. In this article, we combine Bayesian inverse problem techniques and data science algorithms to identify muscle synergies in human motion from the motion tracker time series of positions of fiducial markers on the body during the task. The inverse problem of estimating the muscle activation patterns from the motion tracking data is cast in the Bayesian framework, and the posterior distribution of muscle activations is explored using Myobolica, a Gibbs-sampler-based Markov chain Monte Carlo sampler. A low-rank approximation of the muscle activation patterns is then obtained via a sparsity promoting Bayesian non-negative matrix factorization of the sample mean, where the sparse coefficient vectors correspond to groups of muscles that show co-activation over the sample.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.
{"title":"Separable hierarchical priors applied to analysis of synergies in human locomotion.","authors":"Daniela Calvetti, Andrea N Arnold, Alexander P Hoover, Giorgio Davico, Erkki Somersalo","doi":"10.1098/rsta.2024.0055","DOIUrl":"https://doi.org/10.1098/rsta.2024.0055","url":null,"abstract":"<p><p>It has been hypothesized that during a motion task the central nervous system controls the skeletal muscles partitioning them into synergetic groups, hence effectively reducing the dimensionality of the control problem. The identification of muscle groups that are co-activated remains an open problem: its solution could have important implications in the design of training or rehabilitation protocols. In this article, we combine Bayesian inverse problem techniques and data science algorithms to identify muscle synergies in human motion from the motion tracker time series of positions of fiducial markers on the body during the task. The inverse problem of estimating the muscle activation patterns from the motion tracking data is cast in the Bayesian framework, and the posterior distribution of muscle activations is explored using Myobolica, a Gibbs-sampler-based Markov chain Monte Carlo sampler. A low-rank approximation of the muscle activation patterns is then obtained via a sparsity promoting Bayesian non-negative matrix factorization of the sample mean, where the sparse coefficient vectors correspond to groups of muscles that show co-activation over the sample.This article is part of the theme issue 'Frontiers of applied inverse problems in science and engineering'.</p>","PeriodicalId":19879,"journal":{"name":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences","volume":"383 2305","pages":"20240055"},"PeriodicalIF":3.7,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145138363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}