%0 Generic %1 bascd2006-poster %A Riedy, E. Jason %C Livermore, CA %D 2006 %K bascd linearalgebra sparsematrix %T Making Static Pivoting Dependable %U http://purl.oclc.org/NET/jason-riedy/resume/material/bascd2006-poster.pdf %X For sparse LU factorization, dynamic pivoting tightly couples symbolic and numerical computation. Dynamic structural changes limit parallel scalability. Demmel and Li use static pivoting in distributed SuperLU for performance, but intentionally perturbing the input may lead silently to erroneous results. Are there experimentally stable static pivoting heuristics that lead to a dependable direct solver? The answer is currently a qualified yes. Current heuristics fail on a few systems, but all failures are detectable.

@misc{bascd2006-poster, abstract = {For sparse LU factorization, dynamic pivoting tightly couples symbolic and numerical computation. Dynamic structural changes limit parallel scalability. Demmel and Li use static pivoting in distributed SuperLU for performance, but intentionally perturbing the input may lead silently to erroneous results. Are there experimentally stable static pivoting heuristics that lead to a dependable direct solver? The answer is currently a qualified yes. Current heuristics fail on a few systems, but all failures are detectable. }, added-at = {2007-10-09T07:04:05.000+0200}, address = {Livermore, CA}, author = {Riedy, E. Jason}, biburl = {https://www.bibsonomy.org/bibtex/2078793fd13f8c4998daa31f5a7cb2344/ejr}, howpublished = {Seventh Bay Area Scientific Computing Day}, interhash = {badb869003645347152adf42bb627fb0}, intrahash = {078793fd13f8c4998daa31f5a7cb2344}, keywords = {bascd linearalgebra sparsematrix}, month = {March}, role = {poster}, timestamp = {2007-10-09T07:06:15.000+0200}, title = {Making Static Pivoting Dependable}, url = {http://purl.oclc.org/NET/jason-riedy/resume/material/bascd2006-poster.pdf}, year = 2006 }