期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
High accuracy eigensolution and its extrapolation for potential equations
1
作者 程攀 黄晋 曾光 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2010年第12期1527-1536,共10页
From the potential theorem, the fundamental boundary eigenproblems can be converted into boundary integral equations (BIEs) with the logarithmic singularity. In this paper, mechanical quadrature methods (MQMs) are... From the potential theorem, the fundamental boundary eigenproblems can be converted into boundary integral equations (BIEs) with the logarithmic singularity. In this paper, mechanical quadrature methods (MQMs) are presented to obtain the eigensolutions that are used to solve Laplace's equations. The MQMs possess high accuracy and low computation complexity. The convergence and the stability are proved based on Anselone's collective and asymptotical compact theory. An asymptotic expansion with odd powers of the errors is presented. By the h3-Richardson extrapolation algorithm (EA), the accuracy order of the approximation can be greatly improved, and an a posteriori error estimate can be obtained as the self-adaptive algorithms. The efficiency of the algorithm is illustrated by examples. 展开更多
关键词 potential equation mechanical quadrature method Richardson extrapolation algorithm a posteriori error estimate
下载PDF
Extrapolated Smoothing Descent Algorithm for Constrained Nonconvex and Nonsmooth Composite Problems
2
作者 Yunmei CHEN Hongcheng LIU Weina WANG 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2022年第6期1049-1070,共22页
In this paper,the authors propose a novel smoothing descent type algorithm with extrapolation for solving a class of constrained nonsmooth and nonconvex problems,where the nonconvex term is possibly nonsmooth.Their al... In this paper,the authors propose a novel smoothing descent type algorithm with extrapolation for solving a class of constrained nonsmooth and nonconvex problems,where the nonconvex term is possibly nonsmooth.Their algorithm adopts the proximal gradient algorithm with extrapolation and a safe-guarding policy to minimize the smoothed objective function for better practical and theoretical performance.Moreover,the algorithm uses a easily checking rule to update the smoothing parameter to ensure that any accumulation point of the generated sequence is an(afne-scaled)Clarke stationary point of the original nonsmooth and nonconvex problem.Their experimental results indicate the effectiveness of the proposed algorithm. 展开更多
关键词 Constrained nonconvex and nonsmooth optimization Smooth approximation Proximal gradient algorithm with extrapolation Gradient descent algorithm Image reconstruction
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部