Results 191 to 200 of about 2,334 (224)

Toeplitz Jacobian Matrix for Nonlinear Periodic Vibration

Journal of Applied Mechanics, 1995
The main difference between a linear system and a nonlinear system is in the non-uniqueness of solutions manifested by the singular Jacobian matrix. It is important to be able to express the Jacobian accurately, completely, and efficiently in an algorithm to analyze a nonlinear system.
Leung, A. Y. T., Ge, T.
openaire   +1 more source

A symmetric rank-revealing toeplitz matrix decomposition

Journal of VLSI signal processing systems for signal, image and video technology, 1996
Summary: In signal and image processing, regularization often requires a rank-revealing decomposition of a symmetric Toeplitz matrix with a small rank deficiency. In this paper, we present an efficient factorization method that exploits symmetry as well as the rank and Toeplitz properties of the given matrix.
Luk, Franklin T., Qiao, Sanzheng
openaire   +2 more sources

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

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

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.
C. Price, M. Salama
openaire   +1 more source

Approximate Toeplitz Matrix Problem Using Semidefinite Programming

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Least squares Toeplitz matrix solutions of the matrix equation

Linear and Multilinear Algebra, 2016
AbstractLet and we first solve the minimum Frobenius norm residual problem (Problem LSP): with unknown Toeplitz matrices X and Y. We then consider a best approximation problem: given Toeplitz matrices and , find such that where is the solution set of Problem LSP.
Yongxin Yuan, Wenhua Zhao, Hao Liu
openaire   +1 more source

Hyponormal Toeplitz Operators with Matrix-Valued Circulant Symbols

Complex Analysis and Operator Theory, 2011
Let \(L^2 = L^2(\mathbb{T})\) be the set of all square-integrable functions on the unit circle \(\mathbb{T} = \partial \mathbb{D}\) in the complex plane, \(H^2 = H^2(\mathbb{T})\) be the corresponding Hardy space and \(H^\infty = L^\infty \cap H^2\). Let \(M_n\) denote the set of \(n \times n\) complex matrices. Then \( L^2_{\mathbb{C}^n} = L^2 \otimes
Hwang, In Sung, Kang, Dong-O., Lee, Woo Young   +2 more
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 ...
Suffridge, T. J., Hayden, T. L.
openaire   +1 more source

SQP algorithms for solving Toeplitz matrix approximation problem

Numerical Linear Algebra with Applications, 2002
AbstractGiven an n × n matrix F, we find the nearest symmetric positive semi‐definite Toeplitz matrix T to F. The problem is formulated as a non‐linear minimization problem with positive semi‐definite Toeplitz matrix as constraints. Then a computational framework is given.
openaire   +1 more source