Главная
Study mode:
on
1
Introduction
2
Minimum degree ordering
3
Minimum degree
4
Greed
5
Minimum Efficiency
6
Local Greedy Approach
7
separator
8
similar analysis
9
generalization
10
multilevel intersectional ordering
11
quartercut order
12
envelope
13
non symmetric matrix
14
bipartite graph
15
Sparse vs Dense GE
16
Numerical Pivoting
17
Static Pivoting
18
Afternoon Plan
19
Summary
20
Sparse GE
21
References
Description:
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.

Factorization-based Sparse Solvers and Preconditioners - Lecture 3

Society for Industrial and Applied Mathematics
Add to list
0:00 / 0:00