default search action
SIAM Review, Volume 61
Volume 61, Number 1, 2019
- Jesús María Sanz-Serna:
Survey and Review. 1 - Martin J. Gander, Hui Zhang:
A Class of Iterative Solvers for the Helmholtz Equation: Factorizations, Sweeping Preconditioners, Source Transfer, Single Layer Potentials, Polarized Traces, and Optimized Schwarz Methods. 3-76 - Misha E. Kilmer:
Research Spotlights. 77 - Simone Carlo Surace, Anna Kutschireiter, Jean-Pascal Pfister:
How to Avoid the Curse of Dimensionality: Scalability of Particle Filters with and without Importance Weights. 79-91 - Peter G. Fennell, James P. Gleeson:
Multistate Dynamical Processes on Networks: Analysis through Degree-Based Approximation Frameworks. 92-118 - SIGEST. 119
- Eddie Nijholt, Bob Rink, Jan A. Sanders:
Center Manifolds of Coupled Cell Networks. 121-155 - Darinka Dentcheva:
Education. 157-158 - Gjerrit Meinsma:
Dimensional and Scaling Analysis. 159-184 - Silviu-Ioan Filip, Aurya Javeed, Lloyd N. Trefethen:
Smooth Random Functions, Random ODEs, and Gaussian Processes. 185-205 - Volker H. Schulz:
Book Reviews. 209-225
Volume 61, Number 2, 2019
- Jesús María Sanz-Serna:
Survey and Review. 227 - Guodong Shi, Claudio Altafini, John S. Baras:
Dynamics over Signed Networks. 229-257 - Misha E. Kilmer:
Research Spotlights. 259 - Beate Ehrhardt, Patrick J. Wolfe:
Network Modularity in the Presence of Covariates. 261-276 - Dan Wilson, Bard Ermentrout:
Augmented Phase Reduction of (Not So) Weakly Perturbed Coupled Oscillators. 277-315 - SIGEST. 317
- Bernhard Beckermann, Alex Townsend:
Bounds on the Singular Values of Matrices with Displacement Structure. 319-344 - Darinka Dentcheva:
Education. 345-346 - Samuel Awoniyi, Ira Wheaton:
Case for First Courses on Finite Markov Chain Modeling to Include Sojourn Time Cycle Chart. 347-360 - Richard D. Neidinger:
Multivariate Polynomial Interpolation in Newton Forms. 361-381 - Volker H. Schulz:
Book Reviews. 385-400
Volume 61, Number 3, 2019
- Jesús María Sanz-Serna:
Survey and Review. 401 - Johan S. H. van Leeuwaarden, Britt W. J. Mathijsen, Bert Zwart:
Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin-Whitt Heavy-Traffic Regime. 403-440 - Misha E. Kilmer:
Research Spotlights. 441 - Ben Adcock, Daan Huybrechs:
Frames and Numerical Approximation. 443-473 - Jie Shen, Jie Xu, Jiang Yang:
A New Class of Efficient and Robust Energy Stable Schemes for Gradient Flows. 474-506 - SIGEST. 507
- Tim J. Dodwell, Christian Ketelsen, Robert Scheichl, Aretha L. Teckentrup:
Multilevel Markov Chain Monte Carlo. 509-545 - Darinka Dentcheva:
Education. 547-548 - Arjun S. Ramani, Nicole Eikmeier, David F. Gleich:
Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities. 549-595 - Roger Allan Cropp, John Norbury:
Obligate Mutualism in a Resource-Based Framework. 596-622 - Volker H. Schulz:
Book Reviews. 625-640
Volume 61, Number 4, 2019
- Jesús María Sanz-Serna:
Survey and Review. 641 - Olga Y. Kushel:
Unifying Matrix Stability Concepts with a View to Applications. 643-729 - Misha E. Kilmer:
Research Spotlights. 731 - Leslie Greengard, Shidong Jiang:
A New Mixed Potential Representation for Unsteady, Incompressible Flow. 733-755 - Jon Cockayne, Chris J. Oates, Timothy John Sullivan, Mark A. Girolami:
Bayesian Probabilistic Numerical Methods. 756-789 - SIGEST. 791
- Guo Luo, Thomas Y. Hou:
Formation of Finite-Time Singularities in the 3D Axisymmetric Euler Equations: A Numerics Guided Study. 793-835 - Darinka Dentcheva:
Education. 837-838 - Gábor Pataki:
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs. 839-859 - Catherine F. Higham, Desmond J. Higham:
Deep Learning: An Introduction for Applied Mathematicians. 860-891 - Volker H. Schulz:
Book Reviews. 895-906
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.