Lecture
Thomas algorithm, accuracy of direct methods
Description
This lecture covers the Thomas algorithm for solving tridiagonal systems and the accuracy of direct methods in numerical computations, focusing on the LU factorization. It discusses the spectral radius, conditioning number, and error analysis, emphasizing the importance of round-off errors in numerical solutions.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on MediaspaceOfficial 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.
Ontological neighbourhood
Related lectures (62)
Direct Methods for Linear Systems of Equations
Explores direct methods for solving linear systems of equations, including Gauss elimination and LU decomposition.
Cholesky Factorization: Theory and Algorithm
Explores the Cholesky factorization method for symmetric positive definite matrices.
Finite Elements: Elasticity and Variational Formulation
Explores finite element methods for elasticity problems and variational formulations, emphasizing admissible deformations and numerical implementations.
Runge-Kutta Methods: Approximating Differential Equations
Covers the stages of the explicit Runge-Kutta method for approximating y(t) with detailed explanations.
Floating Point Numbers: LU Decomposition and Errors
Explores floating point numbers, LU decomposition, errors, and matrix properties.