Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Factorization-based Sparse Solvers and Preconditioners - Lecture 3

Society for Industrial and Applied Mathematics via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore factorization-based sparse solvers and preconditioners in this comprehensive lecture by Xiaoye Sherry Li from Lawrence Berkeley National Laboratory. Delve into topics such as minimum degree ordering, greedy algorithms, separator techniques, multilevel intersectional ordering, and numerical pivoting. Learn about the differences between sparse and dense Gaussian elimination, and gain insights into static pivoting methods. Discover practical applications and theoretical foundations of these advanced numerical techniques, supported by relevant references for further study.

Syllabus

Introduction
Minimum degree ordering
Minimum degree
Greed
Minimum Efficiency
Local Greedy Approach
separator
similar analysis
generalization
multilevel intersectional ordering
quartercut order
envelope
non symmetric matrix
bipartite graph
Sparse vs Dense GE
Numerical Pivoting
Static Pivoting
Afternoon Plan
Summary
Sparse GE
References

Taught by

Society for Industrial and Applied Mathematics

Reviews

Start your review of Factorization-based Sparse Solvers and Preconditioners - Lecture 3

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.