2015arXiv (Cornell University)Open access

GRAPH LAPLACIANS AND DISCRETE REPRODUCING KERNEL HILBERT SPACES FROM RESTRICTIONS AND CAMERON-MARTIN

Palle E. T. Jørgensen, Feng Tian

Open full text 0 citations

Abstract

We study reproducing kernel functions, and associated reproducing kernel Hilbert spaces (RKHSs) H over infinite, discrete and countable sets V. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding approximate solutions to PDE-boundary value problems; typically using multiresolution-subdivision schemes, applied to the continuous domains. In this paper, we turn the tables: our object of study is realistic infinite discrete models in their own right; and we then use an analysis of suitable continuous counterpart PDE-boundary value problems, but now serving as a tool for obtaining solutions in the discrete world.

About this research paper

What this paper is about

We study reproducing kernel functions, and associated reproducing kernel Hilbert spaces (RKHSs) H over infinite, discrete and countable sets V. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding approximate solutions to PDE-boundary value problems; typically using multiresolution-subdivision schemes, applied to the continuous domains. In this paper, we turn the tables: our object of study is realistic infinite discrete models in their own right; and we then use an analysis of suitable continuous counterpart PDE-boundary value problems, but now serving as a tool for obtaining solutions in the discrete world.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We study reproducing kernel functions, and associated reproducing kernel Hilbert spaces (RKHSs) H over infinite, discrete and countable sets V. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding approximate solutions to PDE-boundary value problems; typically using multiresolution-subdivision schemes, applied to the continuous domains. In this paper, we turn the tables: our object of study is realistic infinite discrete models in their own right; and we then use an analysis of suitable continuous counterpart PDE-boundary value problems, but now serving as a tool for obtaining solutions in the discrete world.

Key concepts: Countable set, Mathematics, Kernel (algebra), Hilbert space, Reproducing kernel Hilbert space, Subdivision, Graph, Pure mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
GRAPH LAPLACIANS AND DISCRETE REPRODUCING KERNEL HILBERT SPACES FROM RESTRICTIONS AND CAMERON-MARTIN — Research Paper | ScholarLens