Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 12 min ago
PreprintCC BY 4.0arXiv

Neural Network Solvers for Nonlinear ODEs: Benchmarking MLPs and B-Spline/Chebyshev KANs

Abstract

Three neural networks are compared as solvers of nonlinear ordinary differential equations: a multilayer perceptron (MLP), a Kolmogorov-Arnold network (KAN) whose edges are B-splines, and a KAN whose edges are Chebyshev series. Each network is trained only on the residual of the equation and on its initial or boundary conditions. The exact solution, or a numerical solution accurate to 10−13, is used only afterward to measure the error. Five test problems of differential orders one to four are investigated: the logistic equation, a singular Lane-Emden type initial value problem, a singular boundary value problem, the Falkner-Skan equation with suction, a fourth-order problem. The same training budget and the same choice of five activation functions are allocated to all networks. No numerical failures are encountered in any of the \nRuns{} training runs. For every problem, the best KAN is found to be at least as accurate as the best MLP while \paramsKANmin{} to \paramsKANmax{} parameters are used instead of \paramsMLP{}; the margin ranges from a tie to a factor of three. In the Falkner-Skan setting of an earlier study, the B-spline KAN is shown to be 34 to 220 times more accurate at every published test point. Much smaller MLPs are also found to be competitive, whereas at orders three and four, failures are experienced more frequently by KANs, and a coarse basis is required. The derivatives in the equation are distorted by the usual grid extension of a B-spline KAN; consequently, it is replaced with knot insertion, by which the logistic error is lowered more than a hundredfold, though no improvement is provided at order four.

Related

  1. Soliton Profiles in 1D: Enhanced Neural-Network Solvers and Constrained Deep Ritz Methods
    Chandler Haight, Alex D Rodriguez, Svetlana Roudenko
    arXivPreprintarXiv licenceFull textAnalysis & PDEsNumerical analysis & scientific computingarXiv
  2. Large-Scale Benchmarking of Quantum Neural Network Configurations for Financial Time Series Forecasting
    Jack Waller, Xing Liang, Dimitrios Makris +1
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Quantization-Aware Nonlinear Diffractive Neural Network for Robust Optical Image Reconstruction under Fabrication Constraints
    Junyu Wang, Jie Lu, Haoyu Li +11
    Optics ExpressPeer-reviewedLicence not statedOptics & photonicsCrossref
  4. Learning Parameters of dRGT Black Holes in Nonlinear Electrodynamics with Neural Network Scenarios
    Adil Belhaj, Salah Eddine Ennadifi, Maryem Jemri
    arXivPreprintarXiv licenceFull textGravitation & general relativityHigh-energy & particle physicsarXiv
  5. Benchmarking Derivative-Free Optimization Solvers for CSP Plant Design Using the SOLAR Simulator
    Xavier Lebeuf, Sébastien Le Digabel, Philippe Brillon +3
    SolarPACES Conference ProceedingsPeer-reviewedCC BYFull textGeneral physicsDOAJ
BibTeX
@misc{patukuri2026neural,
  title = {{Neural Network Solvers for Nonlinear ODEs: Benchmarking MLPs and B-Spline/Chebyshev KANs}},
  author = {Mahidhar Reddy Patukuri and B. Veena S. N. Rao and S. M. Mallikarjunaiah},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03783},
  eprint = {2610.03783},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03783},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Neural Network Solvers for Nonlinear ODEs: Benchmarking MLPs and B-Spline/Chebyshev KANs
AU  - Mahidhar Reddy Patukuri
AU  - B. Veena S. N. Rao
AU  - S. M. Mallikarjunaiah
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.03783
UR  - https://arxiv.org/abs/2610.03783
AB  - Three neural networks are compared as solvers of nonlinear ordinary differential equations: a multilayer perceptron (MLP), a Kolmogorov-Arnold network (KAN) whose edges are B-splines, and a KAN whose edges are Chebyshev series. Each network is trained only on the residual of the equation and on its initial or boundary conditions. The exact solution, or a numerical solution accurate to 10^−13, is used only afterward to measure the error. Five test problems of differential orders one to four are investigated: the logistic equation, a singular Lane-Emden type initial value problem, a singular boundary value problem, the Falkner-Skan equation with suction, a fourth-order problem. The same training budget and the same choice of five activation functions are allocated to all networks. No numerical failures are encountered in any of the \nRuns{} training runs. For every problem, the best KAN is found to be at least as accurate as the best MLP while \paramsKANmin{} to \paramsKANmax{} parameters are used instead of \paramsMLP{}; the margin ranges from a tie to a factor of three. In the Falkner-Skan setting of an earlier study, the B-spline KAN is shown to be 34 to 220 times more accurate at every published test point. Much smaller MLPs are also found to be competitive, whereas at orders three and four, failures are experienced more frequently by KANs, and a coarse basis is required. The derivatives in the equation are distorted by the usual grid extension of a B-spline KAN; consequently, it is replaced with knot insertion, by which the logistic error is lowered more than a hundredfold, though no improvement is provided at order four.
ER  -