Find Academic Supervisors

Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +5 more

Howard Elman is a Professor in the Department of Computer Science at the University of Maryland, with affiliations to the Institute for Advanced Computer Studies (UMIACS) and as an Affiliate Professor in the Department of Mathematics. His research spans numerical analysis, computational fluid dynamics, and uncertainty quantification, focusing on iterative solvers for partial differential equations. Education: PhD in Computer Science, Yale University (1982); BA in Mathematics, Columbia University (1975); Stuyvesant High School (1971) Elman's research integrates Scientific Computing with Numerical Linear Algebra , Computational Fluid Dynamics , and Uncertainty Quantification . His work addresses Stochastic Galerkin Methods , Reduced-Order Modeling , and Low-Rank Approximations for PDEs with random data. Recent publications emphasize Surrogate Models and Deep Learning in Bayesian inverse problems. His scientific awards include SIAM Fellowship (2009) and roles as Associate Editor for journals like Mathematics of Computation and SIAM Journal on Scientific Computing . He served as SIAM Editor-in-Chief (1998-2004) and Vice President for Publications. Contact: helman@umd.edu | Office: 4210 Iribe Center | Courses: AMSC/CMSC 460 Computational Methods

• Scientific Computing
• Numerical Analysis
• Computational Fluid Dynamics
• +6 more

Peter Benner is a Professor and Director at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, where he leads the Computational Methods in Systems and Control Theory group. He also holds an Honorarprofessor position for Mathematics at Otto-von-Guericke Universität Magdeburg since 2011. Benner has previously served as Managing Director of the Max Planck Institute during multiple periods (2013-2014, 2021-2022, and 2025-2026), demonstrating his leadership in the field. Benner's research focuses on Scientific Machine Learning, Numerical Linear and Multilinear Algebra, Model Order Reduction and Reduced-order Modeling, Numerical Methods in Systems and Control Theory, PDE Constrained Optimization, High-performance and Power-aware Computing, and Mathematical Software development. His work bridges theoretical mathematics with practical engineering applications, particularly addressing challenges in large-scale dynamical systems. Analysis of his recent publications reveals a strong emphasis on developing efficient computational methods for complex systems. Benner has pioneered approaches combining model order reduction with tensor methods to tackle high-dimensional problems in uncertainty quantification and PDE-constrained optimization. His work shows a consistent trend toward integrating data-driven techniques with traditional model-based approaches, particularly for nonlinear and parametric systems. Throughout his career, Benner has actively mentored students and collaborated with researchers worldwide, delivering numerous invited talks at prestigious institutions and conferences across Europe, North America, and Asia. His research has received significant funding, supporting the development of mathematical software and computational methods for industrial applications. Benner leads the Computational Methods in Systems and Control Theory department at the Max Planck Institute, which focuses on developing and implementing advanced numerical methods for large-scale dynamical systems. The group maintains strong connections with both theoretical mathematics and practical engineering applications, particularly in fluid dynamics, energy systems, and control theory.

• Scientific Machine Learning
• Numerical Linear Algebra
• Numerical Multilinear Algebra
• +7 more

Elias Jarlebring is a Professor in Numerical Linear Algebra at the Department of Mathematics, KTH Royal Institute of Technology, Stockholm. He has held the position of Full Professor since 2021, following his tenure as Associate Professor (2013-2021) and Dahlquist Research Fellow (2011-2013). His research focuses on numerical analysis, numerical linear algebra, matrix computations, and scientific computing. Jarlebring develops linear algebra algorithms to solve problems from various fields including systems and control, acoustics, electromagnetics, data science, quantum mechanics, and quantum chemistry. He is a core developer of NEP-PACK, a scientific computing software package for nonlinear eigenproblems. His recent publications demonstrate significant contributions to computational methods for nonlinear eigenvalue problems, matrix functions, and parameterized linear systems. The research shows a clear trajectory toward increasingly complex applications in quantum computing, data science, and wave propagation problems. Project grant, Swedish research council (2019) Ruth och Nils-Erik Stenbäcks foundation, junior grant (2019) Göran Gustafsson Prize for junior researchers (2014) Project grant for junior researchers, Swedish research council (2014-2018) Professor Jarlebring has supervised numerous PhD students including Vilhelm Peterson Lithell, Gustaf Lorentzon, Siobhán Correnty, Parikshit Upadhyaya, Emil Ringh, Antti Koskela, and Giampaolo Mele. He has received multiple research grants from the Swedish Research Council and serves as editor for BIT Numerical Mathematics, Linear and Multilinear Algebra, NACO Numerical Algebra Control and Optimization, and CALCOLO. He is actively involved in the numerical linear algebra community as a member of ILAS (International Linear Algebra Society), GAMM Activity Group on Numerical Linear Algebra, and the Nordic Numerical Linear Algebra Association. He also contributes to open source projects, particularly in the Julia programming language ecosystem.

