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.     

Gas-Kinetic BGK Scheme for Three Dimensional Magnetohydrodynamics

<正>The gas-kinetic theory based flux splitting method has been successfully proposed for solving one-and two-dimensional ideal magnetohydrodynamics by Xu et al. [J.Comput.Phys.,1999;2000],respectively.This paper extends the kinetic method to solve three-dimensional ideal magnetohydrodynamics equations,where an adaptive parameter 17 is used to control the numerical dissipation in the flux splitting method. Several numerical examples are given to demonstrate that the proposed method can achieve high numerical accuracy and resolve strong discontinuous waves in three dimensional ideal MHD problems.     

MULTIPLE SOLUTIONS TO SINGULAR BVPS WITH VARIABLE COEFFICIENT ON THE HALF-LINE

This paper is concerned with a singular second-order nonlinear boundary value problem with a time depending on derivative operator and posed on the positive half-line. The nonlinearity is derivative-dependent, which has singularities at t=0 and/or x=0, and may change sign. The method of the upper and lower solutions on unbounded domains combined with the topological degree theory are employed to prove the existence and multiplicity of solutions.     

Fast Solvers of Fredholm Optimal Control Problems

<正>The formulation of optimal control problems governed by Fredholm integral equations of second kind and an efficient computational framework for solving these control problems is presented.Existence and uniqueness of optimal solutions is proved. A collective Gauss-Seidel scheme and a multigrid scheme are discussed.Optimal computational performance of these iterative schemes is proved by local Fourier analysis and demonstrated by results of numerical experiments.     

QUADRATURE METHODS FOR HIGHLY OSCILLATORY SINGULAR INTEGRALS

We address the evaluation of highly oscillatory integrals,with power-law and logarithmic singularities.Such problems arise in numerical methods in engineering.Notably,the evaluation of oscillatory integrals dominates the run-time for wave-enriched boundary integral formulations for wave scattering,and many of these exhibit singularities.We show that the asymptotic behaviour of the integral depends on the integrand and its derivatives at the singular point of the integrand,the stationary points and the endpoints of the integral.A truncated asymptotic expansion achieves an error that decays faster for increasing frequency.Based on the asymptotic analysis,a Filon-type method is constructed to approximate the integral.Unlike an asymptotic expansion,the Filon method achieves high accuracy for both small and large frequency.Complex-valued quadrature involves interpolation at the zeros of polynomials orthogonal to a complex weight function.Numerical results indicate that the complex-valued Gaussian quadrature achieves the highest accuracy when the three methods are compared.However,while it achieves higher accuracy for the same number of function evaluations,it requires signi cant additional cost of computation of orthogonal polynomials and their zeros.     

Optimal orthogonalization processes

Two optimal orthogonalization processes are devised toorthogonalize,possibly approximately,the columns of a very large and possiblysparse matrix A∈C^n×k.Algorithmically the aim is,at each step,to optimallydecrease nonorthogonality of all the columns of A.One process relies on using translated small rank corrections.Another is a polynomial orthogonalization process forperforming the L?wdin orthogonalization.The steps rely on using iterative methods combined,preferably,with preconditioning which can have a dramatic effect on how fast thenonorthogonality decreases.The speed of orthogonalization depends on howbunched the singular values of A are,modulo the number of steps taken.These methods put the steps of the Gram-Schmidt orthogonalizationprocess into perspective regardingtheir(lack of)optimality.The constructions are entirely operatortheoretic and can be extended to infinite dimensional Hilbert spaces.     

傅种孙——中国现代数学教育的先驱

1 引子 很高兴来到澳门,与澳门大学教育学院的学生——未来的中学数学教师们见面.黄博士拟定的题目——北京师范大学与中学数学教育太大,我有些不敢讲.另一方面,我是个数学老师,没读过太多教育学和心理学的理论,也不大敢在诸位数学教育家面前班门弄斧,所以,就决定给同学们讲几件事,介绍一个人.     

Novel Kernel Function With a Hyperbolic Barrier Term to Primal-dual Interior Point Algorithm for SDP Problems

In this paper, we introduce for the first time a new eligible kernel function with a hyperbolic barrier term for semidefinite programming(SDP). This add a new type of functions to the class of eligible kernel functions. We prove that the interior-point algorithm based on the new kernel function meets O(n^3/4 logε/n)iterations as the worst case complexity bound for the large-update method. This coincides with the complexity bound obtained by the first kernel function with a trigonometri...     

Recent advances in statistical methodologies in evaluating program for high-dimensional data

