复双球面上变系数奇异积分方程的正则化

利用复双球面上的立体角系数的方法和置换公式,讨论复双球垒域上变系数奇异积分方程的正则化问题,推广了复超球面上变系数奇异积分方程的结论．     

Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

<正>Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.     

动力系统方法解决无界线性算子方程

针对反问题中出现的第一类算子方程Au=f,其中A是实Hilbert空间H上的一个无界线性算子利用动力系统方法和正则化方法,求解上述问题的正则化问题的解:u'(t)=-A~*(Au(t)-f)利用线性算子半群理论可以得到上述正则化问题的解的半群表示,并证明了当t→∞时,所得的正则化解收敛于原问题的解.     

Periodic problem for a nonlinear‐damped wave equation on the boundary

In this work we investigate the existence of periodic solutions in t for the following problem: We employ elliptic regularization and monotone method. We consider $\mbox{\boldmath{$\Omega$}}\mbox{\boldmath{$\subset$}}{\mathbb{R}}^{{{n}}} \ (n\geqslant 1)$ an open bounded set that has regular boundary Γ and Q=Ω ×(0,T), T>0, a cylinder of ${\mathbb{R}}^{n+1}$ with lateral boundary Σ = Γ × (0,T). Copyright © 2009 John Wiley & Sons, Ltd.     

Sparsity-constrained SENSE reconstruction: An efficient implementation using a fast composite splitting algorithm

Parallel imaging and compressed sensing have been arguably the most successful and widely used techniques for fast magnetic resonance imaging (MRI). Recent studies have shown that the combination of these two techniques is useful for solving the inverse problem of recovering the image from highly under-sampled k-space data. In sparsity-enforced sensitivity encoding (SENSE) reconstruction, the optimization problem involves data fidelity (L2-norm) constraint and a number of L1-norm regularization terms (i.e. total variation or TV, and L1 norm). This makes the optimization problem difficult to solve due to the non-smooth nature of the regularization terms. In this paper, to effectively solve the sparsity-regularized SENSE reconstruction, we utilize a new optimization method, called fast composite splitting algorithm (FCSA), which was developed for compressed sensing MRI. By using a combination of variable splitting and operator splitting techniques, the FCSA algorithm decouples the large optimization problem into TV and L1 sub-problems, which are then, solved efficiently using existing fast methods. The operator splitting separates the smooth terms from the non-smooth terms, so that both terms are treated in an efficient manner. The final solution to the SENSE reconstruction is obtained by weighted solutions to the sub-problems through an iterative optimization procedure. The FCSA-based parallel MRI technique is tested on MR brain image reconstructions at various acceleration rates and with different sampling trajectories. The results indicate that, for sparsity-regularized SENSE reconstruction, the FCSA-based method is capable of achieving significant improvements in reconstruction accuracy when compared with the state-of-the-art reconstruction method.     

On the analytic computation of massless propagators in dimensional regularization

We comment on the algorithm to compute periods using hyperlogarithms, applied to massless Feynman integrals in the parametric representation. Explicitly, we give results for all three-loop propagators with arbitrary insertions including order ε⁴${\epsilon }^4$ and show examples at four and more loops.     

On application of asymptotic generalized discrepancy principle to the analysis of epidemiology models

Various implementations of the discrepancy principle (DP) for linear ill-posed problems are given in a large number of papers. In all of these papers, the DP has been justified for special types of regularization strategies. In our paper, a unified approach to the construction of the DP is presented that does not require any special structure of the regularizing operator. In that respect, the new method generalizes all prior results on the DP principle for linear irregular operator equations with noisy data. The efficiency of the proposed scheme is demonstrated for a parameter identification problem in avian influenza. In solving this particular inverse problem, it turned out to be beneficial to use some regularization strategies, for which the earlier (structure-based) discrepancy principles were not applicable. This motivated the development of a novel DP put forth in the current paper.     

Reproducing-kernel-based splines for the regularization of the inverse ellipsoidal gravimetric problem

To solve the inverse gravimetric problem, i.e. to reconstruct the Earth's mass density distribution by using the gravitational potential, we introduce a spline interpolation method for the ellipsoidal Earth model, where the ellipsoid has a rotational symmetry. This problem is ill-posed in the sense of Hadamard as the solution may not exist, it is not unique and it is not stable. Since the anharmonic part (orthogonal complement) of the density function produces a zero potential, we restrict our attention only to reconstruct the harmonic part of the density function by using the gravitational potential. This spline interpolation method gives the existence and uniqueness of the unknown solution. Moreover, this method represents a regularization, i.e. every spline continuously depends on the given gravitational potential. These splines are also combined with a multiresolution concept, i.e. we get closer and closer to the unknown solution by increasing the scale and adding more and more data at each step.     

Dirichlet principle using computers

In this article we shall give practical and numerical solutions of the Laplace equation on multidimensional spaces and show the numerical experiments by using computers. Our method is based on the Dirichlet principle by combinations with generalized inverses, Tikhonov's regularization and the theory of reproducing kernels.     

Analytical and numerical inversion formulas in the Gaussian convolution by using the Paley–Wiener spaces

We shall discuss the relations among sampling theory (Sinc method), reproducing kernels and the Tikhonov regularization. Here, we see the important difference of the Sobolev Hilbert spaces and the Paley–Wiener spaces when we use their reproducing kernel Hibert spaces as approximate spaces in the Tikhonov regularization. Further, by using the Paley–Wiener spaces, we shall illustrate numerical experiments for new inversion formulas for the Gaussian convolution as a much more powerful and improved method by using computers. In this article, we shall be able to give practical numerical and analytical inversion formulas for the Gaussian convolution that is realized by computers.