Perturbation Analysis and Randomized Algorithms for Large-Scale Total Least Squares Problems

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:xyfan
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In this talk,we present perturbation analysis for the total least squares(TLS)problems and develop randomized algorithms for the TLS and the truncated total least squares(TTLS)solutions of large-scale discrete illposed problems.
其他文献
  We focus on the following questions of random graph and complex networks.How to classify the structure of different random growing networks?How do the dynam
会议
  For a ROM to be stable and accurate,the dynamics of the truncated subspace must be accounted for.This talk proposes an approach for stabilizing and fine-tun
会议
  We propose a decomposition approach for uncertainty analysis of systems governed by partial differential equations(PDEs).
会议
  Energy corrected schemes compensate the pollution effect for finite element problems where local point singularities otherwise lead to a globally reduced or
会议
  We present a computational reduction framework for efficient and accurate solution of Bayesian inverse problems on high-or infinitedimensional parameter spa
会议
  The emergence of rectangular spectral collocation methods offers a novel but more flexible and robust way to implement boundary conditions.Moreover,it has a
会议
  Following Bornemann's work on computing Taylor coefficients to high precision by contour integrals over circles of large radius,Wang and Huybrechs have rece
会议
  From fracture mechanics and fluid dynamics to acoustic and electromagnetic scattering,boundary integral equations reduce the dimensionality of the underlyin
会议
  Integer least squares(ILS)problems arise from many applications.We first review some theory about ILS estimation.
会议
  Inspired by the successive projection method,some efficient hybrid algorithms with active-set methods are presented,which make active-set methods suitable f
会议