Kenneth L. Ho

Kenneth L. Ho

Auto-generated profile, based on publicly available information

Kenneth L. Ho

Department of Mathematics Stanford University 94305. Stanford CA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2012 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
KHKenneth L. Ho
Kenneth L. Ho
LGLeslie Greengard
Leslie Greengard
We present a fast direct solver for structured linear systems based on multilevel matrix compression. Using the recently developed interpolative decomposition of a low-rank matrix in a recursive manner, we embed an approximation of the original matrix into a larger but highly structured sparse one that allows fast factorization and application of the inverse. The algorithm extends the Martinsson--Rokhlin method developed for 2D boundary integral equations and proceeds in two phases: a precomputation phase, consisting of matrix compression and factorization, followed by a solution phase to apply the matrix inverse. For boundary integral equations which are not too oscillatory, e.g., based on the Green functions for the Laplace or low-frequency Helmholtz equations, both phases typically have complexity $\mathcal{O} (N)$ in two dimensions, where $N$ is the number of discretization points. In our current implementation, the corresponding costs in three dimensions are $\mathcal{O} (N^{3/2})$ and $\mathcal{O} (N \log N)$ for precomputation and solution, respectively. Extensive numerical experiments show a speedup of ${\sim}100$ for the solution phase over modern fast multipole methods; however, the cost of precomputation remains high. Thus, the solver is particularly suited to problems where large numbers of iterations would be required. Such is the case with ill-conditioned linear systems or when the same system is to be solved with multiple right-hand sides. Our algorithm is implemented in Fortran and freely available.

4 May 2015 in Communications on Pure and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
KHKenneth L. Ho
Kenneth L. Ho
LYLexing Ying
Lexing Ying

4 May 2015 in Communications on Pure and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
KHKenneth L. Ho
Kenneth L. Ho
LYLexing Ying
Lexing Ying

1 January 2015 in Multiscale Modeling & Simulation
Verified
Journal Article
Closed access
YLYingzhou Li
Yingzhou Li
HYHaizhao Yang
Haizhao Yang
EMEileen R. Martin
Eileen R. Martin
KHKenneth L. Ho
Kenneth L. Ho
LYLexing Ying
Lexing Ying
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the matrix and its adjoint are available or the entries of the matrix can be sampled individually. For an $N\times N$ matrix, the resulting factorization is a product of $O(\log N)$ sparse matrices, each with $O(N)$ nonzero entries. Hence, it can be applied rapidly in $O(N\log N)$ operations. Numerical results are provided to demonstrate the effectiveness of the butterfly factorization and its construction algorithms.

10 December 2008 in Theoretical Biology and Medical Modelling
Verified
Journal Article
Open access
PDF file
HHHeather A Harrington
Heather A Harrington
KHKenneth L Ho
Kenneth L Ho
SGSamik Ghosh
Samik Ghosh
KTKc Tung
Kc Tung
A key physiological mechanism employed by multicellular organisms is apoptosis, or programmed cell death. Apoptosis is triggered by the activation of caspases in response to both extracellular (extrinsic) and intracellular (intrinsic) signals. The extrinsic and intrinsic pathways are characterized by the formation of the death-inducing signaling complex (DISC) and the apoptosome, respectively; both the DISC and the apoptosome are oligomers with complex formation dynamics. Additionally, the extrinsic and intrinsic pathways are coupled through the mitochondrial apoptosis-induced channel via the Bcl-2 family of proteins.

1 January 2017 in Multiscale Modeling & Simulation
Verified
Journal Article
Closed access
VMVictor Minden
Victor Minden
KHKenneth L. Ho
Kenneth L. Ho
ADAnil Damle
Anil Damle
LYLexing Ying
Lexing Ying
We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equa...