• Numerical Linear Algebra
• Matrix computations
• Nonlinear eigenvalue problems
• +10 more

Daniel B. Szyld is a Professor in the Department of Mathematics at Temple University's College of Science and Technology. He is co-Director of the High-Performance Computing for Scientific Applications Professional Science Master’s program and a member of the Center for Computational Mathematics and Modeling. He holds leadership roles as President of the International Linear Algebra Society (ILAS, 2020–2026) and as a Board of Trustees member at ICERM (2024–2028), and previously served as Vice-President of SIAM (2014–2015). His research interests include Numerical Analysis , Scientific Computing , Numerical Linear Algebra , Iterative Methods , Preconditioning , Domain Decomposition , and High-Performance Computing . His work often focuses on Krylov subspace methods like GMRES, block solvers, and asynchronous algorithms, with applications in large-scale scientific simulations. The 15 most recent publications reflect a strong focus on enhancing the stability, convergence, and performance of iterative solvers, especially GMRES variants and domain decomposition methods. Topics include random sketching, deflation, weighted norms, multisketching in QR factorization, and asynchronous Schwarz methods. These works appear in top journals such as SIAM Journal on Matrix Analysis and Applications , Numerische Mathematik , and Electronic Transactions on Numerical Analysis , often in collaboration with leading researchers in the field. Scientific Awards and Recognitions: Commemorative medal, Charles University of Prague, 1997 Featured in Hall of Fame by Henk van der Vorst, SARA, 2010 Dean's Distinguished Award for Excellence in Research, Temple University, 2011 Fellow, American Mathematical Society, 2017 Fellow, Society for Industrial and Applied Mathematics, 2017 Achievement in Mathematics Award, Temple University, 2018 Faculty Senate Outstanding Service Award, Temple University, 2021 Daniel B. Szyld has served on the editorial boards of numerous prestigious journals, including Mathematics of Computation , Linear Algebra and its Applications , Numerical Linear Algebra with Applications , and was Co-Editor-in-Chief of Electronic Transactions on Numerical Analysis (2005–2013) and Editor-in-Chief of SIAM Journal on Matrix Analysis and Applications (2015–2020). His research has been supported by the National Science Foundation and the Department of Energy. He has advised students and postdocs, though specific names are not listed in the provided text. He is also involved in professional service through societies such as SIAM, AMS, ILAS, and NAM, and advocates for equity and ethical engagement in mathematics. Labs and Research Groups: He is a member of the Center for Computational Mathematics and Modeling at Temple University and co-Director of the High-Performance Computing for Scientific Applications Professional Science Master’s program, indicating active leadership in computational research and training.

• Numerical Analysis
• Scientific Computing
• Numerical Linear Algebra
• +12 more

Cameron Musco is an Assistant Professor in the Manning College of Information and Computer Sciences at the University of Massachusetts Amherst. He is affiliated with the Theory Group and conducts research at the intersection of theoretical computer science, numerical linear algebra, and machine learning. His work focuses on randomized algorithms, streaming, and distributed computation, with applications in data science. Education: PhD in Computer Science, MIT (2019) BS in Computer Science and Applied Mathematics, Yale University Research Interests: Musco's research emphasizes algorithm design for large-scale data analysis, including fast randomized methods for linear algebraic problems. He explores topics such as low-memory computation, matrix approximations, and graph algorithms, driven by applications in machine learning and distributed systems. Publications: His recent work spans advancements in hierarchical matrix approximation, graph-based nearest neighbor search, and fair resource allocation, reflecting expertise in both theoretical foundations and practical algorithmic innovation. Awards: He has received an NSF Career Award, Google Research Scholar Award, and recognition for anti-racism leadership. He actively reviews for top conferences in theoretical computer science and machine learning. Advising & Grants: Musco advises multiple PhD students and has grants from NSF and Google. His lab collaborates on projects like low-rank matrix approximation and causal discovery. Labs/Teams: He is part of the Theoretical Computer Science Group and the Center for Data Science at UMass.

