Most of the reconstruction-based robust adaptive beamforming(RAB)algorithms require the covariance matrix reconstruction(CMR)by high-complexity integral computation.A Gauss-Legendre quadrature(GLQ)method with the high...Most of the reconstruction-based robust adaptive beamforming(RAB)algorithms require the covariance matrix reconstruction(CMR)by high-complexity integral computation.A Gauss-Legendre quadrature(GLQ)method with the highest algebraic precision in the interpolation-type quadrature is proposed to reduce the complexity.The interference angular sector in RAB is regarded as the GLQ integral range,and the zeros of the threeorder Legendre orthogonal polynomial is selected as the GLQ nodes.Consequently,the CMR can be efficiently obtained by simple summation with respect to the three GLQ nodes without integral.The new method has significantly reduced the complexity as compared to most state-of-the-art reconstruction-based RAB techniques,and it is able to provide the similar performance close to the optimal.These advantages are verified by numerical simulations.展开更多
Some quadrature formulae for the numerical evaluation of singular integrals of arbitrary order are established and both the estimate of remainder and the convergence of each quadrature formula derived here are also gi...Some quadrature formulae for the numerical evaluation of singular integrals of arbitrary order are established and both the estimate of remainder and the convergence of each quadrature formula derived here are also given.展开更多
We construct a quadrature formula of the singular integral with the Chebyshev weight of the second kind by using Lagrange interpolation based on the rational system {1/(x-a 1),1/(x-a 2),...} , and both the remainder a...We construct a quadrature formula of the singular integral with the Chebyshev weight of the second kind by using Lagrange interpolation based on the rational system {1/(x-a 1),1/(x-a 2),...} , and both the remainder and convergence of the quadrature formula established here are discussed. Our results extend some classical ones.展开更多
A generalized Gauss-type quadrature formula is introduced, which assists in selection of collocation points in pseudospectral method for differential equations with two-point derivative boundary conditions. Some resul...A generalized Gauss-type quadrature formula is introduced, which assists in selection of collocation points in pseudospectral method for differential equations with two-point derivative boundary conditions. Some results on the related Jacobi interpolation are established. A pseudospectral scheme is proposed for the Kuramoto-Sivashisky equation. A skew symmetric decomposition is used for dealing with the nonlinear convection term. The stability and convergence of the proposed scheme are proved. The error estimates are obtained. Numerical results show the efficiency of this approach.展开更多
This paper develops a clase of quadrature formula with first derivativesIt is demonstrated that its degree of accuracy is not less than 2k+1 for a set of distinct nodes {x0,x1,...,xn} over interval [a,b],and just only...This paper develops a clase of quadrature formula with first derivativesIt is demonstrated that its degree of accuracy is not less than 2k+1 for a set of distinct nodes {x0,x1,...,xn} over interval [a,b],and just only 2k+1 for equally spaced nodes.Far overcoming the shortcoming of involving a great number of manual computations for the integration rules of the Hermitian interpolation formula,some simple formulas for computing automatically βi,γi and E [f] by computer are given,especially for equally spaced nodes.展开更多
The goal here is to give a simple approach to a quadrature formula based on the divided diffierences of the integrand at the zeros of the nth Chebyshev polynomial of the first kind,and those of the(n-1)st Chebyshev po...The goal here is to give a simple approach to a quadrature formula based on the divided diffierences of the integrand at the zeros of the nth Chebyshev polynomial of the first kind,and those of the(n-1)st Chebyshev polynomial of the second kind.Explicit expressions for the corresponding coefficients of the quadrature rule are also found after expansions of the divided diffierences,which was proposed in[14].展开更多
The purpose of this paper is to study the maximum trigonometric degree of the quadrature formula associated with m prescribed nodes and n unknown additional nodes in the interval(-π, π]. We show that for a fixed n, ...The purpose of this paper is to study the maximum trigonometric degree of the quadrature formula associated with m prescribed nodes and n unknown additional nodes in the interval(-π, π]. We show that for a fixed n, the quadrature formulae with m and m + 1 prescribed nodes share the same maximum degree if m is odd. We also give necessary and sufficient conditions for all the additional nodes to be real, pairwise distinct and in the interval(-π, π] for even m, which can be obtained constructively. Some numerical examples are given by choosing the prescribed nodes to be the zeros of Chebyshev polynomials of the second kind or randomly for m ≥ 3.展开更多
In this paper, three types of three-parameters families of quadrature formulas for the Riemann’s integral on an interval of the real line are carefully studied. This research is a continuation of the results in the [...In this paper, three types of three-parameters families of quadrature formulas for the Riemann’s integral on an interval of the real line are carefully studied. This research is a continuation of the results in the [1]-[3]. All these quadrature formulas are not based on the integration of an interpolant as so as the Gregory rule, a well-known example in numerical quadrature of a trapezoidal rule with endpoint corrections of a given order (see [4]). In some natural restrictions on the parameters we construct the only one quadrature formula of the eight order which belongs to the first, second and third family. For functions whose 8th derivative is either always positive or always negative, we use these quadrature formulas to get good two-sided bound on . Additionally, we apply these quadratures to obtain the approximate sum of slowly convergent series , where .展开更多
In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic co...In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic convergence and error equation are proved theoretically, and demonstrated numerically. Several numerical examples for solving the system of nonlinear equations and boundary-value problems of nonlinear ordinary differential equations (ODEs) are provided to illustrate the efficiency and performance of the suggested iterative methods.展开更多
Methods for the approximation of solution of nonlinear system of equations often fail when the Jacobians of the systems are singular at iteration points. In this paper, multi-step families of quadrature based iterativ...Methods for the approximation of solution of nonlinear system of equations often fail when the Jacobians of the systems are singular at iteration points. In this paper, multi-step families of quadrature based iterative methods for approximating the solution of nonlinear system of equations with singular Jacobian are developed using decomposition technique. The methods proposed in this study are of convergence order , and require only the evaluation of first-order Frechet derivative per iteration. The approximate solutions generated by the proposed iterative methods in this paper compared with some existing contemporary methods in literature, show that methods developed herein are efficient and adequate in approximating the solution of nonlinear system of equations whose Jacobians are singular and non-singular at iteration points.展开更多
The main purpose of this work is to find for any non-negative measure,the relations betweent the Gauss-Radau and Gauss-Lobatto formula and Gauss formulae for the same measure.As applications,the author obtained the ex...The main purpose of this work is to find for any non-negative measure,the relations betweent the Gauss-Radau and Gauss-Lobatto formula and Gauss formulae for the same measure.As applications,the author obtained the explicit Gauss-Radau and Gauss-Lobatto formulae for the Jacolbi weight and the Gori-Micchelli weight.展开更多
In this work, we consider the second order nonlinear integro-differential Equation (IDEs) of the Volterra-Fredholm type. One of the popular methods for solving Volterra or Fredholm type IDEs is the method of quadratur...In this work, we consider the second order nonlinear integro-differential Equation (IDEs) of the Volterra-Fredholm type. One of the popular methods for solving Volterra or Fredholm type IDEs is the method of quadrature while the problem of consideration is a linear problem. If IDEs are nonlinear or integral kernel is complicated, then quadrature rule is not most suitable;therefore, other types of methods are needed to develop. One of the suitable and effective method is homotopy analysis method (HAM) developed by Liao in 1992. To apply HAM, we firstly reduced the IDEs into nonlinear integral Equation (IEs) of Volterra-Fredholm type;then the standard HAM was applied. Gauss-Legendre quadrature formula was used for kernel integrations. Obtained system of algebraic equations was solved numerically. Moreover, numerical examples demonstrate the high accuracy of the proposed method. Comparisons with other methods are also provided. The results show that the proposed method is simple, effective and dominated other methods.展开更多
The best quadrature formula has been found in the following sense: for a function whose norm of the second derivative is bounded by a given constant and the best quadrature formula for the approximate evaluation of in...The best quadrature formula has been found in the following sense: for a function whose norm of the second derivative is bounded by a given constant and the best quadrature formula for the approximate evaluation of integration of that function can minimize the worst possible error if the values of the function and its derivative at certain nodes are known.The best interpolation formula used to get the quadrature formula above is also found.Moreover,we compare the best quadrature formula with the open compound corrected trapezoidal formula by theoretical analysis and stochastic experiments.展开更多
Explicit expressions of the Cotes numbers of the generalized Gaussian quadrature formulas for the Chebyshev nodes (of the first kind and the second kind) andtheir asymptotic behavior are given.
Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well-known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the reg...Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well-known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by confocal ellipses, are given. A numerical example which illustrates the calculation of these error bounds is included.展开更多
As we know, a solution of an extremal problem with Hermite interpolation constraints is a system of nodes of corresponding Gaussian Hermite quadrature formula (the so-called Jacobi approach). But this conclusion is vi...As we know, a solution of an extremal problem with Hermite interpolation constraints is a system of nodes of corresponding Gaussian Hermite quadrature formula (the so-called Jacobi approach). But this conclusion is violated for a Birkhoff quadrature formula. In this paper an extremal problem with Birkhoff interpolation constraints is discussed, from which a large class of Birkhoff quadrature formulas may be derived.展开更多
基金supported by the National Natural Science Foundation of China(618711496197115962071144)。
文摘Most of the reconstruction-based robust adaptive beamforming(RAB)algorithms require the covariance matrix reconstruction(CMR)by high-complexity integral computation.A Gauss-Legendre quadrature(GLQ)method with the highest algebraic precision in the interpolation-type quadrature is proposed to reduce the complexity.The interference angular sector in RAB is regarded as the GLQ integral range,and the zeros of the threeorder Legendre orthogonal polynomial is selected as the GLQ nodes.Consequently,the CMR can be efficiently obtained by simple summation with respect to the three GLQ nodes without integral.The new method has significantly reduced the complexity as compared to most state-of-the-art reconstruction-based RAB techniques,and it is able to provide the similar performance close to the optimal.These advantages are verified by numerical simulations.
基金Supported by NNSF and RFDP of Higher Education of China.
文摘Some quadrature formulae for the numerical evaluation of singular integrals of arbitrary order are established and both the estimate of remainder and the convergence of each quadrature formula derived here are also given.
文摘We construct a quadrature formula of the singular integral with the Chebyshev weight of the second kind by using Lagrange interpolation based on the rational system {1/(x-a 1),1/(x-a 2),...} , and both the remainder and convergence of the quadrature formula established here are discussed. Our results extend some classical ones.
文摘A generalized Gauss-type quadrature formula is introduced, which assists in selection of collocation points in pseudospectral method for differential equations with two-point derivative boundary conditions. Some results on the related Jacobi interpolation are established. A pseudospectral scheme is proposed for the Kuramoto-Sivashisky equation. A skew symmetric decomposition is used for dealing with the nonlinear convection term. The stability and convergence of the proposed scheme are proved. The error estimates are obtained. Numerical results show the efficiency of this approach.
文摘This paper develops a clase of quadrature formula with first derivativesIt is demonstrated that its degree of accuracy is not less than 2k+1 for a set of distinct nodes {x0,x1,...,xn} over interval [a,b],and just only 2k+1 for equally spaced nodes.Far overcoming the shortcoming of involving a great number of manual computations for the integration rules of the Hermitian interpolation formula,some simple formulas for computing automatically βi,γi and E [f] by computer are given,especially for equally spaced nodes.
基金Supported by the National Natural Science Foundation of China（10571121） Supported by the Natural Science Foundation of Guangdong Province（5010509）
文摘The goal here is to give a simple approach to a quadrature formula based on the divided diffierences of the integrand at the zeros of the nth Chebyshev polynomial of the first kind,and those of the(n-1)st Chebyshev polynomial of the second kind.Explicit expressions for the corresponding coefficients of the quadrature rule are also found after expansions of the divided diffierences,which was proposed in[14].
基金The NSF (61033012,10801023,10911140268 and 10771028) of China
文摘The purpose of this paper is to study the maximum trigonometric degree of the quadrature formula associated with m prescribed nodes and n unknown additional nodes in the interval(-π, π]. We show that for a fixed n, the quadrature formulae with m and m + 1 prescribed nodes share the same maximum degree if m is odd. We also give necessary and sufficient conditions for all the additional nodes to be real, pairwise distinct and in the interval(-π, π] for even m, which can be obtained constructively. Some numerical examples are given by choosing the prescribed nodes to be the zeros of Chebyshev polynomials of the second kind or randomly for m ≥ 3.
文摘In this paper, three types of three-parameters families of quadrature formulas for the Riemann’s integral on an interval of the real line are carefully studied. This research is a continuation of the results in the [1]-[3]. All these quadrature formulas are not based on the integration of an interpolant as so as the Gregory rule, a well-known example in numerical quadrature of a trapezoidal rule with endpoint corrections of a given order (see [4]). In some natural restrictions on the parameters we construct the only one quadrature formula of the eight order which belongs to the first, second and third family. For functions whose 8th derivative is either always positive or always negative, we use these quadrature formulas to get good two-sided bound on . Additionally, we apply these quadratures to obtain the approximate sum of slowly convergent series , where .
文摘In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic convergence and error equation are proved theoretically, and demonstrated numerically. Several numerical examples for solving the system of nonlinear equations and boundary-value problems of nonlinear ordinary differential equations (ODEs) are provided to illustrate the efficiency and performance of the suggested iterative methods.
文摘Methods for the approximation of solution of nonlinear system of equations often fail when the Jacobians of the systems are singular at iteration points. In this paper, multi-step families of quadrature based iterative methods for approximating the solution of nonlinear system of equations with singular Jacobian are developed using decomposition technique. The methods proposed in this study are of convergence order , and require only the evaluation of first-order Frechet derivative per iteration. The approximate solutions generated by the proposed iterative methods in this paper compared with some existing contemporary methods in literature, show that methods developed herein are efficient and adequate in approximating the solution of nonlinear system of equations whose Jacobians are singular and non-singular at iteration points.
文摘The main purpose of this work is to find for any non-negative measure,the relations betweent the Gauss-Radau and Gauss-Lobatto formula and Gauss formulae for the same measure.As applications,the author obtained the explicit Gauss-Radau and Gauss-Lobatto formulae for the Jacolbi weight and the Gori-Micchelli weight.
文摘In this work, we consider the second order nonlinear integro-differential Equation (IDEs) of the Volterra-Fredholm type. One of the popular methods for solving Volterra or Fredholm type IDEs is the method of quadrature while the problem of consideration is a linear problem. If IDEs are nonlinear or integral kernel is complicated, then quadrature rule is not most suitable;therefore, other types of methods are needed to develop. One of the suitable and effective method is homotopy analysis method (HAM) developed by Liao in 1992. To apply HAM, we firstly reduced the IDEs into nonlinear integral Equation (IEs) of Volterra-Fredholm type;then the standard HAM was applied. Gauss-Legendre quadrature formula was used for kernel integrations. Obtained system of algebraic equations was solved numerically. Moreover, numerical examples demonstrate the high accuracy of the proposed method. Comparisons with other methods are also provided. The results show that the proposed method is simple, effective and dominated other methods.
基金supported by the Special Funds for Major State Basic Research Projects(Grant No.G19990328)the National and Zhejiang Provincial Natural Science Foundation of China(Grant No.10471128 and Grant No.101027).
文摘The best quadrature formula has been found in the following sense: for a function whose norm of the second derivative is bounded by a given constant and the best quadrature formula for the approximate evaluation of integration of that function can minimize the worst possible error if the values of the function and its derivative at certain nodes are known.The best interpolation formula used to get the quadrature formula above is also found.Moreover,we compare the best quadrature formula with the open compound corrected trapezoidal formula by theoretical analysis and stochastic experiments.
文摘Explicit expressions of the Cotes numbers of the generalized Gaussian quadrature formulas for the Chebyshev nodes (of the first kind and the second kind) andtheir asymptotic behavior are given.
基金supported by the Serbian Ministry of Education,Science and Technological Development(Research Project:Methods of Numerical and Nonlinear Analysis with Applications)(Grant No.174002)
文摘Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well-known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by confocal ellipses, are given. A numerical example which illustrates the calculation of these error bounds is included.
文摘As we know, a solution of an extremal problem with Hermite interpolation constraints is a system of nodes of corresponding Gaussian Hermite quadrature formula (the so-called Jacobi approach). But this conclusion is violated for a Birkhoff quadrature formula. In this paper an extremal problem with Birkhoff interpolation constraints is discussed, from which a large class of Birkhoff quadrature formulas may be derived.
