Estimation of Sparse Jacobian Matrices and Graph Coloring Blems

DOI10.1137/0720013zbMath0527.65033OpenAlexW1995561370WikidataQ30047701 ScholiaQ30047701MaRDI QIDQ3042292

Jorge J. Moré, Thomas F. Coleman

Publication date: 1983

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0720013

zbMATH Keywords

algorithmsnumerical resultsgraph coloring problemsparse Jacobian matricesband graphsCPR algorithmrandom sparsity pattern

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items

Star colouring of bounded degree graphs and regular graphs, Numerical continuation of high Reynolds number external flows, A direct matrix method for computing analytical jacobians of discretized nonlinear integro-differential equations, Fully-implicit orthogonal reconstructed discontinuous Galerkin method for fluid dynamics with phase change, Variance reduction with practical all-to-all lattice propagators, Additive Schwarz-based fully coupled implicit methods for resistive Hall magnetohydrodynamic problems, An estimator for the diagonal of a matrix, Matrix-free preconditioning using partial matrix estimation, An aerodynamic design optimization framework using a discrete adjoint approach with OpenFOAM, A matrix free implicit scheme for solution of resistive magneto-hydrodynamics equations on unstructured grids, Simple decentralized graph coloring, Quaternionic views of rs-fMRI hierarchical brain activation regions. Discovery of multilevel brain activation region intensities in rs-fMRI video frames, An adaptive nonlinear elimination preconditioned inexact Newton algorithm for highly local nonlinear multicomponent PDE systems, Successive column correction algorithms for solving sparse nonlinear systems of equations, Graph Coloring Using Eigenvalue Decomposition, Unnamed Item, Vertex coloring of a graph for memory constrained scenarios, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization, Variational inequality transport model on the sphere by the active-set reduced-space algorithm, The complexity of star colouring in bounded degree graphs and regular graphs, Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds, On structural parameterizations of star coloring, An efficient algorithm for sparse null space basis problem using ABS methods, Graph coloring on coarse grained multicomputers, \texttt{HORSES3D}: a high-order discontinuous Galerkin solver for flow simulations and multi-physics applications, The Null Space Problem II. Algorithms, A framework for scalable greedy coloring on distributed-memory parallel computers, Large-scale Sparse Inverse Covariance Matrix Estimation, Graph models and their efficient implementation for sparse Jacobian matrix determination, Comparison of relative density of two random geometric digraph families in testing spatial clustering, Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation, Preconditioning a Newton-Krylov solver for all-speed melt pool flow physics, A polynomial time algorithm to find the star chromatic index of trees, Multilevel Schwarz methods for elliptic partial differential equations, Location-allocation models for traffic police patrol vehicles on an interurban network, Fully implicit Lagrange–Newton–Krylov–Schwarz algorithms for boundary control of unsteady incompressible flows, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, Unnamed Item, The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models, Optimizing partially separable functions without derivatives, Optimization of unconstrained functions with sparse hessian matrices-newton-type methods, Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations^∗, A probing method for computing the diagonal of a matrix inverse, A polyhedral study of the acyclic coloring problem, Parallel multilevel methods for implicit solution of shallow water equations with nonsmooth topography on the cubed-sphere, Software for estimating sparse Jacobian matrices, On the chromatic number of graphs, A parallel nonlinear additive Schwarz preconditioned inexact Newton algorithm for incompressible Navier-Stokes equations, Efficient estimation of sparse Jacobian matrices by differences, Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems, A chordal preconditioner for large-scale optimization, Nonlinear Preconditioning Techniques for Full-Space Lagrange--Newton Solution of PDE-Constrained Optimization Problems, DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices, Preconditioner updates for solving sequences of linear systems in matrix-free environment, The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices, Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope, CsegGraph: a graph colouring instance generator, Discrete Newton's method with local variations for solving large-scale nonlinear systems, Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope, Fully implicit hybrid two-level domain decomposition algorithms for two-phase flows in porous media on 3D unstructured grids, Tensor methods for large sparse systems of nonlinear equations, A structural analysis of topic ontologies, A Hybrid Algorithm for Solving Sparse Nonlinear Systems of Equations, Optimal approximation of sparse hessians and its equivalence to a graph coloring problem, Computing a sparse Jacobian matrix by rows and columns, Practical quasi-Newton methods for solving nonlinear systems, A fully implicit, nonlinear adaptive grid strategy, Optimal direct determination of sparse Jacobian matrices, Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms, Efficient detection of hessian matrix sparsity pattern, Estimation of sparse hessian matrices and graph coloring problems, Successive element correction algorithms for sparse unconstrained optimization