Results 11 to 20 of about 427,210 (205)
Chebyshev–Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices [PDF]
Fast algorithms for the numerical solution of linear systems with centrosymmetric Toeplitz plus Hankel matrices are developed. They make use of the symmetries, by splitting and partitioning the matrix. The relations between Chebyshev polynomials and Chebyshev-Hankel matrices give rise to algorithms based on real trigonometric transforms.
Georg Heinig, Heinig, Georg
openaire +3 more sources
Positive Hankel Matrices, Eigenvalues and Total Positivity
For positive Hankel matrices, an interval containing all eigenvalues is obtained. With a stronger condition, we also construct two sharper intervals for the eigenvalue localization. The total positivity of positive Hankel matrices is analyzed.
Juan Manuel Peña
doaj +2 more sources
Hankel and Loewner matrices [PDF]
Es sei \(A=(a_{i,k}) (i,k=0,...,n-1)\) eine komplexe Matrix. Gilt mit komplexen Zahlen \(c_ 0,...,c_{2n-2}\) einerseits \(a_{i,k}=c_{i+k}\), so heißt A Hankel-Matrix, oder andererseits \(a_{i,k}=c_{n+i-k}\), so heißt A Toeplitz-Matrix. Schließlich wird A eine Loewner-Matrix genannt, wenn \(a_{i,k}=(c_ i-d_ k)(y_ i-z_ k)^{-1}\) entsprechend mit ...
Miroslav Fiedler, Fiedler, Miroslav
openaire +3 more sources
Generalized Bezoutians and block Hankel matrices [PDF]
Let W(z) be a rational matrix, \(W(\infty)=0,\) \(W(z)=\sum_{i>0}W_ iz^{-i}.\) Let F(z) be \(p\times p\)-, D(z) \(q\times q\)-, G and U \(p\times q\)-polynomial matrices, F and D nonsingular, and let \(F^{-1}G=UD^{- 1}=W\). The Bézoutian \(B=B(F,G;U,D)\) is the rp\(\times sq\) matrix B whose \(p\times q\) block \(B_{ij}\) is defined by \((F(z)U(y)-G(z ...
Wimmer, Harald K., Harald K. Wimmer
openaire +2 more sources
Integrable operators and squares of Hankel operators. [PDF]
Integrable operators arise in random matrix teory, where they describe the asymptotic distributions of large self-adjoint random matrices from the generalized unitary ensembles.
Blower, Gordon
core +5 more sources
Linear systems and determinantal random point fields. [PDF]
Tracy and Widom showed that fundamentally important kernels in random matrix theory arise from systems of differential equations with rational coefficient.
Blower, Gordon
core +5 more sources
Stable factorization for Hankel and Hankel‐like matrices [PDF]
AbstractThis paper gives fast O(n2) algorithms for the factorization of positive‐definite and indefinite Hankel matrices. The algorithms are based on the concept of displacement structure and are valid for the more general class of Hankel‐like matrices. The positive‐definite algorithm is proven to be backward stable.
Vadim Olshevsky, Michael Stewart 0005
openaire +2 more sources
On Determinantal Varieties of Hankel Matrices [PDF]
Let ℌ be a class of n×n Hankel matrices HA whose entries, depending on a given matrix A, are linear forms in n variables with coefficients in a finite field 𝔽q. For every matrix in ℌ, it is shown that the varieties specified by the leading minors of orders from 1 to n-1 have the same number qn-1 of points in 𝔽qn.
Edoardo Ballico, Michele Elia
openaire +4 more sources
Super-optimal approximation by meromorphic functions. [PDF]
Let G be a matrix function of type m × n and suppose that G is expressible as the sum of an H∞ function and a continuous function on the unit circle. Suppose also that the (k – 1)th singular value of the Hankel operator with symbol G is greater than the ...
Young, N. J., Peller, V. V.
core +4 more sources
Hankel operators that commute with second order differential operators. [PDF]
Suppose that $\Gamma$ is a continuous and self-adjoint Hankel operator on $L^2(0, \infty )$ with kernel $\phi (x+y)$ and that $Lf=-(d/dx)(a(x)df/dx)+b(x)f(x) with $a(0)=0$.
Blower, Gordon
core +5 more sources

