L-矩阵的多参数预条件AOR迭代法

最近王广彬等人讨论了在预条件因子P=I+S′作用下的预条件AOR方法,推广了他们的预条件因子,提出了一个多参数的预条件因子P_α=I+S_α,并建立了新的预条件AOR迭代法与经典的AOR迭代法的比较定理.     

非线性不适定问题的双参数正则化

在Banach空间中, 研究一类非线性不适定问题的正则化. 所研究的算子是多值的, 且是近似的. 假定原始问题是可解的, 利用带双参数的Tikhonov正则化方法构造出强收敛的逼近步骤. 所得结论是前人结论的推广和延拓.     

正则参数求解的微分进化算法

研究了正则化方法中正则参数的求解问题,提出了利用微分进化算法获取正则参数.微分进化算法属于全局最优化算法,具有鲁棒性强、收敛速度快、计算精度高的优点.把正则参数的求解问题转化为非线性优化问题,通过保持在解空间不同区域中各个点的搜索,以最大的概率找到问题的全局最优解,同时还利用数值模拟将此方法与广义交叉原理、L-曲线准则、逆最优准则等进行了对比,数值模拟结果表明该方法具有一定的可行性和有效性.     

应用正则化子建立求解不适定问题的正则化方法的探讨

根据紧算子的奇异系统理论,提出一种新的正则化子进而建立了一类新的求解不适定问题的正则化方法。分别通过正则参数的先验选取和后验确定方法,证明了正则解的收敛性并得到了其最优的渐近收敛阶;验证了应用Newton迭代法计算最佳参数的可行性。最后建立了当算子与右端均有扰动时相应的正则化求解策略。文中所述方法完善了一般优化正则化策略的构造理论。     

某种Hilbert尺度上的ТИФОНОВ正则化方法

该文考虑在某种Ｈｉｌｂｅｒｔ尺度上求解不适定问题的ТИФОНОВ正则化方法，讨论了对应的正则化解的收敛特征，并用此文的结果分析求解解析延拓问题的ｎ阶ТИФОНОВ正则化方法的性质。     

Tikhonov 正则化的饱和性与逆结果及后验参数选取 *

对解非线性不适定问题的Tikhonov正则化证明了饱和性与一些逆结果 ,并考虑了正则化参数的最优后验选取 .     

非线性不适定问题的Tikhonov正则化的参数选取方法

在Ｔｉｋｈｏｎｏｖ正则化中，如何选取正则参数极为重要，直至现在，仍有许多问题期待解决．本文对非线性不适定问题考虑了Ｔｉｋｈｏｎｏｖ正则化，提出了一个新的简单的正则参数的最优选取法，并对由此得到的正则参数，研究了Ｔｉｋｈｏｎｏｖ正则化解的收敛性，并且当ｘ－最小范数解满足“源条件”时，在适当的条件下，导出了最优收敛率．     

解非线性不适定算子方程的一种正则化Newton迭代法

本文探讨一种求解非线性不适定算子方程的正则化Newton迭代法.本文讨论了这种迭代法在一般条件下的收敛性以及其他的一些性质.这种迭代法结合确定迭代次数的残差准则有局部收敛性.     

Steepest Descent, CG, and Iterative Regularization of Ill-Posed Problems

The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date.     

Iterative Methods for Image Deblurring: A Matlab Object-Oriented Approach

In iterative image restoration methods, implementation of efficient matrix vector multiplication, and linear system solves for preconditioners, can be a tedious and time consuming process. Different blurring functions and boundary conditions often require implementing different data structures and algorithms. A complex set of computational methods is needed, each likely having different input parameters and calling sequences. This paper describes a set of Matlab tools that hide these complicated implementation details. Combining the powerful scientific computing and graphics capabilities in Matlab, with the ability to do object-oriented programming and operator overloading, results in a set of classes that is easy to use, and easily extensible.     

Estimation of the L-Curve via Lanczos Bidiagonalization

The L-curve criterion is often applied to determine a suitable value of the regularization parameter when solving ill-conditioned linear systems of equations with a right-hand side contaminated by errors of unknown norm. However, the computation of the L-curve is quite costly for large problems; the determination of a point on the L-curve requires that both the norm of the regularized approximate solution and the norm of the corresponding residual vector be available. Therefore, usually only a few points on the L-curve are computed and these values, rather than the L-curve, are used to determine a value of the regularization parameter. We propose a new approach to determine a value of the regularization parameter based on computing an L-ribbon that contains the L-curve in its interior. An L-ribbon can be computed fairly inexpensively by partial Lanczos bidiagonalization of the matrix of the given linear system of equations. A suitable value of the regularization parameter is then determined from the L-ribbon, and we show that an associated approximate solution of the linear system can be computed with little additional work.     

