Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.
Official source
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.