AI & ML
Numerical analysis of linear finite element methods for the Gross--Pitaevskii eigenvalue problem
arXiv cs.NA0 views
arXiv:2610.41715v1 Announce Type: new Abstract: In this paper, we analyze the standard and the mass-lumped linear finite element methods for the Gross--Pitaevskii eigenvalue problem. For the standard method, we give a new proof of the uniqueness of the discrete ground state up to sign for sufficiently small mesh sizes, which only requires the $H^1$-convergence of the discrete ground states. For both methods, we establish optimal convergence rates in the $L^p$- and $W^{1,p}$-norms for $1 \le p < \infty$. Under additional regularity assumptions on the potential, we further obtain an optimal convergence rate in the $W^{1,\infty}$-norm and an almost optimal convergence rate, up to a logarithmic factor, in the $L^\infty$-norm. Moreover, we prove that the discrete ground states superconverge to the Ritz projection of the exact ground state in the $W^{1,p}$-seminorm. The analysis is based on a perturbation argument. Numerical experiments confirm the theoretical results.
Source:https://arxiv.org/abs/2610.41715PreviousA Preconditioned Quantum Linear Solver for Periodic Two-Phase Heat Conduction with Mesh-Independent Condition NumberNext$W^{1,p}$ error estimates of an IPDG and a class of HDG methods for the Poisson problem on convex polyhedral domains
Related posts

The Download: the agentic web arrives and the drive for safer roads
0MIT Technology Review

Stop counting tokens, start counting what ships
0MIT Technology Review
OpenAI is finally merging ChatGPT’s chat and Work tabs
0TechCrunch

10 Open-Source Robotics Repositories for 3D Perception, VLA Policies, and Sensor Calibration
0dev.to
My self-modifying system tried to wire a gate-passing module into its own protection enforcer. It was refused three times.
0dev.to
Last night an AI agent performed brain surgery on a mouse
0Hacker News