Numerical methods in scientific computing

By G. Dahlquist, Å. Björck. 2008

224 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Earth-Surface Processes

Citations in the corpus

• Improving the Numerical Performance of Static and Dynamic Aggregate Discrete Choice Random Coefficients Demand Estimation by Jean-pierre Dubé, (2012, unknown): “We then use ξt(θ in) to approximate ξt(θ) The contraction mapping theorem (e.g., Dahlquist and Björck (2008)) provides a bound on the error in (5) ∥∥ξh − ξ(θ)∥∥ ≤ ∥∥ξh − ξh−1∥∥ L(θ) 1 −L(θ) ≤ ∥∥ξ1 − ξ0∥∥ L(θ)h 1 −L(θ) The Lipschitz constant,L(θ) characterizes an upper bound involving the number of…”