Computer mathematics : proceedings of the Fourth Asian by Xiao-Shan Gao; Dongming Wang (eds.)

By Xiao-Shan Gao; Dongming Wang (eds.)

This publication treats the Stark impact of a hydrogenic atom or ion in a homogeneous electrical box. It starts off with a radical assessment of earlier paintings during this box considering 1926. After the Schrodinger equation has been separated with appreciate to time dependence, centre of mass movement and inner movement, by way of a dialogue of its eigenfunctions, the precise improvement in time of the chance amplitude for a decaying kingdom is got through a formulation analogous to the Fock Krylov theorem. From this formulation one obtains via the phase-integral approximation generated from a specific base functionality non-relativistic formulation for profiles, energies and half-widths of the Stark degrees. those formulation are then reworked into formulation expressed when it comes to entire elliptic integrals. The formulation therefore bought are used for the calculation of energies and half-widths of 198 various Stark states, that are in comparison with the corresponding effects got through different authors with using different equipment. An research of this fabric shows that the strength values received by way of the phase-integral technique are not less than as exact as these acquired by way of different tools in additional than 1/2 the 198 instances. The booklet offers essentially the most accomplished asymptotic remedies of the Stark impact in atomic hydrogen which have been released. Contents: Schrodinger Equation, its Separation and its specified Eigenfunctions; improvement in Time of the chance Amplitude for a Decaying kingdom; Phase-Integral process; Derivation of Phase-Integral formulation for Profiles, Energies and Half-Widths of Stark degrees; technique for Transformation of the Phase-Integral formulation into formulation regarding whole Elliptic Integrals; Phase-Integral amounts and Their Partial Derivatives with appreciate to E and Z1 Expressed when it comes to whole Elliptic Integrals Symbolic, algebraic, and geometric computation; automatic reasoning; computational geometry/CAGD; computational differential equations; software program layout and implementation; graph algorithms

Show description

Read or Download Computer mathematics : proceedings of the Fourth Asian Symposium (ASCM 2000) PDF

Best mathematics books

Introduction to computer performance analysis with Mathematica

"Introduction to machine functionality research with Mathematica" is designed as a beginner's advisor to laptop functionality research and assumes just a simple wisdom of desktops and a few mathematical skillability. The mathematical points were relegated to a Mathematica application disk, permitting readers to aim out many of the strategies as they paintings their manner throughout the ebook.

Additional resources for Computer mathematics : proceedings of the Fourth Asian Symposium (ASCM 2000)

Example text

M. ): Proc. ISSAC '95, ACM Press, New York, pp. 187-194. 10. , Yang, L. (1994): Algebraic and geometric reasoning using Dixon resultants. , Giesbrecht, M. ): Proc. ISSAC '94, ACM Press, Baltimore, pp. 99-107. 11. Loos, R. (1983): Generalized polynomial remainder sequences. , Loos, R. ): Computer algebra: Symbolic and algebraic computation. Springer, Wien, pp. 115-137. 12. Mishra, B. (1993): Algorithmic algebra. Springer, New York. 13. Wang, D. (1998): Decomposing polynomial systems into simple systems.

In Michael D. Atkinson, editor, Computational Group Theory, pages 3-18. Academic Press, 1984. 8. Tom Litt. Coset enumeration. MSc thesis, Mathematical Institute, University of Oxford, 1999. 9. J. Neubiiser. An elementary introduction to coset-table methods in computational group theory. M. F. Robertson, editors, Groups - St. Andrews 1981, London Mathematical Society Lecture Note Series 71, pages 1-45. Cambridge University Press, 1982. 10. Colin Ramsay. 000: Parallel ACE. Technical Report 17, Centre for Discrete Mathematics and Computing, The University of Queensland, 2000.

Therefore, +m -n +m-n det(Skt) = ' am-n det (lSkt)^ 0 = det(Bkt)/(-ao)m-n = det(Bkt) for 0 < k < n and 0 < t < k. This completes the proof of our main theorem. 3 Experiments In this section we present some preliminary experiments with several examples for the techniques of computing subresultant chains using pseudo-division,11,12 the Sylvester matrix, and the Bezout matrix. One of our purposes is to figure out for which classes of polynomials the technique using the Bezout matrix performs better.

Download PDF sample

Rated 4.77 of 5 – based on 46 votes