By Topic

2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

23-26 Sept. 2010

Filter Results

Displaying Results 1 - 25 of 94
  • [Front cover]

    Publication Year: 2010, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (341 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2010, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2010, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2010, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (162 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2010, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (106 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Chairs and Committees

    Publication Year: 2010, Page(s):xiv - xv
    Request permission for commercial reuse | PDF file iconPDF (120 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2010, Page(s):xvi - xix
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • Programming via Rewriting

    Publication Year: 2010, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (79 KB) | HTML iconHTML

    Programming via rewriting is a part of the declarative programming which is illustrated by the languages: OBJ, Maude, CafeOBJ, CASL and so on. Programming via rewriting is very close to the equational logic. In the equational logic a set Γ of axioms is given. Axioms are Horn clauses, called also conditional equations. We are looking for all universal quantified equalities which are conseque... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connectivity in Semi-algebraic Sets

    Publication Year: 2010, Page(s):4 - 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    We consider the problem of deciding whether two given points in a semialgebraic set can be connected, that is, whether the two points lie in a same connected component. In particular, we consider a semialgebraic set consisting of points where a given polynomial is non-zero. We will describe a method based on gradient fields, eigenvectors and interval analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mathematical and Computational Mistakes and Failures as a Source of Creativity

    Publication Year: 2010, Page(s):8 - 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (159 KB) | HTML iconHTML

    Mistakes are generally considered a negative phenomenon. There is however a positive face of mistakes, essential in learning, in teaching, in scientific research and in any creative work. We discuss the reason of this fact, we give several such examples and we show how various historical failures in some respect became important successes in another respect. In a second part of this paper, three t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Improvements of Wallis' Inequality

    Publication Year: 2010, Page(s):12 - 16
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    The mathematical backbone of this article is formed by three classical formulas of Wallis: his product formula for π, an inequality implying the product formula in the limit, and a related definite integral involving powers of the sine function. For the latter we present various evaluations to illustrate recent algorithmic developments. In the main part of the article we automatically refin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Mathematics of Mathematical Handwriting Recognition

    Publication Year: 2010, Page(s): 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    Accurate computer recognition of handwritten mathematics offers to provide a natural interface for mathematical computing, document creation and collaboration. Mathematical handwriting, however, provides a number of challenges beyond what is required for the recognition of handwritten natural languages. For example, it is usual to use symbols from a range of different alphabets and there are many ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Symbolic-Numeric Algorithm for Computing the Alexander Polynomial of a Plane Curve Singularity

    Publication Year: 2010, Page(s):21 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (791 KB) | HTML iconHTML

    We report on a symbolic-numeric algorithm for computing the Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficients are both exact and inexact data. We base the algorithm on combinatorial methods from knot theory which we combine with computational geometry algorithms in order to compute effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial GCD and Factorization via Approximate Gröbner Bases

    Publication Year: 2010, Page(s):29 - 36
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    We discuss computation of approximate Gröbner bases at finite precision. We show how this can be used to deduce exact results for polynomial greatest common divisors and factorization. In particular we indicate an algorithm for factoring multivariate polynomials over the closure algebraic of the rationals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic-Numeric Cooperation in an Open Science Project

    Publication Year: 2010, Page(s):37 - 46
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB) | HTML iconHTML

    This paper presents an overview of the initiative based on non-commercial software, which is being carried out in the University of La Rioja, to develop an e-Science and e-Learning Web-Site with the aim to encourage open science and e-Collaboration. This infrastructure is focused on supplying free access to a variety of symbolic and numeric applications related to Dynamics Systems, in general, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On BLAS Operations with Recursively Stored Sparse Matrices

    Publication Year: 2010, Page(s):49 - 56
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (203 KB) | HTML iconHTML

    Recently, we have proposed a recursive partitioning based layout for multi-core computations on sparse matrices. Based on positive results of our initial experiments with matrix-vector multiplication, we discuss how this storage format can be utilized across a range of BLAS-style matrix operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Usage of 16 Bit Indices in Recursively Stored Sparse Matrices

    Publication Year: 2010, Page(s):57 - 64
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (222 KB) | HTML iconHTML

    In our earlier work, we have investigated the feasibility of utilization of recursive partitioning in basic (BLAS oriented) sparse matrix computations, on multi-core cache-based computers. Following encouraging experimental results obtained for SpMV and SpSV operations, here we proceed to tune the storage format. To limit the memory bandwidth overhead we introduce usage of shorter (16 bit) indices... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An x-Coordinate Point Compression Method for Elliptic Curves over Fp

    Publication Year: 2010, Page(s):65 - 71
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    In this paper we propose an x-coordinate point compression method for elliptic curves over Fp, where p >; 3 is prime, as an alternative to the classical y-coordinate point compression method. A point P̃ = (x̃, y) will be compressed as P = (x, y) where x has only two bits and, thus, our method allows more compact representations when [log2 x] >; [log2<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract Domains for Constraint Programming, with the Example of Octagons

    Publication Year: 2010, Page(s):72 - 79
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (283 KB) | HTML iconHTML

    In Constraint Programming (CP), the central notion of consistency can be defined as a fix point of some contracting operators. These operators always deal with cartesian products of domains of the same nature (real intervals, integer sets, etc), due to the cartesian nature of the CSP format. However, textit{inside} the solving process, there is no particular reason why the domains should be cartes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Algorithm for Dot Product over Word-Size Finite Field Using Floating-Point Arithmetic

    Publication Year: 2010, Page(s):80 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    Recently, parallel computation has become necessary to take full advantage of the gains allowed by Moore's law. Many scientific and engineering applications exhibit data parallelism but might not make full use of it. Some ubiquitous operations such that the dot product can easily be parallelized and then make good use of available hardware, like multi-core or GPU. In this paper, we provide two sli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical Solutions for a Class of Backward Stochastic Differential Equations

    Publication Year: 2010, Page(s):91 - 94
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    We propose a method for numerical approximation of the solutions of backward stochastic differential equations in some non-lipschitz conditions for the coefficient functions and without the condition of the continuity for the final data. Given a simulation-based estimator of the conditional expectation operator, we then suggest a backward simulation scheme. Our explicitly method is simple to imple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Likelihood Estimation Algorithm Evaluation for Wireless Sensor Networks

    Publication Year: 2010, Page(s):95 - 98
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB) | HTML iconHTML

    Node localization in wireless sensor networks plays a key role in the correct functioning of the sensor network. This paper aims to evaluate one of the most common node localization algorithms, the Maximum Likelihood Estimation Algorithm. The algorithm is simulated taking into account distances affected by measurement errors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Mixed Time Partitioning Methods to Raise the Efficiency of Solidification Modeling

    Publication Year: 2010, Page(s):99 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    In this paper we focus on the application of a mixed time partitioning methods to raise efficiency of the solidification kernel in the NuscaS system. We are proposing using a fixed time step in the casting and its integer multiple in other parts of mould because the time step size determines the accuracy of the simulation results. By means of numerical experiments we show that our approach allows ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Translating Regular Expression Matching into Transducers

    Publication Year: 2010, Page(s):107 - 115
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (347 KB) | HTML iconHTML

    Regular expression matching is an essential tool in string manipulating programs and plays crucial roles in scripting languages. We focus on regular expression matching based on the strategy of Perl and develop a translation from regular expression matching into transducers. The representation makes it possible to apply the theory of formal languages in static analysis and verification of string m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.