EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 241 – 260 of 425

On the coefficients of the max-algebraic characteristic polynomial and equation

Peter Butkovič (2003)

Kybernetika

No polynomial algorithms are known for finding the coefficients of the characteristic polynomial and characteristic equation of a matrix in max- algebra. The following are proved: (1) The task of finding the max-algebraic characteristic polynomial for permutation matrices encoded using the lengths of their constituent cycles is NP-complete. (2) The task of finding the lowest order finite term of the max-algebraic characteristic polynomial for a ${0, - \infty}$ matrix can be converted to the assignment problem....

On the composition of nondegenerate quadratic forms with an arbitrary index

Julian Ławrynowicz, Jakub Rembieliński (1990)

Annales de la Faculté des sciences de Toulouse : Mathématiques

On the composition of nondegenerate quadratic forms with an arbitrary index

Julian Ławrynowicz, Jakub Rembieliński (1989)

Annales de la Faculté des sciences de Toulouse : Mathématiques

On the computation of the minimal polynomial of a polynomial matrix

Nicholas Karampetakis, Panagiotis Tzekis (2005)

International Journal of Applied Mathematics and Computer Science

The main contribution of this work is to provide two algorithms for the computation of the minimal polynomial of univariate polynomial matrices. The first algorithm is based on the solution of linear matrix equations while the second one employs DFT techniques. The whole theory is illustrated with examples.

On the computation of the null space of Toeplitz-like matrices.

Mastronardi, Nicola, Van Barel, Marc, Vandebril, Raf (2008)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

On the confidence region of a vector parameter

Júlia Volaufová (1980)

Mathematica Slovaca

On the connection between Kronecker and Hadamard convolution products of matrices and some applications.

Kılıçman, Adem, Zhour, Zeyad Al (2009)

Journal of Inequalities and Applications [electronic only]

On the construction and the realization of wild monoids

Pavel Růžička (2018)

Archivum Mathematicum

We develop elementary methods of computing the monoid $𝒱 (R)$ for a directly-finite regular ring $R$ . We construct a class of directly finite non-cancellative refinement monoids and realize them by regular algebras over an arbitrary field.

On the construction of explicit solutions to the matrix equation $X^{2} A X = A X A$ .

Li, Aihua, Mosteig, Edward (2010)

ELA. The Electronic Journal of Linear Algebra [electronic only]

On the convergence theory of double $K$ -weak splittings of type II

Vaibhav Shekhar, Nachiketa Mishra, Debasisha Mishra (2022)

Applications of Mathematics

Recently, Wang (2017) has introduced the $K$ -nonnegative double splitting using the notion of matrices that leave a cone $K \subseteq ℝ^{n}$ invariant and studied its convergence theory by generalizing the corresponding results for the nonnegative double splitting by Song and Song (2011). However, the convergence theory for $K$ -weak regular and $K$ -nonnegative double splittings of type II is not yet studied. In this article, we first introduce this class of splittings and then discuss the convergence theory for these sub-classes...

On the cover problems of geometric theory

Nicos Karcanias, Dimitris Vafiadis (1993)

Kybernetika

On the $D$ -stability problem for real matrices

Russell Johnson, Alberto Tesi (1999)

Bollettino dell'Unione Matematica Italiana

Vengono discusse delle condizioni sufficienti affinchè una matrice reale $A$ delle dimensioni $n \times n$ sia diagonalmente (o $D$ -) stabile. Esse includono delle ipotesi geometriche (condizioni degli ortanti), e un criterio che generalizza un criterio di Carlson. Inoltre si discute la $D$ -stabilità robusta per le matrici reali delle dimensioni $4 \times 4$

On the Davis-Kahan-Weinberger Solution of the Norm-Preserving Dilation Problem.

Jean Meinguet (1986)

Numerische Mathematik

On the decidability of semigroup freeness∗

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

Currently displaying 241 – 260 of 425

Previous Page 13 Next

Displaying 241 – 260 of 425

On the coefficients of the max-algebraic characteristic polynomial and equation

On the composition of nondegenerate quadratic forms with an arbitrary index

On the composition of nondegenerate quadratic forms with an arbitrary index

On the computation of the minimal polynomial of a polynomial matrix

On the computation of the null space of Toeplitz-like matrices.

On the confidence region of a vector parameter

On the connection between Kronecker and Hadamard convolution products of matrices and some applications.

On the construction and the realization of wild monoids

On the construction of explicit solutions to the matrix equation $X^{2} A X = A X A$ .

On the convergence theory of double $K$ -weak splittings of type II

On the cover problems of geometric theory

On the $D$ -stability problem for real matrices

On the Davis-Kahan-Weinberger Solution of the Norm-Preserving Dilation Problem.

On the decidability of semigroup freeness∗

On the decidability of semigroup freeness

On the decidability of semigroup freeness∗

On the decoupling of one class of multivariable systems

On the defining polynomials of maximal real cyclotomic extensions.

On the Definition of a Quadratic Form

On the degree of nilpotency of the radical of relatively free algebras.

Currently displaying 241 – 260 of 425