AbstractIn this paper we introduce an interpolation method for computing the Drazin inverse of a given polynomial matrix. This method is an extension of the known method from [A. Schuster, P. Hippe, Inversion of polynomial matrices by interpolation, IEEE Trans. Automat. Control 37 (3) (1992) 363–365], applicable to usual matrix inverse. Also, we improve our interpolation method, using a more effective estimation of degrees of polynomial matrices generated in Leverrier–Faddeev method. Algorithms are implemented and tested in the symbolic package MATHEMATICA
In the thesis, we review some recent progresses on the study of Drazin inverses and the study of lin...
AbstractGiven polynomials a(λ) of degree m and b(λ) of degree n, we represent the inverse to the Syl...
: Numerical procedures are proposed for triangularizing polynomial matrices over the field of polyno...
AbstractA method is given for computing the Drazin inverse of a square matrix A of order n as a poly...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
: An interpolation approach to reduction into triangular form of an arbitrary polynomial matrix is p...
In this paper we show how to apply Grobner bases to compute the Drazin inverse of a matrix with mult...
Drazin inverse is one of the most significant inverses in the matrix theory, where its computation i...
In this paper, we show how to reduce the computation of Drazin inverses over certain computable fiel...
AbstractWe introduce a method and an algorithm for computing the weighted Moore–Penrose inverse of m...
The objective was to try to develop a useful numerical algorithm for the Drazin inverse and to analy...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
This paper deals with the polynomial interpolation of degree at most n passing through n 1 distinct ...
This paper describes a data parallel algorithm for the inversion of polynomial matrix using evaluati...
A method with high convergence rate for finding approximate inverses of nonsingular matrices is sugg...
In the thesis, we review some recent progresses on the study of Drazin inverses and the study of lin...
AbstractGiven polynomials a(λ) of degree m and b(λ) of degree n, we represent the inverse to the Syl...
: Numerical procedures are proposed for triangularizing polynomial matrices over the field of polyno...
AbstractA method is given for computing the Drazin inverse of a square matrix A of order n as a poly...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
: An interpolation approach to reduction into triangular form of an arbitrary polynomial matrix is p...
In this paper we show how to apply Grobner bases to compute the Drazin inverse of a matrix with mult...
Drazin inverse is one of the most significant inverses in the matrix theory, where its computation i...
In this paper, we show how to reduce the computation of Drazin inverses over certain computable fiel...
AbstractWe introduce a method and an algorithm for computing the weighted Moore–Penrose inverse of m...
The objective was to try to develop a useful numerical algorithm for the Drazin inverse and to analy...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
This paper deals with the polynomial interpolation of degree at most n passing through n 1 distinct ...
This paper describes a data parallel algorithm for the inversion of polynomial matrix using evaluati...
A method with high convergence rate for finding approximate inverses of nonsingular matrices is sugg...
In the thesis, we review some recent progresses on the study of Drazin inverses and the study of lin...
AbstractGiven polynomials a(λ) of degree m and b(λ) of degree n, we represent the inverse to the Syl...
: Numerical procedures are proposed for triangularizing polynomial matrices over the field of polyno...