共查询到20条相似文献,搜索用时 109 毫秒
1.
一元二次方程的根的判别式是初中代数的重要内容之一 ,它在中学数学中有着广泛的应用 ,成为近几年全国各地中考的热点问题 .为了帮助读者更好地掌握好这部分知识内容 ,现对它在初中数学中的应用进行归纳 ,以餮读者 .应用一 :判断一元二次方程 (或二元二次方程组 )的根的情况 ;或已知根的情况 ,求方程 (或组 )中的待定系数的取值范围 .一元二次方程ax2 +bx +c =0 (a≠ 0 )的根的判别式为△ =b2 - 4ac,它与这个方程的根有着十分密切的关系 :( 1)△ >0 方程有两个不等的实数根 ;( 2 )△ =0 方程有两个相等的实数根 .( 3)△ <0 方程… 相似文献
2.
Let G(V, E) be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V(Cm). The G - E(Cm) are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui : i = 1, 2 , m}. Let κ = ec+1. Forj = 1,2,...,k- 1, let δij = max{dv : dist(v, ui) = j,v ∈ Ti}, δj = max{δij : i = 1, 2,..., m}, δ0 = max{dui : ui ∈ V(Cm)}. Then λ1(G)≤max{max 2≤j≤k-2 (√δj-1-1+√δj-1),2+√δ0-2,√δ0-2+√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 (G) is the largest eigenvalue of the adjacency matrix of G. 相似文献
3.
4.
本文研究纯正的群的正则带.在给出这类半群的若干特征后,建立了纯正的群的正则带的构造定理.作为应用,同时给出了纯正的群的右拟正规带的构造定理. 相似文献
5.
图的邻域复形的同调群的不变性 总被引:1,自引:0,他引:1
彭允 《数学年刊A辑(中文版)》1990,(6)
本文研究了图的邻域复形同调群的不变性质。设G是一个简单连通图,x是G的一个顶点,以G/x表示G中剔去点v及其关联边而得到的图,给出了G和G/x的邻域复形的同阶同调群同构的充要条件。 相似文献
6.
利用已知的代数的同调满同态来构造其张量积代数的同调满同态.设A,B,C,D是域k上的有限维代数,如果环同态f:A→C和g:B→D是环的同调满同态,则fg:AB→CD也是环的同调满同态. 相似文献
7.
8.
(一)导言球的表面积公式是旋转体一章的重点内容,从教材的科学性看是没有问题的——在给出预备定理的基础上,再建立球面积的计算公式。但跳出传授知识之外,在教学中我们总有点感到不满足。因为按照现行教材的体系。我们无法回答这样几个问题: 已经有一整套圆柱、圆锥、圆台的侧面积公式,为什么还需要这个统一公式? 这个预备定理起什么作用?人们又是怎样想到引入这个定理的? 讲授预备定理是不是仅仅为了学习球面积公式提供敲门砖,还是也要让学生获得别的什么? 针对这些问题,我们的试验小组对此作了初步的探讨。现将我们讨论的意见和处理方案扼要介绍如下。不当之处请批评指正。 相似文献
9.
10.
11.
Suppose F is a field consisting of at least four elements. Let Mn(F) and SP2n(F) be the linear space of all n×n matrices and the group of all 2n×2n symplectic matrices over F, respectively. A linear operator L:M2n(F)→M2n(F) is said to preserve the symplectic group if L(SP2n(F))=SP2n(F). It is shown that L is an invertible preserver of the symplectic group if and only if L takes the form (i) L(X)=QPXP-1 for any X∈M2n(F) or (ii) L(X)=QPXTP-1 for any X∈M2n(F), where Q∈SP2n(F) and P is a generalized symplectic matrix. This generalizes the result derived by Pierce in Canad J. Math., 3(1975), 715-724. 相似文献
12.
The Cartan matrix for the finite symplectic group Sp(6, 3) over a field of three elements is computed in this paper by using a computer and the MATLAB software.2000 Mathematics Subject Classification: 20C33 20C40, 20G05Supported in part by the NNSFC (10271088) and the Foundation for the University Science and Technology Development of Shanghai. 相似文献
13.
反对称矩阵的一种计算方法 总被引:1,自引:0,他引:1
本文讨论反对称矩阵的数值计算问题.指出联立方程求解可以用分块矩阵LDLT算法.对于反对称阵的辛本征问题论述了辛雅可比算法,辛Householder变换.分块三对角化等.对最优控制、结构力学、波的传播等,是一种好的算法. 相似文献
14.
15.
16.
1.引言若不特别说明,以下记号都是常规的,可参见山.在最优控制中占有核心地位的代数Xiccati方程(ARE)有两种基本形式:连续型的ARE(CARE):离散型的**E(**RE):其中只兄见NE贮””,GIE皿””m,GZE*m”m,in<2,*T二K>风*T二N>几*2二*2>凡从应用角度看,主要关心**E的对称半正定解.对于**RE,已有大量的研究工作.特别,陈春晖门、徐树方问、Ghwimi-Laub同等研究了扰动理论.对于DARE,它与***E的一个明显区别是:**M是二次矩阵方程而***E具有高度非线性.这种区别使得DARE远为复杂… 相似文献
17.
Mateja Grašič 《Linear and Multilinear Algebra》2013,61(8):1007-1022
We show that the Lie algebra ? of skew-symmetric matrices with respect to either transpose or symplectic involution is zero product determined. This means that every bilinear map {·,·} from ? × ? into a vector space X is of the form {x, y} = T ([x, y]) for some linear map T provided that the following condition is fulfilled: [x, y] = 0 implies {x, y} = 0. 相似文献
18.
The Cauchy-Hua measure is the probability on the set ofn×n real symmetric matrices of densitys C
n/det(I + s
2)(n + 1)/2
. For any probability measure on the set ofn×n real symmetric matrices, we define (if verifies an additional condition) the image of by a 2n×2n real symplectic matrix, and we introduce the type of . Then, the type of the Cauchy-Hua measure is characterized from its invariance by the symplectic group. 相似文献
19.
Mateja Grašič 《Linear and Multilinear Algebra》2013,61(6):671-685
We show that the Jordan algebra 𝒮 of symmetric matrices with respect to either transpose or symplectic involution is zero product determined. This means that if a bilinear map {.,?.} from 𝒮?×?𝒮 into a vector space X satisfies {x, y}?=?0 whenever x?○?y?=?0, then there exists a linear map T : 𝒮?→?X such that {x,?y}?=?T(x?○?y) for all x, y?∈?𝒮 (here, x?○?y?=?xy?+?yx). 相似文献
20.
Heike Fassbender 《BIT Numerical Mathematics》2000,40(3):471-496
A rounding error analysis of the symplectic Lanczos algorithm for the symplectic eigenvalue problem is given. It is applicable when no break down occurs and shows that the restriction of preserving the symplectic structure does not destroy the characteristic feature of nonsymmetric Lanczos processes. An analog of Paige's theory on the relationship between the loss of orthogonality among the Lanczos vectors and the convergence of Ritz values in the symmetric Lanczos algorithm is discussed. As to be expected, it follows that (under certain assumptions) the computed J-orthogonal Lanczos vectors loose J-orthogonality when some Ritz values begin to converge. 相似文献