Combinatorial scientific computing.
From MaRDI portal
Recommendations
Cited in
(21)- 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
- On the N-spectrum of oriented graphs
- Computation of higher order Lie derivatives on the infinity computer
- scientific article; zbMATH DE number 2152741 (Why is no real title available?)
- Exascale applications: skin in the game
- 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
- Hodge Laplacians on graphs
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Approximation algorithms in combinatorial scientific computing
- Handbook of Parallel Computing
- Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science
- JuMP: a modeling language for mathematical optimization
- Embedded ensemble propagation for improving performance, portability, and scalability of uncertainty quantification on emerging computational architectures
- Geometric and spectral analysis on weighted digraphs
- Fluctuation of the largest eigenvalue of a kernel matrix with application in graphon-based random graphs
- Reduce dimension or reduce weights? Comparing two approaches to multi-arm studies in network meta-analysis
- Numerics and control of conservation laws
- Drug repositioning based on dual multi-graph regularization nonnegative matrix factorization and multi-kernel neural network
- On a Frank-Wolfe approach for abs-smooth functions
This page was built for publication: Combinatorial scientific computing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066084)
