Now showing items 21-40 of 134

• #### Approaching dual quaternions from matrix algebra ﻿

(2014)
Article
Open Access
Dual quaternions give a neat and succinct way to encapsulate both translations and rotations into a unified representation that can easily be concatenated and interpolated. Unfortunately, the combination of quaternions and ...
• #### Bounding the distance of a controllable and observable system to an uncontrollable or unobservable one ﻿

(1999)
Article
Open Access
Let $(A,B,C)$ be a triple of matrices representing a time-invariant linear system \left .\aligned \dot x(t)&=Ax(t)+Bu(t)\\y(t)&=Cx(t)\endaligned \right \} under similarity equivalence, corresponding to a realization ...
• #### Bounding the distance of a controllable system to an uncontrollable one ﻿

(1998)
Article
Open Access
Let $(A,B)$ be a pair of matrices representing a time-invariant linear system $\dot x(t)=Ax(t)+Bu(t)$ under block-similarity equivalence. In this paper we measure the distance between a controllable pair of matrices ...
• #### Characterization of symmetric M-matrices as resistive inverses ﻿

(2007-01-25)
Article
Open Access
We aim here at characterizing those nonnegative matrices whose inverse is an irreducible Stieltjes matrix. Specifically, we prove that any irreducible Stieltjes matrix is a resistive inverse. To do that we consider the ...
• #### Codificació de missatges mitjançant matrius ﻿

(2018-05)
Audiovisual
Open Access
• #### Combinatorial recurrences and linear difference equations ﻿

(2016-10-17)
Article
Open Access
In this work we introduce the triangular arrays of depth greater than 1 given by linear recurrences, that generalize some well known recurrences that appear in enumerative combinatorics. In particular, we focussed on ...
• #### Combinatorial recurrences and linear difference equations ﻿

(2016)
Conference report
Restricted access - publisher's policy
In this work we introduce the triangular arrays of depth greater than 1 given by linear recurrences, that generalize some well-known recurrences that appear in enumerative combinatorics. In particular, we focussed on ...
• #### Comparació de matrius de imatges en escala de grisos en format .jpg i .tiff en Octave ﻿

(2018-05)
Audiovisual
Open Access
• #### Computing size-independent matrix problems on systolic array processors ﻿

(Institute of Electrical and Electronics Engineers (IEEE), 1986)
Conference report
Open Access
A methodology to transform dense to band matrices is presented in this paper. This transformation, is accomplished by triangular blocks partitioning, and allows the implementation of solutions to problems with any given ...
• #### Controllability of $\ell$-order linear systems ﻿

(2003)
Article
Open Access
Given a ( + 1)-ple of matrices (A¡1; : : : ;A0;B) representing - order time-invariant linear systems, x() = A¡1x(¡1) + : : : + A0x(0) + Bu, we analyze conditions in such a way that changing the control u by u1 = u ...
• #### D-stable controller design for Lipschitz NLPV system ﻿

(2019)
Conference report
Open Access
This paper addresses the design of a state-feedback controller for a class of nonlinear parameter varying (NLPV) systems in which the nonlinearity can be expressed as a parameter-varying Lipschitz term. The controller is ...
• #### Decentralised reliable guaranteed cost control of uncertain systems: an LMI design ﻿

(2007-05)
Article
Open Access
The problem of designing a decentralised control scheme for a class of linear large scale interconnected systems with norm-bounded time-varying parameter uncertainties under a class of control failures is addressed. These ...
• #### Deformaciones miniversales de parejas de tensores de segundo orden ﻿

Conference report
Open Access
Consideramos en el espacio de parejas de tensores tension y deformacion la relacion de equivalencia que se corresponde con cambios de base ortonormales. Identificandolas con parejas de matrices cuadradas, podemos utilizar ...
• #### Description of characteristic non-hyperinvariant subspaces over the field GF(2) ﻿

(Elsevier, 2013-10-26)
Article
Restricted access - publisher's policy
Given a square matrix A, an A-invariant subspace is called hyperinvariant (respectively, characteristic) if and only if it is also invariant for all matrices T (respectively, nonsingular matrices T) that commute with A. ...
• #### Differentiable families of traceless matrix triples ﻿

(springer-Verlag, 2019-12-06)
Article
Open Access
Analysis of spectra of families of sets of matrices verifying certain properties is not simple because phenomena as singularities and bifurcations appear. An excellent tool for the analysis can be making use of versal ...
• #### Dimension of the orbit of marked subspaces ﻿

(2004)
Article
Open Access
Given a nilpotent endomorphism, we consider the manifold of invariant subspaces having a fixed Segre characteristic. In [Linear Algebra Appl., 332–334 (2001) 569], the implicit form of a miniversal deformation of an ...
• #### Discrete trace function and Poincaré inequality for the study of some linear systems ﻿

(2019)
Conference report
Open Access
• #### Diseño y cálculo de una matriz progresiva para realizar una garra pasacables por estampación en frío ﻿

(Universitat Politècnica de Catalunya, 2012-02)
Master thesis (pre-Bologna period)
Open Access
Se trata de realizar el diseño y cálculo de una matriz progresiva de 9 estaciones o pasos con el fin de obtener una garra metálica pasa cables. El plano de la pieza viene definido por el cliente, lo que nos definirá que ...
• #### Diseño y programación de una matriz de leds en forma de cubo ﻿

(Universitat Politècnica de Catalunya, 2012-02)
Master thesis (pre-Bologna period)
Open Access
Este proyecto trata del diseño y de la programación de una matriz de leds en forma de cubo. Para llevar a cabo este proyecto ha sido necesario realizar un estudio de los diferentes micro controladores PIC existentes en ...
• #### Eigenvalues and eigenvectors of monomial matrices ﻿

Spectral properties of special matrices matrices have been widely applied. We focus on monomial matrices over a finite field $F_{p}$, $p \neq 2$. We describe a way to find the minimal annihilating polynomial, a set of ...