TY - JOUR
T1 - Deep Learning Solution of the Eigenvalue Problem for Differential Operators
AU - Ben-Shaul, Ido
AU - Ba, Leah
AU - Fishelov, Dalia
AU - Sochen, Nir
N1 - Publisher Copyright:
© 2023 Massachusetts Institute of Technology.
PY - 2023/6
Y1 - 2023/6
N2 - Solving the eigenvalue problem for differential operators is a common problem in many scientific fields. Classical numerical methods rely on intricate domain discretization and yield nonanalytic or nonsmooth ap-proximations. We introduce a novel neural network–based solver for the eigenvalue problem of differential self-adjoint operators, where the eigenpairs are learned in an unsupervised end-to-end fashion. We propose several training procedures for solving increasingly challenging tasks toward the general eigenvalue problem. The proposed solver is ca-pable of finding the M smallest eigenpairs for a general differential op-erator. We demonstrate the method on the Laplacian operator, which is of particular interest in image processing, computer vision, and shape analysis among many other applications. In addition, we solve the Legendre differential equation. Our proposed method simultaneously solves several eigenpairs and can be easily used on free-form domains. We exem-plify it on L-shape and circular cut domains. A significant contribution of this work is an analysis of the numerical error of this method. In particular an upper bound for the (unknown) solution error is given in terms of the (measured) truncation error of the partial differential equation and the network structure.
AB - Solving the eigenvalue problem for differential operators is a common problem in many scientific fields. Classical numerical methods rely on intricate domain discretization and yield nonanalytic or nonsmooth ap-proximations. We introduce a novel neural network–based solver for the eigenvalue problem of differential self-adjoint operators, where the eigenpairs are learned in an unsupervised end-to-end fashion. We propose several training procedures for solving increasingly challenging tasks toward the general eigenvalue problem. The proposed solver is ca-pable of finding the M smallest eigenpairs for a general differential op-erator. We demonstrate the method on the Laplacian operator, which is of particular interest in image processing, computer vision, and shape analysis among many other applications. In addition, we solve the Legendre differential equation. Our proposed method simultaneously solves several eigenpairs and can be easily used on free-form domains. We exem-plify it on L-shape and circular cut domains. A significant contribution of this work is an analysis of the numerical error of this method. In particular an upper bound for the (unknown) solution error is given in terms of the (measured) truncation error of the partial differential equation and the network structure.
UR - http://www.scopus.com/inward/record.url?scp=85159730012&partnerID=8YFLogxK
U2 - 10.1162/neco_a_01583
DO - 10.1162/neco_a_01583
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
C2 - 37037040
AN - SCOPUS:85159730012
SN - 0899-7667
VL - 35
SP - 1100
EP - 1134
JO - Neural Computation
JF - Neural Computation
IS - 6
ER -