{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:21Z","timestamp":1725487101742},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418146"},{"type":"electronic","value":"9783540452621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45262-1_21","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T16:29:48Z","timestamp":1183393788000},"page":"170-178","source":"Crossref","is-referenced-by-count":6,"title":["Robust Preconditioning of Dense Problems from Electromagnetics"],"prefix":"10.1007","author":[{"given":"B.","family":"Carpentieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. S.","family":"Duff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Giraud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1137\/S1064827594271421","volume":"17","author":"M. Benzi","year":"1996","unstructured":"M. Benzi, C. D. Meyer, and M. T\u016fma. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Scientific Computing, 17:1135\u20131149, 1996.","journal-title":"SIAM J. Scientific Computing"},{"key":"21_CR2","unstructured":"B. Carpentieri, I. S. Du., and L. Giraud. Sparse pattern selection strategies for robust frobenius norm minimization preconditioners in electromagnetism. Technical Report TR\/PA\/00\/05, CERFACS, Toulouse, France, 1999. To Appear in Numerical Linear Algebra with Applications."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/0914029","volume":"14","author":"R. W. Freund","year":"1993","unstructured":"R. W. Freund. A transpose-free quasi-minimal residual algorithm for non-hermitian linear systems. SIAM J. Scientific Computing, 14(2):470\u2013482, 1993.","journal-title":"SIAM J. Scientific Computing"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"R. W. Freund","year":"1991","unstructured":"R. W. Freund and N. M. Nachtigal. QMR: a quasi-minimal residual method for non-hermitian linear systems. Numerische Mathematik, 60(3):315\u2013339, 1991.","journal-title":"Numerische Mathematik"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S1064827594276552","volume":"18","author":"M. Grote","year":"1997","unstructured":"M. Grote and T. Huckle. Parallel preconditionings with sparse approximate inverses. SIAM J. Scientific Computing, 18:838\u2013853, 1997.","journal-title":"SIAM J. Scientific Computing"},{"key":"21_CR6","unstructured":"J. Rahola. Experiments on iterative methods and the fast multipole method in electromagnetic scattering calculations. Technical Report TR\/PA\/98\/49, CERFACS, Toulouse, France, 1998."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/TAP.1982.1142818","volume":"AP-30","author":"S. M. Rao","year":"1982","unstructured":"S. M. Rao, D. R. Wilton, and A. W. Glisson. Electromagnetic scattering by surfaces of arbitrary shape. IEEE Trans. Antennas Propagat., AP-30:409\u2013418, 1982.","journal-title":"IEEE Trans. Antennas Propagat"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y. Saad","year":"1986","unstructured":"Y. Saad and M. H. Schultz. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Scientific and Statistical Computing, 7:856\u2013869, 1986.","journal-title":"SIAM J. Scientific and Statistical Computing"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"H. A. Vorst van der","year":"1992","unstructured":"H. A. van der Vorst. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Scientific and Statistical Computing, 13:631\u2013644, 1992.","journal-title":"SIAM J. Scientific and Statistical Computing"}],"container-title":["Lecture Notes in Computer Science","Numerical Analysis and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45262-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T15:47:35Z","timestamp":1550418455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45262-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418146","9783540452621"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45262-1_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}