The era of big data brings opportunities and challenges to developing new statistical methods and models to evaluate social programs or economic policies or interventions. This paper provides a comprehensive review on some recent advances in statistical methodologies and models to evaluate programs with high-dimensional data. In particular, four kinds of methods for making valid statistical inferences for treatment effects in high dimensions are addressed. The first one is the so-called doubly robust type estimation, which models the outcome regression and propensity score functions simultaneously. The second one is the covariate balance method to construct the treatment effect estimators. The third one is the sufficient dimension reduction approach for causal inferences. The last one is the machine learning procedure directly or indirectly to make statistical inferences to treatment effect. In such a way, some of these methods and models are closely related to the de-biased Lasso type methods for the regression model with high dimensions in the statistical literature. Finally, some future research topics are also discussed.     

一道高考题的背景、拓广与应用

问题1(2007年重庆卷,文21)倾斜角为α的直线经过抛物线交于A,两点(图略). 　　(Ⅰ)求抛物线的焦点F的坐标及准线ι的方程; 　　(Ⅱ)若α为锐角,作线段AB的垂直平分线m交X轴于点P,证明|FP|-|FP|cos2α为定值,并求此定值.……     

Genera of Cayley maps

The genus distribution of a graph G is defined to be the sequence {gm}, where gm is the number of different embeddings of G in the closed orientable surface of genus m. In this paper, we examine the genus distributions of Cayley maps for several Cayley graphs. It will be shown that the genus distribution of Cayley maps has many different properties from its usual genus distribution.     

类圈图的亏格分布

一个图 G 的亏格分布是指序列{g_k}, g_k表示 G 嵌入亏格为 k 的闭的可定向曲面的数目. 该文给出了标准类圈图的亏格分布的递推公式, 并得到类圈图的嵌入多项式的计算公式.     

Genus distribution of ladder type and cross type graphs

In this paper a method is given to calculate the explicit expressions of embedding genus distribution for ladder type graphs and cross type graphs. As an example, we refind the genus distribution of the graph J _n which is the first class of graphs studied for genus distribution where its genus depends on n. This work was supported National Natural Science Foundation of China (Grant Nos. 10571013, 60433050) and the State Key Development Program of Basic Research of China (Grant No. 2004CB318004)     

Genus Distributions of M(o|¨)bius Ladders

The genus distribution of a graph is a polynomial whose coefficients are the partition of the number of embeddings with respect to the genera. In this paper, the genus distribution of Mobius ladders is provided which is an infinite class of 3-connected simple graphs.     

Log‐concavity of genus distributions for circular ladders

A well‐known conjecture in topological graph theory says that the genus distribution of every graph is log‐concave. In this paper, the genus distribution of the circular ladder is re‐derived, using overlap matrices and Chebyshev polynomials, which facilitates proof that this genus distribution is log‐concave.     

Genus distributions of star-ladders

Star-ladder graphs were introduced by Gross in his development of a quadratic-time algorithm for the genus distribution of a cubic outerplanar graph. This paper derives a formula for the genus distribution of star-ladder graphs, using overlap matrix and Chebyshev polynomials.     

On the embedding genus distribution of ladders and crosses

In this work, the relations between ladder surface sets and cross surface sets are found. The embedding genus distribution of ladders can be obtained by using the genus distribution of cross type surface sets.     

On the genus distributions of wheels and of related graphs

We are concerned with families of graphs in which there is a single root-vertex ofunbounded valence, and in which, however, there is a uniform upper bound for the valences of all the other vertices. Using a result of Zagier, we obtain formulas and recursions for the genus distributions of several such families, including the wheel graphs. We show that the region distribution of a wheel graph is approximately proportional to the sequence of Stirling numbers of the first kind. Stahl has previously obtained such a result for embeddings in surfaces whose genus is relatively near to the maximum genus. Here, we generalize Stahl’s result to the entire genus distributions of wheels. Moreover, we derive the genus distributions for four other graph families that have some similarities to wheels.     

Total embedding distributions of Ringel ladders

The total embedding distributions of a graph consists of the orientable embeddings and non-orientable embeddings and are known for only a few classes of graphs. The orientable genus distribution of Ringel ladders is determined in [E.H. Tesar, Genus distribution of Ringel ladders, Discrete Mathematics 216 (2000) 235–252] by E.H. Tesar. In this paper, using the overlap matrix, we obtain nonhomogeneous recurrence relation for rank distribution polynomial, which can be solved by the Chebyshev polynomials of the second kind. The explicit formula for the number of non-orientable embeddings of Ringel ladders is obtained. Also, the orientable genus distribution of Ringel ladders is re-derived.     

An Euler‐genus approach to the calculation of the crosscap‐number polynomial

In 1994, J. Chen, J. Gross, and R. Rieper demonstrated how to use the rank of Mohar's overlap matrix to calculate the crosscap‐number distribution, that is, the distribution of the embeddings of a graph in the nonorientable surfaces. That has ever since been by far the most frequent way that these distributions have been calculated. This article introduces a way to calculate the Euler‐genus polynomial of a graph, which combines the orientable and the nonorientable embeddings, without using the overlap matrix. The crosscap‐number polynomial for the nonorientable embeddings is then easily calculated from the Euler‐genus polynomial and the genus polynomial.