arXiv Open Access 2015

An Elimination Method to Solve Interval Polynomial Systems

Sajjad Rahmany Abdolali Basiri Benyamin M. -Alizadeh

Lihat Sumber

Abstrak

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new elimination method to solve and analyse interval polynomial systems, in general case. This method is based on computational algebraic geometry concepts such as polynomial ideals and Groebner basis computation. Specially, we use the comprehensive Groebner system concept to keep the dependencies between interval coefficients. At the end of paper, we will state some applications of our method to evaluate its performance.

Topik & Kata Kunci

cs.SC

Penulis (3)

Sajjad Rahmany

Abdolali Basiri

Benyamin M. -Alizadeh

Format Sitasi

APA MLA BibTeX

Rahmany, S., Basiri, A., -Alizadeh, B.M. (2015). An Elimination Method to Solve Interval Polynomial Systems. https://arxiv.org/abs/1506.02423

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