2026 Michael A. Saunders: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	61	490	412	253	198	169	57325
Engineering and Technology	62	1837	1751	589	534	179	60894

Research.com Recognitions

2013 - SIAM Fellow For contributions to numerical optimization, linear algebra, and software.

Overview

Michael A. Saunders is affiliated with Stanford University in the United States. Their research spans multiple fields, predominantly in computer science, mathematics, and engineering.

The main areas of study for Saunders include:

Computer Science
Mathematics
Engineering

Within these fields, their subfields of specialization cover:

Computational Theory and Mathematics
Numerical Analysis
Computational Mechanics
Control and Systems Engineering
Atomic and Molecular Physics, and Optics

The scientist's work concentrates on several topics, including:

Matrix Theory and Algorithms
Advanced Optimization Algorithms Research
Numerical methods for differential equations
Advanced Numerical Methods in Computational Mathematics
Numerical Methods and Algorithms
Electromagnetic Scattering and Analysis
Advanced Control Systems Optimization

Michael A. Saunders has contributed to a variety of recent papers. Some examples include:

"Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers," 2021, Parallel Computing
"HyKKT: a hybrid direct-iterative method for solving KKT linear systems," 2022, Optimization methods & software
"Mechanistic model-driven exometabolomic characterisation of human dopaminergic neuronal metabolism," 2021, bioRxiv (Cold Spring Harbor Laboratory)
"Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization," 2020, SIAM Journal on Scientific Computing
"Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation," 2022, SIAM Journal on Scientific Computing

Frequently cited co-authors include:

Dominique Orban
Kasia Świrydowicz
Shaked Regev
Slaven Peleš
Johannes J. Brust

Michael A. Saunders regularly publishes in venues such as:

arXiv (Cornell University)
SIAM Journal on Scientific Computing
Optimization methods & software
Parallel Computing
bioRxiv (Cold Spring Harbor Laboratory)

They have been recognized as a SIAM Fellow in 2013 for contributions to numerical optimization, linear algebra, and software.

Best Publications

Atomic Decomposition by Basis Pursuit

Scott Shaobing Chen;David L. Donoho;Michael A. Saunders

14273
Citations
Atomic Decomposition by Basis Pursuit

Scott Shaobing Chen;David L. Donoho;Michael A. Saunders

10776
Citations
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

Christopher C. Paige;Michael A. Saunders

5639
Citations
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

Philip E. Gill;Walter Murray;Michael A. Saunders

5084
Citations
Sparsity and smoothness via the fused lasso

Robert Tibshirani;Michael D Saunders;Saharon Rosset;Ji Zhu

3399
Citations
Solution of Sparse Indefinite Systems of Linear Equations

C. C. Paige;M. A. Saunders

2495
Citations
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

Philip E. Gill;Walter Murray;Michael A. Saunders

2103
Citations
MINOS 5.0 User's Guide.

B A Murtagh;M A Saunders

2083
Citations
Creation and analysis of biochemical constraint-based models using the COBRA Toolbox v.3.0

Laurent Heirendt;Sylvain Arreckx;Thomas Pfau;Sebastián N. Mendoza

1310
Citations
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems

Christopher C. Paige;Michael A. Saunders

969
Citations
Methods for modifying matrix factorizations.

Phillip E. Gill;Gene H. Golub;Walter A. Murray;Michael A. Saunders

849
Citations
Towards a Generalized Singular Value Decomposition

C. C. Paige;M. A. Saunders

791
Citations
Large-scale linearly constrained optimization

B. A. Murtagh;M. A. Saunders

766
Citations
On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method

Philip E. Gill;Walter Murray;Michael A. Saunders;J. A. Tomlin

663
Citations
User's Guide for NPSOL (Version 4.0): A Fortran Package for Nonlinear Programming.

Philip E Gill;Walter Murray;Michael A Saunders;Margaret H Wright

593
Citations
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems

David Chin-Lung Fong;Michael Saunders

535
Citations
A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints

Bruce A. Murtagh;Michael A. Saunders

431
Citations
Aquifer Reclamation Design: The Use of Contaminant Transport Simulation Combined With Nonlinear Programing

Steven M. Gorelick;Clifford I. Voss;Philip E. Gill;Walter Murray

380
Citations
User's Guide for SOL/NPSOL: A Fortran Package for Nonlinear Programming.

Philip E Gill;Walter Murray;Michael A Saunders;Margaret H Wright

370
Citations
Procedures for optimization problems with a mixture of bounds and general linear constraints

Philip E. Gill;Walter Murray;Michael A. Saunders;Margaret H. Wright

363
Citations
A two-step discrete method for reconstruction of temperature distribution in a three-dimensional participating medium

Qun-xing Huang;Fei Wang;Jian-hua Yan;Yong Chi

5
Citations

Frequent Co-Authors

Philip E. Gill University of California, San Diego

Walter Murray Stanford University

Margaret H. Wright New York University

Bernhard O. Palsson University of California, San Diego

Ronan M. T. Fleming Leiden University

Ines Thiele University of Galway

Jason D. Lee Princeton University

Christopher C. Paige McGill University

Yinyu Ye Stanford University

Michael W. Mahoney University of California, Berkeley

External Links

Wikipedia of Michael A. Saunders Personal website of Michael A. Saunders Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students interested in expanding their mathematical skillset into business or management, pursuing an online MBA can be a strategic choice. Many programs offer accelerated options, and finding the fastest mba online programs allows learners to quickly build leadership and analytical skills relevant to data-driven decision-making.

Marketing is another field where strong quantitative skills are invaluable. A masters in marketing can provide a competitive advantage by combining math-based analytics with creative strategy, all while considering affordability and return on investment.

For those seeking intensive, focused credentials, 1 year mba programs offer a condensed timeline. These programs are suitable for students eager to quickly leverage their math expertise into managerial roles without long breaks in their career trajectory.

Additionally, many top programs facilitate credit mobility. Exploring online MBA programs that accept transfer credits can save both time and money. Resources on transfer credits for online mba programs help students understand how previously earned coursework can accelerate degree completion.