相位恢复:理论、模型与算法

相位恢复在多个不同领域均被提出,如量子力学、光学成像等.相位恢复即具有多种应用背景,亦具有丰富的数学内涵,因而近期该问题吸引了多个不同领域专家的关注,如计算数学、数据科学、最优化、代数几何等.本文将主要介绍相位恢复中的理论基础问题,特别是最少观测次数问题,并介绍求解相位恢复的模型性能,以及求解算法等.本文也介绍了一些当前相位恢复中研究的热点方向.     

导数小片插值恢复技术与超收敛性

１．引言 有限元超收敛的研究自七十年代起至今方兴未艾．现有的研究工作基本遵循两种途径：一是找出有限元插值逼近的超收敛点,然后再利用插值弱估计等手段导出有限元解本身所具有的超收敛性质［１,２］;二是利用各种后处理技术,如平均技术,投影技术,外插技术和插值有限元技术等[3,6],来导出经过后处理的有限元解的超收敛性．近年来一种新的超收敛后处理技术,即所谓的“Ｚ-Ｚ导数小片恢复技术”,得到众多的研究［７-１１］,并被 Ｂａｂｕｓｋａ等人认为是用于渐进准确的后验误差估计效果最好的技术之一［１２］．这种技术是利用…     

恢复记忆—平均首次离出时间的刻画

首次从一个吸引域的离子时间来研究神经网络中的记忆恢复问题。在时齐情形，我们分别给出了首次离出一个吸引域的时间和趋于平衡态的时间的估计。文中也考虑了非时齐情形，刻画了如何调整“温度”参数才能使过程永远停留在一个吸引子或最终离出一个吸引子。文中最后描述记忆之间的序关系。     

各向异性Besov类的最优恢复

本文讨论各向异性 Ｂｅｓｏｖ类 ＳＢ（Ｒd）在 Ｌp （Ｒd ）（１＜ p<∞）中及在Ｌｑ（Ｒｄ）（１＜ｐ≤ｑ≤２）中的最优恢复,得到了相应误差的弱渐近估计．     

可相位恢复p-框架的稳定性

相位恢复问题在物理和工程中有着广泛的应用.设X是Banach空间,1＜p＜∞.设Φ={xn}n∈I是X上的p-框架.若对任意x*,y*∈X*,等式|x*(xn)|=|y*(xn)|对任意n∈I成立蕴涵存在|α|=1使得x*=αy*,则称Φ是可相位恢复的.本文证明在有限维Banach空间上,可相位恢复p-框架是稳定的,但...     

一种新的Bregman迭代方法在信号恢复中的应用

本文结合残量Bregman迭代方法以及不动点迭代方法提出一种新迭代方法,将其应用于信号恢复问题.数值试验表明,新方法避免了Bregman迭代方法产生的停滞现象且较线性Bregman迭代方法更稳定、快速、有效.     

关于Rudin—Osher—Fatemi图像恢复模型特性的一个注记

本文分析了ROF(Rudin-Osher-Fatemi)模型并给出了它的几何特性.根据不同的目的,对ROF模型来说,可以完全从给定的观察图像来选择特殊的参数λ的值.     

恢复率正比于总人数的多传染阶段的艾滋病模型及其性态

文 [1 ]、[2 ]和 [3]主要是建立多传染阶段的艾滋病模型 ,并根据各自建立的模型 ,来讨论疾病传染的消除平衡态与流行平衡态以及它们的稳定性 .本文首先对文 [3]中的模型作适当的改进 ,再根据改进的数学模型来分析疾病传染的动态性质 ,着重讨论多传染阶段情况下艾滋病传染的持久性及其对总人数的影响 .     

图像盲恢复算法的研究

在点扩展函数未知的情况下,仅通过退化图像来估计原始图像的过程称为图像盲恢复.目前,图像盲恢复已成为数字图像处理领域一个前沿热点课题,有着广泛的应用.国内外诸多学者对图像盲恢复算法已经做了深入广泛的研究.对已提出的图像盲恢复算法进行了分类比较研究,并提出了进一步研究的发展方向.     

基于相机标定的双目三维景物重建方法

介绍了一种基于相机标定的双目静止镜头下的三维景物重建方法.方法假设已经通过相机标定的方法得到两个相机的内外投影矩阵参数,通过投影矩阵和几何的方法,配合图像配准技术,恢复感兴趣场景的深度信息,达到三维景物重建的目的.本方法主要是基于几何变换的方法,巧妙避开了三维投影矩阵的计算,直接从真实图像映射为虚拟极平面图像,可以达到比较好的效果.     

Long-step primal-dual target-following algorithms for linear programming

