Results 61 to 70 of about 2,334 (224)

Toeplitz versus Hankel: semibounded operators [PDF]

Opuscula Mathematica, 2018
Our goal is to compare various results for Toeplitz \(T\) and Hankel \(H\) operators. We consider semibounded operators and find necessary and sufficient conditions for their quadratic forms to be closable. This property allows one to define \(T\) and \(
Dmitri R. Yafaev
doaj   +1 more source

Nonnegative Matrix Factorization with Toeplitz Penalty

Journal of Informatics and Mathematical Sciences, 2018
Nonnegative Matrix Factorization (NMF) is an unsupervised learning algorithm that produces a linear, parts-based approximation of a data matrix. NMF constructs a nonnegative low rank basis matrix and a nonnegative low rank matrix of weights which, when multiplied together, approximate the data matrix of interest using some cost function.
Corsetti, Matthew, Fokoué, Ernest
openaire   +3 more sources

Ultra‐Short‐Term Wind Speed Prediction Based on Information Aggregation With Spatial Decoupling in Turbine Cluster Space

IET Renewable Power Generation, Volume 20, Issue 1, January/December 2026.
Core approach: hybrid model combining wake dynamics, spectral clustering and adaptive neighbourhood selection. Methodology: spatial decoupling → representative turbine identification → feature aggregation via memory network. Outcome: enhanced prediction accuracy validated by real‐data comparisons, addressing spatial correlation challenges in wind farms.
Xiaofeng Zhu, Zhenxin Li, Chenghan Hou, Shoukun Zou   +3 more
wiley   +1 more source

Direction of Arrival Estimation Method Based on Eigenvalues and Eigenvectors for Coherent Signals in Impulsive Noise

Mathematics
In this paper, a Toeplitz construction method based on eigenvalues and eigenvectors is proposed to combine with traditional denoising algorithms, including fractional low-order moment (FLOM), phased fractional low-order moment (PFLOM), and correntropy ...
Junyan Cui, Wei Pan, Haipeng Wang
doaj   +1 more source

Multiple-Toeplitz Matrices Reconstruction Algorithm for DOA Estimation of Coherent Signals

IEEE Access, 2019
In this paper, a new direction-of-arrival (DOA) estimation method based on multiple Toeplitz matrices reconstruction is proposed for coherent narrowband signals with a uniform linear array (ULA).
Wei Zhang, Yong Han, Ming Jin, Xiaolin Qiao   +3 more
doaj   +1 more source

Analytical solutions to some generalized and polynomial eigenvalue problems

Special Matrices, 2021
It is well-known that the finite difference discretization of the Laplacian eigenvalue problem −Δu = λu leads to a matrix eigenvalue problem (EVP) Ax =λx where the matrix A is Toeplitz-plus-Hankel.
Deng Quanling
doaj   +1 more source

Polynomial factorization through Toeplitz matrix computations

Linear Algebra and its Applications, 2003
The authors consider a polynomial of the form \[ p(z)=p_0+p_1z+\dots+p_{n-1}z^{n-1}+z^n (p_0 \neq 0) \] for which it is known that there are \(m\geq 1\) zeros in \(\{z\in \mathbb{C}:|z|1\}\) and it is assumed (without loss of generality) that \(m\geq n-m\).
BINI, DARIO ANDREA, BOETTCHER A.
openaire   +1 more source

The sharp upper bound for generation of linear semigroups by higher order equations with fractional powers

Bulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.
Abstract In this paper, we consider a class of higher‐order equations and show a sharp upper bound on fractional powers of unbounded linear operators associated with higher‐order abstract equations in Hilbert spaces.
Flank D. M. Bezerra, Lucas A. Santos, Maria J. M. Silva   +2 more
wiley   +1 more source

FIXED POINT THEOREM FOR AN INFINITE TOEPLITZ MATRIX [PDF]

Bulletin of the Australian Mathematical Society, 2020
AbstractFor an infinite Toeplitz matrix T with nonnegative real entries we find the conditions under which the equation $\boldsymbol {x}=T\boldsymbol {x}$ , where $\boldsymbol {x}$ is an infinite vector column, has a nontrivial bounded positive solution.
openaire   +2 more sources

Combinatorics on number walls and the P(t)$P(t)$‐adic Littlewood conjecture

Mathematika, Volume 72, Issue 1, January 2026.
Abstract In 2004, de Mathan and Teulié stated the p$p$‐adic Littlewood conjecture (p$p$‐LC) in analogy with the classical Littlewood conjecture. Let Fq$\mathbb {F}_q$ be a finite field P(t)$P(t)$ be an irreducible polynomial with coefficients in Fq$\mathbb {F}_q$. This paper deals with the analogue of p$p$‐LC over the ring of formal Laurent series over
Steven Robertson
wiley   +1 more source