09061 Abstracts Collection -- Combinatorial Scientific Computing : Dagstuhl Seminar

From 01.02.2009 to 06.02.2009, the Dagstuhl Seminar 09061 Combinatorial Scienti c Computing was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

[1]  CambazogluBerkant Barla,et al.  Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured Grids , 2007 .

[2]  John D. Ramsdell,et al.  Estimation of Sparse Jacobian Matrices , 1983 .

[3]  Timothy A. Davis,et al.  Direct methods for sparse linear systems , 2006, Fundamentals of algorithms.

[4]  Alex Pothen,et al.  What Color Is Your Jacobian? Graph Coloring for Computing Derivatives , 2005, SIAM Rev..

[5]  Ümit V. Çatalyürek,et al.  Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[6]  Andreas Griewank,et al.  Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition , 2000, Frontiers in applied mathematics.

[7]  Andreas Griewank,et al.  Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO) , 2009, Combinatorial Scientific Computing.

[8]  Uwe Naumann,et al.  Call Tree Reversal is NP-Complete , 2008 .

[9]  Yousef Saad,et al.  Multilevel Preconditioners Constructed From Inverse-Based ILUs , 2005, SIAM J. Sci. Comput..

[10]  Berkant Barla Cambazoglu,et al.  Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids , 2007, J. Parallel Distributed Comput..

[11]  Olaf Schenk,et al.  Inertia-Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization , 2008, SIAM J. Sci. Comput..

[12]  Fred Wubs,et al.  Numerically stable LDLT-factorization of F-type saddle point matrices , 2008 .

[13]  Jennifer A. Scott,et al.  Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix , 2006, SIAM J. Matrix Anal. Appl..

[14]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[15]  Rudolf A. Römer,et al.  On Large-Scale Diagonalization Techniques for the Anderson Model of Localization , 2006, SIAM J. Sci. Comput..

[16]  Berkant Barla Cambazoglu,et al.  Ieee Transactions on Parallel and Distributed Systems Hypergraph-partitioning-based Remapping Models for Image-space-parallel Direct Volume Rendering of Unstructured Grids Ieee Transactions on Parallel and Distributed Systems , 2022 .

[17]  J. Utke,et al.  On the Practical Exploitation of Scarsity , 2008 .