logo

Fundamentals of Numerical Computation

  • Home
  • Introduction
  • Square linear systems
  • Overdetermined linear systems
  • Roots of nonlinear equations
  • Piecewise interpolation
  • Initial-value problems for ODEs
  • Review: Linear algebra
  • All demo notebooks
    • Chapter 1 (Introduction)
    • Chapter 2 (Linear systems)
    • Chapter 3 (Least squares)
    • Chapter 4 (Rootfinding)
      • Roots of Bessel functions
      • Conditioning of roots
      • Fixed point iteration
      • Convergence of fixed point iteration
      • The idea of Newton’s method
      • Convergence of Newton’s method
      • Usage of newton
      • Using the secant line
      • Convergence of the secant method
      • Inverse quadratic interpolation
      • The Newton idea for systems
      • Usage of newtonsys
      • Using levenberg
      • Michaelis–Menten fitting
    • Chapter 5 (Piecewise)
    • Chapter 6 (IVPs)
  • References
  • Index
Powered by Jupyter Book

Chapter 4 (Rootfinding)¶

  • Roots of Bessel functions

  • Conditioning of roots

  • Fixed point iteration

  • Convergence of fixed point iteration

  • The idea of Newton’s method

  • Convergence of Newton’s method

  • Usage of newton

  • Using the secant line

  • Convergence of the secant method

  • Inverse quadratic interpolation

  • The Newton idea for systems

  • Usage of newtonsys

  • Using levenberg

  • Michaelis–Menten fitting

Householder QR Roots of Bessel functions

By Tobin A. Driscoll and Richard J. Braun
© Copyright 2020.