scientific article

zbMath1235.68008MaRDI QIDQ3066084

No author found.

Publication date: 7 January 2011

Full work available at URL: http://www.crcnetbase.com/isbn/9781439827352

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

large-scale optimizationload balancingcombinatorial algorithmscombinatorial scientific computingalgorithmic differentiation of numerical simulation codeparallelization on high-performance computerssparse matrix software tools

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (13)

Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph ⋮ A generic framework for approximation analysis of greedy algorithms for star bicoloring ⋮ Computation of higher order Lie derivatives on the infinity computer ⋮ Geometric and spectral analysis on weighted digraphs ⋮ Hodge Laplacians on Graphs ⋮ A computationally efficient fixed point approach to dynamic structural demand estimation ⋮ Estimating the effect of the reorganization of interactions on the adaptability of species to changing environments ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ Embedded Ensemble Propagation for Improving Performance, Portability, and Scalability of Uncertainty Quantification on Emerging Computational Architectures ⋮ Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ On the N-spectrum of oriented graphs ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Exascale applications: skin in the game

This page was built for publication: