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.

Graph Chatbot

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.