3 the s approach adopts static symbolic factorization to avoid run time control overhead incorporates 2d l u supernode partitioning and amalgamation strategies to improve caching performance and exploits irregular task parallelism embedded in sparse lu using asynchronous computation scheduling 
