Stable Numerical Method in Computation of Stellar Evolution
نویسندگان
چکیده
منابع مشابه
Presupernova Evolution of Rotating Massive Stars I: Numerical Method and Evolution of the Internal Stellar Structure
The evolution of rotating stars with zero-age main sequence (ZAMS) masses in the range 8M⊙ to 25M⊙ is followed through all stages of stable evolution. The initial angular momentum is chosen such that the star’s equatorial rotational velocity on the ZAMS ranges from zero to ∼ 70% of break-up. The stars rotate rigidly on the ZAMS as a consequence of angular momentum redistribution during the pre-...
متن کاملMinimum Velocity Dispersion in Stable Stellar Disks . ̧ Numerical Simulations
We used N-body dynamical simulations to analyze the conditions for the gravitational stability of a three-dimensional stellar disk in the grav-itational field of two rigid spherical components — a bulge and a halo, whose central concentrations and relative masses vary over wide ranges. The number of point masses N in the simulations varied from 40 to 500 thousands and the evolution of the simul...
متن کاملOn Numerical (in)stability of Recursive Present Value Computation Method
We show that the recursive computation scheme of present value (PV), which is used implicitly in FAS 91 accounting standard, is numerically unstable and that the absolute error increases exponentially for positive discount rates. We show that reversing the direction of calculations in the recurrence equation yields a robust PV computation routine.
متن کاملComputation of Nonlinear Backscattering Using a High-Order Numerical Method
1 School of Mathematical Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel. E-mail: {fibich;bazooka}@math.tau.ac.il 2 Department of Mathematics, North Carolina State University, Box 8205, Raleigh, North Carolina 27695. E-mail: [email protected]. Also: School of Mathematical Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel. Received July 11, 2001; accepted Oc...
متن کاملOn numerical stability of recursive present value computation method
We analyze numerical stability of a recursive computation scheme of present value (PV) amd show that the absolute error increases exponentially for positive discount rates. We show that reversing the direction of calculations in the recurrence equation yields a robust PV computation routine.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress of Theoretical Physics Supplement
سال: 1981
ISSN: 0375-9687
DOI: 10.1143/ptps.70.115