Relationship Between the Stiffly Weighted Pseudoinverse and Multi-Level Constrained Rseudoinverse

It is known that for a given matrix A of rank r, and a set D of positive diagonal matrices, supw∈D‖（W^1/2A) W^1/2‖ = (miniσ (A^(i))^-1, in which (A^(i) is a submatrix of A formed with r = (rank(A)) rows of A, such that (A^(i) has full row rank r. In many practical applications this value is too large to be used. In this paper we consider the case that both A and W(∈D) are fixed with W severely stiff. We show that in this case the weighted pseudoinverse (W^1/2‖A) W^1/2‖ is close to a multilevel constrained weighted pseudoinverse therefore ‖(W^1/2A) W^1/‖2 is uniformly bounded.We also prove that in this case the solution set the stiffly weighted least squares problem is close to that of corresponding multi-level constrained least squares problem.     

A Note on the Lanczos Algorithm for Skew Symmetric Eigenvalue Problem

In[1]and[2]we disscussed the eigenvalue problem for real normal matrices and the eigenvalue problem for normal matrices in generalized inner product, respectively.In this note we will show that if matrix A is a skew symmetric. matrix (c.f.[1]) or matrix G is a B-skew symmetric matrix(c.f.[2]), then the Lanczos algorithm with respect to A or to G can be implemented by real arithmatic and is even simpler than that with respect to a symmetric matrix or to a B-symmetric matrix respectively.     

NOTES ON POLYNOMIAL LEVELABILITY

We consider the polynomial levelability with respect to approximation algorithms (PLAA).A set A is PLAA if given any approximation algorithm a for A and a polynomial p,there are another approximation algorithm β for A and a polynomial q such that for infinitely many inputs x,a accepts x but has ruuning time greater than p(|x|) and β accepts x within time q(|x|).In this paper,an algorithm a is called an approximation algorithm for A if the symmetric difference A△L(a) is sparse,where L(a) is the set of strings recegnized by a.We prove that all natural NP-complete sets are PLAA unless P=NP and all EXP-complete sets are PLAA.     

主理想整环上n阶矩阵环中的Goldbach问题

Abstract: In this paper, we consider the Goldbach's problem for matrix rings, namely, we decompose an n ×n (n > 1) matrix over a principal ideal domain R into a sum of two matrices in Mn(R) with given determinants. We prove the following result: Let n > 1 be a natural number and A = (αij) be a matrix in Mn(R). Define d(A) := g.c.d{αij}. Suppose that p and q are two elements in R. Then (1) If n > 1 is even, then A can be written as a sum of two matrices X, Y in Mn(R) with det(X) = p and det(Y) = q if and only if d(A) |p-q; (2) If n > 1 is odd, then A can be written as a sum of two matrices X, Y in Mn(R) with det(X) = p and det(Y) = q if and only if d(A) |p + q. We apply the result to the matrices in Mn(Z) and Mn(Q[x]) and prove that if R = Z or Q[x], then any nonzero matrix A in Mn(R) can be written as a sum of two matrices in Mn(R) with prime determinants.     

On the decomposition problem of stability for Volterra integrodifferential equations

In this paper, we discuss the problem of stability of Volterra integrodifferential equationwith the decompositionwhere andin which is an matrix of functionB continuous forin which is an matrix of functionscontinuous for 0≤S≤ t<∞.According to the decomposition theory of large scale system and with the help of Liapunovfunctional, we give a criterion for concluding that the zero solution of (2) (i.e. large scale system(1)) is uniformly asymptotically stable.We also discuss the large scale system with the decompositionand give a criterion for determining that the solutions of (4) (i.e. large scale system (3)) areuniformly bounded and uniformly ultimately bounded.Those criteria are of simple forms, easily checked and applied.     

BASISITY PROBLEM AND WEIGHTED SHIFT OPERATORS

We investigate a basisity problem in the space ■p A D and in its invariant subspaces. Namely, let W denote a unilateral weighted shift operator acting in the space ■p A D,1 ≤ p ∞, by W zn= λnzn+1, n ≥ 0, with respect to the standard basis zn n≥0. Applying the so-called "discrete Duhamel product" technique, it is proven that for any integer k ≥ 1the sequence wi+nk-1 W | Ei knf n≥0is a basic sequence in Ei := span zi+n: n ≥ 0 equivalent to the basis zi+n n≥0if and only if f i = 0. We also investigate a Banach algebra structure for the subspaces Ei, i ≥ 0.     

Self-similar fractals: An algorithmic point of view

This paper studies the self-similar fractals with overlaps from an algorithmic point of view.A decidable problem is a question such that there is an algorithm to answer"yes"or"no"to the question for every possible input.For a classical class of self-similar sets{E b.d}b,d where E b.d=Sn i=1(E b,d/d+b i)with b=(b1,...,b n)∈Qn and d∈N∩[n,∞),we prove that the following problems on the class are decidable:To test if the Hausdorff dimension of a given self-similar set is equal to its similarity dimension,and to test if a given self-similar set satisfies the open set condition(or the strong separation condition).In fact,based on graph algorithm,there are polynomial time algorithms for the above decidable problem.     

中心对称本原矩阵的k点指数集

Let G = (V, E) be a primitive digraph. The vertex exponent of G at a vertex v ∈ V, denoted by expG(v), is the least integer p such that there is a v → u walk of length p for each u ∈ V. We choose to order the vertices of G in the k-point exponent of G and is denoted by expG(k), 1 ≤ k ≤ n. We define the k-point exponent set E(n, k) := {expG(k)| G = G(A) with A ∈ CSP(n)}, where CSP(n) is the set of all n × n central symmetric primitive matrices and G(A) is the associated graph of the matrix A. In this paper, we describe E(n,k) for all n, k with 1 ≤ k ≤ n except n ≡ 1(mod 2) and 1 ≤ k ≤ n - 4. We also characterize the extremal graphs when k = 1.     

DNA labelled graphs with DNA computing

Let k≥2, 1≤i≤k andα≥1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost uucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be(k, i;α)-labelled if it is possible to assign a label(l_1(x),..., l_k(x))to each point x of D such that l_j(x)∈{0,...,a-1}for any j∈{1,...,k}and(x,y)∈E(D)if and only if(l_k-i 1(x),..., l_k(x))=(l_1(y),..., l_i(y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is(k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is(2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a(2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a(2i, i; 4)-labelled directed graph.     

A REVERSE ORDER IMPLICIT Q-THEOREM AND THE ARNOLDI PROCESS

Let A be a real square matrix and VTAV = G be an upper Hessenberg matrix with positive subdiagonal entries, where V is an orthogonal matrix. Then the implicit Q-theorem states that once the first column of V is given then V and G are uniquely determined. In this paper, three results are established. First, it holds a reverse order implicit Q-theorem: once the last column of V is given, then V and G are uniquely determined too. Second, it is proved that for a Krylov subspace two formulations of the Arnoldi process are equivalent and in one to one correspondence. Finally, by the equivalence relation and the reverse order implicit Q-theorem, it is proved that for the Krylov subspace, if the last vector of vector sequence generated by the Arnoldi process is given, then the vector sequence and resulting Hessenberg matrix are uniquely determined.     

Qualitative Analysis of Bifurcating Solutions in the Lengyel-Epstein Model

One of the most fundamental problems in theoretical biology is to explain the mechanisms by which patterns and forms are created in the＇living world. In his seminal paper ＂The Chemical Basis of Morphogenesis＂, Turing showed that a system of coupled reaction-diffusion equations can be used to describe patterns and forms in biological systems. However, the first experimental evidence to the Turing patterns was observed by De Kepper and her associates（1990） on the CIMA reaction in an open unstirred reactor, almost 40 years after Turing＇s prediction. Lengyel and Epstein characterized this famous experiment using a system of reaction-diffusion equations. The Lengyel-Epstein model is in the form as follows     

(0,1 ;0)-INTERPOLATION ON INFINITE INTERVAL (-∞, +∞)

In this paper, we study the explicit representation and convergence of (0, 1; 0)-interpolation on infinite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values are prescribed at two set of points namely the zeros of Hn(x) and H′n(x) and the first derivatives at the zeros of H′n(x).     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

Journal of the Operations Research Society of China Special issue on Operations Research in Healthcare Management

正Guest Editors:Hong Chen,Shanghai Jiao Tong University,Shanghai,China Guohua Wan,Shanghai Jiao Tong University,Shanghai,China David Yao,Columbia University,New York,USA Scope:Healthcare delivery worldwide has been fraught with high cost,low efficiency and poor quality of patient care service.For the field of operations research(OR),healthcare offers some of the biggest challenges as well as best opportunities in     

ANALYSIS IN THEORY AND APPLICATIONS Vol. 30, 2014 CONTENTS

正~~     

An alternative mathematical algorithm for the photo- and videokeratoscope

Due to the resolution of current laser technology, the accuracy of corneal topography as measured by the videokeratoscope is no longer adequate to provide precise enough data for refractive surgery or for the fitting of customized contact lenses. We present an algorithm for recovering corneal topography that makes use of modern differential geometric techniques and numerical descent in Sobolev spaces. We believe this algorithm may be used with the photo- and videokeratoscope to increase the accuracy of the recovered corneal topography.     

A note on Sobolev orthogonality for Laguerre matrix polynomials

Let {Ln(A,λ)(x)}n≥0 be the sequence of monic Laguerre matrix polynomials defined on [0, ∞) by Ln(A,λ)(x)=n!/(-λ)n∑nk=0(-λ)κ/k!(n-1)! (A I)n[(A I)k]-1 xk,where A ∈ Cr×r. It is known that {Ln(A,λ)(x)}n≥0 is orthogonal with respect to a matrix moment functional when A satisfies the spectral condition that Re(z) ＞ - 1 for every z ∈σ(A).In this note we show that forA such that σ(A) does not contain negative integers, the Laguerre matrix polynomials Ln(A,λ) (x) are orthogonal with respect to a non-diagonal SobolevLaguerre matrix moment functional, which extends two cases: the above matrix case and the known scalar case.     

CONTENTS OF VOLUME 30

正~~