Results 31 to 40 of about 1,086 (62)
Recurrence relation for the 6j-symbol of su_q(2) as a symmetric eigenvalue problem
, 2015 A well known recurrence relation for the 6j-symbol of the quantum group su_q(2) is realized as a tridiagonal, symmetric eigenvalue problem. This formulation can be used to implement an efficient numerical evaluation algorithm, taking advantage of ...
Anderson E. +3 more
core +1 more source
Analysis of the singular value decomposition as a tool for processing microarray expression data [PDF]
, 2005 We give two informative derivations of a spectral algorithm for clustering and partitioning a bi-partite graph. In the first case we begin with a discrete optimization problem that relaxes into a tractable continuous analogue.
Higham, D.J., Kalna, G., Vass, J.K.
core
A Dimension Reduction Scheme for the Computation of Optimal Unions of Subspaces [PDF]
, 2011 Given a set of points \F in a high dimensional space, the problem of finding a union of subspaces \cup_i V_i\subset \R^N that best explains the data \F increases dramatically with the dimension of \R^N.
Aldroubi, Akram +3 more
core +1 more source
, 2019 We propose a verified computation method for partial eigenvalues of a Hermitian generalized eigenproblem. The block Sakurai-Sugiura Hankel method, a contour integral-type eigensolver, can reduce a given eigenproblem into a generalized eigenproblem of ...
Imakura, Akira +2 more
core +1 more source
Eigenpairs of adjacency matrices of balanced signed graphs
Special MatricesIn this article, we study eigenvalues λ\lambda and their associated eigenvectors xx of the adjacency matrices AA of balanced signed graphs. Balanced signed graphs were first introduced and studied by Harary to handle a problem in social psychology ...
Chen Mei-Qin
doaj +1 more source
Special MatricesThe generalized eigenvalue problem is a significant topic with numerous applications in scientific and technological computing. Therefore, verifying the reliability of the results produced by numerical solvers is crucial.
Ozaki Katsuhisa, Terao Takeshi
doaj +1 more source
Iterative building of Barabanov norms and computation of the joint spectral radius for matrix sets
, 2010 The problem of construction of Barabanov norms for analysis of properties of the joint (generalized) spectral radius of matrix sets has been discussed in a number of publications.
Kozyakin, Victor
core +1 more source
Geršhgorin-type theorems for Z1-eigenvalues of tensors with applications
Demonstratio MathematicaIn this article, we present several Geršhgorin-type theorems for Z1{Z}_{1}-eigenvalues of tensors, which improve the results provided by Wang et al. (Some upper bounds on Zt{Z}_{t}-eigenvalues of tensors, Appl. Math. Comput.
Shen Xiaowei +3 more
doaj +1 more source
Large-scale computation of pseudospectra using ARPACK and eigs [PDF]
, 2000 ARPACK and its MATLAB counterpart, eigs, are software packages that calculate some eigenvalues of a large non-symmetric matrix by Arnoldi iteration with implicit restarts. We show that at a small additional cost, which diminishes relatively as the matrix
Trefethen, Lloyd N., Wright, Thomas G.
core +1 more source
A note on the growth factor in Gaussian elimination for generalized Higham matrices
, 2013 The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and positive definite and $\mathrm{i}=\sqrt{-1}$ is the imaginary unit. For any Higham matrix A, Ikramov et al.
Gu, Xian-Ming +2 more
core