关于GQR因子分解和Cholesky分解块修改的扰动分析

近来,广义QR分解引起了数值代数界的广泛兴趣.Anderson等研究了GQR的若干性质并讨论了在广义最小二乘等问题上的应用;Paige研究了GQR的数值性质;Hammer-ling用GQR处理一般的Gauss-Markov线性模型参数估计问题;Barrlund给出了GQR分解因子的扰动界.我们注意到Barrlund的论证方法和所得结果都比较复杂.     

时间序列的经验模态频率分解EMFD

在经验模态分解的基础上,提出了经验模态频率分解.经验模态频率分解是正交分解,有很好的性质和频率意义.     

二元二次多项式实分解的条件和应用

设二元二次多项式为f(x,刃二A护 ZB二,十c沪, ZDx ZE, F(*)并记11二次三项式的因式分解一样,可根据问题的特点,分别采用提公因式、处组分解、公式法、求根法等等.为便于应用,这里给出实分解的一般结果(具体推导由读者完成)./、 (一)在条件1o下. l)当AZ CZ笋0(不妨设A笋0)时,扮BCAB圣1一A 所谓f(x,功的实分解,是指f(x,功分解为两个实系数的二元一次式的积.在这方面,我们要研究的问题可归结为下面的三类: 1.f(x,刃在什么条件下可实分解?怎样分解? 2.若f(二,功的系数中含有一个未知参数,参数取何值时f(二,约可实分解?一 3.若f(二刀)的…     

基于可导性方差分解的居民收入省际差距分析

本文提出了一个基于收入构成差异和收入差距动因的分解框架,旨在量化相关决定因素对居民人均收入省际差距的贡献度.从指标内在关联性维度将居民人均收入指标进行多指标分解,由此导出因变量指标与各自变量之和（或之乘积）之间存在恒等关系的表达式,并引入可导性方差分解法构造了地区间居民收入绝对差距和相对差距的结构与动因分解模型.研究结果表明,驱动2005-2012年中国居民人均收入省际间差距形成和缩小的首要动力是人均设备性资本,其次是非设备性资本与设备性资本比例;人力资本与总人口比例在差距形成和绝对差距缩小中具有显著的推动作用,但在相对差距缩小中表现出明显的抑制效应;非设备性资本产出率在差距形成中具有较大的推动作用,但在差距缩小中表现出巨大的抑制效应;劳动力与人力资本比例在差距形成和绝对差距缩小中具有显著的抑制作用,但在相对差距缩小中表现出巨大的推动作用;产出分配率在差距形成中发挥了较小的抑制作用,但在差距缩小中表现出巨大的遏制作用.     

关于正交因子分解的一些结果

设G是一个图,F={F_1,F_2,…,F_d}是G的一个因子分解,H是C的一个子图,若H有d条边且恰好与每个F_i有一条公共边,则称H与F是正交的。本文研究了与图的K-因子分解正交的对集及[a,b]-子图,从而证明了关于因子分解问题的两个猜想在某些情况下成立,并提出了可进一步研究的问题。     

T∞-测度分解定理的进一步讨论

在对T∞-测度做进一步研究的基础上,得到了(有限或无限)T∞-测度的Hahn分解定理和Jordan分解定理。同时,用一种新方法证明了有限T∞-测度的Lebesgue分解定理。此外,还得到了一些类似于经典测度的结论。     

分解与积分有理函数的直接方法

通过多项式分析,构造出用于确定有理函数分解式系数的两种直接公式.为了提高公式的使用效率,引入先期分解的概念,给出了公式的连环应用方法.同时,将公式的使用范围扩展到复数域,建立起适用于共轭复根的积分公式,避免了有理函数积分的递推过程.     

关于图的一种新分解

一、概念和记号 最近,Yousef Alavi等人在文献[*]中给出了图的升分解概念:已知图G,存在自然数n,G的边数q满足( )≤q≤( )。如果G能分解为子图G_1,G_2,…,G_n的并,使得G_i与G_(i+1)的一个真子图同构(1≤i≤n=1),G_i不含孤立点,则称这个分解为图G的一个升分解。     

关于W.Y.Vélez猜想Ⅱ

设k为域,本文继续讨论了文[1]中提出的W.Y.Vélez问题,在基域k中不含有m次本原单位根时,给出了该问题成立的一个条件,推广了文[2]的结果.     

A new characterization of A 5

Let G be a group and τ _e (G) the set of numbers of elements of G of the same order. In this paper, by τ _e (G), we give a new characterization of A ₅, where A ₅ is the alternating group of degree 5. We get the theorem following: Theorem. Let G be a group, ${G\cong A_5}$ if and only if τ _e (G) = τ _e (A ₅) = {1, 15, 20, 24}.     

图的线独立数的一个公式

本文中我们用等秩变换证明了连通图G的所有生成树的邻接矩阵的秩中最大者就是图G线独立数的两倍。特别,我们给出了连通图G具有完美匹配的一个新的充要条件。     

A theorem of Yu. A. Aminov

We give a simple proof of a somewhat stronger theorem of Yu. A. Aminov concerning a lower estimate of the diameter of a surface immersed in R, this estimate being a function of the mean curvature of the surface and of its Ricci curvature. Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 45, pp. 53–55, 1974.     

方阵开n次方的一个实用准则

得出了由方阵Ａ的幂秩判定Ａ能否开ｎ次方的一个实用准则,同时也获得了确定Ａ的约旦标准形结构的一个结果。     

On The Nodes of A Linear Projection of A Space Curve: A Uniqueness Problem

We study uniqueness of plane curves with prescribed set of nodes arising from a general linear projection of a given smooth irreducible space curve.     

A generalization of a theorem of A. Grothendieck

In this article we characterize the quasi‐barrelledness of the projective tensor product of a coechelon space of type one k ¹(A) with a Fréchet space, including homological conditions as exactness properties of the corresponding tensor product functor k ¹(A) ·: ? → ??, acting from the category of Fréchet spaces to the category of linear spaces, resp. the vanishing of its first right derivative Tor¹_π (k ¹(A),.). This generalizes and extends a classical theorem of A. Grothendieck ([13, Chap. II, §4, No. 3, Theorem 15]). Further we present an analogous theorem for complete coechelon spaces of type zero and the injective tensor product and results concerning the stronger property of barrelledness. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Nonnegative Rank Factorization of a Nonnegative Matrix A with A A ≥0

In this article we obtain a nonnegative rank factorization of nonnegative matrices A satisfying one or both of the following conditions: (i) AA † ≥0 (ii) A † A ≥0, thus providing a new set of conditions that guarantee the existence of a nonnegative least-squares solution of a linear system. Indeed, the characterization of such matrices improves some of the previous known conditions for the existence of a nonnegative least-squares solution of a linear system.     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

ON A THEOREM OF A.A. LYAPUNOV

Abstract

In this note we obtain some extensions and an approximation of the Lyapunov convexity theorem by means of the bilinear integration of a set-valued function. The integration is performed successively with respect to a non-atomic, a direct sum and a Darboux vector measure. The necessary counterexamples are provided.     

A Contribution to a Conjecture of A. Saito

 A. Saito conjectured that every finite 3-connected line graph of diameter at most 3 is hamiltonian unless it is the line graph of a graph obtained from the Petersen graph by adding at least one pendant edge to each of its vertices. Here we shall see that a line graph of connectivity 3 and diameter at most 3 has a hamiltonian path. Received: May 31, 2000 Final version received: August 17, 2001 RID="*" ID="*" This work has partially been supported by DIMATIA, Grant 201/99/0242, Grant Agency of the Czech Republic AMS subject classification: 05C45, 05C40