Unverified50% confidenceFactExact time
Domain decomposition methods have more than 30 years of development history in deterministic numerical computation, with classical representatives including the Schwarz alternating method proposed in 1870, the FETI method, and Balancing Domain Decomposition.
1
Sources
50%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
分解子域行走：加速蒙特卡洛PDE求解的免网格新方法
Related Claims
UnverifiedThe theoretical foundation of the minimax algorithm can be traced back to von Neumann's minimax theorem of 1928.67% similarUnverified约束传播的思想最早可追溯至1970年代阿兰·马克沃斯对弧一致性算法的研究65% similarUnverifiedThe Hesse configuration was discovered by German mathematician Otto Hesse in the 19th century while studying the inflection points of elliptic curves.60% similarUnverified指数积分器方法源于20世纪60年代对刚性常微分方程的研究，通过精确处理线性部分、数值近似非线性部分放宽稳定性限制59% similarUnverified大O符号由德国数学家保罗·巴赫曼于1894年引入，用于描述算法复杂度的渐近行为59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/683537API
curl https://kongchang.com/api/v1/knowledge/claims/683537MCP
get_claim(id=683537)