{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T21:54:30Z","timestamp":1770155670588,"version":"3.49.0"},"reference-count":43,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Numer. Anal."],"published-print":{"date-parts":[[2026,2,28]]},"DOI":"10.1137\/25m1727904","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T08:54:37Z","timestamp":1770108877000},"page":"170-192","source":"Crossref","is-referenced-by-count":0,"title":["Support Graph Preconditioners for Off-Lattice Cell-Based Models"],"prefix":"10.1137","volume":"64","author":[{"given":"Justin","family":"Steinman","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, University of Massachusetts Amherst, Amherst, MA 01003 USA."}]},{"given":"Andreas","family":"Buttensch\u00f6n","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, University of Massachusetts Amherst, Amherst, MA 01003 USA."}]}],"member":"351","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.244"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801384019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/nla.343"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1008411"},{"key":"ref5","unstructured":"A. Buttensch\u00f6n, P. van Liedekerke, M. Palm, and D. Drasdo, Does single cell migration behavior permit prediction of multi-cellular migration patterns: Lessons from a physics-based model, in-preparation, 2026."},{"key":"ref6","first-page":"30","volume":"16","author":"Chen D.","year":"2003","journal-title":"Electron. Trans. Numer. Anal."},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"J. W. Demmel, Applied Numerical Linear Algebra, SIAM, 1997.","DOI":"10.1137\/1.9781611971446"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680020208"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525905000440"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/1478-3975\/2\/3\/001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932738"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1529\/biophysj.104.041459"},{"key":"ref13","unstructured":"Y. Gao, R. Kyng, and D. A. Spielman, Robust and Practical Solution of Laplacian Equations by Approximate Elimination, preprint, arXiv:2303.00709, 2023."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1005991"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.69.2013"},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"A. Greenbaum, Iterative Methods for Solving Linear Systems, SIAM, 1997.","DOI":"10.1137\/1.9781611970937"},{"key":"ref17","unstructured":"K. D. Gremban, Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems, Ph.D. thesis, Carnegie Mellon University, 1996."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53043-7"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, 2002.","DOI":"10.1137\/1.9780898718027"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909374107"},{"key":"ref21","author":"Jambulapati A.","year":"2021","journal-title":"ACM Trans. Algorithms"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"J. A. Kelner, L. Orecchia, A. Sidford, and Z. A. Zhu, A simple, combinatorial algorithm for solving SDD systems in nearly-linear time, in Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 2013, pp. 911\u2013920.","DOI":"10.1145\/2488608.2488724"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1039\/C5IB00201J"},{"key":"ref24","doi-asserted-by":"crossref","unstructured":"R. Kyng, Y. T. Lee, R. Peng, S. Sachdeva, and D. A. Spielman, Sparsified Cholesky and multigrid solvers for connection Laplacians, in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2015.","DOI":"10.1145\/2897518.2897640"},{"key":"ref25","doi-asserted-by":"crossref","unstructured":"Y. T. Lee and A. Sidford, Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems, in 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, IEEE, 2013, pp. 147\u2013156.","DOI":"10.1109\/FOCS.2013.24"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-811718-7.00014-9"},{"key":"ref27","author":"Liesen J.","year":"2013","journal-title":"Numer. Math. Sci."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2012.02.002"},{"key":"ref29","doi-asserted-by":"crossref","unstructured":"B. M. Maggs, G. L. Miller, O. Parekh, R. Ravi, and S. L. M. Woo, Finding effective support-tree preconditioners, in Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005, pp. 176\u2013185.","DOI":"10.1145\/1073970.1073996"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1242\/dev.117507"},{"key":"ref31","doi-asserted-by":"crossref","unstructured":"G. Meurant and P. Tich\u1ef3, Error Norm Estimation in the Conjugate Gradient Algorithm, SIAM, 2024.","DOI":"10.1137\/1.9781611977868"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827599362314"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2008.05.004"},{"key":"ref34","first-page":"945","author":"Pothen A.","year":"2018","journal-title":"Handbook Data Structures Appl."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-25820-6"},{"key":"ref36","unstructured":"J. R. Shewchuk, et\u00a0al., An introduction to the conjugate gradient method without the agonizing pain, 1994."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21395"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"ref39","doi-asserted-by":"crossref","unstructured":"D. J. Tracy, S. R. Buss, and B. M. Woods, Efficient large-scale sweep and prune methods with AABB insertion and removal, in 2009 IEEE Virtual Reality Conference, IEEE, 2009, pp. 191\u2013198.","DOI":"10.1109\/VR.2009.4811022"},{"key":"ref40","volume-title":"IMA Workshop on Graph Theory and Sparse Matrix Computation","author":"Vaidya P.","year":"1991"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1006273"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s40571-015-0082-3"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"}],"container-title":["SIAM Journal on Numerical Analysis"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T08:54:43Z","timestamp":1770108883000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/25M1727904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,3]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2,28]]}},"alternative-id":["10.1137\/25M1727904"],"URL":"https:\/\/doi.org\/10.1137\/25m1727904","relation":{},"ISSN":["0036-1429","1095-7170"],"issn-type":[{"value":"0036-1429","type":"print"},{"value":"1095-7170","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,3]]}}}