#### Discretization in time

**Temporal discretization** is a mathematical technique applied to transient problems that occur in the fields of applied physics and engineering.

Transient problems are often solved by conducting simulations using computer-aided engineering (CAE) packages, which require discretizing the governing equations in both space and time. Such problems are unsteady (e.g. flow problems), and therefore require solutions in which position varies as a function of time. Temporal discretization involves the integration of every term in different equations over a time step (Δ*t*).

The spatial domain can be discretized to produce a semi-discrete form:

If the discretization is done using backward differences, the first-order temporal discretization is given as:

And the second-order discretization is given as:

where

*φ*= a scalar quantity.

*n*+ 1 = value at the next time level,*t*+ Δ*t*.

*n*= value at the current time level,*t*.

*n*− 1 = value at the previous time level,*t*− Δ*t*.

The function F() is evaluated using implicit- and explicit-time integration.

**Methods for evaluating function F()
**After discretizing the time derivative, function F({\displaystyle \varphi }) remains to be evaluated. The function is now evaluated using implicit and explicit-time integration.

**Implicit-time integration**

This methods evaluates the function F(phi ) at a future time.

**Explicit-time integration**

This methods evaluates the function F(phi ) at the current time.

#### Semi-Implicit Method for Pressure Linked Equations

In computational fluid dynamics (CFD), the **SIMPLE algorithm** is a widely used numerical procedure to solve the Navier-Stokes equations. *SIMPLE* is an acronym for Semi-Implicit Method for Pressure Linked Equations.

The SIMPLE algorithm was developed by Prof. Brian Spalding and his student Suhas Patankar at Imperial College, London in the early 1970s. Since then it has been extensively used by many researchers to solve different kinds of fluid flow and heat transfer problems.^{}^{}

Many popular books on computational fluid dynamics discuss the SIMPLE algorithm in detail.^{}^{} A modified variant is the *SIMPLER* algorithm (SIMPLE Revised), that was introduced by Patankar in 1979.^{}

The algorithm is iterative. The basic steps in the solution update are as follows:

#### Splitting Fluid PDE

- Alternating direction implicit method — finite difference method for parabolic, hyperbolic, and elliptic partial differential equations
- GRADELA — simple gradient elasticity model
- Matrix splitting — general method of splitting a matrix operator into a sum or difference of matrices
- Paul Tseng — resolved question on convergence of matrix splitting algorithms
- PISO algorithm — pressure-velocity calculation for Navier-Stokes equations
- Projection method (fluid dynamics) — computational fluid dynamics method
- Reactive transport modeling in porous media — modeling of chemical reactions and fluid flow through the Earth’s crust
- Richard S. Varga — developed matrix splitting
- Strang splitting — specific numerical method for solving differential equations using operator splitting

#### Courant–Friedrichs–Lewy condition

The principle behind the condition is that, for example, if a wave is moving across a discrete spatial grid and we want to compute its amplitude at discrete time steps of equal duration, then this duration must be less than the time for the wave to travel to adjacent grid points. As a corollary, when the grid point separation is reduced, the upper limit for the time step also decreases. In essence, the numerical domain of dependence of any point in space and time (as determined by initial conditions and the parameters of the approximation scheme) must include the analytical domain of dependence (wherein the initial conditions have an effect on the exact value of the solution at that point) to assure that the scheme can access the information required to form the solution.