文献类型：期刊文献

中文题名：基于0-保留扰动的高斯算法平滑复杂度分析

英文题名：Smoothed Analysis of Gaussian Algorithm Based on Zero-Preserving Perturbations

作者：杨智应[1];雷向欣[2];朱洪[3]

机构：[1]上海海事大学计算机科学与工程系,上海200135;[2]华东理工大学计算机科学与工程系,上海200237;[3]复旦大学计算机科学与工程系,上海200433

年份：2006

卷号：17

期号：10

起止页码：2057

中文期刊名：软件学报

外文期刊名：Journal of Software

收录：CSTPCD;;EI(收录号：20064910289453);Scopus;北大核心:【北大核心2004】；CSCD:【CSCD2011_2012】；

基金：Nos.60496321;60373021(国家自然科学基金);No.05FZ14(上海市教委科技项目);No.XL0101-2(上海海事大学航运信息工程重点学科基金)~~

语种：中文

中文关键词：平滑复杂度;0-保留扰动;矩阵条件数;对称矩阵

外文关键词：smoothed complexity; zero-preserving perturbations; condition number of matrix; symmetric matrix

摘要：算法的平滑复杂度能够更合理地反映算法的实际性能.在运行高斯算法求解线性系统过程中,矩阵条件数是导致求解误差偏大的一个因素.Sankar等人用0-保留高斯扰动进行对称矩阵条件数平滑分析.然而,Sankar等人给出的平滑复杂度过高而且复杂.为了解决这个问题,首先提出了两个关键的不等式;然后将这两个不等式用于对称矩阵条件数的平滑分析,得到更简单、更低的平滑复杂度;并利用该结果对高斯算法求解精度进行平滑分析,从而得到更低的平滑复杂度.
Smoothed complexity of algorithm can explain the practical performance of algorithm more efficiently. Condition number of matrix is a main root to result in large error in solution during the running of Gaussian algorithm. Sankar, et al. performed a smoothed analysis of condition number of symmetric matrix under zero-preserving perturbations. However, the smoothed complexity presented by Sankar, et al. was higher and more complicated. To solve this problem, two key inequalities are presented. The inequalities are used to improving the smoothed complexity of condition number of symmetric matrix. The smoothed analysis of bits of precision needed by using Gaussian algorithm is performed and lower smoothed complexity is presented.