In this paper we propose a long-step target-following methodology for linear programming. This is a general framework, that enables us to analyze various long-step primal-dual algorithms in the literature in a short and uniform way. Among these are long-step central and weighted path-following methods and algorithms to compute a central point or a weighted center. Moreover, we use it to analyze a method with the property that starting from an initial noncentral point, generates iterates that simultaneously get closer to optimality and closer to centrality.This work is completed with the support of a research grant from SHELL.The first author is supported by the Dutch Organization for Scientific Research (NWO), grant 611-304-028.The fourth author is supported by the Swiss National Foundation for Scientific Research, grant 12-34002.92.     

Trefftz,collocation, and other boundary methods—A comparison

In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Volume preserving RK methods for linear systems

1. IntroductionIn recent yearss there has been a great interest in constructing numerical integrationschemes for ODEs in such a way that some qualitative geometrical properties of the solutionof the ODEs are exactly preserved. R.th[ll and Feng Kang[2'31 has proposed symplectic algorithms for Hamiltollian systems, and since then st ruct ure s- preserving me t ho ds fordynamical systems have been systematically developed[4--7]. The symplectic algorithms forHamiltonian systems, the volume-pre…     

求解离散不适定问题的正则化GMERR方法

迭代极小残差方法是求解大型线性方程组的常用方法, 通常用残差范数控制迭代过程.但对于不适定问题, 即使残差范数下降, 误差范数未必下降. 对大型离散不适定问题,组合广义最小误差(GMERR)方法和截断奇异值分解(TSVD)正则化方法, 并利用广义交叉校验准则(GCV)确定正则化参数,提出了求解大型不适定问题的正则化GMERR方法.数值结果表明, 正则化GMERR方法优于正则化GMRES方法.     

s个几乎相等的素数的k次方和(Ⅰ)

假定pθ‖k,当p=2,2|k时，γ=θ 2；其它情况时，γ=θ 1。而R＝П(p-1)|kp^γ。本文在GRH（广义Riemann假设下），证明了当s=2^k 1,1≤k≤11时，任何足够大的整N≡s(modR)都可以表示为s个几乎相等的素数的k次方程。     

Diagonalized multiplier methods and quasi-Newton methods for constrained optimization

Two approaches to quasi-Newton methods for constrained optimization problems inR ⁿ are presented. These approaches are based on a class of Lagrange multiplier approximation formulas used by the author in his previous work on Newton's method for constrained problems. The first approach is set in the framework of a diagonalized multiplier method. From this point of view, a new update rule for the Lagrange multipliers which depends on the particular quasi-Newton method employed is given. This update rule, in contrast to most other update rules, does not require exact minimization of the intermediate unconstrained problem. In fact, the optimal convergence rate is attained in the extreme case when only one step of a quasi-Newton method is taken on this intermediate problem. The second approach transforms the constrained optimization problem into an unconstrained problem of the same dimension.The author would like to thank J. Moré and M. J. D. Powell for comments related to the material in Section 13. He also thanks J. Nocedal for the computer results in Tables 1–3 and M. Wright for the results in Table 4, which were obtained via one of her general programs. Discussions with M. R. Hestenes and A. Miele regarding their contributions to this area were very helpful. Many individuals, including J. E. Dennis, made useful general comments at various stages of this paper. Finally, the author is particularly thankful to R. Byrd, M. Heath, and R. McCord for reading the paper in detail and suggesting many improvements.This work was supported by the Energy Research and Development Administration, Contract No. E-(40-1)-5046, and was performed in part while the author was visiting the Department of Operations Research, Stanford University, Stanford, California.     

A note on the biasing of Newton's direction

This note deals with the geometric interpretation of the Levenberg-Marquardt search direction when the augmented Hessian is not positive definite.     

投入产出技术在计划平衡中的理论与应用

在用投入产出技术作计划平衡时，目前一般采用最终产品法、总产品法及国民收入法等．本文从理论上研究了这些方法的可行性问题，并在此基础上提出一个较理想的综合法．最后附有实例并说明综合法的现实意义．     

A comparison of some ODE solvers which require Jacobian evaluations

A variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work per step) have been numerically tested and the results compared. They include implicit and explicit processes, and share the property that a Jacobian matrix must be evaluated at least once during the integration. Some of these processes have not been previously described in the literature.     

一种求解鞍点问题的广义对称超松弛迭代法

本文研究了鞍点问题的迭代算法.利用新的待定参数加速迭代格式并结合SSOR分裂的方法,获得了有两个参数的广义对称超松弛迭代法及其收敛性条件.数值例子表明选择适当的参数值可以提高算法的收敛效率,推广和改进了SOR-like迭代法.