δf Algorithm
✍ Scribed by Richard E. Denton; M. Kotschenreuther
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 637 KB
- Volume
- 119
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It is proved that if all Fg-sets in the product X x Y are &normal, then either X is normal and countably paracompact or all countable subsets of Y are closed. If the product X x Y is hereditarily S-normal, then either X is perfectly normal or all countable subsets of Y are closed. Applications to ex
We deal with the function z [ ( f (z), f $(z)) where f (z)= i 0 a i z i , (a i # C) with lim i Ä a i+1 \_a i&1 Â(a i ) 2 =q. We investigate the convergence of the vector QD algorithm. We give the asymptotic behaviour of the generalized Hankel determinants.