Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Numerical Derivatives of Order 1

Description

This lecture covers the concept of numerical derivatives of order 1, explaining the position of the problem and the formula for finite differences. It discusses the calculation of derivatives using limits and the importance of choosing a small fixed value for h.

In MOOC

Numerical Analysis for Engineers

Official source

Quiz

Related concepts (18)

Finite difference

A finite difference is a mathematical expression of the form f (x + b) − f (x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the numerical solution of differential equations, especially boundary value problems. The difference operator, commonly denoted is the operator that maps a function f to the function defined by A difference equation is a functional equation that involves the finite difference operator in the same way as a differential equation involves derivatives.

Numerical analysis

Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.

Finite difference method

In numerical analysis, finite-difference methods (FDM) are a class of numerical techniques for solving differential equations by approximating derivatives with finite differences. Both the spatial domain and time interval (if applicable) are discretized, or broken into a finite number of steps, and the value of the solution at these discrete points is approximated by solving algebraic equations containing finite differences and values from nearby points.

Numerical differentiation

In numerical analysis, numerical differentiation algorithms estimate the derivative of a mathematical function or function subroutine using values of the function and perhaps other knowledge about the function. The simplest method is to use finite difference approximations. A simple two-point estimation is to compute the slope of a nearby secant line through the points (x, f(x)) and (x + h, f(x + h)). Choosing a small number h, h represents a small change in x, and it can be either positive or negative.

Numerical integration

In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe the numerical solution of differential equations. This article focuses on calculation of definite integrals. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for numerical integration, especially as applied to one-dimensional integrals.

Related lectures (28)

Numerical Differentiation: Backward and Central Differences

Explores backward and central differences for numerical differentiation, analyzing their properties and error analysis.

Finite Difference Grids

Explains finite difference grids for computing solutions of elastic membranes using Laplace's equation and numerical methods.

Numerical Methods for Boundary Value Problems

Covers numerical methods for solving boundary value problems using finite difference, FFT, and finite element methods.

Numerical Differentiation: Part 1

Covers numerical differentiation, forward differences, Taylor's expansion, Big O notation, and error minimization.

Numerical Methods: Boundary Value Problems