|
|
eCommons@Cornell >
Browsing by Author Gilbert, John R.
Showing results 1 to 13 of 13
| Preview | Issue Date | Title | Author(s) | | Jan-1986 | Computing a Sparse Basis for the Null Space | Gilbert, John R.; Heath, Michael T. |
| Feb-1983 | Graph Coloring Using Eigenvalue Decomposition | Aspvall, Bengt; Gilbert, John R. |
| Oct-1986 | A Parallel Algorithm for Finding Fill in a Sparse Symmetric Matrix | Gilbert, John R.; Hafsteinsson, Hjalmtyr |
| Feb-1986 | A Parallel Algorithm for Large Sparse Cholesky Factorization on a Multiprocessor | Zmijewski, Earl; Gilbert, John R. |
| Dec-1987 | Parallel Cholesky Factorization of Sparse Matrices | Gilbert, John R.; Hafsteinsson, Hjalmtyr |
| Jan-1987 | A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor | Gilbert, John R.; Zmijewski, Earl |
| Oct-1983 | Predicting Fill for Sparse Orthogonal Factorization | Coleman, Thomas F.; Edenbrandt, Anders; Gilbert, John R. |
| May-1986 | Predicting Structure in Sparse Matrix Computations | Gilbert, John R. |
| Oct-1982 | A Separator Theorem for Chordal Graphs | Gilbert, John R.; Rose, Donald J. |
| Jul-1982 | A Separator Theorem for Graphs of Bounded Genus | Gilbert, John R.; Hutchinson, Joan P.; Tarjan, Robert Endre |
| Aug-1986 | Some Nested Dissection Order is Nearly Optimal | Gilbert, John R. |
| Sep-1986 | Sparse Partial Pivoting in Time Proportional to Arithmetic Operations | Gilbert, John R.; Peierls, Timothy |
| Apr-1985 | Wide Quotient Trees for Finite Element Problems | Zmijewski, Earl; Gilbert, John R. |
Showing results 1 to 13 of 13
|