紧支撑正交的二维小波

基于Householder矩阵扩充,构造了紧支撑正交的二维小波,所构造小波函数的支撑不超过尺度函数的支撑,并且给出了容易实施的显式构造算法．另外,还通过构造反例说明Riesz定理不适用于二元三角多项式．最后,构造了算例．     

基于Cayley变换的紧支撑二元正交小波滤波器组的构造

构造正交滤波器组,在多相域里就等价于构造仿酉矩阵,而仿酉矩阵的构造涉及到非线性方程组的求解.通过对Cayley变换的研究,把仿酉矩阵的构造转换为更易构造的仿斜厄米特矩阵,基于这种变换构造了二元紧支撑正交小波滤波器组,并给出了算例.     

关于超一致空间的一个注记

最近,张德学引入了拓扑构造的co-tower扩张这一概念,并证明了不分明拓扑学中若干熟知的范畴构造可以表示为较为简单的范畴构造的co-tower扩张.本文证明了由J.GutiérrezGarcía和M.A.dePradaVicente[3]引入的超一致空间构造SUS具体同构与R.Lowen[9]意义下的不分明一致空间构造FUS的cco-tower扩张的一个满子构造,而已知FUS同构于一致空间构造的co-tower扩张.     

线性代数中的构造法

根据线性代数抽象难懂的特点,在构造法的基础上,结合教学实际,举例给出了构造行列式、构造矩阵、构造结论、构造函数、构造几何图形、构造反例、构造趣题等思想方法,使学生较好地掌握线性代数的有关知识,有助于培养学生的抽象思维和创新能力.     

A_n型迭代倾斜代数与n-完全代数

Iyama从有限表示型遗传代数出发通过构造锥的方法构造出了一类n-完全代数和绝对n-完全代数,通过构造倾斜模的自同态环来构造了一类n-完全代数和绝对n-完全代数.从而,我们从不同的角度对n-完全代数进行了刻画.     

Markov骨架过程的构造

本文讨论了Markov骨架过程的构造问题,把Dovb构造Markov过程的方法推广到Markov骨架过程的构造.     

浅析构造思想在高等数学中的应用

本文对高等数学中的构造思想进行了一定程度的探究,主要分析说叫了构造思想在高等数学中的重要地位及其应用,重点沦述了反例的构造,为高等数学教学提供了一个有效的辅助方法。     

齐家古龙凹陷葡萄花油层顶面构造演化史研究

古构造演化史的研究是目前解决油气运移的难题之一,尤其是油气运聚期的古构造格局的恢复对搞清油气分布具有非常重要的意义.以典型构造-岩性油气藏的齐家-古龙凹陷葡萄花油层为例,阐述了古构造图恢复的重点环节——古厚度恢复,得出断层归位、压实恢复和剥蚀恢复是决定古厚度恢复成败的三个关键技术,详细并解析了其具体实现原理和方法.在此基础上,结合沉积补偿原理完成了目标区葡萄花油层顶面古构造演化史的恢复,研究发现,葡萄花油层经历了三个重要沉积阶段:自沉积起至嫩四段沉积末期为持续沉降阶段,嫩五段沉积末期至今为萎缩抬升阶段;明二段段沉积末期为构造定型阶段,其中,凹陷周边早期发育的鼻状构造及背斜构造为油气运聚有利构造位置,这对该区下一步油气的勘探具有重要的指导意义.     

某些包含最多纯净两因子交互效应2_Ⅲ~(m-(m-k))设计的一种构造方法(英文)

本文给出了构造包含最多纯净两因子交互效应2Ⅲm-(m-k)设计的一种方法.对于某些设计参数m和k,验证了所构造的设计包含纯净两因子交互效应的数量多于Tang et al.(2002)所构造的设计.并且所构造的设计都给出了格子点表示.     

边缘线性化方法构造的Fuzzy系统及其逼近性能分析

给出了基于边缘线性化方法构造的Fuzzy系统输出函数的一般表达式,揭示了该方法的插值机理,证明了由其构造的Fuzzy系统输出函数可归结为插值函数的形式,在此基础上,分析了该方法所构造的Fuzzy系统的逼近误差.仿真实验表明,边缘线性化方法构造的Fuzzy系统对非线性连续函数具有很高的逼近精度.     

