Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy A. Davis 0001
Person information
- affiliation: Texas A&M University, TX, USA
- affiliation (1990 - 2014): University of Florida, FL, USA
- affiliation (PhD 1989): University of Illinois at Urbana-Champaign, IL, USA
Other persons with the same name
- Timothy A. Davis 0002 — Clemson University, Department of Psychology, SC, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
[b3]Timothy A. Davis:
Direct methods for sparse linear systems. Fundamentals of algorithms 2, SIAM 2006, ISBN 978-0-89871-613-9, pp. I-XII, 1-217- 2005
- [b2]Timothy A. Davis, Kermit Sigmon:
MATLAB primer, 7th Edition. Chapman & Hall 2005, ISBN 978-1-58488-523-8, pp. I-XII, 1-215 - 1989
- [b1]Timothy A. Davis:
A parallel algorithm for sparse unsymmetric LU factorization. University of Illinois Urbana-Champaign, USA, 1989
Journal Articles
- 2023
- [j40]Timothy A. Davis
:
Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra. ACM Trans. Math. Softw. 49(3): 28:1-28:30 (2023) - 2022
- [j39]Christopher J. Lourenco, Jinhao Chen, Erick Moreno-Centeno, Timothy A. Davis:
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization. ACM Trans. Math. Softw. 48(2): 20:1-20:23 (2022) - 2020
- [j38]Timothy A. Davis, Iain S. Duff, Stojce Nakov:
Design and Implementation of a Parallel Markowitz Threshold Algorithm. SIAM J. Matrix Anal. Appl. 41(2): 573-590 (2020) - [j37]Timothy A. Davis, William W. Hager, Scott P. Kolodziej, Sencer Nuri Yeralan:
Algorithm 1003: Mongoose, a Graph Coarsening and Partitioning Library. ACM Trans. Math. Softw. 46(1): 7:1-7:18 (2020) - 2019
- [j36]Scott P. Kolodziej, Mohsen Aznaveh, Matthew Bullock, Jarrett David, Timothy A. Davis, Matthew Henderson, Yifan Hu, Read Sandström:
The SuiteSparse Matrix Collection Website Interface. J. Open Source Softw. 4(35): 1244 (2019) - [j35]Christopher J. Lourenco, Adolfo R. Escobedo, Erick Moreno-Centeno, Timothy A. Davis:
Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work. SIAM J. Matrix Anal. Appl. 40(2): 609-638 (2019) - [j34]Timothy A. Davis:
Algorithm 1000: SuiteSparse: GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra. ACM Trans. Math. Softw. 45(4): 44:1-44:25 (2019) - 2018
- [j33]Meng Tang, Mohamed Gadou, Steven C. Rennich, Timothy A. Davis, Sanjay Ranka:
Optimized sparse Cholesky factorization on hybrid multicore architectures. J. Comput. Sci. 26: 246-253 (2018) - 2017
- [j32]Philipp Herholz, Timothy A. Davis, Marc Alexa:
Localized solutions of sparse linear systems for geometry processing. ACM Trans. Graph. 36(6): 183:1-183:8 (2017) - [j31]Sencer Nuri Yeralan, Timothy A. Davis, Wissam M. Sid-Lakhdar, Sanjay Ranka:
Algorithm 980: Sparse QR Factorization on the GPU. ACM Trans. Math. Softw. 44(2): 17:1-17:29 (2017) - 2016
- [j30]Timothy A. Davis, Sivasankaran Rajamanickam, Wissam M. Sid-Lakhdar:
A survey of direct methods for sparse linear systems. Acta Numer. 25: 383-566 (2016) - [j29]Begüm Senses Cannataro, Anil V. Rao, Timothy A. Davis:
State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control. Comput. Optim. Appl. 64(3): 793-819 (2016) - [j28]Steven C. Rennich, Darko Stosic, Timothy A. Davis:
Accelerating sparse Cholesky factorization on GPUs. Parallel Comput. 59: 140-150 (2016) - [j27]Timothy A. Davis, William W. Hager, James T. Hungerford:
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem. ACM Trans. Math. Softw. 42(3): 22:1-22:25 (2016) - 2013
- [j26]Timothy A. Davis:
Algorithm 930: FACTORIZE: An object-oriented linear system solver for MATLAB. ACM Trans. Math. Softw. 39(4): 28:1-28:18 (2013) - [j25]Leslie V. Foster, Timothy A. Davis:
Algorithm 933: Reliable calculation of numerical rank, null space bases, pseudoinverse solutions, and basic solutions using suitesparseQR. ACM Trans. Math. Softw. 40(1): 7:1-7:23 (2013) - 2011
- [j24]Timothy A. Davis, Yifan Hu:
The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1): 1:1-1:25 (2011) - [j23]Timothy A. Davis:
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization. ACM Trans. Math. Softw. 38(1): 8:1-8:22 (2011) - 2010
- [j22]Laura Grigori, Erik G. Boman, Simplice Donfack, Timothy A. Davis:
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization. SIAM J. Sci. Comput. 32(6): 3426-3446 (2010) - [j21]Timothy A. Davis, Ekanathan Palamadai Natarajan:
Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems. ACM Trans. Math. Softw. 37(3): 36:1-36:17 (2010) - 2009
- [j20]Timothy A. Davis, William W. Hager:
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves. ACM Trans. Math. Softw. 35(4): 27:1-27:23 (2009) - 2008
- [j19]Timothy A. Davis, William W. Hager:
A sparse proximal implementation of the LP dual active set algorithm. Math. Program. 112(2): 275-301 (2008) - [j18]Timothy A. Davis, William W. Hager:
Dual multilevel optimization. Math. Program. 112(2): 403-425 (2008) - [j17]Yanqing Chen, Timothy A. Davis, William W. Hager, Sivasankaran Rajamanickam:
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. ACM Trans. Math. Softw. 35(3): 22:1-22:14 (2008) - 2005
- [j16]Timothy A. Davis, William W. Hager:
Row Modifications of a Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 26(3): 621-639 (2005) - [j15]Paul A. Fishwick, Timothy A. Davis, Jane Douglas:
Model representation with aesthetic computing: Method and empirical study. ACM Trans. Model. Comput. Simul. 15(3): 254-279 (2005) - [j14]Timothy A. Davis:
Algorithm 849: A concise sparse cholesky factorization package. ACM Trans. Math. Softw. 31(4): 587-591 (2005) - 2004
- [j13]Timothy A. Davis:
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30(2): 165-195 (2004) - [j12]Timothy A. Davis:
Algorithm 832: UMFPACK V4.3 - an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30(2): 196-199 (2004) - [j11]Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3): 353-376 (2004) - [j10]Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3): 377-380 (2004) - [j9]Patrick Amestoy, Enseeiht-Irit, Timothy A. Davis, Iain S. Duff:
Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3): 381-388 (2004) - 2001
- [j8]Timothy A. Davis, William W. Hager:
Multiple-Rank Modifications of a Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 22(4): 997-1013 (2001) - 1999
- [j7]Timothy A. Davis, William W. Hager:
Modifying a Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 20(3): 606-627 (1999) - [j6]Timothy A. Davis, Iain S. Duff:
A combined unifrontal/multifrontal method for unsymmetric sparse matrices. ACM Trans. Math. Softw. 25(1): 1-20 (1999) - 1997
- [j5]Timothy A. Davis, Iain S. Duff:
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization. SIAM J. Matrix Anal. Appl. 18(1): 140-158 (1997) - 1996
- [j4]Theodore Johnson, Timothy A. Davis, Steven M. Hadfield:
A Concurrent Dynamic Task Graph. Parallel Comput. 22(2): 327-333 (1996) - [j3]Patrick R. Amestoy, Timothy A. Davis, Iain S. Duff:
An Approximate Minimum Degree Ordering Algorithm. SIAM J. Matrix Anal. Appl. 17(4): 886-905 (1996) - 1992
- [j2]Theodore Johnson, Timothy A. Davis:
Parallel Buddy Memory Management. Parallel Process. Lett. 2: 391-398 (1992) - 1988
- [j1]Timothy A. Davis, Edward S. Davidson:
Pairwise Reduction for the Direct, Parallel Solution of Sparse, Unsymmetric Sets of Linear Equations. IEEE Trans. Computers 37(12): 1648-1654 (1988)
Conference and Workshop Papers
- 2023
- [c21]Wissam M. Sid-Lakhdar, Sébastien Cayrols, Daniel Bielich, Ahmad Abdelfattah, Piotr Luszczek, Mark Gates, Stanimire Tomov, Hans Johansen, David B. Williams-Young, Timothy A. Davis, Jack J. Dongarra, Hartwig Anzt:
PAQR: Pivoting Avoiding QR factorization. IPDPS 2023: 322-332 - 2021
- [c20]Michel Pelletier, Will Kimmerer, Timothy A. Davis, Timothy G. Mattson:
The GraphBLAS in Julia and Python: the PageRank and Triangle Centralities. HPEC 2021: 1-7 - [c19]Gábor Szárnyas, David A. Bader, Timothy A. Davis, James Kitchen, Timothy G. Mattson, Scott McMillan, Erik Welch:
LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms. IPDPS Workshops 2021: 243-252 - [c18]Bethany Witemeyer, Nicholas J. Weidner, Timothy A. Davis, Theodore Kim, Shinjiro Sueda:
QLB: Collision-Aware Quasi-Newton Solver with Cholesky and L-BFGS for Nonlinear Time Integration. MIG 2021: 14:1-14:7 - [c17]Jinhao Chen, Timothy A. Davis, Christopher J. Lourenco, Erick Moreno-Centeno:
Sparse Exact Factorization Update. IA3@SC 2021: 35-42 - 2020
- [c16]Márton Elekes, Attila Nagy, Dávid Sándor, János Benjamin Antal, Timothy A. Davis, Gábor Szárnyas:
A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS. HPEC 2020: 1-7 - [c15]Ariful Azad, Mohsen Mahmoudi Aznaveh, Scott Beamer, Mark P. Blanco, Jinhao Chen, Luke D'Alessandro, Roshan Dathathri, Timothy A. Davis, Kevin Deweese, Jesun Firoz, Henry A. Gabb, Gurbinder Gill, Bálint Hegyi, Scott P. Kolodziej, Tze Meng Low, Andrew Lumsdaine, Tugsbayasgalan Manlaibaatar, Timothy G. Mattson, Scott McMillan, Ramesh Peri, Keshav Pingali, Upasana Sridhar, Gábor Szárnyas, Yunming Zhang, Yongzhe Zhang:
Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite. IISWC 2020: 216-227 - [c14]Scott P. Kolodziej, Timothy A. Davis:
Generalized Gains for Hybrid Vertex Separator Algorithms. CSC 2020: 96-105 - [c13]Mohsen Aznaveh, Jinhao Chen, Timothy A. Davis, Bálint Hegyi, Scott P. Kolodziej, Timothy G. Mattson, Gábor Szárnyas:
Parallel GraphBLAS with OpenMP. CSC 2020: 138-148 - 2019
- [c12]Timothy A. Davis, Mohsen Aznaveh, Scott P. Kolodziej:
Write Quick, Run Fast: Sparse Deep Neural Network in 20 Minutes of Development Time via SuiteSparse: GraphBLAS. HPEC 2019: 1-6 - [c11]Tim Mattson, Timothy A. Davis, Manoj Kumar, Aydin Buluç, Scott McMillan, José E. Moreira, Carl Yang:
LAGraph: A Community Effort to Collect Graph Algorithms Built on Top of the GraphBLAS. IPDPS Workshops 2019: 276-284 - [c10]Chieh Chou, Di Wang, Dezhen Song, Timothy A. Davis:
On the Tunable Sparse Graph Solver for Pose Graph Optimization in Visual SLAM Problems. IROS 2019: 1300-1306 - 2018
- [c9]Timothy A. Davis:
Graph algorithms via SuiteSparse: GraphBLAS: triangle counting and K-truss. HPEC 2018: 1-6 - [c8]Meng Tang, Mohamed Gadou, Steven C. Rennich, Timothy A. Davis, Sanjay Ranka:
A Multilevel Subtree Method for Single and Batched Sparse Cholesky Factorization. ICPP 2018: 50:1-50:10 - 2014
- [c7]Steven C. Rennich, Darko Stosic, Timothy A. Davis:
Accelerating sparse cholesky factorization on GPUs. IA3@SC 2014: 9-16 - 2000
- [c6]Sartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka:
Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. IPDPS Workshops 2000: 423-426 - 1995
- [c5]Steven M. Hadfield, Timothy A. Davis:
A Distributed Memory, Multifrontal Method for Sequences of Unsymmetric Pattern Matrices. ICPP (3) 1995: 42-45 - [c4]Tariq Rashid, Timothy A. Davis:
An Approach for Parallelizing any General Unsymmetric Sparse Matrix Algorithm. PPSC 1995: 413-417 - 1992
- [c3]Theodore Johnson, Timothy A. Davis:
Space Efficient Parallel Buddy Memory Management. ICCI 1992: 128-132 - 1988
- [c2]Santosh G. Abraham, Timothy A. Davis:
Blocking for Parallel Sparse Linear System Solvers. ICPP (1) 1988: 166-173 - 1987
- [c1]Timothy A. Davis, Edward S. Davidson:
PSOLVE : A Concurrent Algorithm for Solving Sparse Systems of Linear Equations. ICPP 1987: 483-490
Informal and Other Publications
- 2021
- [i2]Gábor Szárnyas, David A. Bader, Timothy A. Davis, James Kitchen, Timothy G. Mattson, Scott McMillan, Erik Welch:
LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms. CoRR abs/2104.01661 (2021) - 2009
- [i1]Timothy A. Davis:
Multifrontral multithreaded rank-revealing sparse QR factorization. Combinatorial Scientific Computing 2009
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
