共查询到20条相似文献,搜索用时 15 毫秒
1.
Roberto Pignatelli 《Mathematische Zeitschrift》2012,270(1-2):403-422
We classify the minimal surfaces of general type with K 2 ≤ 4χ ? 8 whose canonical map is composed with a pencil, up to a finite number of families. More precisely we prove that there is exactly one irreducible family for each value of ${\chi \gg 0,\,4\chi-10 \leq K^2 \leq 4\chi-8}$ . All these surfaces are complete intersections in a toric 4-fold and bidouble covers of Hirzebruch surfaces. The surfaces with K 2 = 4χ ? 8 were previously constructed by Catanese as bidouble covers of ${\mathbb{P}^1 \times \mathbb{P}^1}$ . 相似文献
2.
This paper concerns the problem of canonical factorization of a rational matrix functionW() which is analytic but may benot invertible at infinity. The factors are obtained explicitly in terms of the realization of the original matrix function. The cases of symmetric factorization for selfadjoint and positive rational matrix functions are considered separately. 相似文献
3.
We develop stable algorithms for the computation of the Kronecker structure of an arbitrary pencil. This problem can be viewed as a generalization of the well-known eigenvalue problem of pencils of the type λI?A. We first show that the elementary divisors (λ ? α)i of a regular pencil λB?A can be retrieved with a deflation algorithm acting on the expansion (λ ? α)B ? (A ? αB). This method is a straightforward generalization of Kublanovskaya's algorithm for the determination of the Jordan structure of a constant matrix. We also show how to use this method to determine the structure of the infinite elementary divisors of λB?A. In the case of singular pencils, the occurrence of Kronecker indices—containing the singularity of the pencil—somewhat complicates the problem. Yet our algorithm retrieves these indices with no additional effort, when determining the elementary divisors of the pencil. The present ideas can also be used to separate from an arbitrary pencil a smaller regular pencil containing only the finite elementary divisors of the original one. This is shown to be an effective tool when used together with the QZ algorithm. 相似文献
4.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》1989,47(6):2834-2842
An algorithm is proposed for computing the structure of the Kronecker canonical form for a singular linear matrix pencil.
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Institute im. V. A. Steklova AN SSSR,
Vol. 159, pp. 23–32, 1987. 相似文献
5.
Israel S. Kac 《Integral Equations and Operator Theory》2000,38(4):437-457
The term dual string for scalar strings was introduced in [KK1], where some connections between the spectra of a string and its dual were studied. In [KK2] it was shown that if () is a spectral function of a scalar stringS
1 with nonnegative spectrum (in the sense of [KK2]), then the function
is a spectral function of the string (S
d)0 which isfully dual toS
1. This result was generalized to regular matrix strings with continuous invertible matrix densities by H. Dym and L. A. Sakhnovich [DS]. In the present work we generalize in part the mentioned result from [DS] to matrix strings that may be singular, and may have matrix density that is everywhere discontinuous and noninvertible on a set of positive measure. 相似文献
6.
R.C. Thompson 《Linear algebra and its applications》1976,14(2):135-177
Given n-square Hermitian matrices A,B, let Ai,Bi denote the principal (n?1)- square submatrices of A,B, respectively, obtained by deleting row i and column i. Let μ, λ be independent indeterminates. The first main result of this paper is the characterization (for fixed i) of the polynomials representable as det(μAi?λBi) in terms of the polynomial det(μA?λB) and the elementary divisors, minimal indices, and inertial signatures of the pencil μA?λB. This result contains, as a special case, the classical interlacing relationship governing the eigenvalues of a principal sub- matrix of a Hermitian matrix. The second main result is the determination of the number of different values of i to which the characterization just described can be simultaneously applied. 相似文献
7.
8.
There are basic equivalent assertions known for operator monotone functions and operator convex functions in two papers by Hansen and Pedersen. In this note we consider their results as correlation problem between two sequences of matrix n-monotone functions and matrix n-convex functions, and we focus the following three assertions at each label n among them:
- (i) f(0)0 and f is n-convex in [0,α),
- (ii) For each matrix a with its spectrum in [0,α) and a contraction c in the matrix algebra Mn,f(cac)cf(a)c,