2,166 research outputs found

    Formal Proofs for Theoretical Properties of Newton's Method

    Get PDF
    We discuss a formal development for the certification of Newton's method. We address several issues encountered in the formal study of numerical algorithms: developing the necessary libraries for our proofs, adapting paper proofs to suit the features of a proof assistant, and designing new proofs based on the existing ones to deal with optimizations of the method. We start from Kantorovitch's theorem that states the convergence of Newton's method in the case of a system of equations. To formalize this proof inside the proof assistant Coq we first need to code the necessary concepts from multivariate analysis. We also prove that rounding at each step in Newton's method still yields a convergent process with an accurate correlation between the precision of the input and that of the result. An algorithm including rounding is a more accurate model for computations with Newton's method in practice

    Diagrams in Mathematics: history and philosophy: Introduction

    No full text
    The present version is slightly different from the final published one.International audienceThis is the introduction to a Special issue of Synthese, "Diagrams in Mathematics: History and Philosophy", edited by the authors together with Gabriel Sandu

    Pierre Duhem’s philosophy and history of science

    Get PDF
    LEITE (FĂĄbio Rodrigo) – STOFFEL (Jean-François), Introduction (pp. 3-6). BARRA (Eduardo Salles de O.) – SANTOS (Ricardo Batista dos), Duhem’s analysis of Newtonian method and the logical priority of physics over metaphysics (pp. 7-19). BORDONI (Stefano), The French roots of Duhem’s early historiography and epistemology (pp. 20-35). CHIAPPIN (JosĂ© R. N.) – LARANJEIRAS (CĂĄssio Costa), Duhem’s critical analysis of mecha­ni­cism and his defense of a formal conception of theoretical phy­sics (pp. 36-53). GUEGUEN (Marie) – PSILLOS (Stathis), Anti-­scepticism and epistemic humility in Pierre Duhem’s philosophy of science (pp. 54-72). LISTON (Michael), Duhem : images of science, historical continuity, and the first crisis in physics (pp. 73-84). MAIOCCHI (Roberto), Duhem in pre-war Italian philos­ophy : the reasons of an absence (pp. 85-92). HERNÁNDEZ MÁRQUEZ (VĂ­ctor Manuel), Was Pierre Duhem an «esprit de finesse» ? (pp. 93-107). NEEDHAM (Paul), Was Duhem justified in not distinguishing between physical and chemical atomism ? (pp. 108-111). OLGUIN (Roberto Estrada), «Bon sens» and «noĂ»s» (pp. 112-126). OLIVEIRA (Amelia J.), Duhem’s legacy for the change in the historiography of science : An analysis based on Kuhn’s writings (pp. 127-139). PRÍNCIPE (JoĂŁo), PoincarĂ© and Duhem : Resonances in their first epistemological reflec­tions (pp. 140-156). MONDRAGON (DamiĂĄn Islas), Book review of «Pierre Duhem : entre fĂ­sica y metafĂ­sica» (pp. 157-159). STOFFEL (Jean-François), Book review of P. Duhem : «La thĂ©orie physique : son objet, sa structure» / edit. by S. Roux (pp. 160-162). STOFFEL (Jean-François), Book review of St. Bordoni : «When historiography met epistemology» (pp. 163-165)

    Computational science: shifting the focus from tools to models

    Get PDF

    05391 Abstracts Collection -- Algebraic and Numerical Algorithms and Computer-assisted Proofs

    Get PDF
    From 25.09.05 to 30.09.05, the Dagstuhl Seminar 05391 ``Algebraic and Numerical Algorithms and Computer-assisted Proofs\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. Links to extended abstracts or full papers are provided, if available

    Difference Methods and Deferred Corrections for Ordinary Boundary Value Problems

    Get PDF
    Compact as possible difference schemes for systems of nth order equations are developed. Generalizations of the Mehrstellenverfahren and simple theoretically sound implementations of deferred corrections are given. It is shown that higher order systems are more efficiently solved as given rather than as reduced to larger lower order systems. Tables of coefficients to implement these methods are included and have been derived using symbolic computations

    Complete Issue 6, 1991

    Get PDF
    • 

    corecore