Numerical analysis with algorithms and programming (Q2797121)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Numerical analysis with algorithms and programming |
scientific article; zbMATH DE number 6562785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical analysis with algorithms and programming |
scientific article; zbMATH DE number 6562785 |
Statements
4 April 2016
0 references
numerical methods
0 references
Mathematica programming
0 references
textbook
0 references
stability
0 references
conditioning
0 references
convergence
0 references
real roots
0 references
bisection method
0 references
regula-falsi method
0 references
fixed-point iteration
0 references
Newton-Raphson method
0 references
secant method
0 references
Newton's method
0 references
nonlinear equations
0 references
forward differences
0 references
backward differences
0 references
central differences
0 references
divided differences
0 references
cubic spline
0 references
interpolation
0 references
Newton-Cotes quadrature
0 references
Richardson extrapolation
0 references
Romberg integration
0 references
Gauss quadrature
0 references
Lobatto quadrature
0 references
Euler-Maclaurin formula
0 references
system of linear algebraic equations
0 references
direct method
0 references
Gauss elimination
0 references
iterative methods
0 references
Gauss-Jacobi
0 references
Gauss-Seidel
0 references
successive overrelaxation
0 references
single-step methods
0 references
Runge-Kutta methods
0 references
multistep methods
0 references
Adam-Bashforth-Moulton
0 references
Milne
0 references
Nyström
0 references
boundary value problems
0 references
finite difference
0 references
shooting
0 references
collocation
0 references
Galerkin methods
0 references
eigenvalues
0 references
Householder's method
0 references
QR method
0 references
power method
0 references
Jacobi's method
0 references
Givens method
0 references
least squares curve fitting
0 references
orthogonal polynomials
0 references
B-splines
0 references
Padé approximation
0 references
Crank-Nicolson implicit method
0 references
parabolic equations
0 references
hyperbolic equations
0 references
elliptic equations
0 references
Laplace equation
0 references
alternating direction implicit method
0 references
finite element
0 references
Rayleigh-Ritz method
0 references
Galerkin method
0 references
Numerical analysis with algorithms and programming (English)
0 references
This book is an introduction to numerical methods for science and engineering. Mathematica program listings are provided at the end of almost every method. Chapter 1 presents the various kinds of possible errors in a problem, with the concept of stability, conditioning and convergence of numerical methods. Chapter 2 considers the computation of real roots of algebraic and transcendental equations including the bisection method, regula-falsi method, fixed-point iteration, Newton-Raphson method, secant method, and the Newton's method for simultaneous nonlinear equations. Chapter 3 covers the interpolation formulas of forward differences, backward differences, central differences, divided differences, Lagrange, Hermite, cubic spline, and interpolation by iteration. Chapter 4 discusses the Newton, Stirling, Bessel and Lagrange interpolation formula for numerical differentiation. Chapter 5 presents the numerical integration by using Newton-Cotes quadrature formula, Richardson extrapolation, Romberg integration, Gauss quadrature, Lobatto quadrature, as well as the Bernoulli polynomials and Euler-Maclaurin formula for double integration. Chapter 6 covers the numerical methods in solving systems of linear algebraic equations by using the direct method of Gauss elimination, iterative methods of Gauss-Jacobi, Gauss-Seidel and the successive overrelaxation method. Chapter 7 is devoted to the numerical solutions and stability analysis of ordinary differential equations by using single-step methods of Picard, Taylor`s series, Euler, Runge-Kutta methods, and multistep methods of Adam-Bashforth-Moulton, Milne and Nyström. Systems of ordinary differential equations are solved by Runge-Kutta methods, boundary value problems by the finite difference, shooting, collocation and Galerkin methods. Chapter 8 includes the determination of eigenvalues of a square matrix by the Householder's method, QR method, power method, Jacobi's method and Givens method. Chapter 9 deals with the approximation of functions by least squares curve fitting, orthogonal polynomials, minimax polynomial approximation, B-splines and Padé approximation. Chapter 10 introduces the explicit finite difference method and Crank-Nicolson implicit method for parabolic partial differential equations, explicit central difference method and implicit finite difference method for hyperbolic partial differential equations, finite difference methods for elliptic partial differential equations, the successive overrelaxation method for solving the Laplace equation, and an alternating direction implicit method for the two-dimensional parabolic partial differential equations. Chapter 11 gives a brief introduction to the construction of finite element approximations by the Rayleigh-Ritz method and the Galerkin method.
0 references