Results 171 to 180 of about 427,210 (205)

The smallest eigenvalue of large Hankel matrices [PDF]

Applied Mathematics and Computation, 2018
19 pages, 4 ...
Mengkun Zhu, Niall Emmart
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Hankel matrices and polynomials

1989
In this paper we study a special kind of Hankel matrices with entries in an unique factorization domain (U.F.D.). It is used to construct an algorithm to determine the resultant and the greatest common divisor (G.C.D.) of multivariate polynomials.
Juan Llovet, J. Rafael Sendra
openaire   +1 more source

Boundedness of Hankel Matrices

Journal of the London Mathematical Society, 1984
Let \((a_{i+j})_{i,j\geq 0}\) be a Hankel matrix with complex elements satisfying the condition \(\sum^{\infty}_{n=0}| a_ n ...
openaire   +1 more source

ON HANKEL MATRICES AND FORMS

Mathematics of the USSR-Sbornik, 1969
In this paper, using the method of extensions, we establish a series of new results for Hankel matrices and forms. Bibliography 7 items.
openaire   +2 more sources

Topology of Hankel matrices and applications

Journal of Geometry and Physics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eman Ahmad, Cenap Ozel, Selcuk Koyuncu
openaire   +2 more sources

Hankel matrices and computer algebra

ACM SIGSAM Bulletin, 1990
In this paper we show some results concerning symbolic manipulation of Hankel matrices, as well as some applications of these matrices to Computer Algebra. We present algorithmic approaches, based on Hankel matrices, to the calculation of multivariate polynomial resultants, to polynomial gcd computations including ...
openaire   +1 more source

Conditions for Boundedness of Hankel Matrices

Bulletin of the London Mathematical Society, 1994
The author obtains a new sufficient condition for an infinite Hankel matrix \((a_{i+ j})_{i, j\geq 0}\) to determine a bounded linear operator on a Hilbert space. One form of this condition is that we can write \(a_ k= \lambda_ k \alpha_ k\), with \(\{\lambda_ k\}\) a decreasing sequence in \(\ell^ 2\) and \(\{\alpha_ k\}\) satisfying, for some ...
openaire   +2 more sources

Fast inversion of Hankel and Toeplitz matrices

Information Processing Letters, 1992
A computational algorithm for the inversion of Hankel and Toeplitz matrices is presented. The main goal of this note is to bring out the intimate connection between the Euclidean scheme and the inversion of Toeplitz and Hankel matrices without references to the Padé tables.
Luca Gemignani
exaly   +3 more sources

On normal Hankel matrices

Journal of Mathematical Sciences, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ikramov, Kh. D., Chugunov, V. N.
openaire   +1 more source

Computing the inertia of bezout and Hankel matrices

Calcolo, 1991
This paper is concerned with a sequential algorithm for computing the diagonal matrix \(D\) in the block \(LDL^ T\) factorization which evaluates the inertia of real Hankel and Bézout matrices \(A\) (i.e., the numbers of eigenvalues of \(A\) with positive, zero, and negative real parts).
openaire   +2 more sources