A simplification is made of the nonorthogonal Fourier transform method (Salby, 1982) for estimating space-time spectra from uneven twice-daily data sampled by a polar-orbiting satellite. The modified method transforms frequency only by the use of the Galilean transformation, while Salby's method transforms both frequency and wavenumber. Space-time spectra are obtained from the time-Fourier tran...

Given an r × r complex matrix T , if T = U |T | is the polar decomposition of T , then, the Aluthge transform is defined by ∆ (T ) = |T |U |T |. Let ∆n(T ) denote the n-times iterated Aluthge transform of T , i.e. ∆0(T ) = T and ∆n(T ) = ∆(∆n−1(T )), n ∈ N. We prove that the sequence {∆n(T )}n∈N converges for every r × r matrix T . This result was conjecturated by Jung, Ko and Pearcy in 2003. W...

The Empirical Mode Decomposition is a process for signals which produces Intrinsic Mode Functions from which instantaneous frequencies may be extracted by simple application of the Hilbert transform. The beauty of this method to generate redundant representations is in its simplicity and its effectiveness. Our study has two objectives: first, to provide an alternate characterization of the Intr...

Given an r × r complex matrix T , if T = U |T | is the polar decomposition of T , then, the Aluthge transform is defined by ∆ (T ) = |T |U |T |. Let ∆n(T ) denote the n-times iterated Aluthge transform of T , i.e. ∆0(T ) = T and ∆n(T ) = ∆(∆n−1(T )), n ∈ N. We prove that the sequence {∆n(T )}n∈N converges for every r× r diagonalizable matrix T . We show that the limit ∆∞(·) is a map of class C∞...

Given an r × r complex matrix T , if T = U |T | is the polar decomposition of T , then the Aluthge transform is defined by ∆ (T ) = |T |U |T |. Let ∆n(T ) denote the n-times iterated Aluthge transform of T , i.e. ∆0(T ) = T and ∆n(T ) = ∆(∆n−1(T )), n ∈ N. In this paper we make a brief survey on the known properties and applications of the Aluthge trasnsorm, particularly the recent proof of the...

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

This paper addresses the problem of polar quantization optimization. Particularly, the aim of this investigation is to find the method for the optimal resolution-constrained polar quantizer design. The new iterative algorithm for determination of the optimal decision and representation magnitude levels and algorithm for optimization of number of phase cells within each magnitude level, is propo...

We present spatial-Slepian transform~(SST) for the representation of signals on sphere to support localized signal analysis. use well-optimally concentrated Slepian functions, obtained by solving spatial-spectral concentration problem finding bandlimited and spatially optimally functions sphere, formulate proposed transform obtain joint domain signal. Due optimal energy in spatial domain, allow...

We propose a stable and fast reconstruction technique for parallel-beam (PB) tomographic X-ray imaging, relying on the discrete pseudo-polar (PP) Radon transform. Our main contribution is a resampling method, based on modern sampling theory, that transforms the acquired PB measurements to a PP grid. The resampling process is both fast and accurate, and in addition, simultaneously denoises the m...