2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

22-25 Sept. 2014

Filter Results

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

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

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

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

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

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

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

    Publication Year: 2014, Page(s):xiv - xv
    Request permission for commercial reuse | PDF file iconPDF (127 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2014, Page(s):xvi - xxi
    Request permission for commercial reuse | PDF file iconPDF (384 KB)
    Freely Available from IEEE
  • Model-Driven Design of Cloud Applications with Quality-of-Service Guarantees: The MODAClouds Approach, MICAS Tutorial

    Publication Year: 2014, Page(s):3 - 10
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 KB) | HTML iconHTML

    The competition between cloud providers has led to an impressive set of cloud solutions offered to consumers. The ability to properly design and deploy multi-cloud applications (i.e., Applications deployed on multiple clouds) allows exploiting the peculiarities of each cloud solution and hence optimizing the performance and cost of the applications. However, this is hindered by the large heterogen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Huzita's Basic Origami Fold in Geometric Algebra

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

    This short note describes the first step of the application of the geometric algebra (GA) to the computational origami system called Eos. Main results are the formalization of GA in Isabelle/HOL and the re-statement of Huzita's basic fold operations in equalities in GA. By solving the equalities we can obtain the fold line (s) that are used in each step of origami construction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic Improvement of Programs

    Publication Year: 2014, Page(s):14 - 19
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    Genetic programming can optimise software, including: evolving test benchmarks, generating hyper-heuristics by searching meta-heuristics, generating communication protocols, composing telephony systems and web services, generating improved hashing and C++ heap managers, redundant programming and even automatic bug fixing. Particularly in embedded real-time or mobile systems, there may be many ways... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spiking Neural P Systems - A Quick Survey and Some Research Topics

    Publication Year: 2014, Page(s):20 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    After presenting the basic definition of spiking neural P systems (SN P systems), illustrated with two examples, we recall some results concerning the computing power and the size of universal SN P systems. We end this note with a couple of research topics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Streamlined Difference Ring Theory: Indefinite Nested Sums, the Alternating Sign, and the Parameterized Telescoping Problem

    Publication Year: 2014, Page(s):26 - 33
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (298 KB) | HTML iconHTML

    We present an algebraic framework to represent indefinite nested sums over hyper geometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extended to a ring theory in which also the alternating sign can be expressed. The underlying machinery relies on algorithms that compute all solutions of a given parameterized telescoping equ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Reasoning in Local Theory Extensions and Applications

    Publication Year: 2014, Page(s):34 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    We give an overview of results on hierarchical and modular reasoning in complex theories we established in previous work. We present a special type of extensions of a base theory, namely local theory extensions, for which hierarchic reasoning is possible (i.e. Proof tasks in the extension can be hierarchically reduced to proof tasks w.r.t. The base theory). We show how such local theory extensions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Cylindrical Algebraic Decomposition and Local Fourier Analysis to Study Numerical Methods: Two Examples

    Publication Year: 2014, Page(s):42 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a Fourier series and to use this representation to study certain properties of the particular numerical method, like the convergence rate or an error estimate. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition

    Publication Year: 2014, Page(s):53 - 60
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (303 KB) | HTML iconHTML

    We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather, the distribution is inherent to the cylindrical structure and determined mostly by the number of variables. This insight is then combined with an algorithm that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Branch Differences and Lambert W

    Publication Year: 2014, Page(s):61 - 65
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    The Lambert W function possesses branches labelled by an index k. The value of W therefore depends upon the value of its argument z and the value of its branch index. Given two branches, labelled n and m, the branch difference is the difference between the two branches, when both are evaluated at the same argument z. It is shown that elementary inverse functions have trivial branch differences, bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Corank Two Edge-Bipartite Graphs and Simply Extended Euclidean Diagrams

    Publication Year: 2014, Page(s):66 - 73
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    We continue the Coxeter spectral study of finite connected loop-free edge-bipartite graphs Δ, with m+2 ≥ 3 vertices (a class of signed graphs), started in [SIAM J. Discrete Math., 27(2013), 827-854] by means of the complex Coxeter spectrum speccΔ ⊆ C and presented in our talks given in SYNASC12 and SYNASC13. Here, we study non-negative edge-bipartite graphs o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Parametric Sparse Linear Systems by Local Blocking, II

    Publication Year: 2014, Page(s):74 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    The present author, Inaba and Kako proposed local blocking in a recent paper [6], for solving parametric sparse linear systems appearing in industry, so that the obtained solution is suited for determining optimal parameter values. They employed a graph theoretical treatment, and the points of their method are to select strongly connected sub graphs satisfying several restrictions and to form the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lipschitz Bounds for Noise Robustness in Compressive Sensing: Two Algorithms

    Publication Year: 2014, Page(s):85 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (213 KB) | HTML iconHTML

    The paper deals with numerical estimations of Lipschitz bounds relating locally the reconstruction error to the measurement error in the compressive sensing framework. Most recent theoretical papers in the field parametrize such bounds relatively to certain families of vectors called dual certificates, which are fundamental to several reconstruction criteria. The paper provides two algorithms for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Method for Locating Peak Values of the Riemann Zeta Function on the Critical Line

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

    In this paper a new algorithm RS-PEAK will be presented for locating peak values of the Riemann zeta function on the critical line. The method based on earlier results of Andrew M. Odlyzko, Tadej Kotnik, and on a recently achieved results of solving simultaneous Diophantine approximation problems. Until 2014 only a few hundred values were known where the Riemann-Siegel Z-function (i.e: Z(t)) large... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lowest Level Rule Push-Relabel Algorithm for Submodular Flows and Matroid Optimization

    Publication Year: 2014, Page(s):97 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    We present a new strategy for combinatorial push-relabel algorithm used in sub modular flows and matroid optimization. In the case of matroid optimization, in contrast with other known algorithms, our strategy needs no lexicographic order of the elements. Combined with a reduction of the number of active basis the resulting procedure gives a time complexity of O(n6). Moreover our rule o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Homotopy Asymptotic Method for Viscous Boundary Layer Flow in Unbounded Domain

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

    This paper is concerned on analytical treatment of non-linear differential equation of a viscous boundary layer flow due to a moving sheet. An analytic approximate technique, namely Optimal Homotopy Asymptotic Method (OHAM) is employed into a new version for this purpose. It is proved that OHAM provide accurate solution for the nonlinear differential equation of the third-order with initial and bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Arithmetic Algorithms for Hereditarily Binary Natural Numbers

    Publication Year: 2014, Page(s):109 - 116
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    Hereditarily binary numbers are a tree-based number representation derived from a bijection between natural numbers and iterated applications of two simple functions corresponding to bijective base 2 numbers. This paper describes several new arithmetic algorithms on hereditarily binary numbers that, while within constant factors from their traditional counterparts for their average case behavior, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Computation of the Hansen Coefficients

    Publication Year: 2014, Page(s):117 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    The Hansen coefficients are one of the most important tools in the analytical or semi-analytical methods of celestial mechanics. The problem of efficient computation was investigated in detail in many papers, but this subject is still open and to date there are not standard algorithms to generate the Hansen coefficients with accuracy and good computation time. Although the analytical expressions a... View full abstract»

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