Pages that link to "Item:Q3198803"

The following pages link to Preconditioners for the Interval Gauss–Seidel Method (Q3198803):

Displaying 19 items.

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• A new hybrid algorithm based on chaotic maps for solving systems of nonlinear equations (Q508518) (← links)
• Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
• Preconditioning linearized equations (Q678117) (← links)
• Solving interval constraints by linearization in computer-aided design (Q868685) (← links)
• A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems (Q956687) (← links)
• Interval Newton/generalized bisection when there are singularities near roots (Q1173718) (← links)
• Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems (Q1180347) (← links)
• A gentle introduction to Numerica (Q1274762) (← links)
• On proving existence of feasible points in equality constrained optimization problems (Q1290652) (← links)
• Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method (Q1340882) (← links)
• Interval solution of nonlinear equations using linear programming (Q1387251) (← links)
• \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton} (Q1391927) (← links)
• Finding all solutions of nonlinear equations using the dual simplex method (Q1872980) (← links)
• Formulas for the width of interval products (Q1899451) (← links)
• Finding all solutions of a class of nonlinear equations using an improved LP test (Q2258356) (← links)
• Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations (Q2397203) (← links)
• New results on verified global optimization (Q2564991) (← links)
• Convex and concave relaxations of implicit functions (Q2943829) (← links)