• Theoretical Computer Science
• Machine Learning
• Numerical Linear Algebra
• +3 more

Dirk Praetorius is a Professor of Numerics of Partial Differential Equations (PDEs) at the Technische Universität Wien (TU Wien) , affiliated with the Institute for Analysis and Scientific Computing (ASC) within the Faculty of Mathematics and Geoinformation . He leads the research group on Numerics of PDEs and has held various leadership roles, including Institute Director (since 2020) and head of the Numerics research area. His work focuses on numerical methods for PDEs, including Finite Element Methods (FEM), Boundary Element Methods (BEM), adaptive algorithms, and computational micromagnetics. Education and Career: Praetorius earned his Diplom in Mathematics (2000) and PhD in Applied Mathematics (2003) from TU Wien, followed by a Habilitation in Numerical Analysis (2005). He has been a faculty member at TU Wien since 2005, progressing from Assistant Professor to full Professor in 2017. He has also held visiting positions at institutions such as the University of Jyväskylä and RICAM (Linz). Research Interests: His research spans numerical analysis, adaptive FEM/BEM, a-posteriori error estimation, matrix compression, and computational micromagnetics. He has contributed to modeling spin dynamics, magnetic skyrmions, and multiscale systems. His work emphasizes efficient algorithms for large-scale problems and optimal computational complexity. Awards and Editorial Roles: Praetorius received the TU Best Teacher Award (2021) and TU Best Lecture Award (2019). He serves as Senior Editor for Computational Methods in Applied Mathematics (CMAM) and on the editorial board of Applied Numerical Mathematics (APNUM) . He co-founded the outreach initiative TUForMath to promote mathematics education. Grants and Projects: He leads or co-leads several research projects funded by the Austrian Science Fund (FWF), including the collaborative SFB "Taming Complexity in Partial Differential Systems" (2017–2025) and international collaborations with Germany. His work addresses topics like functional error estimates, nonlinear PDEs, and computational design of magnetic devices. Labs and Teams: He contributes to the ASC Institute and coordinates interdisciplinary projects involving computational physics and engineering. His team develops software tools like MooAFEM and Commics for micromagnetic simulations.

• Numerical Analysis
• Partial Differential Equations
• Finite Element Method
• +3 more

Ethan N. Epperly is a Miller Research Fellow in the Department of Mathematics at the University of California, Berkeley, where he conducts cutting-edge research in applied mathematics with a focus on computational techniques for large-scale problems. Dr. Epperly received his PhD in Applied and Computational Mathematics from Caltech, where his research was supported by a Department of Energy Computational Science Graduate Fellowship. His educational background established a strong foundation in both theoretical and applied mathematics. His primary research interests include randomized and quantum algorithms, scientific computing, and large-scale machine learning. Dr. Epperly specializes in designing computational techniques for solving large-scale problems in machine learning, quantum information, and scientific computing, with particular expertise in kernel matrix approximation, low-rank approximation, and numerical linear algebra problems. His work bridges theoretical analysis with practical computational efficiency. Epperly's recent publications demonstrate a strong focus on developing efficient randomized algorithms for matrix computations. His research shows how randomized approaches can achieve accuracy and stability comparable to classical methods while offering significant computational advantages, particularly in settings where computational resources are limited. His work on Krylov subspace methods, Cholesky decomposition variants, and trace estimation has advanced the field of numerical linear algebra. Hertz foundation fellowship finalist Thomas A. Tisch Prize for Graduate Teaching in CMS W. P. Carey & Co. Prize in Applied Mathematics SIAM Student Paper Prize Department of Energy Computational Science Graduate Fellowship As a Miller Research Fellow, Dr. Epperly collaborates with leading researchers including Joel A. Tropp, Robert J. Webber, and Yifan Chen. His work has significant implications for machine learning applications requiring efficient handling of large-scale matrix computations, with potential applications across scientific computing and quantum information processing.

• Randomized algorithms
• Quantum algorithms
• Scientific computing
• +3 more

