AbstractA simple algorithm for computing the first n powers of an n×n Hessenberg matrix with unit codiagonal or for evaluating a polynomial of degree ⩽n in such a matrix is proposed in this paper. Several applications of the algorithm are mentioned, including the solution of Lyapunov matrix equations associated with stability problems
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
In this paper an accurate method to construct the bidiagonal factorization of collocation and Wronsk...
AbstractA simple algorithm for computing the first n powers of an n×n Hessenberg matrix with unit co...
AbstractAn efficient algorithm for the computation of powers of an n × n arbitrary lower Hessenberg ...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
AbstractWe develop a constructive procedure for generating nonsingular solutions of the matrix equat...
AbstractAn algorithm is described for the exact computation of the coefficients of the characteristi...
In this paper we provide work on an approach integrating the division algorithm over the polynomial ...
The class of eigenvalue problems for upper Hessenberg matrices of banded-plus-spike form includes co...
AbstractLet H be an n × n unitary right Hessenberg matrix with positive subdiagonal elements. Using ...
summary:The paper is devoted to an algorithm for computing matrices $A^r$ and $(A^r -I).(A-I)^{-1}$ ...
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
AbstractUsing combinatorial methods, we obtain the explicit polynomials for all elements in an arbit...
Abstract. A new algorithm is developed for computing etAB, where A is an n × n matrix and B is n×n0 ...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
In this paper an accurate method to construct the bidiagonal factorization of collocation and Wronsk...
AbstractA simple algorithm for computing the first n powers of an n×n Hessenberg matrix with unit co...
AbstractAn efficient algorithm for the computation of powers of an n × n arbitrary lower Hessenberg ...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
AbstractWe develop a constructive procedure for generating nonsingular solutions of the matrix equat...
AbstractAn algorithm is described for the exact computation of the coefficients of the characteristi...
In this paper we provide work on an approach integrating the division algorithm over the polynomial ...
The class of eigenvalue problems for upper Hessenberg matrices of banded-plus-spike form includes co...
AbstractLet H be an n × n unitary right Hessenberg matrix with positive subdiagonal elements. Using ...
summary:The paper is devoted to an algorithm for computing matrices $A^r$ and $(A^r -I).(A-I)^{-1}$ ...
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
AbstractUsing combinatorial methods, we obtain the explicit polynomials for all elements in an arbit...
Abstract. A new algorithm is developed for computing etAB, where A is an n × n matrix and B is n×n0 ...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
In this paper an accurate method to construct the bidiagonal factorization of collocation and Wronsk...