𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rational functions and pseudo-Newton algorithms

✍ Scribed by M Hurley; C Martin

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
294 KB
Volume
2
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Basic Algorithms for Rational Function F
Basic Algorithms for Rational Function Fields
✍ J. MΓΌller-Quade; R. Steinwandt πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 411 KB

By means of GrΓΆbner basis techniques algorithms for solving various problems concerning subfields K (g) := K (g 1 , . . . , gm) of a rational function field K (x) := K (x 1 , . . . , xn) are derived: computing canonical generating sets, deciding field membership, computing the degree and separabilit

Low complexity secant quasi-Newton minim
Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
✍ Carmine Di Fiore; Stefano Fanelli; Paolo Zellini πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 205 KB

In this work some interesting relations between results on basic optimization and algorithms for nonconvex functions (such as BFGS and secant methods) are pointed out. In particular, some innovative tools for improving our recent secant BFGS-type and LQN algorithms are described in detail.

A Rational Function Decomposition Algori
A Rational Function Decomposition Algorithm by Near-separated Polynomials
✍ Cesar Alonso; Jaime Gutierrez; Tomas Recio πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 585 KB

In this paper we present an algorithm for decomposing rational functions over an arbitrary coefficient field. The algorithm requires exponential time, but is more efficient in practice than the previous ones, including the polynomial time algorithm. Moreover, our algorithm is easier to implement. We