Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell University Graduate School
  3. Cornell Theses and Dissertations
  4. Learning and Interpolating Green's functions learned from Data

Learning and Interpolating Green's functions learned from Data

File(s)
Praveen_cornellgrad_0058F_15437.pdf (5.68 MB)
Permanent Link(s)
https://doi.org/10.7298/0v2a-2721
https://hdl.handle.net/1813/126576
Collections
Cornell Theses and Dissertations
Author
Praveen, Harshwardhan
Abstract

Green's functions are fundamental mathematical objects that serve as the impulse response of a linear differential operator, providing deep mechanistic insight into the physical systems they describe. This work presents a data-driven framework to learn and interpolate these vital solution operators directly from observational data, where the governing Partial Differential Equations of the system are unknown. The first work introduces two methods for learning a discrete, low-rank approximation of a system's Green's function from pairs of system excitations and responses: The first approach uses the proper orthogonal decomposition (POD) modes of the system's output as a surrogate for the Green's function's eigenvectors and subsequently fits the corresponding eigenvalues from data. The second, more accurate method employs a generalization of the randomized singular value decomposition (SVD) to construct the approximation. To handle systems with varying parameters, a principled manifold interpolation scheme was developed. This scheme maps the learned discrete eigenmodes to a tangent space for interpolation and then retracts them back to the manifold, allowing for the prediction of the Green's function at unseen parameter instances. Building upon the initial work, a more advanced, mesh-independent framework was developed to represent the learned Green's function as a continuous, bivariate function. In this approach, a Rational Neural Network first learns the Green's function from data. Subsequently, a Singular Value Expansion (SVE) of this continuous function is constructed using a representation in a Chebyshev basis. This method improves data efficiency and extends the scope of applicability from self-adjoint to non-self-adjoint operators. The manifold interpolation algorithm was then generalized to operate on this continuous representation, enabling the interpolation of Quasimatrices (matrices with functional columns) on an infinite-dimensional analogue of the Stiefel manifold. Numerical results demonstrate that this comprehensive framework learns high-fidelity approximations of solution operators and is robust to significant noise in the training data.

Description
122 pages
Date Issued
2026-05
Keywords
Green's Functions
•
Manifold Interpolation
•
PDE learning
•
Scientific Machine Learning
Committee Chair
Earls, Christopher
Committee Member
Warner, Derek
Giometto, Andrea
Degree Discipline
Civil and Environmental Engineering
Degree Name
Ph. D., Civil and Environmental Engineering
Degree Level
Doctor of Philosophy
Rights
Attribution 4.0 International
Rights URI
https://creativecommons.org/licenses/by/4.0/
Type
dissertation or thesis

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance