Fast algorithms with preprocessing for matrix-vector multiplication problems

DOI10.1006/JCOM.1994.1021zbMath0820.68051OpenAlexW1993029803MaRDI QIDQ1342512

Vadim Olshevsky, Israel Gohberg

Publication date: 11 January 1995

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/704c709ea15bd3116b23407ebe637cf979d88741

zbMATH Keywords

Cauchy matrixcomplexity of multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (18)

Complexity of multiplication with vectors for structured matrices ⋮ Pivoting and backward stability of fast algorithms for solving Cauchy linear equations ⋮ An efficient, memory-saving approach for the Loewner framework ⋮ Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices ⋮ Displacement-structure approach to polynomial Vandermonde and related matrices ⋮ The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices ⋮ Matrix structure and loss-resilient encoding/decoding ⋮ Factorizations of Cauchy matrices ⋮ On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Superfast algorithms for Cauchy-like matrix computations and extensions ⋮ An efficient solution for Cauchy-like systems of linear equations ⋮ On the complexities of multipoint evaluation and interpolation ⋮ Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices ⋮ Direct Inversion of the Three-Dimensional Pseudo-polar Fourier Transform ⋮ M-positive semi-definiteness and M-positive definiteness of fourth-order partially symmetric Cauchy tensors ⋮ Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication ⋮ Positive definiteness and semi-definiteness of even order symmetric Cauchy tensors

This page was built for publication: Fast algorithms with preprocessing for matrix-vector multiplication problems