default search action
Jonathan D. Hogg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j16]Iain S. Duff, Jonathan D. Hogg, Florent Lopez
:
A New Sparse LDLT Solver Using A Posteriori Threshold Pivoting. SIAM J. Sci. Comput. 42(2): C23-C42 (2020)
2010 – 2019
- 2019
- [j15]James L. Hook, Jennifer Pestana
Max-Balanced Hungarian Scalings. SIAM J. Matrix Anal. Appl. 40(1): 320-346 (2019) - 2018
- [j14]James L. Hook, Jennifer A. Scott
A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners. SIAM J. Sci. Comput. 40(4): A1987-A2004 (2018) - 2017
- [j13]Weifeng Liu
Fast synchronization-free algorithms for parallel sparse triangular solves with multiple right-hand sides. Concurr. Comput. Pract. Exp. 29(21) (2017) - [j12]Jonathan D. Hogg, Jennifer A. Scott
Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems. ACM Trans. Math. Softw. 44(2): 13:1-13:22 (2017) - 2016
- [j11]Jonathan D. Hogg
A Sparse Symmetric Indefinite Direct Solver for GPU Architectures. ACM Trans. Math. Softw. 42(1): 1:1-1:25 (2016) - [c1]Weifeng Liu
A Synchronization-Free Algorithm for Parallel Sparse Triangular Solves. Euro-Par 2016: 617-630 - 2015
- [j10]Jonathan D. Hogg
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices. Numer. Linear Algebra Appl. 22(4): 648-663 (2015) - 2014
- [j9]Jonathan D. Hogg
Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems. SIAM J. Matrix Anal. Appl. 35(2): 783-817 (2014) - 2013
- [j8]Jonathan D. Hogg
New Parallel Sparse Direct Solvers for Multicore Architectures. Algorithms 6(4): 702-725 (2013) - [j7]Jonathan D. Hogg
An efficient analyse phase for element problems. Numer. Linear Algebra Appl. 20(3): 397-412 (2013) - [j6]Jonathan D. Hogg
Optimal Weighted Matchings for Rank-Deficient Sparse Matrices. SIAM J. Matrix Anal. Appl. 34(4): 1431-1447 (2013) - [j5]Jonathan D. Hogg
A Fast Dense Triangular Solve in CUDA. SIAM J. Sci. Comput. 35(3) (2013) - [j4]Jonathan D. Hogg
Pivoting strategies for tough sparse indefinite systems. ACM Trans. Math. Softw. 40(1): 4:1-4:19 (2013) - [i2]Jonathan D. Hogg, Jennifer A. Scott:
On the effects of scaling on the performance of Ipopt. CoRR abs/1301.7283 (2013) - [i1]Jonathan D. Hogg, Jennifer A. Scott:
Compressed threshold pivoting for sparse symmetric indefinite systems. CoRR abs/1305.2353 (2013) - 2010
- [j3]Jonathan D. Hogg
Design of a Multicore Sparse Cholesky Factorization Using DAGs. SIAM J. Sci. Comput. 32(6): 3627-3649 (2010) - [j2]Jonathan D. Hogg
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems. ACM Trans. Math. Softw. 37(2): 17:1-17:24 (2010)
2000 – 2009
- 2009
- [j1]Marco Colombo
A structure-conveying modelling language for mathematical and stochastic programming. Math. Program. Comput. 1(4): 223-247 (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-08-05 20:17 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: