Benjamin W. Ong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Benjamin W. Ong has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
Andrew Christlieb
Department of Mathematics, Michigan State University
5 shared publicationsAndrew J. Christlieb
Michigan State University
5 shared publicationsJing-Mei Qiu
Department of Mathematics and Computer Sciences, Colorado School of Mines, Golden, Colorado
3 shared publications- Ronald D. Haynes
Memorial University
3 shared publications - Andrew Christlieb
Department of Mathematics Michigan State University 619 Red Cedar Road 48824 East Lansing MI USA
2 shared publications - Andrew Christlieb
Department of Computational Mathematics, Science, and Engineering Michigan State University
2 shared publications
Latest Publications
- Open Access
An Incremental Non-Linear Manifold Approximation Method
Analyzing high-dimensional data presents challenges due to the "curse of dimensionality'', making computations intensive. Dimension reduction techniques, categorized as linear or non-linear, simplify such data. Non-linear methods are particularly essential for efficiently visualizing and processing complex data structures in interactive and graphical applications. This research develops an incremental non-linear dimension reduction method using the Geometric Multi-Resolution Analysis (GMRA) framework for streaming data. The proposed method enables real-time data analysis and visualization by incrementally updating the cluster map, PCA basis vectors, and wavelet coefficients. Numerical experiments show that the incremental GMRA accurately represents non-linear manifolds even with small initial samples and aligns closely with batch GMRA, demonstrating efficient updates and maintaining the multiscale structure. The findings highlight the potential of Incremental GMRA for real-time visualization and interactive graphics applications that require adaptive high-dimensional data representations.
Open AccessAn Incremental Non-Linear Manifold Approximation Method
Analyzing high-dimensional data presents challenges due to the "curse of dimensionality'', making computations intensive. Dimension reduction techniques, categorized as linear or non-linear, simplify such data. Non-linear methods are particularly essential for efficiently visualizing and processing complex data structures in interactive and graphical applications. This research develops an incremental non-linear dimension reduction method using the Geometric Multi-Resolution Analysis (GMRA) framework for streaming data. The proposed method enables real-time data analysis and visualization by incrementally updating the cluster map, PCA basis vectors, and wavelet coefficients. Numerical experiments show that the incremental GMRA accurately represents non-linear manifolds even with small initial samples and aligns closely with batch GMRA, demonstrating efficient updates and maintaining the multiscale structure. The findings highlight the potential of Incremental GMRA for real-time visualization and interactive graphics applications that require adaptive high-dimensional data representations.
- 2 February 2022
- Published by Springer Nature
- p. 226-240
Randomized Iterative Methods for Matrix Approximation
- 2 February 2022
- Published by Springer Nature
- p. 226-240
Randomized Iterative Methods for Matrix Approximation
- 23 September 2020
- Published by Springer Nature in Computing and Visualization in Science
- Vol. 23 (1-4) , 1-15
Applications of time parallelization
- 23 September 2020
- Published by Springer Nature in Computing and Visualization in Science
- Vol. 23 (1-4) , 1-15
Applications of time parallelization
- 11 June 2020
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 83 (3) , 1-29
Deferred Correction Methods for Ordinary Differential Equations
- 11 June 2020
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 83 (3) , 1-29
Deferred Correction Methods for Ordinary Differential Equations
- 5 March 2020
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 82 (3) , 1-12
Towards an Adaptive Treecode for N-body Problems
- 5 March 2020
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 82 (3) , 1-12
Towards an Adaptive Treecode for N-body Problems
- 2 January 2019
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 41 (1) , A339-A364
Schwarz Waveform Relaxation with Adaptive Pipelining
Schwarz waveform relaxation (SWR) methods have been developed to solve a wide range of diffusion-dominated and reaction-dominated equations. The appeal of these methods stems primarily from their ability to use nonconforming space-time discretizations; SWR methods are consequently well-adapted for coupling models with highly varying spatial and time scales. The efficacy of SWR methods is questionable, however, since in each iteration, one propagates an error across the entire time interval. In this manuscript, we introduce an adaptive pipeline approach wherein one subdivides the computational domain into space-time blocks, and adaptively selects the waveform iterates which should be updated given a fixed number of computational workers. Our method is complementary to existing space and time parallel methods, and can be used to obtain additional speedup when the saturation point is reached for other types of parallelism. We analyze these waveform relaxation with adaptive pipelining (WRAP) methods to show convergence and the theoretical speedup that can be expected. Numerical experiments on solutions to the linear heat equation, the advection-diffusion equation, and a reaction-diffusion equation illustrate features and efficacy of WRAP methods for various transmission conditions.
- 2 January 2019
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 41 (1) , A339-A364
Schwarz Waveform Relaxation with Adaptive Pipelining
Schwarz waveform relaxation (SWR) methods have been developed to solve a wide range of diffusion-dominated and reaction-dominated equations. The appeal of these methods stems primarily from their ability to use nonconforming space-time discretizations; SWR methods are consequently well-adapted for coupling models with highly varying spatial and time scales. The efficacy of SWR methods is questionable, however, since in each iteration, one propagates an error across the entire time interval. In this manuscript, we introduce an adaptive pipeline approach wherein one subdivides the computational domain into space-time blocks, and adaptively selects the waveform iterates which should be updated given a fixed number of computational workers. Our method is complementary to existing space and time parallel methods, and can be used to obtain additional speedup when the saturation point is reached for other types of parallelism. We analyze these waveform relaxation with adaptive pipelining (WRAP) methods to show convergence and the theoretical speedup that can be expected. Numerical experiments on solutions to the linear heat equation, the advection-diffusion equation, and a reaction-diffusion equation illustrate features and efficacy of WRAP methods for various transmission conditions.
- 29 June 2017
- Published by Springer Nature in Numerical Algorithms
- Vol. 78 (1) , 1-20
Pipeline implementations of Neumann–Neumann and Dirichlet–Neumann waveform relaxation methods
- 29 June 2017
- Published by Springer Nature in Numerical Algorithms
- Vol. 78 (1) , 1-20
Pipeline implementations of Neumann–Neumann and Dirichlet–Neumann waveform relaxation methods
- Open Access
Pipeline Implementations of Neumann-Neumann and Dirichlet-Neumann Waveform Relaxation Methods
This paper is concerned with the reformulation of Neumann-Neumann Waveform Relaxation (NNWR) methods and Dirichlet-Neumann Waveform Relaxation (DNWR) methods, a family of parallel space-time approaches to solving time-dependent PDEs. By changing the order of the operations, pipeline-parallel computation of the waveform iterates are possible without changing the final solution. The parallel efficiency and the increased communication cost of the pipeline implementation is presented, along with weak scaling studies to show the effectiveness of the pipeline NNWR and DNWR algorithms.
Open AccessPipeline Implementations of Neumann-Neumann and Dirichlet-Neumann Waveform Relaxation Methods
This paper is concerned with the reformulation of Neumann-Neumann Waveform Relaxation (NNWR) methods and Dirichlet-Neumann Waveform Relaxation (DNWR) methods, a family of parallel space-time approaches to solving time-dependent PDEs. By changing the order of the operations, pipeline-parallel computation of the waveform iterates are possible without changing the final solution. The parallel efficiency and the increased communication cost of the pipeline implementation is presented, along with weak scaling studies to show the effectiveness of the pipeline NNWR and DNWR algorithms.
- 18 December 2016
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 71 (3) , 1212-1237
A New Family of Regularized Kernels for the Harmonic Oscillator
- 18 December 2016
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 71 (3) , 1212-1237
A New Family of Regularized Kernels for the Harmonic Oscillator
- 2 December 2016
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 71 (3) , 959-993
An Asymptotic Preserving Maxwell Solver Resulting in the Darwin Limit of Electrodynamics
- 2 December 2016
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 71 (3) , 959-993
An Asymptotic Preserving Maxwell Solver Resulting in the Darwin Limit of Electrodynamics