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
We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an in...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
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...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
This paper describes the use of Instruction Systolic Arrays to compute a scalar multiple of the char...
AbstractWe develop a constructive procedure for generating nonsingular solutions of the matrix equat...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
In this paper, the reduction with a scaling strategy from Hessenberg matrix to Frobenius-like form i...
This paper considers the problem of solving certain classes of polynomial systems. This is a well kn...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
AbstractLet H be an n × n unitary right Hessenberg matrix with positive subdiagonal elements. Using ...
We present a parallel modular algorithm for finding characteristic polynomials of matrices with inte...
We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an in...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
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...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
This paper describes the use of Instruction Systolic Arrays to compute a scalar multiple of the char...
AbstractWe develop a constructive procedure for generating nonsingular solutions of the matrix equat...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
In this paper, the reduction with a scaling strategy from Hessenberg matrix to Frobenius-like form i...
This paper considers the problem of solving certain classes of polynomial systems. This is a well kn...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
AbstractLet H be an n × n unitary right Hessenberg matrix with positive subdiagonal elements. Using ...
We present a parallel modular algorithm for finding characteristic polynomials of matrices with inte...
We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an in...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
DOI
Add to ORKG