Lecture

Eigenvalue Problems: Methods and Applications

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 covers the eigenvalue problem and its decomposition, basics of iterative methods, the power method for eigenvalue estimation, examples of eigenproblems, inverse power methods, Gershgorin circles theorem, Rayleigh quotient method, and numerical solutions for quantum particles in arbitrary potentials. It also discusses the limitations of direct methods compared to iterative methods, convergence properties of the power method, and applications in connectivity networks and Google PageRank(TM) matrix. The lecture concludes with the numerical solution of the Schrödinger equation for quantum particles in arbitrary potentials, emphasizing the importance of iterative methods for solving complex eigenvalue problems.

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Algebra: Linear algebra

Related concepts (32)

Diagonal matrix

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is , while an example of a 3×3 diagonal matrix is. An identity matrix of any size, or any multiple of it (a scalar matrix), is a diagonal matrix. A diagonal matrix is sometimes called a scaling matrix, since matrix multiplication with it results in changing scale (size).

Diagonalizable matrix

In linear algebra, a square matrix is called diagonalizable or non-defective if it is similar to a diagonal matrix, i.e., if there exists an invertible matrix and a diagonal matrix such that , or equivalently . (Such , are not unique.) For a finite-dimensional vector space , a linear map is called diagonalizable if there exists an ordered basis of consisting of eigenvectors of .

Quantum mechanics

Quantum mechanics is a fundamental theory in physics that provides a description of the physical properties of nature at the scale of atoms and subatomic particles. It is the foundation of all quantum physics including quantum chemistry, quantum field theory, quantum technology, and quantum information science. Classical physics, the collection of theories that existed before the advent of quantum mechanics, describes many aspects of nature at an ordinary (macroscopic) scale, but is not sufficient for describing them at small (atomic and subatomic) scales.

Iterative method

In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate solutions for a class of problems, in which the n-th approximation is derived from the previous ones. A specific implementation with termination criteria for a given iterative method like gradient descent, hill climbing, Newton's method, or quasi-Newton methods like BFGS, is an algorithm of the iterative method.

Power iteration

In mathematics, power iteration (also known as the power method) is an eigenvalue algorithm: given a diagonalizable matrix , the algorithm will produce a number , which is the greatest (in absolute value) eigenvalue of , and a nonzero vector , which is a corresponding eigenvector of , that is, . The algorithm is also known as the Von Mises iteration. Power iteration is a very simple algorithm, but it may converge slowly.

Related lectures (64)

Diagonalization of Matrices: Theory and Examples

Covers the theory and examples of diagonalizing matrices, focusing on eigenvalues, eigenvectors, and linear independence.

Eigenvalue Problems: Methods and Applications

Explores eigenvalue problems, iterative methods, convergence properties, and applications in computational physics.

Diagonalization: Theory and Examples

Explores diagonalization of matrices through eigenvalues and eigenvectors, emphasizing distinct eigenvalues and their role in the diagonalization process.

Diagonalization of Linear Transformations

Explains the diagonalization of linear transformations using eigenvectors and eigenvalues to form a diagonal matrix.

Quantum Mechanics: Composite Systems and Angular Momentum