𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing Triangular Systems and Regular Systems

✍ Scribed by Dongming Wang

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
335 KB
Volume
30
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

A previous algorithm of computing simple systems is modified and extended to compute triangular systems and regular systems from any given polynomial system. The resulting algorithms, based on the computation of subresultant regular subchains, have a simple structure and are efficient in practice. Preliminary experiments indicate that they perform at least as well as some of the known algorithms. Several properties about regular systems are also proved.

πŸ“œ SIMILAR VOLUMES

Introduction: Multimedia computing syste
Introduction: Multimedia computing systems
✍ Leana Golubchik; John C. S. Lui πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 50 KB πŸ‘ 2 views

Recent technological advances in digital signal processing, data compression techniques, and high speed communication networks have made distributed multimedia information systems feasible. Already, multimedia systems play a major role in educational applications, entertainment technology, and libra

Ordered matroids and regular independenc
Ordered matroids and regular independence systems
✍ J.Orestes Cerdeira; Paulo Barcia πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 419 KB

We consider a class of matroids which we call ordered matroids. We show that these are the matroids of regular independence systems. (If E is a finite ordered set, a regular independence system on E is an independence system (E, F) with the following property: if A E 9 and a E A, then (A -{a}) U {e}

Left-Definite Regular Hamiltonian System
Left-Definite Regular Hamiltonian Systems
✍ Allan M. Krall πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 526 KB

## Abstract Linear Hamiltonian systems allow us to generalize, as well as consider, self‐adjoint problems of any even order. Such left‐definite problems are interesting, not only because of the generalization, but also because of the new intricacies they expose, some of which have made it possible

Reliability in grid computing systems
Reliability in grid computing systems
✍ Christopher Dabrowski πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 260 KB

## Abstract In recent years, grid technology has emerged as an important tool for solving compute‐intensive problems within the scientific community and in industry. To further the development and adoption of this technology, researchers and practitioners from different disciplines have collaborate