Article

Free access

On rank properties of Toeplitz matrices over finite fields

Authors:

E. Kaltofen,

A. LoboAuthors Info & Claims

ISSAC '96: Proceedings of the 1996 international symposium on Symbolic and algebraic computation

Pages 241 - 249

https://doi.org/10.1145/236869.237081

Published: 01 October 1996 Publication History

PDF eReader

References

[1]

BORODIN, A., VON ZUR GATHEN, J., AND HOPCROFT, J. E. Fast parallel matrix and gcd computations. Inf. Control 52 (1982), 241-256.

Crossref

Google Scholar

[2]

BRENT, R. P., GUSTAVSON, F. G., AND YUN, D. Y. Y. Fast solution of Toeplitz systems of equations and computation of Pad6 approximants. J. Algorithms 1 (1980), 259-295.

Crossref

Google Scholar

[3]

BROWN, W. S., AND TRAUB, J. F. On Euclid's algorithm and the theory of subresultants. J. ACM 18 (1971), 505-514.

Digital Library

Google Scholar

[4]

COPPERSMITH, D. Solving homogeneous linear equations over gf(2) via block WIedemann algorithm. Math. Comput. 62, 205 (1994), 333-350.

Digital Library

Google Scholar

[5]

DAYKIN, D. E. Distribution of bordered persymmetric matrices in a finite field. J. reine u. angew. Math. 203 (1960), 47-54.

Google Scholar

[6]

G ANTMACHER, F. R. The Theory of Matrices, Vol. 1. Chelsea Publ. Co., New York, N. Y., 1990.

Google Scholar

[7]

GOHBERG, I., KAILATH, T., AND KOLTRACHT, i. Elficient solution of linear systems of equations with recursive structure. Linear Algebra Applic. 80 (1986), 81-113.

Crossref

Google Scholar

[8]

GaAGG, W. B. The Pad~ table and its relation to certain algorithms of numerical analysis. SIAM Review 1~, 1 (1972), 1-62.

Google Scholar

[9]

KALTOFEN, E. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comput. 6~, 210 (1995), 777-806.

Digital Library

Google Scholar

[10]

KALTOFEN, E., AND SAUNDEaS, B. D. On Wiedemann's method of solving sparse linear systems. In Proc. AAECC-9 (1991), vol. 539 of @ringer Lect. Notes Comput. Sci., pp. 29-38.

Crossref

Google Scholar

[11]

LANDSBERG, G. Uber eine anzahlbestimmung und eine damit zusammenh~ngende reihe. J. reine u. angew. Math. 111 (1893), 87-88.

Google Scholar

[12]

LoBo, A. Matrix-free linear system solving and applications to symbolic computation. Ph.D. Thesis, Dept. Comput. Sci., Rensselaer Polytech. Instit., Troy, New York, December 1995.

Digital Library

Google Scholar

[13]

MA, K., AND YON ZUa GATHEN, J. Analysis of euclidean algorithms for polynomials over finite fields. In J. Symbolic Comput. (1990), vol. 9, pp. 429-455.

Digital Library

Google Scholar

[14]

WIEDEMANN, D. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory IT-32 (1986), 54-62.

Digital Library

Google Scholar

Cited By

View all

Moon TGunther J(2022)Fast Solutions of Toeplitz Equations over Finite Fields2022 56th Asilomar Conference on Signals, Systems, and Computers10.1109/IEEECONF56349.2022.10051980(121-128)Online publication date: 31-Oct-2022
https://doi.org/10.1109/IEEECONF56349.2022.10051980
Dwivedi OGrinberg D(2022)On the rank of Hankel matrices over finite fieldsLinear Algebra and its Applications10.1016/j.laa.2022.02.014Online publication date: Feb-2022
https://doi.org/10.1016/j.laa.2022.02.014
Bouman Nde Vreede N(2020)A Practical Approach to the Secure Computation of the Moore–Penrose Pseudoinverse over the RationalsApplied Cryptography and Network Security10.1007/978-3-030-57808-4_20(398-417)Online publication date: 27-Aug-2020
https://doi.org/10.1007/978-3-030-57808-4_20
Show More Cited By

Index Terms

On rank properties of Toeplitz matrices over finite fields
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Algebraic algorithms
      2. Linear algebra algorithms
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations in finite fields
      2. Computations on matrices

Recommendations

High-performance algorithms to solve toeplitz and block toeplitz matrices
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
Algebraic and numerical algorithm

