The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 261 – 280 of 372

Showing per page

An Algebraic Formula for the Index of a Vector Field on an Isolated Complete Intersection Singularity

H.-Ch. Graf von Bothmer, Wolfgang Ebeling, Xavier Gómez-Mont (2008)

Annales de l’institut Fourier

Let ( V , 0 ) be a germ of a complete intersection variety in n + k , n > 0 , having an isolated singularity at 0 and X be the germ of a holomorphic vector field having an isolated zero at 0 and tangent to V . We show that in this case the homological index and the GSV-index coincide. In the case when the zero of X is also isolated in the ambient space n + k we give a formula for the homological index in terms of local linear algebra.

An algebraic framework for linear identification

Michel Fliess, Hebertt Sira-Ramírez (2003)

ESAIM: Control, Optimisation and Calculus of Variations

A closed loop parametrical identification procedure for continuous-time constant linear systems is introduced. This approach which exhibits good robustness properties with respect to a large variety of additive perturbations is based on the following mathematical tools: (1) module theory; (2) differential algebra; (3) operational calculus. Several concrete case-studies with computer simulations demonstrate the efficiency of our on-line identification scheme.

An algebraic framework for linear identification

Michel Fliess, Hebertt Sira–Ramírez (2010)

ESAIM: Control, Optimisation and Calculus of Variations

A closed loop parametrical identification procedure for continuous-time constant linear systems is introduced. This approach which exhibits good robustness properties with respect to a large variety of additive perturbations is based on the following mathematical tools: (1) module theory; (2) differential algebra; (3) operational calculus. Several concrete case-studies with computer simulations demonstrate the efficiency of our on-line identification scheme.

An algorithm for primary decomposition in polynomial rings over the integers

Gerhard Pfister, Afshan Sadiq, Stefan Steidel (2011)

Open Mathematics

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals, resp. over finite fields, and the idea of Shimoyama-Yokoyama, resp. Eisenbud-Hunecke-Vasconcelos, to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article.

An algorithm to compute the kernel of a derivation up to a certain degree

Stefan Maubach (2001)

Annales Polonici Mathematici

An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] up to a previously given bound. For w-homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel then this set is minimal.

Currently displaying 261 – 280 of 372