2010 - SIAM Fellow For contributions to the development and analysis of algorithms for sparse matrix problems.
1938 - Fellow of the American Association for the Advancement of Science (AAAS)
John R. Gilbert mainly investigates Sparse matrix, Algorithm, Parallel computing, Pivot element and Gaussian elimination. His Sparse matrix research is multidisciplinary, incorporating elements of Numerical linear algebra, Data structure and Speedup. His study in Parallel algorithm and Computation is done as part of Algorithm.
He interconnects Multiplication, Array data structure and Fortran in the investigation of issues within Parallel computing. The various areas that he examines in his Pivot element study include Factorization and Incomplete LU factorization. John R. Gilbert studied Incomplete LU factorization and Incomplete Cholesky factorization that intersect with Combinatorics.
His primary areas of investigation include Sparse matrix, Theoretical computer science, Parallel computing, Algorithm and Discrete mathematics. His Sparse matrix study is related to the wider topic of Matrix. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Graph, Graph, Power graph analysis, Graph operations and Graph theory.
John R. Gilbert has researched Parallel computing in several fields, including Multiplication, Correctness, Data structure and Fortran. His work in Algorithm addresses subjects such as Incomplete LU factorization, which are connected to disciplines such as LU decomposition. His Discrete mathematics study incorporates themes from Approximation algorithm and Combinatorics.
John R. Gilbert mostly deals with Theoretical computer science, Graph, Graph, Algorithm and Power graph analysis. His Theoretical computer science research is multidisciplinary, relying on both Graph theory and Graph operations. His Graph research focuses on Data structure and how it relates to Path and Mathematical optimization.
His biological study spans a wide range of topics, including Cycle basis and Enumeration. In his study, Approximation algorithm is inextricably linked to Discrete mathematics, which falls within the broad field of Combinatorics. When carried out as part of a general Matrix research project, his work on Sparse matrix is frequently linked to work in Programming complexity, therefore connecting diverse disciplines of study.
His primary scientific interests are in Theoretical computer science, Matrix, Graph operations, Matrix multiplication and Adjacency matrix. His research in Theoretical computer science intersects with topics in Algorithm and Graph, Graph rewriting. The concepts of his Algorithm study are interwoven with issues in Query language and Data mining.
His Matrix multiplication research incorporates themes from Semiring, Enumeration, Graph energy, Sparse matrix and Adjacency list. His Sparse matrix study combines topics from a wide range of disciplines, such as Overhead, Composability, Approximation algorithm, Range and Parallel algorithm. His Adjacency matrix research is within the category of Discrete mathematics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A Supernodal Approach to Sparse Partial Pivoting
James W. Demmel;Stanley C. Eisenstat;John R. Gilbert;Xiaoye S. Li.
SIAM Journal on Matrix Analysis and Applications (1999)
A Supernodal Approach to Sparse Partial Pivoting
James W. Demmel;Stanley C. Eisenstat;John R. Gilbert;Xiaoye S. Li.
SIAM Journal on Matrix Analysis and Applications (1999)
Sparse matrices in matlab: design and implementation
John R. Gilbert;Cleve Moler;Robert Schreiber.
SIAM Journal on Matrix Analysis and Applications (1992)
Sparse matrices in matlab: design and implementation
John R. Gilbert;Cleve Moler;Robert Schreiber.
SIAM Journal on Matrix Analysis and Applications (1992)
Provably good mesh generation
M. Bern;D. Eppstein;J. Gilbert.
foundations of computer science (1990)
Provably good mesh generation
M. Bern;D. Eppstein;J. Gilbert.
foundations of computer science (1990)
The Combinatorial BLAS: design, implementation, and applications
Aydın Buluç;John R Gilbert.
ieee international conference on high performance computing data and analytics (2011)
The Combinatorial BLAS: design, implementation, and applications
Aydın Buluç;John R Gilbert.
ieee international conference on high performance computing data and analytics (2011)
Graph Algorithms in the Language of Linear Algebra
Jeremy Kepner;John Gilbert.
(2011)
Graph Algorithms in the Language of Linear Algebra
Jeremy Kepner;John Gilbert.
(2011)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Lawrence Berkeley National Laboratory
Cerebras Systems
University of Southern California
Lawrence Berkeley National Laboratory
MIT
New Jersey Institute of Technology
University of California, Berkeley
Carnegie Mellon University
Princeton University
Tel Aviv University
University of Erlangen-Nuremberg
Korea Advanced Institute of Science and Technology
University of Melbourne
University of Manchester
National Autonomous University of Mexico
Ben-Gurion University of the Negev
Université Paris Cité
RWTH Aachen University
Oak Ridge National Laboratory
CSIRO Marine and Atmospheric Research
Inserm : Institut national de la santé et de la recherche médicale
University of Alberta
National Institutes of Health
National and Kapodistrian University of Athens
Sapienza University of Rome
The University of Texas Southwestern Medical Center