Results 101 to 110 of about 615 (135)
Some of the next articles are maybe not open access.

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

Numerical ranges of Hankel matrices

Linear Algebra and its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hwa-Long Gau, Pei Yuan Wu
openaire   +2 more sources

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, Juan R. Sendra
openaire   +1 more source

Toeplitz and Hankel matrices

Russian Mathematical Surveys, 1986
This is a survey paper on circulant, skew circulant and \(\theta\)- circulant matrices and on the fast numerical solution of linear equations by using the circulant, skew circulant, Toeplitz and Hankel matrices.
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

Hankel matrices and minifunctions

Numerical Functional Analysis and Optimization, 1985
If is an infinite Hankel matrix which represents a compact operator on Hilbert space, then there is a unique function f in L∞ having a0,a1,a2j,… as its Fourier co-efficients of non-negative index and satisfying . An algorithm based on [11] is used to approximate numerically the remaining Fourier coefficients of f in case {an} is real and converges to ...
openaire   +1 more source

Euclidean Algorithm and Hankel Matrices

AIP Conference Proceedings, 2007
New relations are established between continued fractions and Hankel matrices. In particular, they explain why the Euclidean algorithm works correctly for picking up a nontrivial vector from the nullspace of a Hankel matrix.
E. E. Tyrtyshnikov   +3 more
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

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

SECOND HANKEL DETERMINANT OF LOGARITHMIC COEFFICIENTS OF CONVEX AND STARLIKE FUNCTIONS

Bulletin of the Australian Mathematical Society, 2022
Bogumiła Kowalczyk, Adam Lecko
exaly  

Home - About - Disclaimer - Privacy