By Topic

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on

Date 26-29 Sept. 2011

Filter Results

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

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

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

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

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

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

    Publication Year: 2011, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (105 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees and Reviewers

    Publication Year: 2011, Page(s):xii - xiv
    Request permission for commercial reuse | PDF file iconPDF (114 KB)
    Freely Available from IEEE
  • Self-Organizing Context Aware Agent Systems

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

    As computation increasingly pervades our environment and every aspect of our activity, there is the need of finding new paradigms of computation that support flexible interactions among humans, autonomous software components and objects enhanced with information, in a common shared environment. In this paper, we make a review of three important paradigms that promote autonomy, flexibility and dyna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What is Hybrid Symbolic-Numeric Computation?

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

    Hybrid symbolic-numeric computation constitutes the Fifth of my "Seven Dwarfs" of Symbolic Computation [1], which I have listed in my SNSC talk in Hagenberg in 2008. Hybridization requires that the solution of a computational mathematical problem should utilize both a numeric and a symbolic algorithmic component. The growth of the symbolic parts in scientific computing is driven by industry, as th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbol Elimination in Program Analysis

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

    Summary form only given. Automatic understanding of the intended meaning of computer programs is a very hard problem, requiring intelligence and reasoning. In this abstract we discuss a new method for program analysis, called symbol elimination. Symbol elimination uses first-order theorem proving techniques to automatically discover non-trivial program properties, such as loop invariants and loop ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Fuzzy Rule-Based Classification

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

    Many real world applications contain a decision making process which can be regarded as a pattern classification stage. Various pattern classification techniques have been introduced in the literature ranging from heuristic methods to intelligent soft computing techniques. In this paper, we focus on the latter and in particular on fuzzy rule-based classification algorithms.We show how an effective... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational Tools for Mathematical Collaboration

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

    Research collaboration has always been important and has recently become even more so. I wish therefore to address a topic I believe to require attention now, and that is software support for mathematical collaboration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What can Symbolic Computation Contribute to Mathematics?

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

    Symbolic Computation (Mathematics Subject Classification 2000, 68W30) is often treated as just another subject in the wide field of special topics within mathematics, on the same level as mesh generation (65L50) or quasi-Frobenius rings (16L60). Here we want to argue that actually Symbolic Computation is not so much a topic in mathematics, but a relatively novel approach to mathematical epistemolo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theory and an Algorithm of Approximate Gröbner Bases

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

    In this paper, we treat polynomials with coefficients of floating-point numbers. The conventional concept of ideal breaks down for such polynomials, and we first define a concept of "approximate ideal''. Then, introducing "accuracy-guarding reductions'', we define approximate Groebner bases and give an algorithm for computing the approximate Groebner bases. We prove several theorems showing basic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking Method for Reparametrized Geometrical Constraint Systems

    Publication Year: 2011, Page(s):31 - 38
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    In CAD, constraint solvers allow a user to describe a figure or an object with a set of constraints like distances, angles, tangencies, incidences and so on. Geometric solvers proceed in two stages. First, a symbolic construction plan is provided from the set of constraints. Then, the dimensions of constraints are used in a numerical stage to evaluate the construction plan. However, construction p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Long Integers and Polynomial Evaluation with Estrin's Scheme

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

    In this paper the problem of univariate polynomial evaluation is considered. When both polynomial coefficients and the evaluation "point" are integers, unbalanced multiplications (one factor having many more digits than the other one) in classical Ruffini-Horner rule do not let computations completely benefit of sub quadratic methods, like Karatsuba, Toom-Cook and Schonhage-Strassen's. We face thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Kahan's Rules for Determining Branch Cuts

    Publication Year: 2011, Page(s):47 - 51
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (183 KB) | HTML iconHTML

    In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring problems. The main focus is on the question of determining possible branch cuts. We explore the extent to which the treatment of branch cuts can be rendered (more) a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Computer Aided Software for Nonlinear Digital Control

    Publication Year: 2011, Page(s):52 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB) | HTML iconHTML

    The aim of this paper is to provide a basic software tool involved in the design and the computation of nonlinear digital control schemes. The complete software SimNLSys will include different modules associated with each control scheme, aimed with respective objectives such as stabilization, damping, output matching or optimality, to quote a few. The software module presented here also encompasse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Inequality Factor for Ehrlich-Aberth's Method

    Publication Year: 2011, Page(s):63 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    The convergence condition for the simultaneous inclusion methods is w(0) <; cnd(0), where w(0) is the maximum Weierstrass factor Wk(0), k ∈In, and d(0) is the minimum distance between z1(0), z2(0), ...zn(0), the distinct approximations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Interpolation Trigonometric Polynomial with an Arbitrary Even Number of Nodes

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

    The trigonometric interpolation polynomial with an arbitrary even number of nodes is computed in connection with other well known results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Submodelling Inside Transient Flows

    Publication Year: 2011, Page(s):75 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1025 KB) | HTML iconHTML

    The size of the output originating from high performance scientific simulations is a major bottleneck in parallel computing. Submodelling allows for the local refinement of the results without the necessity to load and store the larger, global simulation data. This enables a user to focus in several regions of interest and disregard the rest of the analysis domain, and by doing so to heavily reduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++

    Publication Year: 2011, Page(s):83 - 86
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    We show that the reduced mesh root systems and mesh geometries of roots for each of the simply-laced Dynkin diagrams can be classified by applying symbolic computer algebra computations and numeric algorithmic computations in Maple, C++ and Linux. Results of our computing experiences are presented in a table of Section 2 and in Section 6. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition

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

    This paper presents project duration assessment model based on modification of shortest path algorithms and superposition. One of the shortest path algorithms, Dijkstra algorithm, is modified in order to find the longest path. This is used for critical path calculation, i.e. for resolving project duration assessment problem. Another modification of algorithm calculates sub critical path as the sec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm

    Publication Year: 2011, Page(s):93 - 100
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (213 KB) | HTML iconHTML

    Given a task set T, finding a feasible schedule for T is one of the most significant problems of real time embedded systems. The research community has found a lot of important results for the scheduling problem on both uniprocessor and multiprocessor platforms. To the best of our knowledge, there is still room for research in determining the number of processors for a given task set, where each t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof Techniques for Synthesis of Sorting Algorithms

    Publication Year: 2011, Page(s):101 - 109
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (222 KB) | HTML iconHTML

    In the context of constructive synthesis of sorting algorithms, starting from the specification of the problem (input and output conditions), the proof of existence of a sorted tuple is performed inductively and we design, implement, and experiment with different proof techniques: First we use a back-chaining mechanism similar to a Prolog engine for first order logic, in which meta-variables are u... View full abstract»

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