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

Lecture

Stability of fixed points

Description

This lecture covers the stability analysis of fixed points in two-dimensional neuron models, focusing on determining stability using Eigenvalues and linearized equations. The instructor discusses the concepts of stable, saddle, and unstable fixed points.

In MOOC

Neuronal Dynamics - Computational Neuroscience of Single Neurons

Official source

Related concepts (18)

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.

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.

Kakutani fixed-point theorem

In mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex, compact subset of a Euclidean space to have a fixed point, i.e. a point which is mapped to a set containing it. The Kakutani fixed point theorem is a generalization of the Brouwer fixed point theorem. The Brouwer fixed point theorem is a fundamental result in topology which proves the existence of fixed points for continuous functions defined on compact, convex subsets of Euclidean spaces.

System of linear equations

In mathematics, a system of linear equations (or linear system) is a collection of one or more linear equations involving the same variables. For example, is a system of three equations in the three variables x, y, z. A solution to a linear system is an assignment of values to the variables such that all the equations are simultaneously satisfied. A solution to the system above is given by the ordered triple since it makes all three equations valid. The word "system" indicates that the equations should be considered collectively, rather than individually.

Related lectures (37)

Linear Systems in 2D: Stability

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

Fixed Points and Stability

Explores fixed points and their stability in dynamic systems, emphasizing linear stability analysis.

Dynamic Systems: Course Review

Covers dynamic systems, trajectories, growth models, stability of fixed points, and linearization of models.

Dynamic Systems: Formalism and Bases

Covers the formalism and bases of dynamic systems, including differential equations and non-linear systems.

Phase Portraits and Predator-Prey Models