Full and partial Jacobian computation vie graph coloring: Algorithms and applications. (Q4649004)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6108345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Full and partial Jacobian computation vie graph coloring: Algorithms and applications. |
scientific article; zbMATH DE number 6108345 |
Statements
19 November 2012
0 references
systems of linear equations
0 references
sparse Jacobian matrices
0 references
Newton-type algorithm
0 references
automatic differentiation
0 references
graph coloring
0 references
bipartite graph model
0 references
algorithm
0 references
preconditioning
0 references
0.8668784499168396
0 references
0.8115349411964417
0 references
0.7899541854858398
0 references
0.7884564399719238
0 references
