نتایج جستجو برای: modified secant equations
تعداد نتایج: 483147 فیلتر نتایج به سال:
This paper is devoted to the study of higher secant varieties of varieties of completely decomposable forms. The main goal is to develop methods to inductively verify the non-defectivity of such secant varieties. As an application of these methods, we will establish the existence of large families of non-defective secant varieties of “small” varieties of completely decomposable forms.
The article describes a certain computation method of -arcs to construct the number distinct in for . In this method, new approach employed compute and arcs respectively. This is based on choosing inequivalent classes } -secant distributions that 4-secant, 3-secant, 2-secant, 1-secant 0-secant each process. maximum size -arc has been constructed by tool deal with programming difficulties someti...
Sequential Residual Methods try to solve nonlinear systems of equations $F(x)=0$ by iteratively updating the current approximate solution along a residual-related direction. Therefore, memory requirements are minimal and, consequently, these methods attractive for solving large-scale systems. However, convergence algorithms may be slow in critical cases; therefore, acceleration procedures welco...
The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads to a commutative algebra version of the Strong Perfect Graph Theorem. Given any projective variety and any term order, we explore whether the initial ideal o...
The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads to a commutative algebra version of the Strong Perfect Graph Theorem. Given any projective variety and any term order, we explore whether the initial ideal o...
The secant method is one of the most popular methods for root finding. Standard text books in numerical analysis state that the secant method is super linear: the rate of convergence is set by the gold number. Nevertheless, this property holds only for simple roots. If the multiplicity of the root is larger than one, the convergence of the secant method becomes linear. This communication includ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید