Results 141 to 150 of about 4,117 (168)

Parallel algorithms for Toeplitz matrix operations

ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
Algorithms for multiplication and inversion of ToepIitz matrices are presented that take advantage of the special structure of ToepIitz forms and the parallelism offered by concurrent processors. Multiplication of two general n×n Toeplitz matrices is defined on an array of 2n-1 processing elements.
Camille C. Price, Moktar A. Salama
openaire   +1 more source

A Proposal for Toeplitz Matrix Calculations

Studies in Applied Mathematics, 1986
In contrast to the usual (and successful) direct methods for Toeplitz systems Ax = b, we propose an algorithm based on the conjugate gradient method. The preconditioner is a circulant, so that all matrices have constant diagonals and all matrix‐vector multiplications use the Fast Fourier Transform. We also suggest a technique for the eigenvalue problem,
openaire   +2 more sources

Fraction-free inversion of a Toeplitz matrix

Proceedings of 2010 IEEE International Symposium on Circuits and Systems, 2010
The paper considers Levinson algorithms for Hermitian and non-Hermitian Toeplitz matrices that for integer matrices remain fraction-free (FF). A recently introduced FF algorithm is extended from Hermitian to non-symmetric Toeplitz matrices. An alternative proof for the integer-preservation property is obtained by linking the elements of the solution ...
Yuval Bistritz, Yaron Segalov
openaire   +1 more source

Toeplitzization of correlation matrix in multipath environment

ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
This paper deals with the technique to improve the performance of an adaptive array under the multipath environment. The adaptive array which works under the guiding principle of output minimization often assumes that the interference is not coherent with the desired signal. In this case, the correlation matrix of the input is Toeplitz.
Kazuaki Takao, Nobuyoshi Kikuma, Tatsuro Yano   +2 more
openaire   +1 more source

Block Toeplitz Matrix Inversion

SIAM Journal on Applied Mathematics, 1973
An iterative procedure for the inversion of a block Toeplitz matrix is given. Hitherto published procedures are obtained as special cases of the present procedure. The use of the procedure in time series analysis is briefly explained.
openaire   +3 more sources

Application of Toeplitz matrix in image restoration

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010
An image degradation process is considered as equivalent to a linear transformation of original image matrix processed by transfer function and noise, while the image restoration process is equivalent to trying to get the original image using the least squares method.
Hua Yu, WenQuan Wu, Zhong Liu
openaire   +1 more source

From matrix polynomial to determinant of block Toeplitz–Hessenberg matrix

Numerical Algorithms, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The inverse of a symmetric banded toeplitz matrix

Reports on Mathematical Physics, 1997
A Toeplitz matrix is one whose \((i,j)\) entry depends only on the difference \(i-j\). The authors describe a method for obtaining an analytic form for the inverse of a finite symmetric banded Toeplitz matrix. For the tridiagonal case they rederive the explicit formula found by \textit{Hu} and \textit{O'Connell} [J. Phys. A: Math. Gen. 29, 1511 (1996)].
Lavis, D. A., Southern, B. W.
openaire   +2 more sources

On the Toeplitz and Polar Decompositions of an Involutive Matrix

Moscow University Computational Mathematics and Cybernetics, 2020
The Toeplitz decomposition of a square complex matrix \(A\) is its representation in the form \(A=B+iC, B=B^\ast , C=C^\ast.\) The Hermitian matrices \(B\) and \(C\) are determined uniquely by the formulas \(B={\frac{1}{2}}(A+A^\ast), C={\frac{1}{2i}}(A-A^\ast).\) The polar decompositions of \(A\) are its representations of the form \(A = PU = UQ ...
openaire   +1 more source

Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix

SIAM Journal on Matrix Analysis and Applications, 1993
The authors study the problem of finding the closest Hermitian positive semidefinite Toeplitz matrix of a given rank to an arbitrary given matrix (in the Frobenius norm = Hilbert-Schmidt norm). They introduce two methods, one is based on using a special orthonormal basis in the space of Hermitian Toeplitz matrices and the second is a modified ...
T. J. Suffridge, Tom L. Hayden
openaire   +1 more source