Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.07.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158898837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Sparse Jacobian Matrices and Graph Coloring Blems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frozen development in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at graph coloring via propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Jacobian sparsity patterns by Bayesian probing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a sparse Jacobian matrix by rows and columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal direct determination of sparse Jacobian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Continuation for Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Sparse Jacobian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765419 / rank
 
Normal rank

Latest revision as of 14:36, 27 June 2024

scientific article
Language Label Description Also known as
English
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
scientific article

    Statements

    Graph coloring in the estimation of sparse derivative matrices: Instances and applications (English)
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    exact coloring
    0 references
    sparsity
    0 references
    mathematical derivatives
    0 references
    numerical examples
    0 references
    graph coloring
    0 references
    derivative matrices
    0 references
    0 references
    0 references
    0 references

    Identifiers