Sciweavers

19 search results - page 1 / 4
» Parallel block tridiagonalization of real symmetric matrices
Sort
View
JPDC
2008
135views more  JPDC 2008»
13 years 5 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward
ICPPW
2002
IEEE
13 years 10 months ago
Parallel Cholesky Factorization of a Block Tridiagonal Matrix
In this paper we discuss the parallel implementation of the Cholesky factorization of a positive definite symmetric matrix when that matrix is block tridiagonal. While parallel im...
Thuan D. Cao, John F. Hall, Robert A. van de Geijn
MOC
2000
173views more  MOC 2000»
13 years 5 months ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...
MOC
1998
71views more  MOC 1998»
13 years 5 months ago
Factorizing complex symmetric matrices with positive definite real and imaginary parts
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
Nicholas J. Higham
ICASSP
2009
IEEE
14 years 8 days ago
Block Jacobi-type methods for non-orthogonal joint diagonalisation
In this paper, we study the problem of non-orthogonal joint diagonalisation of a set of real symmetric matrices. A family of block Jacobitype methods are proposed to optimise two ...
Hao Shen, Knut Hüper