Find link

language:

Find link is a tool written by Edward Betts.

searching for Foundations of Computational Mathematics 38 found (55 total)

alternate case: foundations of Computational Mathematics

Computational mathematics (538 words) [view diff] exact match in snippet view article find links to article

Journal overview. Retrieved April 2007. Cucker, F. (2003). Foundations of Computational Mathematics: Special Volume. Handbook of Numerical Analysis. North-Holland

Smale's problems (786 words) [view diff] exact match in snippet view article find links to article

"A Rigorous ODE Solver and Smale's 14th Problem" (PDF). Foundations of Computational Mathematics. 2 (1): 53–117. CiteSeerX 10.1.1.545.3996. doi:10.1007/s002080010018

Toda's theorem (428 words) [view diff] exact match in snippet view article find links to article

Theorem, in Foundations of Computational Mathematics Saugata Basu (2011); A Complex Analogue of Toda's Theorem, in Foundations of Computational Mathematics

Epidemics (journal) (56 words) [view diff] exact match in snippet view article

2020-02-15. "Fields Institute - Thematic Program on the Foundations of Computational Mathematics". www.fields.utoronto.ca. Retrieved 15 February 2020. v

Thomas Hou (977 words) [view diff] exact match in snippet view article find links to article

Singular Behavior of the 3D Navier–Stokes Equations". Foundations of Computational Mathematics. arXiv:2107.06509. doi:10.1007/s10208-022-09578-4. ISSN 1615-3383

Topological data analysis (11,259 words) [view diff] exact match in snippet view article find links to article

Gunnar; Silva, Vin de (2010-04-21). "Zigzag Persistence". Foundations of Computational Mathematics. 10 (4): 367–405. doi:10.1007/s10208-010-9066-0. ISSN 1615-3375

Sparse Fourier transform (1,633 words) [view diff] exact match in snippet view article find links to article

(2010-01-05). "Combinatorial Sublinear-Time Fourier Algorithms". Foundations of Computational Mathematics. 10 (3): 303–338. doi:10.1007/s10208-009-9057-1. S2CID 1631513

Jacobi set (370 words) [view diff] exact match in snippet view article find links to article

Edelsbrunner, Herbert; John Harer (2002). "Jacobi sets of multiple morse functions". Foundations of Computational Mathematics. Cambridge University Press: 37–57.

Birkhoff polytope (1,005 words) [view diff] exact match in snippet view article find links to article

Vergne, M. (2004), "Counting Integer Flows in Networks", Foundations of Computational Mathematics, 4 (3): 277–314, arXiv:math/0303228, doi:10.1007/s10208-003-0088-8

Subdivision bifiltration (1,169 words) [view diff] exact match in snippet view article find links to article

2011). "Geometric Inference for Probability Measures". Foundations of Computational Mathematics. 11 (6): 733–751. doi:10.1007/s10208-011-9098-0. ISSN 1615-3375

Adrian Lewis (mathematician) (993 words) [view diff] exact match in snippet view article

(2001). "Optimal Stability and Eigenvalue Multiplicity". Foundations of Computational Mathematics. 1 (2): 205–225. doi:10.1007/PL00021726. S2CID 10550012

O-minimal theory (1,294 words) [view diff] exact match in snippet view article find links to article

"Stochastic Subgradient Method Converges on Tame Functions". Foundations of Computational Mathematics. 20 (1): 119–154. arXiv:1804.07795. doi:10.1007/s10208-018-09409-5

Christoph Schwab (705 words) [view diff] exact match in snippet view article find links to article

Galerkin Approximations for a Class of Elliptic sPDEs". Foundations of Computational Mathematics. 10 (6): 615–646. doi:10.1007/s10208-010-9072-2. hdl:20

Numerical algebraic geometry (1,283 words) [view diff] exact match in snippet view article find links to article

(2013-02-01). "Robust Certified Numerical Homotopy Tracking". Foundations of Computational Mathematics. 13 (2): 253–295. arXiv:1105.5992. doi:10.1007/s10208-013-9143-2

Joel Tropp (469 words) [view diff] exact match in snippet view article find links to article

"User-friendly tail bounds for sums of random matrices", Foundations of Computational Mathematics, 12 (4): 389–434, CiteSeerX 10.1.1.708.9756, doi:10

Continuous-variable quantum information (2,420 words) [view diff] exact match in snippet view article find links to article

Weighted Korobov Spaces on Classical and Quantum Computers". Foundations of Computational Mathematics. 4 (2): 121–156. arXiv:quant-ph/0206023. doi:10.1007/s10208-002-0074-6

Offset filtration (1,735 words) [view diff] exact match in snippet view article find links to article

(2022-10-17). "Stability of 2-Parameter Persistent Homology". Foundations of Computational Mathematics. arXiv:2010.09628. doi:10.1007/s10208-022-09576-6. ISSN 1615-3375

Projections onto convex sets (1,118 words) [view diff] exact match in snippet view article find links to article

convergence for alternating and averaged nonconvex projections". Foundations of Computational Mathematics. 9 (4): 485–513. arXiv:0709.0109. doi:10.1007/s10208-008-9036-y

Computer-assisted proof (1,959 words) [view diff] exact match in snippet view article find links to article

