Pages that link to "Item:Q3042292"

The following pages link to Estimation of Sparse Jacobian Matrices and Graph Coloring Blems (Q3042292):

Displaying 50 items.

• Variance reduction with practical all-to-all lattice propagators (Q311846) (← links)
• A matrix free implicit scheme for solution of resistive magneto-hydrodynamics equations on unstructured grids (Q347966) (← links)
• A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
• A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
• Comparison of relative density of two random geometric digraph families in testing spatial clustering (Q464444) (← links)
• Location-allocation models for traffic police patrol vehicles on an interurban network (Q478026) (← links)
• Parallel multilevel methods for implicit solution of shallow water equations with nonsmooth topography on the cubed-sphere (Q543667) (← links)
• Efficient estimation of sparse Jacobian matrices by differences (Q579849) (← links)
• Multilevel Schwarz methods for elliptic partial differential equations (Q660209) (← links)
• Fully implicit hybrid two-level domain decomposition algorithms for two-phase flows in porous media on 3D unstructured grids (Q778272) (← links)
• A structural analysis of topic ontologies (Q780974) (← links)
• A direct matrix method for computing analytical jacobians of discretized nonlinear integro-differential equations (Q834098) (← links)
• Matrix-free preconditioning using partial matrix estimation (Q855287) (← links)
• Successive column correction algorithms for solving sparse nonlinear systems of equations (Q1122315) (← links)
• A chordal preconditioner for large-scale optimization (Q1262220) (← links)
• Tensor methods for large sparse systems of nonlinear equations (Q1290627) (← links)
• Successive element correction algorithms for sparse unconstrained optimization (Q1321350) (← links)
• Graph coloring on coarse grained multicomputers (Q1408826) (← links)
• Practical quasi-Newton methods for solving nonlinear systems (Q1593814) (← links)
• An aerodynamic design optimization framework using a discrete adjoint approach with OpenFOAM (Q1649884) (← links)
• An adaptive nonlinear elimination preconditioned inexact Newton algorithm for highly local nonlinear multicomponent PDE systems (Q1669860) (← links)
• A parallel nonlinear additive Schwarz preconditioned inexact Newton algorithm for incompressible Navier-Stokes equations (Q1775800) (← links)
• An efficient algorithm for sparse null space basis problem using ABS methods (Q1944750) (← links)
• Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
• Quaternionic views of rs-fMRI hierarchical brain activation regions. Discovery of multilevel brain activation region intensities in rs-fMRI video frames (Q2169644) (← links)
• Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
• Preconditioning a Newton-Krylov solver for all-speed melt pool flow physics (Q2222517) (← links)
• A polynomial time algorithm to find the star chromatic index of trees (Q2223458) (← links)
• Fully-implicit orthogonal reconstructed discontinuous Galerkin method for fluid dynamics with phase change (Q2374975) (← links)
• Additive Schwarz-based fully coupled implicit methods for resistive Hall magnetohydrodynamic problems (Q2381245) (← links)
• An estimator for the diagonal of a matrix (Q2382753) (← links)
• Simple decentralized graph coloring (Q2397096) (← links)
• Graph models and their efficient implementation for sparse Jacobian matrix determination (Q2446302) (← links)
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
• A fully implicit, nonlinear adaptive grid strategy (Q2581692) (← links)
• \texttt{HORSES3D}: a high-order discontinuous Galerkin solver for flow simulations and multi-physics applications (Q2692480) (← links)
• Nonlinear preconditioning techniques for full-space Lagrange-Newton solution of PDE-constrained optimization problems (Q2818260) (← links)
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices (Q2819230) (← links)
• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
• Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope (Q2840711) (← links)
• Optimal direct determination of sparse Jacobian matrices (Q2867431) (← links)
• Numerical continuation of high Reynolds number external flows (Q2893552) (← links)
• Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds (Q2958803) (← links)
• The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models (Q3011096) (← links)
• Preconditioner updates for solving sequences of linear systems in matrix-free environment (Q3090810) (← links)
• Graph Coloring Using Eigenvalue Decomposition (Q3216692) (← links)
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769) (← links)
• Optimization of unconstrained functions with sparse hessian matrices-newton-type methods (Q3324531) (← links)
• Software for estimating sparse Jacobian matrices (Q3340011) (← links)
• Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms (Q3439477) (← links)