نتایج جستجو برای: finite rank linear transformation

تعداد نتایج: 969753  

Journal: :Inf. Comput. 2006
Jakob Grue Simonsen

We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are non-collapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved across direct sum of a finite number of systems. • Normalization is not preserved across direct sum o...

Journal: :CoRR 2014
Daniel Augot

Abstract— We transpose the theory of rank metric and Gabidulin codes to the case of fields which are not finite fields. The Frobenius automorphism is replaced by any element of the Galois group of a cyclic algebraic extension of a base field. We use our framework to define Gabidulin codes over the field of rational functions using algebraic function fields with a cyclic Galois group. This gives...

Journal: :bulletin of the iranian mathematical society 2011
a. kumar das

2003
Andrea Saltelli

Rank transformations are frequently employed in numerical experiments involving a computational model, especially in the context of sensitivity and uncertainty analyses. Response surface replacement and parameter screening are tasks which may benefit from a rank transformation. Ranks can cope with nonlinear (albeit monotonic) input-output distributions, allowing the use of linear regression tec...

2008
Robert Lockhart

It is well known that the set of separable pure states is measure 0 in the set of pure states. Herein we extend this fact and show that the set of rank r separable states is measure 0 in the set of rank r states provided r is not maximal rank. Recently quite a few authors have looked at low rank separable and entangled states. (See [1] and the references therein and [2].) Therefore it makes sen...

Journal: :CoRR 2017
Filip de Roos Philipp Hennig

Solving symmetric positive definite linear problems is a fundamental computational task in machine learning. The exact solution, famously, is cubicly expensive in the size of the matrix. To alleviate this problem, several linear-time approximations, such as spectral and inducing-point methods, have been suggested and are now in wide use. These are low-rank approximations that choose the low-ran...

Journal: :iranian journal of science and technology (sciences) 2009
m. mursaleen

lorentz characterized the almost convergence through the concept of uniform convergence of de lavallée-poussin mean. in this paper, we generalize the notion of almost convergence by using the concept ofinvariant mean and the generalized de la vallée-poussin mean. we determine the bounded linear operators forthe generalized σ-conservative, σ-regular and σ-coercive matrices.

Journal: :International Journal of Economics and Finance 2018

Journal: :Eur. J. Comb. 2008
Alice Devillers

A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Graphs and linear spaces are particular cases of partial linear spaces. A partial linear space which is neither a graph nor a linear space is called proper. The aim of this paper is to c...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید