Probabilistic analysis of numerical integration algorithms
โ Scribed by Feng Gao
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 593 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Taking advantage of the power of DNA molecules to spontaneously form hairpin structures, Sakamoto et al. designed a molecular algorithm to solve instances of the satisรฟability problem on Boolean expressions in clausal form (the SAT problem), and by developing new experimental techniques for molecula
In this paper, the discrete generalized Bode's theorem is derived and applied to the transfer functions of time integration algorithms for semidiscrete ยฎnite element equations. An integral equation is obtained that has to be satisยฎed by discrete-time transfer functions of time integration algorithms
A comparative analysis of the most well known numerical integration rules is conducted by the Fourier method, which allows their approximation properties to be estimated not only in the limit of step size tending to zero but also for nonzero step size. In this way new insight is gained on several ph
the particle velocity data is generated from a numerical simulation; therefore, the velocity data is only available at Several techniques for the numerical integration of particle paths in steady and unsteady vector (velocity) fields are analyzed. Most some set of discrete times, t n , for n ฯญ 0, 1,