GMRES, L-Curves, and Discrete Ill-Posed Problems

The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. This paper discusses application of the GMRES method to the solution of large linear systems of equations that arise from the discretization of linear ill-posed problems. These linear systems are severely ill-conditioned and are referred to as discrete ill-posed problems. We are concerned with the situation when the right-hand side vector is contaminated by measurement errors, and we discuss how a meaningful approximate solution of the discrete ill-posed problem can be determined by early termination of the iterations with the GMRES method. We propose a termination criterion based on the condition number of the projected matrices defined by the GMRES method. Under certain conditions on the linear system, the termination index corresponds to the vertex of an L-shaped curve.     

MATLAB中大型线性方程组的非定常迭代法

科学研究和大型工程设计中很多问题以非线性数学模型来描述,而这些数学模型求解常常归结为各种大型线性方程组的求解,因而能否有效地求解大型线性方程组,特别是病态的方程组,是非常关键的.本文介绍了MATLAB中求解大型线性方程组常用的非定常迭代法,并以GMRES算法为例介绍了算法的数学描述.     

Modified Iterative Runge-Kutta-Type Methods for Nonlinear Ill-Posed Problems

This work is devoted to the convergence analysis of a modified Runge-Kutta-type iterative regularization method for solving nonlinear ill-posed problems under a priori and a posteriori stopping rules. The convergence rate results of the proposed method can be obtained under a Hölder-type sourcewise condition if the Fréchet derivative is properly scaled and locally Lipschitz continuous. Numerical results are achieved by using the Levenberg-Marquardt, Lobatto, and Radau methods.     

Preconditioning Indefinite Systems in Interior Point Methods for Optimization

Every Newton step in an interior-point method for optimization requires a solution of a symmetric indefinite system of linear equations. Most of today's codes apply direct solution methods to perform this task. The use of logarithmic barriers in interior point methods causes unavoidable ill-conditioning of linear systems and, hence, iterative methods fail to provide sufficient accuracy unless appropriately preconditioned. Two types of preconditioners which use some form of incomplete Cholesky factorization for indefinite systems are proposed in this paper. Although they involve significantly sparser factorizations than those used in direct approaches they still capture most of the numerical properties of the preconditioned system. The spectral analysis of the preconditioned matrix is performed: for convex optimization problems all the eigenvalues of this matrix are strictly positive. Numerical results are given for a set of public domain large linearly constrained convex quadratic programming problems with sizes reaching tens of thousands of variables. The analysis of these results reveals that the solution times for such problems on a modern PC are measured in minutes when direct methods are used and drop to seconds when iterative methods with appropriate preconditioners are used.     

Family of Projected Descent Methods for Optimization Problems with Simple Bounds

This paper presents a family of projected descent direction algorithms with inexact line search for solving large-scale minimization problems subject to simple bounds on the decision variables. The global convergence of algorithms in this family is ensured by conditions on the descent directions and line search. Whenever a sequence constructed by an algorithm in this family enters a sufficiently small neighborhood of a local minimizer satisfying standard second-order sufficiency conditions, it gets trapped and converges to this local minimizer. Furthermore, in this case, the active constraint set at is identified in a finite number of iterations. This fact is used to ensure that the rate of convergence to a local minimizer, satisfying standard second-order sufficiency conditions, depends only on the behavior of the algorithm in the unconstrained subspace. As a particular example, we present projected versions of the modified Polak–Ribière conjugate gradient method and the limited-memory BFGS quasi-Newton method that retain the convergence properties associated with those algorithms applied to unconstrained problems.     

An L-ribbon for large underdetermined linear discrete ill-posed problems

The L-curve is a popular aid for determining a suitable value of the regularization parameter when solving ill-conditioned linear systems of equations with a right-hand side vector, which is contaminated by errors of unknown size. However, for large problems, the computation of the L-curve can be quite expensive, because the determination of a point on the L-curve requires that both the norm of the regularized approximate solution and the norm of the corresponding residual vector be available. Recently, an approximation of the L-curve, referred to as the L-ribbon, was introduced to address this difficulty. The present paper discusses how to organize the computation of the L-ribbon when the matrix of the linear system of equations has many more columns than rows. Numerical examples include an application to computerized tomography.     

Fast Iterative Methods for Solving of Boundary Nonlinear Integral Equations with Singularity

A very efficient and fully discrete method for numerical solution of boundary nonlinear integral equation is described. There seems a lack of rigorous numerical analysis because of singular or hypersingular behavior. In this paper, we suggest variants of methods for solving numerical solutions. Moreover, our aim has been to show how the iterations can be effectively and efficiently regularized for solving ill-posed problems by using the preconditioner. We have compared these methods with CPU time and iterations. Finally, some numerical examples show the efficiency of the proposed methods.