On Symbolic-Numeric Solving of Sine-Polynomial Equations

نویسنده

  • Aude Maignan
چکیده

This paper deals with the localization of all the real roots of sine-polynomials. D. Richardson (1991, in ``effective Methods in Algebraic Geometry,'' pp. 427 440, Birkha user, Basel) has already studied this type of analytic function. He showed how to find the number of real roots in a bounded interval. Here we propose an algorithm which determines whether a sine-polynomial has a finite number of real roots or not. Moreover in the finite case we construct an explicit interval containing all of them. We also construct a generalized exclusion method to find all the real roots in a bounded interval and we adapt it to the infinite case. 2000 Academic Press

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study

We consider a family of polynomial systems which arises in the analysis of the stationary solutions of a standard discretization of certain semilinear second order parabolic partial differential equations. We prove that this family is well–conditioned from the numeric point of view, and ill–conditioned from the symbolic point of view. We exhibit a polynomial–time numeric algorithm solving any m...

متن کامل

Solving polynomial systems via symbolic-numeric reduction to geometric involutive form

We briefly survey several existing methods for solving polynomial system with inexact coefficients, then introduce our new symbolic-numeric method which is based on the geometric (Jet) theory of partial differential equations. The method is stable and robust. Numerical experiments illustrate the performance of the new method.

متن کامل

Pythagore ’ s Dilemma , Symbolic - Numeric Com - putation , and the Border Basis Method

In this tutorial paper, we first discuss the motivation of doing symbolic-numeric computation, with the aim of developing efficient and certified polynomial solvers. We give a quick overview of fundamental algebraic properties, used to recover the roots of a polynomial system, when we know the multiplicative structure of its quotient algebra. Then, we describe the border basis method, justifyin...

متن کامل

A Fast Hybrid Symbolic-Numeric Solver for Secular Equations

In this paper we develop a hybrid symbolic-numeric fast method for solving the secular equation associated with a diagonal plus rank-one eigenvalue problem of order n in O(n) operations and O(n) storage. AMS classification: 65F15

متن کامل

A proposal to first principles electronic structure calculation: Symbolic-Numeric method

This study proposes an approach toward the first principles electronic structure calculation with the aid of symbolic-numeric solving. The symbolic computation enables us to express the Hartree-Fock-Roothaan equation in an analytic form and approximate it as a set of polynomial equations. By use of the Gröbner bases technique, the polynomial equations are transformed into other ones which have ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Complexity

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2000