{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T05:42:44Z","timestamp":1673070164608},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Comput"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf02385256","type":"journal-article","created":{"date-parts":[[2006,4,9]],"date-time":"2006-04-09T15:07:40Z","timestamp":1144595260000},"page":"251-263","source":"Crossref","is-referenced-by-count":7,"title":["A general iterative sparse linear solver and its parallelization for interval Newton methods"],"prefix":"10.1007","volume":"1","author":[{"given":"Chenyi","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Frolov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Baker Kearfott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02385256_CR1","unstructured":"Dongarra, J. et l.Solving linear systems on vector and shared memory computers. SIAM, 1991."},{"key":"BF02385256_CR2","unstructured":"Duff, I.Direct methods for sparse matrices. Oxford University Press, 1986."},{"issue":"1","key":"BF02385256_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","volume":"15","author":"I. Duff","year":"1989","unstructured":"Duff, I.Sparse matrix test problems, ACM Trans. Math. Software 15 (1) (1989), pp. 1\u201314.","journal-title":"ACM Trans. Math. Software"},{"issue":"9","key":"BF02385256_CR4","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1016\/0167-8191(94)90036-1","volume":"20","author":"Q. Gan","year":"1994","unstructured":"Gan, Q., Yang, Q., and Hu, C.parallel all-row preconditioned interval linear solver for nonlinear equations on multiprocessor. Parallel computing 20 (9) (1994) pp. 1249\u20131268.","journal-title":"Parallel computing"},{"key":"BF02385256_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01933165","volume":"21","author":"E. R. Hansen","year":"1981","unstructured":"Hansen, E. R. and Sengupta, S.Bounding solutions of systems of equations using interval arithmetic. BIT 21 (1981), pp. 203\u2013211.","journal-title":"BIT"},{"key":"BF02385256_CR6","unstructured":"Hu, C., Bayoumi, M., Kearfott, R. B., and Yang, Q.A parallelized algorithm for all-row preconditioned interval Newton\/generalized bisection method. In: \u201cProc. SIAM 5th Conf. on Paral. Proc. for Sci. Comp.\u201d, SIAM, 1991, pp. 205\u2013209."},{"issue":"179","key":"BF02385256_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1090\/S0025-5718-1987-0890261-9","volume":"49","author":"R. B. Kearfott","year":"1987","unstructured":"Kearfott, R. B.Abstract generalized bisection and a cost bound. Math. Comp.49 (179) (1987), pp. 187\u2013202.","journal-title":"Math. Comp."},{"issue":"3","key":"BF02385256_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/29380.29862","volume":"13","author":"R. B. Kearfott","year":"1987","unstructured":"Kearfott, R. B.Some tests of generalized bisection. ACM Trans. Math. Software13 (3) (1987), pp. 197\u2013220.","journal-title":"ACM Trans. Math. Software"},{"key":"BF02385256_CR9","first-page":"59","volume":"1","author":"R. B. Kearfott","year":"1991","unstructured":"Kearfott, R. B., Hu, C., and Novoa, M.A review of preconditioners for the interval Gauss-Seidel method. Interval Computations 1 (1991), pp. 59\u201385.","journal-title":"Interval Computations"},{"issue":"2","key":"BF02385256_CR10","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/78928.78931","volume":"16","author":"R. B. Kearfott","year":"1990","unstructured":"Kearfott, R. B. and Novoa, M.A program for generalized bisection. ACM Trans. Math. Software16 (2) (1990), pp. 152\u2013157.","journal-title":"ACM Trans. Math. Software"},{"key":"BF02385256_CR11","unstructured":"Knuth, D.The art of computer programming, Vol. 1, Fundamental algorithms. Addison-Wesley, 1968."},{"key":"BF02385256_CR12","unstructured":"PCGPAK user's guide. Scientific Computing Associates, New Haven."},{"key":"BF02385256_CR13","unstructured":"Press, W. et al.Numerical recipes. Cambridge, 1992."},{"key":"BF02385256_CR14","first-page":"40","volume":"4","author":"C. Schnepper","year":"1993","unstructured":"Schnepper, C. and Stadther, M.Application of a parallel interval Newton\/generalized bisection algorithm to equation-based chemical process flowsheeting. Interval Computations 4 (1993), pp. 40\u201364.","journal-title":"Interval Computations"}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02385256.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02385256\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02385256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:40:07Z","timestamp":1558093207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02385256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF02385256"],"URL":"https:\/\/doi.org\/10.1007\/bf02385256","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"value":"1385-3139","type":"print"},{"value":"1573-1340","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}