We present an algorithm for the approximation of the dominant singular values and corresponding right and left singular vectors of a complex symmetric matrix. The method is based on two short-term recurrences first proposed by Saunders, Simon and Yip for a non-Hermitian linear system solver. With s
On the discriminant of real symmetric matrices
β Scribed by Peter D. Lax
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 196 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative-definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretizatio
Let M = m ij be a random n Γ n matrix over GF(2). Each matrix entry m ij is independently and identically distributed, with Pr m ij = 0 = 1 -p n and Pr m ij = 1 = p n . The probability that the matrix M is nonsingular tends to c 2 β 0 28879 provided min p 1 -p β₯ log n + d n /n for any d n β β. Sharp
Let N = N (q) be the number of nonzero digits in the binary expansion of the odd integer q. A construction method is presented which produces, among other results, a block circulant complex Hadamard matrix of order 2 Ξ± q, where Ξ± β₯ 2N -1. This improves a recent result of Craigen regarding the asympt
An algorithm for the evaluation of matrix representations of products of permutation operators and of one-and two-electron spin-dependent operators in a spin-adapted basis of the N-electron spin space is presented. In particular, the case of the basis functions in which pΠ electrons are described by