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