This paper proposes a verification method for sparse linear systems $Ax=b$ with general and nonsingular coefficients. A verification method produces the error bound for a given approximate solution. Conventional methods use one of two approaches. One approach is to verify the computed solution of the normal equation $A^TAx=A^Tb$ by exploiting symmetric and positive definiteness; however, the condition number of $A^TA$ is the square of that for $A$. The other approach uses an approximate inverse matrix of the coefficient; however, the approximate inverse may be dense even if $A$ is sparse. Here, we propose a method for the verification of solutions of sparse linear systems based on $LDL^T$ decomposition. The proposed method can reduce the fill-in and is applicable to many problems. Moreover, an efficient iterative refinement method is proposed for obtaining accurate solutions.
Sparse polynomial approximation for optimal control problems constrained by elliptic PDEs with lognormal random coefficients
Oden Institute for Computational Engineering & Sciences, The University of Texas at Austin(德克萨斯大学奥斯汀分校奥登计算工程与科学学院);Department of Mechanical Engineering, and Department of Geological Sciences, The University of Texas at Austin(德克萨斯大学奥斯汀分校机械工程系和地质科学系)
Reconstructing sparse exponential polynomials from samples: Stirling numbers and Hermite interpolation
Lehrstuhl für Mathematik mit Schwerpunkt Digitale Bildverarbeitung & FORWISS, University of Passau(帕绍大学数字图像处理重点数学研究所与FORWISS);University of Passau(帕绍大学)
On Expansions and Nodes for Sparse Grid Collocation of Lognormal Elliptic PDEs
这项工作是一个后续行动,我们以前的贡献(“收敛的稀疏配置函数可数许多高斯随机变量(与应用椭圆偏微分方程)",SIAM J。肛门,2018),并包含使用稀疏网格求解对数正态扩散系数的椭圆偏微分方程的某些方面的进一步见解。具体地,我们首先关注单变量插值规则的选择,提倡使用由Narayan和Jakeman引入的高斯Leja点(“Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation”,SIAM J. Sci.计算:2014),然后讨论用Lévy-Ciesielski展开代替扩散系数的标准Karhunen-Loève展开的可能的计算优势,其动机是Bachmayr、Cohen、DeVore和Migliorati的理论工作(“参数椭圆偏微分方程的稀疏多项式逼近.第二部分:对数正态系数”,ESAIM:M2 AN,2016)。我们的数值结果表明,对于所考虑的问题,高斯Leja配置点优于高斯-埃尔米特和Genz-Keister节点的稀疏网格近似和对数扩散系数的Karhunen-Loève展开比其Lévy-Ciesielski展开的稀疏网格配置的目的更合适。
Balance-Guided Sparse Identification of Multiscale Nonlinear PDEs with Small-coefficient Terms
State Key Laboratory of Nonlinear Mechanics, Institute of Mechanics, Chinese Academy of Sciences, Beijing 100190, China(非线性力学国家重点实验室,力学研究所,中国科学院,北京100190,中国);School of Engineering Sciences, University of Chinese Academy of Sciences, Beijing 100049, China(中国科学院大学工程科学学院,北京100049,中国);School of Mathematics and Statistics, Northwestern Polytechnical University, Xi'an 710072, China(西北工业大学数学与统计学院,西安710072,中国)