Accumulating Jacobians as chained sparse matrix products
type: Item
instance of: scholarly article
title: Accumulating Jacobians as chained sparse matrix products
zbMATH Open document ID: 1023.90053
author: Andreas Griewank
author: Uwe Naumann
published in: Mathematical Programming. Series A. Series B
publication date: 2003-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1948564
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: dynamic programming
zbMATH Keywords: Jacobians
zbMATH Keywords: chained sparse matrix products
zbMATH Keywords: edge elimination in computational graphs
describes a project that uses: ADIC
MaRDI profile type: Publication
Wikidata QID: Q57389652
full work available at URL: s10107-002-0329-7
OpenAlex ID: W2063346066
DOI: 10.1007/S10107-002-0329-7
DBLP publication ID: journals/mp/GriewankN03
Recommended article: Q2844220
Recommended article: Q4660694
Recommended article: Computing a sparse Jacobian matrix by rows and columns
Recommended article: Efficient Calculation of Sparse Jacobians
Recommended article: Q4236314
Recommended article: Jacobi Sum Matrices
Recommended article: Q3601079
Recommended article: Revisiting “Computation of Matrix Chain Products''
Recommended article: Q5180766
Recommended article: Sparse block-Jacobi matrices with arbitrarily accurate Hausdorff dimension
description: scientific article; zbMATH DE number 1948564