Split Levinson-type and Schur-type algorithms for the solutions of linear systems with a nonsingular skewsymmetric Toeplitz matrix are designed. In contrast to previous ones, the algorithms work for any nonsingular skewsymmetric Toeplitz matrix. ...
Rank properties of a sequence of block bidiagonal Toeplitz matrices

In the present paper, we proposed a new efficient rank updating methodology for evaluating the rank (or equivalently the nullity) of a sequence of block diagonal Toeplitz matrices. The results are applied to a variation of the partial realization ...

Comments

Information & Contributors

Information

Published In

ISSAC '96: Proceedings of the 1996 international symposium on Symbolic and algebraic computation

October 1996

318 pages

ISBN:0897917960

DOI:10.1145/236869

Chairmen:
Erwin Engeler
ETH Zu¨rich, Switzerland
,
Bob F. Caviness
Univ. of Delaware, Newark
,
Editor:
Y. N. Lakshman
Drexel Univ., Philadelphia, PA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC96

Sponsor:

ISSAC96: International Symposium on Symbolic and Algebraic Computation

July 24 - 26, 1996

Zurich, Switzerland

Acceptance Rates

ISSAC '96 Paper Acceptance Rate 41 of 121 submissions, 34%;

Overall Acceptance Rate 395 of 838 submissions, 47%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
586
Total Downloads

Downloads (Last 12 months)47
Downloads (Last 6 weeks)5

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Moon TGunther J(2022)Fast Solutions of Toeplitz Equations over Finite Fields2022 56th Asilomar Conference on Signals, Systems, and Computers10.1109/IEEECONF56349.2022.10051980(121-128)Online publication date: 31-Oct-2022
https://doi.org/10.1109/IEEECONF56349.2022.10051980
Dwivedi OGrinberg D(2022)On the rank of Hankel matrices over finite fieldsLinear Algebra and its Applications10.1016/j.laa.2022.02.014Online publication date: Feb-2022
https://doi.org/10.1016/j.laa.2022.02.014
Bouman Nde Vreede N(2020)A Practical Approach to the Secure Computation of the Moore–Penrose Pseudoinverse over the RationalsApplied Cryptography and Network Security10.1007/978-3-030-57808-4_20(398-417)Online publication date: 27-Aug-2020
https://doi.org/10.1007/978-3-030-57808-4_20
Yao LRen DYin Q(2019)Understanding Kernel Size in Blind Deconvolution2019 IEEE Winter Conference on Applications of Computer Vision (WACV)10.1109/WACV.2019.00224(2068-2076)Online publication date: Jan-2019
https://doi.org/10.1109/WACV.2019.00224
Bai SBoudgoust KDas DRoux-Langlois AWen WZhang Z(2019)Middle-Product Learning with Rounding Problem and Its ApplicationsAdvances in Cryptology – ASIACRYPT 201910.1007/978-3-030-34578-5_3(55-81)Online publication date: 25-Nov-2019
https://doi.org/10.1007/978-3-030-34578-5_3
Kucerovsky DMousavand KSarraf A(2016)On some properties of Toeplitz matricesCogent Mathematics10.1080/23311835.2016.11547053:1Online publication date: 16-Mar-2016
https://doi.org/10.1080/23311835.2016.1154705
(2016)Models, statistics, and rates of binary correlated sourcesPhysical Communication10.1016/j.phycom.2016.04.00219:C(70-80)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1016/j.phycom.2016.04.002
Hua GAbeysekera S(2013)Receiver Design for Range and Doppler Sidelobe Suppression Using MIMO and Phased-Array RadarIEEE Transactions on Signal Processing10.1109/TSP.2012.223474361:6(1315-1326)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1109/TSP.2012.2234743
Clifford RJalsenius M(2011)Lower bounds for online integer multiplication and convolution in the cell-probe modelProceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I10.5555/2027127.2027190(593-604)Online publication date: 4-Jul-2011
https://dl.acm.org/doi/10.5555/2027127.2027190
Clifford RJalsenius M(2011)Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe ModelAutomata, Languages and Programming10.1007/978-3-642-22006-7_50(593-604)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22006-7_50
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

High-performance algorithms to solve toeplitz and block toeplitz matrices

Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile

Rank properties of a sequence of block bidiagonal Toeplitz matrices

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

High-performance algorithms to solve toeplitz and block toeplitz matrices

Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile

Rank properties of a sequence of block bidiagonal Toeplitz matrices

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations