Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science

DOI10.1007/978-3-540-71351-7_21zbMath1177.65208MaRDI QIDQ5503798

Publication date: 20 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71351-7_21

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis

65F10: Iterative numerical methods for linear systems

65Y05: Parallel numerical computation

65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

68-02: Research exposition (monographs, survey articles) pertaining to computer science

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

65M50: Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs

65F05: Direct numerical methods for linear systems and matrix inversion

92-08: Computational methods for problems pertaining to biology

65Y99: Computer aspects of numerical algorithms

65Z99: Applications to the sciences