Fast algorithms with preprocessing for matrix-vector multiplication problems
Open accessIntegrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,097 · see citing works
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403 · see citing works
Problems and Theorems in Analysis
Pólya, G., & Szegő, G. (1972) · Springer eBooks · doi:10.1007/978-1-4757-1640-5 · Cited by 1,317 · see citing works
Convolution equations and projection methods for their solution
Gohberg, I., & Feldman, I. (2005) · Translations of mathematical monographs · doi:10.1090/mmono/041 · Cited by 703 · see citing works
Self-citationAlgebraic Methods for Toeplitz-like Matrices and Operators
Heinig, G., & Rost, K. (1984) · Operator theory · doi:10.1007/978-3-0348-6241-7 · Cited by 588 · see citing works
Fast solution of toeplitz systems of equations and computation of Padé approximants
Brent, R. P., Gustavson, F. G., & Yun, D. Y. Y. (1980) · Journal of Algorithms · doi:10.1016/0196-6774(80)90013-9 · Cited by 388 · see citing works
Solving systems of nonlinear polynomial equations faster
Canny, J., Kaltofen, E., & Yagati, L. (1989) · doi:10.1145/74540.74556 · Cited by 136 · see citing works
On computations with dense structured matrices
Pan, V. Y. (1990) · Mathematics of Computation · doi:10.1090/s0025-5718-1990-1023051-7 · Cited by 133 · see citing works
Generalized inverses of certain Toeplitz matrices
Cline, R. E., Plemmons, R. J., & Worm, G. H. (1974) · Linear Algebra and its Applications · doi:10.1016/0024-3795(74)90004-4 · Cited by 127 · see citing works
A new algorithm for solving Toeplitz systems of equations
de Hoog, F. (1987) · Linear Algebra and its Applications · doi:10.1016/0024-3795(87)90107-8 · Cited by 114 · see citing works
Circulants, displacements and decompositions of matrices
Gohberg, I., & Olshevsky, V. (1992) · Integral Equations and Operator Theory · doi:10.1007/bf01200697 · Cited by 96 · see citing works
Self-citationA fast algorithm for the multiplication of generalized Hilbert matrices with vectors
Gerasoulis, A. (1988) · Mathematics of Computation · doi:10.1090/s0025-5718-1988-0917825-9 · Cited by 62 · see citing works
Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
Chun, J., & Kailath, T. (1991) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0612010 · Cited by 33 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Complexity of multiplication with vectors for structured matrices
Gohberg, I., & Olshevsky, V. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90189-9 · Cited by 127 · see citing works
Self-citationReed-Solomon Forward Error Correction (FEC) Schemes
Lacan, J., Roca, V., Peltotalo, J., & Peltotalo, S. (2009) · doi:10.17487/rfc5510 · Cited by 74 · see citing works
Displacement structure approach to polynomial Vandermonde and related matrices
Kailath, T., & Olshevsky, V. (1997) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(96)00315-1 · Cited by 50 · see citing works
Self-citationPerera, S. M., Madanayake, A., & Cintra, R. J. (2020) · IEEE Access · doi:10.1109/access.2020.2970342 · Cited by 18 · see citing works
Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-beam Antenna Arrays
Perera, S. M., Madanayake, A., & Cintra, R. J. (2020) · IEEE Open Journal of Signal Processing · doi:10.1109/ojsp.2020.2991586 · Cited by 15 · see citing works
A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers
Perera, S. M., Lingsch, L., Madanayake, A., Mandal, S., & Mastronardi, N. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3231182 · Cited by 11 · see citing works
Thiran Filters for Wideband DSP-Based Multi-Beam True Time Delay RF Sensing Applications
Perera, S. M., Rathnasekara, G., & Madanayake, A. (2024) · Sensors · doi:10.3390/s24020576 · Cited by 5 · see citing works
- Authors
- Gohberg, I., & Olshevsky, V.
- Affiliations
- Tel Aviv University (IL)
- ORCID
- Gohberg, I.
- Venue
- Journal of Complexity
- Publisher
- Elsevier BV
- Published
- 1994-12
- Volume
- 10
- Issue
- 4
- Pages
- 411-427
- ISSN
- 0885-064X (ISSN-L)
- OpenAlex
- W1993029803
- Cited by
- 90
- References
- 13
- Citations by year
- 2025: 4 · 2024: 3 · 2023: 3 · 2022: 4 · 2021: 5 · 2020: 6 · 2019: 2 · 2018: 2 · 2017: 4 · 2016: 4 · 2015: 5 · 2014: 1 · 2013: 5 · 2012: 4
- FWCI
- 2.32
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Journal of Complexity (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Keywords
- matrix-vector multiplication, fast algorithms, data preprocessing, Toeplitz matrices, Hankel matrices, Vandermonde matrix, Cauchy matrix, matrix transposition, matrix inversion, Vandermonde determinant, computational complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