Tommy Löfstedt is an Associate Professor at Umeå University , affiliated with the Department of Computing Science and the Department of Mathematics and Mathematical Statistics. His research focuses on machine learning , computer vision , and medical image analysis , with applications in life sciences, radiation therapy, and biomedical imaging. He leads multiple research projects, including AI-driven delineation in radiation therapy, quantitative MRI for radiotherapy, and machine learning for plant nutrient uptake. Current research emphasizes structured regularization methods to improve model interpretability and robustness. Key applications include medical image segmentation , Alzheimer's classification , and uncertainty estimation in MRI . Recent publications highlight his work on morphological regularization , adversarial attack mitigation , and multi-task learning in medical imaging contexts. His projects span 2022–2026 with funding for pediatric oncology automation and gynecological cancer staging. Affiliated with both computing and mathematical departments, he bridges algorithm development with applied mathematical frameworks in medical and life science domains.

• Machine Learning
• Computer Vision
• Medical Image Analysis
• +4 more

Chen Greif is a Professor in the Department of Computer Science at the University of British Columbia (UBC). His research focuses on numerical linear algebra, iterative solvers, preconditioning techniques, and scientific computing. He has held editorial roles in SIAM journals and book series, and served as Head of the Department of Computer Science from 2016 to 2020. Greif co-authored the SIAM bestselling textbook A First Course in Numerical Methods and has published extensively in top journals. Education: Ph.D., Mathematics, University of British Columbia, 1998 M.Sc., Mathematics, Tel Aviv University, 1994 B.Sc., Mathematics, Tel Aviv University, 1991 Research Interests: Scientific computing, numerical linear algebra, iterative methods for sparse linear systems, saddle-point systems, and elliptic PDEs. His work emphasizes preconditioning techniques and numerical stability. Publications Trends: Recent work includes multigrid methods for complex systems, preconditioners for saddle-point matrices, and eigenvalue bounds analysis. His contributions bridge theory and applications in computational science and engineering. Awards: SIAM Fellow (2022) CAIMS Research Prize (2023) Multiple teaching awards (2025, 2024, 2017, 2006, 2004) Advising & Grants: Greif has advised numerous students and contributed to grants in numerical methods and computational science. He has led major conferences (e.g., International Conference on Preconditioning Techniques, 2017) and served on SIAM committees. Labs/Teams: Engaged in interdisciplinary research groups at UBC, focusing on numerical algorithms and their applications in fluid dynamics, image processing, and computational geometry.

• Scientific Computing
• Numerical Linear Algebra
• Iterative Solvers
• +3 more

Anders Forsgren is a Professor of Optimization and Systems Theory at the Department of Mathematics, KTH Royal Institute of Technology since 2003. His research focuses on nonlinear programming, particularly Newton-type methods for smooth optimization, with applications in radiation therapy, cell biology, and telecommunications. PhD in Optimization and Systems Theory (KTH, 1990) MS in Operations Research (Stanford, 1987) MSc in Engineering Physics (KTH, 1985) Research Interests: Anders develops methods for constrained optimization and applies them to intensity-modulated radiation therapy, metabolic networks, and wireless communication systems. His work bridges algorithmic innovation with real-world clinical and engineering challenges. Recent Publications: Focus on robust optimization for radiation therapy under uncertainty, quasi-Newton methods, and applications in medical physics. His 2025 papers address interplay-robust optimization and scenario positioning in proton therapy. Scientific Leadership: Co-chair, 8th SIAM Conference on Optimization (2005) Editorial board member, Computational Optimization and Applications (since 1998) Member, Mathematical Optimization Society and SIAM Mentorship: Supervises PhD students in optimization and systems theory, with former advisees working on radiation therapy robustness, metabolic modeling, and network design.

• Nonlinear Programming
• Optimization Methods
• Radiation Therapy Optimization
• +2 more

Lina von Sydow is a Professor in Computational Science at Uppsala University's Department of Information Technology. She serves as Section Dean for the Mathematical-Computer Science Section since July 2023. Her academic journey includes becoming an Associate Professor in 2000, Senior Lecturer since 1997, and leading the Department of Information Technology from 2018 to 2023. PhD in Domain Decomposition Methods (1995, Uppsala University) Postdoctoral Fellow at Oxford University (1996-1997) Her research spans computational science with dual focuses on Computational Finance and Ice Sheet Modeling . In finance, she develops numerical methods for option pricing using PDEs, radial basis functions, and stochastic volatility models. In climate science, she contributes to ice sheet dynamics through full Stokes models and adaptive time-stepping approaches, particularly in simulating grounding line migration. Recent publications (2025) address gender disparities in IT education, including comparative analysis of admission trends and intervention studies to boost female enrollment. Earlier works (2020-2015) focus on high-order finite difference methods for financial derivatives, BENCHOP benchmarking projects, and preconditioning techniques for PDEs. Scientific awards include Excellent Teacher (2013) She actively collaborates on educational reforms, co-authoring studies like Gender-aware course reform in Scientific Computing (2013). Her leadership roles include Head of Department (2018-2023) and Section Dean (2023-present), influencing academic governance and interdisciplinary research. Labs and teams: Works with Uppsala University's Computational Science group, Elmer/ICE project collaborators (e.g., Per Lötstedt, Gong Cheng), and international partners in numerical finance and climate modeling.

