A neural network approach for solving the Monge–Ampère equation with transport boundary condition

Roel Hacking , Lisa Kusch , Koondanibha Mitra , Martijn Anthonissen , Wilbert IJzerman
{"title":"A neural network approach for solving the Monge–Ampère equation with transport boundary condition","authors":"Roel Hacking ,&nbsp;Lisa Kusch ,&nbsp;Koondanibha Mitra ,&nbsp;Martijn Anthonissen ,&nbsp;Wilbert IJzerman","doi":"10.1016/j.jcmds.2025.100119","DOIUrl":null,"url":null,"abstract":"<div><div>This paper introduces a novel neural network-based approach to solving the Monge–Ampère equation with the transport boundary condition, specifically targeted towards optical design applications. We leverage multilayer perceptron networks to learn approximate solutions by minimizing a loss function that encompasses the equation’s residual, boundary conditions, and convexity constraints. Our main results demonstrate the efficacy of this method, optimized using L-BFGS, through a series of test cases encompassing symmetric and asymmetric circle-to-circle, square-to-circle, and circle-to-flower reflector mapping problems. Comparative analysis with a conventional least-squares finite-difference solver reveals the competitive, and often superior, performance of our neural network approach on the test cases examined here. A comprehensive hyperparameter study further illuminates the impact of factors such as sampling density, network architecture, and optimization algorithm. While promising, further investigation is needed to verify the method’s robustness for more complicated problems and to ensure consistent convergence. Nonetheless, the simplicity and adaptability of this neural network-based approach position it as a compelling alternative to specialized partial differential equation solvers.</div></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"15 ","pages":"Article 100119"},"PeriodicalIF":0.0000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Mathematics and Data Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772415825000112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper introduces a novel neural network-based approach to solving the Monge–Ampère equation with the transport boundary condition, specifically targeted towards optical design applications. We leverage multilayer perceptron networks to learn approximate solutions by minimizing a loss function that encompasses the equation’s residual, boundary conditions, and convexity constraints. Our main results demonstrate the efficacy of this method, optimized using L-BFGS, through a series of test cases encompassing symmetric and asymmetric circle-to-circle, square-to-circle, and circle-to-flower reflector mapping problems. Comparative analysis with a conventional least-squares finite-difference solver reveals the competitive, and often superior, performance of our neural network approach on the test cases examined here. A comprehensive hyperparameter study further illuminates the impact of factors such as sampling density, network architecture, and optimization algorithm. While promising, further investigation is needed to verify the method’s robustness for more complicated problems and to ensure consistent convergence. Nonetheless, the simplicity and adaptability of this neural network-based approach position it as a compelling alternative to specialized partial differential equation solvers.
求解带输运边界条件的monge - ampantere方程的神经网络方法
本文介绍了一种新的基于神经网络的方法来求解具有传输边界条件的monge - ampantere方程,特别针对光学设计应用。我们利用多层感知器网络,通过最小化包含方程残差、边界条件和凸性约束的损失函数来学习近似解。通过一系列测试用例,包括对称和非对称的圆对圆、方对圆和圆对花反射器映射问题,我们的主要结果证明了该方法的有效性,该方法使用L-BFGS进行了优化。与传统的最小二乘有限差分求解器的比较分析揭示了我们的神经网络方法在这里所检查的测试用例上的竞争性,并且通常是优越的性能。全面的超参数研究进一步阐明了采样密度、网络结构和优化算法等因素的影响。虽然有希望,但需要进一步的研究来验证该方法对更复杂问题的鲁棒性并确保一致收敛。尽管如此,这种基于神经网络的方法的简单性和适应性使其成为专门的偏微分方程求解器的令人信服的替代方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.00
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信