Abstract. We consider a problem of simultaneous reduction of a sequence of matrices by means of orthogonal transformations. We show that such reduction can be performed by a series of the deflation steps. At each deflation step a simultaneous eigenvalue problem, which is a direct generalization of the generalized eigenvalue problem, is solved. A fast variant of Gauss-Newton algorithm for its solution was proposed and the local convergence properties were investigated. We illustrate the effectiveness of our algorithm by some numerical examples. Key words. Simultaneous reduction of matrices, fast algorithms, convergence estimates 1. Introduction. Th
AbstractThis paper is concerned with simultaneous reduction to triangular and companion forms of pai...
It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation...
An algorithm to reduce a symmetric matrix to a similar semiseparable one of semiseparability rank 1,...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
AbstractThe problem of simultaneous reduction of real matrices by either orthogonal similarity or or...
AbstractWe present and prove the validity of an algorithm constructing a simultaneous triangularizat...
AbstractLet S be a set of n × n matrices over a field F, and A the algebra generated by S over F. Th...
AbstractThe problem of simultaneous reduction of real matrices by either orthogonal similarity or or...
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversio...
AbstractWe discuss efficient conversion algorithms for orthogonal polynomials. We describe a known c...
In this paper two fast algorithms that use orthogonal similarity transformations to convert a symmet...
. An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is...
AbstractThis paper is concerned with simultaneous reduction to triangular and companion forms of pai...
It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation...
An algorithm to reduce a symmetric matrix to a similar semiseparable one of semiseparability rank 1,...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
International audienceThis paper proposes a Newton-type method to solve numerically the eigenproblem...
AbstractThe problem of simultaneous reduction of real matrices by either orthogonal similarity or or...
AbstractWe present and prove the validity of an algorithm constructing a simultaneous triangularizat...
AbstractLet S be a set of n × n matrices over a field F, and A the algebra generated by S over F. Th...
AbstractThe problem of simultaneous reduction of real matrices by either orthogonal similarity or or...
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversio...
AbstractWe discuss efficient conversion algorithms for orthogonal polynomials. We describe a known c...
In this paper two fast algorithms that use orthogonal similarity transformations to convert a symmet...
. An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is...
AbstractThis paper is concerned with simultaneous reduction to triangular and companion forms of pai...
It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation...
An algorithm to reduce a symmetric matrix to a similar semiseparable one of semiseparability rank 1,...