{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:09Z","timestamp":1725662829238},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_130","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:26:30Z","timestamp":1330187190000},"page":"93-107","source":"Crossref","is-referenced-by-count":0,"title":["A survey of recent problems and results in analytic computational complexity"],"prefix":"10.1007","author":[{"given":"B.","family":"Kacewicz","sequence":"first","affiliation":[]},{"given":"H.","family":"Wo\u017aniakowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Brent, R.P., \"The computational complexity of iterative methods for systems of nonlinear equations\", Proc. Complexity Symposium, Yorktown Heights, N.Y., Plenum Press, New York.","DOI":"10.1007\/978-1-4684-2001-2_7"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Brent, R.P., \"A class of optimal-order zero-finding methods using derivative evaluations\", in Analytic Computational Complexity, edited by J. F. Traub, Academic Press 1976, pp. 59\u201373.","DOI":"10.1016\/B978-0-12-697560-4.50009-5"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Winograd, S., Wolfe, P., \"Optimal iterative processes for root-finding,\" Numer.Math., 20, pp. 327\u2013341.","DOI":"10.1007\/BF01402555"},{"key":"8_CR4","unstructured":"Jankowska, J., \"Multivariate secant method\", Ph.D.thesis, University of Warsaw, to appear in SIAM J. on Num.Anal."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Kacewicz, B., \"Integrals with kernel in the solution of nonlinear equations in N dimensions\", Computer Science Department Report, Carnegie-Mellon University, 1975.","DOI":"10.1016\/B978-0-12-697560-4.50012-5"},{"issue":"4","key":"8_CR6","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/321850.321860","volume":"21","author":"K. T. Kung","year":"1974","unstructured":"Kung, K.T., Traub, J.F., \"Optimal order of one-point and multipoint iterations\" J.Assoc.Comput.Mach. Vol. 21, No. 4, 1974, pp. 643\u2013651.","journal-title":"J.Assoc.Comput.Mach."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Meersman, R., \"Optimal use of information in certain iterative processes\", in Analytic Computational Complexity, Academic Press 1976, pp. 109\u2013125.","DOI":"10.1016\/B978-0-12-697560-4.50011-3"},{"key":"8_CR8","unstructured":"Nowo\u017cy\u0144ski, K., Wasilkowski, G., \"Global convergence of interpolatory iterations in the scalar case\", to appear"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Traub, J.F., Wo\u017aniakowski, H., \"Strict lower and upper bounds on iterative computational complexity\", in Analytic Computational Complexity, Academic Press 1976, pp. 15\u201334.","DOI":"10.1016\/B978-0-12-697560-4.50007-1"},{"key":"8_CR10","unstructured":"\"Optimal radius of convergence of interpolatory iterations for operator equations\", Dept. of Computer Science Report, Carnegie-Mellon University, 1976."},{"key":"8_CR11","unstructured":"\"Optimal linear information for the solution of nonlinear equations\", Algorithms and Complexity, New Directions and Recent Results, edited by J.F. Traub, Academic Press 1976."},{"key":"8_CR12","unstructured":"\"Convergence and complexity of interpolatory \u2014 Newton iteration in a Banach space\", Computer Science Department Report, Carnegie-Mellon University, 1977."},{"issue":"5","key":"8_CR13","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1137\/0711073","volume":"11","author":"H. Wo\u017aniakowski","year":"1974","unstructured":"Wo\u017aniakowski, H., \"Maximal stationary iterative methods for the solution of operator equations\", SIAM J.Numer.Anal., 11, 5, pp. 934\u2013949, 1974.","journal-title":"SIAM J.Numer.Anal."},{"issue":"1","key":"8_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0712012","volume":"12","author":"\"Generalized information and maximal order of iteration for operator equations\"","year":"1975","unstructured":"\"Generalized information and maximal order of iteration for operator equations\", SIAM J.Numer.Anal., 12,1,pp. 121\u2013135, 1975.","journal-title":"pe=\"Underline\">SIAM J.Numer.Anal."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"\"Maximal order of multipoint iterations using n evaluations\", in Analytic Computational Complexity, Academic Press 1976, pp. 75\u2013107.","DOI":"10.1016\/B978-0-12-697560-4.50010-1"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Rice, J.R., \"On the Computational Complexity of Approximation Operators II\", in Analytic Computational Complexity, Academic Press, 1976, 191\u2013205.","DOI":"10.1016\/B978-0-12-697560-4.50016-2"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Schultz, M.M., \"Complexity and Differential Equations\", in Analytic Computational Complexity, Academic Press, 1976, 143\u2013151.","DOI":"10.1016\/B978-0-12-697560-4.50013-7"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Winograd, S., \"Some Remarks on Proof Techniques in Analytic Complexity\", in Analytic Computational Complexity, Academic Press, 1976, 5\u201315.","DOI":"10.1016\/B978-0-12-697560-4.50006-X"},{"key":"8_CR19","unstructured":"Traub, J.F., \"Complexity of Sequential and Parallel Numericall Algorithms\", editor, Academic Press, 1973."},{"key":"8_CR20","unstructured":"Traub, J.F., \"Analytic Computational Complexity\", editor, Academic Press, 1976."},{"key":"8_CR21","unstructured":"Traub, J.F., \"Algorithms and Complexity: Recent Results and New Directions\", editor, Academic Press, 1976."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:33:10Z","timestamp":1687282390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_130","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}