✦ LIBER ✦

Using Galois Ideals for Computing Relative Resolvents

✍ Scribed by Philippe Aubry; Annick Valibouze

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 340 KB
Volume: 30
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2000.0376

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we show that some ideals which occur in Galois theory are generated by triangular sets of polynomials. This geometric property seems important for the development of symbolic methods in Galois theory. It may and should be exploited in order to obtain more efficient algorithms, and it enables us to present a new algebraic method for computing relative resolvents which works with any polynomial invariant.

📜 SIMILAR VOLUMES

Simplified computation of confidence int

Simplified computation of confidence intervals for relative potencies using Fieller's theorem

✍ C. Philip Cox; Donna J. Ruhl 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB 👁 1 views

Reduction of reconstruction time for tim

Reduction of reconstruction time for time-resolved spiral 3D contrast-enhanced magnetic resonance angiography using parallel computing

✍ Bryan Kressler; Pascal Spincemaille; Martin R. Prince; Yi Wang 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

## Abstract Time‐resolved 3D MRI with high spatial and temporal resolution can be achieved using spiral sampling and sliding‐window reconstruction. Image reconstruction is computationally intensive because of the need for data regridding, a large number of temporal phases, and multiple RF receiver