The DOI matches its Crossref record.
Structured Matrices and Polynomials
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cited by
Sorted by citations
Efficient Public Key Encryption Based on Ideal Lattices
Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_36 · Cited by 371
Henzinger, M. R., Forster, S., Nanongkai, D., & Saranurak, T. (2015) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2746539.2746609 · Cited by 273
Algebraic Signal Processing Theory: Foundation and 1-D Time
Püschel, M., & Moura, J. M. F. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.925261 · Cited by 174
Structured Transforms for Small-Footprint Deep LearningPreprint
Sindhwani, V., Sainath, T. N., & Kumar, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.01722 · Cited by 200
“Fast numerical linear algebra algorithms extend to such matrices [18].”
BackgroundInfluentialApproximate iterations for structured matrices
Hackbusch, W., Khoromskij, B. N., & Tyrtyshnikov, E. E. (2008) · Numerische Mathematik · doi:10.1007/s00211-008-0143-0 · Cited by 86
Metadata
- Authors
- Pan, V. Y.
- Corresponding author
- Pan, Victor Y.
- ORCID
- Pan, Victor Y.
- Venue
- Birkhäuser Boston eBooks
- Publisher
- Birkhäuser Boston
- Published
- 2001
- OpenAlex
- W21639112
- Cited by
- 203
- References
- 0
- Citations by year
- 2025: 5 · 2024: 8 · 2023: 10 · 2022: 12 · 2021: 9 · 2020: 10 · 2019: 12 · 2018: 2 · 2017: 8 · 2016: 11 · 2015: 10 · 2014: 11 · 2013: 8 · 2012: 12
- FWCI
- 3.51
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Birkhäuser Boston eBooks (publishedVersion)
- International Linear Collider (submittedVersion)
- Funders
- National Science Foundation (9732206)
- City University of New York
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical functions and polynomials
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Keywords
- structured matrices, polynomials, matrix polynomials, structured linear systems
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
