*0011416137
*008060802s2006    xx#           000 0 eng
*019  $bk
*08230$a512.5
*100  $aRump, Siegfried M.$uInstitute for Reliable Computing, Hamburg University of Technology, Hamburg, Germany ; Faculty of Science and Engineering, Waseda University, Tokyo, Japan ; rump@tu-harburg.de$_159406600
*245  $aVerification of positive definiteness
*300  $aS. [433]-452
*500  $aVitenskapelig artikkel
*5208 $aInneholder sammendrag
*600  $aCholesky, André-Louis$_159406700
*650  $aAlgoritmer$2norart$_23241100
*650  $aCholesky dekomponering$9nor$2norart$_159406800
*650  $aLineær algebra$2norart$_13445000
*650  $aMatriser$2norart$_22015400
*650  $afeilanalyse$9nor$2norart$_159118900
*653  $aCholesky decomposition$9eng$_159406900
*653  $aINTLAB$9eng$_159407000
*653  $apositive definite$9eng$_159407100
*653  $arigorous error bounds$9eng$_159407200
*653  $aself-validating methods$9eng$_159407300
*653  $asemidefinite programming$9eng$_159407400
*653  $averification$9eng$_130429700
*773  $tBIT : numerical mathematics$gVol. 46, no. 2 (2006)$x0006-3835$w(NO-LaBS)655878(tnr)
*8564 $uhttps://doi.org/10.1007/s10543-006-0056-1
*999  $z600392676$anorart:600392676
^