【数值分析中连续问题的计算复杂性之研究】.pdf
申请理学博士学位论文 数值分析中连续问题的计算复杂性之研究 博士生:蒋田仔 专 业:计算数学与应用软件 导师:王兴华 答辩时间:一九九四年六月 杭州大学数学与信息科学系 一九九四年四月
目录 英义摘要 详细的中文综述和本文主要结果简介 Chapter iThe Average Case Complexity of the Fredholm Equation of the SecondKindwithFreeTerminH(I) Chapter 2The Worst Case Complexity of the Fredholm Equation of the SecondKindwithFree Term inHr(T) Chapter 3Probabilistir Analysis of Galerkin-methods forthe FredholmEquation
TheComputationalComplexityforContinuousProbleins in Nuinerical Analysis(Ph.D.Thesis) Doctoral Candidate:JiangTianzi Superviser:Prof.Wang Xinghua Department of Mathematics,Hangzhou University Hangzhou310028,PeoplesRepublicof China ABSTRAT Thepurpose ofthis thesisisto study thecomputational complexi