Weak pre-orthogonal adaptive Fourier decomposition in Bergman spaces of pseudoconvex domains

2021 ◽  
pp. 1-10
Author(s):  
Hio Tong Wu ◽  
Ieng Tak Leong ◽  
Tao Qian
Keyword(s):  
Bergman Spaces ◽  
Pseudoconvex Domains ◽  
Fourier Decomposition ◽  
Adaptive Fourier Decomposition

Hankel Operators on Pseudoconvex Domains of Finite Type in ℂ2

1998 ◽  
Vol 50 (3) ◽  
pp. 658-672 ◽  
Author(s):  
Frédéric Symesak
Keyword(s):  
Hardy Space ◽  
Finite Type ◽  
Pseudoconvex Domain ◽  
Bergman Spaces ◽  
Hankel Operators ◽  
Weighted Bergman Spaces ◽  
Pseudoconvex Domains ◽  
Sufficient Condition ◽  
Schatten Class ◽  
Strictly Pseudoconvex Domain

AbstractThe aimof this paper is to study small Hankel operators h on the Hardy space or on weighted Bergman spaces,where Ω is a finite type domain in ℂ2 or a strictly pseudoconvex domain in ℂn. We give a sufficient condition on the symbol ƒ so that h belongs to the Schatten class Sp, 1 ≤ p < +∞.

Adaptive Fourier decomposition in

2019 ◽  
Vol 42 (6) ◽  
pp. 2016-2024
Author(s):  
Yanbo Wang ◽  
Tao Qian
Keyword(s):  
Fourier Decomposition ◽  
Adaptive Fourier Decomposition

A NOVEL SIGNAL DECOMPOSITION APPROACH — ADAPTIVE FOURIER DECOMPOSITION

2011 ◽  
Vol 03 (03) ◽  
pp. 325-338
Author(s):  
LIMING ZHANG ◽  
HONG LI
Keyword(s):  
Greedy Algorithm ◽  
Fast Convergence ◽  
Signal Decomposition ◽  
Theoretical Studies ◽  
Decomposition Approach ◽  
Fourier Decomposition ◽  
Energy Effectiveness ◽  
Adaptive Fourier Decomposition ◽  
Instantaneous Frequencies ◽  
The Greedy Algorithm

This paper presents a novel signal decomposition approach — adaptive Fourier decomposition (AFD), which decomposes a given signal based on its physical characters. The algorithm is described in detail, that is based on recent theoretical studies on analytic instantaneous frequencies and stands as a realizable variation of the greedy algorithm. The principle of the algorithm gives rise to fast convergence in terms of energy. Effectiveness of the algorithm is evaluated by comparison experiments with the classical Fourier decomposition (FD) algorithm. The results are promising.

scholarly journals The Ohsawa-Takegoshi Extension Theorem on Some Unbounded Sets

2007 ◽  
Vol 188 ◽  
pp. 19-30 ◽  
Author(s):  
Żywomir Dinew
Keyword(s):  
Bergman Spaces ◽  
Extension Theorem ◽  
Holomorphic Functions ◽  
Pseudoconvex Domains

AbstractWe use a method of Berndtsson to obtain a simplification of Ohsawa’s result concerning extension of L2-holomorphic functions. We also study versions of the Ohsawa-Takegoshi theorem for some unbounded pseudoconvex domains, with an application to the theory of Bergman spaces. Using these methods we improve some constants, that arise in related inequalities.

scholarly journals FFT formulations of adaptive Fourier decomposition

2017 ◽  
Vol 324 ◽  
pp. 204-215 ◽  
Author(s):  
You Gao ◽  
Min Ku ◽  
Tao Qian ◽  
Jianzhong Wang
Keyword(s):  
Fourier Decomposition ◽  
Adaptive Fourier Decomposition
Sign in / Sign up

Export Citation Format

Share Document