Results 91 to 100 of about 475,064 (272)
From superintegrability to tridiagonal representation of β-ensembles
The wonderful formulas by I. Dumitriu and A. Edelman [1,2] rewrite β-ensemble, with eigenvalue integrals containing Vandermonde factors in the power 2β, through integrals over tridiagonal matrices, where β-dependent are the powers of individual matrix ...
A. Mironov, A. Morozov, A. Popolitov
doaj
Hurwitz numbers for reflection groups III: Uniform formulae
Abstract We give uniform formulae for the number of full reflection factorizations of a parabolic quasi‐Coxeter element in a Weyl group or complex reflection group, generalizing the formula for the genus‐0 Hurwitz numbers. This paper is the culmination of a series of three.
Theo Douvropoulos+2 more
wiley +1 more source
On a Discrete Inverse Problem for Two Spectra
A version of the inverse spectral problem for two spectra of finite-order real Jacobi matrices (tridiagonal symmetric matrices) is investigated. The problem is to reconstruct the matrix using two sets of eigenvalues: one for the original Jacobi matrix ...
Gusein Sh. Guseinov
doaj +1 more source
Eigendecomposition of Block Tridiagonal Matrices
Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large matrix sizes. In this paper, we address the problem of the eigendecomposition of block tridiagonal matrices by studying
Sandryhaila, Aliaksei, Moura, Jose M. F.
openaire +2 more sources
Trilogy on Computing Maximal Eigenpair
The eigenpair here means the twins consist of eigenvalue and its eigenvector. This paper introduces the three steps of our study on computing the maximal eigenpair.
AN Langville+6 more
core +1 more source
ABSTRACT Implementation of many statistical methods for large, multivariate data sets requires one to solve a linear system that, depending on the method, is of the dimension of the number of observations or each individual data vector. This is often the limiting factor in scaling the method with data size and complexity.
Dung Pham+2 more
wiley +1 more source
Computing the Maximal Eigenpairs of Large Size Tridiagonal Matrices with O(1) Number of Iterations
. In a series of papers, Chen [ 4–6 ] developed some efficient algorithms for computing the maximal eigenpairs for tridiagonal matrices. The key idea is to explicitly construct effective initials for the maximal eigenpairs and also to employ a self-closed
Tao Yang
semanticscholar +1 more source
This paper presents an efficient numerical scheme for the space–time tempered fractional convection–diffusion equation, where the time derivative is the Caputo‐tempered fractional derivative and the space derivatives are the normalized left and right Riemann–Liouville tempered fractional derivatives.
Dechao Gao+4 more
wiley +1 more source
Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices
In this paper, we obtain an eigenvalue decomposition for any complex skew-persymmetric anti-tridiagonal Hankel matrix where the eigenvector matrix is orthogonal.
Gutiérrez-Gutiérrez Jesús+1 more
doaj +1 more source
Min-plus eigenvalue of tridiagonal matrices in terms of the ultradiscrete Toda equation
The discrete Toda molecule equation can be used to compute eigenvalues of tridiagonal matrices over conventional linear algebra, and is the recursion formula of the well-known quotient difference algorithm for tridiagonal eigenvalues.
Sennosuke Watanabe+3 more
semanticscholar +1 more source