摘要
Wepresentafastalgorithmbasedonpolynomialinterpolationtoapproximatematricesarisingfromthediscretizationofsecond-kindintegralequationswherethekernelfunctioniseithersmooth,non-oscillatoryandpossessingonlyafinitenumberofsingularitiesoraproductofsuchfunctionwithahighlyoscillatorycoefficientfunction.Contrasttowavelet-likeapproximations,ourapproximationmatrixisnotsparse.However,theapproximationcanbeconstrucedinO(n)operationsandrequiresO(n)storage,wherenisthenumberofquadraturepointsusedinthediscretization.Moreover,thematrix-vectormultiplicationcostisoforderO(nlogn).Thusourschemeiswellsuitableforconjugategradienttypemethods.Ournumericalresultsindicatethatthealgorithmisveryaccurateandstableforhighdegreepolynomialinterpolation.
出版日期
1998年01月11日（中国期刊网平台首次上网日期，不代表论文的发表时间）
