COMPUTING EIGENVECTORS OF NORMAL MATRICES WITH SIMPLE INVERSE ITERATION

It is well-known that if we have an approximate eigenvalue λ- of a normal matrix A of order n,a good approximation to the corresponding eigenvector u can be computed by one inverse iteration provided the position,say kmax,of the largest component of u is known.In this paper we give a detailed theoretical analysis to show relations between the eigenvecor u and vector xk,k=1,…,n,obtained by simple inverse iteration,i.e.,the solution to the system(A-λI)x=ek with ek the kth column of the identity matrix I.We prove that under some weak conditions,the index kmax is of some optimal properties related to the smallest residual and smallest approximation error to u in spectral norm and Frobenius norm.We also prove that the normalized absolute vector v=|u|/||u||∞ of u can be approximated by the normalized vector of (||x1||2,…||xn||2)^T,We also give some upper bounds of |u(k)| for those “optimal“ indexeds such as Fernando‘s heuristic for kmax without any assumptions,A stable double orthogonal factorization method and a simpler but may less stable approach are proposed for locating the largest component of u.     

An integral boundary value problem of conformable integro-differential equations with a parameter

In this article, we consider some properties of positive solutions for a new conformable integro-differential equation with integral boundary conditions and a parameter $$ \left\{ \begin{array}{l} T_{\alpha}u(t)+\lambda f(t,u(t),I_{\alpha}u(t))=0,t\in[0,1],\u(0)=0,u(1)=\beta\int_{0}^{1}u(t)dt ,\beta\in[\frac 32,2), \ \end{array}\right.\nonumber $$ where $\alpha\in(1,2]$, $\lambda$ is a positive parameter, $T_{\alpha}$ is the usual conformable derivative and $I_{\alpha}$ is the conformable integral, $f:[0,1]\times\mathbf{R^{+}}\times\mathbf{R^{+}}\rightarrow \mathbf{R^{+}} $ is a continuous function, where $\mathbf{R^{+}}=[0,+\infty)$. We use a recent fixed point theorem for monotone operators in ordered Banach spaces, and then establish the existence and uniqueness of positive solutions for the boundary value problem. Further, we give an iterative sequence to approximate the unique positive solution and some good properties of positive solution about the parameter $\lambda$. A concrete example is given to better demonstrate our main result.     

一类$L^2(\mathbb{R}^n)$的紧支撑不可分正交小波

本篇文章给出一类$L^{2}(\mathbb{R}^{n})$, $n\geq2$的紧支撑不可分正交小波基的具体构造算法,其中正交小波的伸缩矩阵为$\alpha I_{n}~(\alpha\geq2,\ \alpha \in \mathbb{Z})$, $I_{n}$是$n$阶单位矩阵.最后给出两个不可分正交小波基的构造算例.     

具有特征参数多项式边界条件的Sturm-Liouville 方程的逆结点问题

逆结点问题是通过特征函数的零点重构算子. 本文主要讨论具有特征参数多项式边界条件的 Sturm-Liouville 方程的逆结点问题. 20世纪50年代以后,人们发现在许多工程领域, Sturm-Liouville 问题的谱参数不仅出现在方程中, 而且也出现在边界条件中,因此带参数边界条件的逆结点问题对数学物理方面的研究有重要意义. 本文讨论区间 $[0,1]$ 上边界条件为参数多项式的 Sturm-Liouville 方程的逆结点问题, 并证明在 $[0,b]$ \big($ b\in \big(\frac{1}{2},1\big]$\big) 上结点的稠密子集可唯一确定 $[0,1]$ 上的势函数和边界条件中多项式的未知系数.     

Spectral Self-Affine Measures on the Generalized Three Sierpinski Gasket

The self-affine measure μM,Dassociated with an iterated function system{φd(x)=M~(-1)(x + d)}_(d∈D) is uniquely determined. It only depends upon an expanding matrix M and a finite digit set D. In the present paper we give some sufficient conditions for finite and infinite families of orthogonal exponentials. Such research is necessary to further understanding the non-spectral and spectral of μM,D. As an application,we show that the L~2(μM,D) space has infinite families of orthogonal exponentials on the generalized three Sierpinski gasket. We then consider the spectra of a class of self-affine measures which extends several known conclusions in a simple manner.     

Graph Sparsification by Universal Greedy Algorithms

Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, and numerical solution of symmetric positive definite linear systems. In this paper, inspired by the well-known sparse signal recovery algorithm called orthogonal matching pursuit (OMP), we introduce a deterministic, greedy edge selection algorithm, which is called the universal greedy approach (UGA) for the graph sparsification problem. For a general spectral sparsification problem, e.g., the positive subset selection problem from a set of $m$ vectors in $\mathbb{R}^n$, we propose a nonnegative UGA algorithm which needs $O(mn^2+ n^3/\epsilon^2)$ time to find a $\frac{1+\epsilon/\beta}{1-\epsilon/\beta}$-spectral sparsifier with positive coefficients with sparsity at most $\lceil\frac{n}{\epsilon^2}\rceil$, where $\beta$ is the ratio between the smallest length and largest length of the vectors. The convergence of the nonnegative UGA algorithm is established. For the graph sparsification problem, another UGA algorithm is proposed which can output a $\frac{1+O(\epsilon)}{1-O(\epsilon)}$-spectral sparsifier with $\lceil\frac{n}{\epsilon^2}\rceil$ edges in $O(m+n^2/\epsilon^2)$ time from a graph with $m$ edges and $n$ vertices under some mild assumptions. This is a linear time algorithm in terms of the number of edges that the community of graph sparsification is looking for. The best result in the literature to the knowledge of the authors is the existence of a deterministic algorithm which is almost linear, i.e. $O(m^{1+o(1)})$ for some $o(1)=O(\frac{(\log\log(m))^{2/3}}{\log^{1/3}(m)})$. Finally, extensive experimental results, including applications to graph clustering and least squares regression, show the effectiveness of proposed approaches.     

The Iterative Accelerative Method of Finite Element Approximation for the System $u=∑ u_j (\frac{∂ u}{∂ x_j})+f$

In this paper we use an iterative method to get an approximate solution $u^n$ and $\bar{u}^n$ which approximate the exact solution $u$ with the error estimates $\|u-u^n\|+ch\|u-u^n\|_1+\|u-\bar{u}^n\|_1\leq ch^{n+2}$.     

The Wave Equation in Lp-Spaces

In the first part of the paper, Gaussian estimates are used to study $L^p$-summability of the solution of the wave equation in $L^p(\Omega)$ associated with a general operator in divergence form with bounded coefficients. Secondly, we prove that if $\Omega$ is a cube in $\RR^N$, then the Laplacian with Dirichlet or Neumann boundary conditions generates an $\al$-times integrated cosine function on $L^p(\Omega),\;1\le p <\infty$ for any $\al\ge (N-1)|\frac{1}{2}-\frac{1}{p}|$.     

Computing a Nearest P-Symmetric Nonnegative Definite Matrix Under Linear Restriction

Let $P$ be an $n\times n$ symmetric orthogonal matrix. A real $n\times n$ matrix $A$ is called P-symmetric nonnegative definite if $A$ is symmetric nonnegative definite and $(PA)^T=PA$. This paper is concerned with a kind of inverse problem for P-symmetric nonnegative definite matrices: Given a real $n\times n$ matrix $\widetilde{A}$, real $n\times m$ matrices $X$ and $B$, find an $n\times n$ P-symmetric nonnegative definite matrix $A$ minimizing $||A-\widetilde{A}||_F$ subject to $AX =B$. Necessary and sufficient conditions are presented for the solvability of the problem. The expression of the solution to the problem is given. These results are applied to solve an inverse eigenvalue problem for P-symmetric nonnegative definite matrices.     

共振条件下四阶四点边值问题的可解性

本文讨论四阶常微分方程$x^{(4)}(t)=f(t,x(t),x'(t),x'(t),x'(t)),\;\;\;t\in(0,1), \eqno (E)$在边值条件$x(0)=x(1)=0,\;\alpha x'(\xi_1)-\beta x'(\xi_1)=0,\;\gamma x'(\xi_2)+\delta x'(\xi_2)=0, \eqno(B)$满足共振情形: $\alpha \delta+\beta\gamma+\alpha\gamma(\xi_2-\xi_1)     

Approximate Lie $\ast$-Derivations on $\rho$-complete Convex Modular algebras

In this paper, we obtain generalized Hyers--Ulam stability results of a $(m,n)$-Cauchy-Jensen functional equation associated with approximate Lie $*$-derivations on $\rho$-complete convex modular $*$-algebras $\chi_\rho$ with $\Delta_\mu$-condition on the convex modular $\rho$.     

Two-Step Scheme for Backward Stochastic Differential Equations

In this paper, a stochastic linear two-step scheme has been presented to approximate backward stochastic differential equations (BSDEs). A necessary and sufficient condition is given to judge the $\mathbb{L}_2$-stability of our numerical schemes. This stochastic linear two-step method possesses a family of $3$-order convergence schemes in the sense of strong stability. The coefficients in the numerical methods are inferred based on the constraints of strong stability and $n$-order accuracy ($n\in\mathbb{N}^+$). Numerical experiments illustrate that the scheme is an efficient probabilistic numerical method.     

SINGULAR BOUNDARY PROPERTIES OF HARMONIC FUNCTIONS AND FRACTAL ANALYSIS

ＳＩＮＧＵＬＡＲＢＯＵＮＤＡＲＹＰＲＯＰＥＲＴＩＥＳＯＦＨＡＲＭＯＮＩＣＦＵＮＣＴＩＯＮＳＡＮＤＦＲＡＣＴＡＬＡＮＡＬＹＳＩＳＷＥＮＺＨＩＹＩＮＧＺＨＡＮＧＹＩＰＩＮＧＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＪａｎｕａｒｙ１１，１９９５．Ｒｅｖｉ...     

单纯正交表OA$_\lambda(3, 5, v)$的存在性

An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.     

关于图的星色数的一点注记

A star coloring of an undirected graph G is a proper coloring of G such that no path of length 3 in G is bicolored.The star chromatic number of an undirected graph G,denoted by χs(G),is the smallest integer k for which G admits a star coloring with k colors.In this paper,we show that if G is a graph with maximum degree △,then χs(G) ≤ [7△3/2],which gets better bound than those of Fertin,Raspaud and Reed.     

关于图的3-条件色数

For integers k0,r0,a(k,r)-coloring of a graph G is a proper k-coloring of the vertices such that every vertex of degree d is adjacent to vertices with at least min{d,r}diferent colors.The r-hued chromatic number,denoted byχr(G),is the smallest integer k for which a graph G has a(k,r)-coloring.Define a graph G is r-normal,ifχr(G)=χ(G).In this paper,we present two sufcient conditions for a graph to be 3-normal,and the best upper bound of 3-hued chromatic number of a certain families of graphs.     

The Wave Equation Approach to Robbin Inverse Problems for a Doubly-Connected Region: An Extension to Higher Dimensions

The spectral function $\hatμ(t)=\sum\limits_{j=1}^\infty e^{-itλ^{\frac{1}{2}}_j}$ where $\{λ_j\}^\infty_{j=1}$ are the eigenvalues of the three-dimensional Laplacian is studied for a variety of domains, where $- \infty＜t＜\infty$ and $i=\sqrt{-1}$. The dependence of $\hat{\mu}(t)$ on the connectivity of a domain and the impedance boundary condition (Robbin conditions) are analyzed. Particular attention is given to the spherical shell together with Robbin boundary conditions on its surface.     

正交类和相对Gorenstein模

在这篇论文中,我们研究了$\mathcal{A}$-Gorenstein投射模类和$\mathcal{A}$的左正交模类之间的关系,以及$\mathcal{A}$-Gorenstein内射模类和A的右正交模类之间的关系.我们得到了$\mathcal{A}$-Gorenstein投射模和$\mathcal{A}$-Gorenstein内射模的一些函子刻画.以完备对偶对为工具,我们讨论了$\mathcal{A}$-Gorenstein投射模和$\mathcal{B}$-Gorenstein平坦模之间的关系,并推广了一些已知结论.     

逼近已知函数微商的广义Lanczos算法

给出逼近已知函数微商的广义Lanczos 算法, 构造了一列逼近算子$D_{h}^{n}$以提高稳定近似解的收敛速率. 当$n=2$时, 逼近精度达到$O(\delta^{6 \over 7})$, 而对一般的自然数$n$逼近精度为$O(\delta^{\frac{2n+2}{2n+3}})$, 这里$\delta$是近似函数的误差界.     

On Two-point Boundary Value Problems for Second-order Difference Equation

In this paper, we aim to investigate the difference equation \begin{align*} \Delta^{2}y(t-1)+|y(t)|=0, \ \ \ \ \ t\in[1,T]_{\mathbb{Z}} \end{align*} with different boundary conditions $y(0)=0$ or $\Delta y(0)=0$ and $y(T+1)=B$ or $\Delta y(T)=B$,\ where\ $T\geq 1$ is an integer and $B\in\mathbb{R}$. We will show that how the values of $T$ and $B$ influence the existence and uniqueness of the solutions to the about problem. In details, for the different problems, the $TB$-plane explicitly divided into different parts according to the number of the solutions to the above problems. These parts of $TB$-plane for the value of $T$ and $B$ guarantee the uniqueness, the existence and the nonexistence of solutions respectively.