Pages that link to "Item:Q4185935"

The following pages link to A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront (Q4185935):

Displaying 14 items.

• A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
• A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
• A chordal preconditioner for large-scale optimization (Q1262220) (← links)
• Profile minimization problem for matrices and graphs (Q1327828) (← links)
• Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction (Q1913169) (← links)
• Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
• (Q3122350) (← links)
• Software for estimating sparse Jacobian matrices (Q3340011) (← links)
• Estimation of sparse hessian matrices and graph coloring problems (Q3690096) (← links)
• A note on direct methods for approximations of sparse Hessian matrices (Q3806696) (← links)
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph (Q4315432) (← links)
• (Q4398050) (← links)
• A survey of direct methods for sparse linear systems (Q5740079) (← links)