Factorization-based Sparse Solvers and Preconditioners - Lecture 3

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.

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