First order difference system- existence and uniqueness

In this paper, the general solution of the homogeneous matrix difference system is constructed in terms of two fundamental matrix solutions. The general solution of the inhomogeneous matrix difference system is established by the variation of parameters formula. A unique solution of the two-point boundary value problem associated with the matrix difference system is constructed by applying the QR-algorithm and the Bartels-Stewart algorithm.

     

互反判断矩阵一致性指标研究

首先给出了互反判断矩阵与一致性互反判断矩阵集之间距离的定义,基于此定义,提出了一个新的互反判断矩阵一致性指标,并给出了此一致性指标的度量方法。对于不满足此一致性指标的互反判断矩阵,提出了一个迭代算法来提高其一致性程度。得出了群体互反判断矩阵一致性指标的下界,为提出的一致性指标应用于群决策问题提供了理论基础。最后用数值例子说明了该迭代算法的可行性和有效性以及群决策中的相关结论。     

A general finite element preconditioning for the conjugate gradient method

Discretizing a symmetric elliptic boundary value problem by a finite element method results in a system of linear equations with a symmetric positive definite coefficient matrix. This system can be solved iteratively by a preconditioned conjugate gradient method. In this paper a preconditioning matrix is proposed that can be constructed for all finite element methods if a mild condition for the node numbering is fulfilled. Such a numbering can be constructed using a variant of the reverse Cuthill-McKee algorithm.     

一个二元矩阵插值连分式的展开式

本文借助于文[1]定义的一种实用的矩阵广义逆,构造了一个二元Stieltjes型矩阵值插值连分式的展开式,它的截断分式可以定义二元矩阵值插值函数.     

一种求布尔矩阵传递闭包的基于自反矩阵构造的平方算法

首先,介绍布尔矩阵传递闭包的概念及计算问题;随后,分析布尔矩阵的传递闭包和由该布尔矩阵与单位矩阵取并所得到的自反矩阵的传递闭包之间的关系;最后,利用上述结果给出一种求解布尔矩阵传递闭包的基于自反矩阵构造的平方算法,并通过实例说明了其具体计算过程.     

On graphs with exactly one anti-adjacency eigenvalue and beyond

The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping in each row and each column only the distances equal to 1. The (anti-)adjacency eigenvalues of a graph are those of its (anti-)adjacency matrix. Employing a novel technique introduced by Haemers (2019) [9], we characterize all connected graphs with exactly one positive anti-adjacency eigenvalue, which is an analog of Smith's classical result that a connected graph has exactly one positive adjacency eigenvalue iff it is a complete multipartite graph. On this basis, we identify the connected graphs with all but at most two anti-adjacency eigenvalues equal to ?2 and 0. Moreover, for the anti-adjacency matrix we determine the HL-index of graphs with exactly one positive anti-adjacency eigenvalue, where the HL-index measures how large in absolute value may be the median eigenvalues of a graph. We finally propose some problems for further study.     

调和Bergman度量

We have constructed the positive definite metric matrixes for the bounded domains of Rn and proved an inequality which is about the Jacobi matrix of a harmonic mapping on a bounded domain of Rn and the metric matrix of the same bounded domain.     

New families of graphs determined by their generalized spectrum

We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. All graphs constructed here satisfy a certain extremal divisibility condition for the determinant of their walk matrix.     

矩阵方程AXB+CYD=E对称最小范数最小二乘解的极小残差法

<正>1引言本文用R~(n×m)表示全体n×m实矩阵集合,用SR~(n×n)表示全体n×n实对称矩阵集合,OR~(n×n)表示全体n×n实正交矩阵集合.用I_n表示n阶单位矩阵,用A*B表示矩阵A与B的Hadamard乘积.对任意矩阵A,B∈R~(n×m),定义内积〈A,B〉=tr(B~T A),其中     

A note for preconditioning nonsymmetric matrices

In this paper, we consider preconditioners for generalized saddle point systems with a nonsymmetric coefficient matrix. A constraint preconditioner for this systems is constructed, and some spectral properties of the preconditioned matrix are given. Our results extend the corresponding ones in [3] and [4].