乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T06:27:11Z","timestamp":1719988031944},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1016\/j.cam.2012.09.024","type":"journal-article","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T19:33:15Z","timestamp":1349551995000},"page":"185-212","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["Accurate solution of dense linear systems, Part II: Algorithms using directed rounding"],"prefix":"10.1016","volume":"242","author":[{"given":"Siegfried M.","family":"Rump","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2012.09.024_br000005","series-title":"Developments in Reliable Computing","first-page":"77","article-title":"INTLAB\u2014INTerval LABoratory","author":"Rump","year":"1999"},{"key":"10.1016\/j.cam.2012.09.024_br000010","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1145\/198429.198433","article-title":"Intlib: a portable Fortran-77 interval standard function library","volume":"20","author":"Kearfott","year":"1994","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/j.cam.2012.09.024_br000015","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02307379","article-title":"PROFIL\/BIAS\u2014a fast interval library","volume":"53","author":"Kn\u00fcppel","year":"1994","journal-title":"Computing"},{"key":"10.1016\/j.cam.2012.09.024_br000020","unstructured":"O. Kn\u00fcppel, T. Simenec, PROFIL\/BIAS extensions, Technical Report 93.5, Forschungsschwerpunkt Informations-und Kommunikationstechnik, Technische Universit\u00e4t Hamburg-Harburg, 1993."},{"key":"10.1016\/j.cam.2012.09.024_br000025","unstructured":"J. Zemke, b4m\u2014BIAS for Matlab, Technical Report, Inst. f. Informatik III, Technische Universit\u00e4t Hamburg-Harburg, 1998."},{"key":"10.1016\/j.cam.2012.09.024_br000030","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1009997221089","article-title":"A simple derivation of the Hansen\u2013Bliek\u2013Rohn\u2013Ning\u2013Kearfott enclosure for linear interval equations","volume":"5","author":"Neumaier","year":"1999","journal-title":"Reliab. Comput."},{"key":"10.1016\/j.cam.2012.09.024_br000035","series-title":"Topics in Matrix Analysis","author":"Horn","year":"1991"},{"issue":"1","key":"10.1016\/j.cam.2012.09.024_br000040","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1137\/S0895479898348829","article-title":"On the iterative criterion for generalized diagonally dominant matrices","volume":"24","author":"Li","year":"2002","journal-title":"SIAM J. Matrix Anal. Appl. (SIMAX)"},{"key":"10.1016\/j.cam.2012.09.024_br000045","series-title":"Matrix Iterative Analysis","author":"Varga","year":"1962"},{"key":"10.1016\/j.cam.2012.09.024_br000050","series-title":"Handbook of Floating-Point Arithmetic","author":"Muller","year":"2010"},{"key":"10.1016\/j.cam.2012.09.024_br000055","unstructured":"ANSI\/IEEE 754-1985: IEEE Standard for Binary Floating-Point Arithmetic, New York, 1985."},{"key":"10.1016\/j.cam.2012.09.024_br000060","unstructured":"ANSI\/IEEE 754-2008: IEEE Standard for Floating-Point Arithmetic, New York, 2008."},{"issue":"4","key":"10.1016\/j.cam.2012.09.024_br000065","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s002110100310","article-title":"Fast verification of solutions of matrix equations","volume":"90","author":"Oishi","year":"2002","journal-title":"Numer. Math."},{"key":"10.1016\/j.cam.2012.09.024_br000070","series-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham","year":"2002"},{"key":"10.1016\/j.cam.2012.09.024_br000075","series-title":"Encyclopedia of Mathematics and its Applications","article-title":"Interval methods for systems of equations","author":"Neumaier","year":"1990"},{"issue":"3","key":"10.1016\/j.cam.2012.09.024_br000080","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1023\/A:1022374804152","article-title":"Fast and parallel interval arithmetic","volume":"39","author":"Rump","year":"1999","journal-title":"BIT"},{"key":"10.1016\/j.cam.2012.09.024_br000085","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02234767","article-title":"Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken","volume":"4","author":"Krawczyk","year":"1969","journal-title":"Computing"},{"key":"10.1016\/j.cam.2012.09.024_br000090","unstructured":"S.M. Rump, Kleine Fehlerschranken bei Matrixproblemen, Ph.D. Thesis, Universit\u00e4t Karlsruhe, 1980."},{"key":"10.1016\/j.cam.2012.09.024_br000095","unstructured":"G. Hargreaves, Interval analysis in MATLAB, Master\u2019s Thesis, University of Manchester, 2002. http:\/\/www.manchester.ac.uk\/mims\/eprints."},{"key":"10.1016\/j.cam.2012.09.024_br000100","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1137\/0729086","article-title":"Bounding the solution set of interval linear systems","volume":"29","author":"Hansen","year":"1992","journal-title":"SIAM J. Numer. Anal. (SINUM)"},{"key":"10.1016\/j.cam.2012.09.024_br000105","unstructured":"C. Bliek, Computer methods for design automation, Ph.D. Dissertation, Massachusetts Institute of Technology MIT, 1992."},{"key":"10.1016\/j.cam.2012.09.024_br000110","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(93)90077-T","article-title":"Stability of the optimal basis of a linear program under uncertainty","volume":"13","author":"Rohn","year":"1993","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.cam.2012.09.024_br000115","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1137\/S0036142994270995","article-title":"A comparison of some methods for solving linear interval equations","volume":"34","author":"Ning","year":"1997","journal-title":"SIAM J. Numer. Anal. (SINUM)"},{"key":"10.1016\/j.cam.2012.09.024_br000120","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1009933709726","article-title":"Erratum to: a simple derivation of the Hansen\u2013Bliek\u2013Rohn\u2013Ning\u2013Kearfott enclosure for linear interval equations","volume":"6","author":"Neumaier","year":"1999","journal-title":"Reliab. Comput."},{"key":"10.1016\/j.cam.2012.09.024_br000125","unstructured":"A. Neumaier, private communication, 2010."},{"key":"10.1016\/j.cam.2012.09.024_br000130","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01213466","article-title":"Checking robust nonsingularity is NP-hard","volume":"6","author":"Poljak","year":"1993","journal-title":"Math. Control Signals Systems"},{"key":"10.1016\/j.cam.2012.09.024_br000135","first-page":"6","article-title":"Optimal solution of interval linear systems is intractable (NP-hard)","volume":"1","author":"Kreinovich","year":"1993","journal-title":"Interval Comput."},{"key":"10.1016\/j.cam.2012.09.024_br000140","series-title":"Applications of Interval Computations","first-page":"81","article-title":"Linear interval equations: computing enclosures with bounded relative or absolute overestimation is NP-hard","author":"Rohn","year":"1991"},{"issue":"2","key":"10.1016\/j.cam.2012.09.024_br000145","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1009901405160","article-title":"Computing exact bounds on elements of an inverse interval matrix is NP-hard","volume":"5","author":"Coxson","year":"1999","journal-title":"Reliab. Comput."},{"key":"10.1016\/j.cam.2012.09.024_br000150","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-7091-6033-6_13","article-title":"Fast inclusion and residual iteration for solutions of matrix equations","volume":"16","author":"Ogita","year":"2002","journal-title":"Comput. Suppl."},{"key":"10.1016\/j.cam.2012.09.024_br000155","series-title":"Fast Verification of Solutions for Sparse Monotone Matrix Equations","first-page":"175","volume":"vol. 15","author":"Ogita","year":"2001"},{"key":"10.1016\/j.cam.2012.09.024_br000160","doi-asserted-by":"crossref","unstructured":"H.D. Nguyen, N. Revol, Accuracy issues in linear algebra using interval arithmetic, SCAN Conference Lyon, 2010.","DOI":"10.1145\/1837210.1837236"},{"key":"10.1016\/j.cam.2012.09.024_br000165","doi-asserted-by":"crossref","unstructured":"H.D. Nguyen, Efficient algorithms for verified scientific computing: numerical linear algebra using interval arithmetic, Dissertation, Laboratoire LIP, INRIA ENS Lyon, 2011.","DOI":"10.1145\/1837210.1837236"},{"key":"10.1016\/j.cam.2012.09.024_br000170","series-title":"Topics in Validated Computations\u2014Studies in Computational Mathematics","first-page":"63","article-title":"Verification methods for dense and sparse systems of equations","author":"Rump","year":"1994"},{"issue":"1","key":"10.1016\/j.cam.2012.09.024_br000175","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0724017","article-title":"Overestimation in linear interval equations","volume":"24","author":"Neumaier","year":"1987","journal-title":"SIAM J. Numer. Anal. (SINUM)"},{"key":"10.1016\/j.cam.2012.09.024_br000180","doi-asserted-by":"crossref","DOI":"10.1016\/0022-247X(89)90357-0","article-title":"Rigorous sensitivity analysis for parameter-dependent systems of equations","volume":"144","author":"Neumaier","year":"1989","journal-title":"J. Math. Anal. Appl."},{"issue":"10","key":"10.1016\/j.cam.2012.09.024_br000185","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1090\/S0025-5718-1990-1011445-5","article-title":"Rigorous sensitivity analysis for systems of linear and nonlinear equations","volume":"54","author":"Rump","year":"1990","journal-title":"Math. Comp."},{"key":"10.1016\/j.cam.2012.09.024_br000190","unstructured":"J. Rohn, VERSOFT: verification software in MATLAB\/INTLAB, 2009."},{"issue":"151","key":"10.1016\/j.cam.2012.09.024_br000195","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1090\/S0025-5718-1980-0572859-4","article-title":"Iterative refinement implies numerical stability for Gaussian elimination","volume":"35","author":"Skeel","year":"1980","journal-title":"Math. Comp."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042712003974?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042712003974?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T13:05:01Z","timestamp":1562245501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042712003974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":39,"alternative-id":["S0377042712003974"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2012.09.024","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}