BibSonomyburst/user/ejr/sparsematrixBibSonomy RSS feed for /user/ejr/sparsematrix2012-02-16T15:50:25+01:00http://www.bibsonomy.org/bibtex/2b1452e5000ee8a814a808fa78b404371/ejrejr2007-10-09T07:04:05+02:00bascd combinatorialoptimization parallelalgorithms sparsematrix <span class="authorEditorList"><a href="/author/Riedy">E. Jason Riedy</a> </span><em>Third Bay Area Scientific Computing Day, </em>(<em>March 2002</em>)Tue Oct 09 07:04:05 CEST 2007Livermore, CAThird Bay Area Scientific Computing DayMarchParallel Bipartite Matching for Sparse Matrix Computation2002bascd combinatorialoptimization parallelalgorithms sparsematrix http://www.bibsonomy.org/bibtex/28fbb7d8fa23b56b25d78c3983212f0b2/ejrejr2007-10-09T07:04:05+02:00combinatorialoptimization parallelalgorithms siam sparsematrix <span class="authorEditorList"><a href="/author/Riedy">E. Jason Riedy</a> </span><em>SIAM Conference on Computational Science and Engineering, </em>(<em>February 2003</em>)Tue Oct 09 07:04:05 CEST 2007SIAM Conference on Computational Science and EngineeringFebruaryParallel Bipartite Matching for Sparse Matrix Computations2003combinatorialoptimization parallelalgorithms siam sparsematrix http://www.bibsonomy.org/bibtex/2085769b438cdc56580aefbb09822c749/ejrejr2007-10-09T07:04:05+02:00linearalgebra siam sparsematrix <span class="authorEditorList"><a href="/author/Riedy">E. Jason Riedy</a> </span><em>SIAM Annual Meeting, </em>(<em>June 2003</em>)Tue Oct 09 07:04:05 CEST 2007SIAM Annual MeetingJunePractical Alternatives for Parallel Pivoting2003linearalgebra siam sparsematrix http://www.bibsonomy.org/bibtex/2d943d302329c5f64fa80a2be8b082baa/ejrejr2007-10-09T07:04:05+02:00combinatorialoptimization parallelalgorithms siam sparsematrix <span class="authorEditorList"><a href="/author/Riedy">E. Jason Riedy</a> </span><em>SIAM Parallel Processing for Scientific Computing, </em>(<em>February 2004</em>)Tue Oct 09 07:04:05 CEST 2007SIAM Parallel Processing for Scientific ComputingfebParallel Weighted Bipartite Matching and Applications2004combinatorialoptimization parallelalgorithms siam sparsematrix http://www.bibsonomy.org/bibtex/22ab7af790073ff597819d916da57c4c7/ejrejr2007-10-09T07:04:05+02:00combinatorialoptimization siam sparsematrix <span class="authorEditorList"><a href="/author/Riedy">E. Jason Riedy</a> </span><em>SIAM Workshop on Combinatorial Scientific Computing, </em>(<em>February 2004</em>)Tue Oct 09 07:04:05 CEST 2007SIAM Workshop on Combinatorial Scientific ComputingfebSparse Data Structures for Weighted Bipartite Matching2004combinatorialoptimization siam sparsematrix http://www.bibsonomy.org/bibtex/2415966aedca4cab21a2dcc731ca7f1a0/ejrejr2007-10-09T07:04:05+02:00combinatorialoptimization parallelalgorithms siam sparsematrix <span class="authorEditorList"><a href="/author/Riedy">E. Jason Riedy</a> </span><em>SIAM Conference on Computational Science and Engineering, </em>(<em>February 2005</em>)Tue Oct 09 07:04:05 CEST 2007SIAM Conference on Computational Science and EngineeringfebParallel Combinatorial Computing and Sparse Matrices2005combinatorialoptimization parallelalgorithms siam sparsematrix http://www.bibsonomy.org/bibtex/2078793fd13f8c4998daa31f5a7cb2344/ejrejr2007-10-09T07:04:05+02:00bascd linearalgebra sparsematrix <span class="authorEditorList"><a href="/author/Riedy">E. Jason Riedy</a> </span><em>Seventh Bay Area Scientific Computing Day, </em>(<em>March 2006</em>)Tue Oct 09 07:04:05 CEST 2007Livermore, CASeventh Bay Area Scientific Computing DayMarchMaking Static Pivoting Dependable2006bascd linearalgebra sparsematrix 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.