#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1990

2017

- This year (1)
- Last 5 years (14)
- Last 10 years (37)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ivan V. Oseledets, Eugene E. Tyrtyshnikov
- SIAM J. Scientific Computing
- 2009

- Bernhard Beckermann, S. A. Goreinov, Eugene E. Tyrtyshnikov
- SIAM J. Matrix Analysis Applications
- 2005

Starting from an GMRES error estimate proposed by Elman in terms of the ratio of the smallest eigenvalue of the hermitian part and the norm of some non-symmetric matrix, we propose some asymptotically tighter bound in terms of the same ratio. Here we make use of a recent deep result of Crouzeix et al. on the norm of functions of matrices.

- Eugene E. Tyrtyshnikov
- Computing
- 2000

The mosaic-skeleton method was bred in a simple observation that rather large blocks in very large matrices coming from integral formulations can be approximated accurately by a sum of just few rank-one matrices (skeletons). These blocks might correspond to a region where the kernel is smooth enough, and anyway it can be a region where the kernel is… (More)

- Ivan V. Oseledets, Dmitry V. Savostyanov, Eugene E. Tyrtyshnikov
- SIAM J. Matrix Analysis Applications
- 2008

We consider Tucker-like approximations with an r × r × r core tensor for three-dimensional n × n × n arrays in the case of r n and possibly very large n (up to 10 4 − 10 6). As the approximation contains only O(rn + r 3) parameters, it is natural to ask if it can be computed using only a small amount of entries of the given array. A similar question for… (More)

If a matrix has a small rank then it can be multiplied by a v ector with many s a vings in memory and arithmetic. As was recently shown by the author, the same applies to the matrices which might be of full classical rank but have a small mosaic rank. The mosaic-skeleton approximations seem to have imposing applications to the solution of large dense… (More)

- Wolfgang Hackbusch, Boris N. Khoromskij, Eugene E. Tyrtyshnikov
- J. Num. Math.
- 2005

The goal of this work is the presentation of some new formats which are useful for the approximation of (large and dense) matrices related to certain classes of functions and nonlocal (integral, integro-differential) operators, especially for high-dimensional problems. These new formats elaborate on a sum of few terms of Kronecker products of smaller-sized… (More)

- Vladimir A. Kazeev, Boris N. Khoromskij, Eugene E. Tyrtyshnikov
- SIAM J. Scientific Computing
- 2013

Multilevel Toeplitz matrices generated by QTT tensor-structured vectors and convolution with logarithmic complexity Abstract We consider two operations in the QTT format: composition of a multilevel Toeplitz matrix generated by a given multidimensional vector and convolution of two given multidimensional vectors. We show that low-rank QTT structure of the… (More)

- Vasily Strela, Eugene E. Tyrtyshnikov
- Math. Comput.
- 1996

The eigenvalue clustering of matrices S −1 n An and C −1 n An is experimentally studied, where An, Sn and Cn respectively are Toeplitz matrices, Strang, and optimal circulant preconditioners generated by the Fourier expansion of a function f (x). Some illustrations are given to show how the clustering depends on the smoothness of f (x) and which… (More)

- Richard A. Brualdi, Volker Mehrmann, +8 authors Eugene Tyrtyshnikov
- 1992

DESCRIPTION. Linear Algebra and its Applications publishes articles that contribute new information or new insights to matrix theory and finite dimensional linear algebra in their algebraic, arithmetic, combinatorial, geometric, or numerical aspects. It also publishes articles that give significant applications of matrix theory or linear algebra to other… (More)