Certification of the QR factor R and of lattice basis reducedness

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2007, Pages 361-368

  Villard, Gilles ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Lattice basis reducedness; Linear algebra; QR factorization; Verification algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERROR ANALYSIS; HEURISTIC METHODS; LINEAR ALGEBRA; NUMERICAL METHODS;

LATTICE BASIS REDUCEDNESS; QR FACTORIZATION; VERIFICATION ALGORITHM;

DIGITAL ARITHMETIC;

EID: 36349014263     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1277548.1277597     Document Type: Conference Paper

References (40)

1. ANSI/IEEE 754-1985. Standard for Binary Floating-Point Arithmetic, 1985.
2. 0.292. IEEE Inf. Theo., 46(4):233-260, 2000.
3. ∞-approximations. In Proc. 18th Symposium on Computer Arithmetic, Montpellier, France. IEEE Computer Society Press, 2007.
4. X.-W. Chang and C.C. Paige. Componentwise perturbation analyses for the QR factorization. Numer. Math., 88:319-345, 2001.
5. X.-W. Chang, C.C. Paige, and G.W. Stewart. Perturbation analyses for the QR factorization. SIAM J. Matrix Anal Appl., 18:775-791, 1997.
6. H. Cohen. A Course in Computational Number Theory. Springer-Verlag, 2nd Edition, 1995.
7. J. Demmel, B. Diament, and G. Malajovich. On the Complexity of Computing Error Bounds. Found. Comput. Math., 1(1):101-125, 2000.
8. J.J. Dongarra, J. Du Croz, I.S. Duf, and S. Hammarling. A set of Level 3 Basic. Linear Algebra Subprograms. ACM Trans. Math. Software, 16:1-17, 1990.
9. R. Freivalds. Fast probabilistic algorithms. In Proc. 8th Symposium on Mathematical Foundations of Computer Science, LNCS 74, pages 57-69. Springer Verlag, 1979.
10. Gnu MP. The GNU Multiple Precision Arithmetic Library, Edition 4.2.1, http://gmplib.org. 2006
11. O. Goldreich, S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. In Proc. CRYPTO'97, Santa Barbara, California, USA, LNCS 1294, pages 112-131. Springer Verlag, 1997.
12. N.J. Higham. Accuracy and stability of numerical algorithms. SIAM, Philadelphia, PA, 2nd Edition, 2002.
13. J. Hoffstein, J. Pipher, and J.H. Silverman. NTRU: a ring-based public key cryptosystem. In Proc. Third International Symposium ANTS-III, Portland, Oregon, USA, LNCS 1423, pages 267-288. Springer Verlag, 1998.
14. E. Kaltofen and G. Villard. Computing the sign or the value of the determinant of an integer matrix, a complexity survey. J. Comp. Applied Math, 162(1):133-146, 2004.
15. A.K. Lenstra, H.W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515-534, 1982.
16. Magma. Handbook of Magma Functions, Version 2.13. Computational Algebra Group, U. Sydney, Australia, 2006.
17. Matlab. User's Guide, V7.2. The MathWorks, Inc., 2006.
18. G. Mayer. Result Verification for Eigenvectors and Eigenvalues. In J. Herzberger, editor, IMACS-GAMM International Workshop, Oldenburg, Germany, 1993, Stud. Comput. Math., pages 209-276. Elsevier, 1994.
19. Michael B. Monagan, Keith O. Geddes, K. Michael Heal, George Labahn, Stefan M. Vorkoetter, James McCarron, and Paul DeMarco. Maple 10 Programming Guide. Maplesoft, Waterloo, Ontario, Canada, 2005.
20. MPFR. The Multiple Precision Floating-Point Reliable Library, Edition 2.2.1, http://www.mpfr.org 2006
21. P.Q. Nguyen and D. Stehlé. Floating-point LLL revisited. In Proc. Eurocrypt'05, LNCS 3494, pages 215-233. Springer Verlag, 2005.
22. P.Q. Nguyen and D. Stehlé. LLL on the average. In Proc. ANTS VII, LNCS 4076, pages 238-256. Springer Verlag, 2006.
23. S. Oishi and M.S. Rump. Fast verification of solutions of matrix equations. Numer. Math., 90(4):755-773, 2002.
24. V.Y. Pan and Y. Yu. Certification of numerical computation of the sign of the determinant of a matrix. Algorithmica, 30:708-724, 2001.
25. S.M. Rump. Verification Methods for Dense and Sparse Systems of Equations. In J. Herzberger, editor, Topics in Validated Computations - Studies in Computational Mathematics, pages 63-136. Elsevier, 1994.
26. S.M. Rump. Computational Error Bounds for Multiple or Nearly Multiple Eigenvalues. Linear Algebra and its Applications, 324:209-226, 2001.
27. S.M. Rump. Algorithms for Computing Validated Results. In J. Grabmeier, E. Kaltofen, and V. Weispfenning, editor, Computer Algebra Handbook, pages 110-112. Springer-Verlag, Heidelberg, Germany, 2003.
28. S.M. Rump. Computer-Assisted Proofs and Self-Validating Methods. In B. Einarsson, editor, Handbook of Accuracy and Reliability in Scientific Computation, pages 195-240. SIAM, 2005.
29. S.M. Rump. Verification of positive definiteness. BIT Numerical Mathematics, 46:433-452, 2006.
30. S.M. Rump and T. Ogita. Super-fast validated solution of linear systems. J. Comp. App. Math, 199(2): 199-206, 2007.
31. C.P. Schnorr. A more efficient algorithm for lattice basis reduction. Journal of Algorithms, 9(1):47-62, 1988.
32. C.P. Schnorr. Fast LLL-Type Lattice Reduction. Information and Computation, 204:1-25, 2006.
33. C.P. Schnorr and M. Euchner. Lattice basis reduction: improved practical algorithms and solving subset sum problems. Mathematics of Programming, 66:181-199, 1994.
34. D. Stehlé. Algorithmique de la réduction de réseaux et application à la recherche de pires cas pour l'arrondi de fonctions mathématiques. PhD thesis, Université Henri-Poincaré - Nancy 1, Nancy, France, December 2005.
35. G.W. Stewart. On the perturbation of LU, Cholesky, and QR factorizations. SIAM J. Math. Anal., 14(4):1141-1145, 1993.
36. A. Storjohann. Faster Algorithms for Integer Lattice Basis Reduction. TR249 ETH-Zurich, Dpt. Comp. Sc., Zurich, Switzerland, 1996.
37. J.-G. Sun. Perturbation bounds for the Cholesky and QR factorizations. BIT, 31:341-352, 1991.
38. J.-G. Sun. Componentwise perturbation bounds for some matrix decompositions. BIT, 32:702-714, 1992.
39. G. Villard. Certification of the QR Factor R, and of Lattice Basis Reducedness. RR2007-3 LIP, ENS Lyon, France. http://hal.archives-ouvertes.fr/ hal-00127059.en
40. H. Zha. A componentwise perturbation analysis of the QR decomposition. SIAM J. Matrix Anal Appl., 14(4):1124-1131, 1993.