We present a new algorithm for numerically computing quadrature formulas for arbi-trary domains which exactly integrate a given polynomial space. An effective method for constructingquadrature formulas has been to numerically solve a nonlinear set of equations for the quadraturepoints and their associated weights. Symmetry conditions are often used to reduce the number ofequatio...

The nonlinear analysis of nanoelectromechanical systems using the differential quadrature model is investigated. The differential quadrature method is applied to overcome the difficulty of determining the nonlinear equation of motion. The characteristics of various combinations of curved electrodes and cantilever beams are considered to optimize the design. Various nano-actuators, such as the c...

In this paper a brief historical survey of the development of quadrature rules with multiple nodes and the maximal algebraic degree of exactness is given. The natural generalization of such rules are quadrature rules with multiple nodes and the maximal degree of exactness in some functional spaces that are different from the space of algebraic polynomial. For that purpose we present a generaliz...

Using classic differential quadrature formulae and uniform grids, this paper systematically constructs a variety of high-order finite difference schemes, and some of these schemes are consistent with the so-called boundary value methods. The derived difference schemes enjoy the same stability and accuracy properties with correspondent differential quadrature methods but have a simpler form of c...

Abstract In this paper, we study the numerical solutions of Fisher’s equation and to a nonlinear diffusion equation of the Fisher type by differential quadrature method. Fisher's equation combines diffusion with logistic nonlinearity. The equation occurs in logistic population growth models, neurophysiology and nuclear reactions. Therefore, numerical study of these types of equations is very im...

We present different stability estimates for the Jacobi inverse eigenvalue problem. First, we give upper bounds expressed in terms of quadrature data and not having weights in denominators. The technique of orthonormal polynomials and integral representation of Hankel determinants is used. Our bounds exhibit only polynomial growth in the problem’s dimension (see [4]). It has been shown that the...

Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the s-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions s > 2, one usually has to resort to computer search algorithms. The fast component-by-component approach is a useful algorithm for finding suitable quadrature rules. We present a modifica...

The most common approach for approximating non-periodic function defined on a finite interval is based on considering polynomials as basis functions. In this paper we will address the non-optimallity of polynomial approximation and suggest to switch from powers of x to powers of sin(px) where p is a parameter which depends on the dimension of the approximating subspace. The new set does not suf...