Big Chemical Encyclopedia

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

Articles Figures Tables About

Algebraic method accuracy

The algebraic methods of reconstruction give result at incomplete and complete set of initial projection data. But the iterative imhlementation of these methods requires large computing resources. Algebraic method can be used in cases, when the required accuracy is not great. [Pg.219]

The problems we are going to study come from chemistry, biology or pharmacology, and most of them involve highly nonlinear relationships. Nevertheless, there is almost no example in this book which could have boon solved without linear algebraic methods. Moreover, in most cases the success of solving the entire problem heavily depends on the accuracy and the efficiency in the algebraic computation. [Pg.19]

Thus, perturbation theory based on the scaled hydrogenic basis can provide better accuracy and, when combined with the convenient calculation of matrix elements using so(4, 2) algebraic methods, results in an effective technique for large-order perturbation theory (Cizek and Vrscay, 1982 Clay, 1979 Vrscay, 1977 Bednar, 1973 Adams et al., 1980 Cizek et al 1980a,b Silverstone et al., 1979). [Pg.57]

As mentioned earlier, overall accuracy of finite element computations is directly detennined by the accuracy of the method employed to obtain the numerical solution of the global system of algebraic equations. In practical simulations, therefore, computational errors which are liable to affect the solution of global stiffness equations should be carefully analysed. [Pg.206]

Abstract Hilbert space, 426 Accuracy of computed root, 78 Acharga, R., 498,539,560 Additive Gaussian noise channel, 242 Adjoint spinor transformation under Lorentz transformation, 533 Admissible wave function, 552 Aitkin s method, 79 Akhiezer, A., 723 Algebra, Clifford, 520 Algebraic problem, 52 linear, 53... [Pg.769]

In principle, the task of solving a linear algebraic systems seems trivial, as with Gauss elimination a solution method exists which allows one to solve a problem of dimension N (i.e. N equations with N unknowns) at a cost of O(N ) elementary operations [85]. Such solution methods which, apart from roundoff errors and machine accuracy, produce an exact solution of an equation system after a predetermined number of operations, are called direct solvers. However, for problems related to the solution of partial differential equations, direct solvers are usually very inefficient Methods such as Gauss elimination do not exploit a special feature of the coefficient matrices of the corresponding linear systems, namely that most of the entries are zero. Such sparse matrices are characteristic of problems originating from the discretization of partial or ordinary differential equations. As an example, consider the discretization of the one-dimensional Poisson equation... [Pg.165]

This then provides a physical derivation of the finite-difference technique and shows how the solution to the differential equations can be propagated forward in time from a knowledge of the concentration profile at a series of mesh points. Algebraic derivations of the finite-difference equations can be found in most textbooks on numerical analysis. There are a variety of finite-difference approximations ranging from the fully explicit method (illustrated above) via Crank-Nicolson and other weighted implicit forward. schemes to the fully implicit backward method, which can be u.sed to solve the equations. The methods tend to increase in stability and accuracy in the order given. The difference scheme for the cylindrical geometry appropriate for a root is... [Pg.340]

Interpretive methods Involve modeling the retention surface (as opposed to the response surface) on the basis of experimental retention time data [478-480,485,525,541]. The model for the retention surface may be graphical or algebraic and based on mathematical or statistical theories. The retention surface is generally much simpler than the response surface and can be describe by an accurate model on the basis of a small number of experiments, typically 7 to 10. Solute recognition in all chromatograms is essential, however, and the accuracy of any predictions is dependent on the quality of the model. [Pg.245]

Sections on matrix algebra, analytic geometry, experimental design, instrument and system calibration, noise, derivatives and their use in data analysis, linearity and nonlinearity are described. Collaborative laboratory studies, using ANOVA, testing for systematic error, ranking tests for collaborative studies, and efficient comparison of two analytical methods are included. Discussion on topics such as the limitations in analytical accuracy and brief introductions to the statistics of spectral searches and the chemometrics of imaging spectroscopy are included. [Pg.556]

If one includes in the sum as many terms as bound states, one obtains a (not necessarily unique1) potential which exactly reproduces the algebraic spectrum. This method is cumbersome, and in order to carry it out one usually stops the expansion after the first few terms, thereby obtaining a potential that only approximately describes the algebraic spectrum. The accuracy of the approximation depends on how many terms are kept and also on the set of functions... [Pg.156]

Modern many-body methods have become sufficiently refined that the major source of error in most ab initio calculations of molecular properties is today associated with truncation of one-particle basis sets e.g. [1]- [4]) that is, with the accuracy with which the algebraic approximation is implemented. The importance of generating systematic sequences of basis sets capable of controlling basis set truncation error has been emphasized repeatedly in the literature (see [4] and references therein). The study of the convergence of atomic and molecular structure calculations with respect to basis set extension is highly desirable. It allows examination of the convergence of calculations with respect to basis set size and the estimation of the results that would be obtained from complete basis set calculations. [Pg.108]

Adomian s Decomposition Method is used to solve the model equations that are in the form of nonlinear differential equation(s) with boundary conditions.2,3 Approximate analytical solutions of the models are obtained. The approximate solutions are in the forms of algebraic expressions of infinite power series. In terms of the nonlinearities of the models, the first three to seven terms of the series are generally sufficient to meet the accuracy required in engineering applications. [Pg.222]

The truncation error for Eq. (10.40) is the same as those stated for the momentum equation for p = 0, A, 1. The fully implicit scheme can be increased to a formal second-order accuracy by representing the streamwise derivatives with three-level (i-l,i,i+l) second-order differences. For any implicit method, the finite difference momentum and energy equations are algebraically nonlinear in the unknowns because of the quantities unknown at the i+1 level in the coefficients. Linearizing procedures can and have been used, but are beyond the scope of this book. [Pg.176]


See other pages where Algebraic method accuracy is mentioned: [Pg.105]    [Pg.113]    [Pg.3417]    [Pg.246]    [Pg.228]    [Pg.231]    [Pg.239]    [Pg.201]    [Pg.217]    [Pg.51]    [Pg.204]    [Pg.475]    [Pg.673]    [Pg.343]    [Pg.166]    [Pg.189]    [Pg.83]    [Pg.18]    [Pg.169]    [Pg.232]    [Pg.313]    [Pg.327]    [Pg.260]    [Pg.305]    [Pg.130]    [Pg.66]    [Pg.49]    [Pg.601]    [Pg.606]    [Pg.302]    [Pg.196]    [Pg.397]    [Pg.246]    [Pg.206]    [Pg.145]    [Pg.24]   
See also in sourсe #XX -- [ Pg.44 ]




SEARCH



Algebra methods)

Algebraic method

© 2024 chempedia.info