Lecture

Matrix Computations: Complexity and Algorithms

Description

This lecture covers the complexity of matrix computations, including the model of computation, stability of algorithms, and variants for structured matrices. It discusses algebraic complexity, known algorithms like Gaussian elimination, and iterative methods such as conjugate gradient. The instructor also explores accurate solutions to ill-conditioned problems and the impact of structured solvers on theoretical computer science.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (35)
Numerical Analysis: Linear Systems
Covers the formulation of linear systems and iterative methods like Richardson, Jacobi, and Gauss-Seidel.
Numerical Analysis: Linear Systems
Covers the analysis of linear systems, focusing on methods such as Jacobi and Richardson for solving linear equations.
Linear Systems: Convergence and Methods
Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.
Characteristic Polynomials and Similar Matrices
Explores characteristic polynomials, similarity of matrices, and eigenvalues in linear transformations.
Matrix Operations: Definitions and Properties
Covers matrix operations, definitions, properties, and vector operations in Rn, essential for understanding linear algebra concepts.
Show more