Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 15

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Possible numbers ofx’s in an {x,y}-matrix with a given rank

100%
Ma C.
Open Mathematics
|
2017
|
tom 15
|
nr 1
974-977
EN
Let x, y be two distinct real numbers. An {x, y}-matrix is a matrix whose entries are either x or y. We determine the possible numbers of x’s in an {x, y}-matrix with a given rank. Our proof is constructive.
2
Content available remote

Bilinear characterizations of companion matrices

76%
Lin M., Wimmer H. K.
Special Matrices
|
2014
|
tom 2
|
nr 1
EN
Companion matrices of the second type are characterized by properties that involve bilinear maps.
3
Content available remote

On some infinite dimensional linear groups

76%
Kurdachenko L., Sadovnichenko A., Subbotin I.
Open Mathematics
|
2009
|
tom 7
|
nr 2
176-185
EN
Let F be a field, A be a vector space over F, and GL(F,A) the group of all automorphisms of the vector space A. A subspace B of A is called nearly G-invariant, if dimF(BFG/B) is finite. A subspace B is called almost G-invariant, if dimF(B/CoreG(B)) is finite. In the present article we begin the study of subgroups G of GL(F,A) such that every subspace of A is either nearly G-invariant or almost G-invariant. More precisely, we consider the case when G is a periodic p′-group where p = charF.
4
Content available remote

Dual Lattice of ℤ-module Lattice

76%
Futa Y., Shidama Y.
Formalized Mathematics
|
2017
|
tom 25
|
nr 2
157-169
EN
In this article, we formalize in Mizar [5] the definition of dual lattice and their properties. We formally prove that a set of all dual vectors in a rational lattice has the construction of a lattice. We show that a dual basis can be calculated by elements of an inverse of the Gram Matrix. We also formalize a summation of inner products and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic systems with lattice [20], [10] and [19].
5
Content available remote

Isomorphism Theorem on Vector Spaces over a Ring

76%
Futa Y., Shidama Y.
Formalized Mathematics
|
2017
|
tom 25
|
nr 3
171-178
EN
In this article, we formalize in the Mizar system [1, 4] some properties of vector spaces over a ring. We formally prove the first isomorphism theorem of vector spaces over a ring. We also formalize the product space of vector spaces. ℤ-modules are useful for lattice problems such as LLL (Lenstra, Lenstra and Lovász) [5] base reduction algorithm and cryptographic systems [6, 2].
6
Content available remote

Infinite dimensional linear groups with many G - invariant subspaces

76%
Kurdachenko L., Sadovnichenko A., Subbotin I.
Open Mathematics
|
2010
|
tom 8
|
nr 2
261-265
EN
Let F be a field, A be a vector space over F, GL(F, A) be the group of all automorphisms of the vector space A. A subspace B of A is called nearly G-invariant, if dimF(BFG/B) is finite. A subspace B is called almost G-invariant, if dim F(B/Core G(B)) is finite. In the current article, we study linear groups G such that every subspace of A is either nearly G-invariant or almost G-invariant in the case when G is a soluble p-group where p = char F.
7
Content available remote

On sequences not enjoying Schur’s property

76%
Jiménez-Rodríguez P.
Open Mathematics
|
2017
|
tom 15
|
nr 1
233-237
EN
Here we proved the existence of a closed vector space of sequences - any nonzero element of which does not comply with Schur’s property, that is, it is weakly convergent but not norm convergent. This allows us to find similar algebraic structures in some subsets of functions.
8
Content available remote

Pairs ofk-step reachability andm-step observability matrices

76%
Ferrante A., Wimmer H. K.
Special Matrices
|
2013
|
tom 1
25-27
EN
Let V and W be matrices of size n × pk and qm × n, respectively. A necessary and sufficient condition is given for the existence of a triple (A,B,C) such that V a k-step reachability matrix of (A,B) andW an m-step observability matrix of (A,C).
9
Content available remote

Torsion Part of ℤ-module

76%
Futa Y., Okazaki H., Shidama Y.
Formalized Mathematics
|
2015
|
tom 23
|
nr 4
297-307
EN
In this article, we formalize in Mizar [7] the definition of “torsion part” of ℤ-module and its properties. We show ℤ-module generated by the field of rational numbers as an example of torsion-free non free ℤ-modules. We also formalize the rank-nullity theorem over finite-rank free ℤ-modules (previously formalized in [1]). ℤ-module is necessary for lattice problems, LLL (Lenstra, Lenstra and Lovász) base reduction algorithm [23] and cryptographic systems with lattices [24].
10
Content available remote

Equalities for orthogonal projectors and their operations

64%
Tian Y.
Open Mathematics
|
2010
|
tom 8
|
nr 5
855-870
EN
A complex square matrix A is called an orthogonal projector if A 2 = A = A*, where A* denotes the conjugate transpose of A. In this paper, we give a comprehensive investigation to matrix expressions consisting of orthogonal projectors and their properties through ranks of matrices. We first collect some well-known rank formulas for orthogonal projectors and their operations, and then establish various new rank formulas for matrix expressions composed by orthogonal projectors. As applications, we derive necessary and sufficient conditions for various equalities for orthogonal projectors and their operations to hold.
11
Content available remote

On decompositions of estimators under a general linear model with partial parameter restrictions

