## C program to evaluate the 1st derivative of a function at any given point

Writing C programs for numerical differentiation is interesting and fun. Here is one that I wrote years back. Enjoy! ...

Skip tto content
##
Technology Articles Blog

#
Category: Numerical Analysis

##
C program to evaluate the 1st derivative of a function at any given point

##
Gregory Newton Backward Interpolation Method

##
C Program to evaluate forward difference

##
Reducing Lagranges interpolation formula to Linear interpolation

##
Discussing Convergence of Iteration and Newton Raphson Methods

##
Solving Equations by Jacobi’s Iteration Method

##
Solving a set of equations using Gauss Seidal Elimination Method

##
Finding Inverse of a Matrix using Gauss Elimination Method

##
Gauss Jordan Elimination Method

##
Gauss Elimination Method

##
Finding Roots of equation x3-3×2+x+1=0

##
Find a root of x = e^{-x} using Regular Falsi Method

##
Find a root of x = e^{-x} using Bisection Method

##
Newton Raphson Method Example – Find root of e^{-x} = Sin X

##
Numerical solution of a transcendental equation 1.5x – tanx – 0.1 = 0

##
Numerical solution by method of Iteration

Technology Articles Blog

Writing C programs for numerical differentiation is interesting and fun. Here is one that I wrote years back. Enjoy! ...

Gregory Newton Backward Interpolation Method can be used to derive difference formula when the x values are at equidistant intervals and the value to be...

Below is a C program to evaluate forward difference and thus print a forward difference table for n function values –...

Below is an amazing solution to prove that when n=2, Lagranges interpolation formula reduces to Linear interpolation –...

We use various Numerical methods to solve algebraic and transcendental equations. All these methods converge the result to a single root after various approximations specific...

Jacobi’s Iteration method is an interesting method to solve equations by simple iteration method. Here is an example – ...

Here is an excellent example of Gauss Seidal elimination method to solve a set of equations –...

Here is an intelligent and simple way to find the inverse of a matrix using Gauss Elimination method –...

Here is a well explained solution to solve a set of equations using Gauss Jordan Elimination method –...

Below is a well explained solution for a set of equations using Gauss Elimination method. Enjoy! ...

We will be using Newton Raphson method to find the root of this equation. Enjoy!...

Regular Falsi method is a numerical method to derive the root of a polynomial. The advantage of Regular Falsi over Bisection method is that the convergence...

Bisection method is the most simplest method of solving algebraic or transcendental equations. It involves selecting an interval [a,b] in which the root lies such...

Newton Raphson method is the core in computer Numerical analysis software programs to find root of equations such as e<sup>-x</sup> = Sin X. Complete solution is...

Solving 1.5x – tanx – 0.1 = 0, using iteration method – Iteration is a method of solving algebraic or transcendental equation and is widely used...

Solving x = 1/ (1+x)1/2 using iteration method – Iteration is a method of solving algebraic or transcendental equation and is widely used in computer...