• Computational Science
• Computational Finance
• Ice Sheet Modeling
• +2 more

Michael Herbst is an Assistant Professor (tenure-track) at EPFL, holding a joint appointment in the School of Basic Sciences (SB) and the School of Engineering (STI). He leads the Mathematics for Materials Modelling (MatMat) research group, focusing on error control in atomistic simulations, density-functional theory (DFT), and interdisciplinary computational methods. His work bridges mathematics, materials science, and computer science, emphasizing robust algorithms and Julia-based software development. Herbst holds a PhD from Heidelberg University and has held postdoctoral positions at RWTH Aachen and Inria Paris. He is a core member of the MARVEL and CESMIX research centers. Education: 2018: Dr. rer. nat. (magna cum laude), Heidelberg University 2009–2013: BA and MSci (1st class) in Natural Sciences, University of Cambridge 2008–2009: Studies in Mathematics/Physics, TU Kaiserslautern Research Interests : Herbst's research centers on developing reliable computational methods for materials modeling, including error estimation in DFT, black-box SCF algorithms, and Julia-based tools like the Density-Functional Toolkit (DFTK). His work addresses challenges in high-throughput simulations, numerical stability, and interdisciplinary collaboration across mathematics, physics, and computer science. Grants & Projects : MARVEL Center for Computational Design (EPFL) CESMIX Center for Extreme-Scale Simulations (MIT) EMC² Project (Sorbonne/Inria/École des Ponts) Awards : HGS MathComp PostDoc Fellowship (2018–2021) DAAD Travel Funding (2018) Exploratory Research Space Fund (RWTH Aachen, 2022) Labs & Teams : Head of the MatMat group at EPFL, focusing on error-controlled simulations and open-source software development.

• Materials Science
• Computational Chemistry
• Density Functional Theory
• +3 more

Ming Gu is a Professor in the Department of Mathematics at the University of California, Berkeley . He specializes in Numerical Linear Algebra and Scientific Computing , with a focus on developing efficient algorithms for structured matrices and large-scale data analysis. Organized Matrix Computations and Scientific Computing Seminars (2009-2017) Published 15+ papers on QR algorithms , Toeplitz matrices , randomized algorithms , and low-rank approximations His research addresses rank-revealing factorizations , randomized subspace iteration , and preconditioning techniques , often bridging numerical analysis with applications in machine learning and optimization . Students advised by him (e.g., Jiaming Wang, Onyebuchi Ekenta) have explored spectrum-revealing CUR decomposition and truncated SVD . Contact: mgu@math.berkeley.edu Office: 861 Evans Hall, UC Berkeley

• Numerical Linear Algebra
• Scientific Computing
• Matrix Computations
• +3 more

Elizaveta Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University. She is also associated with the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Education: Specialist degree from Moscow State University (2012), PhD in Mathematics from University of Michigan (2018 under Roman Vershynin) Prior Appointments: Postdoctoral Scholar at Lawrence Berkeley National Lab (2021), Assistant Adjunct Professor at UCLA Mathematics Department (2018-2021) Her research focuses on randomized numerical linear algebra , mathematics of data science , and high-dimensional probability . Key interests include developing algorithms for large-scale data with non-trivial structure, robust and interpretable learning, and stochastic optimization. Her recent work analyzes algorithmic convergence in structured settings, tensor-based data compression, and nonnegative matrix/tensor factorization under constraints. Recent publications span topics in randomized NLA , robust solvers , tensor methods , and nonnegative matrix factorization . Notable trends include improving convergence rates for iterative methods, handling adversarial noise in linear systems, and leveraging tensor structures for efficient data recovery. She supervises Ph.D. students including Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko. Her teaching at Princeton covers graduate probability theory (ORF526), convex optimization (ORF523), and network science (ORF387), with prior teaching roles at UCLA and University of Michigan.

• High-dimensional probability
• Randomized algorithms
• Numerical linear algebra
• +4 more