default search action
Foundations of Computational Mathematics, Volume 24
Volume 24, Number 1, February 2024
- Eddie Aamari, Alexander Knop:
Adversarial Manifold Estimation. 1-97 - Richard S. Falk, Ragnar Winther:
The Bubble Transform and the de Rham Complex. 99-147 - Robert I. McLachlan, Ari Stern:
Functional Equivariance and Conservation Laws in Numerical Integration. 149-177 - March Boedihardjo, Thomas Strohmer, Roman Vershynin:
Covariance's Loss is Privacy's Gain: Computationally Efficient, Private and Accurate Synthetic Data. 179-226 - Sameer Agarwal, Timothy Duff, Max Lieblich, Rekha R. Thomas:
An Atlas for the Pinhole Camera. 227-277 - Luis Alberto Escudero, Naomi Feldheim, Günther Koliander, José Luis Romero:
Efficient Computation of the Zeros of the Bargmann Transform Under Additive White Noise. 279-312 - Erlend Grong, Stefan Sommer:
Most Probable Paths for Anisotropic Brownian Motions on Manifolds. 313-345
Volume 24, Number 2, April 2024
- Gábor Pataki, Aleksandr Touzov:
An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone. 347-384 - Andrew J. Blumberg, Michael Lesnick:
Stability of 2-Parameter Persistent Homology. 385-427 - Tianxiang Liu, Bruno F. Lourenço:
Convergence Analysis under Consistent Error Bounds. 429-479 - Jonathan W. Siegel, Jinchao Xu:
Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks. 481-537 - Vadim Lebovici:
Hybrid Transforms of Constructible Functions. 539-585 - Yakov Berchenko-Kogan, Evan S. Gawlik:
Finite Element Approximation of the Levi-Civita Connection and Its Curvature in Two Dimensions. 587-637 - J. Maurice Rojas:
Counting Real Roots in Polynomial-Time via Diophantine Approximation. 639-681 - Rémi Carles, Chunmei Su:
Scattering and Uniform in Time Error Estimates for Splitting Method in NLS. 683-722
Volume 24, Number 3, June 2024
- Matthew J. Colbrook:
On the Computation of Geometric Features of Spectra of Linear Operators on Hilbert Spaces. 723-804 - Vitaliy Kurlin:
Mathematics of 2-Dimensional Lattices. 805-863 - Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
Subexponential-Time Algorithms for Sparse PCA. 865-914 - Folkmar Bornemann:
A Stirling-Type Formula for the Distribution of the Length of Longest Increasing Subsequences. 915-953 - Steffen W. R. Werner, Benjamin Peherstorfer:
On the Sample Complexity of Stabilizing Linear Dynamical Systems from Data. 955-987 - Feng Dai, Andriy Prymak:
Optimal Polynomial Meshes Exist on any Multivariate Convex Domain. 989-1018 - Yuwen Li:
Nodal Auxiliary Space Preconditioning for the Surface de Rham Complex. 1019-1048 - Liam Yemm:
A New Approach to Handle Curved Meshes in the Hybrid High-Order Method. 1049-1076 - Martin Helmer, Vidit Nanda:
Correction to: Conormal Spaces and Whitney Stratifications. 1077-1084
Volume 24, Number 4, August 2024
- Philipp Grohs, Felix Voigtländer:
Proof of the Theory-to-Practice Gap in Deep Learning via Sampling Complexity bounds for Neural Network Approximation Spaces. 1085-1143 - Andreas Cap, Kaibo Hu:
BGG Sequences with Weak Regularity and Applications. 1145-1184 - Martin W. Licht:
Symmetry and Invariant Bases in Finite Element Exterior Calculus. 1185-1224 - Yaroslav N. Shitov:
Further $\exists {\mathbb {R}}$-Complete Problems with PSD Matrix Factorizations. 1225-1248 - Ajay Jasra, Kody J. H. Law, Neil Walton, Shangda Yang:
Multi-index Sequential Monte Carlo Ratio Estimators for Bayesian Inverse problems. 1249-1304 - Nicolas Clozeau, Marc Josien, Felix Otto, Qiang Xu:
Bias in the Representative Volume Element method: Periodize the Ensemble Instead of Its Realizations. 1305-1387 - Robert Szczelina, Piotr Zgliczynski:
High-Order Lohner-Type Algorithm for Rigorous Computation of Poincaré Maps in Systems of Delay Differential Equations with Several Delays. 1389-1454
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.