← All Papers · Formal Verification

Tensor Learning: Data-Driven Recovery of the (D, C, P) Decomposition and PDE Solvability Class

Dr. Tamás Nagy Short Draft Formal Verification Lean-Verified
Mathematics verified. Core theorems are machine-checked in Lean 4. Prose and presentation may not have been human-reviewed.
View in Graph BibTeX

Summary

We propose a hybrid algorithm that recovers the structural $(D, C, P)$ decomposition of a nonlinear PDE system from time-series observations and, from this decomposition, predicts the solvability class and the difficulty parameter $\mathcal{D} = \lVe
Length
4,277 words
Claims
6 theorems
Status
Draft
Target
SIAM Journal on Scientific Computing

Browse all Formal Verification papers →