# Picards Method C Program

By | June 25, 2017

Let us understand the concept of Picards Method in numerical analysis and learn how to implement Picard’s method in C programming language.

#### What is Picard’s Method?

The Picard’s method is an iterative method and is primarily used for approximating solutions to differential equations.

The Picard’s iterative method gives a sequence of approximations Y1(x),  Y2(x), ….., Yk(x) to the solution of differential equations such that the nth approximation is obtained from one or more previous approximations.

The Picard’s iterative series is very easy to implement and the solutions obtained through this numerical analysis are generally power series.

#### Picard’s Iteration Example

Initial Value: 20
End Value: 40
Allowed Error: 0.5
X = 20.000
Y(1) = 202518.2917
Y(2) = 42001177.1458
Y(3) = 1569554.333

Note: This C program for Picard’s method is compiled using CodeLite IDE with GNU GCC compiler on Microsoft Windows 10 operating system. However, this Picard’s method C program is compatible with all other operating systems.

#### Output

If you have any doubts about the implementation of Picards’s method in C programming, let us know about it in the comment section. Find more about it on MathForum.

NUMERICAL METHODS C PROGRAMS
Newton-Raphson Method C Program
Weddle’s Rule Algorithm C Program
Euler’s Method C Program
Secant Method C Program
Bisection Method C Program
Gauss Seidel Method C Program
Simpson’s 3/8th Rule C Program
Regula Falsi Method C Program
Bisection Method Algorithm and Flowchart
Simpson’s 1/3rd Rule C Program
Trapezoidal Rule C Program

## 2 thoughts on “Picards Method C Program”

1. Akshay Diwakar

Thank you so much for c code for Picards numerical method. I couldnt find it in much places.

2. Jaya

But here we input the function as well as its integral by hand is there any way to make the program general so that it can calculate it by itself