Some past developments in scientific computing Chapter 1 -Lloyd N. Trefethen Introduction 1940-1970 ● Before1940 floating point arithmetic Fortran Newton 's method finite differences Gaussian elimination finite elements Gauss quadrature(求积法) Least-squares fitting simplex algorithm(单纯形算法) Monte carlo Adams and Runge-Kutta formulas FFT Richardson extrapolation orthogonal linear algebra 1970--1998 quasi-Newton iterations multigrid adaptiv Matlab stiff ode solvers interior point methods software libraries spectral methods sparse and iterative linear algebra 应HUSTSome past developments in scientific computing ----Lloyd N. Trefethen •Before 1940 Newton's method Gaussian elimination Gauss quadrature (求积法 Least-squares fitting Adams and Runge-Kutta formulas Richardson extrapolation •1940--1970 floating point arithmetic Fortran finite differences finite elements simplex algorithm 单纯形算法 Monte Carlo FFT orthogonal linear algebra •1970--1998 quasi-Newton iterations multigrid adaptivity Matlab stiff ODE solvers interior point methods software libraries spectral methods sparse and iterative linear algebra