Back to Results
First PageMeta Content
Abstract algebra / Convex optimization / Operations research / Eigenvalues and eigenvectors / Singular value decomposition / Vector space / Linear programming / Matrix / Linear least squares / Algebra / Mathematics / Linear algebra


J Glob Optim:327–345 DOIs10898A scaling algorithm for polynomial constraint satisfaction problems Ferenc Domes · Arnold Neumaier
Add to Reading List

Document Date: 2008-10-09 12:13:48


Open Document

File Size: 218,03 KB

Share Result on Facebook

City

Vienna / /

Company

Springer Science+Business Media LLC / /

Country

Austria / /

/

Facility

University of Vienna / /

IndustryTerm

good nonlinear scaling algorithm / polynomial systems / large sparse unsymmetric linear systems / semiconductor device / it difficult to compare scaling algorithms / paper surveys scaling algorithms / linear programming algorithm / iterative algorithm / important applications / sparse linear systems / unsymmetric linear systems / approximate solution / linear and nonlinear systems / nonlinear systems / computing / numerical algorithms / improved scaling algorithm / linear systems / few such scaling algorithms / nonlinear scaling algorithms / auxiliary linear systems / /

Organization

A. Neumaier Faculty of Mathematics / University of Vienna / /

Person

Curtis / Reid / Ai / Arnold Neumaier / /

Position

maximum mp / /

Product

Bang & Olufsen Form 2 Headphone/Headset / /

Technology

semiconductor / Keywords Scaling algorithms / two scaling algorithms / scaling algorithm / matching algorithm / preceding algorithms / linear programming algorithm / slightly improved scaling algorithm / Hompack algorithm / paper surveys scaling algorithms / nonlinear scaling algorithms / second algorithm / good nonlinear scaling algorithm / second scaling algorithm / scaling algorithms / /

SocialTag