Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
DOI10.1137/0720013zbMATH Open0527.65033OpenAlexW1995561370WikidataQ30047701 ScholiaQ30047701MaRDI QIDQ3042292FDOQ3042292
Authors: Thomas F. Coleman, Jorge J. Moré
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
algorithmsnumerical resultsgraph coloring problemsparse Jacobian matricesband graphsCPR algorithmrandom sparsity pattern
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Coloring of graphs and hypergraphs (05C15)
Cited In (76)
- Practical quasi-Newton methods for solving nonlinear systems
- Star colouring of bounded degree graphs and regular graphs
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Preconditioning a Newton-Krylov solver for all-speed melt pool flow physics
- An aerodynamic design optimization framework using a discrete adjoint approach with OpenFOAM
- A probing method for computing the diagonal of a matrix inverse
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Matrix-free preconditioning using partial matrix estimation
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Large-scale Sparse Inverse Covariance Matrix Estimation
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Title not available (Why is that?)
- Tensor methods for large sparse systems of nonlinear equations
- A parallel nonlinear additive Schwarz preconditioned inexact Newton algorithm for incompressible Navier-Stokes equations
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- CsegGraph: a graph colouring instance generator
- A Hybrid Algorithm for Solving Sparse Nonlinear Systems of Equations
- A framework for scalable greedy coloring on distributed-memory parallel computers
- Efficient estimation of sparse Jacobian matrices by differences
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- On structural parameterizations of star coloring
- An adaptive nonlinear elimination preconditioned inexact Newton algorithm for highly local nonlinear multicomponent PDE systems
- Vertex coloring of a graph for memory constrained scenarios
- Additive Schwarz-based fully coupled implicit methods for resistive Hall magnetohydrodynamic problems
- Title not available (Why is that?)
- The independent set perturbation adjoint method: a new method of differentiating mesh-based fluids models
- Graph Coloring Using Eigenvalue Decomposition
- Successive element correction algorithms for sparse unconstrained optimization
- Variance reduction with practical all-to-all lattice propagators
- Nonlinear preconditioning techniques for full-space Lagrange-Newton solution of PDE-constrained optimization problems
- Computing a sparse Jacobian matrix by rows and columns
- A chordal preconditioner for large-scale optimization
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems
- Comparison of relative density of two random geometric digraph families in testing spatial clustering
- Graph coloring on coarse grained multicomputers
- The Null Space Problem II. Algorithms
- A direct matrix method for computing analytical jacobians of discretized nonlinear integro-differential equations
- Discrete Newton's method with local variations for solving large-scale nonlinear systems
- Fully-implicit orthogonal reconstructed discontinuous Galerkin method for fluid dynamics with phase change
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- Location-allocation models for traffic police patrol vehicles on an interurban network
- Quaternionic views of rs-fMRI hierarchical brain activation regions. Discovery of multilevel brain activation region intensities in rs-fMRI video frames
- Optimizing partially separable functions without derivatives
- Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations∗
- Simple decentralized graph coloring
- Fully implicit hybrid two-level domain decomposition algorithms for two-phase flows in porous media on 3D unstructured grids
- A structural analysis of topic ontologies
- A matrix free implicit scheme for solution of resistive magneto-hydrodynamics equations on unstructured grids
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Numerical continuation of high Reynolds number external flows
- On the chromatic number of graphs
- Parallel multilevel methods for implicit solution of shallow water equations with nonsmooth topography on the cubed-sphere
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- A polynomial time algorithm to find the star chromatic index of trees
- Optimal direct determination of sparse Jacobian matrices
- Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
- Successive column correction algorithms for solving sparse nonlinear systems of equations
- Multilevel Schwarz methods for elliptic partial differential equations
- An efficient algorithm for sparse null space basis problem using ABS methods
- An estimator for the diagonal of a matrix
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Software for estimating sparse Jacobian matrices
- Estimation of sparse hessian matrices and graph coloring problems
- Fully implicit Lagrange–Newton–Krylov–Schwarz algorithms for boundary control of unsteady incompressible flows
- A fully implicit, nonlinear adaptive grid strategy
- \texttt{HORSES3D}: a high-order discontinuous Galerkin solver for flow simulations and multi-physics applications
- Physics-based preconditioning of Jacobian-free Newton-Krylov solver for Navier-Stokes equations using nodal integral method
- A polyhedral study of the acyclic coloring problem
- Variational inequality transport model on the sphere by the active-set reduced-space algorithm
- Efficient detection of hessian matrix sparsity pattern
- Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
- The complexity of star colouring in bounded degree graphs and regular graphs
- An analysis and solution of ill-conditioning in physics-informed neural networks
- Central industries in the Ecuadorian input-output network. An application of social network analysis
This page was built for publication: Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3042292)