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

Use of a computer for analytic transformations on polynomials

โœ Scribed by Yu. V. Blagoveshchenskii; S. B. Progrebinskii

Publisher
Springer US
Year
1971
Tongue
English
Weight
604 KB
Volume
7
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Testing a Bivariate Polynomial for An
On Testing a Bivariate Polynomial for Analytic Reducibility
โœ Scott McCallum ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 618 KB

Let K be an algebraically closed field of characteristic zero. We present an efficient algorithm for determining whether or not a given polynomial f (x, y) in K[x, y] is analytically reducible over K at the origin. The algorithm presented is based upon an informal method sketched by Kuo (1989) which

A note on the use of transformations in
A note on the use of transformations in sensitivity computations for elliptic systems
โœ J.A. Burns; L.G. Stanley ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 943 KB

Sensitivity analysis is an important tool in engineering with applications ranging from optimal design to computational fluid dynamics. There are many algorithms available for computing sensitivities. These range from automatic differentiation techniques to variational methods. In this paper,.we des