Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems.
Ng, Michael K. (1994)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Displaying similar documents to “Linear prediction: Mathematics and engineering.”
Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems.
Application of the partitioning method to specific Toeplitz matrices
Predrag Stanimirović, Marko Miladinović, Igor Stojanović, Sladjana Miljković (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
We propose an adaptation of the partitioning method for determination of the Moore-Penrose inverse of a matrix augmented by a block-column matrix. A simplified implementation of the partitioning method on specific Toeplitz matrices is obtained. The idea for observing this type of Toeplitz matrices lies in the fact that they appear in the linear motion blur models in which blurring matrices (representing the convolution kernels) are known in advance. The advantage of the introduced method...
On the computation of the null space of Toeplitz-like matrices.
Mastronardi, Nicola, Van Barel, Marc, Vandebril, Raf (2008)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
On the fast reduction of symmetric rationally generated Toeplitz matrices to tridiagonal form.
Frederix, K., Gemignani, L., Van Barel, M. (2009)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
A simple proof of the classification of normal Toeplitz matrices.
Arimoto, Akio (2002)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Preconditioning block Toeplitz matrices.
Huckle, Thomas K., Noutsos, Dimitrios (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Companion matrices and their relations to Toeplitz and Hankel matrices
Yousong Luo, Robin Hill (2015)
Special Matrices
Similarity:
In this paper we describe some properties of companion matrices and demonstrate some special patterns that arisewhen a Toeplitz or a Hankel matrix is multiplied by a related companion matrix.We present a necessary and sufficient condition, generalizing known results, for a matrix to be the transforming matrix for a similarity between a pair of companion matrices. A special case of our main result shows that a Toeplitz or a Hankel matrix can be extended using associated companion matrices,...
Unitary automorphisms of the space of Toeplitz-plus-Hankel matrices
A.K. Abdikalykov, V.N. Chugunov, Kh.D. Ikramov (2015)
Special Matrices
Similarity:
Our motivation was a paper of 1991 indicating three special unitary matrices that map Hermitian Toeplitz matrices by similarity into real Toeplitz-plus-Hankel matrices. Generalizing this result, we give a complete description of unitary similarity automorphisms of the space of Toeplitz-plus-Hankel matrices.
On decomposition of k-tridiagonal ℓ-Toeplitz matrices and its applications
A. Ohashi, T. Sogabe, T.S. Usuda (2015)
Special Matrices
Similarity:
We consider a k-tridiagonal ℓ-Toeplitz matrix as one of generalizations of a tridiagonal Toeplitz matrix. In the present paper, we provide a decomposition of the matrix under a certain condition. By the decomposition, the matrix is easily analyzed since one only needs to analyze the small matrix obtained from the decomposition. Using the decomposition, eigenpairs and arbitrary integer powers of the matrix are easily shown as applications.
Spectral norm of random large dimensional noncentral Toeplitz and Hankel matrices.
Bose, Arup, Sen, Arnab (2007)
Electronic Communications in Probability [electronic only]
Similarity:
An upper bound on the number of monomials in determinants of sparse matrices with symbolic entries.
Kalkbrener, M. (1997)
Mathematica Pannonica
Similarity:
Fast and accurate methods of independent component analysis: A survey
Petr Tichavský, Zbyněk Koldovský (2011)
Kybernetika
Similarity:
This paper presents a survey of recent successful algorithms for blind separation of determined instantaneous linear mixtures of independent sources such as natural speech or biomedical signals. These algorithms rely either on non-Gaussianity, nonstationarity, spectral diversity, or on a combination of them. Performance of the algorithms will be demonstrated on separation of a linear instantaneous mixture of audio signals (music, speech) and on artifact removal in electroencephalogram...