{"title":"Higher Order Difference Operators and Associated Relative Reproducing Kernel Hilbert Spaces","authors":"Palle E. T. Jorgensen, James F. Tian","doi":"10.1080/01630563.2023.2262819","DOIUrl":null,"url":null,"abstract":"AbstractWe study multiple notions of Hilbert spaces of functions which, via the respective inner products, reproduce function values, or differences of function values. We do this by extending results from the more familiar settings of reproducing kernel Hilbert spaces, RKHSs. Our main results deal with operations on infinite graphs G=(V,E) of vertices and edges, and associated Hilbert spaces. For electrical network models, the differences f(x)−f(y) represent voltage differences for pairs of vertices x, y. In these cases, relative RKHSs will depend on choices of conductance functions c, where an appropriate function c is specified as a positive function defined on the edge-set E from G. Our present study of higher order differences, using choices of relative RKHSs, is motivated in part by existing numerical algorithms for discretization of PDEs. Our approach to higher order differences uses both combinatorial operations on graphs, and operator theory for the respective RKHSs. Starting with a graph G=(V,E), we introduce an induced graph G′ such that the vertices in G′ are the edges in E from G, while the edges in G′ are pairs of neighboring edges from G.KEYWORDS: Conduction functionsdrop operatorgraph Laplacianhigher order differencesinduced graphsisometriesnetwork modelsrelative reproducingreproducing kernel Hilbert spaceresistance distanceMATHEMATICS SUBJECT CLASSIFICATION: Primary: 47B3247B9047N4047N70Secondary: 05C6305C9046C0546E2247B25 Data availability statementThe datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.Disclosure statementThe authors report there are no competing interests to declare.Additional informationFundingNo funding was received to assist with the preparation of this manuscript. The authors have no relevant financial or non-financial interests to disclose.","PeriodicalId":54707,"journal":{"name":"Numerical Functional Analysis and Optimization","volume":"11 1","pages":"0"},"PeriodicalIF":1.4000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Functional Analysis and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01630563.2023.2262819","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
AbstractWe study multiple notions of Hilbert spaces of functions which, via the respective inner products, reproduce function values, or differences of function values. We do this by extending results from the more familiar settings of reproducing kernel Hilbert spaces, RKHSs. Our main results deal with operations on infinite graphs G=(V,E) of vertices and edges, and associated Hilbert spaces. For electrical network models, the differences f(x)−f(y) represent voltage differences for pairs of vertices x, y. In these cases, relative RKHSs will depend on choices of conductance functions c, where an appropriate function c is specified as a positive function defined on the edge-set E from G. Our present study of higher order differences, using choices of relative RKHSs, is motivated in part by existing numerical algorithms for discretization of PDEs. Our approach to higher order differences uses both combinatorial operations on graphs, and operator theory for the respective RKHSs. Starting with a graph G=(V,E), we introduce an induced graph G′ such that the vertices in G′ are the edges in E from G, while the edges in G′ are pairs of neighboring edges from G.KEYWORDS: Conduction functionsdrop operatorgraph Laplacianhigher order differencesinduced graphsisometriesnetwork modelsrelative reproducingreproducing kernel Hilbert spaceresistance distanceMATHEMATICS SUBJECT CLASSIFICATION: Primary: 47B3247B9047N4047N70Secondary: 05C6305C9046C0546E2247B25 Data availability statementThe datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.Disclosure statementThe authors report there are no competing interests to declare.Additional informationFundingNo funding was received to assist with the preparation of this manuscript. The authors have no relevant financial or non-financial interests to disclose.
期刊介绍:
Numerical Functional Analysis and Optimization is a journal aimed at development and applications of functional analysis and operator-theoretic methods in numerical analysis, optimization and approximation theory, control theory, signal and image processing, inverse and ill-posed problems, applied and computational harmonic analysis, operator equations, and nonlinear functional analysis. Not all high-quality papers within the union of these fields are within the scope of NFAO. Generalizations and abstractions that significantly advance their fields and reinforce the concrete by providing new insight and important results for problems arising from applications are welcome. On the other hand, technical generalizations for their own sake with window dressing about applications, or variants of known results and algorithms, are not suitable for this journal.
Numerical Functional Analysis and Optimization publishes about 70 papers per year. It is our current policy to limit consideration to one submitted paper by any author/co-author per two consecutive years. Exception will be made for seminal papers.