Algorithms for fast multidimensional signal extraction
Inner product spaces and their generalizations, Hilbert spaces (46C99) Factorization theory (including Wiener-Hopf and spectral factorizations) of linear operators (47A68) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Identification in stochastic control theory (93E12)
In recent studies operator factorization techniques have been developed for problems associated with multidimensional control and image processing. In particular the special factorization of Gohberg and Krein [see the first author and \textit{R. M. DeSantis}, ibid. 88, 591-603 (1982; Zbl 0488.15009)] and the Schur-Cholesky factorization [see the first author and \textit{R. M. DeSantis}, Generalized Schur-Cholesky factorization, Circuits Syst. Signal. Process. (to appear)] have both been extended to the multivariate setting. The present study focuses on computational aspects of the earlier results. Also of interest are implications for designing computer architectures which facilitate high- speed, on-line computation of the operator factors.
- Fast algorithms for signal processing.
- Fast Algorithms for Demixing Sparse Signals From Nonlinear Observations
- scientific article; zbMATH DE number 3928865
- On the synthesis of fast algorithms for signal processing
- Fast algorithms for updating signal subspaces
- Derivation of fast algorithms via binary filtering of signals
- Algorithms with high order convergence speed for blind source extraction
- Transforms and fast algorithms for signal analysis and representations.
- scientific article; zbMATH DE number 822160
- scientific article; zbMATH DE number 1529648
This page was built for publication: Algorithms for fast multidimensional signal extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081568)