## Python – Legendre polynomials using Recursion relation

Legendre polynomials are a type of orthogonal polynomials which occur often in science and engineering. Hence, their generation is crucial to those fields. There are… Read More »

Legendre polynomials are a type of orthogonal polynomials which occur often in science and engineering. Hence, their generation is crucial to those fields. There are… Read More »

An integer p greater than one is prime iff the only divisors of p are 1 and p. First few prime numbers are 2, 3,… Read More »

The hyperbolic cosine function is defined to be: cosh(x) = (ex + e-x)/2 And the hyperbolic sine function is defined as: sinh(x) = (ex -… Read More »

There are two types of second order linear differential equations: Homogeneous Equations, and Non-Homogeneous Equations. Homogeneous Equations: General Form of Equation: These equations are of… Read More »

One of the major problems that engineers face is the problem of optimization of a certain function. Mathematics provides us with a beautiful way to… Read More »

Interpolation refers to the process of creating new data points given within the given set of data. The below code computes the desired data point… Read More »

Prerequisite – Group Finite Group: A group of finite number of elements is called a finite group. Order of a finite group is finite. Examples:… Read More »

Prerequisite – Canonical and Standard Form In the below articles, we will see some varieties of problems with three variables. Statement-1: Counting the number of… Read More »

The Picard’s method is an iterative method and is primarily used for approximating solutions to differential equations. This method of solving a differential equation approximately… Read More »

Given a positive integer N, the task is to count the numbers that can be represented with N bits and whose 0th and Nth bits… Read More »

The Gauss Seidel method is an iterative process to solve a square system of (multiple) linear equations. It is also prominently known as ‘Liebmann’ method.… Read More »

Determinant of a Matrix is a scalar property of that Matrix. Determinant is a special number that is defined for only square matrices (plural for… Read More »

Prerequisite – Rough Set Theory The main goal of the rough set analysis is the induction of approximations of concepts. Rough sets constitute a sound… Read More »

The Concept of derivative can be used to find the maximum and minimum value of the given function. We know that information about and gradient… Read More »

Cayley Table – If G is a finite group with the operation *, the Cayley table of G is a table with rows and columns… Read More »