کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506531 | 1340751 | 2005 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computations of multi-resultant with mechanization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Computations of multi-resultant with mechanization Computations of multi-resultant with mechanization](/preview/png/9506531.png)
چکیده انگلیسی
Resultant is a classical algebraic tool for determining whether or not a polynomial systems have a common root without explicitly solving for the roots. But, the complexity of resultants can be very high in practice. In this paper, by using the theories and methods of computer algebra, two reliable algorithms for computing multi-resultant problems-Dixon resultant and Macaulay resultant were established, two new Maple procedures dixonres and macaulayres were established, too. Some examples are presented to illustrate the implementations of the programs. This would be useful for solving a system of polynomial equations.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 170, Issue 1, 1 November 2005, Pages 237-257
Journal: Applied Mathematics and Computation - Volume 170, Issue 1, 1 November 2005, Pages 237-257
نویسندگان
Weiming Wang, Xinze Lian,