8 articles tagged with #computational-mathematics. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers demonstrated that AI-driven formal proof systems can autonomously solve open mathematics problems, resolving 9 Erdős problems and 44 OEIS conjectures at modest computational cost. This breakthrough validates LLMs as practical research tools when combined with formal verification systems like Lean, marking the first large-scale evaluation of this approach on genuinely open problems.
Researchers have developed a multi-agent AI system in Lean 4 that formalizes asymptotic statistical theory, a mathematically complex domain combining convergence statements, functional analysis, and regularity conditions. The hypothesis-disciplined approach ensures every formalization claim is anchored to source mathematics, producing axiom-clean and human-audited proofs for parametric and semi-parametric statistical models.
Researchers propose a bridge-database system connecting bibliographic mathematical literature with formal proof libraries, introducing a formalization score to measure publication coverage in machine-verifiable systems like Lean mathlib. This framework aims to unify fragmented mathematical knowledge across informal publications and formal verification ecosystems.
Researchers have developed AFSAT, a GPU-accelerated solver for pseudo-Boolean satisfiability problems that builds on continuous local search principles. The fully-engineered system uses JAX compilation techniques to achieve substantial improvements in numerical stability, runtime performance, and memory efficiency while scaling efficiently across multiple accelerators.
Researchers have developed Iteris, an agentic AI system designed to tackle open problems in computational mathematics by combining language models with numerical experimentation and algorithm design. Applied to two unsolved problems from a Simons Workshop, Iteris generated verified results including a phase diagram for optimization algorithms and a counterexample about QR factorization, demonstrating that AI agents can contribute meaningfully to mathematical research when paired with human expertise.
Researchers introduce 'isometry pursuit,' a convex algorithm that identifies orthonormal column-submatrices within wide matrices by combining novel normalization techniques with multitask basis pursuit. The method enables discovery of isometric embeddings from interpretable dictionaries and offers a computational alternative to greedy or brute force approaches for coordinate selection problems.
Researchers published a study comparing traditional numerical methods with Physics-Informed Neural Networks (PINNs) for solving direct and inverse problems in differential equations. The work demonstrates that PINNs can effectively estimate solutions at competitive computational costs for complex systems like the Porous Medium Equation.
Researchers propose a new framework called Operator Learning with Domain Decomposition to solve partial differential equations (PDEs) on arbitrary geometries using neural operators. The approach addresses data efficiency and geometry generalization challenges by breaking complex domains into smaller subdomains that can be solved locally and then combined into global solutions.
