Alan Feldstein
Arizona State University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Alan Feldstein.
Journal of the ACM | 1976
Alan Feldstein; Richard Goodman
This paper analyzes the distribution of trailing digits (tail end digits) of positive real floating-point numbers represented in arbitrary base <italic>β</italic> and randomly chosen from a logarithmic distribution. The analysis shows that the <italic>n</italic>th digit for <italic>n</italic> ≥ 2 is actually approximately uniformly distributed. The approximation depends upon both <italic>n</italic> and the base<italic>β</italic>. It becomes better as <italic>n</italic> increases, and it is exact in the limit as <italic>n</italic> ⇒ ∞. A table of this distribution is presented for various β and <italic>n</italic>, along with a table of the maximum digit by digit deviation Δ of the logarithmic distribution from the uniform distribution. Various asymptotic results for Δ are included. These results have application in resolving open questions of Henrici, of Kaneko and Liu, and of Tsao.
Journal of Mathematical Analysis and Applications | 1991
Yang Kuang; Alan Feldstein
Abstract Sufficient conditions are obtained for the boundedness of solutions of the non-linear nonautonomous neutral equation x (t) = r(t) x(t)(a(t) − x(t − 1) − c(t) x (t − 1)) , which arise in a “food-limited” population model. This partially answers a recent open question proposed by K. Gopalsamy and B. G. Zhang.
SIAM Journal on Numerical Analysis | 1984
Alan Feldstein; Kenneth W. Neves
This work presents a theoretical basis for high order numerical methods to solve state-dependent delay differential equations of the form: \[\begin{gathered} \dot x(t) = f(t,x(t),x(\alpha (t,x(t))))\quad {\text{for }}t \in [a,b], \hfill \\ \alpha (t,x(t)) \leqq t, \hfill \\ x(t) = \phi (t)\quad {\text{for }}t \in [\bar a,a] \hfill \\ \end{gathered} \] where
Journal of Mathematical Analysis and Applications | 1976
Kenneth W. Neves; Alan Feldstein
\bar a = \min \alpha (t,x(t))
Numerische Mathematik | 1973
Alan Feldstein; Richard Goodman
for
Computing | 1975
Richard Goodman; Alan Feldstein
t \in [a,b]
Computing | 1977
Richard H. Goodman; Alan Feldstein
. The solutions to such equations typically have derivative jump discontinuities (jump points) which propagate from the initial jump point
Computing | 1985
Richard H. Goodman; Joaquin Bustoz; Alan Feldstein
t = a
Archive | 1989
Alan Feldstein; Richard H. Goodman
. Thus, high order methods require an accurate determination of the location of jump discontinuities in lower order derivatives of the solution
Numerische Mathematik | 1973
Richard Goodman; Alan Feldstein
x(t)