Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm

The structure preserving rank reduction problem arises in many important applications. The singular value decomposition (SVD), while giving the closest low rank approximation to a given matrix in matrix L ₂ norm and Frobenius norm, may not be appropriate for these applications since it does not preserve the given structure. We present a new method for structure preserving low rank approximation of a matrix, which is based on Structured Total Least Norm (STLN). The STLN is an efficient method for obtaining an approximate solution to an overdetermined linear system AX B, preserving the given linear structure in the perturbation [E F] such that (A + E)X = B + F. The approximate solution can be obtained to minimize the perturbation [E F] in the L _p norm, where p = 1, 2, or . An algorithm is described for Hankel structure preserving low rank approximation using STLN with L _p norm. Computational results are presented, which show performances of the STLN based method for L ₁ and L ₂ norms for reduced rank approximation for Hankel matrices.     

广义KdV-Burgers方程长时间性态的谱方法

1．引言随着无限维动力系统研究的发展和深入,人们对非线性发展方程长时间性态的研究越来越重视[1－6］,而这种研究在很大程度上依赖于数值计算的结果,因此,计算结果是否可靠,计算格式先得是否合适都是值得探讨和深入研究的问题17－10．广义KdV－Burg6rs方程是一类重要的非线性发展方程,在实际问题中也有着广泛的应用,因此,对它的研究即有理论价值也有实际意义．本文讨论如下的广义KdV－Burgers方程的周期初值问题其中a,q是已知实常数,且a＞0八。）,g（。）,h00是已知实函数．文［10］对上述问题构造了半离散的Fourier谱逼近…     

M-estimators of structural parameters in pseudolinear models

Real valued M-estimators in a statistical model 1 with observations are replaced by -valued M-estimators in a new model with observations where are regressors, is a structural parameter and a structural function of the new model. Sufficient conditions for the consistency of are derived, motivated by the sufficiency conditions for the simpler parent estimator The result is a general method of consistent estimation in a class of nonlinear (pseudolinear) statistical problems. If F has a natural exponential density e^{x–b( x )} then our pseudolinear model with u = (g o )^–1 reduces to the well known generalized linear model, provided () = db()/d and g is the so-called link function of the generalized linear model. General results are illustrated for special pairs and leading to some classical M-estimators of mathematical statistics, as well as to a new class of generalized -quantile estimators.     

Limit Theorems for the Maximum Terms of a Sequence of Random Variables with Marginal Geometric Distributions

Let X _n1 ^* , ... X _nn ^* be a sequence of n independent random variables which have a geometric distribution with the parameter p _n = 1/n, and M _n ^* = \max\{X _n1 ^* , ... X _nn ^* }. Let Z ₁, Z₂, Z₃, ... be a sequence of independent random variables with the uniform distribution over the set N _n = {1, 2, ... n}. For each j N _n let us denote X _nj = min{k : Z_k = j}, M _n = max{X_n1, ... X_nn}, and let S _n be the 2nd largest among X _n1, X_n2, ... X_nn. Using the methodology of verifying D(u_n) and D'(u_n) mixing conditions we prove herein that the maximum M _n has the same type I limiting distribution as the maximum M _n ^* and estimate the rate of convergence. The limiting bivariate distribution of (S_n, M_n) is also obtained. Let _n, _n N_n, , and T _n = min{M(A_n), M(B_n)}. We determine herein the limiting distribution of random variable T _n in the case _n , _n/_n > 0, as n .     

A finite‐capacity queue with exhaustive vacation/close‐down/setup times and Markovian arrival processes

We consider a finitecapacity singleserver vacation model with closedown/setup times and Markovian arrival processes (MAP). The queueing model has potential applications in classical IP over ATM or IP switching systems, where the closedown time corresponds to an inactive timer and the setup time to the time delay to set up a switched virtual connection (SVC) by the signaling protocol. The vacation time may be considered as the time period required to release an SVC or as the time during which the server goes to set up other SVCs. By using the supplementary variable technique, we obtain the queue length distribution at an arbitrary instant, the loss probability, the setup rate, as well as the Laplace–Stieltjes transforms of both the virtual and actual waiting time distributions.     

Oscillation and Nonoscillation Criteria for a Second Order Linear Equation

New oscillation and nonoscillation criteria are established for the equation

On the Dirichlet Problem in a Characteristic Rectangle for Fourth Order Linear Singular Hyperbolic Equations

In the rectangle D = (0,

On oscillatory solutions of fourth order ordinary differential equations

The paper deals with the oscillation of a differential equation L ₄ y + P(t)L ₂ y + Q(t)y 0 as well as with the structure of its fundamental system of solutions.     

A Characterization of Projective Spaces by a Set of Planes

This note deals with the following question: How many planes of a linear space (P, $\mathfrak{L}$ ) must be known as projective planes to ensure that (P, $\mathfrak{L}$ ) is a projective space? The following answer is given: If for any subset M of a linear space (P, $\mathfrak{L}$ ) the restriction (M, $\mathfrak{L}$ )(M)) is locally complete, and if for every plane E of (M, $\mathfrak{L}$ (M)) the plane $\bar E$ generated by E is a projective plane, then (P, $\mathfrak{L}$ ) is a projective space (cf. 5.6). Or more generally: If for any subset M of P the restriction (M, $\mathfrak{L}$ (M)) is locally complete, and if for any two distinct coplanar lines G1, G2 ∈ $\mathfrak{L}$ (M) the lines $\bar G_1 ,\bar G_2 \varepsilon \mathfrak{L}$ generated by G1, G2 have a nonempty intersection and $\overline {G_1 \cup {\text{ }}G_2 }$ satisfies the exchange condition, then (P, $\mathfrak{L}$ ) is a generalized projective space.     

A Characterization of Some Minihypers and its Application to Linear Codes

Any {f,r- 2+s; r,q}-minihyper includes a hyperplane in PG(r, q) if fr-1 + s 1 + q – 1 for 1 s q – 1, q 3, r 4, where i = (qi + 1 – 1)/ (q – 1 ). A lower bound on f for which an {f, r – 2 + 1; r, q}-minihyper with q 3, r 4 exists is also given. As an application to coding theory, we show the nonexistence of [ n, k, n + 1 – qk – 2 ]q codes for k 5, q 3 for qk – 1 – 2q – 1 < n qk – 1 – q – 1 when k > q – q - \sqrt q + 2$$ " align="middle" border="0"> and for when , which is a generalization of [18, Them. 2.4].