Tien Yien Li
Michigan State University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Tien Yien Li.
American Mathematical Monthly | 1975
Tien Yien Li; James A. Yorke
The way phenomena or processes evolve or change in time is often described by differential equations or difference equations. One of the simplest mathematical situations occurs when the phenomenon can be described by a single number as, for example, when the number of children susceptible to some disease at the beginning of a school year can be estimated purely as a function of the number for the previous year. That is, when the number x n+1, at the beginning of the n + 1st year (or time period) can be written
Acta Numerica | 1997
Tien Yien Li
SIAM Journal on Numerical Analysis | 1976
R.B. Kellogg; Tien Yien Li; James A. Yorke
{x_{n + 1}} = F({x_n}),
Computing | 2008
Tsung-Lin Lee; Tien Yien Li; Chih-Hsiung Tsai
Handbook of Numerical Analysis | 2003
Tien Yien Li
(1.1) where F maps an interval J into itself. Of course such a model for the year by year progress of the disease would be very simplistic and would contain only a shadow of the more complicated phenomena. For other phenomena this model might be more accurate. This equation has been used successfully to model the distribution of points of impact on a spinning bit for oil well drilling, as mentioned if [8, 11] knowing this distribution is helpful in predicting uneven wear of the bit. For another example, if a population of insects has discrete generations, the size of the n + 1st generation will be a function of the nth. A reasonable model would then be a generalized logistic equation
SIAM Journal on Numerical Analysis | 1980
C. B. Garcia; Tien Yien Li
SIAM Journal on Numerical Analysis | 1989
Tien Yien Li; Tim Sauer; James A. Yorke
{x_{n + 1}} = r{x_n}[1 - {x_n}/K].
Mathematics of Computation | 1996
Tien Yien Li; Xiaoshen Wang
SIAM Journal on Matrix Analysis and Applications | 2005
Tien Yien Li; Zhonggang Zeng
(1.2)
Transactions of the American Mathematical Society | 1984
Andrzej Lasota; Tien Yien Li; James A. Yorke
Let P ( x ) = 0 be a system of n polynomial equations in n unknowns. Denoting P = ( p 1 ,…, p n ), we want to find all isolated solutions of for x = ( x 1 ,…, x n ). This problem is very common in many fields of science and engineering, such as formula construction, geometric intersection problems, inverse kinematics, power flow problems with PQ-specified bases, computation of equilibrium states, etc. Elimination theory-based methods, most notably the Buchberger algorithm (Buchberger 1985) for constructing Grobner bases, are the classical approach to solving (1.1), but their reliance on symbolic manipulation makes those methods seem somewhat unsuitable for all but small problems.