arXiv (All)
open access
On efficient approximation of quadratic irrationals, signed Chebyshev polynomials and Householder's method
We provide efficient algorithms to compute convergents of quadratic irrationals. We show that for square roots, in settings where Galois' refinement of Lagrange's theorem holds, certain decimations of the sequence of convergents are signed Chebyshev sequences, which can be also be generated by a Hou
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Finite Gaussian Reconstruction of Polynomial Orbits: From Correlated Moments to Oscillatory Periods#609637
- The Jensen--Pólya program and inequalities for arithmetic sequences#1149452
- Twisted Diophantine Approximation I: Asymptotic Theory#1131253
- Multiplicative independence in the sequence of $k$-generalized Pell numbers#1034735
- Geometric approach to the cryptanalysis of post-quantum multivariate signature schemes#142416
Record · ID 927192
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive