{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T22:45:44Z","timestamp":1700520344802},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1007\/bf00129645","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T17:17:51Z","timestamp":1099243071000},"page":"5-20","source":"Crossref","is-referenced-by-count":16,"title":["Granularity issues for solving polynomial systems via globally convergent algorithms on a hypercube"],"prefix":"10.1007","volume":"3","author":[{"given":"D. C. S.","family":"Allison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amal","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Layne T.","family":"Watson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/1022003","volume":"22","author":"E. Allgower","year":"1980","unstructured":"Allgower, E., and Georg, K. 1980. Simplicial and continuation methods for approximating fixed points. SIAM Rev., 22, 1 (Jan.), 28?85.","journal-title":"SIAM Rev."},{"key":"CR2","unstructured":"Allison, D.C.S., Harimoto, S., and Watson, L.T. 1988. The granularity of parallel homotopy algorithms for polynomial systems of equations. In Conference Proceedings?1988 Int. Conf. on Parallel Processing (St. Charles, Ill., Aug. 16?19), IEEE Computer Society Press, pp 165?168."},{"key":"CR3","series-title":"M.S. thesis","volume-title":"An augmented Jacobian matrix algorithm for tracking homotopy zero curves","author":"S.C. Billups","year":"1985","unstructured":"Billups, S.C. 1985. An augmented Jacobian matrix algorithm for tracking homotopy zero curves. M.S. thesis, Dept. of Computer Science, VPI&SU, Blacksburg, Va."},{"issue":"3","key":"CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01436084","volume":"7","author":"P. Businger","year":"1965","unstructured":"Businger, P., and Golub, G.H. 1965. Linear least squares solutions by Householder transformations. Numer. Math., 7, 3 (May), 269?276.","journal-title":"Numer. Math."},{"key":"CR5","series-title":"Tech. Rept. CS-CU-361-87","volume-title":"Using parallel function evaluation to improve Hessian approximation for unconstrained optimization","author":"R.H. Byrd","year":"1987","unstructured":"Byrd, R.H., Schnabel, R.B., and Shultz, G.A. 1987. Using parallel function evaluation to improve Hessian approximation for unconstrained optimization. Tech. Rept. CS-CU-361?87, Dept. of Computer Science, University of Colorado, Boulder, Colo."},{"key":"CR6","unstructured":"Chen, A.C., and Wu, C.L. 1984. Optimum solution to dense linear systems of equations. In Conference Proceedings?1984 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 21?24), IEEE Computer Society Press, pp. 417?425."},{"key":"CR7","unstructured":"Chern, M.Y., and Murata, T. 1983. Fast algorithm for concurrent LU decomposition and matrix inversion. In Conference Proceedings?1983 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 23?26), Computer Society Press, pp. 79?86."},{"issue":"143","key":"CR8","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1090\/S0025-5718-1978-0492046-9","volume":"32","author":"S.N. Chow","year":"1978","unstructured":"Chow, S.N., Mallet-Paret, J., and Yorke, J.A. 1978. Finding zeros of maps: Homotopy methods that are constructive with probability one. Math. Comput., 32, 143 (July), 887?899.","journal-title":"Math. Comput."},{"key":"CR9","series-title":"Tech. Rept. CU-CS-376-87","doi-asserted-by":"crossref","DOI":"10.21236\/ADA188327","volume-title":"A view of unconstrained optimization","author":"J.E. Dennis Jr.","year":"1987","unstructured":"Dennis, J.E. Jr., and Schnabel, R.B. 1987. A view of unconstrained optimization. Tech. Rept. CU-CS-376?87, Dept. of Computer Science, University of Colorado, Boulder, Colo."},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0898-1221(84)90042-7","volume":"10","author":"G.H. Ellis","year":"1984","unstructured":"Ellis, G.H., and Watson, L.T. 1984. A parallel algorithm for simple roots of polynomials. Comput. Math. Appl., 10, 2: 107?121.","journal-title":"Comput. Math. Appl."},{"key":"CR11","first-page":"21","volume-title":"The characteristics of parallel algorithms","author":"R.A. Finkel","year":"1987","unstructured":"Finkel, R.A. 1987. Large-grain parallelism-Three case studies. In The characteristics of parallel algorithms (L.H. Jamieson, D.B. Gannon, and R.J. Douglass, eds.), MIT Press, Cambridge, Mass., pp. 21?63."},{"key":"CR12","unstructured":"Gajski, D.D., Sameh, A.H., and Wisniewski, J.A. 1982. Iterative algorithms for tridiagonal matrices on a WSI-multiprocessor. In Conference Proceedings-1982 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 24?27), IEEE Computer Society Press, pp. 82?89."},{"key":"CR13","series-title":"Parallel Computing 83","first-page":"159","volume-title":"Solution of large linear systems on vector computers","author":"W. Gentzsch","year":"1984","unstructured":"Gentzsch, W., and Schafer, G. 1984. Solution of large linear systems on vector computers. Parallel Computing 83, North Holland, Amsterdam, pp. 159?166."},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/1020096","volume":"20","author":"D. Heller","year":"1978","unstructured":"Heller, D. 1978. A survey of parallel algorithms in numerical linear algebra. SIAM Rev., 20, 3 (Oct.), 740?777.","journal-title":"SIAM Rev."},{"key":"CR15","unstructured":"Kowalik, J.S., and Kumar, S.P. 1982. An efficient parallel block conjugate gradient method for linear equations. In Conference Proceedings?1982 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 24?27), IEEE Computer Society Press, pp. 47?52."},{"issue":"1","key":"CR16","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/355666.355675","volume":"2","author":"M. Kubicek","year":"1976","unstructured":"Kubicek, M. 1976. Dependence of solutions of nonlinear systems on a parameter. ACM Trans. Math. Software, 2, 1 (Mar.), 98?107.","journal-title":"ACM Trans. Math. Software"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-16042-6_26","volume-title":"Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 206","author":"S. Lakshmivarahan","year":"1985","unstructured":"Lakshmivarahan, S., and Dhall, S.K. 1985. Parallel algorithms for solving certain classes of linear recurrences. In Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 206, Springer-Verlag, Berlin, pp. 457?477."},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0096-3003(86)90030-5","volume":"18","author":"A.P. Morgan","year":"1986","unstructured":"Morgan, A.P. 1986a. A homotopy for solving polynomial systems. Appl. Math. Comput., 18, 1 (Jan.), 87?92.","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0096-3003(86)90029-9","volume":"18","author":"A.P. Morgan","year":"1986","unstructured":"Morgan, A.P. 1986b. A transformation to avoid solutions at infinity for polynomial systems. Appl. Math. Comput., 18, 1 (Jan.), 77?86.","journal-title":"Appl. Math. Comput."},{"key":"CR20","volume-title":"Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems","author":"A.P. Morgan","year":"1987","unstructured":"Morgan, A.P. 1987. Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems. Prentice-Hall, Englewood Cliffs, N.J."},{"key":"CR21","series-title":"Tech. Rept. TR-86-25","volume-title":"A globally convergent parallel algorithm for zeros of polynomial systems","author":"A.P. Morgan","year":"1986","unstructured":"Morgan, A.P., and Watson, L.T. 1986. A globally convergent parallel algorithm for zeros of polynomial systems. Tech. Rept. TR-86?25, Dept. of Computer Science, VPI&SU, Blacksburg, Va."},{"key":"CR22","first-page":"81","volume-title":"Parallel Computing 83","author":"D. Parkinson","year":"1984","unstructured":"Parkinson, D. 1984. The solutions of N linear equations using P processors. In Parallel Computing 83, North Holland, Amsterdam, pp. 81?87."},{"key":"CR23","series-title":"Tech. Rept. TR-86-26","volume-title":"Message length effects for solving polynomial systems on a hypercube","author":"W. Pelz","year":"1986","unstructured":"Pelz, W., and Watson, L.T. 1986. Message length effects for solving polynomial systems on a hypercube. Tech. Rept. TR-86?26, Dept. of Computer Science, VPI&SU, Va."},{"key":"CR24","unstructured":"Reed, D.A., and Patrick, M.L. 1984. A model of asynchronous iterative algorithms for solving large sparse linear systems. In Conference Proceedings-1984 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 21?24), IEEE Computer Society Press, pp. 402?410."},{"issue":"2","key":"CR25","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/357456.357461","volume":"9","author":"W.C. Rheinboldt","year":"1983","unstructured":"Rheinboldt, W.C., and Burkardt, J.V. 1983. Algorithm 596: A program for a locally parameterized continuation process. ACM Trans. Math. Software, 9, 2 (June), 236?241.","journal-title":"ACM Trans. Math. Software"},{"key":"CR26","unstructured":"Rice, T.A., and Siegel, L.J. 1982. A parallel algorithm for finding the roots of a polynomial. In Conference Proceedings?1982 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 24?27), IEEE Computer Society Press, pp. 57?61."},{"key":"CR27","series-title":"Tech. Rept. CS-CU-345-86","volume-title":"Concurrent function evaluations in local and global optimization","author":"R.B. Schnabel","year":"1986","unstructured":"Schnabel, R.B. 1986. Concurrent function evaluations in local and global optimization. Tech. Rept. CS-CU-345?86, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo."},{"key":"CR28","series-title":"Tech. Rept. CU-CS-334-86","doi-asserted-by":"crossref","DOI":"10.21236\/ADA169927","volume-title":"Solving systems of nonlinear equations by tensor methods","author":"R.B. Schnabel","year":"1986","unstructured":"Schnabel, R.B., and Frank, P.D. 1986. Solving systems of nonlinear equations by tensor methods. Tech. Rept. CU-CS-334?86, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo."},{"issue":"1?3","key":"CR29","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0010-4655(85)90156-0","volume":"37","author":"H. Schwandt","year":"1985","unstructured":"Schwandt, H. 1985. Newton-like interval methods for large nonlinear systems of equations on vector computers. Computer Phys. Comm., 37, 1?3 (July), 223?232.","journal-title":"Computer Phys. Comm."},{"key":"CR30","volume-title":"Computer Solution of Ordinary Differential Equations: The Initial Value Problem","author":"L.F. Shampine","year":"1975","unstructured":"Shampine, L.F., and Gordon, M.K. 1975. Computer Solution of Ordinary Differential Equations: The Initial Value Problem. W.H. Freeman, San Francisco, Calif."},{"issue":"4","key":"CR31","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0898-1221(79)90090-7","volume":"5","author":"L.T. Watson","year":"1979","unstructured":"Watson, L.T. 1979. A globally convergent algorithm for computing fixed points of C 2 maps. Appl. Math. Comput., 5, 4 (Oct.), 297?311.","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"CR32","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/1028157","volume":"28","author":"L.T. Watson","year":"1986","unstructured":"Watson, L.T. 1986. Numerical linear algebra aspects of globally convergent homotopy methods. SIAM Rev., 28, 4 (Dec.), 529?545.","journal-title":"SIAM Rev."},{"issue":"2","key":"CR33","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/355887.355899","volume":"6","author":"L.T. Watson","year":"1980","unstructured":"Watson, L.T., and Fenner, D. 1980. Chow-Yorke algorithm for fixed points or zeros of C 2 maps. ACM Trans. Math. Software, 6, 2 (June), 252?260.","journal-title":"ACM Trans. Math. Software"},{"issue":"3","key":"CR34","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/29380.214343","volume":"13","author":"L.T. Watson","year":"1987","unstructured":"Watson, L.T., Billups, S.C., and Morgan, A.P. 1987. Algorithm 652: HOMPACK: A suite of codes for globally convergent homotopy algorithms. ACM Trans. on Math. Software, 13, 3 (Sept.), 281?310.","journal-title":"ACM Trans. on Math. Software"},{"issue":"1","key":"CR35","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/0607017","volume":"7","author":"R. White","year":"1986","unstructured":"White, R. 1986a. Parallel algorithms for nonlinear problems. SIAM J. Algebraic Discrete Methods, 7, 1 (Jan.), 137?149.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"CR36","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0723040","volume":"23","author":"R. White","year":"1986","unstructured":"White, R. 1986b. A nonlinear parallel algorithm with application to the Stefan problem. SIAM J. Numer. Anal., 23, 3 (June), 639?652.","journal-title":"SIAM J. Numer. Anal."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129645.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00129645\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T20:53:34Z","timestamp":1682801614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00129645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["BF00129645"],"URL":"https:\/\/doi.org\/10.1007\/bf00129645","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}