computer-assisted application of KAM theory: a modern approach". Foundations of Computational Mathematics. 17 (5): 1123–93. arXiv:1601.00084. doi:10.1007/s10208-016-9339-3

Eitan Tadmor (623 words) [view diff] exact match in snippet view article find links to article

problems (Zürich 1990 and Beijing 1998), and the 2008 Foundations of Computational Mathematics meeting in Hong Kong, and the SIAM invited address at the

Multicover bifiltration (584 words) [view diff] exact match in snippet view article find links to article

(2022-10-17). "Stability of 2-Parameter Persistent Homology". Foundations of Computational Mathematics. arXiv:2010.09628. doi:10.1007/s10208-022-09576-6. ISSN 1615-3375

Finite element exterior calculus (800 words) [view diff] exact match in snippet view article find links to article

element exterior calculus, and problems on hypersurfaces." Foundations of Computational Mathematics 12.3 (2012): 263-293. Hiptmair, Ralf. "Canonical construction

Anders C. Hansen (1,132 words) [view diff] exact match in snippet view article find links to article

Sampling and Infinite-Dimensional Compressed Sensing". Foundations of Computational Mathematics. 16 (5). Springer Science and Business Media LLC: 1263–1323

Ramon E. Moore (559 words) [view diff] exact match in snippet view article find links to article

Computer-Assisted Application of KAM Theory: A Modern Approach", published in Foundations of Computational Mathematics in 2017 (Vol. 17, No. 5, pp. 1123–1193).

Shmuel Friedland (843 words) [view diff] exact match in snippet view article find links to article

uniqueness of best rank one approximation of tensors", Foundations of Computational Mathematics, vol. 14, 2014, pp. 1209–1242. doi:10.1007/s10208-014-9194-z

Interleaving distance (997 words) [view diff] exact match in snippet view article find links to article

Interleaving Distance on Multidimensional Persistence Modules". Foundations of Computational Mathematics. 15 (3): 613–650. arXiv:1106.5305. doi:10.1007/s10208-015-9255-y

Lorenz system (4,381 words) [view diff] exact match in snippet view article find links to article

"A Rigorous ODE Solver and Smale's 14th Problem" (PDF). Foundations of Computational Mathematics. 2 (1): 53–117. CiteSeerX 10.1.1.545.3996. doi:10.1007/s002080010018

Neil Ferguson (epidemiologist) (4,959 words) [view diff] exact match in snippet view article

Retrieved 15 February 2020. "Thematic Program on the Foundations of Computational Mathematics". fields.utoronto.ca – Fields Institute. Retrieved 10 February

Persistence module (2,966 words) [view diff] exact match in snippet view article find links to article

(2022-10-17). "Stability of 2-Parameter Persistent Homology". Foundations of Computational Mathematics. arXiv:2010.09628. doi:10.1007/s10208-022-09576-6. ISSN 1615-3383

Matrix regularization (2,510 words) [view diff] exact match in snippet view article find links to article

(2009). "Exact Matrix Completion via Convex Optimization". Foundations of Computational Mathematics. 9 (6): 717–772. doi:10.1007/s10208-009-9045-5. Zhang;

Factorization of polynomials (4,371 words) [view diff] exact match in snippet view article find links to article

(2017). "The numerical factorization of polynomials". Foundations of Computational Mathematics. 17: 259–286. arXiv:2103.04888. doi:10.1007/s10208-015-9289-1

Random matrix (6,119 words) [view diff] exact match in snippet view article find links to article

"User-Friendly Tail Bounds for Sums of Random Matrices". Foundations of Computational Mathematics. 12 (4): 389–434. arXiv:1004.4389. doi:10.1007/s10208-011-9099-z

Butcher group (4,042 words) [view diff] exact match in snippet view article find links to article

(2015), "The Lie group structure of the Butcher group", Foundations of Computational Mathematics, 17 (1): 127–159, arXiv:1410.4761, doi:10.1007/s10208-015-9285-5

Bayesian quadrature (2,540 words) [view diff] exact match in snippet view article find links to article

kernel-based quadrature rules in misspecified settings". Foundations of Computational Mathematics. 20: 155–194. arXiv:1709.00147. doi:10.1007/s10208-018-09407-7

Shearlet (2,649 words) [view diff] exact match in snippet view article find links to article

Grohs, Philipp and Kutyniok, Gitta. "Parabolic molecules." Foundations of Computational Mathematics (to appear) Grohs, Philipp; Kutyniok, Gitta (2012). "PDF"

Chernoff bound (5,014 words) [view diff] exact match in snippet view article find links to article

"User-friendly tail bounds for sums of random matrices". Foundations of Computational Mathematics. 12 (4): 389–434. arXiv:1004.4389. doi:10.1007/s10208-011-9099-z

Degree-Rips bifiltration (1,396 words) [view diff] exact match in snippet view article find links to article

(2022-10-17). "Stability of 2-Parameter Persistent Homology". Foundations of Computational Mathematics: 3, 8. arXiv:2010.09628. doi:10.1007/s10208-022-09576-6

Matrix Chernoff bound (4,767 words) [view diff] exact match in snippet view article find links to article

"User-friendly tail bounds for sums of random matrices". Foundations of Computational Mathematics. 12 (4): 389–434. arXiv:1004.4389. doi:10.1007/s10208-011-9099-z