arXiv (All)
open access
Verifying Well-Posedness of Linear PDEs using Convex Optimization
Ensuring that a PDE model is well-posed is a necessary precursor to any form of analysis, control, or numerical simulation. Although the Lumer--Phillips theorem provides necessary and sufficient conditions for well-posedness of dissipative PDEs, these conditions must hold only on the domain of the P
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
- Residual-Controlled Douglas--Rachford Splitting for Differentiable Solver Layers#609633
- 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
- A unified analysis on the speedup of accelerated gradient methods: An inertial dynamics approach#999641
Record · ID 1012174
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