AN INVERSE EIGENVALUE PROBLEM FOR JACOBI MATRICES

In this paper, we discuss an inverse eigenvalue problem for constructing a 2n × 2n Jacobi matrix T such that its 2n eigenvalues are given distinct real values and its leading principal submatrix of order n is a given Jacobi matrix. A new sufficient and necessary condition for the solvability of the above problem is given in this paper. Furthermore, we present a new algorithm and give some numerical results.     

THE INVERSE PROBLEM FOR PART SYMMETRIC MATRICES ON A SUBSPACE

In this paper, the following two problems are considered:Problem Ⅰ. Given S∈E Rn×p,X,B 6 Rn×m, find A ∈ SRs,n such that AX = B, where SR8,n = {A∈ Rn×n|xT(A - AT) = 0, for all x ∈ R(S)}.Problem Ⅱ. Given A* ∈ Rn×n, find A ∈ SE such that ||A-A*|| = minA∈sE||A-A*||, where SE is the solution set of Problem Ⅰ.The necessary and sufficient conditions for the solvability of and the general form of the solutions of problem Ⅰ are given. For problem Ⅱ, the expression for the solution, a numerical algorithm and a numerical example are provided.     

A characterization for a graphic sequence to be potentially C r -graphic

Let r 3, n r and π = (d1, d2, . . . , dn) be a graphic sequence. If there exists a simple graph G on n vertices having degree sequence π such that G contains Cr (a cycle of length r) as a subgraph, then π is said to be potentially Cr-graphic. Li and Yin (2004) posed the following problem: characterize π = (d1, d2, . . . , dn) such that π is potentially Cr-graphic for r 3 and n r. Rao and Rao (1972) and Kundu (1973) answered this problem for the case of n = r. In this paper, this problem is solved completely.     

TWO-DIMENSIONAL RIEMANN PROBLEM FOR A HYPERBOLIC SYSTEM OF CONSERVATION LAWS

§ 1. Introduction The Riemann problem is the most basic problem for both analytical theory and numerical computation of nonlinear hyperbolic conservation laws. B. Riemann suggested and solved it for one dimensional isentropic flow in 1860. A lot of work have been done for 1-D case since 1940's. For 2-D scalar conservation law, it has been solved by Wagner and Zhang and Zheng. For 2-D system of Euler equations in gas dynamios, after some demonstration and analysis with characteristic method in both physics and phase spaces a set of conjectures on the structure of solutions have been formulated by Zhang and Zheng. To approach the proof of the conjectures, we consider a 2×2 system first. In the present paper we discuss the following system:     

Boundary Identification for a Blast Furnace

In this paper,the authors discuss an inverse boundary problem for the axi- symmetric steady-state heat equation,which arises in monitoring the boundary corrosion for the blast-furnace.Measure temperature at some locations are used to identify the shape of the corrosion boundary. The numerical inversion is complicated and consuming since the wear-line varies during the process and the boundary in the heat problem is not fixed.The authors suggest a method that the unknown boundary can be represented by a given curve plus a small perturbation,then the equation can be solved with fixed boundary,and a lot of computing time will be saved. A method is given to solve the inverse problem by minimizing the sum of the squared residual at the measuring locations,in which the direct problems are solved by axi- symmetric fundamental solution method. The numerical results are in good agreement with test model data as well as industrial data,even in severe corrosion case.     

MATRIX EQUATION AXB = E WITH PX = sXP CONSTRAINT

The matrix equation AXB = E with the constraint PX=sXP is considered,where P is a given Hermitian matrix satisfying p~2=I and s=±1.By an eigenvalue decomposition of P,the constrained problem can be equivalently transformed to a well-known unconstrained problem of matrix equation whose coefficient matrices contain the corresponding eigenvector, and hence the constrained problem can be solved in terms of the eigenvectors of P.A simple and eigenvector-free formula of the general solutions to the constrained problem by generalized inverses of the coefficient matrices A and B is presented.Moreover,a similar problem of the matrix equation with generalized constraint is discussed.     

THE HILBERT BOUNDARY PROBLEM OF DOUBLY PERIODIC ANALYTIC FUNCTIONS

The doubly periodic Hilbert boundary value problem is discussed in this paper.First,certain kind of integral representations of doubly quasi-periodic analytic functions inmultiplication is established so that the Dirichlet problem of such functions is solved.Then,by the method of regularization,the Hilbert boundary value problem is transferredto such a problem,and it is reduced at length to some Fredholm integral equation.Thenumber of solutions and conditions of solvability as well as the form of the generalsolution are obtained.     

Hardy-Littlewood-Polya inequality for a linear differential operator and some related optimal problems

In this paper a generalized version of the classical Hardy-Littlewood-Polya inequality isgiven.Furthermore,the Stechkin's problem for a linear differential operator is solved in L_2(R),and the optimal recovery problem for such differential operator is considered.     

Single machine stochastic JIT scheduling problem subject to machine breakdowns

In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared deviations of the job-expected completion times from the due date.For preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.We discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some conditions.For preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be computed.We replace the ESSD problem by the SSDE problem.We show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.     

A MIXED FINITE ELEMENT AND CHARACTERISTIC MIXED FINITE ELEMENT FOR INCOMPRESSIBLE MISCIBLE DARCY-FORCHHEIMER DISPLACEMENT AND NUMERICAL ANALYSIS

In this paper a mixed finite element-characteristic mixed finite element method is discussed to simulate an incompressible miscible Darcy-Forchheimer problem.The flow equation is solved by a mixed finite element and the approximation accuracy of Darch-Forchheimer velocity is improved one order.The concentration equation is solved by the method of mixed finite element,where the convection is discretized along the characteristic direction and the diffusion is discretized by the zero-order mixed fi...     

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.     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Boundedness of commutators related to Marcinkiewicz integrals on hardy type spaces

In this paper, the authors study the boundedness of the operator [μΩ, b], the commutator generated by a function b ∈ Lipβ(Rn)(0 ＜β≤ 1) and the Marcinkiewicz integrals μΩ, on the classical Hardy spaces and the Herz-type Hardy spaces in the case Ω∈ Lipα(Sn-1)(0 ＜α≤ 1).     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.     

Jacobi polynomials used to invert the laplace transform

Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.