Sean Reiter
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sean Reiter has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Lloyd N. Trefethen
School of Engineering and Applied Sciences, Harvard University, Cambridge, USA
2 shared publications - Mark Embree
Department of Mathematics Virginia Tech 225 Stanger Street 0123 24061 Blacksburg VA
1 shared publication Michael S. Ackermann
Dept. of Mathematics Virginia Tech 24061 Blacksburg VA USA
1 shared publication- Michael S. Ackermann
Department of Mathematics, Virginia Tech, Blacksburg, USA
1 shared publication - Serkan Gugercin
Department of Mathematics and Division of Computational Modeling and Data Analytics, Academy of Data Science, Virginia Tech, Blacksburg, USA
1 shared publication - Vassilis Kekatos
Purdue University, West Lafayette
1 shared publication
Latest Publications
- 1 August 2026
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 13 (3) , 65
$L^2$ and $L^\infty $ rational approximation on the unit disk- 1 August 2026
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 13 (3) , 65
$L^2$ and $L^\infty $ rational approximation on the unit disk- Open Access$L^2$ and $L^\infty$ rational approximationUsing recently developed algorithms, we compute and compare best $L^2$ and $L^\infty$ rational approximations of analytic functions on the unit disk. Although there is some theory for these problems going back decades, this may be the first computational study. To compute the $L^2$ best approximations, we employ a new formulation of TF-IRKA in barycentric form.Open Access$L^2$ and $L^\infty$ rational approximationUsing recently developed algorithms, we compute and compare best $L^2$ and $L^\infty$ rational approximations of analytic functions on the unit disk. Although there is some theory for these problems going back decades, this may be the first computational study. To compute the $L^2$ best approximations, we employ a new formulation of TF-IRKA in barycentric form.
- Open Access
Interpolatory Approximations of PMU Data: Dimension Reduction and Pilot Selection
This work investigates the reduction of phasor measurement unit (PMU) data through low-rank matrix approximations. To reconstruct a PMU data matrix from fewer measurements, we propose the framework of interpolatory matrix decompositions (IDs). In contrast to methods relying on principal component analysis or singular value decomposition, IDs recover the complete data matrix using only a few of its rows (PMU datastreams) and/or a few of its columns (snapshots in time). This compression enables the real-time monitoring of power transmission systems using a limited number of measurements, thereby minimizing communication bandwidth. The ID perspective gives a rigorous error bound on the quality of the data compression. We propose selecting rows and columns used in an ID via the discrete empirical interpolation method (DEIM), a greedy algorithm that aims to control the error bound. This bound leads to a computable estimate for the reconstruction error during online operations. A violation of this estimate suggests a change in the system's operating conditions, and thus serves as a tool for fault detection. Numerical tests using synthetic PMU data illustrate DEIM's excellent performance for data compression, and validate the proposed DEIM-based fault-detection method.
Open AccessInterpolatory Approximations of PMU Data: Dimension Reduction and Pilot Selection
This work investigates the reduction of phasor measurement unit (PMU) data through low-rank matrix approximations. To reconstruct a PMU data matrix from fewer measurements, we propose the framework of interpolatory matrix decompositions (IDs). In contrast to methods relying on principal component analysis or singular value decomposition, IDs recover the complete data matrix using only a few of its rows (PMU datastreams) and/or a few of its columns (snapshots in time). This compression enables the real-time monitoring of power transmission systems using a limited number of measurements, thereby minimizing communication bandwidth. The ID perspective gives a rigorous error bound on the quality of the data compression. We propose selecting rows and columns used in an ID via the discrete empirical interpolation method (DEIM), a greedy algorithm that aims to control the error bound. This bound leads to a computable estimate for the reconstruction error during online operations. A violation of this estimate suggests a change in the system's operating conditions, and thus serves as a tool for fault detection. Numerical tests using synthetic PMU data illustrate DEIM's excellent performance for data compression, and validate the proposed DEIM-based fault-detection method.