Adaptive orthonormal systems for matrix-valued functions
From MaRDI portal
(Redirected from Publication:2964040)
Abstract: In this paper we consider functions in the Hardy space defined in the unit disc of matrix-valued. We show that it is possible, as in the scalar case, to decompose those functions as linear combinations of suitably modified matrix-valued Blaschke product, in an adaptive way. The procedure is based on a generalization to the matrix-valued case of the maximum selection principle which involves not only selections of suitable points in the unit disc but also suitable orthogonal projections. We show that the maximum selection principle gives rise to a convergent algorithm. Finally, we discuss the case of real-valued signals.
Recommendations
- Adaptive Fourier series---a variation of greedy algorithm
- MIMO frequency domain system identification using matrix-valued orthonormal functions
- Adaptive Fourier decomposition of functions in quaternionic Hardy spaces
- Adaptive Fourier decomposition in H^p
- Algorithm of adaptive Fourier decomposition in H2(ℂ+)
Cites work
- scientific article; zbMATH DE number 1574891 (Why is no real title available?)
- scientific article; zbMATH DE number 4131017 (Why is no real title available?)
- scientific article; zbMATH DE number 3940034 (Why is no real title available?)
- scientific article; zbMATH DE number 3955716 (Why is no real title available?)
- scientific article; zbMATH DE number 4078066 (Why is no real title available?)
- scientific article; zbMATH DE number 3736133 (Why is no real title available?)
- scientific article; zbMATH DE number 46035 (Why is no real title available?)
- scientific article; zbMATH DE number 739278 (Why is no real title available?)
- scientific article; zbMATH DE number 3112091 (Why is no real title available?)
- A Generalization of Von Neumann's Inequality to the Complex Ball
- A class of singular integrals on the \(n\)-complex unit sphere
- A fast adaptive model reduction method based on Takenaka-Malmquist systems
- Adaptive Fourier decompositions and rational approximations. I: Theory
- Adaptive Fourier series---a variation of greedy algorithm
- An advanced complex analysis problem book. Topological vector spaces, functional analysis, and Hilbert spaces of analytic functions
- Comparison of adaptive mono-component decompositions
- Cyclic AFD algorithm for the best rational approximation
- Factorization of analytic functions and operator inequalities
- For which reproducing kernel Hilbert spaces is Pick's theorem true!
- Function theory in the unit ball of \({\mathbb{C}}^ n\)
- Matching pursuits with time-frequency dictionaries
- Minimal factorization of matrix and operator functions
- Nevanlinna-Pick interpolation for Schur-Agler class functions on domains with matrix polynomial defining function in C^n
- Nonlinear phase unwinding of functions
- On the existence and construction of solutions to the partial lossless inverse scattering problem with applications to estimation theory
- On the preceding paper by R.\,B.\thinspace Leech
- Schur functions, operator colligations, and reproducing kernel Pontryagin spaces
- Schur-class multipliers on the Arveson space: de Branges-Rovnyak reproducing kernel spaces and commutative transfer-function realizations
- Some finite-dimensional backward-shift-invariant subspaces in the ball and a related interpolation problem
- Subalgebras of \(C^*\)-algebras. III: Multivariable operator theory
- The structure of inner multipliers on spaces with complete Nevanlinna Pick kernels
- Topics in interpolation theory of rational matrix-valued functions
- Two-dimensional adaptive Fourier decomposition
- Weak greedy algorithms
- J-contractive matrix valued functions and related topics
Cited in
(26)- A class of iterative greedy algorithms related to Blaschke product
- A theory on non-constant frequency decompositions and applications
- Reproducing kernel sparse representations in relation to operator equations
- Kernel approximation for weighted Bergman spaces on tube domains
- Sparse series solutions of random boundary and initial value problems
- Extracting outer function part from Hardy space function
- The Fourier type expansions on tubes
- Positive-instantaneous frequency and approximation
- Rational approximation in Hardy spaces on strips
- Matching pursuit with unbounded parameter domains
- Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes
- Sparse representation of approximation to identity
- Orthogonalization in Clifford Hilbert modules and applications
- A direct proof for the existence of best approximation of random signals
- Greedy Algorithms and Rational Approximation in One and Several Variables
- MIMO frequency domain system identification using matrix-valued orthonormal functions
- Adaptive Fourier decomposition of slice regular functions
- Weighted singular value decomposition basis of Szegő kernel and its applications to signal reconstruction and denoising
- Adaptive decompositions in monogenic reproducing kernel Hilbert spaces of Paley-Wiener type
- N-best adaptive Fourier decomposition for slice hyperholomorphic functions
- Adaptive Non Orthogonal MFSK
- Adaptive decomposition for matrix-valued functions on polydiscs
- \(n\)-best kernel approximation in reproducing kernel Hilbert spaces
- Sparse representation of random field via probability chaos
- Sparse representations of random signals
- Rational approximation by reproducing kernel for Bergman functions on Siegel domains
This page was built for publication: Adaptive orthonormal systems for matrix-valued functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964040)
