Degeneration of structured integer matrices modulo an integer

Linear Algebra and Its Applications

Volumn 429, Issue 8-9, 2008, Pages 2113-2130

  Pan, Victor Y ^a   Wang, Xinmao ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Matrix inverse modulo an integer; Structured matrices

Indexed keywords

LINEAR SYSTEMS;

INTEGER MATRICES; LINEAR SYSTEM OF EQUATIONS; MATRIX INVERSE MODULO AN INTEGER; NUMERICAL ALGORITHMS; OPTIMAL TIME; STRUCTURED MATRICES;

LINEAR EQUATIONS;

EID: 49249100712     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2008.06.020     Document Type: Article

References (33)

1. Bitmead R.R., and Anderson B.D.O. Asymptotically fast solution of Toeplitz and related systems of linear equations. Linear Algebra Appl. 34 (1980) 103-116
2. Bleichenbacher D., Kiayias A., and Yung M. Decoding interleaved Reed-Solomon codes over noisy channels (special issue: selected papers from ICALP 2003). Theor. Comput. Sci. 379 3 (2007) 348-360
3. m. Discrete Math. 66 (1987) 35-49
4. Bini D., and Pan V.Y. Polynomial and Matrix Computations. Fundamental Algorithms, vol. 1 (1994), Birkhäuser, Boston
5. Daykin D.E. Distribution of bordered persymmetric matrices in a finite field. J. Reine und Angewandte Math. 203 (1960) 47-54
6. Dixon J.D. Exact solution of linear equations using p-adic expansions. Numer. Math. 40 (1982) 137-141
7. Demillo R.A., and Lipton R.J. A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7 4 (1978) 193-195
8. Eidelman Y., and Gohberg I. Fast inversion algorithms for a class of block structured matrices. Contemp. Math. 281 (2001) 17-38
9. W. Eberly, M. Giesbrecht, G. Villard, On computing the determinant and smith form of an integer matrix, in: Proceedings in the 41st Annual Symposium on Foundations of Computer Science (FOCS'2000), IEEE Computer Society Press, Los Alamitos, California, 2000, pp. 675-685.
10. von zur Gathen J., and Gerhard J. Modern Computer Algebra. second ed. (2003), Cambridge University Press, Cambridge, UK
11. Golub G.H., and Van Loan C.F. Matrix Computations. third ed. (1999), Johns Hopkins University Press, Baltimore, Maryland
12. Karatsuba A.A. The distribution of prime numbers. Russian Math. Surveys 45 (1990) 99-171
13. E. Kaltofen, A. Lobo, On rank properties of Toeplitz matrices over finite fields, in: Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC'96), ACM Press, New York, 1996, pp. 241-249.
14. M. Morf, Fast algorithms for multivariable systems, Ph.D. Thesis, Department of Electrical Engineering, Stanford University, Stanford, CA, 1974.
15. M. Morf, Doubling algorithms for Toeplitz and related equations, in: Proceedings of IEEE International Conference on ASSP, IEEE Press, Piscataway, New Jersey, 1980, pp. 954-959.
16. Moenck R.T., and Carter J.H. Approximate algorithms to derive exact solutions to systems of linear equations. Proceedings of EUROSAM. Lecture Notes in Computer Science vol. 72 (1979), Springer, Berlin 63-73
17. Newman M. Integral Matrices (1972), Academic Press, New York
18. V. Olshevsky, V.Y. Pan, A unified superfast algorithm for boundary rational tangential interpolation problem and for inversion and factorization of dense structured matrices, in: Proceedings of the 39th Annual IEEE Symposium on Foundation of Computer Science (FOCS 98), IEEE Computer Society Press, Los Alamitos, California, 1998, pp. 192-201.
19. Pan V.Y. Structured Matrices and Polynomials: Unified Superfast Algorithms (2001), Birkhäuser/Springer, Boston/New York
20. V.Y. Pan, Can we optimize Toeplitz/Hankel computations? in: E.W. Mayr, V.G. Ganzha, E.V. Vorozhtzov (Eds.), Proceedings of the Fifth International Workshop on Computer Algebra in Scientific Computing (CASC'02), Yalta, Crimea, September 2002, Technische Universität München, Germany, 2002, pp. 253-264.
21. V.Y. Pan, Nearly optimal Toeplitz/Hankel computations, Technical Reports 2002001, 2002002, and 2002017, Ph.D. Program in Computer Science, The Graduate Center, CUNY, New York, 2002. .
22. V.Y. Pan, On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix, Zapiski Nauchnykh Seminarov POMI, vol. 316, St. Petersburg, Russia, 2004, pp. 163-187. (in English).
23. V.Y. Pan, B. Murphy, R.E. Rosholt, X. Wang. Toeplitz and Hankel meet Hensel and Newton nearly optimal algorithms and their practical acceleration with saturated initialization, Technical Report 2004013, Ph.D. Program in Computer Science, The Graduate Center, CUNY, New York, 2004. .
24. V.Y. Pan, B. Murphy, R.E. Rosholt, Unified nearly optimal algorithms for structured integer matrices and polynomials, Technical Report 2008003, Ph.D. Program in Computer Science, The Graduate Center, CUNY, New York, 2008. .
25. V.Y. Pan, B. Murphy, R.E. Rosholt, Unified nearly optimal algorithms for structured integer matrices, Numerical Methods for Structured Matrices and Applications: Georg Heinig memorial volume, Birkhäuser Verlag, in press.
26. Rosser J.B., and Schoenfeld L. Approximate formulas of some functions of prime numbers. Illinois J. Math. 6 (1962) 64-94
27. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27 4 (1980) 701-717
28. In: Wang D., and Zhi L.-H. (Eds). Symbolic-Numeric Computation (2007), Birkhäuser, Basel/Boston
29. J. Verschelde, S. Watt (Eds.), Proceedings of the Third International Workshop on Symbolic-Numeric Computation (SNC2007), July 2007, London, Ontario, Canada, ACM Press, New York, 2007.
30. D.A. Bini, V.Y. Pan, J. Verschelde (Eds.), Theoretical Computer Science, Special Issue on Symbolic-Numerical Algorithms, in press.
31. Vandebril R., Van Barel M., Golub G., and Mastronardi N. A bibliography on semiseparable matrices. Calcolo 42 3-4 (2005) 249-270
32. X. Wang, How frequently is the matrix nonsingular, Technical Report 2002018, Ph.D. Program in Computer Science, The Graduate Center, CUNY, New York, 2002.
33. Zippel R.E. Probabilistic algorithms for sparse polynomials. Proceedings of EUROSAM'79. Lecture Notes in Computer Science vol. 72 (1979), Springer, Berlin 216-226