Combining partial Jacobian computation and preconditioning. New heuristics, educational modules, and applications
From MaRDI portal
(Redirected from Publication:4623307)
Coloring of graphs and hypergraphs (05C15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Discrete mathematics (educational aspects) (97N70)
Recommendations
- Full and partial Jacobian computation vie graph coloring: Algorithms and applications.
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Computing a sparse Jacobian matrix by rows and columns
- Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
- Efficient (partial) determination of derivative matrices via automatic differentiation
This page was built for publication: Combining partial Jacobian computation and preconditioning. New heuristics, educational modules, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4623307)
