The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
Abstract
Given a mapping with a sparse Jacobian matrix, we investigate the problem of minimizing the number of function evaluations needed to estimate the Jacobian matrix by differences. We show that this problem can be attacked as a graph coloring problem and that this approach leads to very efficient algorithms. The behavior of these algorithms is studied and, in particular, we prove that two of the algorithms are optimal for band graphs. We also present numerical evidence which indicates that these two algorithms are nearly optimal on practical problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Harary, F. (1969) · Cited by 10,739
Graph Theory with Applications
Bondy, J. A., & Murty, U. S. R. (1976) · doi:10.1007/978-1-349-03521-2 · Cited by 9,043
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
New methods to color the vertices of a graph
Brélaz, D. (1979) · Communications of the ACM · doi:10.1145/359094.359101 · Cited by 1,567
Moon, J. W., & Moser, L. (1965) · Israel Journal of Mathematics · doi:10.1007/bf02760024 · Cited by 837
An upper bound for the chromatic number of a graph and its application to timetabling problems
Welsh, D. J. A. (1967) · The Computer Journal · doi:10.1093/comjnl/10.1.85 · Cited by 762
(1972) · Elsevier eBooks · doi:10.1016/c2013-0-12434-8 · Cited by 597
The NP-Completeness of the bandwidth minimization problem
Papadimitriou, C. H. (1976) · Computing · doi:10.1007/bf02280884 · Cited by 407
Matula, D. W., Marble, G., & Isaacson, J. D. (1972) · Graph Theory and Computing · doi:10.1016/b978-1-4832-3187-7.50015-5 · Cited by 232
Cited by
Survey of Numerical Methods for Trajectory Optimization
Betts, J. T. (1998) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4231 · Cited by 2,602
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
ADIFOR–Generating Derivative Codes from Fortran Programs
Bischof, C., Carle, A., Corliss, G., Griewank, A., & Hovland, P. (1992) · Scientific Programming · doi:10.1155/1992/717832 · Cited by 436
Metadata
- Authors
- Coleman, T. F., & Moré, J. J.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1983-02
- Volume
- 20
- Issue
- 1
- Pages
- 187-209
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W1995561370
- Cited by
- 468
- References
- 9
- FWCI
- 8.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.