Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Orthogonal expansion

The basis behind separation of variables is the orthogonal expansion technique. The method of separation of variables produces a set of auxiliary differential equations. One of these auxiliary problems is called the eigenvalue problem with its eigenfunction solutions. [Pg.62]

The expansion coefficients r were obtained by orthogonal expansion their values are shown in Table 1. [Pg.453]

When the region of expansion is properly chosen, the error e x) oscillates on both sides of the abscissa. Thus, choosing an orthogonal polynomial P x) is equivalent to demanding that the error of the approximation be zero at a finite set of points. This is in contrast to the Taylor series for which the error is zero only at one point. In this sense the orthogonal expansion is an interpolating approximation. [Pg.200]

Bigeleisen and Ishida (7) obtained an orthogonal expansion of the logarithmic function. [Pg.201]

R.E. Clapp, A complete orthogonal expansion for the nuclear three-body problem. Ann. Phys., 13 187-236,1961. [Pg.142]

Wo now recall that Fourier expansions (F.18) are orthogonal expansions (sec, e.g., Ref. 242). It follows that each sununand on the second line of Eq. (F.20) has to be equal to its counterpart on the third line so that... [Pg.451]

This problem can be overcome by the use of orthogonal expansion functions (the subject of Sec. III.B). Another possible numerical fix is to use more sampling points than functions. The overdetermination of the inversion is overcome by a least squares procedure (18). [Pg.191]

To find an approximate solution of the kinetic equation, an orthogonal expansion of the velocity distribution with respect to the direction v/v of the velocity v is commonly used in the treatment of the kinetic equation. Depending on the... [Pg.26]

The Wiener kernels depend on the GWN input power level P (because they correspond to an orthogonal expansion), whereas the Volterra kernels are independent of any input characteristics. This situation can be likened to the coefficients of an orthogonal expansion of an analytic function being dependent on the interval of expansion. It is therefore imperative that Wiener kernel estimates be reported in the literature with reference to the GWN input power level that they were estimated with. When a complete set of Wiener kernels is obtained, then the complete set of Volterra kernels can be evaluated. Approximations of Volterra kernels can be obtained from Wiener kernels of the same order estimated with various input power levels. Complete Wiener or Volterra models can predict the system output to any given input. [Pg.209]

To reduce the requirements of long experimental data records and improve the kernel estimation accuracy, least-squares methods also can be used to solve the classical linear inverse problem described earlier in Equation 13.6, where the parameter vector 9 includes all discrete kernel values of the finite Volterra model of Equation 13.17, which is Knear in these unknown parameters (i.e., kernel values). Least-squares methods also can be used in connection with orthogonal expansions of the kernels to reduce the number of unknown parameters, as outlined below. Note that solution of this inverse problem via OLS requires inversion of a large square matrix with dimensions [(M -I- f -I- 1) /((M -F 1) / )], where M is... [Pg.210]

The most general (functional) approach to evaluate an operation is to follow a domain-partitioning paradigm. This involves computing orthogonal expansions for arguments and result and than convert the result to the desired decomposition type, i.e. use function succ to obtain graph successor functions. [Pg.191]

Table 1 shows examples with different runtime and space requirements. As expected, graph types differ significantly for their word-level and bit-level behaviour. While MTBDD construction at the word-level is often very fast, BMDs and p BMDs tend to be more compact at reasonable runtimes. The situation is often reversed at the bit-level, where orthogonal expansions are advantageous. [Pg.197]

Sakhabetdinov M. A. Elaboration and Investigation of an Orthogonal Expansion Method for the Analysis of Experimental Data about Thermophysical Properties of Substances Using Computers. Author s Abstract of Candidate Thesis. MEI, Moscow, 1977. [Pg.190]

In Sects. 14.3,15, and 16 we shall benefit from the exercise we got in handling overlap effects. In the rest of the book we shall deal with usual orthogonal expansions. [Pg.113]


See other pages where Orthogonal expansion is mentioned: [Pg.196]    [Pg.198]    [Pg.198]    [Pg.198]    [Pg.198]    [Pg.203]    [Pg.204]    [Pg.192]    [Pg.179]    [Pg.205]   
See also in sourсe #XX -- [ Pg.198 ]




SEARCH



Orthogonal functions, expansions

Orthogonal functions, expansions terms

Orthogonal polynomial expansions

© 2024 chempedia.info