Generalized Bernstein-Kantorovich polynomials M_n^((k))(a_n, f, x) were introduced in the paper and their order of approximation were estimated in the L_p[0, 1]-spaces.
Based on propagator method, a fast 2-D Angle-Of-Arrival (AOA) algorithm is proPosed in this paper. The proposed algorithm does not need the Eigen-Value Decomposition (EVD) or Singular Value Decomposition (SVD) of the ...Based on propagator method, a fast 2-D Angle-Of-Arrival (AOA) algorithm is proPosed in this paper. The proposed algorithm does not need the Eigen-Value Decomposition (EVD) or Singular Value Decomposition (SVD) of the Sample Covariance Matrix (SCM), thus the fast algorithm has lower computational complexity with insignificant performance degradation when comparing with conventional subspace approaches. Furthermore, the proposed algorithm has no performance degradation. Finally, computer simulations verify the effectiveness of the proposed algorithm.展开更多
A method of approaching to the infinite dimensional linear operators by the finite dimensional operators is discussed. It is shown that,for every infinite dimensional operator A and every natural number n, there exist...A method of approaching to the infinite dimensional linear operators by the finite dimensional operators is discussed. It is shown that,for every infinite dimensional operator A and every natural number n, there exists an n dimensional optimal approximation to A. The norm error is found and the necessary and sufficient condition for such n dimensional optimal approximations to be unique is obtained.展开更多
This paper generalizes the basic principle of multiplier-enlargement approach to approximating any nonbounded continuous functions with positive linear operators, and as an example, Bernstein polynomial operators are ...This paper generalizes the basic principle of multiplier-enlargement approach to approximating any nonbounded continuous functions with positive linear operators, and as an example, Bernstein polynomial operators are analysed and studied. This paper gives a certain theorem as a general rule to approximate any nonbounded continuous functions.展开更多
文摘Generalized Bernstein-Kantorovich polynomials M_n^((k))(a_n, f, x) were introduced in the paper and their order of approximation were estimated in the L_p[0, 1]-spaces.
基金Supported by the Foundation of National Key Laboratory.
文摘Based on propagator method, a fast 2-D Angle-Of-Arrival (AOA) algorithm is proPosed in this paper. The proposed algorithm does not need the Eigen-Value Decomposition (EVD) or Singular Value Decomposition (SVD) of the Sample Covariance Matrix (SCM), thus the fast algorithm has lower computational complexity with insignificant performance degradation when comparing with conventional subspace approaches. Furthermore, the proposed algorithm has no performance degradation. Finally, computer simulations verify the effectiveness of the proposed algorithm.
文摘A method of approaching to the infinite dimensional linear operators by the finite dimensional operators is discussed. It is shown that,for every infinite dimensional operator A and every natural number n, there exists an n dimensional optimal approximation to A. The norm error is found and the necessary and sufficient condition for such n dimensional optimal approximations to be unique is obtained.
文摘This paper generalizes the basic principle of multiplier-enlargement approach to approximating any nonbounded continuous functions with positive linear operators, and as an example, Bernstein polynomial operators are analysed and studied. This paper gives a certain theorem as a general rule to approximate any nonbounded continuous functions.
