default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. T. Kelley
Person information
- affiliation: North Carolina State University, Raleigh, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]Joanna Piper Morgan
, Ilham Variansyah, Samuel L. Pasmann, Kayla B. Clements, Braxton Cuneo, Alexander Mote, Charles Goodman, Caleb Shaw, Jordan Northrop, Rohan Pankaj, Ethan Lame, Benjamin Whewell, Ryan G. McClarren, Todd S. Palmer, Lizhong Chen, Dmitriy Y. Anistratov, C. T. Kelley, Camille J. Palmer, Kyle E. Niemeyer:
Monte Carlo / Dynamic Code (MC/DC): An accelerated Python package for fully transient neutron transport and rapid methods development. J. Open Source Softw. 9(96): 6415 (2024)- [j46]C. T. Kelley:
MultiPrecisionArrays.jl: A Julia package for iterative refinement. J. Open Source Softw. 9(101): 6698 (2024) - [i5]C. T. Kelley:
Interprecision transfers in iterative refinement. CoRR abs/2407.00827 (2024) - 2023
- [i4]C. T. Kelley:
Newton's Method in Three Precisions. CoRR abs/2307.16051 (2023) - [i3]C. T. Kelley:
Using MultiPrecisonArrays.jl: Iterative Refinement in Julia. CoRR abs/2311.14616 (2023) - 2022
- [j45]C. T. Kelley:
Newton's Method in Mixed Precision. SIAM Rev. 64(1): 191-211 (2022) - 2021
- [j44]Wei Bian, Xiaojun Chen, C. T. Kelley:
Anderson Acceleration for a Class of Nonsmooth Fixed-Point Problems. SIAM J. Sci. Comput. 43(5): S1-S20 (2021) - [i2]Sreeram Venkat, Ralph C. Smith, Carl T. Kelley:
Convolutional Autoencoders for Reduced-Order Modeling. CoRR abs/2108.12453 (2021) - 2020
- [j43]C. T. Kelley, Jerry Bernholc, E. L. Briggs, Steven P. Hamilton, Lin Lin, Chao Yang:
Mesh independence of the generalized Davidson algorithm. J. Comput. Phys. 409: 109322 (2020)
2010 – 2019
- 2019
- [j42]J. Austin Ellis, Thomas M. Evans, Steven P. Hamilton, C. T. Kelley, Tara M. Pandya:
Optimization of processor allocation for domain decomposed Monte Carlo calculations. Parallel Comput. 87: 77-86 (2019) - [j41]Xiaojun Chen, C. T. Kelley:
Convergence of the EDIIS Algorithm for Nonlinear Equations. SIAM J. Sci. Comput. 41(1): A365-A379 (2019) - [c3]Zhao Wang, Aranya Chakrabortty, C. T. Kelley, Xiaoming Feng, Paul D. Franzon:
Improved Numerical Methodologies on Power System Dynamic Simulation Using GPU Implementation. ISGT 2019: 1-5 - 2018
- [j40]C. T. Kelley:
Numerical methods for nonlinear equations. Acta Numer. 27: 207-287 (2018) - [j39]Xiaojun Chen, C. T. Kelley, Fengmin Xu, Zaikun Zhang:
A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization. SIAM J. Sci. Comput. 40(4): A2174-A2199 (2018) - 2017
- [j38]Alex Toth, J. Austin Ellis, Thomas M. Evans, Steven P. Hamilton, C. T. Kelley, Roger P. Pawlowski, Stuart R. Slattery:
Local Improvement Results for Anderson Acceleration with Inaccurate Function Evaluations. SIAM J. Sci. Comput. 39(5) (2017) - 2016
- [j37]Steven P. Hamilton, Mark A. Berrill, Kevin T. Clarno, Roger P. Pawlowski, Alex Toth, C. T. Kelley, Thomas M. Evans, Bobby Philip:
An assessment of coupling algorithms for nuclear reactor core physics simulations. J. Comput. Phys. 311: 241-257 (2016) - [j36]Eric J. Wyers, Matthew A. Morton, T. C. L. Gerhard Sollner, C. T. Kelley, Paul D. Franzon:
A Generally Applicable Calibration Algorithm for Digitally Reconfigurable Self-Healing RFICs. IEEE Trans. Very Large Scale Integr. Syst. 24(3): 1151-1164 (2016) - 2015
- [j35]Alex Toth, C. T. Kelley:
Convergence Analysis for Anderson Acceleration. SIAM J. Numer. Anal. 53(2): 805-819 (2015) - [j34]Jeffrey Willert, Xiaojun Chen, C. T. Kelley:
Newton's Method for Monte Carlo-Based Residuals. SIAM J. Numer. Anal. 53(4): 1738-1757 (2015) - [j33]James Nance, C. T. Kelley:
A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry. SIAM J. Sci. Comput. 37(5) (2015) - 2014
- [j32]David Mokrauer, C. T. Kelley:
Sparse interpolatory reduced-order models for simulation of light-induced molecular transformations. Optim. Methods Softw. 29(2): 264-273 (2014) - 2013
- [j31]Jeffrey Willert, C. T. Kelley, Dana A. Knoll, HyeongKae Park:
Hybrid Deterministic/Monte Carlo Neutronics. SIAM J. Sci. Comput. 35(5) (2013) - [j30]Eric J. Wyers, Michael B. Steer, C. T. Kelley, Paul D. Franzon:
A Bounded and Discretized Nelder-Mead Algorithm Suitable for RFIC Calibration. IEEE Trans. Circuits Syst. I Regul. Pap. 60-I(7): 1787-1799 (2013) - [c2]A. S. Costolanski, Carl T. Kelley, G. W. Howell, Andrew G. Salinger:
An efficient parallel solution to the Wigner-Poisson equations. SpringSim (HPC) 2013: 12 - 2011
- [j29]Ilse C. F. Ipsen, C. T. Kelley, S. R. Pope:
Rank-Deficient Nonlinear Least Squares Problems and Subset Selection. SIAM J. Numer. Anal. 49(3): 1244-1266 (2011)
2000 – 2009
- 2009
- [r1]C. T. Kelley:
Contraction-Mapping. Encyclopedia of Optimization 2009: 505-509 - 2008
- [j28]C. T. Kelley, Li-Zhi Liao, Liqun Qi, Moody T. Chu, Jill P. Reese, C. Winton:
Projected Pseudotransient Continuation. SIAM J. Numer. Anal. 46(6): 3071-3083 (2008) - 2007
- [j27]K. I. Dickson, C. T. Kelley, Ilse C. F. Ipsen, Ioannis G. Kevrekidis:
Condition Estimates for Pseudo-Arclength Continuation. SIAM J. Numer. Anal. 45(1): 263-276 (2007) - 2006
- [j26]Matthew S. Lasater, Carl T. Kelley, Andrew G. Salinger, Dwight L. Woolard, Peiji Zhao:
Parallel parameter study of the Wigner-Poisson equations for RTDs. Comput. Math. Appl. 51(11): 1677-1688 (2006) - [j25]Daniel E. Finkel, C. T. Kelley:
Additive Scaling and the DIRECT Algorithm. J. Glob. Optim. 36(4): 597-608 (2006) - 2005
- [j24]Kathleen R. Fowler, C. T. Kelley:
Pseudo-Transient Continuation for Nonsmooth Nonlinear Equations. SIAM J. Numer. Anal. 43(4): 1385-1406 (2005) - 2003
- [b2]Carl T. Kelley:
Solving nonlinear equations with Newton's method - fundamentals of algorithms. SIAM 2003, ISBN 978-0-89871-546-0, pp. I-XIII, 1-104 - [j23]Todd S. Coffey, C. T. Kelley, David E. Keyes:
Pseudotransient Continuation and Differential-Algebraic Equations. SIAM J. Sci. Comput. 25(2): 553-569 (2003) - 2001
- [j22]Joerg M. Gablonsky, Carl T. Kelley:
A Locally-Biased form of the DIRECT Algorithm. J. Glob. Optim. 21(1): 27-37 (2001) - [j21]C. T. Kelley, Kristy A. Coffey, Pierre-Alain Gremaud, T. A. Royal:
On a Powder Consolidation Problem. SIAM J. Appl. Math. 62(1): 1-20 (2001) - [j20]Eleanor W. Jenkins, Christopher E. Kees, Carl T. Kelley, Cass T. Miller:
An Aggregation-Based Domain Decomposition Preconditioner for Groundwater Flow. SIAM J. Sci. Comput. 23(2): 430-441 (2001) - [c1]C. T. Kelley:
Implicit Filtering and Nonlinear Least Squares Problems. System Modelling and Optimization 2001: 71-90 - 2000
- [j19]T. D. Choi, C. T. Kelley:
Superlinear Convergence and Implicit Filtering. SIAM J. Optim. 10(4): 1149-1162 (2000) - [j18]William R. Ferng, Carl T. Kelley:
Mesh Independence of Matrix-Free Methods for Path Following. SIAM J. Sci. Comput. 21(5): 1835-1850 (2000)
1990 – 1999
- 1999
- [b1]Carl T. Kelley:
Iterative methods for optimization. Frontiers in applied mathematics, SIAM 1999, ISBN 978-0-89871-433-3, pp. I-XIV, 1-180 - [j17]T. D. Choi, Carl T. Kelley:
Estimates for the Nash-Sofer Preconditioner for the Reduced Hessian for Some Elliptic Variational Inequalities. SIAM J. Optim. 9(2): 327-341 (1999) - [j16]Carl T. Kelley, Ekkehard W. Sachs:
A Trust Region Method for Parabolic Boundary Control Problems. SIAM J. Optim. 9(4): 1064-1081 (1999) - [j15]C. T. Kelley:
Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition. SIAM J. Optim. 10(1): 43-55 (1999) - [j14]James M. Banoczi, Carl T. Kelley:
A Fast Multilevel Algorithm for the Solution of Nonlinear Systems of Conductive-Radiative Heat Transfer Equations in Two Space Dimensions. SIAM J. Sci. Comput. 20(4): 1214-1228 (1999) - 1998
- [j13]C. T. Kelley, Ekkehard W. Sachs:
Local Convergence of the Symmetric Rank-One Iteration. Comput. Optim. Appl. 9(1): 43-63 (1998) - [j12]James M. Banoczi, Carl T. Kelley:
A Fast Multilevel Algorithm for the Solution of Nonlinear Systems of Conductive-Radiative Heat Transfer Equations. SIAM J. Sci. Comput. 19(1): 266-279 (1998) - [j11]Carl T. Kelley, Cass T. Miller, Michael D. Tocci:
Termination of Newton/Chord Iterations and the Method of Lines. SIAM J. Sci. Comput. 19(1): 280-290 (1998) - 1996
- [j10]Carl T. Kelley, Z. Q. Xue:
GMRES and Integral Operators. SIAM J. Sci. Comput. 17(1): 217-226 (1996) - 1995
- [j9]S. Ito, Carl T. Kelley, Ekkehard W. Sachs:
Inexact primal-dual interior point iteration for linear programs in function spaces. Comput. Optim. Appl. 4(3): 189-201 (1995) - [j8]Paul C. Gilmore, Carl T. Kelley:
An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima. SIAM J. Optim. 5(2): 269-285 (1995) - [i1]C. T. Kelley, Ekkehard W. Sachs:
Local Convergence of the Symmetric Rank-One Iteration. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-07 (1995) - 1994
- [j7]C. T. Kelley, Ekkehard W. Sachs:
Multilevel Algorithms for Constrained Compact Fixed Point Problems. SIAM J. Sci. Comput. 15(3): 645-667 (1994) - 1993
- [j6]Carl T. Kelley, Ekkehard W. Sachs:
Pointwise Broyden Methods. SIAM J. Optim. 3(2): 423-441 (1993) - 1992
- [j5]D. M. Hwang, Carl T. Kelley:
Convergence of Broyden's Method in Banach Spaces. SIAM J. Optim. 2(3): 505-532 (1992) - 1991
- [j4]C. T. Kelley, Stephen J. Wright:
Sequential quadratic programming for certain parameter identification problems. Math. Program. 51: 281-305 (1991) - [j3]Carl T. Kelley, Ekkehard W. Sachs:
A New Proof of Superlinear Convergence for Broyden's Method in Hilbert Space. SIAM J. Optim. 1(1): 146-150 (1991) - [j2]Carl T. Kelley, Ekkehard W. Sachs:
Fast Algorithms for Compact Fixed Point Problems with Inexact Function Evaluations. SIAM J. Sci. Comput. 12(4): 725-742 (1991) - 1990
- [j1]C. T. Kelley, Ekkehard W. Sachs:
Approximate Quasi-Newton Methods. Math. Program. 48: 41-70 (1990)
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-12-02 22:29 CET 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:
