Buscar
Mostrando ítems 21-30 de 483
An algorithm for associative bilinear forms
(2009)
We establish the equivalence between the problem of existence of associative bilinear forms and the problem of solvability in commutative power-associative finite-dimensional nil-algebras. We use the tensor product to find ...
Trajectory Tracking Control of a PVTOL Aircraft Based on Linear Algebra Theory
(Wiley, 2014-11)
In this work, a trajectory tracking control design is proposed for the planar vertical takeoff and landing (PVTOL) aircraft using linear algebra theory. The resulting control law is implemented easily since the equation ...
On the Optimality of Finite Constellations from Algebraic Lattices
(2001-04-01)
A construction technique of finite point constellations in n-dimensional spaces from ideals in rings of algebraic integers is described. An algorithm is presented to find constellations with minimum average energy from a ...
Desarrollo de una función en matlab para el cambio de base de un espacio vectorial.
(Escuela Superior Politécnica de Chimborazo, 2019-06-17)
In this work we develop a function in MATLAB for the calculation of change of basis in a Vector Space, this is a fundamental issue in a Linear Algebra course that due to its complexity we must say that little attention has ...
Algebraic conditioning analysis of the incremental unknowns preconditioner
(Elsevier Science Inc., 2008)
Malcev dialgebras
(TAYLOR & FRANCIS LTDABINGDON, 2013-08-02)
We apply Kolesnikov's algorithm to obtain a variety of nonassociative algebras defined by right anticommutativity and a "noncommutative" version of the Malcev identity. We use computer algebra to verify that these identities ...
Trajectory tracking of underactuated surface vessels: a linear algebra approach
(Institute of Electrical and Electronics Engineers, 2013-07)
This brief presents the design of a controller that allows an underactuated vessel to track a reference trajectory in the x−y plane. A trajectory tracking controller designed originally for robotic systems is applied for ...
ON THE ORDER BOUNDS FOR ONE-POINT AG CODES
(Amer Inst Mathematical SciencesSpringfieldEUA, 2011)
VAr planning using genetic algorithm and linear programming
(2001-05-01)
A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating ...