{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T22:53:59Z","timestamp":1781564039518,"version":"3.54.5"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>\n                    Efficiently solving nonlinear equations underpins numerous scientific and engineering disciplines, yet scaling these solutions for challenging system models remains a challenge. This article presents\n                    <jats:monospace>NonlinearSolve.jl<\/jats:monospace>\n                    \u2014a suite of high-performance open source nonlinear equation solvers implemented natively in the Julia programming language.\n                    <jats:monospace>NonlinearSolve.jl<\/jats:monospace>\n                    distinguishes itself by offering a unified API that accommodates a diverse range of solver specifications alongside features such as automatic algorithm selection based on runtime analysis, support for static array kernels for improved GPU computation on smaller problems, and the utilization of sparse automatic differentiation and Jacobian-free Krylov methods for large-scale problem-solving. Through rigorous comparison with established tools such as\n                    <jats:monospace>PETSc SNES<\/jats:monospace>\n                    ,\n                    <jats:monospace>Sundials KINSOL<\/jats:monospace>\n                    , and\n                    <jats:monospace>MINPACK<\/jats:monospace>\n                    ,\n                    <jats:monospace>NonlinearSolve.jl<\/jats:monospace>\n                    demonstrates robustness and efficiency, achieving significant advancements in solving nonlinear equations while being implemented in a high-level programming language. The capabilities of\n                    <jats:monospace>NonlinearSolve.jl<\/jats:monospace>\n                    unlock new potentials in modeling and simulation across various domains, making it a valuable addition to the computational toolkit of researchers and practitioners alike.\n                  <\/jats:p>","DOI":"10.1145\/3779117","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T13:01:42Z","timestamp":1764594102000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["NonlinearSolve.jl: High-Performance and Robust Solvers for Systems of Nonlinear Equations in Julia"],"prefix":"10.1145","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3938-7375","authenticated-orcid":false,"given":"Avik","family":"Pal","sequence":"first","affiliation":[{"name":"Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3704-0191","authenticated-orcid":false,"given":"Flemming","family":"Holtorf","sequence":"additional","affiliation":[{"name":"CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1108-1366","authenticated-orcid":false,"given":"Axel","family":"Larsson","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, New Jersey, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4453-0682","authenticated-orcid":false,"given":"Torkel","family":"Loman","sequence":"additional","affiliation":[{"name":"CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5115-4956","authenticated-orcid":false,"family":"Utkarsh","sequence":"additional","affiliation":[{"name":"CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2684-4984","authenticated-orcid":false,"given":"Frank","family":"Sch\u00e4fer","sequence":"additional","affiliation":[{"name":"CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1271-0926","authenticated-orcid":false,"given":"Qingyu","family":"Qu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7676-3133","authenticated-orcid":false,"given":"Edelman","family":"Alan","sequence":"additional","affiliation":[{"name":"CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5850-0663","authenticated-orcid":false,"given":"Chris","family":"Rackauckas","sequence":"additional","affiliation":[{"name":"CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"e_1_3_2_1_1","unstructured":"Ranjan Anantharaman Mohamed Tarek Viral B. Shah Dependabot Alexander Barth Christopher Rackauckas Fredrik Ekre Hendrik Ranocha J\u00fcrgen Fuhrmann Stefanos Carlstr\u00f6m et al. 2025. [bot]. JuliaLinearAlgebra\/AlgebraicMultigrid.jl. Retrieved from https:\/\/github.com\/JuliaLinearAlgebra\/AlgebraicMultigrid.jl"},{"key":"e_1_3_2_2_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971231","volume-title":"Numerical Solution of Boundary Value Problems for Ordinary Differential Equations","author":"Ascher Uri M.","year":"1995","unstructured":"Uri M. Ascher, Robert M. M. Mattheij, and Robert D. Russell. 1995. Numerical Solution of Boundary Value Problems for Ordinary Differential Equations. SIAM."},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0915020"},{"key":"e_1_3_2_4_1","unstructured":"Shaojie Bai J. Zico Kolter and Vladlen Koltun. 2019. Deep equilibrium models. arXiv:1909.01377. Retrieved from http:\/\/arxiv.org\/abs\/1909.01377"},{"key":"e_1_3_2_5_1","unstructured":"Shaojie Bai Vladlen Koltun and J. Zico Kolter. 2020. Multiscale deep equilibrium models. arXiv:2006.08656. Retrieved from http:\/\/arxiv.org\/abs\/2006.08656"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.2172\/1577437"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0258-1"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1149\/1945-7111\/ac201c"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2019.02.002"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2872064"},{"key":"e_1_3_2_11_1","volume-title":"Program Transformations for ML Workshop at NeurIPS 2019","author":"Bettencourt Jesse","year":"2019","unstructured":"Jesse Bettencourt, Matthew J. Johnson, and David Duvenaud. 2019. Taylor-mode automatic differentiation for higher-order derivatives in JAX. In Program Transformations for ML Workshop at NeurIPS 2019."},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"key":"e_1_3_2_13_1","first-page":"5230","article-title":"Efficient and modular implicit differentiation","volume":"35","author":"Blondel Mathieu","year":"2022","unstructured":"Mathieu Blondel, Quentin Berthet, Marco Cuturi, Roy Frostig, Stephan Hoyer, Felipe Llinares-L\u00f3pez, Fabian Pedregosa, and Jean-Philippe Vert. 2022. Efficient and modular implicit differentiation. In Advances in Neural Information Processing Systems, Vol. 35, 5230\u20135242.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0198670-6"},{"key":"e_1_3_2_15_1","unstructured":"V. Churavy D. Aluthge L. C. Wilcox S. Byrne M. Waruszewski A. Ramadhan S. Schaub Meredith J. Schloss J. Samaroo J. Bolewski et al. 2021. JuliaGPU\/KernelAbstractions.jl: V0. 6.0. Retrieved from https:\/\/github.com\/JuliaGPU\/KernelAbstractions.jl"},{"key":"e_1_3_2_16_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8051-0","volume-title":"The Kepler Problem: Group Theoretical Aspects, Regularization and Quantization, with Application to the Study of Perturbations","author":"Bruno Cordani","year":"2003","unstructured":"Bruno Cordani. 2003. The Kepler Problem: Group Theoretical Aspects, Regularization and Quantization, with Application to the Study of Perturbations, Vol. 29. Springer Science & Business Media."},{"key":"e_1_3_2_17_1","first-page":"74","volume-title":"Proceedings of an International Workshop on Numerical Treatment of Inverse Problems in Differential and Integral Equations","author":"Deuflhard Peter","year":"1983","unstructured":"Peter Deuflhard and Georg Bader. 1983. Multiple shooting techniques revisited. In Proceedings of an International Workshop on Numerical Treatment of Inverse Problems in Differential and Integral Equations. Springer, 74\u201394."},{"key":"e_1_3_2_18_1","unstructured":"Fr\u00e9d\u00e9ric Devernay. 2007. C\/C++ Minpack. Retrieved from http:\/\/devernay.free.fr\/hacks\/cminpack\/"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1149\/1.2221597"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827593251496"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-3078-8"},{"key":"e_1_3_2_22_1","volume-title":"LSMR: An Iterative Algorithm for Sparse Least-Squares Problems","author":"Fong D. C. L.","year":"2010","unstructured":"D. C. L. Fong, and M. A. Saunders. 2010. LSMR: An Iterative Algorithm for Sparse Least-Squares Problems. Systems Optimization Laboratory."},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539801"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144504444711"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1149000.1149012"},{"key":"e_1_3_2_26_1","volume-title":"Program Transformations for ML Workshop at NeurIPS 2019","author":"Gowda Shashi","year":"2019","unstructured":"Shashi Gowda, Yingbo Ma, Valentin Churavy, Alan Edelman, and Christopher Rackauckas. 2019. Sparsity programming: Automated sparsity-aware optimizations in differentiable programming. In Program Transformations for ML Workshop at NeurIPS 2019."},{"issue":"1","key":"e_1_3_2_27_1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","article-title":"Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent","volume":"32","author":"Hager William W.","year":"2006","unstructured":"William W. Hager and Hongchao Zhang. 2006. Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Transactions on Mathematical Software (TOMS) 32, 1 (2006), 113\u2013137.","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.4171\/owr\/2006\/14"},{"key":"e_1_3_2_29_1","first-page":"229","article-title":"A self-adaptive trust region algorithm","volume":"21","author":"Hei Long","year":"2003","unstructured":"Long Hei. 2003. A self-adaptive trust region algorithm. Journal of Computational Mathematics 21 (2003), 229\u2013236.","journal-title":"Journal of Computational Mathematics"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089020"},{"key":"e_1_3_2_31_1","unstructured":"The MathWorks Inc. 2022. Optimization Toolbox Version: 9.4 (R2022b). Retrieved from https:\/\/www.mathworks.com"},{"key":"e_1_3_2_32_1","unstructured":"Michael Innes. 2018. Don\u2019t unroll adjoint: Differentiating SSA-Form programs. arXiv:1810.07951. Retrieved from http:\/\/arxiv.org\/abs\/1810.07951"},{"key":"e_1_3_2_33_1","unstructured":"Michael Innes Elliot Saba Keno Fischer Dhairya Gandhi Marco Concetto Rudilosso Neethu Mariya Joy Tejan Karmali Avik Pal and Viral Shah. 2018. Fashionable modelling with flux. arXiv:1811.01457. Retrieved from https:\/\/arxiv.org\/abs\/1811.01457"},{"key":"e_1_3_2_34_1","article-title":"Notes on adjoint methods for 18.335","author":"Johnson Steven G.","year":"2006","unstructured":"Steven G. Johnson. 2006. Notes on adjoint methods for 18.335. Introduction to Numerical Methods. Retrieved from https:\/\/www.semanticscholar.org\/paper\/Notes-on-Adjoint-Methods-for-18.335-Johnson\/75c033c779d9b357af2dab11f438fcc7b689e310","journal-title":"Introduction to Numerical Methods"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.5028\/jatm.v6i4.373"},{"key":"e_1_3_2_36_1","first-page":"75","volume-title":"International Symposium on Code Generation and Optimization (CGO \u201904)","author":"Lattner Chris","year":"2004","unstructured":"Chris Lattner and Vikram Adve. 2004. LLVM: A compilation framework for lifelong program analysis & transformation. In International Symposium on Code Generation and Optimization (CGO \u201904). IEEE, 75\u201386."},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1011530"},{"key":"e_1_3_2_38_1","unstructured":"Yingbo Ma and Chris Elrod. [n.\u2009d.] GitHub\u2014JuliaLinearAlgebra\/RecursiveFactorization.jl\u2014github.com. Retrieved February 16 2024 from https:\/\/github.com\/JuliaLinearAlgebra\/RecursiveFactorization.jl"},{"key":"e_1_3_2_39_1","unstructured":"Yingbo Ma Shashi Gowda Ranjan Anantharaman Chris Laughman Viral Shah and Chris Rackauckas. 2021. ModelingToolkit: A composable graph transformation system for equation-based modeling. arXiv:2103.05244. Retrieved from https:\/\/arxiv.org\/abs\/2103.05244"},{"key":"e_1_3_2_40_1","doi-asserted-by":"crossref","unstructured":"Shashi Gowda Yingbo Ma Alessandro Cheli Maja Gwozdz Viral B. Shah Alan Edelman Christopher Rackauckas. 2021. High-performance symbolic-numerics via multiple dispatch. arXiv:2105.03949. Retrieved from https:\/\/arxiv.org\/abs\/2105.03949","DOI":"10.1145\/3511528.3511535"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00615"},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","DOI":"10.21105\/joss.05187"},{"key":"e_1_3_2_43_1","doi-asserted-by":"crossref","DOI":"10.2172\/6997568","volume-title":"User Guide for MINPACK-1","author":"Mor\u00e9 Jorge J.","year":"1980","unstructured":"Jorge J. Mor\u00e9, Burton S. Garbow, and Kenneth E. Hillstrom. 1980. User Guide for MINPACK-1. Technical Report. CM-P00068642."},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/192115.192132"},{"key":"e_1_3_2_45_1","first-page":"12472","article-title":"Instead of rewriting foreign code for machine learning, automatically synthesize fast gradients","volume":"33","author":"Moses William","year":"2020","unstructured":"William Moses and Valentin Churavy. 2020. Instead of rewriting foreign code for machine learning, automatically synthesize fast gradients. In Advances in Neural Information Processing Systems, Vol. 33, 12472\u201312485.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"issue":"1","key":"e_1_3_2_47_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3423597","article-title":"An enhancement of the bisection method average performance preserving minmax optimality","volume":"47","author":"Oliveira Ivo F. D.","year":"2020","unstructured":"Ivo F. D. Oliveira and Ricardo H. C. Takahashi. 2020. An enhancement of the bisection method average performance preserving minmax optimality. ACM Transactions on Mathematical Software 47, 1 (2020), 1\u201324.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7808903"},{"key":"e_1_3_2_49_1","unstructured":"Avik Pal. 2023. On Efficient Training & Inference of Neural Differential Equations. Master\u2019s thesis. Massachusetts Institute of Technology."},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC58863.2023.10363574"},{"issue":"2","key":"e_1_3_2_51_1","doi-asserted-by":"crossref","first-page":"236","DOI":"10.7146\/math.scand.a-11866","article-title":"Nondiscrete induction and a double step secant method","volume":"46","author":"Potra F.-A.","year":"1980","unstructured":"F.-A. Potra and Vlastimil Pt\u00e1k. 1980. Nondiscrete induction and a double step secant method. Mathematica Scandinavica 46, 2 (1980), 236\u2013250.","journal-title":"Mathematica Scandinavica"},{"key":"e_1_3_2_52_1","article-title":"British Computer Society,  Numerical Analysis Specialist Group and University of Essex","author":"Rabinowitz P.","year":"1970","unstructured":"P. Rabinowitz, British Computer Society, Numerical Analysis Specialist Group and University of Essex. 1970. Numerical Methods for Nonlinear Algebraic Equations. Gordon and Breach Science Publishers. Retrieved from https:\/\/books.google.com\/books?id=3Qmw7rD0disC","journal-title":"Numerical Methods for Nonlinear Algebraic Equations"},{"key":"e_1_3_2_53_1","first-page":"1","volume-title":"2022 Annual Modeling and Simulation Conference (ANNSIM)","author":"Rackauckas Chris","year":"2022","unstructured":"Chris Rackauckas, Maja Gwozdz, Anand Jain, Yingbo Ma, Francesco Martinuzzi, Utkarsh Rajput, Elliot Saba, Viral B. Shah, Ranjan Anantharaman, Alan Edelman, et al. 2022. Composing modeling and simulation with machine learning in Julia. In 2022 Annual Modeling and Simulation Conference (ANNSIM). IEEE, 1\u201317."},{"key":"e_1_3_2_54_1","unstructured":"Jason Rader Terry Lyons and Patrick Kidger. 2024. Optimistix: Modular optimisation in JAX and Equinox. arXiv:2402.09983. Retrieved from https:\/\/arxiv.org\/abs\/2402.09983"},{"key":"e_1_3_2_55_1","unstructured":"J. Revels M. Lubin and T. Papamarkou. 2016. Forward-mode automatic differentiation in Julia. arXiv160707892. Retrieved from https:\/\/arxiv.org\/abs\/1607.07892"},{"key":"e_1_3_2_56_1","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1007\/s00202-023-01797-4","article-title":"Adjoint variable method for transient nonlinear electroquasistatic problems","volume":"105","author":"Ruppert M. Greta","year":"2023","unstructured":"M. Greta Ruppert, Yvonne Sp\u00e4ck-Leigsnering, Julian Buschbaum, and Herbert De Gersem. 2023. Adjoint variable method for transient nonlinear electroquasistatic problems. Electrical Engineering 105 (2023), 2319\u20132325.","journal-title":"Electrical Engineering"},{"key":"e_1_3_2_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/0907058"},{"issue":"1","key":"e_1_3_2_58_1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s40314-022-02159-9","article-title":"Simple yet highly efficient numerical techniques for systems of nonlinear equations","volume":"42","author":"Singh Harmandeep","year":"2023","unstructured":"Harmandeep Singh and Janak Raj Sharma. 2023. Simple yet highly efficient numerical techniques for systems of nonlinear equations. Computational and Applied Mathematics 42, 1 (2023), 22.","journal-title":"Computational and Applied Mathematics"},{"key":"e_1_3_2_59_1","unstructured":"Harmen Stoppels Alexis Montoison and J\u00fcrgen Fuhrmann. 2024. Haampie\/IncompleteLU.jl. Retrieved from https:\/\/github.com\/haampie\/IncompleteLU.jl"},{"key":"e_1_3_2_60_1","unstructured":"Songchen Tan Keming Miao Alan Edelman and Christopher Rackauckas. 2025. Scalable higher-order nonlinear solvers via higher-order automatic differentiation. arXiv:2501.16895. Retrieved from https:\/\/arxiv.org\/abs\/2501.16895"},{"key":"e_1_3_2_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896297744"},{"key":"e_1_3_2_62_1","unstructured":"Mark K. Transtrum and James P. Sethna. 2012. Improvements to the Levenberg-Marquardt algorithm for nonlinear least-squares minimization. arXiv:1201.5885. Retrieved from https:\/\/arxiv.org\/abs\/1201.5885"},{"key":"e_1_3_2_63_1","volume-title":"ICLR 2024 Workshop on AI4DifferentialEquations in Science","author":"Utkarsh","year":"2024","unstructured":"Utkarsh, Vaibhav Kumar Dixit, Julian Samaroo, Avik Pal, Alan Edelman, and Christopher Vincent Rackauckas. 2024a. Efficient GPU-accelerated global optimization for inverse problems. In ICLR 2024 Workshop on AI4DifferentialEquations in Science. Retrieved from https:\/\/openreview.net\/forum?id=nD10o1ge97"},{"key":"e_1_3_2_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2023.116591"},{"key":"e_1_3_2_65_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0686-2"},{"key":"e_1_3_2_66_1","first-page":"202","article-title":"Getting started with ADOL-C","volume":"181","author":"Walther Andrea","year":"2009","unstructured":"Andrea Walther and Andreas Griewank. 2009. Getting started with ADOL-C. Combinatorial Scientific Computing 181 (2009), 202.","journal-title":"Combinatorial Scientific Computing"},{"key":"e_1_3_2_67_1","volume-title":"Solving Ordinary Differential Equations II","author":"Wanner Gerhard","year":"1996","unstructured":"Gerhard Wanner and Ernst Hairer. 1996. Solving Ordinary Differential Equations II. Vol. 375. Springer, Berlin."},{"key":"e_1_3_2_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/1011036"},{"key":"e_1_3_2_69_1","doi-asserted-by":"publisher","DOI":"10.1137\/1013035"},{"key":"e_1_3_2_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0893-2"},{"key":"e_1_3_2_71_1","volume-title":"Improved Implementation of Multiple Shooting for BVPs","author":"Zhang Weidong","year":"2012","unstructured":"Weidong Zhang. 2012. Improved Implementation of Multiple Shooting for BVPs. Computer Science Department, University of Toronto."}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3779117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T16:04:17Z","timestamp":1773763457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3779117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3779117"],"URL":"https:\/\/doi.org\/10.1145\/3779117","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"2024-05-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}