An efficient algorithm for evaluating the matrix polynomial I+A+A2+…+AN-1 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
International audienceWe propose an effi cient hardware-oriented method for evaluating complex polyn...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can b...
An efficient algorithm for evaluating the matrix polynomial I+A+A <SUP>2</SUP>+...+A<SUP>N-1</SUP> i...
: Two algorithms are proposed for evaluating the rank of an arbitrary polynomial matrix. They rely u...
We survey and unify recent results on the existence of accurate algorithms for evaluating multivaria...
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...
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...
Computing a matrix polynomial is the basic process in the calculation of functions of matrices by th...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 22495, issue : a.1996 n....
[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...
SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(84/22) / BLDSC - British L...
International audienceWe propose an effi cient hardware-oriented method for evaluating complex polyn...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can b...
An efficient algorithm for evaluating the matrix polynomial I+A+A <SUP>2</SUP>+...+A<SUP>N-1</SUP> i...
: Two algorithms are proposed for evaluating the rank of an arbitrary polynomial matrix. They rely u...
We survey and unify recent results on the existence of accurate algorithms for evaluating multivaria...
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...
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...
Computing a matrix polynomial is the basic process in the calculation of functions of matrices by th...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 22495, issue : a.1996 n....
[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...
SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(84/22) / BLDSC - British L...
International audienceWe propose an effi cient hardware-oriented method for evaluating complex polyn...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can b...