{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:54:49Z","timestamp":1765040089318},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,11,23]],"date-time":"2006-11-23T00:00:00Z","timestamp":1164240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2006,12,8]]},"DOI":"10.1007\/s11075-006-9048-0","type":"journal-article","created":{"date-parts":[[2006,11,22]],"date-time":"2006-11-22T13:23:36Z","timestamp":1164201816000},"page":"151-175","source":"Crossref","is-referenced-by-count":12,"title":["Computing curve intersection by means of simultaneous iterations"],"prefix":"10.1007","volume":"43","author":[{"given":"Dario A.","family":"Bini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana","family":"Marco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,23]]},"reference":[{"issue":"122","key":"9048_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0025-5718-1973-0329236-7","volume":"27","author":"O. Aberth","year":"1973","unstructured":"Aberth, O.: Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comput. 27(122), 339\u2013344 (1973)","journal-title":"Math. Comput."},{"key":"9048_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02207694","volume":"13","author":"D. Bini","year":"1996","unstructured":"Bini, D.: Numerical computation of polynomial zeros by means of Aberth\u2019s method. Numer. Algor. 13, 179\u2013200 (1996)","journal-title":"Numer. Algor."},{"key":"9048_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1019199917103","volume":"23","author":"D.A. Bini","year":"2000","unstructured":"Bini, D.A., Fiorentino, G.: Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numer. Algor. 23, 127\u2013173 (2000)","journal-title":"Numer. Algor."},{"key":"9048_CR4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.tcs.2004.01.016","volume":"315","author":"D.A. Bini","year":"2004","unstructured":"Bini, D.A., Gemignani, L.: Bernstein\u2013Bezoutian matrices. Theor. Comp. Sci. 315, 319\u2013333 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"9048_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1137\/S0895479803429788","volume":"1","author":"D.A. Bini","year":"2005","unstructured":"Bini, D.A., Gemignani, L., Tisseur, F.: The Ehrlich\u2013Aberth method for the nonsymmetric tridiagonal eigenvalue problem. SIAM J. Matrix Anal. Appl. 1, 153\u2013175 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9048_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0265-3","volume-title":"Polynomial and Matrix Computations, Fundamental Algorithms, vol. 1","author":"D. Bini","year":"1994","unstructured":"Bini, D., Pan, V.: Polynomial and Matrix Computations, Fundamental Algorithms, vol 1. Birkh\u00e4user, Boston, Massachusetts (1994)"},{"key":"9048_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0024-3795(02)00469-X","volume":"366","author":"G. Casciola","year":"2003","unstructured":"Casciola, G., Fabbri, F., Montefusco, L.B.: An application of fast factorization algorithms in computer aided geometric design. Linear Algebra Appl. 366, 121\u2013138 (2003)","journal-title":"Linear Algebra Appl."},{"key":"9048_CR8","unstructured":"Delvaux, S., Marco, A., Mart\u00ednez, J.J., Van Barel, M.: Fast computation of determinants of B\u00e9zout matrices and application to curve implicitization, Report 434, Katholieke Universiteit Leuven, Department of Computer Science, July (2005)"},{"issue":"212","key":"9048_CR9","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1090\/S0025-5718-1995-1312096-X","volume":"64","author":"I. Gohberg","year":"1995","unstructured":"Gohberg, I., Kailath, T., Olshevsky, V.: Fast Gaussian elimination with partial pivoting for matrices with displacement structure. Math. Comput. 64(212), 1557\u20131576 (1995)","journal-title":"Math. Comput."},{"key":"9048_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-8396(84)90020-7","volume":"1","author":"R.N. Goldman","year":"1984","unstructured":"Goldman, R.N., Sederberg, T.W., Anderson, D.C.: Vector elimination: a technique for the implicitization, inversion and intersection of planar parametric rational polynomial curves. Comput. Aided Geom. Des. 1, 327\u2013356 (1984)","journal-title":"Comput. Aided Geom. Des."},{"key":"9048_CR11","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01935059","volume":"26","author":"H. Guggenheimer","year":"1986","unstructured":"Guggenheimer, H.: Initial approximations in Durand\u2013Kerner\u2019s root finding method. BIT 26, 537\u2013539 (1986)","journal-title":"BIT"},{"key":"9048_CR12","volume-title":"Applied and Computational Complex Analysis, vol. 1","author":"P. Henrici","year":"1974","unstructured":"Henrici, P.: Applied and Computational Complex Analysis, vol 1. Wiley, New York (1974)"},{"key":"9048_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"N.J. Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia, Pennsylvania (2002)","edition":"2"},{"key":"9048_CR14","volume-title":"Geometric and Solid Modeling. An Introduction","author":"C.M. Hoffmann","year":"1989","unstructured":"Hoffmann, C.M.: Geometric and Solid Modeling. An Introduction. Morgan Kaufmann, San Mateo, California (1989)"},{"key":"9048_CR15","volume-title":"Fundamentals of Computer Aided Geometric Design","author":"J. Hoschek","year":"1993","unstructured":"Hoschek, J., Lasser, D.: Fundamentals of Computer Aided Geometric Design. A. K. Peters, Wellesley, Massachusetts (1993)"},{"key":"9048_CR16","volume-title":"The Theory of Matrices","author":"P. Lancaster","year":"1985","unstructured":"Lancaster, P., Tismenetsky, M.: The Theory of Matrices. Academic, New York (1985)"},{"key":"9048_CR17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/174462.174617","volume":"13","author":"D. Manocha","year":"1994","unstructured":"Manocha, D., Demmel, J.: Algorithms for intersecting parametric and algebraic curves I: simple intersections. ACM Trans. Graph. 13, 73\u2013100 (1994)","journal-title":"ACM Trans. Graph."},{"issue":"2","key":"9048_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/gmip.1995.1010","volume":"57","author":"D. Manocha","year":"1995","unstructured":"Manocha, D., Demmel, J.: Algorithms for intersecting parametric and algebraic curves II: multiple intersections. Graph. Models Image Process. 57(2), 81\u2013100 (1995)","journal-title":"Graph. Models Image Process."},{"key":"9048_CR19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0167-8396(01)00033-4","volume":"18","author":"A. Marco","year":"2001","unstructured":"Marco, A., Mart\u00ednez, J.J.: Using polynomial interpolation for implicitizing algebraic curves. Comput. Aided Geom. Des. 18, 309\u2013319 (2001)","journal-title":"Comput. Aided Geom. Des."},{"key":"9048_CR20","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1090\/S0025-5718-1986-0842134-4","volume":"47","author":"R.G. Mosier","year":"1986","unstructured":"Mosier, R.G.: Root neighborhoods of a polynomial. Math. Comput. 47, 265\u2013273 (1986)","journal-title":"Math. Comput."},{"key":"9048_CR21","volume-title":"Handbook of Computer Aided Geometric Design","author":"N.M. Patrikalakis","year":"2002","unstructured":"Patrikalakis, N.M., Maekawa, T.: Chapter 25: Intersection problems. In: Farin, G., Hoschek, J., Kim, M.S. (eds.) Handbook of Computer Aided Geometric Design. Elsevier, Amsterdam, The Netherlands (2002)"},{"key":"9048_CR22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-8396(86)90025-7","volume":"3","author":"T.W. Sederberg","year":"1986","unstructured":"Sederberg, T.W.: Improperly parametrized rational curves. Comput. Aided Geom. Des. 3, 67\u201375 (1986)","journal-title":"Comput. Aided Geom. Des."},{"key":"9048_CR23","volume-title":"Handbook of Computer Aided Geometric Design","author":"T.W. Sederberg","year":"2002","unstructured":"Sederberg, T.W., Zheng, J.: Chapter 15: Algebraic methods for computer aided geometric design. In: Farin, G., Hoschek, J., Kim, M.S. (eds.) Handbook of Computer Aided Geometric Design. Elsevier, Amsterdam, The Netherlands (2002)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-006-9048-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-006-9048-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-006-9048-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:07Z","timestamp":1559365687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-006-9048-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,23]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,12,8]]}},"alternative-id":["9048"],"URL":"https:\/\/doi.org\/10.1007\/s11075-006-9048-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,23]]}}}