Foundations of Computational Mathematics

Papers
(The TQCC of Foundations of Computational Mathematics is 6. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-11-01 to 2024-11-01.)
ArticleCitations
A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimization40
Function Values Are Enough for $$L_2$$-Approximation36
Complexes from Complexes27
A New Upper Bound for Sampling Numbers25
Kurdyka–Łojasiewicz Exponent via Inf-projection24
Zeroth-Order Nonconvex Stochastic Optimization: Handling Constraints, High Dimensionality, and Saddle Points23
Low-Rank Matrix Recovery with Composite Optimization: Good Conditioning and Rapid Convergence21
Primal Dual Methods for Wasserstein Gradient Flows19
A Variational Finite Element Discretization of Compressible Flow17
An Arbitrary-Order Discrete de Rham Complex on Polyhedral Meshes: Exactness, Poincaré Inequalities, and Consistency17
Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks16
Newton Polytopes and Relative Entropy Optimization14
Optimal Stable Nonlinear Approximation14
On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants14
Causal Structure Learning: A Combinatorial Perspective13
A New Technique for Preserving Conservation Laws12
Deep Composition of Tensor-Trains Using Squared Inverse Rosenblatt Transports12
Convergence Rates for Discretized Monge–Ampère Equations and Quantitative Stability of Optimal Transport11
Curve Based Approximation of Measures on Manifolds by Discrepancy Minimization11
Learning Interaction Kernels in Stochastic Systems of Interacting Particles from Multiple Trajectories11
Spectral Graph Matching and Regularized Quadratic Relaxations II11
Primary Ideals and Their Differential Equations10
A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order Methods10
Finite Element Systems for Vector Bundles: Elasticity and Curvature10
Convergence Rates of First- and Higher-Order Dynamics for Solving Linear Ill-Posed Problems9
Homological Algebra for Persistence Modules9
Analysis of Tensor Approximation Schemes for Continuous Functions9
Euclidean Distance Degree and Mixed Volume9
The Geometry of Off-the-Grid Compressed Sensing8
Overcoming the Curse of Dimensionality in the Numerical Approximation of Parabolic Partial Differential Equations with Gradient-Dependent Nonlinearities8
Learning Elliptic Partial Differential Equations with Randomized Linear Algebra8
Covariance’s Loss is Privacy’s Gain: Computationally Efficient, Private and Accurate Synthetic Data8
A Generalized Conditional Gradient Method for Dynamic Inverse Problems with Optimal Transport Regularization8
Potentially Singular Behavior of the 3D Navier–Stokes Equations8
Low-Degree Approximation of Random Polynomials8
Fenchel Duality Theory and a Primal-Dual Algorithm on Riemannian Manifolds8
Convergence of Adaptive Discontinuous Galerkin and $$C^0$$-Interior Penalty Finite Element Methods for Hamilton–Jacobi–Bellman and Isaacs Equations7
Computing the Sound of the Sea in a Seashell7
Orthogonal Polynomials on Planar Cubic Curves7
Exponential ReLU Neural Network Approximation Rates for Point and Edge Singularities7
Robust Group Synchronization via Cycle-Edge Message Passing7
Continuum Limit of Lipschitz Learning on Graphs7
Potential Singularity of the 3D Euler Equations in the Interior Domain7
Do Log Factors Matter? On Optimal Wavelet Approximation and the Foundations of Compressed Sensing7
Order Conditions for Sampling the Invariant Measure of Ergodic Stochastic Differential Equations on Manifolds7
A Framework for Differential Calculus on Persistence Barcodes7
Quasi-optimal Nonconforming Approximation of Elliptic PDEs with Contrasted Coefficients and $$H^{1+{r}}$$, $${r}>0$$, Regularity6
Optimality of Robust Online Learning6
The Saddle Point Problem of Polynomials6
A Counter-Example to Hausmann’s Conjecture6
Mathematics of 2-Dimensional Lattices6
The Reeb Graph Edit Distance is Universal6
Computing the Homology of Semialgebraic Sets. II: General Formulas6
On the Representation and Learning of Monotone Triangular Transport Maps6
Sparse Multi-Reference Alignment: Phase Retrieval, Uniform Uncertainty Principles and the Beltway Problem6
On the Computation of Geometric Features of Spectra of Linear Operators on Hilbert Spaces6
0.032787084579468