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

Lecture

Phase Plane Analysis

Description

This lecture covers the Phase Plane Analysis of 2-dimensional neuron models, focusing on the role of nullclines and the stability of fixed points. It discusses the graphical analysis enabled by the 2-dimensional equation and the importance of flow arrows.

In MOOC

Neuronal Dynamics - Computational Neuroscience of Single Neurons

Official source

Related concepts (19)

Phase plane

In applied mathematics, in particular the context of nonlinear system analysis, a phase plane is a visual display of certain characteristics of certain kinds of differential equations; a coordinate plane with axes being the values of the two state variables, say (x, y), or (q, p) etc. (any pair of variables). It is a two-dimensional case of the general n-dimensional phase space. The phase plane method refers to graphically determining the existence of limit cycles in the solutions of the differential equation.

Fixed point (mathematics)

hatnote|1=Fixed points in mathematics are not to be confused with other uses of "fixed point", or stationary points where math|1=f(x) = 0. In mathematics, a fixed point (sometimes shortened to fixpoint), also known as an invariant point, is a value that does not change under a given transformation. Specifically for functions, a fixed point is an element that is mapped to itself by the function. Formally, c is a fixed point of a function f if c belongs to both the domain and the codomain of f, and f(c) = c.

Stability theory

In mathematics, stability theory addresses the stability of solutions of differential equations and of trajectories of dynamical systems under small perturbations of initial conditions. The heat equation, for example, is a stable partial differential equation because small perturbations of initial data lead to small variations in temperature at a later time as a result of the maximum principle. In partial differential equations one may measure the distances between functions using Lp norms or the sup norm, while in differential geometry one may measure the distance between spaces using the Gromov–Hausdorff distance.

Fixed-point iteration

In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function defined on the real numbers with real values and given a point in the domain of , the fixed-point iteration is which gives rise to the sequence of iterated function applications which is hoped to converge to a point . If is continuous, then one can prove that the obtained is a fixed point of , i.e., More generally, the function can be defined on any metric space with values in that same space.

Fixed-point theorem

In mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F that can be stated in general terms. The Banach fixed-point theorem (1922) gives a general criterion guaranteeing that, if it is satisfied, the procedure of iterating a function yields a fixed point.

Related lectures (31)

Bistability in Genetic Networks

Explores bistability in genetic networks, analyzing fixed points and stability, phase portraits, and experimental implementation.

Bistability in Cell Cycle

Explores bistability in the cell cycle, emphasizing positive feedback mechanisms and abrupt response transformations.

Analysis of a 2D neuron model: Constant input MOOC: Neuronal Dynamics - Computational Neuroscience of Single Neurons

Explores the behavior of a 2D neuron model with constant input.

Linear Systems in 2D: Stability

Explores stability in linear 2D systems, covering fixed points, vector fields, and phase portraits.

Dynamical Systems: Maps and Stability