A First Course in the Numerical Analysis of Differential Equations: Gaussian elimination for sparse linear equations
By Arieh Iserles. 2008
206 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/ea0a3de6408afeb47b1154a86e8ec9d242e9eef7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Tri Dao
- Albert Gu
- Christopher R'e
- Jimmy Smith
- Stefano Ermon
- Atri Rudra
- Nicholas Geneva
- Andrew Warrington
Citations in the corpus
- HiPPO: Recurrent Memory with Optimal Polynomial Projections (2020, methodology): “8The LMU is only known to be fast with the simple forward Euler discretization [71], but not with more sophisticated methods such as bilinear and ZOH that are required to reduce numerical errors for this task.”
- Introduction to Numerical Methods in Differential Equations (2006, background): “This is not pursued here, because the matrix approach is limited in its applicability to other types of partial differential equations, specifically, wave equations, and an interesting discussion of this can be found in Iserles [1996]. There is a third approach one can use for establishing stability”
- Modeling the Dynamics of PDE Systems with Physics-Constrained Deep Auto-Regressive Networks (2019, background): “Alternatively, when predicting large time-steps with implicit methods the discrete time integration can become the primary source of error due to numerical diffusion [43].”
- Simplified State Space Layers for Sequence Modeling (2022, methodology): “We refer the reader to Iserles [25] for more information on discretization methods.”