[J1] M. Masson, D. Arzelier, F. Bréhard, M. Joldes, and B. Salvy, “Fast and reliable computation of instantaneous orbital collision probability,” Journal of Guidance, Control, and Dynamics, vol. 47, no. 8, pp. 1660–1673, 2024. https://laas.hal.science/hal-04134188.
[J2] F. Bréhard, N. Brisebarre, M. Joldeş, and W. Tucker, “Efficient and Validated Numerical Evaluation of Abelian Integrals,” ACM Trans. Math. Softw., vol. 50, pp. 1–38, March 2024. https://hal.archives-ouvertes.fr/hal-03561096.
[J3] M. Joldes and B. Pasca, “Efficient Floating-Point Implementation of the Probit Function on FPGAs,” Journal of Signal Processing Systems, vol. 93, pp. 1387–1403, 2021. https://hal.archives-ouvertes.fr/hal-03385845/.
[J4] D. Arzelier, F. Bréhard, and M. Joldes, “Comments on Series for Collision Probability in Short-Encounter Model,” Journal of Guidance, Control, and Dynamics, vol. 43, pp. 1034–1037, May 2020. Technical Comment, https://hal.archives-ouvertes.fr/hal-02123054.
[J5] N. Brisebarre, M. Joldes, J.-M. Muller, A.-M. Naneş, and J. Picot, “Error analysis of some operations involved in the Fast Fourier Transform,” ACM Transactions on Mathematical Software, vol. 46, pp. 1–34, May 2020. https://hal.archives-ouvertes.fr/hal-01949458/.
[J6] P. R. Arantes Gilz, M. Joldes, C. Louembet, and F. Camps, “Stable Model Predictive Strategy for Rendezvous Hovering Phases Allowing for Control Saturation,” Journal of Guidance, Control, and Dynamics, vol. 42, no. 8, pp. 1658–1675, 2019. https://hal.archives-ouvertes.fr/hal-01678768.
[J7] F. Bréhard, N. Brisebarre, and M. Joldeş, “Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equations,” ACM Transactions on Mathematical Software (TOMS), vol. 44, no. 4, p. 44, 2018. https://hal.archives-ouvertes.fr/hal-01526272/.
[J8] M. Joldes, J.-M. Muller, and V. Popescu, “Tight and rigorous error bounds for basic building blocks of double-word arithmetic,” ACM Transactions on Mathematical Software (TOMS), vol. 44, no. 2, p. 15, 2017. https://hal.archives-ouvertes.fr/hal-01351529v3.
[J9] A. Benoit, M. Joldes, and M. Mezzarobba, “Rigorous uniform approximation of D-finite functions using Chebyshev expansions,” Mathematics of Computation, vol. 86, no. 305, pp. 1303–1341, 2016. https://hal.archives-ouvertes.fr/hal-01022420.
[J10] R. Serra, D. Arzelier, M. Joldes, J.-B. Lasserre, A. Rondepierre, and B. Salvy, “Fast and accurate computation of orbital collision probability for short-term encounters,” Journal of Guidance, Control, and Dynamics, vol. 39, no. 5, pp. 1009–1021, 2016. https://hal.archives-ouvertes.fr/hal-01132149/.
[J11] M. Joldes, O. Marty, J.-M. Muller, and V. Popescu, “Arithmetic algorithms for extended precision using floating-point expansions,” IEEE Transactions on Computers, vol. 65, pp. 1197–1210, April 2016. https://hal.archives-ouvertes.fr/hal-01111551v2.
[J12] M. Joldes, V. Popescu, and W. Tucker, “Searching for sinks for the Hénon map using a multiple-precision GPU arithmetic library,” SIGARCH Comput. Archit. News, vol. 42, no. 4, pp. 63–68, 2014. https://hal.archives-ouvertes.fr/hal-00957438.
[J13] S. Chevillard, J. Harrison, M. Joldes, and C. Lauter, “Efficient and accurate computation of upper bounds of approximation errors,” Theoretical Computer Science, vol. 16, no. 412, pp. 1523–1543, 2011.
[C1] M. Masson, C. Artigues, D. Arzelier, F. Dabbene, M. Joldeş, M. Mammarella, and F. P. Azza, “Impulsive thrust collision avoidance for long-term space encounters,” in 63rd IEEE Conference on Decision and Control, (Milan (Italie), Italy), Dec. 2024. https://laas.hal.science/hal-04710416v1.
[C2] D. Arzelier, F. Bréhard, M. Joldes, and M. Mezzarobba, “Rounding Error Analysis of an Orbital Collision Probability Evaluation Algorithm,” in Proceedings of the 31st IEEE International Symposium on Computer Arithmetic ARITH 2024, pp. 96–103, IEEE, June 2024. https://laas.hal.science/hal-04466875v1.
[C3] M. Masson, D. Arzelier, M. Joldes, B. Revelin, and J. Thomassin, “Multi-maneuvers algorithms for multi-risk collision avoidance via nonconvex quadratic optimization,” vol. 56, pp. 1995–2000, 2023. 22nd IFAC World Congress, https://hal.laas.fr/hal-03847541.
[C4] M. Masson, D. Arzelier, F. Bréhard, and M. Joldes, “Fast and reliable computation of the instantaneous orbital collision probability,” in 2nd International Stardust Conference STARCON2, (Noordwijk, Netherlands), ESA European Space Research and Technology Centre (ESTEC), Nov. 2022. https://laas.hal.science/hal-04240944v1.
[C5] M. Joldes, “Validated numerics: Algorithms and practical applications in aerospace,” in Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, ISSAC ’22, (New York, NY, USA), p. 1–2, Association for Computing Machinery, 2022. https://hal.laas.fr/hal-03762945.
[C6] D. Arzelier, F. Bréhard, M. Joldeş, J.-B. Lasserre, S. Laurens, and A. Rondepierre, “Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters,” in 60th IEEE Conference on Decision and Control, pp. 6300–6305, Dec. 2021. https://hal.laas.fr/hal-03158347/.
[C7] M. Joldes and B. Pasca, “Efficient Floating-Point Implementation of the Probit Function on FPGAs,” in Application-specific Systems, Architectures and Processors (ASAP), 2020 IEEE 31st International Conference on, pp. 173–180, 2020. Best Paper Award, https://hal.archives-ouvertes.fr/hal-02875528/.
[C8] M. Joldes and J.-M. Muller, “Algorithms for manipulating quaternions in floating-point arithmetic,” in Computer Arithmetic (ARITH), 2020 IEEE 27th Symposium on, pp. 48–55, 2020. https://hal.archives-ouvertes.fr/hal-02470766/.
[C9] D. Arzelier, F. Bréhard, and M. Joldes, “Exchange algorithm for evaluation and approximation error-optimized polynomials,” in Computer Arithmetic (ARITH), 2019 IEEE 26th Symposium on, pp. 30–37, 2019. https://hal.archives-ouvertes.fr/hal-02006606/.
[C10] F. Bréhard, M. Joldes, and J.-B. Lasserre, “On moment problems with holonomic functions,” in Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC ’19, (New York, NY, USA), pp. 66–73, ACM, 2019. Distinguished Paper Award, https://hal.archives-ouvertes.fr/hal-02006645.
[C11] R. Serra, D. Arzelier, F. Bréhard, and M. Joldes, “Fuel-optimal impulsive fixed-time trajectories in the linearized circular restricted 3-body-problem,” in IAF Astrodynamics Symposium in 69TH international astronautical congress, pp. 1–9, 2018. https://hal.archives-ouvertes.fr/hal-01830253.
[C12] F. Camps, P. R. A. Gilz, M. Joldes, and C. Louembet, “Embedding a SDP-based control algorithm for the orbital rendezvous hovering phases,” in Proceedings of tof IEEE International Conference on Integrated Navigation Systems, Jun 2018, Saint Petersburg, Russia. 10.23919/ICINS.2018.8405931, pp. 1–7, IEEE, 2018. https://hal.laas.fr/hal-01729956.
[C13] M. Joldes, J.-M. Muller, and V. Popescu, “Implementation and performance evaluation of an extended precision floating-point arithmetic library for high-accuracy semidefinite programming,” in Computer Arithmetic (ARITH), 2017 IEEE 24th Symposium on, pp. 27–34, IEEE, 2017. https://hal.archives-ouvertes.fr/hal-01491255/.
[C14] S. Boldo, M. Joldes, J.-M. Muller, and V. Popescu, “Formal verification of a floating-point expansion renormalization algorithm,” in International Conference on Interactive Theorem Proving, pp. 98–113, Springer, 2017. https://hal.archives-ouvertes.fr/hal-01512417/document.
[C15] P. R. A. Gilz, M. Joldes, C. Louembet, and F. Camps, “Model predictive control for rendezvous hovering phases based on a novel description of constrained trajectories,” in IFAC-PapersOnLine, vol. 50, pp. 7229–7234, Elsevier, 2017. https://hal.laas.fr/hal-01484764.
[C16] D. Arzelier, F. Bréhard, N. Deak, M. Joldes, C. Louembet, A. Rondepierre, and R. Serra, “Linearized impulsive fixed-time fuel-optimal space rendezvous: A new numerical approach,” in Proceedings of the 20th IFAC Symposium on Automatic Control in Aerospace, 21-25 August, 2016, Sherbrooke, Quebec, Canada, vol. 49, pp. 373–378, 2016. https://hal.archives-ouvertes.fr/hal-01275427.
[C17] S. Collange, M. Joldes, J.-M. Muller, and V. Popescu, “Parallel floating-point expansions for extended-precision GPU computations,” in Proceedings of ASAP 2016: The 27th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors, 6-8 July 2016, London, England, pp. 139–146, IEEE, 2016. https://hal.archives-ouvertes.fr/hal-01298206.
[C18] F. Bréhard, N. Brisebarre, and M. Joldes, “A new efficient algorithm for computing validated Chebyshev approximations solutions of linear differential equations,” in SCAN 2016: 17th International Symposium on Scientific Computing,Computer Arithmetic and Verified Numerics, Uppsala, Sweden, Sept. 2016, pp. 41–43, 2016.
[C19] M. Joldes, J.-M. Muller, V. Popescu, and W. Tucker, “Campary: Cuda multiple precision arithmetic library and applications,” in Mathematical Software – ICMS 2016: 5th International Conference, Berlin, Germany, July 11-14, 2016, Proceedings (G.-M. Greuel, T. Koch, P. Paule, and A. Sommese, eds.), (Cham), pp. 232–240, Springer International Publishing, 2016. https://hal.archives-ouvertes.fr/hal-01312858.
[C20] R. Serra, D. Arzelier, M. Joldes, J.-B. Lasserre, A. Rondepierre, and B. Salvy, “A new method to compute the probability of collision for short-term space encounters,” in Astrodynamics Specialist Conference, pp. 1–7, Aug 2014.
[C21] R. Serra, D. Arzelier, M. Joldes, and A. Rondepierre, “Probabilistic collision avoidance for long-term space encounters via risk selection,” in Advances in Aerospace Guidance, Navigation and Control, pp. 679–698, Springer, Dec 2015. https://hal.archives-ouvertes.fr/hal-01995936/document.
[C22] M. Joldes, J. Muller, and V. Popescu, “On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration,” in IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors, ASAP 2014, Zurich, Switzerland, June 18-20, 2014, pp. 63–67, IEEE, 2014. https://hal.archives-ouvertes.fr/docs/00/95/73/79/PDF/invNewton.pdf.
[C23] N. Brisebarre, M. Joldes, É. Martin-Dorel, M. Mayero, J. Muller, I. Pasca, L. Rideau, and L. Théry, “Rigorous polynomial approximation using Taylor Models in Coq,” in NASA Formal Methods - 4th International Symposium, NFM 2012, Norfolk, VA, USA, April 3-5, 2012. Proceedings (A. Goodloe and S. Person, eds.), vol. 7226 of Lecture Notes in Computer Science, pp. 85–99, Springer, 2012.
[C24] N. Brisebarre, M. Joldes, P. Kornerup, É. Martin-Dorel, and J. Muller, “Augmented precision square roots and 2-d norms, and discussion on correctly rounding sqrt(x^2+y^2),” in 20th IEEE Symposium on Computer Arithmetic, ARITH 2011, Tübingen, Germany, 25-27 July 2011 (E. Antelo, D. Hough, and P. Ienne, eds.), pp. 23–30, IEEE Computer Society, 2011.
[C25] N. Brisebarre and M. Joldes, “Chebyshev interpolation polynomial-based tools for rigorous computing,” in Symbolic and Algebraic Computation, International Symposium, ISSAC 2010, Munich, Germany, July 25-28, 2010, Proceedings (W. Koepf, ed.), pp. 147–154, ACM, 2010.
[C26] F. de Dinechin, M. Joldes, and B. Pasca, “Automatic generation of polynomial-based hardware architectures for function evaluation,” in 21st IEEE International Conference on Application-specific Systems Architectures and Processors, ASAP 2010, Rennes, France, 7-9 July 2010 (F. Charot, F. Hannig, J. Teich, and C. Wolinski, eds.), pp. 216–222, IEEE, 2010.
[C27] F. de Dinechin, M. Joldes, B. Pasca, and G. Revy, “Multiplicative square root algorithms for FPGAs,” in International Conference on Field Programmable Logic and Applications, FPL 2010, August 31 2010 - September 2, 2010, Milano, Italy, pp. 574–577, IEEE, 2010.
[C28] S. Chevillard, M. Joldes, and C. Q. Lauter, “Sollya: An environment for the development of numerical codes,” in Mathematical Software - ICMS 2010, Third International Congress on Mathematical Software, Kobe, Japan, September 13-17, 2010. Proceedings (K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama, eds.), vol. 6327 of Lecture Notes in Computer Science, pp. 28–31, Springer, 2010.
[C29] S. Chevillard, M. Joldes, and C. Q. Lauter, “Certified and fast computation of supremum norms of approximation errors,” in 19th IEEE Symposium on Computer Arithmetic, ARITH 2009, Portland, Oregon, USA, 9-10 June 2009 (J. D. Bruguera, M. Cornea, D. D. Sarma, and J. Harrison, eds.), pp. 169–176, IEEE Computer Society, 2009.
[NC1] M. Joldes, V. Popescu, and W. Tucker, “Searching for sinks of Hénon map using a multiple-precision GPU arithmetic library,” in Forum des Jeunes Mathématicien-ne-s, p. 6, Nov 2013.
[NC2] M. Joldes, “When a logarithm is a misspelled algorithm,” in Proceedings of the Association Femmes et mathématiques, Sept. 2010.
[NC3] F. de Dinechin, M. Joldes, B. Pasca, and G. Revy, “Racines carrées multiplicatives sur FPGA,” in SYMPosium en Architectures nouvelles de machines (SYMPA), (Toulouse), Sept. 2009.
[R1] D. Arzelier, M. Joldeş, and M. Masson, “Efficient Evaluation of 2-D Collision Probability Derivatives for Uncertain k-scaled Covariances: A PcMax Case Study.” Submitted. https://laas.hal.science/hal-04710373, Sept. 2024.
[R2] D. Arzelier, F. Bréhard, T. Hubrecht, and M. Joldes, “An Exchange Algorithm for Optimizing both Approximation and Finite-Precision Evaluation Errors in Polynomial Approximations.” Submitted. https://hal.science/hal-04709615, Aug. 2024.
[R3] M. Dressler, S. Foucart, M. Joldes, E. de Klerk, J.-B. Lasserre, and Y. Xu, “Least multivariate chebyshev polynomials on diagonally determined domains.” Submitted. https://arxiv.org/abs/2405.19219, 2024.
[R4] M. Dressler, S. Foucart, M. Joldes, E. de Klerk, J. B. Lasserre, and Y. Xu, “Optimization-aided construction of multivariate chebyshev polynomials.” Submitted. https://arxiv.org/abs/2405.10438, 2024.
[R5] D. Arzelier, M. Joldes, and J. Lasserre, “Analyse et revue bibliographique de la littérature pour le calcul de manœuvres impulsionnelles d’évitement de collision en orbite basse : rencontres simples et multiples,” Research Report, Nov 2022. Delivered for the EU-SST CNES project, in French, 151 pages, https://homepages.laas.fr/arzelier/drupal/sites/homepages.laas.fr.arzelier/files/u117/Rapport2220.pdf.
[R6] D. Arzelier, M. Joldes, J. Lasserre, and A. Rondepierre, “Evaluation du risque en EOR éléments de bibliographie en vue de la caractérisation de l’incertitude,” Research Report, Dec 2021. Delivered for the EU-SST CNES project, in French, 87 pages, https://homepages.laas.fr/arzelier/drupal/sites/homepages.laas.fr.arzelier/files/u117/Rapport1300.pdf.
[R7] D. Arzelier, F. Bréhard, M. Joldes, J. Lasserre, and A. Rondepierre, “Analyse et revue bibliographique de la littérature pour le calcul de la probabilité de collision en orbite: rencontres long-terme et court-terme,” Research Report, Jan 2021. Delivered for the EU-SST CNES project, in French, 117 pages, https://homepages.laas.fr/arzelier/drupal/sites/homepages.laas.fr.arzelier/files/u117/Rapport1100Longterm.pdf.
[R8] D. Arzelier, F. Bréhard, M. Joldes, J.-B. B. Lasserre, and A. Rondepierre, “Rigorous derivation of Coppola’s formula for the computation of the probability of collision between space objects,” Research Report Rapport LAAS no. 20008, LAAS-CNRS, Jan. 2020.
[R9] M. Joldes, Validated symbolic-numeric algorithms and practical applications in aerospace. Habilitation à Diriger des Recherches, Université Toulouse III Paul Sabatier. http://homepages.laas.fr/mmjoldes/HDR/HDR.pdf.
[R10] D. Arzelier, F. Bréhard, M. Joldes, J.-B. Lasserre, M. Léo, and A. Rondepierre, “Global probability of collision: Problem modeling via occupation measures,” Tech. Rep. Version 2.0, LAAS-CNRS, June 2018. CNES Research and Transfer Contract, https://hal.laas.fr/hal-02077552.
[R11] M. Joldes, Rigorous Polynomial Approximations and Applications. Thèse, École Normale Supérieure de Lyon - ENS LYON, Sept. 2011. https://tel.archives-ouvertes.fr/tel-00657843.