Lecture

Matrix Functions: Theory and Computation

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture explores the theory and computation of matrix functions, focusing on computing f(A) and particularly e^A. The instructor discusses the reasons for wanting f(A), different methods to define f(A) including diagonalization, polynomial interpolation, and contour integrals, and various approaches to compute f(A) such as the Schur-Parlett algorithm, polynomial and rational approximation, and discretized contour integrals. Special attention is given to the matrix exponential e^A, detailing ODE methods, scaling-and-squaring technique, contour integrals, and rational approximations. Common examples of matrix functions like the matrix exponential, sign function, square root, and power are also covered, along with applications in semidefinite programming and random walks.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Matrix exponential

In mathematics, the matrix exponential is a matrix function on square matrices analogous to the ordinary exponential function. It is used to solve systems of linear differential equations. In the theory of Lie groups, the matrix exponential gives the exponential map between a matrix Lie algebra and the corresponding Lie group. Let X be an n×n real or complex matrix. The exponential of X, denoted by eX or exp(X), is the n×n matrix given by the power series where is defined to be the identity matrix with the same dimensions as .

Analytic function of a matrix

In mathematics, every analytic function can be used for defining a matrix function that maps square matrices with complex entries to square matrices of the same size. This is used for defining the exponential of a matrix, which is involved in the closed-form solution of systems of linear differential equations. There are several techniques for lifting a real function to a square matrix function such that interesting properties are maintained. All of the following techniques yield the same matrix function, but the domains on which the function is defined may differ.

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

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).

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Related lectures (64)

Diagonalization: Eigenvectors and Eigenvalues

Covers the diagonalization of matrices using eigenvectors and eigenvalues.

Diagonalization of Matrices

Explores the diagonalization of matrices through eigenvalues and eigenvectors, emphasizing the importance of bases and subspaces.

Linear Algebra: Matrices Properties

Explores properties of 3x3 matrices with real coefficients and determinant calculation methods.

Diagonalization of Linear Transformations

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

Diagonalization of Matrices: Theory and Examples