64%
Jiang B., Tian Y., Zhang X.
Open Mathematics
|
2017
|
tom 15
|
nr 1
1300-1322
EN
A general linear model can be given in certain multiple partitioned forms, and there exist submodels associated with the given full model. In this situation, we can make statistical inferences from the full model and submodels, respectively. It has been realized that there do exist links between inference results obtained from the full model and its submodels, and thus it would be of interest to establish certain links among estimators of parameter spaces under these models. In this approach the methodology of additive matrix decompositions plays an important role to obtain satisfactory conclusions. In this paper, we consider the problem of establishing additive decompositions of estimators in the context of a general linear model with partial parameter restrictions. We will demonstrate how to decompose best linear unbiased estimators (BLUEs) under the constrained general linear model (CGLM) as the sums of estimators under submodels with parameter restrictions by using a variety of effective tools in matrix analysis. The derivation of our main results is based on heavy algebraic operations of the given matrices and their generalized inverses in the CGLM, while the whole contributions illustrate various skillful uses of state-of-the-art matrix analysis techniques in the statistical inference of linear regression models.
12
Content available remote

A hierarchy in the family of real surjective functions

64%
Fenoy-Muñoz M., Gámez-Merino J. L., Muñoz-Fernández G. A., Sáez-Maestro E.
Open Mathematics
|
2017
|
tom 15
|
nr 1
486-501
EN
This expository paper focuses on the study of extreme surjective functions in ℝℝ. We present several different types of extreme surjectivity by providing examples and crucial properties. These examples help us to establish a hierarchy within the different classes of surjectivity we deal with. The classes presented here are: everywhere surjective functions, strongly everywhere surjective functions, κ-everywhere surjective functions, perfectly everywhere surjective functions and Jones functions. The algebraic structure of the sets of surjective functions we show here is studied using the concept of lineability. In the final sections of this work we also reveal unexpected connections between the different degrees of extreme surjectivity given above and other interesting sets of functions such as the space of additive mappings, the class of mappings with a dense graph, the class of Darboux functions and the class of Sierpiński-Zygmund functions in ℝℝ.
13
Content available remote

Matrix rank and inertia formulas in the analysis of general linear models

64%
Tian Y.
Open Mathematics
|
2017
|
tom 15
|
nr 1
126-150
EN
Matrix mathematics provides a powerful tool set for addressing statistical problems, in particular, the theory of matrix ranks and inertias has been developed as effective methodology of simplifying various complicated matrix expressions, and establishing equalities and inequalities occurred in statistical analysis. This paper describes how to establish exact formulas for calculating ranks and inertias of covariances of predictors and estimators of parameter spaces in general linear models (GLMs), and how to use the formulas in statistical analysis of GLMs. We first derive analytical expressions of best linear unbiased predictors/best linear unbiased estimators (BLUPs/BLUEs) of all unknown parameters in the model by solving a constrained quadratic matrix-valued function optimization problem, and present some well-known results on ordinary least-squares predictors/ordinary least-squares estimators (OLSPs/OLSEs). We then establish some fundamental rank and inertia formulas for covariance matrices related to BLUPs/BLUEs and OLSPs/OLSEs, and use the formulas to characterize a variety of equalities and inequalities for covariance matrices of BLUPs/BLUEs and OLSPs/OLSEs. As applications, we use these equalities and inequalities in the comparison of the covariance matrices of BLUPs/BLUEs and OLSPs/OLSEs. The work on the formulations of BLUPs/BLUEs and OLSPs/OLSEs, and their covariance matrices under GLMs provides direct access, as a standard example, to a very simple algebraic treatment of predictors and estimators in linear regression analysis, which leads a deep insight into the linear nature of GLMs and gives an efficient way of summarizing the results.
14
Content available remote

The algebraic size of the family of injective operators

64%
Bernal-González L.
Open Mathematics
|
2017
|
tom 15
|
nr 1
13-20
EN
In this paper, a criterion for the existence of large linear algebras consisting, except for zero, of one-to-one operators on an infinite dimensional Banach space is provided. As a consequence, it is shown that every separable infinite dimensional Banach space supports a commutative infinitely generated free linear algebra of operators all of whose nonzero members are one-to-one. In certain cases, the assertion holds for nonseparable Banach spaces.
15
Content available remote

Inertias and ranks of some Hermitian matrix functions with applications

53%
Zhang X., Wang Q.-W., Liu X.
Open Mathematics
|
2012
|
tom 10
|
nr 1
329-351
EN
Let S be a given set consisting of some Hermitian matrices with the same size. We say that a matrix A ∈ S is maximal if A − W is positive semidefinite for every matrix W ∈ S. In this paper, we consider the maximal and minimal inertias and ranks of the Hermitian matrix function f(X,Y) = P − QXQ* − TYT*, where * means the conjugate and transpose of a matrix, P = P*, Q, T are known matrices and for X and Y Hermitian solutions to the consistent matrix equations AX =B and YC = D respectively. As applications, we derive the necessary and sufficient conditions for the existence of maximal matrices of $$H = \{ f(X,Y) = P - QXQ* - TYT* : AX = B,YC = D,X = X*, Y = Y*\} .$$ The corresponding expressions of the maximal matrices of H are presented when the existence conditions are met. In this case, we further prove the matrix function f(X,Y)is invariant under changing the pair (X,Y). Moreover, we establish necessary and sufficient conditions for the system of matrix equations $$AX = B, YC = D, QXQ* + TYT* = P$$ to have a Hermitian solution and the system of matrix equations $$AX = C, BXB* = D$$ to have a bisymmetric solution. The explicit expressions of such solutions to the systems mentioned above are also provided. In addition, we discuss the range of inertias of the matrix functions P ± QXQ* ± TYT* where X and Y are a nonnegative definite pair of solutions to some consistent matrix equations. The findings of this pape extend some known results in the literature.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.