AbstractIt is a well-known fact that while reducing a symmetric matrix into a similar tridiagonal one, the already tridiagonal matrix in the partially reduced matrix has as eigenvalues the Lanczos–Ritz values. This behavior is also shared by the reduction algorithm which transforms symmetric matrices via orthogonal similarity transformations to semiseparable form. Moreover also the orthogonal reduction to Hessenberg form has a similar behavior with respect to the Arnoldi–Ritz values.In this paper we investigate the orthogonal similarity transformations creating this behavior. Two easy conditions are derived, which provide necessary and sufficient conditions, such that the partially reduced matrices have the desired convergence behavior. The...
In this paper two fast algorithms that use orthogonal similarity transformations to convert a symmet...
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
AbstractThe Lanczos algorithm for tridiagonalizing a given matrix A generates a sequence of approxim...
It is a well-known fact that while reducing a symmetric matrix into a similar tridiagonal one, the a...
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,...
It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation...
AbstractThe Lanczos tridiagonalization orthogonally transforms a real symmetric matrix A to symmetri...
In this paper we describe an orthogonal similarity transformation for transforming arbitrary symmetr...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
AbstractThe problem of simultaneous reduction of real matrices by either orthogonal similarity or or...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
We will discuss two inverse eigenvalue problems. First, given the eigenvalues and a weight vector a ...
Masters thesisIn this thesis we examine the connections between orthogonal polynomials and the Lanc...
AbstractThe Lanczos tridiagonalization orthogonally transforms a real symmetric matrix A to symmetri...
In this paper two fast algorithms that use orthogonal similarity transformations to convert a symmet...
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
AbstractThe Lanczos algorithm for tridiagonalizing a given matrix A generates a sequence of approxim...
It is a well-known fact that while reducing a symmetric matrix into a similar tridiagonal one, the a...
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,...
It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation...
AbstractThe Lanczos tridiagonalization orthogonally transforms a real symmetric matrix A to symmetri...
In this paper we describe an orthogonal similarity transformation for transforming arbitrary symmetr...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
AbstractThe problem of simultaneous reduction of real matrices by either orthogonal similarity or or...
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given...
We will discuss two inverse eigenvalue problems. First, given the eigenvalues and a weight vector a ...
Masters thesisIn this thesis we examine the connections between orthogonal polynomials and the Lanc...
AbstractThe Lanczos tridiagonalization orthogonally transforms a real symmetric matrix A to symmetri...
In this paper two fast algorithms that use orthogonal similarity transformations to convert a symmet...
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
AbstractThe Lanczos algorithm for tridiagonalizing a given matrix A generates a sequence of approxim...