An Introduction to Numerical Analysis: Bibliography
By Endre Süli, D. Mayers. 2003
1,833 citations recorded by the source corpus.
Numerical analysis provides the theoretical foundation for the numerical algorithms we rely on to solve a multitude of computational problems in science. Based on a successful course at Oxford University, this book covers a wide range of such problems ranging from the approximation of functions and integrals to the approximate solution of algebraic, transcendental, differential and integral equations. Throughout the book, particular attention is paid to the essential qualities of a numerical algorithm - stability, accuracy, reliability and efficiency. The authors go further than simply providing recipes for solving computational problems. They carefully analyse the reasons why methods might fail to give accurate answers, or why one method might return an answer in seconds while another would take billions of years. This book is ideal as a text for students in the second year of a university mathematics course. It combines practicality regarding applications with consistently high standards of rigour.
Subfields: History, Sociology and Political Science
View Paper: https://www.semanticscholar.org/paper/9504e205d445767a2dc323e7c0403515019167f4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In History
- Ikjin Lee
- Zi-Cai Li
- Richard I. Hartley
- Cheng-Sheng Chien
- Bin Ning
- Kyung K. Choi
- Martin Vetterli
- Adrian Sandu
In Sociology and Political Science
- Ikjin Lee
- Zi-Cai Li
- Richard I. Hartley
- Cheng-Sheng Chien
- Bin Ning
- Kyung K. Choi
- Martin Vetterli
- Adrian Sandu
Citations in the corpus
- Exponential convergence and H‐c multiquadric collocation method for partial differential equations (2003, background): “However, for interpolation in more than one dimension, the collocation matrix is generally ill-conditioned and often singular, even if only a few collocation points are used [27–29].”
- Error estimate, optimal shape factor, and high precision computation of multiquadric collocation method (2007, neutral): “Atkinson [16].”
- Error estimates of the $\theta$-scheme for backward stochastic differentialequations (2009, positive): “Now using some standard techniques of error estimates for computing numerical integral [30], we can easily get that R y and R z are bounded by C(∆tn) 2 for any θ ∈ [0, 1], in particular, they are bounded by C(∆tn) 3 when θ = 12 .”
- Inverse analysis method using MPP-based dimension reduction for reliability-based design optimization of nonlinear and multi-dimensional systems (2008, methodology): “Using the moment-based integration rule (MBIR) [21], which is similar to Gaussian quadrature [22], Eq.”
- Effective condition number for finite difference method (2007, methodology): “Introduction The definition of the traditional condition number was given in [19] and then used in many books and papers, see [1,2,7,15–17].”
- Optimal trajectory planning for trains – A pseudospectral method and a mixed integer linear programming approach (2013, methodology): “As regards the differential equation of time (12), we approximate it by using a trapezoidal integration rule (Atkinson, 1978): t(k+1) = t(k)+ 1 2 ( 1 √ 2E(k) + 1 √ 2E(k+1) ) ∆sk (38) with t(1) = 0.”
- Lines and Points in Three Views and the Trifocal Tensor (1997, methodology): “We may solve these equations using linear least-squares methods ([19, 2]) to find M ′ = [aj ] and M ′′ = [bj].”