ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Algorithmica 4 (1989), S. 237-262 
    ISSN: 1432-0541
    Schlagwort(e): Geometry theorem proving ; Provers ; Nondegenerate conditions ; Ritt's algorithms ; Wu's method ; The Gröbner basis method ; Algebraically (or real) closed field ; Algebraic geometry ; Irreducible variety ; Nondegenerate component ; Generally true ; Simson's theorem ; Pappus' theorem
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper we analyze the algebraic formulations of certain geometry statements appearing in recent literature related to mechanical geometry theorem proving and give several examples to show that one of these formulations can cause serious problems. We clarify a formulation which is essentially due to W. T. Wu and, in our opinion, is the most satisfactory.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Applicable algebra in engineering, communication and computing 3 (1992), S. 27-38 
    ISSN: 1432-0622
    Schlagwort(e): Geometric modeling ; Parameterization ; Algebraic curves ; Resolvents ; Ritt-Wu's decomposition algorithm ; Gröbner bases
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik , Technik allgemein
    Notizen: Abstract In this paper, by using the concept of resolvents of a prime ideal introduced by Ritt, we give methods for constructing a hypersurface which is birational to a given irreducible variety and birational transformations between the hypersurface and the variety. In the case of algebraic curves, this implies that for an irreducible algebraic curveC, we can construct a plane curve which is birational toC. We also present a method to find rational parametric equations for a plane curve if it exists. Hence we have a complete method of parameterization for rational algebraic curves.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Journal of automated reasoning 10 (1993), S. 173-189 
    ISSN: 1573-0670
    Schlagwort(e): Mechanical theorem proving ; Wu's method ; Ritt-Wu's decomposition algorithm ; statement of equation type ; generally true ; universally true ; space curve theory ; elementary mechanics
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We clarify the formulation problem of mechanical theorem proving in differential geometry and mechanics and propose two formulations. We present complete methods of mechanical theorem proving for the two formulations. We also introduce predicates and a language to translate geometry statements into differential polynomial equations. A program based on our methods has proved more than 100 nontrivial theorems in differential geometry and elementary mechanics including various classification theorems for space curves, Bertrand's Theorem, Newton's gravitational laws, etc.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Journal of automated reasoning 10 (1993), S. 161-172 
    ISSN: 1573-0670
    Schlagwort(e): Differential polynomial ; weak ascending chain ; W-perm ; Ritt-Wu's principle ; quasi zero set ; Ritt-Wu's decomposition algorithm
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract This is the first paper of a series of three papers under the same title. It presents an improved version of Ritt-Wu's decomposition algorithm which is the basis of our methods of mechanical theorem proving and mechanical formula derivation in differential geometry and elementary mechanics. We improve the original algorithm in two aspects. First, by using the weak ascending chain and W-perm, the sizes of the differential polynomials occurring in the decomposition can be reduced. Second, by using a special reduction procedure, the number of branches in the decomposition can be controlled effectively. The improved version significantly enhances the efficiency of the original algorithm.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...