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

Lecture

Spectral Properties of Non-negative Matrices

In course

ME-427: Networked control systems

This course offers an introduction to control systems using communication networks for interfacing sensors, actuators, controllers, and processes. Challenges due to network non-idealities and opportunities offered by communication will be analyzed. ...

Description

This lecture covers the spectral properties of non-negative matrices, including definitions of primitive and irreducible matrices, Perron-Frobenius theorem, and the interpretation of eigenvectors. It also discusses the periodicity of digraphs and their relation to matrix properties.

Instructor

Giancarlo Ferrari Trecate

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Eigenvalues and eigenvectors

In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.

Matrix (mathematics)

In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a " matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra.

Generalized eigenvector

In linear algebra, a generalized eigenvector of an matrix is a vector which satisfies certain criteria which are more relaxed than those for an (ordinary) eigenvector. Let be an -dimensional vector space and let be the matrix representation of a linear map from to with respect to some ordered basis. There may not always exist a full set of linearly independent eigenvectors of that form a complete basis for . That is, the matrix may not be diagonalizable.

Definite matrix

In mathematics, a symmetric matrix with real entries is positive-definite if the real number is positive for every nonzero real column vector where is the transpose of . More generally, a Hermitian matrix (that is, a complex matrix equal to its conjugate transpose) is positive-definite if the real number is positive for every nonzero complex column vector where denotes the conjugate transpose of Positive semi-definite matrices are defined similarly, except that the scalars and are required to be positive or zero (that is, nonnegative).

Diagonally dominant matrix

In mathematics, a square matrix is said to be diagonally dominant if, for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. More precisely, the matrix A is diagonally dominant if where aij denotes the entry in the ith row and jth column. This definition uses a weak inequality, and is therefore sometimes called weak diagonal dominance. If a strict inequality (>) is used, this is called strict diagonal dominance.

Related lectures (41)

Diagonalization of Linear Transformations

Covers the diagonalization of linear transformations in R^3, exploring properties and examples.

Spectral Theorem Recap

Revisits the spectral theorem for symmetric matrices, emphasizing orthogonally diagonalizable properties and its equivalence with symmetric bilinear forms.

Non-Negative Definite Matrices and Covariance Matrices

Covers non-negative definite matrices, covariance matrices, and Principal Component Analysis for optimal dimension reduction.

Matrix Computations: Eigenvalues and Eigenvectors

Explores the complexity of matrix computations, focusing on eigenvalues and eigenvectors of symmetric matrices and the challenges in computing them.

Characteristic Polynomials and Similar Matrices Log in to Mediaspace to watch this video