Can one evaluate the Gabor expansion using Gabor's iterative algorithm?

1992 ◽  
Vol 40 (8) ◽  
pp. 1852-1861 ◽  
Author(s):  
T. Genossar ◽  
M. Porat
Keyword(s):  
Iterative Algorithm ◽  
Gabor Expansion

Iterative criterion of the descriptor system asymptotic steadiness

2020 ◽  
Keyword(s):  
Iterative Algorithm ◽  
Search Algorithm ◽  
Descriptor System ◽  
Matrix Sign Function ◽  
Sign Function ◽  
Generalized Matrix ◽  
Criterion Matrix

An iterative criterion for the asymptotic steadiness of a linear descriptor system is considered. The criterion is based on an iterative algorithm for computing a generalized matrix sign-function. As an example, the problem of analyzing the asymptotic steadiness of a large descriptor system is given. Keywords linear descriptor system; steadiness criterion; matrix sign-function; search algorithm

Combined Iterative Algorithm for Multilevel Coded UWB Communications Systems

2011 ◽  
Vol 30 (7) ◽  
pp. 1562-1565
Author(s):  
Shuang-cheng Deng ◽  
Jin-jun Xie ◽  
Bao-ming Bai ◽  
Xin-mei Wang
Keyword(s):  
Iterative Algorithm ◽  
Communications Systems

Iterative algorithm for a split equilibrium problem and fixed problem for finite asymptotically nonexpansive mappings in Hlbert space

Filomat ◽  
2017 ◽  
Vol 31 (5) ◽  
pp. 1423-1434 ◽  
Author(s):  
Sheng Wang ◽  
Min Chen
Keyword(s):  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Common Element ◽  
Fixed Point Set ◽  
Split Equilibrium Problem ◽  
Asymptotically Nonexpansive Mappings ◽  
Asymptotically Nonexpansive ◽  
Point Set ◽  
The Common

In this paper, we propose an iterative algorithm for finding the common element of solution set of a split equilibrium problem and common fixed point set of a finite family of asymptotically nonexpansive mappings in Hilbert space. The strong convergence of this algorithm is proved.

scholarly journals Convergence rate analysis of an iterative algorithm for solving the multiple-sets split equality problem

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Shijie Sun ◽  
Meiling Feng ◽  
Luoyi Shi
Keyword(s):  
Convergence Rate ◽  
Iterative Algorithm ◽  
Sufficient Conditions ◽  
Linear Convergence ◽  
Regularity Property ◽  
Step Size ◽  
Bounded Linear ◽  
Split Equality Problem ◽  
Linear Convergence Rate ◽  
Equality Problem

Abstract This paper considers an iterative algorithm of solving the multiple-sets split equality problem (MSSEP) whose step size is independent of the norm of the related operators, and investigates its sublinear and linear convergence rate. In particular, we present a notion of bounded Hölder regularity property for the MSSEP, which is a generalization of the well-known concept of bounded linear regularity property, and give several sufficient conditions to ensure it. Then we use this property to conclude the sublinear and linear convergence rate of the algorithm. In the end, some numerical experiments are provided to verify the validity of our consequences.

scholarly journals The convergence of a numerical method for total variation flow

2021 ◽  
Vol 15 ◽  
pp. 174830262110113
Author(s):  
Qianying Hong ◽  
Ming-jun Lai ◽  
Jingyue Wang
Keyword(s):  
Finite Difference ◽  
Difference Scheme ◽  
Numerical Method ◽  
Convergence Analysis ◽  
Total Variation ◽  
Iterative Algorithm ◽  
Finite Difference Scheme ◽  
Gradient Flow ◽  
Time Dependent ◽  
Total Variation Flow

We present a convergence analysis for a finite difference scheme for the time dependent partial different equation called gradient flow associated with the Rudin-Osher-Fetami model. We devise an iterative algorithm to compute the solution of the finite difference scheme and prove the convergence of the iterative algorithm. Finally computational experiments are shown to demonstrate the convergence of the finite difference scheme.

scholarly journals Reconstruction of Relative Phase of Self-Transmitting Devices by Using Multiprobe Solutions and Non-Convex Optimization

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2459
Author(s):  
Rubén Tena Sánchez ◽  
Fernando Rodríguez Varela ◽  
Lars J. Foged ◽  
Manuel Sierra Castañer
Keyword(s):  
Iterative Algorithm ◽  
Degrees Of Freedom ◽  
Relative Phase ◽  
Low Cost ◽  
Initial Guess ◽  
Noise Model ◽  
Medium Size ◽  
Phase Reconstruction ◽  
Linear Combinations ◽  
Iterative Optimization Algorithm

Phase reconstruction is in general a non-trivial problem when it comes to devices where the reference is not accessible. A non-convex iterative optimization algorithm is proposed in this paper in order to reconstruct the phase in reference-less spherical multiprobe measurement systems based on a rotating arch of probes. The algorithm is based on the reconstruction of the phases of self-transmitting devices in multiprobe systems by taking advantage of the on-axis top probe of the arch. One of the limitations of the top probe solution is that when rotating the measurement system arch, the relative phase between probes is lost. This paper proposes a solution to this problem by developing an optimization iterative algorithm that uses partial knowledge of relative phase between probes. The iterative algorithm is based on linear combinations of signals when the relative phase is known. Phase substitution and modal filtering are implemented in order to avoid local minima and make the algorithm converge. Several noise-free examples are presented and the results of the iterative algorithm analyzed. The number of linear combinations used is far below the square of the degrees of freedom of the non-linear problem, which is compensated by a proper initial guess. With respect to noisy measurements, the top probe method will introduce uncertainties for different azimuth and elevation positions of the arch. This is modelled by considering the real noise model of a low-cost receiver and the results demonstrate the good accuracy of the method. Numerical results on antenna measurements are also presented. Due to the numerical complexity of the algorithm, it is limited to electrically small- or medium-size problems.

scholarly journals Estimation methods to extract complex permittivity from transmission coefficient in the terahertz band

2021 ◽  
Vol 53 (8) ◽  
Author(s):  
Chuang Yang ◽  
Jian Wang ◽  
Cheng Yang
Keyword(s):  
Transmission Coefficient ◽  
Iterative Algorithm ◽  
Complex Permittivity ◽  
Free Space ◽  
Estimation Methods ◽  
Extraction Technique ◽  
Initial Value ◽  
Terahertz Band ◽  
Terahertz Frequencies

AbstractIn this paper, the characteristics of the transmission coefficient (S$$_{21}$$ 21 ) measured in free-space at terahertz frequencies are analyzed. The analysis results are used to estimate the permittivity of the material under test, and the estimated permittivity is adopted as an initial-value for the iterative algorithm to extract the complex permittivity of the material from the S$$_{21}$$ 21 . The iterative extraction technique based on the estimation is efficient, while the iterative extraction technique without the estimation is inefficient. Various known materials in the literature are used to validate the technique in the terahertz band.

scholarly journals Iterative Computation for Solving the Variational Inequality and the Generalized Equilibrium Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Xiujuan Pan ◽  
Shin Min Kang ◽  
Young Chel Kwun
Keyword(s):  
Variational Inequality ◽  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Convergence Result ◽  
Generalized Equilibrium Problem ◽  
Iterative Computation ◽  
Generalized Equilibrium

An iterative algorithm for solving the variational inequality and the generalized equilibrium problem has been introduced. Convergence result is given.

Sign in / Sign up

Export Citation Format

Share Document