Page 1

Displaying 1 – 7 of 7

Showing per page

Un algoritmo de descomposición de funciones racionales mediante polinomios casi-separados.

César Alonso, Jaime Gutiérrez, Tomás Recio (1996)

Extracta Mathematicae

Dado un polinomio f perteneciente a K[x], determinar si existen otros dos g y h de grado mayor que uno tales que f(x) = g(h(x)) = g o h, y, en caso de que existan, encontrarlos, es conocido como problema de descomposición para polinomios. Cuando dicha descomposición existe, problemas como la evaluación de f en un punto o la resolución de la ecuación f = 0 se pueden resolver de manera más simple. La generalización del problema de la descomposición al caso de funciones racionales es sin duda un problema...

Unified computational approach to nilpotent algebra classification problems

Shirali Kadyrov, Farukh Mashurov (2021)

Communications in Mathematics

In this article, we provide an algorithm with Wolfram Mathematica code that gives a unified computational power in classification of finite dimensional nilpotent algebras using Skjelbred-Sund method. To illustrate the code, we obtain new finite dimensional Moufang algebras.

Using symbolic computation in the characterization of frictional instabilities involving orthotropic materials

Mohamed A. Agwa, António Pinto da Costa (2015)

International Journal of Applied Mathematics and Computer Science

The present work addresses the problem of determining under what conditions the impending slip state or the steady sliding of a linear elastic orthotropic layer or half space with respect to a rigid flat obstacle is dynamically unstable. In other words, we search the conditions for the occurrence of smooth exponentially growing dynamic solutions with perturbed initial conditions arbitrarily close to the steady sliding state, taking the system away from the equilibrium state or the steady sliding...

Currently displaying 1 – 7 of 7

Page 1