Mioara Joldes home page

Mioara Joldes

Contact

The Ångström Laboratory
Uppsala University
Box S-524 75120 Uppsala, Sweden

phone:(+46) (0)1 84 71 31 87
email: mioara AT math DOT uu DOT se

I am currently a postdoctorant in the CAPA project, at The Department of Mathematics, Ångström Laboratory, Uppsala university.

I obtained my PhD in Computer Science in ARENAIRE project, at ENS-Lyon, LIP under the supervision of Nicolas Brisebarre and Jean-Michel Muller. A draft version of the manuscript is available here and my PhD defense slides are here.

My CV is available in English or in French.

Publications:

[1] Chebyshev interpolation polynomial-based tools for rigorous computing, joint work with Nicolas Brisebarre. In Proceedings of the 2010 international Symposium on Symbolic and Algebraic Computation (Munich, Germany, July 25 - 28, 2010). ISSAC '10. ACM, New York, NY, 147-154. Preliminary version available in open archive.
[2] Automatic generation of polynomial-based hardware architectures for function evaluation, joint work with Florent de Dinechin and Bogdan Pasca. In Proceedings of the 21st IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP 2010), July 2010. Preliminary version available in open archive.
[3] Racines carrées multiplicatives sur FPGA, joint work with Florent de Dinechin, Bogdan Pasca and Guillaume Revy. In SYMPosium en Architectures nouvelles de machines (SYMPA), Toulouse, September 2009. Preliminary version available in open archive.
[4] Certified and fast computation of supremum norms of approximation errors, joint work with Sylvain Chevillard and Christoph Lauter. In 19th IEEE SYMPOSIUM on Computer Arithmetic, pages 169-176, Los Alamitos, CA, June 2009. IEEE Computer Society. Preliminary version available in open archive.
[5] Efficient and accurate computation of upper bounds of approximation errors, joint work with Sylvain Chevillard, John Harrison and Christoph Lauter. Preliminary version available in open archive. Accepted for publication in the journal Theoretical Computer Science, Special Issue on Symbolic and Numeric Computation.
[6] Multiplicative square root algorithms for FPGAs, joint work with Florent de Dinechin, Bogdan Pasca and Guillaume Revy. Preliminary version available in open archive. In 20th International Conference on Field Programmable Logic and Applications (FPL'2010), Milano, Italy, Aug. 31st - Sep. 2nd, 2010.
[7] Sollya: an environment for the development of numerical codes, joint work with Sylvain Chevillard and Christoph Lauter. In Mathematical Software - ICMS 2010, pages 28-31, Heidelberg, Germany, September 2010. Springer.
[8] Augmented precision square roots, 2-D norms, and discussion on correctly rounding sqrt{x² + y²}, joint work with Nicolas Brisebarre, Peter Kornerup, Érik Martin-Dorel and Jean-Michel Muller. Preliminary version available in open archive. In 20th IEEE SYMPOSIUM on Computer Arithmetic, ARITH 2011, pages 23-30, Tubingen, Germany, 25-27 July 2011. IEEE Computer Society.
[9] Rigorous Polynomial Approximation using Taylor Models in Coq, joint work with N. Brisebarre, E.-M. Dorel, M. Mayero, J.-M. Muller, I. Pasca, L. Rideau, L. Théry. To appear in Proceedings of NASA Formal Methods Symposium, Norfolk, Virginia, April 3-5, 2012.

Articles under submission, research reports:

[10] Rigorous uniform approximation of D-finite functions, joint work with Alexandre Benoit and Marc Mezzarobba, 2011. In preparation.
[11] Rigorous polynomial approximations based on Chebyshev series expansions, joint work with Nicolas Brisebarre, 2011. In preparation.

Software:

ChebModels, developed with Nicolas Brisebarre. Collects Maple packages developed for rigorous polynomial approximations to univariate functions. Related articles: [1]
FloPoCo. I developed a small specific part related to computing piecewise polynomial approximations for function evaluation specifically targeted for FPGAs. Related articles: [2, 3, 6]
Sollya. Since 2008, I joined Sylvain Chevillard and Christoph Lauter for developing Sollya's functionalities mainly related to Taylor models and to certified computation of supremum norms of approximation errors. Related articles: [4, 5, 7]

Talks:

October 2008: talk at Journées Nationales de Calcul Formel (JNCF), CIRM, Luminy (France)
May 2009: talk at the Sixth International Taylor Model Methods Workshop, Karlsruhe (Germany)
May 2009: talk at the workgroup of the team Arénaire in the ENS Lyon (France)
June 2009: talk at the 19th IEEE Symposium of Computer Arithmetic, ARITH'19, Portland, Oregon, USA
June 2009: talk at a seminary at INTEL, Portland, Oregon, USA
September 2009: presentation at International Conference of Numerical Analysis and Applied Mathematics 2009 (ICNAAM 2009), Rethymno, Crete, Greece
November 2009: presentation of my work targeted for general scientific audience, entitled "When a Logarithm is just a misspelled Algorithm", at Neuvième Forum des Jeunes Mathématiciennes, Institut Henri Poincaré, Paris
March 2010: talk at the workgroup of the team Arénaire in the ENS Lyon (France)
April 2010: talk at a seminary of Caramel team, LORIA, Nancy, entitled ''Chebyshev Interpolation Polynomial-based Tools for Rigorous Computing''
May 2010: talk at EVA-Flo: Evaluation et Validation Automatique pour le calcul Flottant meeting, Perpignan - Canet, France
June 2010: talk at the 3rd edition of the Small Workshop on Interval Methods (SWIM), Nantes, France.
June 2010: talk at International Symposium on Symbolic and Algebraic Computation (ISSAC 2010), Munich, Germany.
October 2010: talk at Algorithms Project's Seminar, INRIA, Rocquencourt.
October 2010: talk entitled "Supnorm for Newbies", at Journées TAMADI, ENS Lyon, France.
November 2010: talk at Séminaire Calcul Formel à l'Université de Limoges.
February 2011: talk at RAIM'11, Perpignan, France.
April 2011: talk at CAPA Project's Seminar, Uppsala University, Sweden.
April 2011: talk entitled "Automatic generation of polynomial-based hardware architectures for function evaluation", at Technical University of Cluj-Napoca, Romania.
June 2011: talk entitled "Rigorous uniform approximation of D-finite functions", at SWIM2011, Bourges, France.
November 2011: Talk at a seminary of MAC Team, LAAS, Toulouse (France).
November 2011: Talk at a seminary of Pequan Team, LIP6, Paris (France).
Novembrer 2011: Talk at Journées Nationales de Calcul Formel (JNCF), CIRM, Luminy (France).
April 2012: Talk at National Institute of Aerospace, Hampton, Virginia, USA.

Teaching:

2008-2009, first semester: Projet Programmation (32h as teaching assistant) in L3 at Ecole Normale Supérieure de Lyon
2008-2009, second semester: Algorithmique 2 (32h as teaching assistant) in L3 at Ecole Normale Supérieure de Lyon
2009-2010, first semester: Compilation in M1 at Ecole Normale Supérieure de Lyon
2009-2010, second semester: Architecture Matérielle et Logicielle in L2 at Université Lyon 1.
2010-2011, first semester: Algorithmes arithmétiques in M1 at Ecole Normale Supérieure de Lyon
2010-2011, first semester: Architecture Matérielle et Logicielle in L2 at Université Lyon 1.