Spectrum resolution into elementary symmetric bands by means of the gram-schmidt orthogonalization method

1986 ◽  
Vol 45 (3) ◽  
pp. 995-999
Author(s):  
V. I. Mikhailenko ◽  
V. V. Mikhal'chuk
2021 ◽  
Author(s):  
Yan Pu ◽  
Jing Chen ◽  
Yongqing Yang ◽  
Quanmin Zhu

Abstract An improved gradient iterative algorithm, termed as Gram-Schmidt orthogonalization based gradient iterative algorithm, is proposed for rational models in this paper. The algorithm can obtain the optimal parameter estimates in one iteration for the reason that the information vectors obtained by using the Gram-Schmidt orthogonalization method are independent of each other. Compared to the least squares algorithm and the traditional gradient iterative algorithm, the proposed algorithm does not require the matrix inversion and eigenvalue calculation, thus it can be applied to nonlinear systems with complex structures or large-scale systems. Since the information vector of the rational models contains the latest output that is correlated with the noise, a biased compensation Gram-Schmidt orthogonalization based gradient iterative algorithm is introduced, by which the unbiased parameter estimates can be obtained. Two simulated examples are applied to demonstrate the efficiency of the proposed algorithm.


2010 ◽  
Vol 121-122 ◽  
pp. 992-995
Author(s):  
Long Yang Huang ◽  
Wei Jun Pan

Based on the Gram-Schmidt orthogonalization method utilized for pattern synthesis of linear array without constraints, null derivative constraints are proposed to implement pattern synthesis with broad nulls. The advantage of the simplified computation resulted from steering vector orthogonalization in unconstrained orthogonal approach is maintained, and the uniform or non-uniform linear array pattern synthesis can be realized by this method. The experimental results show that the null constrained orthogonal approach can fulfill linear array pattern synthesis with constrains such as null constrains, first-order and second-order derivative null constraints.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Mohammed Al-Smadi ◽  
Nadir Djeddi ◽  
Shaher Momani ◽  
Shrideh Al-Omari ◽  
Serkan Araci

AbstractOur aim in this paper is presenting an attractive numerical approach giving an accurate solution to the nonlinear fractional Abel differential equation based on a reproducing kernel algorithm with model endowed with a Caputo–Fabrizio fractional derivative. By means of such an approach, we utilize the Gram–Schmidt orthogonalization process to create an orthonormal set of bases that leads to an appropriate solution in the Hilbert space $\mathcal{H}^{2}[a,b]$ H 2 [ a , b ] . We investigate and discuss stability and convergence of the proposed method. The n-term series solution converges uniformly to the analytic solution. We present several numerical examples of potential interests to illustrate the reliability, efficacy, and performance of the method under the influence of the Caputo–Fabrizio derivative. The gained results have shown superiority of the reproducing kernel algorithm and its infinite accuracy with a least time and efforts in solving the fractional Abel-type model. Therefore, in this direction, the proposed algorithm is an alternative and systematic tool for analyzing the behavior of many nonlinear temporal fractional differential equations emerging in the fields of engineering, physics, and sciences.


Sign in / Sign up

Export Citation Format

Share Document