Displaying 141 – 160 of 168

Showing per page

Controllability in the max-algebra

Jean-Michel Prou, Edouard Wagneur (1999)

Kybernetika

We are interested here in the reachability and controllability problems for DEDS in the max-algebra. Contrary to the situation in linear systems theory, where controllability (resp observability) refers to a (linear) subspace, these properties are essentially discrete in the max -linear dynamic system. We show that these problems, which consist in solving a max -linear equation lead to an eigenvector problem in the min -algebra. More precisely, we show that, given a max -linear system, then, for every natural...

Controllability of linear impulsive systems – an eigenvalue approach

Vijayakumar S. Muni, Raju K. George (2020)

Kybernetika

This article considers a class of finite-dimensional linear impulsive time-varying systems for which various sufficient and necessary algebraic criteria for complete controllability, including matrix rank conditions are established. The obtained controllability results are further synthesised for the time-invariant case, and under some special conditions on the system parameters, we obtain a Popov-Belevitch-Hautus (PBH)-type rank condition which employs eigenvalues of the system matrix for the investigation...

Controllable and tolerable generalized eigenvectors of interval max-plus matrices

Matej Gazda, Ján Plavka (2021)

Kybernetika

By max-plus algebra we mean the set of reals equipped with the operations a b = max { a , b } and a b = a + b for a , b . A vector x is said to be a generalized eigenvector of max-plus matrices A , B ( m , n ) if A x = λ B x for some λ . The investigation of properties of generalized eigenvectors is important for the applications. The values of vector or matrix inputs in practice are usually not exact numbers and they can be rather considered as values in some intervals. In this paper the properties of matrices and vectors with inexact (interval) entries...

Convergence of L p -norms of a matrix

Pavel Stavinoha (1985)

Aplikace matematiky

a recurrence relation for computing the L p -norms of an Hermitian matrix is derived and an expression giving approximately the number of eigenvalues which in absolute value are equal to the spectral radius is determined. Using the L p -norms for the approximation of the spectral radius of an Hermitian matrix an a priori and a posteriori bounds for the error are obtained. Some properties of the a posteriori bound are discussed.

Convergence of Rump's method for computing the Moore-Penrose inverse

Yunkun Chen, Xinghua Shi, Yi Min Wei (2016)

Czechoslovak Mathematical Journal

We extend Rump's verified method (S. Oishi, K. Tanabe, T. Ogita, S. M. Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices with full column (row) rank. We establish the convergence of our numerical verified method for computing the Moore-Penrose inverse. We also discuss the rank-deficient case and test some ill-conditioned examples. We provide our Matlab codes for computing the...

Convergence of series of dilated functions and spectral norms of GCD matrices

Christoph Aistleitner, István Berkes, Kristian Seip, Michel Weber (2015)

Acta Arithmetica

We establish a connection between the L² norm of sums of dilated functions whose jth Fourier coefficients are ( j - α ) for some α ∈ (1/2,1), and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in L² and for the almost everywhere convergence of series of dilated functions.

Convex and monotone operator functions

Jaspal Singh Aujla, H. L. Vasudeva (1995)

Annales Polonici Mathematici

The purpose of this note is to provide characterizations of operator convexity and give an alternative proof of a two-dimensional analogue of a theorem of Löwner concerning operator monotonicity.

Convex SO ( N ) × SO ( n ) -invariant functions and refinements of von Neumann’s inequality

Bernard Dacorogna, Pierre Maréchal (2007)

Annales de la faculté des sciences de Toulouse Mathématiques

A function  f on M N × n ( ) which is SO ( N ) × SO ( n ) -invariant is convex if and only if its restriction to the subspace of diagonal matrices is convex. This results from Von Neumann type inequalities and appeals, in the case where N = n , to the notion of signed singular value.

Co-solutions of algebraic matrix equations and higher order singular regular boundary value problems

Lucas Jódar, Enrique A. Navarro (1994)

Applications of Mathematics

In this paper we obtain existence conditions and a closed form of the general solution of higher order singular regular boundary value problems. The approach is based on the concept of co-solution of algebraic matrix equations of polynomial type that permits the treatment of the problem without considering an extended first order system as it has been done in the known literature.

Currently displaying 141 – 160 of 168