AbstractWe present an algorithm for multiplying an N × N recursive block Toeplitz matrix by a vector with cost O (N log N). Its application to optimal surface interpolation is discussed
AbstractWe present some recurrences that are the basis for an algorithm to invert an n×n Toeplitz sy...
AbstractA method of derivation of parallel algorithms for (N + 1) × (N + 1) matrices with recursive ...
AbstractAn effective algorithm of [M. Morf, Ph.D. Thesis, Department of Electrical Engineering, Stan...
Structured linear algebra techniques are a versatile set of tools; they enable one to deal at once w...
Several problems in applied mathematics require the solving of linear systems with very large sizes,...
AbstractThis paper is concerned with the development of fast solvers for block linear systems with T...
International audienceWe present a non-commutative algorithm for the multiplication of a 2x2-block-m...
AbstractD. Sweet's clever QR decomposition algorithm for Toeplitz matrices is considered. It require...
There exist algorithms, also called "fast" algorithms, which exploit the special structure of Toepli...
AbstractWe give a weakly stable algorithm to solve a block Toeplitz system of linear equations. If t...
Cette thèse vise à la conception de nouveaux algorithmes rapides en calcul numérique via les matrice...
In this paper a new order recursive algorithm for the efficient −1 factorization of Toeplitz matric...
AbstractA fast solution algorithm is proposed for solving block banded block Toeplitz systems with n...
AbstractIn a recent paper, we introduced a new look-ahead algorithm for recursively computing Padé a...
AbstractIn this paper, we present several high performance variants of the classical Schur algorithm...
AbstractWe present some recurrences that are the basis for an algorithm to invert an n×n Toeplitz sy...
AbstractA method of derivation of parallel algorithms for (N + 1) × (N + 1) matrices with recursive ...
AbstractAn effective algorithm of [M. Morf, Ph.D. Thesis, Department of Electrical Engineering, Stan...
Structured linear algebra techniques are a versatile set of tools; they enable one to deal at once w...
Several problems in applied mathematics require the solving of linear systems with very large sizes,...
AbstractThis paper is concerned with the development of fast solvers for block linear systems with T...
International audienceWe present a non-commutative algorithm for the multiplication of a 2x2-block-m...
AbstractD. Sweet's clever QR decomposition algorithm for Toeplitz matrices is considered. It require...
There exist algorithms, also called "fast" algorithms, which exploit the special structure of Toepli...
AbstractWe give a weakly stable algorithm to solve a block Toeplitz system of linear equations. If t...
Cette thèse vise à la conception de nouveaux algorithmes rapides en calcul numérique via les matrice...
In this paper a new order recursive algorithm for the efficient −1 factorization of Toeplitz matric...
AbstractA fast solution algorithm is proposed for solving block banded block Toeplitz systems with n...
AbstractIn a recent paper, we introduced a new look-ahead algorithm for recursively computing Padé a...
AbstractIn this paper, we present several high performance variants of the classical Schur algorithm...
AbstractWe present some recurrences that are the basis for an algorithm to invert an n×n Toeplitz sy...
AbstractA method of derivation of parallel algorithms for (N + 1) × (N + 1) matrices with recursive ...
AbstractAn effective algorithm of [M. Morf, Ph.D. Thesis, Department of Electrical Engineering, Stan...