PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 10, 2026Mathematical Methods in the Applied Sciences0 citations

Approximate Solutions of Nonlinear Functional Volterra Integral Equations Using A Collocation Method With Neural Networks Activated by Sigmoidal Functions

View Full Paper
SBSohrab BazmPQPeyman Abolghasemi Qarehbolagh

Key Points

  • The aim is to approximate solutions of nonlinear functional Volterra integral equations using a novel collocation method.
  • Establish existence and uniqueness of solutions in a Banach space.
  • Develop a numerical collocation method with neural networks activated by sigmoidal functions.
  • Derive explicit formulas for coefficients, avoiding traditional iterative solvers.
  • Analyze convergence and derive a priori error bounds.
  • Compare results with other numerical methods using several examples.
  • The proposed method shows competitive accuracy in approximating solutions.
  • Convergence of approximate solutions to the exact solutions is established.
  • Explicit formulas for coefficients lead to stable computation and efficiency.
  • Numerical examples illustrate the effectiveness of the method compared to traditional approaches.

Abstract

ABSTRACT In this paper, we study a broad class of nonlinear integral equations, referred to as nonlinear Volterra‐Urysohn functional integral equations. Our analysis is conducted in the Banach space of all continuous real‐valued functions defined on a non‐empty, closed, and bounded interval . We establish the existence and uniqueness of solutions under suitable smoothness conditions. We then develop a numerical collocation method to approximate the solution. The approximations are represented as neural networks with sigmoidal activation functions, specifically employing Heaviside, logistic, and Gompertz functions. Unlike classical polynomial, spline, or spectral‐based collocation methods, the proposed sigmoidal collocation scheme yields an explicit formula for the coefficients, avoiding iterative solvers such as Newton or fixed‐point methods and ensuring stable computation. This explicit solvability, combined with representational flexibility and practical computational efficiency, leads to competitive accuracy‐versus‐time performance, filling a gap left by existing numerical approaches. The convergence of the approximate solutions to the exact solution is analyzed, and an a priori error bound is derived. Finally, the effectiveness of the proposed method is demonstrated through several numerical examples, and the results are compared with those obtained using other methods.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Bazm et al. (2026) studied this question.

synapsesocial.com/papers/69af95c070916d39fea4da55https://doi.org/10.1002/mma.70616
Ask AI
Helpful
Bookmark
Share
View Full Paper