FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1516519165> ?p ?o ?g. }

• W1516519165 abstract "We present SyNRAC, a symbolic computation package for solving real algebraic constraints. Algorithms in SyNRAC are implemented on the Maple software and they are expected to provide many users with symbolic methods of dealing with practical problems in engineering. SyNRAC is to be aimed to support symbolic, numerical, and symbolic-numeric computation. Until now we have emphasized on symbolic methods and implemented two types of special QE algorithms. Our project’s outline, the present state of SyNRAC, and our future plan are stated. 1 A Brief History of QE Quantifier elimination (QE) is a procedure that takes a first-order formula as input and returns a quantifier-free formula equivalent to the input. The history of QE dates back to the 1930s when Tarski proved the existence of a decision procedure for theory of real closed fields. Tarski also presented the first quantifier elimination algorithm, which was later modified by Seidenberg and is now known as the Seidenberg-Tarski algorithm [3, 10]. The algorithm requires too much computation, far from handling practical problems. In 1975 Collins [4, 5] achieved a historic breakthrough in QE. He provided a new decision method based on his concept of cylindrical algebraic decomposition (CAD). The complexity of the CAD algorithm is doubly exponential in the number of quantified variables, which greatly improved the Seidenberg-Tarski algorithm. Though Collins’s CAD method still could solve only very simple problems, it stimulated researchers to study this area. In the 1980s many revised algorithms and related research papers were presented. Some groups of people started implementing QE algorithms around 1990. The QEPCAD and ∗yanami@flab.fujitsu.co.jp †anai@jp.fujitsu.com c © 2003 Japan Society for Symbolic and Algebraic Computation J.JSSAC Vol. 10, No. 1, 2003 35 REDLOG packages have been known as pioneers and by far the famous ones; QE algorithms were also implemented on Mathematica and on Risa/Asir. For QEPCAD and REDLOG, see the respective articles in the present issue. Among the known general QE methods, the partial-CAD-based algorithm is known as the most organized and efficient one; the algorithm has been implemented in the QEPCAD package. In spite of the quality of the algorithm, its worst-case computation has still doubly exponential behavior. This fact promoted another point of view in studying QE and new approaches—QE algorithms that target only a certain type of formulas—were attempted in the 1990s. The method, known as the special QE method, enables us to make use of typical features of the prescribed formulas to reduce its computational complexity. With the help of these theoretical improvement as well as the year-by-year growth in hardware power such as CPU performance and memory size, various types of engineering problems can now be dealt with in reasonable time and space. 2 The SyNRAC Project We have been developing a toolbox including special QE methods on the Maple software. The toolbox has been named SyNRAC, which stands for a Symbolic-Numeric toolbox for Real Algebraic Constraints. The SyNRAC project started late last year after some successful results in solving practical engineering problems were obtained by using symbolic computation methods. The reasons why we have chosen Maple as a platform are: 1) Though Maple has been very popular among researchers in engineering, there are no QE tools available; 2) Maple provides us with a stable and friendly development environment; 3) Maple packages are automatically incorporated into MATLAB, which is widely used in engineering, via its “Symbolic Math Toolbox.” Based on SyNRAC we are planning to develop some toolboxes on MATLAB tailored for specific application fields such as robust control design. Those are expected to be novel tools and would provide engineers with new systematic design procedures using symbolic, numerical, and symbolic-numeric methods. 3 The Present State of SyNRAC It is just more than half a year since our SyNRAC project started. We are currently focusing on some known special QE algorithms, which are specialized to particular types of input formulas. Two sorts of special QE algorithms have been implemented so far and are now available in SyNRAC; one is a special QE algorithm for the sign definite condition (SDC) and the other is a special QE algorithm for linear formulas. These types of formulas 36 数式処理 第 10 巻 第 1 号 2003 cover a wide range of problems and the algorithms implemented have enough efficiency to solve various practical problems. These algorithms are each built around respective techniques. The former is based on the Sturm-Habicht sequence; the latter on virtual substitution. We briefly explain them in the next two subsections. Details of these algorithms are described in Anai and Yanami [2]. 3.1 Special QE Using the Sturm-Habicht Sequence The Sturm-Habicht sequence associated to a polynomial in R[x] is, in a word, a revised version of the well-known Sturm sequence. See [8] for the definition of the Sturm-Habicht sequence. The Sturm-Habicht sequence with respect to f(x) ∈ R[x] is a list of polynomials and is used for counting the number of real zeros of f in a given interval. The number of zeros of an interval, say, between a and b is calculated as follows: (1) Substitute a for x in the Sturm-Habicht sequence and count the number of sign changes over the resulting sequence; denote it by Na; (2) Do the same thing for the other endpoint b to obtain Nb; (3) The answer is the absolute value |Na −Nb| of the difference of these two numbers. Gonzalez-Vega [7] used the sequence to eliminate the quantifier in a first-order formula of the form ∀x, f(x) > 0, where f(x) ∈ R[x]. Anai and Hara [1] examined a similar type of formulas ∀x > 0, f(x) > 0 , and called this condition the sign definite condition (SDC). They also showed that a vast range of problems arising in engineering can be reduced to SDC and succeeded in solving them symbolically. It is easy to see that SDC is equivalent to the condition that f has no real zeros in the interval (0,+∞), plus f takes a positive value for some x > 0. By considering all the possible sign changes over the Sturm-Habicht sequence, we obtain an equivalent formula without the quantified variable x. 3.2 Special QE by Virtual Substitution The other QE algorithm implemented in SyNRAC deals with linear formulas by virtual substitution. A formula is called linear when every atomic subformula in it is linear with respect to its quantified variables, i.e., it is of the form a0 + a1x1 + · · ·+ anxn ρ 0 , where x1, ..., xn are the quantified variables, each term ai, 0 ≤ i ≤ n, contains no quantified variables, and ρ ∈ {=, 6=,≤, <}. In 1988 Weispfenning [11] proposed a QE algorithm by virtual substitution for linear formulas. The main idea for eliminating x in a formula ∃xφ(x) is to find a suitable finite J.JSSAC Vol. 10, No. 1, 2003 37 set of terms S = {a1, . . . , an} each term of which contains no x, so that the formula and φ(x//a1) ∨ · · · ∨ φ(x//an) are equivalent. Here φ(x//ai) is the formula obtained by a modified substitution. A theorem in [11] says that when the input is a linear formula, one can find S, called an elimination set, satisfying the above condition, and moreover, the resulting formula ∨s∈Sφ(x//s) is again linear. This fact, as well as the equivalence ∀xφ(x)⇐⇒¬(∃x¬φ(x)) with φ quantifier-free, enables us to eliminate all the quantifiers in a given linear formula; remove them one by one from inside. Loos and Weispfenning [9] have found elimination sets smaller than in [11], which promote to increase algorithm’s efficiency. We have implemented the algorithms in both papers." @default.
• W1516519165 created "2016-06-24" @default.
• W1516519165 creator A5037020693 @default.
• W1516519165 creator A5060203734 @default.
• W1516519165 date "2005-01-01" @default.
• W1516519165 modified "2023-09-27" @default.
• W1516519165 title "SyNRAC: A New Maple Package for Supporting Design and Analysis in Engineering" @default.
• W1516519165 cites W1553142094 @default.
• W1516519165 cites W2007074311 @default.
• W1516519165 cites W2007600823 @default.
• W1516519165 cites W2013702670 @default.
• W1516519165 cites W2032382979 @default.
• W1516519165 cites W2104715607 @default.
• W1516519165 cites W2105000925 @default.
• W1516519165 cites W2129504840 @default.
• W1516519165 cites W2318268489 @default.
• W1516519165 cites W5248521 @default.
• W1516519165 hasPublicationYear "2005" @default.
• W1516519165 type Work @default.
• W1516519165 sameAs 1516519165 @default.
• W1516519165 citedByCount "0" @default.
• W1516519165 crossrefType "journal-article" @default.
• W1516519165 hasAuthorship W1516519165A5037020693 @default.
• W1516519165 hasAuthorship W1516519165A5060203734 @default.
• W1516519165 hasConcept C115903868 @default.
• W1516519165 hasConcept C127413603 @default.
• W1516519165 hasConcept C199639397 @default.
• W1516519165 hasConcept C2780414537 @default.
• W1516519165 hasConcept C41008148 @default.
• W1516519165 hasConcept C59822182 @default.
• W1516519165 hasConcept C86803240 @default.
• W1516519165 hasConceptScore W1516519165C115903868 @default.
• W1516519165 hasConceptScore W1516519165C127413603 @default.
• W1516519165 hasConceptScore W1516519165C199639397 @default.
• W1516519165 hasConceptScore W1516519165C2780414537 @default.
• W1516519165 hasConceptScore W1516519165C41008148 @default.
• W1516519165 hasConceptScore W1516519165C59822182 @default.
• W1516519165 hasConceptScore W1516519165C86803240 @default.
• W1516519165 hasLocation W15165191651 @default.
• W1516519165 hasOpenAccess W1516519165 @default.
• W1516519165 hasPrimaryLocation W15165191651 @default.
• W1516519165 hasRelatedWork W1535199449 @default.
• W1516519165 hasRelatedWork W168301 @default.
• W1516519165 hasRelatedWork W1802373871 @default.
• W1516519165 hasRelatedWork W1861622419 @default.
• W1516519165 hasRelatedWork W1985622114 @default.
• W1516519165 hasRelatedWork W2020190485 @default.
• W1516519165 hasRelatedWork W2056941658 @default.
• W1516519165 hasRelatedWork W2073270928 @default.
• W1516519165 hasRelatedWork W2084958332 @default.
• W1516519165 hasRelatedWork W2143803820 @default.
• W1516519165 hasRelatedWork W2185006904 @default.
• W1516519165 hasRelatedWork W2217166988 @default.
• W1516519165 hasRelatedWork W2360427374 @default.
• W1516519165 hasRelatedWork W2362875531 @default.
• W1516519165 hasRelatedWork W2392680890 @default.
• W1516519165 hasRelatedWork W2480999034 @default.
• W1516519165 hasRelatedWork W2963036856 @default.
• W1516519165 hasRelatedWork W339274822 @default.
• W1516519165 hasRelatedWork W572168294 @default.
• W1516519165 hasRelatedWork W89774232 @default.
• W1516519165 isParatext "false" @default.
• W1516519165 isRetracted "false" @default.
• W1516519165 magId "1516519165" @default.
• W1516519165 workType "article" @default.