RSOM applies dictionary learning to discover a sparse dictionary that conditions the analytic continuation inverse problem, yielding competitive results on synthetic tests and finite-temperature electron gas QMC data.
Trefethen.Approximation Theory and Approximation Practice
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
years
2026 7verdicts
UNVERDICTED 7representative citing papers
Quantum algorithm block-encodes Riccati solutions for m-particle m-hole RPA using Riesz projectors and QSVT, claiming linear system-size scaling under sparsity and polynomial cost in excitation rank m.
Chebyshev polynomial approximations with adaptive sampling solve canonical differential equations for Feynman integrals, demonstrated to be stable and competitive for two-loop five-point cases in double precision.
A general framework for iterative contour integral-based methods for nonlinear eigenvalue problems is introduced, enabling a proof of linear convergence for NLFEAST under mild assumptions.
Introduces formal verification to compute certified neuron range bounds for CKKS-encrypted neural networks, eliminating overflow failures that previously reached 47%.
CHESS package implements Chebyshev-Lobatto spectral collocation for transporting epsilon-factorized differential equations of Feynman master integrals with benchmarks showing rapid convergence and shorter wall times than local series methods.
Case study applying Chebfun's Chebyshev-based methods to Richards' equation shows explicit linearization and L-scheme overcome Newton convergence failures of chebop for accurate 1D steady-state solutions.
citing papers explorer
-
Discovering a well-conditioned analytic continuation problem via dictionary learning
RSOM applies dictionary learning to discover a sparse dictionary that conditions the analytic continuation inverse problem, yielding competitive results on synthetic tests and finite-temperature electron gas QMC data.