Elsner L, Fasse A, Langmann E. A divide-and-conquer method for the tridiagonal generalized eigenvalue problem. Journal of Computational and Applied Mathematics. 1997;86(1):141-148.We introduce a divide-and-conquer method for the generalized eigenvalue problem Ax = lambda Bx, where A and B are real symmetric tridiagonal matrices and B is positive-definite. It is a generalization of Cuppen's method for the standard eigenvalue problem, B = I, which is based on rank-one modifications. Our method is an alternative to a method developed by Borges and Gragg using restrictions and extensions
Divide-and-conquer (DC) is one of the fastest algorithms for eigenproblem of a large-size symmetric ...
A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eige...
[2] P. A. Businger. Numerically stable deflation of Hessenberg and symmetric tridiagonal matrices. B...
A divide-and-conquer method is developed for solving the generalized eigenvalue problem Ax = Bx, whe...
AbstractWe introduce a divide-and-conquer method for the generalized eigenvalue problem Ax = λBx, wh...
In this chapter we deal with an algorithm that is designed for the efficient solution of the symmetr...
The authors present a stable and efficient divide-and-conquer algorithm for computing the spectral d...
In computational science symmetric eigenvalue problems are central and the need for fast and accura...
In computational science symmetric eigenvalue problems are central and the need for fast and accura...
In computational science symmetric eigenvalue problems are central and the need for fast and accura...
We improve divide-and-conquer with multiple divisions for real symmetric tridiagonal eigenproblem pr...
real symmetric definit e t ridiagonal eigenproblem. The algorit hm employs t echniques first propose...
A divide-and-conquer method for computing eigenvalues and eigenvectors of a block-tridiagonal matrix...
[出版社版]rights: 日本応用数理学会 rights: 本文データは学協会の許諾に基づきCiNiiから複製したものである relation: IsVersionOf: http://ci.nii...
[出版社版]rights: 日本応用数理学会 rights: 本文データは学協会の許諾に基づきCiNiiから複製したものである relation: IsVersionOf: http://ci.nii...
Divide-and-conquer (DC) is one of the fastest algorithms for eigenproblem of a large-size symmetric ...
A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eige...
[2] P. A. Businger. Numerically stable deflation of Hessenberg and symmetric tridiagonal matrices. B...
A divide-and-conquer method is developed for solving the generalized eigenvalue problem Ax = Bx, whe...
AbstractWe introduce a divide-and-conquer method for the generalized eigenvalue problem Ax = λBx, wh...
In this chapter we deal with an algorithm that is designed for the efficient solution of the symmetr...
The authors present a stable and efficient divide-and-conquer algorithm for computing the spectral d...
In computational science symmetric eigenvalue problems are central and the need for fast and accura...
In computational science symmetric eigenvalue problems are central and the need for fast and accura...
In computational science symmetric eigenvalue problems are central and the need for fast and accura...
We improve divide-and-conquer with multiple divisions for real symmetric tridiagonal eigenproblem pr...
real symmetric definit e t ridiagonal eigenproblem. The algorit hm employs t echniques first propose...
A divide-and-conquer method for computing eigenvalues and eigenvectors of a block-tridiagonal matrix...
[出版社版]rights: 日本応用数理学会 rights: 本文データは学協会の許諾に基づきCiNiiから複製したものである relation: IsVersionOf: http://ci.nii...
[出版社版]rights: 日本応用数理学会 rights: 本文データは学協会の許諾に基づきCiNiiから複製したものである relation: IsVersionOf: http://ci.nii...
Divide-and-conquer (DC) is one of the fastest algorithms for eigenproblem of a large-size symmetric ...
A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eige...
[2] P. A. Businger. Numerically stable deflation of Hessenberg and symmetric tridiagonal matrices. B...