Polynomial basis functions

The numerical accuracy of simulations performed using this model is affected by several factors. These include a) the degree of triangulation, b) the number of marching steps taken along the flow direction and c) the order of the polynomial basis function. Numerical accuracy improves as a, b and c increase, however the computational time can become excessive. Therefore, it was necessary to quantitatively determine the effects of these variables on numerical accuracy. 

Silverstone and his collaborators have proposed the use of piecewise polynomial basis functions and have demonstrated their use for atomic systems. By using such functions, they aim to overcome the computational linear dependence problems which may be associated with large basis sets of exponential-type functions or Gaussian-type functions. 

The integrals over piecewise polynomial basis functions are elementary. However, it is found that the number of terms in the Hnal integral formulae is much larger for piecewise polynomial functions than for exponential-type functions, for example. 

A polynomial basis function can fit any nonlinear function arbitrarily well. 

Equation (1), with the associated boundary conditions, is a nonlinear second-order boundary-value ODE. This was solved by the method of collocation with piecewise cubic Hermite polynomial basis functions for spatial discretization, while simple successive substitution was adequate for the solution of the resulting nonlinear algebraic equations. The method has been extensively described before [9], and no problems were found in this application. 

Of course, for purposes of practicality, the infinite series of PC expansion of Eq. 7 must be truncated by selecting an appropriate functional subspace consisting of a finite number of terms. A usual approach lies in the selection of a functional subspace consisting of polynomial basis functions with total maximum degree P, that is, d(j) = 2 f = id(j, ) < P for all j. In this case the dimensionality of the functional subspace is equal to... 

We expect that for large values of nn nn — oo), the solution in Equation 2.23 will approach the exact solution. The 9i x) denote the polynomial basis functions of x and the coefficients ai are obtained using the method of weighted residuals (MWR), which involves substituting the approximate solution given by Equation 2.23 in Equation 2.22 to obtain a residual function given below. 

An equivalent formulation of finite element methods can be developed using the concept of weighted residuals. In Sec. 5.6.3, we discussed the method of weighted residuals in connection with the solution of the two-point boundary-value problem. In that case we chose the solution of the ordinary differential equation as a polynomial basis function and caused the integral of weighted residuals to vanish ... 

The present perturbative beatment is carried out in the framework of the minimal model we defined above. All effects that do not cincially influence the vibronic and fine (spin-orbit) stracture of spectra are neglected. The kinetic energy operator for infinitesimal vibrations [Eq. (49)] is employed and the bending potential curves are represented by the lowest order (quadratic) polynomial expansions in the bending coordinates. The spin-orbit operator is taken in the phenomenological form [Eq. (16)]. We employ as basis functions... 

For a circular aperture a typical set of basis functions are the Zemike polynomials (Noll, 1976), but for other geometries alternative basis functions may be more appropriate. The objective of most wavefront sensors is to produce a set of measurements, m, that can be related to the wavefront by a set of linear equations... 

To understand the criteria for basis set choice, then, we need consider only the behavior of the primitive integrals. The primitive integrals over the basis functions can be expressed in terms of Hermite polynomials... 

Table IV Effect of the degree of basis function polynomials...

One example of a structure (8) is the space of polynomials, where the ladder of subspaces corresponds to polynomials of increasing degree. As the index / of Sj increases, the subspaces become increasingly more complex where complexity is referred to the number of basis functions spanning each subspace. Since we seek the solution at the lowest index space, we express our bias toward simpler solutions. This is not, however, enough in guaranteeing smoothness for the approximating function. Additional restrictions will have to be imposed on the structure to accommodate better the notion of smoothness and that, in turn, depends on our ability to relate this intuitive requirement to mathematical descriptions. 

Linear PCR can be modified for nonlinear modeling by using nonlinear basis functions 0m that can be polynomials or the supersmoother (Frank, 1990). The projection directions for both linear and nonlinear PCR are identical, since the choice of basis functions does not affect the projection directions indicated by the bracketed term in Eq. (22). Consequently, the nonlinear PCR algorithm is identical to that for the linear PCR algorithm, except for an additional step used to compute the nonlinear basis functions. Using adaptive-shape basis functions provides the flexibility to find the smoothed function that best captures the structure of the unknown function being approximated. 

When expanded out, the determinant is a polynomial of degree n in the variable and it has n real roots if ff and S are both Hermitian matrices, and S is positive definite. Indeed, if S were not positive definite, this would signal that the basis functions were not all linearly independent, and that the basis was defective. If takes on one of the roots of Eq. (1.16) the matrix ff — is of rank... 

The basis functions for the intrinsic group G are the polynomial harmonics in momentum space,... 

Support Vector Machine (SVM) is a classification and regression method developed by Vapnik.30 In support vector regression (SVR), the input variables are first mapped into a higher dimensional feature space by the use of a kernel function, and then a linear model is constructed in this feature space. The kernel functions often used in SVM include linear, polynomial, radial basis function (RBF), and sigmoid function. The generalization performance of SVM depends on the selection of several internal parameters of the algorithm (C and e), the type of kernel, and the parameters of the kernel.31... 

Interpolation consists of finding the correlation between the known points according to the selected basis functions. Hence, we need to search for appropriate equations that fit the behavior of our function / (x). For example, in linear interpolation, the chosen function is a straight line. The most commonly used functional forms are polynomials, rational functions, trigonometric functions and radial functions [10, 19, 21]. 

The electron distribution around an atom can be represented in several ways. Hydrogenlike functions based on solutions of the Schrodinger equation for the hydrogen atom, polynomial functions with adjustable parameters, Slater functions (Eq. 5.95), and Gaussian functions (Eq. 5.96) have all been used [34]. Of these, Slater and Gaussian functions are mathematically the simplest, and it is these that are currently used as the basis functions in molecular calculations. Slater functions are used in semiempirical calculations, like the extended Hiickel method (Section 4.4) and other semiempirical methods (Chapter 6). Modem molecular ab initio programs employ Gaussian functions. 

---