Solution of underdetermined Sylvester equations in sensor array signal processing
Motivated by a practical example in signal processing, this paper studies numerical solution of an underdetermined Sylvester equation \((AP-PB) - (CQ-QD)= R\), all matrices \(n\times n\). Use of Kronecker products enables the problem to be reformulated as the underdetermined system \(Fz=r\), with \(F\) size \(n^2 \times 2n^2\). The required solution matrices \(P\) and \(Q\) can be recovered from the least squares solution \(z\) of the above system, the solution of which requires \(O(n^6)\) flops. To reduce computational effort, after a suitable transformation of the problem, the standard conjugate gradient method, based on matrices of size \(n\times n\), is implemented in a straightforward manner. This procedure reduces the work in finding \(P\) and \(Q\) to \(O(n^5)\) flops. A numerical example completes the paper.
- A generalized ADI iterative method
- A Hessenberg-Schur method for the problem AX + XB= C
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Explicit Solutions of Linear Matrix Equations
- scientific article; zbMATH DE number 125135 (Why is no real title available?)
- Kronecker products and matrix calculus in system theory
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Krylov-subspace methods for the Sylvester equation
- Methods of conjugate gradients for solving linear systems
- Solution of Lyapunov equations by alternating direction implicit iteration
- SOR for AX-XB=C
This page was built for publication: Solution of underdetermined Sylvester equations in sensor array signal processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564894)