Add to ORKGA general proposal is presented for fast algorithms for multilevel structured matrices. It is based on investigation of their tensor properties and develops the idea recently introduced by J. Kamm and J. G. Nagy in the block Toeplitz case. We show that tensor properties of multilevel Toeplitz matrices are related to separation of variables in the corresponding symbol, present analytical tools to study the latter, expose truncation algorithms preserving the structure, and report on some numerical results confirming advantages of the proposal. AMS classification: 15A12; 65F10; 65F1
Meshless collocation methods based on radial basis functions lead to structured linear systems, whic...
In this paper, we present several high performance variants of the classical Schur algorithm to fact...
s. We avoid singularity in this algorithm and run it in an arbitrary field by using randomization. W...
A general proposal is presented for fast algorithms for multilevel structured ma-trices. It is based...
AbstractA general proposal is presented for fast algorithms for multilevel structured matrices. It i...
Abstract A fast approximate inversion algorithm is proposed for two-level Toeplitz matrices (block T...
Plusieurs problèmes en mathématiques appliquées requièrent la résolution de systèmes linéaires de tr...
This thesis considers problems of stability, rank estimation and conditioning for structured matrice...
special session "Tensor Computations in Linear and Multilinear Algebra"Tensor decompositions permit ...
When dealing with large linear systems with a prescribed structure, two key ingredients are importan...
ces using Newton iteration and tensor-displacement structure Vadim Olshevsky, Ivan Oseledets and Eug...
Matrices with the structures of Toeplitz, Hankel, Vandermonde and Cauchy types are om-nipresent in m...
In the last decades several matrix algebra optimal and superlinear preconditioners (those assuring a...
Meshless collocation methods based on radial basis functions lead to structured linear systems, whic...
In this paper, we present several high performance variants of the classical Schur algorithm to fact...
s. We avoid singularity in this algorithm and run it in an arbitrary field by using randomization. W...
A general proposal is presented for fast algorithms for multilevel structured ma-trices. It is based...
AbstractA general proposal is presented for fast algorithms for multilevel structured matrices. It i...
Abstract A fast approximate inversion algorithm is proposed for two-level Toeplitz matrices (block T...
Plusieurs problèmes en mathématiques appliquées requièrent la résolution de systèmes linéaires de tr...
This thesis considers problems of stability, rank estimation and conditioning for structured matrice...
special session "Tensor Computations in Linear and Multilinear Algebra"Tensor decompositions permit ...
When dealing with large linear systems with a prescribed structure, two key ingredients are importan...
ces using Newton iteration and tensor-displacement structure Vadim Olshevsky, Ivan Oseledets and Eug...
Matrices with the structures of Toeplitz, Hankel, Vandermonde and Cauchy types are om-nipresent in m...
In the last decades several matrix algebra optimal and superlinear preconditioners (those assuring a...
Meshless collocation methods based on radial basis functions lead to structured linear systems, whic...
In this paper, we present several high performance variants of the classical Schur algorithm to fact...
s. We avoid singularity in this algorithm and run it in an arbitrary field by using randomization. W...