نتایج جستجو برای: rank k numerical range

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

Journal: :Annals of Functional Analysis 2015

Journal: :international journal of group theory 0
sandor szabo institute of mathematics and informatics university of pecs

‎three infinite families of finite abelian groups will be‎ ‎described such that each member of these families has‎ ‎the r'edei $k$-property for many non-trivial values of $k$‎.

Journal: :Applied Mathematics and Computation 2014
Panayiotis J. Psarrakos Michael J. Tsatsomeros

The envelope, EðAÞ, of a complex square matrix A is a region in the complex plane that contains the spectrum of A and is contained in the numerical range of A. The envelope is compact but not necessarily convex or connected. The connected components of EðAÞ have the potential of isolating the eigenvalues of A, leading us to study its geometry, boundary, and number of components. We also examine...

2017
Lutz Kämmerer Toni Volkmer

The reconstruction of high-dimensional sparse signals is a challenging task in a wide range of applications. In order to deal with high-dimensional problems, efficient sparse fast Fourier transform algorithms are essential tools. The second and third authors have recently proposed a dimension-incremental approach, which only scales almost linear in the number of required sampling values and alm...

Journal: :Linear Algebra and its Applications 2010

1999
Surajit Chaudhuri Luis Gravano

In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the “top k” tuples that best match the given attribute values. In this paper, we study the advantages and limitations of processing a top-k query by translating it into a single range query that traditiona...

Journal: :Foundations of Computational Mathematics 2016
Éric Schost Pierre-Jean Spaenlehauer

Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix M , the goal is to compute a matrix M ′ of given rank r in a linear or affine subspace E of matrices (usually encoding a specific structure) such that the Frobenius distance ‖M −M ′‖ is small. We propose a Newton-like iteration for solving ...

Journal: :Acta Universitatis Sapientiae, Mathematica 2017

Journal: :SIAM J. Matrix Analysis Applications 2011
Per-Gunnar Martinsson

Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are; specifically, the class of so called Hierarchically Semi-Separable (HSS) matric...

Journal: :Journal of Physics: Conference Series 2010

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

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