๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A computational study of methods for solving polynomial geometric programs

โœ Scribed by J. J. Dinkel; G. A. Kochenberger; B. McCarl

Publisher
Springer
Year
1976
Tongue
English
Weight
1008 KB
Volume
19
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improving a method of search for solving
Improving a method of search for solving polynomial equations
โœ M. Hujter ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 136 KB

This paper is related to the Lehmer-Schur methods in numerical mathematics in the complex plane. It is shown that by a slight modification of the "optimized" Lehmer-Schur method of Gal~ntai, the "speed" quotient 0.6094 can be reduced to 0.5758. The crucial idea is based on a discrete geometrical obs

Triangular Sets for Solving Polynomial S
Triangular Sets for Solving Polynomial Systems: a Comparative Implementation of Four Methods
โœ Philippe Aubry; Marc Moreno Maza ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 443 KB

Four methods for solving polynomial systems by means of triangular sets are presented and implemented in a unified way. These methods are those of Wu (1987), Lazard (1991), Kalkbrener (1991) and Wang (1993b). They are compared on various examples with the emphasis on efficiency, conciseness and legi