Back to search

Georgia Institute of Technology

Applications of Neural Networks with Local Converging Inputs (NNLCI) for Classical and Quantum PDE Solvers

Abstract

dc:description.abstract

We develop a unified framework for improving numerical solvers with Neural Networks with Locally Converging Inputs (NNLCI). First, we applied NNLCI to 2D Maxwell’s equations with perfectly matched‐layer boundary conditions for light–PEC (perfect electric conductor) interactions. A network trained on local patches around specific PEC shapes successfully predicted solutions on globally different geometries. Next, we tested NNLCI on various ODEs: it failed for chaotic systems (e.g., double pendulum) but was effective for nonchaotic dynamics, and in simple cases can be interpreted as a well‐defined function of its inputs. Although originally formulated for hyperbolic conservation laws, NNLCI also performed well on parabolic and elliptic problems, as demonstrated in a 1D Poisson–Nernst–Planck ion‐channel model. Building on these results, we applied NNLCI to multi‐asset cash‐or‐nothing options under Black–Scholes. By correcting coarse‐ and fine‐mesh ADI solutions, NNLCI reduced RMSE by factors of 4–12 on test parameters, even when trained on a small fraction of the parameter grid. Careful treatment of far‐field boundary truncation was critical to maintain convergence far from the strike price. Finally, we demonstrate NNLCI’s first application to quantum algorithms by improving variational quantum‐algorithm (VQA) outputs for the 1D Poisson equation under realistic NISQ‐device noise. Although noisy VQA solutions deviate from classical finite‐difference references and do not converge to true solutions, NNLCI effectively maps these noisy outputs toward high‐accuracy references. We hypothesize that NNLCI implicitly composes the map from coarse quantum outputs to a noisy convergence space, then to the true solution. We discuss conditions for NNLCI to approximate a well‐defined inverse of the numerical scheme and contrast this with Monte Carlo methods, which lack deterministic intermediate states. These results establish NNLCI as a versatile, data‐efficient tool for accelerating solvers in classical and quantum settings.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Mathematics
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Cobb, Harris
Advisor dc:contributor.advisor
  • Liu, Yingjie
Committee members dc:contributor.committeemember
  • Kang, Sung Ha
  • Xie, Dexuan
  • Tao, Molei
  • Liao, Wenjing

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1853/82048

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Cobb, Harris. Applications of Neural Networks with Local Converging Inputs (NNLCI) for Classical and Quantum PDE Solvers. Doctoral thesis, Georgia Institute of Technology, 2025. https://hdl.handle.net/1853/82048