The present paper proves that if(x) ∈ C[0,1], changes its sign exactly l times at 0 〈 y1〈 y2 … 〈 y1 〈 1 in (0, 1), then there exists a pn(x) ∈ Пn(+), such that |f(x)- p(x)/pn(x)|≤ Cωφ(f,n^...The present paper proves that if(x) ∈ C[0,1], changes its sign exactly l times at 0 〈 y1〈 y2 … 〈 y1 〈 1 in (0, 1), then there exists a pn(x) ∈ Пn(+), such that |f(x)- p(x)/pn(x)|≤ Cωφ(f,n^(-1/2)), where ρ(x) is defined by ρ(x)={^lПi=1(x-yi),if f (x)≥0 for x ∈(y1,1), {-^lПi=1(x-yi),if f (x)〈0 for x ∈(y1,1), which improves and generalizes the result of .展开更多
Let p(z)=akzk be such that |p(eip)|≤1 for R and |p(1)|=a[0,1].An inequality of Dewan and Cavil for the sum |av|+|au|,0≤u<v≤n is sharpened.Let p(z)=abzk be such that for R,
By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and we further obtain an explicit expression for the generic term of the coefficient sequence, wh...By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and we further obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace formulae of the Cayley-Hamilton's theorem with all coefficients explicitly given. This implies a byproduct, a complete expression for the determinant of any finite-dimensional matrix in terms of the traces of its successive powers. And we discuss some of their applications to ehiral perturbation theory and general relativity.展开更多
Abs Root-MUSIC (MUltiple Signal Classification) is the polynomial rooting form of MUSIC, namely, the spectrum peak searching is resplaced by the polynomial rooting in MUSIC implementation. The coefficients finding o...Abs Root-MUSIC (MUltiple Signal Classification) is the polynomial rooting form of MUSIC, namely, the spectrum peak searching is resplaced by the polynomial rooting in MUSIC implementation. The coefficients finding of the polynomial is the critical problem for Root-MUSIC and its improvements By analyzing the Root-MUSIC algorithm thoughly, the finding method of the polynomial coefficient is deduced and the concrete calculation formula is given, so that the speed of polynomial finding roots will get the bigger exaltation. The particular simulations are given and attest correctness of the theory analysis and also indicate that the proposed algorithm has preferable estimating performance.展开更多
<div style="text-align:justify;"> As a generalized sensor, the RPC model with its accuracy equally matches the physical sensor model. Moreover, the accurate positioning combining with the flexibility i...<div style="text-align:justify;"> As a generalized sensor, the RPC model with its accuracy equally matches the physical sensor model. Moreover, the accurate positioning combining with the flexibility in application leads the RPC model to be the priority in photogrammetry processing. Generally, the RPC model is calculated through a control grid. Different RPC parameters solving methods and the operation efficiency all serve as variables in the accuracy of the model. In this paper, the ridge estimation iterative method, spectrum correction iteration, and conjugate gradient method are employed to solve RPC parameters;the accuracy and efficiency of three solving methods are analyzed and compared. The results show that ridge estimation iterative method and spectrum correction iteration have obvious advantages in accuracy. The ridge estimation iterative method has fewer iteration times and time con-sumption, and spectrum correction iteration has more stable precision. </div>展开更多
The magnetohydrodynamics (MHD) Falkner-Skan flow of the Maxwell fluid is studied. Suitable transform reduces the partial differential equation into a nonlinear three order boundary value problem over a semi-infinite...The magnetohydrodynamics (MHD) Falkner-Skan flow of the Maxwell fluid is studied. Suitable transform reduces the partial differential equation into a nonlinear three order boundary value problem over a semi-infinite interval. An efficient approach based on the rational Chebyshev collocation method is performed to find the solution to the proposed boundary value problem. The rational Chebyshev collocation method is equipped with the orthogonal rational Chebyshev function which solves the problem on the semi-infinite domain without truncating it to a finite domain. The obtained results are presented through the illustrative graphs and tables which demonstrate the affectivity, stability, and convergence of the rational Chebyshev collocation method. To check the accuracy of the obtained results, a numerical method is applied for solving the problem. The variations of various embedded parameters into the problem are examined.展开更多
Let the set of generalized polynomials having bounded coeffiicients be K={p=sum from j=1 to n α_j g_j α_j≤α_j≤β,j=1, 2,…, n}, where g_1, g_2,…, g_n are linearly independent continuous functions defined on thei...Let the set of generalized polynomials having bounded coeffiicients be K={p=sum from j=1 to n α_j g_j α_j≤α_j≤β,j=1, 2,…, n}, where g_1, g_2,…, g_n are linearly independent continuous functions defined on theinterval [a,b], α_j β_j are extended real numbers satisfying α_j<+∞, β_j>? andα_j≤β_j. Assumethat f is a continuous function defined on a compact set X [a, b]. This paper gives the characterizationtheorem for p being the best uniform approximation to f from K, and points out that the characteri-zation theorem can be applied in calculating the approximate solution of best approximation to f fromK.展开更多
In this paper we investigate the robust estimation of generalized varying coefficient models in which the unknown regression coefficients may change with different explanatory variables. Based on the B-spline series a...In this paper we investigate the robust estimation of generalized varying coefficient models in which the unknown regression coefficients may change with different explanatory variables. Based on the B-spline series approximation and Walsh-average technique we develop an initial estimator for the unknown regression coefficient functions. By virtue of the initial estimator, the generalized varying coefficient model is reduced to a univariate nonparametric regression model. Then combining the local linear smooth and Walsh average technique we further propose a two-stage local linear Walsh-average estimator for the unknown regression coefficient functions. Under mild assumptions, we establish the large sample theory of the proposed estimators by utilizing the results of U-statistics and shows that the two-stage local linear Walsh-average estimator own an oracle property, namely the asymptotic normality of the two-stage local linear Walsh-average estimator of each coefficient function is not affected by other unknown coefficient functions. Extensive simulation studies are conducted to assess the finite sample performance, and a real example is analyzed to illustrate the proposed method.展开更多
基金Supported in part by National Natural Science Foundations of China under the grant number 10471130
文摘The present paper proves that if(x) ∈ C[0,1], changes its sign exactly l times at 0 〈 y1〈 y2 … 〈 y1 〈 1 in (0, 1), then there exists a pn(x) ∈ Пn(+), such that |f(x)- p(x)/pn(x)|≤ Cωφ(f,n^(-1/2)), where ρ(x) is defined by ρ(x)={^lПi=1(x-yi),if f (x)≥0 for x ∈(y1,1), {-^lПi=1(x-yi),if f (x)〈0 for x ∈(y1,1), which improves and generalizes the result of .
文摘Let p(z)=akzk be such that |p(eip)|≤1 for R and |p(1)|=a[0,1].An inequality of Dewan and Cavil for the sum |av|+|au|,0≤u<v≤n is sharpened.Let p(z)=abzk be such that for R,
基金The project supported in part by National Natural Science Foundation of China
文摘By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and we further obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace formulae of the Cayley-Hamilton's theorem with all coefficients explicitly given. This implies a byproduct, a complete expression for the determinant of any finite-dimensional matrix in terms of the traces of its successive powers. And we discuss some of their applications to ehiral perturbation theory and general relativity.
基金Supported by the National Outstanding Young Foundation (No.60825104)the National Natural Science Foundation of China (No.60736009)
文摘Abs Root-MUSIC (MUltiple Signal Classification) is the polynomial rooting form of MUSIC, namely, the spectrum peak searching is resplaced by the polynomial rooting in MUSIC implementation. The coefficients finding of the polynomial is the critical problem for Root-MUSIC and its improvements By analyzing the Root-MUSIC algorithm thoughly, the finding method of the polynomial coefficient is deduced and the concrete calculation formula is given, so that the speed of polynomial finding roots will get the bigger exaltation. The particular simulations are given and attest correctness of the theory analysis and also indicate that the proposed algorithm has preferable estimating performance.
文摘<div style="text-align:justify;"> As a generalized sensor, the RPC model with its accuracy equally matches the physical sensor model. Moreover, the accurate positioning combining with the flexibility in application leads the RPC model to be the priority in photogrammetry processing. Generally, the RPC model is calculated through a control grid. Different RPC parameters solving methods and the operation efficiency all serve as variables in the accuracy of the model. In this paper, the ridge estimation iterative method, spectrum correction iteration, and conjugate gradient method are employed to solve RPC parameters;the accuracy and efficiency of three solving methods are analyzed and compared. The results show that ridge estimation iterative method and spectrum correction iteration have obvious advantages in accuracy. The ridge estimation iterative method has fewer iteration times and time con-sumption, and spectrum correction iteration has more stable precision. </div>
基金supported by the Imam Khomeini International University of Iran(No.751166-1392)the Deanship of Scientific Research(DSR)in King Abdulaziz University of Saudi Arabia
文摘The magnetohydrodynamics (MHD) Falkner-Skan flow of the Maxwell fluid is studied. Suitable transform reduces the partial differential equation into a nonlinear three order boundary value problem over a semi-infinite interval. An efficient approach based on the rational Chebyshev collocation method is performed to find the solution to the proposed boundary value problem. The rational Chebyshev collocation method is equipped with the orthogonal rational Chebyshev function which solves the problem on the semi-infinite domain without truncating it to a finite domain. The obtained results are presented through the illustrative graphs and tables which demonstrate the affectivity, stability, and convergence of the rational Chebyshev collocation method. To check the accuracy of the obtained results, a numerical method is applied for solving the problem. The variations of various embedded parameters into the problem are examined.
文摘Let the set of generalized polynomials having bounded coeffiicients be K={p=sum from j=1 to n α_j g_j α_j≤α_j≤β,j=1, 2,…, n}, where g_1, g_2,…, g_n are linearly independent continuous functions defined on theinterval [a,b], α_j β_j are extended real numbers satisfying α_j<+∞, β_j>? andα_j≤β_j. Assumethat f is a continuous function defined on a compact set X [a, b]. This paper gives the characterizationtheorem for p being the best uniform approximation to f from K, and points out that the characteri-zation theorem can be applied in calculating the approximate solution of best approximation to f fromK.
基金Supported by the National Natural Science Foundation of China(NSFC)(No.11471203)the Graduate Innovation Fund of Shanghai University of Finance and Economics(CXJJ-2013-459)
文摘In this paper we investigate the robust estimation of generalized varying coefficient models in which the unknown regression coefficients may change with different explanatory variables. Based on the B-spline series approximation and Walsh-average technique we develop an initial estimator for the unknown regression coefficient functions. By virtue of the initial estimator, the generalized varying coefficient model is reduced to a univariate nonparametric regression model. Then combining the local linear smooth and Walsh average technique we further propose a two-stage local linear Walsh-average estimator for the unknown regression coefficient functions. Under mild assumptions, we establish the large sample theory of the proposed estimators by utilizing the results of U-statistics and shows that the two-stage local linear Walsh-average estimator own an oracle property, namely the asymptotic normality of the two-stage local linear Walsh-average estimator of each coefficient function is not affected by other unknown coefficient functions. Extensive simulation studies are conducted to assess the finite sample performance, and a real example is analyzed to illustrate the proposed method.