What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
From MaRDI portal
(Redirected from Publication:5713152)
Recommendations
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- Computing a sparse Jacobian matrix by rows and columns
- ColPack, software for graph coloring and related problems in scientific computing
- Estimation of sparse hessian matrices and graph coloring problems
- Full and partial Jacobian computation vie graph coloring: Algorithms and applications.
Cited in
(83)- Graph coloring by multiagent fusion search
- The independent set perturbation method for efficient computation of sensitivities with applications to data assimilation and a finite element shallow water model
- Developments on the Broyden procedure to solve nonlinear problems arising in CFD
- Asynchronous partial update of the restricted additive Schwarz preconditioner to solve nonlinear CFD problems
- An aerodynamic design optimization framework using a discrete adjoint approach with OpenFOAM
- Star coloring of certain graph classes
- CasADi: a software framework for nonlinear optimization and optimal control
- A highly parallel implicit domain decomposition method for the simulation of the left ventricle on unstructured meshes
- Acyclic improper colouring of graphs with maximum degree 4
- Star colouring of bounded degree graphs and regular graphs
- An entropy-stable discontinuous Galerkin approximation of the Spalart-Allmaras turbulence model for the compressible Reynolds averaged Navier-Stokes equations
- The complexity of restricted star colouring
- Analysis of driving styles of a GP2 car via minimum lap-time direct trajectory optimization
- PetIGA: a framework for high-performance isogeometric analysis
- Design optimization for self-propulsion of a bulk carrier hull using a discrete adjoint method
- Simple decentralized graph coloring
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems
- The method of coloring in graphs and its application
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- Coloring squares of planar graphs with maximum degree at most five
- \texttt{HORSES3D}: a high-order discontinuous Galerkin solver for flow simulations and multi-physics applications
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
- Algorithmic differentiation of numerical methods: tangent and adjoint solvers for parameterized systems of nonlinear equations
- Efficient matching for column intersection graphs
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
- A polyhedral investigation of star colorings
- Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- The independent set perturbation adjoint method: a new method of differentiating mesh-based fluids models
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization
- Planarization and acyclic colorings of subcubic claw-free graphs
- Low-rank update of the restricted additive Schwarz preconditioner for nonlinear systems
- Coloring the square of a sparse graph G with almost (G) colors
- ColPack, software for graph coloring and related problems in scientific computing
- Star chromatic bounds
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- CsegGraph: a graph colouring instance generator
- Estimation of sparse hessian matrices and graph coloring problems
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Computing a sparse Jacobian matrix by rows and columns
- A framework for scalable greedy coloring on distributed-memory parallel computers
- Combining partial Jacobian computation and preconditioning. New heuristics, educational modules, and applications
- Full and partial Jacobian computation vie graph coloring: Algorithms and applications.
- On efficient Hessian computation using the edge pushing algorithm in Julia
- Pattern graph for sparse Hessian matrix
- Bound constrained interval global optimization in the COCONUT environment
- A probing method for computing the diagonal of a matrix inverse.
- Adjoint Code Design Patterns
- \texttt{PETSc TSAdjoint}: a discrete adjoint ODE solver for first-order and second-order sensitivity analysis
- A generic framework for approximation analysis of greedy algorithms for star bicoloring
- Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- Approximation algorithms in combinatorial scientific computing
- Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations
- Efficient detection of Hessian matrix sparsity pattern
- Fast reverse-mode automatic differentiation using expression templates in C++
- On the recursive largest first algorithm for graph colouring
- Computing the sparsity pattern of Hessians using automatic differentiation
- Solving nonlinear equations with the Newton-Krylov method based on automatic differentiation
- A polyhedral study of the acyclic coloring problem
- Higher-order reverse automatic differentiation with emphasis on the third-order
- The complexity of star colouring in bounded degree graphs and regular graphs
- A supernodal formulation of vertex colouring with applications in course timetabling
- Hardness transitions and uniqueness of acyclic colouring
- Acyclic and star colorings of cographs
- Approximating Hessians in unconstrained optimization arising from discretized problems
- A matrix-free exact Newton method
- Star colouring of regular graphs meets weaving and line graphs
- SAT encoding of partial ordering models for graph coloring problems
- Hardness transitions of star colouring and restricted star colouring
- Surrogate models for vibrational entropy based on a spatial decomposition
- NonlinearSolve.jl: high-performance and robust solvers for systems of nonlinear equations in Julia
- Jacobian sparsity detection using Bloom filters
- A note on the computational complexity of chain rule differentiation
- Quantum spectral method for gradient and Hessian estimation
- Simultaneous model discovery and state estimation under high data corruption
- A derivative-free Levenberg-Marquardt method for sparse nonlinear least squares problems
- Using generalized simplex methods to approximate derivatives
- asdex: Automatic Sparse Differentiation in JAX
- Matrix-free preconditioning using partial matrix estimation
This page was built for publication: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713152)
