Polynomial

Results: 3445



#Item
81Rapid calculation of RMSDs using a quaternion-based characteristic polynomial

Rapid calculation of RMSDs using a quaternion-based characteristic polynomial

Add to Reading List

Source URL: journals.iucr.org

- Date: 2015-04-25 03:37:30
    82Abstracts of Posters Effective Bounds in Representing Algebraic Sets Eli Amzallag & Mengxiao Sun, City University of New York A long-standing problem in polynomial computation has been how to efficiently specify a repres

    Abstracts of Posters Effective Bounds in Representing Algebraic Sets Eli Amzallag & Mengxiao Sun, City University of New York A long-standing problem in polynomial computation has been how to efficiently specify a repres

    Add to Reading List

    Source URL: fsw01.bcc.cuny.edu

    - Date: 2016-09-29 10:07:22
      83SOLVING LINEAR SYSTEMS WITH POLYNOMIAL PARAMETER DEPENDENCY IN THE RELIABLE ANALYSIS OF STRUCTURAL FRAMES Garloff, J., Popova, E. D. & Smith, A. P. University of Applied Sciences / HTWG Konstanz, Faculty of Computer Scie

      SOLVING LINEAR SYSTEMS WITH POLYNOMIAL PARAMETER DEPENDENCY IN THE RELIABLE ANALYSIS OF STRUCTURAL FRAMES Garloff, J., Popova, E. D. & Smith, A. P. University of Applied Sciences / HTWG Konstanz, Faculty of Computer Scie

      Add to Reading List

      Source URL: www-home.htwg-konstanz.de

      - Date: 2013-11-14 05:10:19
        84Total nonnegativity of matrices related to polynomial roots and poles of rational functions

        Total nonnegativity of matrices related to polynomial roots and poles of rational functions

        Add to Reading List

        Source URL: www-home.htwg-konstanz.de

        - Date: 2016-02-03 05:38:49
          85Dror Bar-Natan: Talks: Aarhus-1507: ωεβ≔http://www.math.toronto.edu/˜drorbn/Talks/AarhusWork in Progress on Polynomial Time Knot Polynomials, A

          Dror Bar-Natan: Talks: Aarhus-1507: ωεβ≔http://www.math.toronto.edu/˜drorbn/Talks/AarhusWork in Progress on Polynomial Time Knot Polynomials, A

          Add to Reading List

          Source URL: drorbn.net

          - Date: 2015-07-31 01:11:26
            86LINEAR RELATIONS BETWEEN POLYNOMIAL ORBITS DRAGOS GHIOCA, THOMAS J. TUCKER, AND MICHAEL E. ZIEVE Abstract. We study the orbits of a polynomial f ∈ C[X], namely the sets {α, f (α), f (f (α)), . . . } with α ∈ C. W

            LINEAR RELATIONS BETWEEN POLYNOMIAL ORBITS DRAGOS GHIOCA, THOMAS J. TUCKER, AND MICHAEL E. ZIEVE Abstract. We study the orbits of a polynomial f ∈ C[X], namely the sets {α, f (α), f (f (α)), . . . } with α ∈ C. W

            Add to Reading List

            Source URL: dept.math.lsa.umich.edu

            - Date: 2011-09-15 11:27:41
              87INTERSECTIONS OF POLYNOMIAL ORBITS, AND A DYNAMICAL MORDELL-LANG CONJECTURE DRAGOS GHIOCA, THOMAS J. TUCKER, AND MICHAEL E. ZIEVE Abstract. We prove that if nonlinear complex polynomials of the same degree have orbits wi

              INTERSECTIONS OF POLYNOMIAL ORBITS, AND A DYNAMICAL MORDELL-LANG CONJECTURE DRAGOS GHIOCA, THOMAS J. TUCKER, AND MICHAEL E. ZIEVE Abstract. We prove that if nonlinear complex polynomials of the same degree have orbits wi

              Add to Reading List

              Source URL: dept.math.lsa.umich.edu

              - Date: 2007-10-08 12:39:47
                88A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents Nathan Linial ∗

                A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents Nathan Linial ∗

                Add to Reading List

                Source URL: www.math.ias.edu

                - Date: 2007-07-26 10:56:33
                  89Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics J¨urgen Garloff, Evgenija D. Popova, and Andrew P. Smith

                  Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics J¨urgen Garloff, Evgenija D. Popova, and Andrew P. Smith

                  Add to Reading List

                  Source URL: www-home.htwg-konstanz.de

                  - Date: 2013-11-14 05:10:18
                    90FAST LINEAR HOMOTOPY TO FIND APPROXIMATE ZEROS OF POLYNOMIAL SYSTEMS ´ AND LUIS MIGUEL PARDO CARLOS BELTRAN Abstract. We prove a new complexity bound, polynomial on the average,

                    FAST LINEAR HOMOTOPY TO FIND APPROXIMATE ZEROS OF POLYNOMIAL SYSTEMS ´ AND LUIS MIGUEL PARDO CARLOS BELTRAN Abstract. We prove a new complexity bound, polynomial on the average,

                    Add to Reading List

                    Source URL: personales.unican.es

                    - Date: 2011-06-09 07:24:52