Mathematical Researches
پژوهش های ریاضی
mmr
Basic Sciences
http://mmr.khu.ac.ir
1
admin
2588-2546
2588-2554
10.61186/mmr
fa
jalali
1399
9
1
gregorian
2020
12
1
6
4
online
1
fulltext
fa
پایۀ مرزی ایدهآل نقاط و کاربرد آن در مسئلۀ طرح آزمایشها و رگرسیون
Border Basis of an Ideal of Points and its Application in Experimental Design and Regression
جبر
alg
مقاله مستقل
Original Manuscript
<span style="font-family:B Nazanin;"><span style="font-size:10.0pt;">موضوع اصلی این مقاله، بررسی پایۀ مرزی برای یک ایدهآل</span></span> <span style="font-family:B Nazanin;"><span style="font-size:10.0pt;">نقاط است. برای این منظور ابتدا الگوریتمی برای محاسبۀ ایدهآل مرتب و پایۀ مرزی نظیر آن برای یک ایدهآل نقاط (که دارای چندگانگی هستند) میپردازیم. ایدهآل نقاط از کاربردهای مختلفی در علوم و مهندسی برخوردار است که در این مقاله ما به کاربرد آن در یافتن مدل آماری بهینه اشاره میکنیم. در پایان، پس از بیان مطالب مورد</span></span> <span style="font-family:B Nazanin;"><span style="font-size:10.0pt;">نیاز، با استفاده از روشهای ارائه شده در این مقاله، به محاسبۀ مدلهای مختلف برای مثالی بر مبنای دادههای واقعی و توضیح کارآیی مدلهای ارائه شده میپردازیم. </span></span><br>
<strong>Introduction</strong><br>
Border bases are a generalization of Gröbner bases for zero-dimensional ideals which have attracted the interest of many researchers recently. More precisely, border bases provide a new method to find a structurally stable monomial basis for the residue class ring of a polynomial ideal and this yields a special generating set for the ideal possessing many nice properties.<br>
Given a finite set of points, finding the set of all polynomials vanishing on it (so-called either ideal of points or vanishing ideal of the set of points) has numerous applications in several fields in Mathematics and other sciences. In 1982, Buchberger and Möller proposed an algorithm to compute a Gröbner basis for an ideal of points. This algorithm proceeds by performing Gaussian elimination on a generalized Vandermonde matrix. In 2006, Farr and Gao presented an incremental algorithm to compute a Gröbner basis for an ideal of points. The main goal of their paper is to calculate a Gröbner basis for the vanishing ideal of any finite set of points under any monomial ordering, and for points with nontrivial multiplicities they adapt their algorithm to compute the vanishing ideal via Taylor expansions.<br>
The method of border bases is a beneficial tool to obtain a set of polynomial models identified by experimental design and regression. The utilization of Gröbner bases theory in experimental design was introduced by Pistone and Wynn. However, using Gröbner bases we cannot find all possible models which form structure of an order ideal for an experiment. For example, if we consider the design {(-1,1),(1,1),(0,0),(1,0),(0,-1)}, the model {<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image002.gif" width="78" >} cannot be computed by Gröbner bases method. This fact is expected this method relies on monomial orderings. <br>
<strong>Material and methods</strong><br>
In this paper, we first present the Buchberger-Möller and Farr-Gao algorithms and then by applying these algorithms, we describe an algorithm which computes a border basis for the ideal of points corresponding to the input set of points with nontrivial multiplicity. In addition, we focus on presenting different models related to an experiment by using the concept of monomial bases for the residue class ring of a polynomial ideal.<br>
<strong>Results and discussion</strong><br>
As we mentioned earlier<em>,</em> Buchberger-Möller algorithm is an efficient algorithm to compute a Gröbner basis for an ideal of points. We describe a simpler presentation of this algorithm in which we use the function NormalForm which receives as input a linear polynomial p and a Gr<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image004.gif" width="7" >bner basis G = {<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image006.gif" width="15" > , . . . , <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image008.gif" width="19" >} of linear polynomials in <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image010.gif" width="14" >, . . . , <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image012.gif" width="13" > and returns f and q=[<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image014.gif" width="14" >, . . . , <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image016.gif" width="18" > ] where f is the remainder of the division of p by G and p=<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image018.gif" width="29" >+· · ·+<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image020.gif" width="38" >+r. Furthermore, we compare the efficiency of this algorithm with the function VanishingIdeal of Maple. <br>
Given a finite set of points, we consider the case in which some points in the set have nontrivial multiplicity. Based on the Farr-Gao algorithm, we prepare an algorithm that computes a border basis for the vanishing ideal of the finite set of points by using Taylor expansions.<br>
Suppose that n is the number of factors in an experiment. An experimental design is a finite set <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image022.gif" width="48" > of points. The set of all polynomials vanishing at the design is called a design ideal.<br>
Regression analysis is a useful statistical process for the investigation of relationships between a response (or dependent) variable and one or more predictor (or independent) variables. When there is more than one predictor variable in a regression model, the model is a multiple linear regression model which we can call polynomial model. Suppose a random sample of size n is given (then we have exactly n data points are observed from (Y,<u>X</u>). The expession<br>
<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image024.gif" width="198" >error?<br>
is the model for multiple linear regression where <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image026.gif" width="13" >'s are called slopes or regression coefficients. Also, representing the merged effects of the predictor variables on the response variable is called interaction effect. By using multiple linear regression, we can analyze models containing interaction effects. For example, let us consider the following model<br>
<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image028.gif" width="249" >+error.<br>
By substituting <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image030.gif" width="54" > and <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image032.gif" width="62" >, we have a multiple linear regression as follows<br>
<img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image034.gif" width="228" >+error.<br>
In addition, multiple R-squared or R<sup>2</sup> is a statistical measure that states the square of the relationship between the predicted response value and response value. It should be noted that multiple R-squared is always any value between 0 and 1, where a value closer to 1 informing that a greater proportion of variance is computed for the model. Statistically, a high multiple R-squared shows a well-fitting regression model. Also in multiple regression, tolerance is used as an indicator of multicollinearity. Tolerance may be said to be the opposite of the coefficient of determination and is obtained as <img alt="" height="19" src="file:///C:Users1AppDataLocalTempmsohtmlclip1 1clip_image036.gif" width="42" >. All other things equal, researchers desire higher levels of tolerance, as low levels of tolerance are known to affect adversely the results associated with a multiple regression analysis. The smaller the tolerance of a variable, the more redundant is its contribution to the regression (i.e., it is redundant with the contribution of other independent variables). In the regression equation, if the tolerance of any of the variables is equal to zero (or very close to zero), the regression equation cannot be evaluated (the matrix is said to be ill-conditioned in this case, and it cannot be inverted). <br>
<strong>Conclusion</strong><br>
The following conclusions were drawn from this research.
<ul>
<li>We present a simpler variant of Buchberger- Möller algorithm (which seems to be easier for the implementation issue) for computing a border basis for an ideal of points.</li>
<li> We present an algorithm that incrementally computes a border basis for the vanishing ideal of any finite set of points in which some points have multiplicity.</li>
<li>We provide good statistical polynomial models which are more suitable for practical applications due to the stability of border bases models compared with Gröbner bases models.<a href="./files/site1/files/64/6.pdf">./files/site1/files/64/6.pdf</a></li>
</ul>
پایۀ مرزی, ایدهآل نقاط, الگوریتم بوخبرگر-مولر, طرح آزمایشها, رگرسیون
رده بندی ریاضی (2010): 13P10, 14Q99, .68W30
Border basis, Ideal of points, Buchberger-Möller algorithm, Experimental design, Regression.
549
562
http://mmr.khu.ac.ir/browse.php?a_code=A-10-172-2&slc_lang=fa&sid=1
Samira
Poukhajouei
سمیرا
پورخواجویی
samira.pourkhajouei@gmail.com
10031947532846004146
10031947532846004146
No
Isfahan university of Technology
دانشگاه صنعتی اصفهان، دانشکدۀ علوم ریاضی
Sare
Goli
ساره
گلی
s.goli@cc.iut.ac.ir
10031947532846004147
10031947532846004147
No
دانشگاه صنعتی اصفهان، دانشکدۀ علوم ریاضی
Amir
Hashemi
امیر
هاشمی
amir.hashemi@cc.iut.ac.ir
10031947532846004148
10031947532846004148
Yes
Isfahan university of Technology
دانشگاه صنعتی اصفهان، دانشکدۀ علوم ریاضی