AbstractAn efficient algorithm for the computation of powers of an n × n arbitrary lower Hessenberg matrix is presented. Numerical examples are used to show the computational details. A comparison of the algorithm with two other methods of matrix multiplication proposed by Brent and by Winograd is included. Related algorithms were proposed earlier by Datta and Datta for lower Hessenberg matrices with unit super-diagonal elements, and by Barnett for the companion matrix
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
We develop two fast algorithms for Hessenberg reduction of a structured matrix $A = D + UV^H$, where...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
AbstractAn efficient algorithm for the computation of powers of an n × n arbitrary lower Hessenberg ...
AbstractA simple algorithm for computing the first n powers of an n×n Hessenberg matrix with unit co...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
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}$ ...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Some fast algorithms for computing the eigenvalues of a block companion matrix A=U+XYH, where U∈Cn×n...
This paper describes the use of Instruction Systolic Arrays to compute a scalar multiple of the char...
Abstract. A new algorithm is developed for computing arbitrary real powers Ap of a matrix A ∈ Cn×n. ...
Hermitian plus possibly unhermitian low rank matrices can be efficiently reduced into Hessenberg for...
AbstractThe lower half of the inverse of a lower Hessenberg matrix is shown to have a simple structu...
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
We develop two fast algorithms for Hessenberg reduction of a structured matrix $A = D + UV^H$, where...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
AbstractAn efficient algorithm for the computation of powers of an n × n arbitrary lower Hessenberg ...
AbstractA simple algorithm for computing the first n powers of an n×n Hessenberg matrix with unit co...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
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}$ ...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Some fast algorithms for computing the eigenvalues of a block companion matrix A=U+XYH, where U∈Cn×n...
This paper describes the use of Instruction Systolic Arrays to compute a scalar multiple of the char...
Abstract. A new algorithm is developed for computing arbitrary real powers Ap of a matrix A ∈ Cn×n. ...
Hermitian plus possibly unhermitian low rank matrices can be efficiently reduced into Hessenberg for...
AbstractThe lower half of the inverse of a lower Hessenberg matrix is shown to have a simple structu...
In 1971, Householder and Fox [26] introduced a method for computing an orthonormal basis for the ran...
We develop two fast algorithms for Hessenberg reduction of a structured matrix $A = D + UV^H$, where...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
DOI
Add to ORKG