Search

Your search keyword '"Rhee, Noah H."' showing total 34 results
Start Over Author "Rhee, Noah H."
34 results on '"Rhee, Noah H."'

1. PROBLEMS

Author

Skidmore College Problem Group, Shabani, Armend Sh., Treviño, Enrique, Dresden, Gregory, Islam, Saimon, Wu, Andrew, Mero, Su Pernu, Omarjee, Moubinool, Suksompong, Warut, Demir, Barış Burçin, Rhee, Noah H., Martin, Reiner, Tanaka, Yoshihiro, Schmeichel, Edward, Sorel, Julien, Neamt, Piatra, Helton, Tyler, Rosenbalm, Noah, Simoson, Andy, Panthi, Prakriti, Shrestha, Anukriti, Zhang, Jiahao, and Siehler, Jacob

Published
2018

16. PREDICTING AND ESTIMATING PROBABILITY DENSITY FUNCTIONS OF CHAOTIC SYSTEMS.

Author

Rhee, Noah H., Góra, PaweŁ, and Bani-Yaghoub, Majid

Subjects
PROBABILITY density function, CHAOS theory, DENSITY functional theory, LEBESGUE measure, NUMERICAL analysis
Abstract

In the present work, for the first time, we employ Ulam's method to estimate and to predict the existence of the probability density functions of single species populations with chaotic dynamics. In particular, given a chaotic map, we show that Ulam's method generates a sequence of density functions in L1-space that may converge weakly to a function in L1-space. In such a case we show that the limiting function generates an absolutely continuous (w.r.t. the Lebesgue measure) invariant measure (w.r.t. the given chaotic map) and therefore the limiting function is the probability density function of the chaotic map. This fact can be used to determine the existence and estimate the probability density functions of chaotic biological systems. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

25. Calculating An Invariant Subspaces of Diagonally Dominant Matrices - Part I

Author

Rhee, Noah H.

Subjects
Computer Science::Robotics, General Mathematics
Abstract

In this paper a modification of the algorithm of Blevins and Stewart for calculating an invariant subspace of diagonally dominant matrices is given. The relation between the algorithm of Blevins and Stewart and our modified algorithm is essentially the same as the relation between the Jacobi method and the Gauss-Seidel method in solving linear systems iteratively.

Published
1993

31. A NOTE ON RELATIVE PERTURBATION BOUNDS.

Author

Londré, Tristan and Rhee, Noah H.

Subjects
*PERTURBATION theory, *EIGENVALUES, *MATRICES (Mathematics), *MATHEMATICAL analysis, *NUMERICAL analysis, *MATHEMATICS
Abstract

In this paper we provide an actual bound for the distance between the original and the perturbed right singular vector subspaces of a general matrix with full column rank. We also provide actual relative componentwise bounds for perturbed eigenvectors of a positive definite matrix. [ABSTRACT FROM AUTHOR]

Published
1999

32. Note on functional iteration technique for M/G/1 type Markov chains

Author

Rhee, Noah H.

Subjects
Minimal nonnegative solution, Markov chains, Iterative methods, Mean asymptotic convergence rate, Stochastic matrices
Abstract

A thorough theoretical explanation of the numerical behaviour of functional iteration methods for the computation of the minimal nonnegative solution G of the matrix equation X=∑i=0∞XiAi, arising in the numerical solution of M/G/1 type Markov chains, is given in Meini (1997) [2]. In this note we add some more results. In particular, we show that an upper bound of the mean asymptotic convergence rate of the best functional iteration method is given in terms of the second largest modulus eigenvalue of G.

Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results