arXiv (OAI Expanded)
open access
Picard-Based Acceleration of Newton Continuation for Mean Field Game PDE Systems
We develop a method that uses Picard iterations to accelerate Newton continuation for the semi-implicit finite-difference discretization of forward-backward partial differential equation (PDE) systems arising in mean field games (MFGs). We first investigate the computational properties of the Picard
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Mean-Field PhiBE: Continuous-Time Mean-Field Reinforcement Learning from Discrete-Time Data#973233
- Geometric Moment Contraction for Stochastic Nesterov Acceleration#1105861
- Global Convergence of DGM and PINN Algorithms for Solving Nonlinear PDEs#615115
- Global Convergence of DGM and PINN Algorithms for Solving Nonlinear PDEs#614148
- Global Convergence of DGM and PINN Algorithms for Solving Nonlinear PDEs#405638
Record · ID 1123227
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive