An efficient algorithm for evaluating the matrix polynomial I+A+A <SUP>2</SUP>+...+A<SUP>N-1</SUP> is developed. The proposed scheme is simple and eliminates the difficulties encountered in applying a procedure recently reported by D. Westreich (see IEEE Trans. Circuits Syst., vol.36, no.1, p.162-164, Jan. 1989)
[EN] Recently, two general methods for evaluating matrix polynomials requiring one matrix product le...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
An efficient algorithm for evaluating the matrix polynomial I+A+A2+…+AN-1 is developed. The proposed...
: Two algorithms are proposed for evaluating the rank of an arbitrary polynomial matrix. They rely u...
Many state-of-the-art algorithms reduce the computation of transcendental matrix functions to the ev...
The problem of evaluating a polynomial p(x) in a matrix A arises in many applications, e.g. the Tay...
We survey and unify recent results on the existence of accurate algorithms for evaluating multivaria...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
In this paper a new iterative algorithm is presented for the numerical evaluation of matrix polynomi...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 22495, issue : a.1996 n....
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
Computing a matrix polynomial is the basic process in the calculation of functions of matrices by th...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
[EN] Recently, two general methods for evaluating matrix polynomials requiring one matrix product le...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
An efficient algorithm for evaluating the matrix polynomial I+A+A2+…+AN-1 is developed. The proposed...
: Two algorithms are proposed for evaluating the rank of an arbitrary polynomial matrix. They rely u...
Many state-of-the-art algorithms reduce the computation of transcendental matrix functions to the ev...
The problem of evaluating a polynomial p(x) in a matrix A arises in many applications, e.g. the Tay...
We survey and unify recent results on the existence of accurate algorithms for evaluating multivaria...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
In this paper a new iterative algorithm is presented for the numerical evaluation of matrix polynomi...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 22495, issue : a.1996 n....
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
Computing a matrix polynomial is the basic process in the calculation of functions of matrices by th...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
[EN] Recently, two general methods for evaluating matrix polynomials requiring one matrix product le...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
DOI
Add to ORKG