WorldWideScience

Sample records for methods computer algebra

  1. Computer methods in general relativity: algebraic computing

    CERN Document Server

    Araujo, M E; Skea, J E F; Koutras, A; Krasinski, A; Hobill, D; McLenaghan, R G; Christensen, S M

    1993-01-01

    Karlhede & MacCallum [1] gave a procedure for determining the Lie algebra of the isometry group of an arbitrary pseudo-Riemannian manifold, which they intended to im- plement using the symbolic manipulation package SHEEP but never did. We have recently finished making this procedure explicit by giving an algorithm suitable for implemen- tation on a computer [2]. Specifically, we have written an algorithm for determining the isometry group of a spacetime (in four dimensions), and partially implemented this algorithm using the symbolic manipulation package CLASSI, which is an extension of SHEEP.

  2. Classical versus Computer Algebra Methods in Elementary Geometry

    Science.gov (United States)

    Pech, Pavel

    2005-01-01

    Computer algebra methods based on results of commutative algebra like Groebner bases of ideals and elimination of variables make it possible to solve complex, elementary and non elementary problems of geometry, which are difficult to solve using a classical approach. Computer algebra methods permit the proof of geometric theorems, automatic…

  3. Algebraic computing

    International Nuclear Information System (INIS)

    MacCallum, M.A.H.

    1990-01-01

    The implementation of a new computer algebra system is time consuming: designers of general purpose algebra systems usually say it takes about 50 man-years to create a mature and fully functional system. Hence the range of available systems and their capabilities changes little between one general relativity meeting and the next, despite which there have been significant changes in the period since the last report. The introductory remarks aim to give a brief survey of capabilities of the principal available systems and highlight one or two trends. The reference to the most recent full survey of computer algebra in relativity and brief descriptions of the Maple, REDUCE and SHEEP and other applications are given. (author)

  4. INdAM Meeting on Homological and Computational Methods in Commutative Algebra

    CERN Document Server

    Gubeladze, Joseph; Römer, Tim

    2017-01-01

    This volume collects contributions by leading experts in the area of commutative algebra related to the  INdAM meeting “Homological and Computational Methods in Commutative Algebra” held in Cortona (Italy) from May 30 to  June 3, 2016 . The conference and this volume are dedicated to Winfried Bruns on the occasion of his 70th birthday. In particular, the topics of this book strongly reflect the variety of Winfried Bruns’ research interests and his great impact on commutative algebra as well as its applications to related fields. The authors discuss recent and relevant developments in algebraic geometry, commutative algebra, computational algebra, discrete geometry and homological algebra. The book offers a unique resource, both for young and more experienced researchers seeking comprehensive overviews and extensive bibliographic references.

  5. Computer algebra and operators

    Science.gov (United States)

    Fateman, Richard; Grossman, Robert

    1989-01-01

    The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.

  6. Computer algebra applications

    International Nuclear Information System (INIS)

    Calmet, J.

    1982-01-01

    A survey of applications based either on fundamental algorithms in computer algebra or on the use of a computer algebra system is presented. Recent work in biology, chemistry, physics, mathematics and computer science is discussed. In particular, applications in high energy physics (quantum electrodynamics), celestial mechanics and general relativity are reviewed. (Auth.)

  7. Waterloo Workshop on Computer Algebra

    CERN Document Server

    Zima, Eugene; WWCA-2016; Advances in computer algebra : in honour of Sergei Abramov's' 70th birthday

    2018-01-01

    This book discusses the latest advances in algorithms for symbolic summation, factorization, symbolic-numeric linear algebra and linear functional equations. It presents a collection of papers on original research topics from the Waterloo Workshop on Computer Algebra (WWCA-2016), a satellite workshop of the International Symposium on Symbolic and Algebraic Computation (ISSAC’2016), which was held at Wilfrid Laurier University (Waterloo, Ontario, Canada) on July 23–24, 2016.   This workshop and the resulting book celebrate the 70th birthday of Sergei Abramov (Dorodnicyn Computing Centre of the Russian Academy of Sciences, Moscow), whose highly regarded and inspirational contributions to symbolic methods have become a crucial benchmark of computer algebra and have been broadly adopted by many Computer Algebra systems.

  8. Geometric Algebra Computing

    CERN Document Server

    Corrochano, Eduardo Bayro

    2010-01-01

    This book presents contributions from a global selection of experts in the field. This useful text offers new insights and solutions for the development of theorems, algorithms and advanced methods for real-time applications across a range of disciplines. Written in an accessible style, the discussion of all applications is enhanced by the inclusion of numerous examples, figures and experimental analysis. Features: provides a thorough discussion of several tasks for image processing, pattern recognition, computer vision, robotics and computer graphics using the geometric algebra framework; int

  9. An algebra of reversible computation.

    Science.gov (United States)

    Wang, Yong

    2016-01-01

    We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.

  10. Improved Linear Algebra Methods for Redshift Computation from Limited Spectrum Data - II

    Science.gov (United States)

    Foster, Leslie; Waagen, Alex; Aijaz, Nabella; Hurley, Michael; Luis, Apolo; Rinsky, Joel; Satyavolu, Chandrika; Gazis, Paul; Srivastava, Ashok; Way, Michael

    2008-01-01

    Given photometric broadband measurements of a galaxy, Gaussian processes may be used with a training set to solve the regression problem of approximating the redshift of this galaxy. However, in practice solving the traditional Gaussian processes equation is too slow and requires too much memory. We employed several methods to avoid this difficulty using algebraic manipulation and low-rank approximation, and were able to quickly approximate the redshifts in our testing data within 17 percent of the known true values using limited computational resources. The accuracy of one method, the V Formulation, is comparable to the accuracy of the best methods currently used for this problem.

  11. Applications of computer algebra

    CERN Document Server

    1985-01-01

    Today, certain computer software systems exist which surpass the computational ability of researchers when their mathematical techniques are applied to many areas of science and engineering. These computer systems can perform a large portion of the calculations seen in mathematical analysis. Despite this massive power, thousands of people use these systems as a routine resource for everyday calculations. These software programs are commonly called "Computer Algebra" systems. They have names such as MACSYMA, MAPLE, muMATH, REDUCE and SMP. They are receiving credit as a computational aid with in­ creasing regularity in articles in the scientific and engineering literature. When most people think about computers and scientific research these days, they imagine a machine grinding away, processing numbers arithmetically. It is not generally realized that, for a number of years, computers have been performing non-numeric computations. This means, for example, that one inputs an equa­ tion and obtains a closed for...

  12. Computers in nonassociative rings and algebras

    CERN Document Server

    Beck, Robert E

    1977-01-01

    Computers in Nonassociative Rings and Algebras provides information pertinent to the computational aspects of nonassociative rings and algebras. This book describes the algorithmic approaches for solving problems using a computer.Organized into 10 chapters, this book begins with an overview of the concept of a symmetrized power of a group representation. This text then presents data structures and other computational methods that may be useful in the field of computational algebra. Other chapters consider several mathematical ideas, including identity processing in nonassociative algebras, str

  13. Applications of Computer Algebra Conference

    CERN Document Server

    Martínez-Moro, Edgar

    2017-01-01

    The Applications of Computer Algebra (ACA) conference covers a wide range of topics from Coding Theory to Differential Algebra to Quantam Computing, focusing on the interactions of these and other areas with the discipline of Computer Algebra. This volume provides the latest developments in the field as well as its applications in various domains, including communications, modelling, and theoretical physics. The book will appeal to researchers and professors of computer algebra, applied mathematics, and computer science, as well as to engineers and computer scientists engaged in research and development.

  14. Computational aspects of algebraic curves

    CERN Document Server

    Shaska, Tanush

    2005-01-01

    The development of new computational techniques and better computing power has made it possible to attack some classical problems of algebraic geometry. The main goal of this book is to highlight such computational techniques related to algebraic curves. The area of research in algebraic curves is receiving more interest not only from the mathematics community, but also from engineers and computer scientists, because of the importance of algebraic curves in applications including cryptography, coding theory, error-correcting codes, digital imaging, computer vision, and many more.This book cove

  15. Examinations in the Final Year of Transition to Mathematical Methods Computer Algebra System (CAS)

    Science.gov (United States)

    Leigh-Lancaster, David; Les, Magdalena; Evans, Michael

    2010-01-01

    2009 was the final year of parallel implementation for Mathematical Methods Units 3 and 4 and Mathematical Methods (CAS) Units 3 and 4. From 2006-2009 there was a common technology-free short answer examination that covered the same function, algebra, calculus and probability content for both studies with corresponding expectations for key…

  16. Computing one of Victor Moll's irresistible integrals with computer algebra

    Directory of Open Access Journals (Sweden)

    Christoph Koutschan

    2008-04-01

    Full Text Available We investigate a certain quartic integral from V. Moll's book “Irresistible Integrals” and demonstrate how it can be solved by computer algebra methods, namely by using non-commutative Gröbner bases. We present recent implementations in the computer algebra systems SINGULAR and MATHEMATICA.

  17. Introduction to computational linear algebra

    CERN Document Server

    Nassif, Nabil; Erhel, Jocelyne

    2015-01-01

    Introduction to Computational Linear Algebra introduces the reader with a background in basic mathematics and computer programming to the fundamentals of dense and sparse matrix computations with illustrating examples. The textbook is a synthesis of conceptual and practical topics in ""Matrix Computations."" The book's learning outcomes are twofold: to understand state-of-the-art computational tools to solve matrix computations problems (BLAS primitives, MATLAB® programming) as well as essential mathematical concepts needed to master the topics of numerical linear algebra. It is suitable for s

  18. Computational linear and commutative algebra

    CERN Document Server

    Kreuzer, Martin

    2016-01-01

    This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is not available at all. The authors continue to prese...

  19. Algebraic Methods to Design Signals

    Science.gov (United States)

    2015-08-27

    to date on designing signals using algebraic and combinatorial methods. Mathematical tools from algebraic number theory, representation theory and... combinatorial objects in designing signals for communication purposes. Sequences and arrays with desirable autocorrelation properties have many...multiple access methods in mobile radio communication systems. We continue our mathematical framework based on group algebras, character theory

  20. The cell method a purely algebraic computational method in physics and engineering

    CERN Document Server

    Ferretti, Elena

    2014-01-01

    The Cell Method (CM) is a computational tool that maintains critical multidimensional attributes of physical phenomena in analysis. This information is neglected in the differential formulations of the classical approaches of finite element, boundary element, finite volume, and finite difference analysis, often leading to numerical instabilities and spurious results. This book highlights the central theoretical concepts of the CM that preserve a more accurate and precise representation of the geometric and topological features of variables for practical problem solving. Important applications occur in fields such as electromagnetics, electrodynamics, solid mechanics and fluids. CM addresses non-locality in continuum mechanics, an especially important circumstance in modeling heterogeneous materials. Professional engineers and scientists, as well as graduate students, are offered: A general overview of physics and its mathematical descriptions; Guidance on how to build direct, discrete formulations; Coverag...

  1. Inequalities, Assessment and Computer Algebra

    Science.gov (United States)

    Sangwin, Christopher J.

    2015-01-01

    The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in contemporary…

  2. Algebraic computing in general relativity

    International Nuclear Information System (INIS)

    D'Inverno, R.A.

    1975-01-01

    The purpose of this paper is to bring to the attention of potential users the existence of algebraic computing systems, and to illustrate their use by reviewing a number of problems for which such a system has been successfully used in General Relativity. In addition, some remarks are included which may be of help in the future design of these systems. (author)

  3. Aberration studies and computer algebra

    International Nuclear Information System (INIS)

    Hawkes, P.W.

    1981-01-01

    The labour of calculating expressions for aberration coefficients is considerably lightened if a computer algebra language is used to perform the various substitutions and expansions involved. After a brief discussion of matrix representations of aberration coefficients, a particular language, which has shown itself to be well adapted to particle optics, is described and applied to the study of high frequency cavity lenses. (orig.)

  4. Computational triadic algebras of signs

    Energy Technology Data Exchange (ETDEWEB)

    Zadrozny, W. [T.J. Watson Research Center, Yorktown Heights, NY (United States)

    1996-12-31

    We present a finite model of Peirce`s ten classes of signs. We briefly describe Peirce`s taxonomy of signs; we prove that any finite collection of signs can be extended to a finite algebra of signs in which all interpretants are themselves being interpreted; and we argue that Peirce`s ten classes of signs can be defined using constraints on algebras of signs. The paper opens the possibility of defining multimodal cognitive agents using Peirce`s classes of signs, and is a first step towards building a computational logic of signs based on Peirce`s taxonomies.

  5. Method of computer algebraic calculation of the matrix elements in the second quantization language

    International Nuclear Information System (INIS)

    Gotoh, Masashi; Mori, Kazuhide; Itoh, Reikichi

    1995-01-01

    An automated method by the algebraic programming language REDUCE3 for specifying the matrix elements expressed in second quantization language is presented and then applied to the case of the matrix elements in the TDHF theory. This program works in a very straightforward way by commuting the electron creation and annihilation operator (a † and a) until these operators have completely vanished from the expression of the matrix element under the appropriate elimination conditions. An improved method using singlet generators of unitary transformations in the place of the electron creation and annihilation operators is also presented. This improvement reduces the time and memory required for the calculation. These methods will make programming in the field of quantum chemistry much easier. 11 refs., 1 tab

  6. Applications of symbolic algebraic computation

    International Nuclear Information System (INIS)

    Brown, W.S.; Hearn, A.C.

    1979-01-01

    This paper is a survey of applications of systems for symbomic algebraic computation. In most successful applications, calculations that can be taken to a given order by hand are then extended one or two more orders by computer. Furthermore, with a few notable exceptins, these applications also involve numerical computation in some way. Therefore the authors emphasize the interface between symbolic and numerical computation, including: 1. Computations with both symbolic and numerical phases. 2. Data involving both the unpredictible size and shape that typify symbolic computation and the (usually inexact) numerical values that characterize numerical computation. 3. Applications of one field to the other. It is concluded that the fields of symbolic and numerical computation can advance most fruitfully in harmony rather than in competition. (Auth.)

  7. Computer Algebra Systems in Undergraduate Instruction.

    Science.gov (United States)

    Small, Don; And Others

    1986-01-01

    Computer algebra systems (such as MACSYMA and muMath) can carry out many of the operations of calculus, linear algebra, and differential equations. Use of them with sketching graphs of rational functions and with other topics is discussed. (MNS)

  8. Lie algebra in quantum physics by means of computer algebra

    OpenAIRE

    Kikuchi, Ichio; Kikuchi, Akihito

    2017-01-01

    This article explains how to apply the computer algebra package GAP (www.gap-system.org) in the computation of the problems in quantum physics, in which the application of Lie algebra is necessary. The article contains several exemplary computations which readers would follow in the desktop PC: such as, the brief review of elementary ideas of Lie algebra, the angular momentum in quantum mechanics, the quark eight-fold way model, and the usage of Weyl character formula (in order to construct w...

  9. Computer Program For Linear Algebra

    Science.gov (United States)

    Krogh, F. T.; Hanson, R. J.

    1987-01-01

    Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.

  10. Nonlinear evolution equations and solving algebraic systems: the importance of computer algebra

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Kostov, N.A.

    1989-01-01

    In the present paper we study the application of computer algebra to solve the nonlinear polynomial systems which arise in investigation of nonlinear evolution equations. We consider several systems which are obtained in classification of integrable nonlinear evolution equations with uniform rank. Other polynomial systems are related with the finding of algebraic curves for finite-gap elliptic potentials of Lame type and generalizations. All systems under consideration are solved using the method based on construction of the Groebner basis for corresponding polynomial ideals. The computations have been carried out using computer algebra systems. 20 refs

  11. Inequalities, assessment and computer algebra

    Science.gov (United States)

    Sangwin, Christopher J.

    2015-01-01

    The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in contemporary curricula. We consider the formal mathematical processes by which such inequalities are solved, and we consider the notation and syntax through which solutions are expressed. We review the extent to which current CAS can accurately solve these inequalities, and the form given to the solutions by the designers of this software. Finally, we discuss the functionality needed to deal with students' answers, i.e. to establish equivalence (or otherwise) of expressions representing unions of intervals. We find that while contemporary CAS accurately solve inequalities there is a wide variety of notation used.

  12. Computations in finite-dimensional Lie algebras

    Directory of Open Access Journals (Sweden)

    A. M. Cohen

    1997-12-01

    Full Text Available This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System, within the computer algebra package GAP. A first sketch of the package can be found in Cohen and de Graaf[1]. Since then, in a collaborative effort with G. Ivanyos, the authors have continued to develop algorithms which were implemented in ELIAS by the second author. These activities are part of a bigger project, called ACELA and financed by STW, the Dutch Technology Foundation, which aims at an interactive book on Lie algebras (cf. Cohen and Meertens [2]. This paper gives a global description of the main ways in which to present Lie algebras on a computer. We focus on the transition from a Lie algebra abstractly given by an array of structure constants to a Lie algebra presented as a subalgebra of the Lie algebra of n×n matrices. We describe an algorithm typical of the structure analysis of a finite-dimensional Lie algebra: finding a Levi subalgebra of a Lie algebra.

  13. Variational linear algebraic equations method

    International Nuclear Information System (INIS)

    Moiseiwitsch, B.L.

    1982-01-01

    A modification of the linear algebraic equations method is described which ensures a variational bound on the phaseshifts for potentials having a definite sign at all points. The method is illustrated by the elastic scattering of s-wave electrons by the static field of atomic hydrogen. (author)

  14. Using Linear Algebra to Introduce Computer Algebra, Numerical Analysis, Data Structures and Algorithms (and To Teach Linear Algebra, Too).

    Science.gov (United States)

    Gonzalez-Vega, Laureano

    1999-01-01

    Using a Computer Algebra System (CAS) to help with the teaching of an elementary course in linear algebra can be one way to introduce computer algebra, numerical analysis, data structures, and algorithms. Highlights the advantages and disadvantages of this approach to the teaching of linear algebra. (Author/MM)

  15. Algebraic Methods in Plane Geometry

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 13; Issue 10. Algebraic Methods in ... General Article Volume 13 Issue 10 October 2008 pp 916-928 ... Keywords. Conics; family of curves; Pascal's theorem; homogeneous coordinates; Butterfly theorem; abelian group; associativity of addition; group law.

  16. Computer programs for nonlinear algebraic equations

    International Nuclear Information System (INIS)

    Asaoka, Takumi

    1977-10-01

    We have provided principal computer subroutines for obtaining numerical solutions of nonlinear algebraic equations through a review of the various methods. Benchmark tests were performed on these subroutines to grasp the characteristics of them compared to the existing subroutines. As computer programs based on the secant method, subroutines of the Muller's method using the Chambers' algorithm were newly developed, in addition to the equipment of subroutines of the Muller's method itself. The programs based on the Muller-Chambers' method are useful especially for low-order polynomials with complex coefficients except for the case of finding the triple roots, three close roots etc. In addition, we have equipped subroutines based on the Madsen's algorithm, a variant of the Newton's method. The subroutines have revealed themselves very useful as standard programs because all the roots are found accurately for every case though they take longer computing time than other subroutines for low-order polynomials. It is shown also that an existing subroutine of the Bairstow's method gives the fastest algorithm for polynomials with complex coefficients, except for the case of finding the triple roots etc. We have provided also subroutines to estimate error bounds for all the roots produced with the various algorithms. (auth.)

  17. Generalized Heisenberg algebra and algebraic method: The example of an infinite square-well potential

    International Nuclear Information System (INIS)

    Curado, E.M.F.; Hassouni, Y.; Rego-Monteiro, M.A.; Rodrigues, Ligia M.C.S.

    2008-01-01

    We discuss the role of generalized Heisenberg algebras (GHA) in obtaining an algebraic method to describe physical systems. The method consists in finding the GHA associated to a physical system and the relations between its generators and the physical observables. We choose as an example the infinite square-well potential for which we discuss the representations of the corresponding GHA. We suggest a way of constructing a physical realization of the generators of some GHA and apply it to the square-well potential. An expression for the position operator x in terms of the generators of the algebra is given and we compute its matrix elements

  18. Algebraic Verification Method for SEREs Properties via Groebner Bases Approaches

    Directory of Open Access Journals (Sweden)

    Ning Zhou

    2013-01-01

    Full Text Available This work presents an efficient solution using computer algebra system to perform linear temporal properties verification for synchronous digital systems. The method is essentially based on both Groebner bases approaches and symbolic simulation. A mechanism for constructing canonical polynomial set based symbolic representations for both circuit descriptions and assertions is studied. We then present a complete checking algorithm framework based on these algebraic representations by using Groebner bases. The computational experience result in this work shows that the algebraic approach is a quite competitive checking method and will be a useful supplement to the existent verification methods based on simulation.

  19. Computational algebraic geometry of epidemic models

    Science.gov (United States)

    Rodríguez Vega, Martín.

    2014-06-01

    Computational Algebraic Geometry is applied to the analysis of various epidemic models for Schistosomiasis and Dengue, both, for the case without control measures and for the case where control measures are applied. The models were analyzed using the mathematical software Maple. Explicitly the analysis is performed using Groebner basis, Hilbert dimension and Hilbert polynomials. These computational tools are included automatically in Maple. Each of these models is represented by a system of ordinary differential equations, and for each model the basic reproductive number (R0) is calculated. The effects of the control measures are observed by the changes in the algebraic structure of R0, the changes in Groebner basis, the changes in Hilbert dimension, and the changes in Hilbert polynomials. It is hoped that the results obtained in this paper become of importance for designing control measures against the epidemic diseases described. For future researches it is proposed the use of algebraic epidemiology to analyze models for airborne and waterborne diseases.

  20. Elementary Business Calculus with Computer Algebra.

    Science.gov (United States)

    Judson, Phoebe T.

    1990-01-01

    Described are various ways that a computer algebra system (MAPLE) was used to facilitate the resequencing of skills and applications within an elementary college-level business calculus course. Experimental results confirmed earlier findings that skills acquisition is not a prerequisite to conceptual understanding or problem-solving ability. (JJK)

  1. Algebraic Modeling of Topological and Computational Structures and Applications

    CERN Document Server

    Theodorou, Doros; Stefaneas, Petros; Kauffman, Louis

    2017-01-01

    This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups. The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a w...

  2. Multicore Performance of Block Algebraic Iterative Reconstruction Methods

    DEFF Research Database (Denmark)

    Sørensen, Hans Henrik B.; Hansen, Per Christian

    2014-01-01

    Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely on semiconv......Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely...... on semiconvergence. Block versions of these methods, based on a partitioning of the linear system, are able to combine the fast semiconvergence of ART with the better multicore properties of SIRT. These block methods separate into two classes: those that, in each iteration, access the blocks in a sequential manner...... a fixed relaxation parameter in each method, namely, the one that leads to the fastest semiconvergence. Computational results show that for multicore computers, the sequential approach is preferable....

  3. Computer algebra simulation - what can it do?; Was leistet Computer-Algebra-Simulation?

    Energy Technology Data Exchange (ETDEWEB)

    Braun, S. [Visual Analysis AG, Muenchen (Germany)

    2001-07-01

    Shortened development times require new and improved calculation methods. Numeric methods have long become state of the art. However, although numeric simulations provide a better understanding of process parameters, they do not give a feast overview of the interdependences between parameters. Numeric simulations are effective only if all physical parameters are sufficiently known; otherwise, the efficiency will decrease due to the large number of variant calculations required. Computer algebra simulation closes this gap and provides a deeper understanding of the physical fundamentals of technical processes. [German] Neue und verbesserte Berechnungsmethoden sind notwendig, um die staendige Verkuerzung der Entwicklungszyklen zu ermoeglichen. Herkoemmliche Methoden, die auf einem rein numerischen Ansatz basieren, haben sich in vielen Anwendungsbereichen laengst zum Standard entwickelt. Aber nicht nur die staendig kuerzer werdenden Entwicklungszyklen, sondern auch die weiterwachsende Komplexitaet machen es notwendig, ein besseres Verstaendnis der beteiligten Prozessparameter zu gewinnen. Die numerische Simulation besticht zwar durch Detailloesungen, selbst bei komplexen Strukturen und Prozessen, allerdings liefert sie keine schnelle Abschaetzung ueber die Zusammenhaenge zwischen den einzelnen Parametern. Die numerische Simulation ist nur dann effektiv, wenn alle physikalischen Parameter hinreichend bekannt sind; andernfalls sinkt die Effizienz durch die notwendige Anzahl von notwendigen Variantenrechnungen sehr stark. Die Computer-Algebra-Simulation schliesst diese Luecke in dem sie es erlaubt, sich einen tieferen Einblick in die physikalische Funktionsweise technischer Prozesse zu verschaffen. (orig.)

  4. Robust Algebraic Multilevel Methods and Algorithms

    CERN Document Server

    Kraus, Johannes

    2009-01-01

    This book deals with algorithms for the solution of linear systems of algebraic equations with large-scale sparse matrices, with a focus on problems that are obtained after discretization of partial differential equations using finite element methods. Provides a systematic presentation of the recent advances in robust algebraic multilevel methods. Can be used for advanced courses on the topic.

  5. Computer Algebra Recipes for Mathematical Physics

    CERN Document Server

    Enns, Richard H

    2005-01-01

    Over two hundred novel and innovative computer algebra worksheets or "recipes" will enable readers in engineering, physics, and mathematics to easily and rapidly solve and explore most problems they encounter in their mathematical physics studies. While the aim of this text is to illustrate applications, a brief synopsis of the fundamentals for each topic is presented, the topics being organized to correlate with those found in traditional mathematical physics texts. The recipes are presented in the form of stories and anecdotes, a pedagogical approach that makes a mathematically challenging subject easier and more fun to learn. Key features: * Uses the MAPLE computer algebra system to allow the reader to easily and quickly change the mathematical models and the parameters and then generate new answers * No prior knowledge of MAPLE is assumed; the relevant MAPLE commands are introduced on a need-to-know basis * All MAPLE commands are indexed for easy reference * A classroom-tested story/anecdote format is use...

  6. Algebra

    CERN Document Server

    Flanders, Harley

    1975-01-01

    Algebra presents the essentials of algebra with some applications. The emphasis is on practical skills, problem solving, and computational techniques. Topics covered range from equations and inequalities to functions and graphs, polynomial and rational functions, and exponentials and logarithms. Trigonometric functions and complex numbers are also considered, together with exponentials and logarithms.Comprised of eight chapters, this book begins with a discussion on the fundamentals of algebra, each topic explained, illustrated, and accompanied by an ample set of exercises. The proper use of a

  7. Monomial algebras

    CERN Document Server

    Villarreal, Rafael

    2015-01-01

    The book stresses the interplay between several areas of pure and applied mathematics, emphasizing the central role of monomial algebras. It unifies the classical results of commutative algebra with central results and notions from graph theory, combinatorics, linear algebra, integer programming, and combinatorial optimization. The book introduces various methods to study monomial algebras and their presentation ideals, including Stanley-Reisner rings, subrings and blowup algebra-emphasizing square free quadratics, hypergraph clutters, and effective computational methods.

  8. Clifford algebras, noncommutative tori and universal quantum computers

    OpenAIRE

    Vlasov, Alexander Yu.

    2001-01-01

    Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary base. The non-binary case is related with application of some extension of idea of Clifford algebras. It is noncommutative torus defined by polynomial algebraic relations of order l. For l=2 it coincides with definition of Clifford algebra. Here is presente...

  9. Algebraic methods in system theory

    Science.gov (United States)

    Brockett, R. W.; Willems, J. C.; Willsky, A. S.

    1975-01-01

    Investigations on problems of the type which arise in the control of switched electrical networks are reported. The main results concern the algebraic structure and stochastic aspects of these systems. Future reports will contain more detailed applications of these results to engineering studies.

  10. Ideals, varieties, and algorithms an introduction to computational algebraic geometry and commutative algebra

    CERN Document Server

    Cox, David A; O'Shea, Donal

    2015-01-01

    This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry—the elimination theorem, the extension theorem, the closure theorem, and the Nullstellensatz—this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D). The book may serve as a first or second course in undergraduate abstract algebra and, with some supplementation perhaps, for beginning graduate level courses in algebraic geom...

  11. Algebraic computability and enumeration models recursion theory and descriptive complexity

    CERN Document Server

    Nourani, Cyrus F

    2016-01-01

    This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic type...

  12. On one method of realization of commutation relation algebra

    International Nuclear Information System (INIS)

    Sveshnikov, K.A.

    1983-01-01

    Method for constructing the commulation relation representations based on the purely algebraic construction of joined algebraic representation with specially selected composition law has been suggested9 Purely combinatorial construction realizing commulation relations representation has been obtained proceeding from formal equivalence of operatopr action on vector and adding a simbol to a sequences of symbols. The above method practically has the structure of calculating algorithm, which assigns some rule of ''word'' formation of an initial set of ''letters''. In other words, a computer language with definite relations between words (an analogy between quantum mechanics and computer linguistics has been applied)

  13. Application of Computer Algebra Systems to the Construction of the Collocations and Least Residuals Method for Solving the 3D Navier–Stokes Equations

    Directory of Open Access Journals (Sweden)

    V. P. Shapeev

    2014-01-01

    Full Text Available The method of collocations and least residuals (CLR, which was proposed previously for the numerical solution of two-dimensional Navier–Stokes equations governing the stationary flows of a viscous incompressible fluid, is extended here for the three-dimensional case. The solution is sought in the implemented version of the method in the form of an expansion in the basis solenoidal functions. At all stages of the CLR method construction, a computer algebra system (CAS is applied for the derivation and verification of the formulas of the method and for their translation into arithmetic operators of the Fortran language. For accelerating the convergence of iterations a sufficiently universal algorithm is proposed, which is simple in its implementation and is based on the use of the Krylov’s subspaces. The obtained computational formulas of the CLR method were verified on the exact analytic solution of a test problem. Comparisons with the published numerical results of solving the benchmark problem of the 3D driven cubic cavity flow show that the accuracy of the results obtained by the CLR method corresponds to the known high-accuracy solutions.

  14. Algebraic Methods in Plane Geometry

    Indian Academy of Sciences (India)

    Srimath

    rally, a1 ;a2 ;a3 ;a4 m ust not all be 0.) If w e m ultiply all th e ai's by a non-zero constant w e get the sam e cubic. .... B ut a sm all m odi¯cation of the operation changes the ..... Robert Bix, Conics and Cubics: A Concrete Introduction to Algebraic ... Joseph H Silverman and John Torrence Tate, Rational Points on Elliptic.

  15. Algorithmic and experimental methods in algebra, geometry, and number theory

    CERN Document Server

    Decker, Wolfram; Malle, Gunter

    2017-01-01

    This book presents state-of-the-art research and survey articles that highlight work done within the Priority Program SPP 1489 “Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory”, which was established and generously supported by the German Research Foundation (DFG) from 2010 to 2016. The goal of the program was to substantially advance algorithmic and experimental methods in the aforementioned disciplines, to combine the different methods where necessary, and to apply them to central questions in theory and practice. Of particular concern was the further development of freely available open source computer algebra systems and their interaction in order to create powerful new computational tools that transcend the boundaries of the individual disciplines involved.  The book covers a broad range of topics addressing the design and theoretical foundations, implementation and the successful application of algebraic algorithms in order to solve mathematical research problems. It off...

  16. Commutative algebra constructive methods finite projective modules

    CERN Document Server

    Lombardi, Henri

    2015-01-01

    Translated from the popular French edition, this book offers a detailed introduction to various basic concepts, methods, principles, and results of commutative algebra. It takes a constructive viewpoint in commutative algebra and studies algorithmic approaches alongside several abstract classical theories. Indeed, it revisits these traditional topics with a new and simplifying manner, making the subject both accessible and innovative. The algorithmic aspects of such naturally abstract topics as Galois theory, Dedekind rings, Prüfer rings, finitely generated projective modules, dimension theory of commutative rings, and others in the current treatise, are all analysed in the spirit of the great developers of constructive algebra in the nineteenth century. This updated and revised edition contains over 350 well-arranged exercises, together with their helpful hints for solution. A basic knowledge of linear algebra, group theory, elementary number theory as well as the fundamentals of ring and module theory is r...

  17. A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry

    Science.gov (United States)

    Kalainoff, Melinda; Lachance, Russ; Riegner, Dawn; Biaglow, Andrew

    2012-01-01

    In this article, we report on a semester-long study of the incorporation into our general chemistry course, of advanced algebraic and computer algebra techniques for solving chemical equilibrium problems. The method presented here is an alternative to the commonly used concentration table method for describing chemical equilibria in general…

  18. Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

    DEFF Research Database (Denmark)

    Lauritzen, Niels

    2005-01-01

    We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.......We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge....

  19. Exact solution of some linear matrix equations using algebraic methods

    Science.gov (United States)

    Djaferis, T. E.; Mitter, S. K.

    1977-01-01

    A study is done of solution methods for Linear Matrix Equations including Lyapunov's equation, using methods of modern algebra. The emphasis is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The action f sub BA is introduced a Basic Lemma is proven. The equation PA + BP = -C as well as the Lyapunov equation are analyzed. Algorithms are given for the solution of the Lyapunov and comment is given on its arithmetic complexity. The equation P - A'PA = Q is studied and numerical examples are given.

  20. A Comparison of Success and Failure Rates between Computer-Assisted and Traditional College Algebra Sections

    Science.gov (United States)

    Herron, Sherry; Gandy, Rex; Ye, Ningjun; Syed, Nasser

    2012-01-01

    A unique aspect of the implementation of a computer algebra system (CAS) at a comprehensive university in the U.S. allowed us to compare the student success and failure rates to the traditional method of teaching college algebra. Due to space limitations, the university offered sections of both CAS and traditional simultaneously and, upon…

  1. Methods of algebraic geometry in control theory

    CERN Document Server

    Falb, Peter

    1999-01-01

    "Control theory represents an attempt to codify, in mathematical terms, the principles and techniques used in the analysis and design of control systems. Algebraic geometry may, in an elementary way, be viewed as the study of the structure and properties of the solutions of systems of algebraic equations. The aim of this book is to provide access to the methods of algebraic geometry for engineers and applied scientists through the motivated context of control theory" .* The development which culminated with this volume began over twenty-five years ago with a series of lectures at the control group of the Lund Institute of Technology in Sweden. I have sought throughout to strive for clarity, often using constructive methods and giving several proofs of a particular result as well as many examples. The first volume dealt with the simplest control systems (i.e., single input, single output linear time-invariant systems) and with the simplest algebraic geometry (i.e., affine algebraic geometry). While this is qui...

  2. Computational commutative and non-commutative algebraic geometry

    CERN Document Server

    Cojocaru, S; Ufnarovski, V

    2005-01-01

    This publication gives a good insight in the interplay between commutative and non-commutative algebraic geometry. The theoretical and computational aspects are the central theme in this study. The topic is looked at from different perspectives in over 20 lecture reports. It emphasizes the current trends in commutative and non-commutative algebraic geometry and algebra. The contributors to this publication present the most recent and state-of-the-art progresses which reflect the topic discussed in this publication. Both researchers and graduate students will find this book a good source of information on commutative and non-commutative algebraic geometry.

  3. ASYS: a computer algebra package for analysis of nonlinear algebraic equations systems

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Khutornoj, N.V.

    1992-01-01

    A program package ASYS for analysis of nonlinear algebraic equations based on the Groebner basis technique is described. The package is written in REDUCE computer algebra language. It has special facilities to treat polynomial ideals of positive dimension, corresponding to algebraic systems with infinitely many solutions. Such systems can be transformed to an equivalent set of subsystems with reduced number of variables in completely automatic way. It often allows to construct the explicit form of a solution set in many problems of practical importance. Some examples and results of comparison with the standard Reduce package GROEBNER and special-purpose systems FELIX and A1PI are given. 21 refs.; 2 tabs

  4. An algebraic substructuring using multiple shifts for eigenvalue computations

    International Nuclear Information System (INIS)

    Ko, Jin Hwan; Jung, Sung Nam; Byun, Do Young; Bai, Zhaojun

    2008-01-01

    Algebraic substructuring (AS) is a state-of-the-art method in eigenvalue computations, especially for large-sized problems, but originally it was designed to calculate only the smallest eigenvalues. Recently, an updated version of AS has been introduced to calculate the interior eigenvalues over a specified range by using a shift concept that is referred to as the shifted AS. In this work, we propose a combined method of both AS and the shifted AS by using multiple shifts for solving a considerable number of eigensolutions in a large-sized problem, which is an emerging computational issue of noise or vibration analysis in vehicle design. In addition, we investigated the accuracy of the shifted AS by presenting an error criterion. The proposed method has been applied to the FE model of an automobile body. The combined method yielded a higher efficiency without loss of accuracy in comparison to the original AS

  5. Multilinear Computing and Multilinear Algebraic Geometry

    Science.gov (United States)

    2016-08-10

    algebra : linear systems, least squares, eigevalue problems, singular value problems, determinant evaluation, low-rank approximations, etc — problems...intractability to move beyond linear algebra , substantiating what the PI had proposed. High-resolution MRI with tensors: In another piece of work... applications . One reason is that we found out that many statistical estimation problems ( linear regression, errors-in-variables regression, principal components

  6. Computer algebra as a research tool in physics

    International Nuclear Information System (INIS)

    Drouffe, J.M.

    1985-04-01

    The progress of computer algebra observed during these last years has had certainly an impact in physics. I want to precise the role of these new techniques in this application domain and to analyze their present limitations. In Section 1, I describe briefly the use of algebraic manipulation programs at the elementary level. The numerical and symbolic solutions of problems are compared in Section 2. Section 3 is devoted to a prospective about the use of computer algebra at the highest level, as an ''intelligent'' system. I recall in Section 4 what is required from a system to be used in physics

  7. Using CAMAL for algebraic computations in general relativity

    International Nuclear Information System (INIS)

    Fitch, J.P.

    1979-01-01

    CAMAL is a collection of computer algebra systems developed in Cambridge, England for use mainly in theoretical physics. One of these was designed originally for general relativity calculations, although it is often used in other fields. In a recent paper Cohen, Leringe, and Sundblad compared six systems for algebraic computations applied to general relativity available in Stockholm. Here similar information for CAMAL is given and by using the same tests CAMAL is added to the comparison. (author)

  8. Category-theoretic models of algebraic computer systems

    Science.gov (United States)

    Kovalyov, S. P.

    2016-01-01

    A computer system is said to be algebraic if it contains nodes that implement unconventional computation paradigms based on universal algebra. A category-based approach to modeling such systems that provides a theoretical basis for mapping tasks to these systems' architecture is proposed. The construction of algebraic models of general-purpose computations involving conditional statements and overflow control is formally described by a reflector in an appropriate category of algebras. It is proved that this reflector takes the modulo ring whose operations are implemented in the conventional arithmetic processors to the Łukasiewicz logic matrix. Enrichments of the set of ring operations that form bases in the Łukasiewicz logic matrix are found.

  9. Titration Calculations with Computer Algebra Software

    Science.gov (United States)

    Lachance, Russ; Biaglow, Andrew

    2012-01-01

    This article examines the symbolic algebraic solution of the titration equations for a diprotic acid, as obtained using "Mathematica," "Maple," and "Mathcad." The equilibrium and conservation equations are solved symbolically by the programs to eliminate the approximations that normally would be performed by the student. Of the three programs,…

  10. Homological methods, representation theory, and cluster algebras

    CERN Document Server

    Trepode, Sonia

    2018-01-01

    This text presents six mini-courses, all devoted to interactions between representation theory of algebras, homological algebra, and the new ever-expanding theory of cluster algebras. The interplay between the topics discussed in this text will continue to grow and this collection of courses stands as a partial testimony to this new development. The courses are useful for any mathematician who would like to learn more about this rapidly developing field; the primary aim is to engage graduate students and young researchers. Prerequisites include knowledge of some noncommutative algebra or homological algebra. Homological algebra has always been considered as one of the main tools in the study of finite-dimensional algebras. The strong relationship with cluster algebras is more recent and has quickly established itself as one of the important highlights of today’s mathematical landscape. This connection has been fruitful to both areas—representation theory provides a categorification of cluster algebras, wh...

  11. Algebraic and computational aspects of real tensor ranks

    CERN Document Server

    Sakata, Toshio; Miyazaki, Mitsuhiro

    2016-01-01

    This book provides comprehensive summaries of theoretical (algebraic) and computational aspects of tensor ranks, maximal ranks, and typical ranks, over the real number field. Although tensor ranks have been often argued in the complex number field, it should be emphasized that this book treats real tensor ranks, which have direct applications in statistics. The book provides several interesting ideas, including determinant polynomials, determinantal ideals, absolutely nonsingular tensors, absolutely full column rank tensors, and their connection to bilinear maps and Hurwitz-Radon numbers. In addition to reviews of methods to determine real tensor ranks in details, global theories such as the Jacobian method are also reviewed in details. The book includes as well an accessible and comprehensive introduction of mathematical backgrounds, with basics of positive polynomials and calculations by using the Groebner basis. Furthermore, this book provides insights into numerical methods of finding tensor ranks through...

  12. Scattering Amplitudes via Algebraic Geometry Methods

    CERN Document Server

    Søgaard, Mads; Damgaard, Poul Henrik

    This thesis describes recent progress in the understanding of the mathematical structure of scattering amplitudes in quantum field theory. The primary purpose is to develop an enhanced analytic framework for computing multiloop scattering amplitudes in generic gauge theories including QCD without Feynman diagrams. The study of multiloop scattering amplitudes is crucial for the new era of precision phenomenology at the Large Hadron Collider (LHC) at CERN. Loop-level scattering amplitudes can be reduced to a basis of linearly independent integrals whose coefficients are extracted from generalized unitarity cuts. We take advantage of principles from algebraic geometry in order to extend the notion of maximal cuts to a large class of two- and three-loop integrals. This allows us to derive unique and surprisingly compact formulae for the coefficients of the basis integrals. Our results are expressed in terms of certain linear combinations of multivariate residues and elliptic integrals computed from products of ...

  13. Numerical Methods for a Class of Differential Algebraic Equations

    Directory of Open Access Journals (Sweden)

    Lei Ren

    2017-01-01

    Full Text Available This paper is devoted to the study of some efficient numerical methods for the differential algebraic equations (DAEs. At first, we propose a finite algorithm to compute the Drazin inverse of the time varying DAEs. Numerical experiments are presented by Drazin inverse and Radau IIA method, which illustrate that the precision of the Drazin inverse method is higher than the Radau IIA method. Then, Drazin inverse, Radau IIA, and Padé approximation are applied to the constant coefficient DAEs, respectively. Numerical results demonstrate that the Padé approximation is powerful for solving constant coefficient DAEs.

  14. The algebraic manipulation program DIRAC on IBM personal computers

    International Nuclear Information System (INIS)

    Grozin, A.G.; Perlt, H.

    1989-01-01

    The version DIRAC (2.2) for IBM compatible personal computers is described. It is designed to manipulate algebraically with polynomials and tensors. After a short introduction concerning implementation and usage on personal computers an example program is given. It contains a detailed user's guide to DIRAC (2.2) and, additionally some useful applications. 4 refs

  15. SD-CAS: Spin Dynamics by Computer Algebra System.

    Science.gov (United States)

    Filip, Xenia; Filip, Claudiu

    2010-11-01

    A computer algebra tool for describing the Liouville-space quantum evolution of nuclear 1/2-spins is introduced and implemented within a computational framework named Spin Dynamics by Computer Algebra System (SD-CAS). A distinctive feature compared with numerical and previous computer algebra approaches to solving spin dynamics problems results from the fact that no matrix representation for spin operators is used in SD-CAS, which determines a full symbolic character to the performed computations. Spin correlations are stored in SD-CAS as four-entry nested lists of which size increases linearly with the number of spins into the system and are easily mapped into analytical expressions in terms of spin operator products. For the so defined SD-CAS spin correlations a set of specialized functions and procedures is introduced that are essential for implementing basic spin algebra operations, such as the spin operator products, commutators, and scalar products. They provide results in an abstract algebraic form: specific procedures to quantitatively evaluate such symbolic expressions with respect to the involved spin interaction parameters and experimental conditions are also discussed. Although the main focus in the present work is on laying the foundation for spin dynamics symbolic computation in NMR based on a non-matrix formalism, practical aspects are also considered throughout the theoretical development process. In particular, specific SD-CAS routines have been implemented using the YACAS computer algebra package (http://yacas.sourceforge.net), and their functionality was demonstrated on a few illustrative examples. Copyright © 2010 Elsevier Inc. All rights reserved.

  16. Singularities and computer algebra festschrift for Gert-Martin Greuel on the occasion of his 70th birthday

    CERN Document Server

    Pfister, Gerhard; Schulze, Mathias

    2017-01-01

    This book arose from a conference on “Singularities and Computer Algebra” which was held at the Pfalz-Akademie Lambrecht in June 2015 in honor of Gert-Martin Greuel’s 70th birthday. This unique volume presents a collection of recent original research by some of the leading figures in singularity theory on a broad range of topics including topological and algebraic aspects, classification problems, deformation theory and resolution of singularities. At the same time, the articles highlight a variety of techniques, ranging from theoretical methods to practical tools from computer algebra. Greuel himself made major contributions to the development of both singularity theory and computer algebra. With Gerhard Pfister and Hans Schönemann, he developed the computer algebra system SINGULAR, which has since become the computational tool of choice for many singularity theorists. The book addresses researchers whose work involves singularity theory and computer algebra from the PhD to expert level.

  17. Computer-Aided College Algebra: Learning Components that Students Find Beneficial

    Science.gov (United States)

    Aichele, Douglas B.; Francisco, Cynthia; Utley, Juliana; Wescoatt, Benjamin

    2011-01-01

    A mixed-method study was conducted during the Fall 2008 semester to better understand the experiences of students participating in computer-aided instruction of College Algebra using the software MyMathLab. The learning environment included a computer learning system for the majority of the instruction, a support system via focus groups (weekly…

  18. q-Derivatives, quantization methods and q-algebras

    International Nuclear Information System (INIS)

    Twarock, Reidun

    1998-01-01

    Using the example of Borel quantization on S 1 , we discuss the relation between quantization methods and q-algebras. In particular, it is shown that a q-deformation of the Witt algebra with generators labeled by Z is realized by q-difference operators. This leads to a discrete quantum mechanics. Because of Z, the discretization is equidistant. As an approach to a non-equidistant discretization of quantum mechanics one can change the Witt algebra using not the number field Z as labels but a quadratic extension of Z characterized by an irrational number τ. This extension is denoted as quasi-crystal Lie algebra, because this is a relation to one-dimensional quasicrystals. The q-deformation of this quasicrystal Lie algebra is discussed. It is pointed out that quasicrystal Lie algebras can be considered also as a 'deformed' Witt algebra with a 'deformation' of the labeling number field. Their application to the theory is discussed

  19. IV International Conference on Computer Algebra in Physical Research. Collection of abstracts

    International Nuclear Information System (INIS)

    Rostovtsev, V.A.

    1990-01-01

    The abstracts of the reports made on IV International conference on computer algebra in physical research are presented. The capabilities of application of computers for algebraic computations in high energy physics and quantum field theory are discussed. Particular attention is paid to a software for the REDUCE computer algebra system

  20. Layout optimization with algebraic multigrid methods

    Science.gov (United States)

    Regler, Hans; Ruede, Ulrich

    1993-01-01

    Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.

  1. Logic and algebraic structures in quantum computing

    CERN Document Server

    Eskandarian, Ali; Harizanov, Valentina S

    2016-01-01

    Arising from a special session held at the 2010 North American Annual Meeting of the Association for Symbolic Logic, this volume is an international cross-disciplinary collaboration with contributions from leading experts exploring connections across their respective fields. Themes range from philosophical examination of the foundations of physics and quantum logic, to exploitations of the methods and structures of operator theory, category theory, and knot theory in an effort to gain insight into the fundamental questions in quantum theory and logic. The book will appeal to researchers and students working in related fields, including logicians, mathematicians, computer scientists, and physicists. A brief introduction provides essential background on quantum mechanics and category theory, which, together with a thematic selection of articles, may also serve as the basic material for a graduate course or seminar.

  2. Algebraic Functions, Computer Programming, and the Challenge of Transfer

    Science.gov (United States)

    Schanzer, Emmanuel Tanenbaum

    2015-01-01

    Students' struggles with algebra are well documented. Prior to the introduction of functions, mathematics is typically focused on applying a set of arithmetic operations to compute an answer. The introduction of functions, however, marks the point at which mathematics begins to focus on building up abstractions as a way to solve complex problems.…

  3. Using Computer Symbolic Algebra to Solve Differential Equations.

    Science.gov (United States)

    Mathews, John H.

    1989-01-01

    This article illustrates that mathematical theory can be incorporated into the process to solve differential equations by a computer algebra system, muMATH. After an introduction to functions of muMATH, several short programs for enhancing the capabilities of the system are discussed. Listed are six references. (YP)

  4. Computing with impure numbers - Automatic consistency checking and units conversion using computer algebra

    Science.gov (United States)

    Stoutemyer, D. R.

    1977-01-01

    The computer algebra language MACSYMA enables the programmer to include symbolic physical units in computer calculations, and features automatic detection of dimensionally-inhomogeneous formulas and conversion of inconsistent units in a dimensionally homogeneous formula. Some examples illustrate these features.

  5. Formalization and Implementation of Algebraic Methods in Geometry

    Directory of Open Access Journals (Sweden)

    Filip Marić

    2012-02-01

    Full Text Available We describe our ongoing project of formalization of algebraic methods for geometry theorem proving (Wu's method and the Groebner bases method, their implementation and integration in educational tools. The project includes formal verification of the algebraic methods within Isabelle/HOL proof assistant and development of a new, open-source Java implementation of the algebraic methods. The project should fill-in some gaps still existing in this area (e.g., the lack of formal links between algebraic methods and synthetic geometry and the lack of self-contained implementations of algebraic methods suitable for integration with dynamic geometry tools and should enable new applications of theorem proving in education.

  6. Mathematical methods linear algebra normed spaces distributions integration

    CERN Document Server

    Korevaar, Jacob

    1968-01-01

    Mathematical Methods, Volume I: Linear Algebra, Normed Spaces, Distributions, Integration focuses on advanced mathematical tools used in applications and the basic concepts of algebra, normed spaces, integration, and distributions.The publication first offers information on algebraic theory of vector spaces and introduction to functional analysis. Discussions focus on linear transformations and functionals, rectangular matrices, systems of linear equations, eigenvalue problems, use of eigenvectors and generalized eigenvectors in the representation of linear operators, metric and normed vector

  7. Algebra

    CERN Document Server

    Tabak, John

    2004-01-01

    Looking closely at algebra, its historical development, and its many useful applications, Algebra examines in detail the question of why this type of math is so important that it arose in different cultures at different times. The book also discusses the relationship between algebra and geometry, shows the progress of thought throughout the centuries, and offers biographical data on the key figures. Concise and comprehensive text accompanied by many illustrations presents the ideas and historical development of algebra, showcasing the relevance and evolution of this branch of mathematics.

  8. Study on time of flight property of electron optical systems by differential algebraic method

    International Nuclear Information System (INIS)

    Cheng Min; Tang Tiantong; Yao Zhenhua

    2002-01-01

    Differential algebraic method is a powerful and promising technique in computer numerical analysis. When applied to nonlinear dynamics systems, the arbitrary high-order transfer properties of the systems can be computed directly with high precision. In this paper, the principle of differential algebra is applied to study on the time of flight (TOF) property of electron optical systems and their arbitrary order TOF transfer properties can be numerically calculated out. As an example, TOF transfer properties of a uniform magnetic sector field analyzer have been studied by differential algebraic method. Relative errors of the first-order and second-order TOF transfer coefficients of the magnetic sector field analyzer are of the order 10 -11 or smaller compared with the analytic solutions. It is proved that differential algebraic TOF method is of high accuracy and very helpful for high-order TOF transfer property analysis of electron optical systems. (author)

  9. Algebraic computing program for studying the gauge theory

    International Nuclear Information System (INIS)

    Zet, G.

    2005-01-01

    An algebraic computing program running on Maple V platform is presented. The program is devoted to the study of the gauge theory with an internal Lie group as local symmetry. The physical quantities (gauge potentials, strength tensors, dual tensors etc.) are introduced either as equations in terms of previous defined quantities (tensors), or by manual entry of the component values. The components of the strength tensor and of its dual are obtained with respect to a given metric of the space-time used for describing the gauge theory. We choose a Minkowski space-time endowed with spherical symmetry and give some example of algebraic computing that are adequate for studying electroweak or gravitational interactions. The field equations are also obtained and their solutions are determined using the DEtools facilities of the Maple V computing program. (author)

  10. Continuous analog of multiplicative algebraic reconstruction technique for computed tomography

    Science.gov (United States)

    Tateishi, Kiyoko; Yamaguchi, Yusaku; Abou Al-Ola, Omar M.; Kojima, Takeshi; Yoshinaga, Tetsuya

    2016-03-01

    We propose a hybrid dynamical system as a continuous analog to the block-iterative multiplicative algebraic reconstruction technique (BI-MART), which is a well-known iterative image reconstruction algorithm for computed tomography. The hybrid system is described by a switched nonlinear system with a piecewise smooth vector field or differential equation and, for consistent inverse problems, the convergence of non-negatively constrained solutions to a globally stable equilibrium is guaranteed by the Lyapunov theorem. Namely, we can prove theoretically that a weighted Kullback-Leibler divergence measure can be a common Lyapunov function for the switched system. We show that discretizing the differential equation by using the first-order approximation (Euler's method) based on the geometric multiplicative calculus leads to the same iterative formula of the BI-MART with the scaling parameter as a time-step of numerical discretization. The present paper is the first to reveal that a kind of iterative image reconstruction algorithm is constructed by the discretization of a continuous-time dynamical system for solving tomographic inverse problems. Iterative algorithms with not only the Euler method but also the Runge-Kutta methods of lower-orders applied for discretizing the continuous-time system can be used for image reconstruction. A numerical example showing the characteristics of the discretized iterative methods is presented.

  11. CENTER CONDITIONS AND CYCLICITY FOR A FAMILY OF CUBIC SYSTEMS: COMPUTER ALGEBRA APPROACH.

    Science.gov (United States)

    Ferčec, Brigita; Mahdi, Adam

    2013-01-01

    Using methods of computational algebra we obtain an upper bound for the cyclicity of a family of cubic systems. We overcame the problem of nonradicality of the associated Bautin ideal by moving from the ring of polynomials to a coordinate ring. Finally, we determine the number of limit cycles bifurcating from each component of the center variety.

  12. Exploring Students' Understanding of Ordinary Differential Equations Using Computer Algebraic System (CAS)

    Science.gov (United States)

    Maat, Siti Mistima; Zakaria, Effandi

    2011-01-01

    Ordinary differential equations (ODEs) are one of the important topics in engineering mathematics that lead to the understanding of technical concepts among students. This study was conducted to explore the students' understanding of ODEs when they solve ODE questions using a traditional method as well as a computer algebraic system, particularly…

  13. Solution of the Schrodinger Equation for a Diatomic Oscillator Using Linear Algebra: An Undergraduate Computational Experiment

    Science.gov (United States)

    Gasyna, Zbigniew L.

    2008-01-01

    Computational experiment is proposed in which a linear algebra method is applied to the solution of the Schrodinger equation for a diatomic oscillator. Calculations of the vibration-rotation spectrum for the HCl molecule are presented and the results show excellent agreement with experimental data. (Contains 1 table and 1 figure.)

  14. Image reconstruction of computed tomograms using functional algebra

    International Nuclear Information System (INIS)

    Bradaczek, M.; Bradaczek, H.

    1997-01-01

    A detailed presentation of the process for calculating computed tomograms from the measured data by means of functional algebra is given and an attempt is made to demonstrate the relationships to those inexperienced in mathematics. Suggestions are also made to the manufacturers for improving tomography software although the authors cannot exclude the possibility that some of the recommendations may have already been realized. An interpolation in Fourier space to right-angled coordinates was not employed so that additional computer time and errors resulting from the interpolation are avoided. The savings in calculation time can only be estimated but should amount to about 25%. The error-correction calculation is merely a suggestion since it depends considerably on the apparatus used. Functional algebra is introduced here because it is not so well known but does provide appreciable simplifications in comparison to an explicit presentation. Didactic reasons as well as the possibility for reducing calculation time provided the foundation for this work. (orig.) [de

  15. Linking Computer Algebra Systems and Paper-and-Pencil Techniques To Support the Teaching of Mathematics.

    Science.gov (United States)

    van Herwaarden, Onno A.; Gielen, Joseph L. W.

    2002-01-01

    Focuses on students showing a lack of conceptual insight while using computer algebra systems (CAS) in the setting of an elementary calculus and linear algebra course for first year university students in social sciences. The use of a computer algebra environment has been incorporated into a more traditional course but with special attention on…

  16. Prime factorization using quantum annealing and computational algebraic geometry

    Science.gov (United States)

    Dridi, Raouf; Alghassi, Hedayat

    2017-02-01

    We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used to reduce the degree of Hamiltonians.

  17. Prime factorization using quantum annealing and computational algebraic geometry

    OpenAIRE

    Dridi, Raouf; Alghassi, Hedayat

    2017-01-01

    We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr?bner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gr?bner bases can be used to reduce the degree of Hamiltonians.

  18. The combinatorics computation for Casimir operators of the symplectic Lie algebra and the application for determining the center of the enveloping algebra of a semidirect product

    International Nuclear Information System (INIS)

    Le Van Hop.

    1989-12-01

    The combinatorics computation is used to describe the Casimir operators of the symplectic Lie Algebra. This result is applied for determining the Center of the enveloping Algebra of the semidirect Product of the Heisenberg Lie Algebra and the symplectic Lie Algebra. (author). 10 refs

  19. Proton computed tomography images with algebraic reconstruction

    Energy Technology Data Exchange (ETDEWEB)

    Bruzzi, M. [Physics and Astronomy Department, University of Florence, Florence (Italy); Civinini, C.; Scaringella, M. [INFN - Florence Division, Florence (Italy); Bonanno, D. [INFN - Catania Division, Catania (Italy); Brianzi, M. [INFN - Florence Division, Florence (Italy); Carpinelli, M. [INFN - Laboratori Nazionali del Sud, Catania (Italy); Chemistry and Pharmacy Department, University of Sassari, Sassari (Italy); Cirrone, G.A.P.; Cuttone, G. [INFN - Laboratori Nazionali del Sud, Catania (Italy); Presti, D. Lo [INFN - Catania Division, Catania (Italy); Physics and Astronomy Department, University of Catania, Catania (Italy); Maccioni, G. [INFN – Cagliari Division, Cagliari (Italy); Pallotta, S. [INFN - Florence Division, Florence (Italy); Department of Biomedical, Experimental and Clinical Sciences, University of Florence, Florence (Italy); SOD Fisica Medica, Azienda Ospedaliero-Universitaria Careggi, Firenze (Italy); Randazzo, N. [INFN - Catania Division, Catania (Italy); Romano, F. [INFN - Laboratori Nazionali del Sud, Catania (Italy); Sipala, V. [INFN - Laboratori Nazionali del Sud, Catania (Italy); Chemistry and Pharmacy Department, University of Sassari, Sassari (Italy); Talamonti, C. [INFN - Florence Division, Florence (Italy); Department of Biomedical, Experimental and Clinical Sciences, University of Florence, Florence (Italy); SOD Fisica Medica, Azienda Ospedaliero-Universitaria Careggi, Firenze (Italy); Vanzi, E. [Fisica Sanitaria, Azienda Ospedaliero-Universitaria Senese, Siena (Italy)

    2017-02-11

    A prototype of proton Computed Tomography (pCT) system for hadron-therapy has been manufactured and tested in a 175 MeV proton beam with a non-homogeneous phantom designed to simulate high-contrast material. BI-SART reconstruction algorithms have been implemented with GPU parallelism, taking into account of most likely paths of protons in matter. Reconstructed tomography images with density resolutions r.m.s. down to ~1% and spatial resolutions <1 mm, achieved within processing times of ~15′ for a 512×512 pixels image prove that this technique will be beneficial if used instead of X-CT in hadron-therapy.

  20. On Numerical Stability in Large Scale Linear Algebraic Computations

    Czech Academy of Sciences Publication Activity Database

    Strakoš, Zdeněk; Liesen, J.

    2005-01-01

    Roč. 85, č. 5 (2005), s. 307-325 ISSN 0044-2267 R&D Projects: GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : linear algebraic systems * eigenvalue problems * convergence * numerical stability * backward error * accuracy * Lanczos method * conjugate gradient method * GMRES method Subject RIV: BA - General Mathematics Impact factor: 0.351, year: 2005

  1. Analytical SN solutions in heterogeneous slabs using symbolic algebra computer programs

    International Nuclear Information System (INIS)

    Warsa, J.S.

    2002-01-01

    A modern symbolic algebra computer program, MAPLE, is used to compute solutions to the well-known analytical discrete ordinates, or S N , solutions in one-dimensional, slab geometry. Symbolic algebra programs compute the solutions with arbitrary precision and are free of spatial discretization error so they can be used to investigate new discretizations for one-dimensional slab, geometry S N methods. Pointwise scalar flux solutions are computed for several sample calculations of interest. Sample MAPLE command scripts are provided to illustrate how easily the theory can be translated into a working solution and serve as a complete tool capable of computing analytical S N solutions for mono-energetic, one-dimensional transport problems

  2. Building a symbolic computer algebra toolbox to compute 2D Fourier transforms in polar coordinates.

    Science.gov (United States)

    Dovlo, Edem; Baddour, Natalie

    2015-01-01

    The development of a symbolic computer algebra toolbox for the computation of two dimensional (2D) Fourier transforms in polar coordinates is presented. Multidimensional Fourier transforms are widely used in image processing, tomographic reconstructions and in fact any application that requires a multidimensional convolution. By examining a function in the frequency domain, additional information and insights may be obtained. The advantages of our method include: •The implementation of the 2D Fourier transform in polar coordinates within the toolbox via the combination of two significantly simpler transforms.•The modular approach along with the idea of lookup tables implemented help avoid the issue of indeterminate results which may occur when attempting to directly evaluate the transform.•The concept also helps prevent unnecessary computation of already known transforms thereby saving memory and processing time.

  3. Linear Algebraic Method for Non-Linear Map Analysis

    International Nuclear Information System (INIS)

    Yu, L.; Nash, B.

    2009-01-01

    We present a newly developed method to analyze some non-linear dynamics problems such as the Henon map using a matrix analysis method from linear algebra. Choosing the Henon map as an example, we analyze the spectral structure, the tune-amplitude dependence, the variation of tune and amplitude during the particle motion, etc., using the method of Jordan decomposition which is widely used in conventional linear algebra.

  4. Developing ontological model of computational linear algebra - preliminary considerations

    Science.gov (United States)

    Wasielewska, K.; Ganzha, M.; Paprzycki, M.; Lirkov, I.

    2013-10-01

    The aim of this paper is to propose a method for application of ontologically represented domain knowledge to support Grid users. The work is presented in the context provided by the Agents in Grid system, which aims at development of an agent-semantic infrastructure for efficient resource management in the Grid. Decision support within the system should provide functionality beyond the existing Grid middleware, specifically, help the user to choose optimal algorithm and/or resource to solve a problem from a given domain. The system assists the user in at least two situations. First, for users without in-depth knowledge about the domain, it should help them to select the method and the resource that (together) would best fit the problem to be solved (and match the available resources). Second, if the user explicitly indicates the method and the resource configuration, it should "verify" if her choice is consistent with the expert recommendations (encapsulated in the knowledge base). Furthermore, one of the goals is to simplify the use of the selected resource to execute the job; i.e., provide a user-friendly method of submitting jobs, without required technical knowledge about the Grid middleware. To achieve the mentioned goals, an adaptable method of expert knowledge representation for the decision support system has to be implemented. The selected approach is to utilize ontologies and semantic data processing, supported by multicriterial decision making. As a starting point, an area of computational linear algebra was selected to be modeled, however, the paper presents a general approach that shall be easily extendable to other domains.

  5. Study on Differential Algebraic Method of Aberrations up to Arbitrary Order for Combined Electromagnetic Focusing Systems

    Institute of Scientific and Technical Information of China (English)

    CHENG Min; TANG Tiantong; YAO Zhenhua; ZHU Jingping

    2001-01-01

    Differential algebraic method is apowerful technique in computer numerical analysisbased on nonstandard analysis and formal series the-ory. It can compute arbitrary high order derivativeswith excellent accuracy. The principle of differentialalgebraic method is applied to calculate high orderaberrations of combined electromagnetic focusing sys-tems. As an example, third-order geometric aberra-tion coefficients of an actual combined electromagneticfocusing system were calculated. The arbitrary highorder aberrations are conveniently calculated by dif-ferential algebraic method and the fifth-order aberra-tion diagrams are given.

  6. Algebra

    CERN Document Server

    Sepanski, Mark R

    2010-01-01

    Mark Sepanski's Algebra is a readable introduction to the delightful world of modern algebra. Beginning with concrete examples from the study of integers and modular arithmetic, the text steadily familiarizes the reader with greater levels of abstraction as it moves through the study of groups, rings, and fields. The book is equipped with over 750 exercises suitable for many levels of student ability. There are standard problems, as well as challenging exercises, that introduce students to topics not normally covered in a first course. Difficult problems are broken into manageable subproblems

  7. Experimental and Theoretical Methods in Algebra, Geometry and Topology

    CERN Document Server

    Veys, Willem; Bridging Algebra, Geometry, and Topology

    2014-01-01

    Algebra, geometry and topology cover a variety of different, but intimately related research fields in modern mathematics. This book focuses on specific aspects of this interaction. The present volume contains refereed papers which were presented at the International Conference “Experimental and Theoretical Methods in Algebra, Geometry and Topology”, held in Eforie Nord (near Constanta), Romania, during 20-25 June 2013. The conference was devoted to the 60th anniversary of the distinguished Romanian mathematicians Alexandru Dimca and Ştefan Papadima. The selected papers consist of original research work and a survey paper. They are intended for a large audience, including researchers and graduate students interested in algebraic geometry, combinatorics, topology, hyperplane arrangements and commutative algebra. The papers are written by well-known experts from different fields of mathematics, affiliated to universities from all over the word, they cover a broad range of topics and explore the research f...

  8. AIR Tools - A MATLAB package of algebraic iterative reconstruction methods

    DEFF Research Database (Denmark)

    Hansen, Per Christian; Saxild-Hansen, Maria

    2012-01-01

    We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods are impleme......We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods...... are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...

  9. SYNTHESIS METHODS OF ALGEBRAIC NORMAL FORM OF MANY-VALUED LOGIC FUNCTIONS

    Directory of Open Access Journals (Sweden)

    A. V. Sokolov

    2016-01-01

    Full Text Available The rapid development of methods of error-correcting coding, cryptography, and signal synthesis theory based on the principles of many-valued logic determines the need for a more detailed study of the forms of representation of functions of many-valued logic. In particular the algebraic normal form of Boolean functions, also known as Zhegalkin polynomial, that well describe many of the cryptographic properties of Boolean functions is widely used. In this article, we formalized the notion of algebraic normal form for many-valued logic functions. We developed a fast method of synthesis of algebraic normal form of 3-functions and 5-functions that work similarly to the Reed-Muller transform for Boolean functions: on the basis of recurrently synthesized transform matrices. We propose the hypothesis, which determines the rules of the synthesis of these matrices for the transformation from the truth table to the coefficients of the algebraic normal form and the inverse transform for any given number of variables of 3-functions or 5-functions. The article also introduces the definition of algebraic degree of nonlinearity of the functions of many-valued logic and the S-box, based on the principles of many-valued logic. Thus, the methods of synthesis of algebraic normal form of 3-functions applied to the known construction of recurrent synthesis of S-boxes of length N = 3k, whereby their algebraic degrees of nonlinearity are computed. The results could be the basis for further theoretical research and practical applications such as: the development of new cryptographic primitives, error-correcting codes, algorithms of data compression, signal structures, and algorithms of block and stream encryption, all based on the perspective principles of many-valued logic. In addition, the fast method of synthesis of algebraic normal form of many-valued logic functions is the basis for their software and hardware implementation.

  10. Free Modal Algebras Revisited: The Step-by-Step Method

    NARCIS (Netherlands)

    Bezhanishvili, N.; Ghilardi, Silvio; Jibladze, Mamuka

    2012-01-01

    We review the step-by-step method of constructing finitely generated free modal algebras. First we discuss the global step-by-step method, which works well for rank one modal logics. Next we refine the global step-by-step method to obtain the local step-by-step method, which is applicable beyond

  11. Implementing Computer Algebra Enabled Questions for the Assessment and Learning of Mathematics

    Science.gov (United States)

    Sangwin, Christopher J.; Naismith, Laura

    2008-01-01

    We present principles for the design of an online system to support computer algebra enabled questions for use within the teaching and learning of mathematics in higher education. The introduction of a computer algebra system (CAS) into a computer aided assessment (CAA) system affords sophisticated response processing of student provided answers.…

  12. Calculation of heat-kernel coefficients and usage of computer algebra

    International Nuclear Information System (INIS)

    Bel'kov, A.A.; Lanev, A.V.; Schaale, A.

    1995-01-01

    The calculation of heat-kernel coefficients with the classical De Witt algorithm has been discussed. We present the explicit form of the coefficients up to h 5 in the general case and up to h 7 min for the minimal parts. The results are compared with the expressions in other papers. A method to optimize the usage of memory for working with large expressions on universal computer algebra systems has been proposed. 20 refs

  13. AIR Tools II: algebraic iterative reconstruction methods, improved implementation

    DEFF Research Database (Denmark)

    Hansen, Per Christian; Jørgensen, Jakob Sauer

    2017-01-01

    with algebraic iterative methods and their convergence properties. The present software is a much expanded and improved version of the package AIR Tools from 2012, based on a new modular design. In addition to improved performance and memory use, we provide more flexible iterative methods, a column-action method...

  14. ADAM: analysis of discrete models of biological systems using computer algebra.

    Science.gov (United States)

    Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

    2011-07-20

    Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web

  15. Computer algebra in quantum field theory integration, summation and special functions

    CERN Document Server

    Schneider, Carsten

    2013-01-01

    The book focuses on advanced computer algebra methods and special functions that have striking applications in the context of quantum field theory. It presents the state of the art and new methods for (infinite) multiple sums, multiple integrals, in particular Feynman integrals, difference and differential equations in the format of survey articles. The presented techniques emerge from interdisciplinary fields: mathematics, computer science and theoretical physics; the articles are written by mathematicians and physicists with the goal that both groups can learn from the other field, including

  16. Application of Computer Graphics to Graphing in Algebra and Trigonometry. Final Report.

    Science.gov (United States)

    Morris, J. Richard

    This project was designed to improve the graphing competency of students in elementary algebra, intermediate algebra, and trigonometry courses at Virginia Commonwealth University. Computer graphics programs were designed using an Apple II Plus computer and implemented using Pascal. The software package is interactive and gives students control…

  17. Affine.m—Mathematica package for computations in representation theory of finite-dimensional and affine Lie algebras

    Science.gov (United States)

    Nazarov, Anton

    2012-11-01

    In this paper we present Affine.m-a program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. The algorithms are based on the properties of weights and Weyl symmetry. Computation of weight multiplicities in irreducible and Verma modules, branching of representations and tensor product decomposition are the most important problems for us. These problems have numerous applications in physics and we provide some examples of these applications. The program is implemented in the popular computer algebra system Mathematica and works with finite-dimensional and affine Lie algebras. Catalogue identifier: AENA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENB_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, UK Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 24 844 No. of bytes in distributed program, including test data, etc.: 1 045 908 Distribution format: tar.gz Programming language: Mathematica. Computer: i386-i686, x86_64. Operating system: Linux, Windows, Mac OS, Solaris. RAM: 5-500 Mb Classification: 4.2, 5. Nature of problem: Representation theory of finite-dimensional Lie algebras has many applications in different branches of physics, including elementary particle physics, molecular physics, nuclear physics. Representations of affine Lie algebras appear in string theories and two-dimensional conformal field theory used for the description of critical phenomena in two-dimensional systems. Also Lie symmetries play a major role in a study of quantum integrable systems. Solution method: We work with weights and roots of finite-dimensional and affine Lie algebras and use Weyl symmetry extensively. Central problems which are the computations of weight multiplicities, branching and fusion coefficients are solved using one general recurrent

  18. Microeconomic theory and computation applying the maxima open-source computer algebra system

    CERN Document Server

    Hammock, Michael R

    2014-01-01

    This book provides a step-by-step tutorial for using Maxima, an open-source multi-platform computer algebra system, to examine the economic relationships that form the core of microeconomics in a way that complements traditional modeling techniques.

  19. Algebraic methods in statistical mechanics and quantum field theory

    CERN Document Server

    Emch, Dr Gérard G

    2009-01-01

    This systematic algebraic approach concerns problems involving a large number of degrees of freedom. It extends the traditional formalism of quantum mechanics, and it eliminates conceptual and mathematical difficulties common to the development of statistical mechanics and quantum field theory. Further, the approach is linked to research in applied and pure mathematics, offering a reflection of the interplay between formulation of physical motivations and self-contained descriptions of the mathematical methods.The four-part treatment begins with a survey of algebraic approaches to certain phys

  20. Linear algebraic methods applied to intensity modulated radiation therapy.

    Science.gov (United States)

    Crooks, S M; Xing, L

    2001-10-01

    Methods of linear algebra are applied to the choice of beam weights for intensity modulated radiation therapy (IMRT). It is shown that the physical interpretation of the beam weights, target homogeneity and ratios of deposited energy can be given in terms of matrix equations and quadratic forms. The methodology of fitting using linear algebra as applied to IMRT is examined. Results are compared with IMRT plans that had been prepared using a commercially available IMRT treatment planning system and previously delivered to cancer patients.

  1. An algebra-based method for inferring gene regulatory networks.

    Science.gov (United States)

    Vera-Licona, Paola; Jarrah, Abdul; Garcia-Puente, Luis David; McGee, John; Laubenbacher, Reinhard

    2014-03-26

    The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the

  2. Quadratic algebras in the noncommutative integration method of wave equation

    International Nuclear Information System (INIS)

    Varaksin, O.L.

    1995-01-01

    The paper deals with the investigation of applications of the method of noncommutative integration of linear differential equations by partial derivatives. Nontrivial example was taken for integration of three-dimensions wave equation with the use of non-Abelian quadratic algebras

  3. Divergence of Scientific Heuristic Method and Direct Algebraic Instruction

    Science.gov (United States)

    Calucag, Lina S.

    2016-01-01

    This is an experimental study, made used of the non-randomized experimental and control groups, pretest-posttest designs. The experimental and control groups were two separate intact classes in Algebra. For a period of twelve sessions, the experimental group was subjected to the scientific heuristic method, but the control group instead was given…

  4. Solving the nuclear shell model with an algebraic method

    International Nuclear Information System (INIS)

    Feng, D.H.; Pan, X.W.; Guidry, M.

    1997-01-01

    We illustrate algebraic methods in the nuclear shell model through a concrete example, the fermion dynamical symmetry model (FDSM). We use this model to introduce important concepts such as dynamical symmetry, symmetry breaking, effective symmetry, and diagonalization within a higher-symmetry basis. (orig.)

  5. Global identifiability of linear compartmental models--a computer algebra algorithm.

    Science.gov (United States)

    Audoly, S; D'Angiò, L; Saccomani, M P; Cobelli, C

    1998-01-01

    A priori global identifiability deals with the uniqueness of the solution for the unknown parameters of a model and is, thus, a prerequisite for parameter estimation of biological dynamic models. Global identifiability is however difficult to test, since it requires solving a system of algebraic nonlinear equations which increases both in nonlinearity degree and number of terms and unknowns with increasing model order. In this paper, a computer algebra tool, GLOBI (GLOBal Identifiability) is presented, which combines the topological transfer function method with the Buchberger algorithm, to test global identifiability of linear compartmental models. GLOBI allows for the automatic testing of a priori global identifiability of general structure compartmental models from general multi input-multi output experiments. Examples of usage of GLOBI to analyze a priori global identifiability of some complex biological compartmental models are provided.

  6. On the economical solution method for a system of linear algebraic equations

    Directory of Open Access Journals (Sweden)

    Jan Awrejcewicz

    2004-01-01

    Full Text Available The present work proposes a novel optimal and exact method of solving large systems of linear algebraic equations. In the approach under consideration, the solution of a system of algebraic linear equations is found as a point of intersection of hyperplanes, which needs a minimal amount of computer operating storage. Two examples are given. In the first example, the boundary value problem for a three-dimensional stationary heat transfer equation in a parallelepiped in ℝ3 is considered, where boundary value problems of first, second, or third order, or their combinations, are taken into account. The governing differential equations are reduced to algebraic ones with the help of the finite element and boundary element methods for different meshes applied. The obtained results are compared with known analytical solutions. The second example concerns computation of a nonhomogeneous shallow physically and geometrically nonlinear shell subject to transversal uniformly distributed load. The partial differential equations are reduced to a system of nonlinear algebraic equations with the error of O(hx12+hx22. The linearization process is realized through either Newton method or differentiation with respect to a parameter. In consequence, the relations of the boundary condition variations along the shell side and the conditions for the solution matching are reported.

  7. Maple (Computer Algebra System) in Teaching Pre-Calculus: Example of Absolute Value Function

    Science.gov (United States)

    Tuluk, Güler

    2014-01-01

    Modules in Computer Algebra Systems (CAS) make Mathematics interesting and easy to understand. The present study focused on the implementation of the algebraic, tabular (numerical), and graphical approaches used for the construction of the concept of absolute value function in teaching mathematical content knowledge along with Maple 9. The study…

  8. Changes in Pre-Service Teachers' Algebraic Misconceptions by Using Computer-Assisted Instruction

    Science.gov (United States)

    Lin, ByCheng-Yao; Ko, Yi-Yin; Kuo, Yu-Chun

    2014-01-01

    In order to carry out current reforms regarding algebra and technology in elementary school mathematics successfully, pre-service elementary mathematics teachers must be equipped with adequate understandings of algebraic concepts and self-confidence in using computers for their future teaching. This paper examines the differences in preservice…

  9. Matrix algebra theory, computations and applications in statistics

    CERN Document Server

    Gentle, James E

    2017-01-01

    This textbook for graduate and advanced undergraduate students presents the theory of matrix algebra for statistical applications, explores various types of matrices encountered in statistics, and covers numerical linear algebra. Matrix algebra is one of the most important areas of mathematics in data science and in statistical theory, and the second edition of this very popular textbook provides essential updates and comprehensive coverage on critical topics in mathematics in data science and in statistical theory. Part I offers a self-contained description of relevant aspects of the theory of matrix algebra for applications in statistics. It begins with fundamental concepts of vectors and vector spaces; covers basic algebraic properties of matrices and analytic properties of vectors and matrices in multivariate calculus; and concludes with a discussion on operations on matrices in solutions of linear systems and in eigenanalysis. Part II considers various types of matrices encountered in statistics, such as...

  10. Algebraic collapsing acceleration of the characteristics method with anisotropic scattering

    International Nuclear Information System (INIS)

    Le Tellier, R.; Hebert, A.; Roy, R.

    2004-01-01

    In this paper, the characteristics solvers implemented in the lattice code Dragon are extended to allow a complete anisotropic treatment of the collision operator. An efficient synthetic acceleration method, called Algebraic Collapsing Acceleration (ACA), is presented. Tests show that this method can substantially speed up the convergence of scattering source iterations. The effect of boundary conditions, either specular or white reflections, on anisotropic scattering lattice-cell problems is also considered. (author)

  11. Projection computation based on pixel in simultaneous algebraic reconstruction technique

    International Nuclear Information System (INIS)

    Wang Xu; Chen Zhiqiang; Xiong Hua; Zhang Li

    2005-01-01

    SART is an important arithmetic of image reconstruction, in which the projection computation takes over half of the reconstruction time. An efficient way to compute projection coefficient matrix together with memory optimization is presented in this paper. Different from normal method, projection lines are located based on every pixel, and the following projection coefficient computation can make use of the results. Correlation of projection lines and pixels can be used to optimize the computation. (authors)

  12. Solving algebraic computational problems in geodesy and geoinformatics the answer to modern challenges

    CERN Document Server

    Awange, Joseph L

    2004-01-01

    While preparing and teaching 'Introduction to Geodesy I and II' to - dergraduate students at Stuttgart University, we noticed a gap which motivated the writing of the present book: Almost every topic that we taughtrequiredsomeskillsinalgebra,andinparticular,computeral- bra! From positioning to transformation problems inherent in geodesy and geoinformatics, knowledge of algebra and application of computer algebra software were required. In preparing this book therefore, we haveattemptedtoputtogetherbasicconceptsofabstractalgebra which underpin the techniques for solving algebraic problems. Algebraic c- putational algorithms useful for solving problems which require exact solutions to nonlinear systems of equations are presented and tested on various problems. Though the present book focuses mainly on the two ?elds,theconceptsand techniquespresented hereinarenonetheless- plicable to other ?elds where algebraic computational problems might be encountered. In Engineering for example, network densi?cation and robo...

  13. Thermodiffusion in Multicomponent Mixtures Thermodynamic, Algebraic, and Neuro-Computing Models

    CERN Document Server

    Srinivasan, Seshasai

    2013-01-01

    Thermodiffusion in Multicomponent Mixtures presents the computational approaches that are employed in the study of thermodiffusion in various types of mixtures, namely, hydrocarbons, polymers, water-alcohol, molten metals, and so forth. We present a detailed formalism of these methods that are based on non-equilibrium thermodynamics or algebraic correlations or principles of the artificial neural network. The book will serve as single complete reference to understand the theoretical derivations of thermodiffusion models and its application to different types of multi-component mixtures. An exhaustive discussion of these is used to give a complete perspective of the principles and the key factors that govern the thermodiffusion process.

  14. Algebraic methods for solution of polyhedra

    Energy Technology Data Exchange (ETDEWEB)

    Sabitov, Idzhad Kh [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

    2011-06-30

    By analogy with the solution of triangles, the solution of polyhedra means a theory and methods for calculating some geometric parameters of polyhedra in terms of other parameters of them. The main content of this paper is a survey of results on calculating the volumes of polyhedra in terms of their metrics and combinatorial structures. It turns out that a far-reaching generalization of Heron's formula for the area of a triangle to the volumes of polyhedra is possible, and it underlies the proof of the conjecture that the volume of a deformed flexible polyhedron remains constant. Bibliography: 110 titles.

  15. 2nd EACA International School on Computer Algebra and its Applications

    CERN Document Server

    Gimenez, Philippe; Sáenz-de-Cabezón, Eduardo

    2017-01-01

    Featuring up-to-date coverage of three topics lying at the intersection of combinatorics and commutative algebra, namely Koszul algebras, primary decompositions and subdivision operations in simplicial complexes, this book has its focus on computations. "Computations and combinatorics in commutative algebra" has been written by experts in both theoretical and computational aspects of these three subjects and is aimed at a broad audience, from experienced researchers who want to have an easy but deep review of the topics covered to postgraduate students who need a quick introduction to the techniques. The computational treatment of the material, including plenty of examples and code, will be useful for a wide range of professionals interested in the connections between commutative algebra and combinatorics.

  16. Methods of mathematical modeling using polynomials of algebra of sets

    Science.gov (United States)

    Kazanskiy, Alexandr; Kochetkov, Ivan

    2018-03-01

    The article deals with the construction of discrete mathematical models for solving applied problems arising from the operation of building structures. Security issues in modern high-rise buildings are extremely serious and relevant, and there is no doubt that interest in them will only increase. The territory of the building is divided into zones for which it is necessary to observe. Zones can overlap and have different priorities. Such situations can be described using formulas algebra of sets. Formulas can be programmed, which makes it possible to work with them using computer models.

  17. Linear algebra

    CERN Document Server

    Edwards, Harold M

    1995-01-01

    In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject

  18. Generalization of the linear algebraic method to three dimensions

    International Nuclear Information System (INIS)

    Lynch, D.L.; Schneider, B.I.

    1991-01-01

    We present a numerical method for the solution of the Lippmann-Schwinger equation for electron-molecule collisions. By performing a three-dimensional numerical quadrature, this approach avoids both a basis-set representation of the wave function and a partial-wave expansion of the scattering potential. The resulting linear equations, analogous in form to the one-dimensional linear algebraic method, are solved with the direct iteration-variation method. Several numerical examples are presented. The prospect for using this numerical quadrature scheme for electron-polyatomic molecules is discussed

  19. Multiplier ideal sheaves and analytic methods in algebraic geometry

    International Nuclear Information System (INIS)

    Demailly, J.-P.

    2001-01-01

    Our main purpose here is to describe a few analytic tools which are useful to study questions such as linear series and vanishing theorems for algebraic vector bundles. One of the early successes of analytic methods in this context is Kodaira's use of the Bochner technique in relation with the theory of harmonic forms, during the decade 1950-60.The idea is to represent cohomology classes by harmonic forms and to prove vanishing theorems by means of suitable a priori curvature estimates. We pursue the study of L2 estimates, in relation with the Nullstellenstatz and with the extension problem. We show how subadditivity can be used to derive an approximation theorem for (almost) plurisubharmonic functions: any such function can be approximated by a sequence of (almost) plurisubharmonic functions which are smooth outside an analytic set, and which define the same multiplier ideal sheaves. From this, we derive a generalized version of the hard Lefschetz theorem for cohomology with values in a pseudo-effective line bundle; namely, the Lefschetz map is surjective when the cohomology groups are twisted by the relevant multiplier ideal sheaves. These notes are essentially written with the idea of serving as an analytic tool- box for algebraic geometers. Although efficient algebraic techniques exist, our feeling is that the analytic techniques are very flexible and offer a large variety of guidelines for more algebraic questions (including applications to number theory which are not discussed here). We made a special effort to use as little prerequisites and to be as self-contained as possible; hence the rather long preliminary sections dealing with basic facts of complex differential geometry

  20. Multiplier ideal sheaves and analytic methods in algebraic geometry

    Energy Technology Data Exchange (ETDEWEB)

    Demailly, J -P [Universite de Grenoble I, Institut Fourier, Saint-Martin d' Heres (France)

    2001-12-15

    Our main purpose here is to describe a few analytic tools which are useful to study questions such as linear series and vanishing theorems for algebraic vector bundles. One of the early successes of analytic methods in this context is Kodaira's use of the Bochner technique in relation with the theory of harmonic forms, during the decade 1950-60.The idea is to represent cohomology classes by harmonic forms and to prove vanishing theorems by means of suitable a priori curvature estimates. We pursue the study of L2 estimates, in relation with the Nullstellenstatz and with the extension problem. We show how subadditivity can be used to derive an approximation theorem for (almost) plurisubharmonic functions: any such function can be approximated by a sequence of (almost) plurisubharmonic functions which are smooth outside an analytic set, and which define the same multiplier ideal sheaves. From this, we derive a generalized version of the hard Lefschetz theorem for cohomology with values in a pseudo-effective line bundle; namely, the Lefschetz map is surjective when the cohomology groups are twisted by the relevant multiplier ideal sheaves. These notes are essentially written with the idea of serving as an analytic tool- box for algebraic geometers. Although efficient algebraic techniques exist, our feeling is that the analytic techniques are very flexible and offer a large variety of guidelines for more algebraic questions (including applications to number theory which are not discussed here). We made a special effort to use as little prerequisites and to be as self-contained as possible; hence the rather long preliminary sections dealing with basic facts of complex differential geometry.

  1. Use of regularized algebraic methods in tomographic reconstruction

    International Nuclear Information System (INIS)

    Koulibaly, P.M.; Darcourt, J.; Blanc-Ferraud, L.; Migneco, O.; Barlaud, M.

    1997-01-01

    The algebraic methods are used in emission tomography to facilitate the compensation of attenuation and of Compton scattering. We have tested on a phantom the use of a regularization (a priori introduction of information), as well as the taking into account of spatial resolution variation with the depth (SRVD). Hence, we have compared the performances of the two methods by back-projection filtering (BPF) and of the two algebraic methods (AM) in terms of FWHM (by means of a point source), of the reduction of background noise (σ/m) on the homogeneous part of Jaszczak's phantom and of reconstruction speed (time unit = BPF). The BPF methods make use of a grade filter (maximal resolution, no noise treatment), single or associated with a Hann's low-pass (f c = 0.4), as well as of an attenuation correction. The AM which embody attenuation and scattering corrections are, on one side, the OS EM (Ordered Subsets, partitioning and rearranging of the projection matrix; Expectation Maximization) without regularization or SRVD correction, and, on the other side, the OS MAP EM (Maximum a posteriori), regularized and embodying the SRVD correction. A table is given containing for each used method (grade, Hann, OS EM and OS MAP EM) the values of FWHM, σ/m and time, respectively. One can observe that the OS MAP EM algebraic method allows ameliorating both the resolution, by taking into account the SRVD in the reconstruction process and noise treatment by regularization. In addition, due to the OS technique the reconstruction times are acceptable

  2. Identification of control targets in Boolean molecular network models via computational algebra.

    Science.gov (United States)

    Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard

    2016-09-23

    Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

  3. Exact distributions of two-sample rank statistics and block rank statistics using computer algebra

    NARCIS (Netherlands)

    Wiel, van de M.A.

    1998-01-01

    We derive generating functions for various rank statistics and we use computer algebra to compute the exact null distribution of these statistics. We present various techniques for reducing time and memory space used by the computations. We use the results to write Mathematica notebooks for

  4. An algebraic method for constructing stable and consistent autoregressive filters

    International Nuclear Information System (INIS)

    Harlim, John; Hong, Hoon; Robbins, Jacob L.

    2015-01-01

    In this paper, we introduce an algebraic method to construct stable and consistent univariate autoregressive (AR) models of low order for filtering and predicting nonlinear turbulent signals with memory depth. By stable, we refer to the classical stability condition for the AR model. By consistent, we refer to the classical consistency constraints of Adams–Bashforth methods of order-two. One attractive feature of this algebraic method is that the model parameters can be obtained without directly knowing any training data set as opposed to many standard, regression-based parameterization methods. It takes only long-time average statistics as inputs. The proposed method provides a discretization time step interval which guarantees the existence of stable and consistent AR model and simultaneously produces the parameters for the AR models. In our numerical examples with two chaotic time series with different characteristics of decaying time scales, we find that the proposed AR models produce significantly more accurate short-term predictive skill and comparable filtering skill relative to the linear regression-based AR models. These encouraging results are robust across wide ranges of discretization times, observation times, and observation noise variances. Finally, we also find that the proposed model produces an improved short-time prediction relative to the linear regression-based AR-models in forecasting a data set that characterizes the variability of the Madden–Julian Oscillation, a dominant tropical atmospheric wave pattern

  5. High order aberrations calculation of a hexapole corrector using a differential algebra method

    Energy Technology Data Exchange (ETDEWEB)

    Kang, Yongfeng, E-mail: yfkang@mail.xjtu.edu.cn [Key Laboratory for Physical Electronics and Devices of the Ministry of Education, Xi' an Jiaotong University, Xi' an 710049 (China); Liu, Xing [Key Laboratory for Physical Electronics and Devices of the Ministry of Education, Xi' an Jiaotong University, Xi' an 710049 (China); Zhao, Jingyi, E-mail: jingyi.zhao@foxmail.com [School of Science, Chang’an University, Xi’an 710064 (China); Tang, Tiantong [Key Laboratory for Physical Electronics and Devices of the Ministry of Education, Xi' an Jiaotong University, Xi' an 710049 (China)

    2017-02-21

    A differential algebraic (DA) method is proved as an unusual and effective tool in numerical analysis. It implements conveniently differentiation up to arbitrary high order, based on the nonstandard analysis. In this paper, the differential algebra (DA) method has been employed to compute the high order aberrations up to the fifth order of a practical hexapole corrector including round lenses and hexapole lenses. The program has been developed and tested as well. The electro-magnetic fields of arbitrary point are obtained by local analytic expressions, then field potentials are transformed into new forms which can be operated in the DA calculation. In this paper, the geometric and chromatic aberrations up to fifth order of a practical hexapole corrector system are calculated by the developed program.

  6. Simple relation algebras

    CERN Document Server

    Givant, Steven

    2017-01-01

    This monograph details several different methods for constructing simple relation algebras, many of which are new with this book. By drawing these seemingly different methods together, all are shown to be aspects of one general approach, for which several applications are given. These tools for constructing and analyzing relation algebras are of particular interest to mathematicians working in logic, algebraic logic, or universal algebra, but will also appeal to philosophers and theoretical computer scientists working in fields that use mathematics. The book is written with a broad audience in mind and features a careful, pedagogical approach; an appendix contains the requisite background material in relation algebras. Over 400 exercises provide ample opportunities to engage with the material, making this a monograph equally appropriate for use in a special topics course or for independent study. Readers interested in pursuing an extended background study of relation algebras will find a comprehensive treatme...

  7. Algebraic methods in random matrices and enumerative geometry

    CERN Document Server

    Eynard, Bertrand

    2008-01-01

    We review the method of symplectic invariants recently introduced to solve matrix models loop equations, and further extended beyond the context of matrix models. For any given spectral curve, one defined a sequence of differential forms, and a sequence of complex numbers Fg . We recall the definition of the invariants Fg, and we explain their main properties, in particular symplectic invariance, integrability, modularity,... Then, we give several example of applications, in particular matrix models, enumeration of discrete surfaces (maps), algebraic geometry and topological strings, non-intersecting brownian motions,...

  8. An algebraic method to solve the Tavis-Cummings problem

    International Nuclear Information System (INIS)

    Vadejko, I.P.; Miroshnichenko, G.P.; Rybin, A.V.; Timonen, J.

    2003-01-01

    We study cooperative behaviour of the system of two-level atoms coupled to a single mode of the electromagnetic field in the resonator. We have developed a general procedure allowing one to rewrite a polynomial deformed SU(2) algebra in terms of another polynomial deformation. Using these methods, we have constructed a perturbation series for the Tavis-Cummings Hamiltonian and diagonalized it in the third order. Based on the zero-order Hamiltonian we calculate the intensity of spontaneous emission of N two-level atoms inside a cavity, which are in thermal equilibrium with the reservoir. The atom-atom correlation determining superradiance in the system is analyzed

  9. A novel technique to solve nonlinear higher-index Hessenberg differential-algebraic equations by Adomian decomposition method.

    Science.gov (United States)

    Benhammouda, Brahim

    2016-01-01

    Since 1980, the Adomian decomposition method (ADM) has been extensively used as a simple powerful tool that applies directly to solve different kinds of nonlinear equations including functional, differential, integro-differential and algebraic equations. However, for differential-algebraic equations (DAEs) the ADM is applied only in four earlier works. There, the DAEs are first pre-processed by some transformations like index reductions before applying the ADM. The drawback of such transformations is that they can involve complex algorithms, can be computationally expensive and may lead to non-physical solutions. The purpose of this paper is to propose a novel technique that applies the ADM directly to solve a class of nonlinear higher-index Hessenberg DAEs systems efficiently. The main advantage of this technique is that; firstly it avoids complex transformations like index reductions and leads to a simple general algorithm. Secondly, it reduces the computational work by solving only linear algebraic systems with a constant coefficient matrix at each iteration, except for the first iteration where the algebraic system is nonlinear (if the DAE is nonlinear with respect to the algebraic variable). To demonstrate the effectiveness of the proposed technique, we apply it to a nonlinear index-three Hessenberg DAEs system with nonlinear algebraic constraints. This technique is straightforward and can be programmed in Maple or Mathematica to simulate real application problems.

  10. Analytical solution using computer algebra of a biosensor for detecting toxic substances in water

    Science.gov (United States)

    Rúa Taborda, María. Isabel

    2014-05-01

    In a relatively recent paper an electrochemical biosensor for water toxicity detection based on a bio-chip as a whole cell was proposed and numerically solved and analyzed. In such paper the kinetic processes in a miniaturized electrochemical biosensor system was described using the equations for specific enzymatic reaction and the diffusion equation. The numerical solution shown excellent agreement with the measured data but such numerical solution is not enough to design efficiently the corresponding bio-chip. For this reason an analytical solution is demanded. The object of the present work is to provide such analytical solution and then to give algebraic guides to design the bio-sensor. The analytical solution is obtained using computer algebra software, specifically Maple. The method of solution is the Laplace transform, with Bromwich integral and residue theorem. The final solution is given as a series of Bessel functions and the effective time for the bio-sensor is computed. It is claimed that the analytical solutions that were obtained will be very useful to predict further current variations in similar systems with different geometries, materials and biological components. Beside of this the analytical solution that we provide is very useful to investigate the relationship between different chamber parameters such as cell radius and height; and electrode radius.

  11. Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra

    International Nuclear Information System (INIS)

    Ablinger, J.; Schneider, C.; Manteuffel, A. von

    2015-09-01

    Three loop ladder and V-topology diagrams contributing to the massive operator matrix element A Qg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.

  12. Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra

    Science.gov (United States)

    Ablinger, J.; Behring, A.; Blümlein, J.; De Freitas, A.; von Manteuffel, A.; Schneider, C.

    2016-05-01

    Three loop ladder and V-topology diagrams contributing to the massive operator matrix element AQg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.

  13. THE METHODICAL ASPECTS OF THE ALGEBRA AND THE MATHEMATICAL ANALYSIS STUDY USING THE SAGEMATH CLOUD

    Directory of Open Access Journals (Sweden)

    M. Popel

    2014-06-01

    Full Text Available The quality of mathematics education depends largely on the quality of education in general. The main idea may be summarized as follows: in order to educate the younger generation of people to be able to meet adequately the demands of the time, it is necessary to create conditions for the high-quality mathematics education. Improving the quality of mathematics education of pupils in secondary school is one of the most pressing problems. Contents of the school course of mathematics and its teaching method has always been the subject of undammed and sometimes stormy scientific debates. There are especially true methods of teaching algebra and the analisis in the high secondary school. Still in the study process the algebraic concepts and principles of analysis are given in such an abstract and generalized form that the student may has considerable difficulties to map these general abstract concepts to the certain concrete images, they are generalizations of. Improving education quality indicators can be achieved by using the appropriate computer technology. The article deals with the use of the cloud-oriented systems of computer mathematics (SCM. The prospects of development of the Web-SCM in terms of cloud-based learning environment are considered. The pedagogical features of the SageMath Cloud use as a tool for mathematics learning are revealed. The methodological aspects of algebra and elementary analysis teaching in a high profile school using the cloud-oriented the SCM SageMath Cloud are revealed.

  14. Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method

    Directory of Open Access Journals (Sweden)

    Hooman Fatoorehchi

    2014-10-01

    Full Text Available In this paper, we put forth a combined method for calculation of all real zeroes of a polynomial equation through the Adomian decomposition method equipped with a number of developed theorems from matrix algebra. These auxiliary theorems are associated with eigenvalues of matrices and enable convergence of the Adomian decomposition method toward different real roots of the target polynomial equation. To further improve the computational speed of our technique, a nonlinear convergence accelerator known as the Shanks transform has optionally been employed. For the sake of illustration, a number of numerical examples are given.

  15. Computing algebraic transfer entropy and coupling directions via transcripts

    Science.gov (United States)

    Amigó, José M.; Monetti, Roberto; Graff, Beata; Graff, Grzegorz

    2016-11-01

    Most random processes studied in nonlinear time series analysis take values on sets endowed with a group structure, e.g., the real and rational numbers, and the integers. This fact allows to associate with each pair of group elements a third element, called their transcript, which is defined as the product of the second element in the pair times the first one. The transfer entropy of two such processes is called algebraic transfer entropy. It measures the information transferred between two coupled processes whose values belong to a group. In this paper, we show that, subject to one constraint, the algebraic transfer entropy matches the (in general, conditional) mutual information of certain transcripts with one variable less. This property has interesting practical applications, especially to the analysis of short time series. We also derive weak conditions for the 3-dimensional algebraic transfer entropy to yield the same coupling direction as the corresponding mutual information of transcripts. A related issue concerns the use of mutual information of transcripts to determine coupling directions in cases where the conditions just mentioned are not fulfilled. We checked the latter possibility in the lowest dimensional case with numerical simulations and cardiovascular data, and obtained positive results.

  16. An Improved Algebraic Method for Transit Signal Priority Scheme and Its Impact on Traffic Emission

    OpenAIRE

    Ji, Yanjie; Hu, Bo; Han, Jing; Tang, Dounan

    2014-01-01

    Transit signal priority has a positive effect on improving traffic congestion and reducing transit delay and also has an influence on traffic emission. In this paper, an optimal transit signal priority scheme based on an improved algebraic method was developed and its impact on vehicle emission was evaluated as well. The improved algebraic method was proposed on the basis of classical algebraic method and has improvements in three aspects. First, the calculation rules of split loss are more r...

  17. A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy (II)

    Science.gov (United States)

    Bradford, Russell; Davenport, James H.; Sangwin, Chris

    2010-01-01

    A perennial problem in computer-aided assessment is that "a right answer", pedagogically speaking, is not the same thing as "a mathematically correct expression", as verified by a computer algebra system, or indeed other techniques such as random evaluation. Paper I in this series considered the difference in cases where there was "the right…

  18. The Simulation of an Oxidation-Reduction Titration Curve with Computer Algebra

    Science.gov (United States)

    Whiteley, Richard V., Jr.

    2015-01-01

    Although the simulation of an oxidation/reduction titration curve is an important exercise in an undergraduate course in quantitative analysis, that exercise is frequently simplified to accommodate computational limitations. With the use of readily available computer algebra systems, however, such curves for complicated systems can be generated…

  19. An algebraic formulation of quantum electrodynamics. [Fermi method, Schroedinger representation, Weylalgebra

    Energy Technology Data Exchange (ETDEWEB)

    Gaffney, J M

    1975-01-01

    A reappraisal of electromagnetic field theories is made and an account is given of the radiation gauge, Gupta-Bleuler and Fermi methods of quantitising the electromagnetic fields. The Weyl algebra of the vector potential is constructed and the Fermi method is then related to a certain representation of the algebra. The representation is specified by a generating functional for a state on the algebra. The Weyl algebra of the physical field is then constructed as a factor algebra. The Schroedinger representation of the algebra is then studied and it was found that the Fermi method is just a generalization of this representation to an infinite number of degrees of freedom. The Schroedinger representation of Fermi method is constructed.

  20. A comparison of equality in computer algebra and correctness in mathematical pedagogy (II)

    OpenAIRE

    Bradford, Russell; Davenport, James H; Sangwin, C

    2010-01-01

    A perennial problem in computer-aided assessment is that “a right answer”, pedagogically speaking, is not the same thing as “a mathematically correct expression”, as verified by a computer algebra system, or indeed other techniques such as random evaluation. Paper I in this series considered the difference in cases where there was “the right answer”, typically calculus questions. Here we look at some other cases, notably in linear algebra, where there can be many “right answers”, but still th...

  1. An algebraic iterative reconstruction technique for differential X-ray phase-contrast computed tomography.

    Science.gov (United States)

    Fu, Jian; Schleede, Simone; Tan, Renbo; Chen, Liyuan; Bech, Martin; Achterhold, Klaus; Gifford, Martin; Loewen, Rod; Ruth, Ronald; Pfeiffer, Franz

    2013-09-01

    Iterative reconstruction has a wide spectrum of proven advantages in the field of conventional X-ray absorption-based computed tomography (CT). In this paper, we report on an algebraic iterative reconstruction technique for grating-based differential phase-contrast CT (DPC-CT). Due to the differential nature of DPC-CT projections, a differential operator and a smoothing operator are added to the iterative reconstruction, compared to the one commonly used for absorption-based CT data. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured at a two-grating interferometer setup. Since the algorithm is easy to implement and allows for the extension to various regularization possibilities, we expect a significant impact of the method for improving future medical and industrial DPC-CT applications. Copyright © 2012. Published by Elsevier GmbH.

  2. Commutative algebra with a view toward algebraic geometry

    CERN Document Server

    Eisenbud, David

    1995-01-01

    Commutative Algebra is best understood with knowledge of the geometric ideas that have played a great role in its formation, in short, with a view towards algebraic geometry. The author presents a comprehensive view of commutative algebra, from basics, such as localization and primary decomposition, through dimension theory, differentials, homological methods, free resolutions and duality, emphasizing the origins of the ideas and their connections with other parts of mathematics. Many exercises illustrate and sharpen the theory and extended exercises give the reader an active part in complementing the material presented in the text. One novel feature is a chapter devoted to a quick but thorough treatment of Grobner basis theory and the constructive methods in commutative algebra and algebraic geometry that flow from it. Applications of the theory and even suggestions for computer algebra projects are included. This book will appeal to readers from beginners to advanced students of commutative algebra or algeb...

  3. Multiple travelling wave solutions of nonlinear evolution equations using a unified algebraic method

    International Nuclear Information System (INIS)

    Fan Engui

    2002-01-01

    A new direct and unified algebraic method for constructing multiple travelling wave solutions of general nonlinear evolution equations is presented and implemented in a computer algebraic system. Compared with most of the existing tanh methods, the Jacobi elliptic function method or other sophisticated methods, the proposed method not only gives new and more general solutions, but also provides a guideline to classify the various types of the travelling wave solutions according to the values of some parameters. The solutions obtained in this paper include (a) kink-shaped and bell-shaped soliton solutions, (b) rational solutions, (c) triangular periodic solutions and (d) Jacobi and Weierstrass doubly periodic wave solutions. Among them, the Jacobi elliptic periodic wave solutions exactly degenerate to the soliton solutions at a certain limit condition. The efficiency of the method can be demonstrated on a large variety of nonlinear evolution equations such as those considered in this paper, KdV-MKdV, Ito's fifth MKdV, Hirota, Nizhnik-Novikov-Veselov, Broer-Kaup, generalized coupled Hirota-Satsuma, coupled Schroedinger-KdV, (2+1)-dimensional dispersive long wave, (2+1)-dimensional Davey-Stewartson equations. In addition, as an illustrative sample, the properties of the soliton solutions and Jacobi doubly periodic solutions for the Hirota equation are shown by some figures. The links among our proposed method, the tanh method, extended tanh method and the Jacobi elliptic function method are clarified generally. (author)

  4. The Adapted Ordering Method for Lie algebras and superalgebras and their generalizations

    Energy Technology Data Exchange (ETDEWEB)

    Gato-Rivera, Beatriz [Instituto de Matematicas y Fisica Fundamental, CSIC, Serrano 123, Madrid 28006 (Spain); NIKHEF-H, Kruislaan 409, NL-1098 SJ Amsterdam (Netherlands)

    2008-02-01

    In 1998 the Adapted Ordering Method was developed for the representation theory of the superconformal algebras in two dimensions. It allows us to determine maximal dimensions for a given type of space of singular vectors, to identify all singular vectors by only a few coefficients, to spot subsingular vectors and to set the basis for constructing embedding diagrams. In this paper we present the Adapted Ordering Method for general Lie algebras and superalgebras and their generalizations, provided they can be triangulated. We also review briefly the results obtained for the Virasoro algebra and for the N = 2 and Ramond N = 1 superconformal algebras.

  5. Intertextuality and Sense Production in the Learning of Algebraic Methods

    Science.gov (United States)

    Rojano, Teresa; Filloy, Eugenio; Puig, Luis

    2014-01-01

    In studies carried out in the 1980s the algebraic symbols and expressions are revealed through prealgebraic readers as non-independent texts, as texts that relate to other texts that in some cases belong to the reader's native language or to the arithmetic sign system. Such outcomes suggest that the act of reading algebraic texts submerges…

  6. Solution of systems of linear algebraic equations by the method of summation of divergent series

    International Nuclear Information System (INIS)

    Kirichenko, G.A.; Korovin, Ya.S.; Khisamutdinov, M.V.; Shmojlov, V.I.

    2015-01-01

    A method for solving systems of linear algebraic equations has been proposed on the basis on the summation of the corresponding continued fractions. The proposed algorithm for solving systems of linear algebraic equations is classified as direct algorithms providing an exact solution in a finite number of operations. Examples of solving systems of linear algebraic equations have been presented and the effectiveness of the algorithm has been estimated [ru

  7. Using computer algebra and SMT-solvers to analyze a mathematical model of cholera propagation

    Science.gov (United States)

    Trujillo Arredondo, Mariana

    2014-06-01

    We analyze a mathematical model for the transmission of cholera. The model is already defined and involves variables such as the pathogen agent, which in this case is the bacterium Vibrio cholera, and the human population. The human population is divided into three classes: susceptible, infectious and removed. Using Computer Algebra, specifically Maple we obtain two equilibrium states: the disease free state and the endemic state. Using Maple it is possible to prove that the disease free state is locally asymptotically stable if and only if R0 1. Using the package Red-Log of the Computer algebra system Reduce and the SMT-Solver Z3Py it is possible to obtain numerical conditions for the model. The formula for the basic reproductive number makes a synthesis with all epidemic parameters in the model. Also it is possible to make numerical simulations which are very illustrative about the epidemic patters that are expected to be observed in real situations. We claim that these kinds of software are very useful in the analysis of epidemic models given that the symbolic computation provides algebraic formulas for the basic reproductive number and such algebraic formulas are very useful to derive control measures. For other side, computer algebra software is a powerful tool to make the stability analysis for epidemic models given that the all steps in the stability analysis can be made automatically: finding the equilibrium points, computing the jacobian, computing the characteristic polynomial for the jacobian, and applying the Routh-Hurwitz theorem to the characteristic polynomial. Finally, using SMT-Solvers is possible to make automatically checks of satisfiability, validity and quantifiers elimination being these computations very useful to analyse complicated epidemic models.

  8. Advanced computer algebra algorithms for the expansion of Feynman integrals

    International Nuclear Information System (INIS)

    Ablinger, Jakob; Round, Mark; Schneider, Carsten

    2012-10-01

    Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in 4+ε-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter n. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist-Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in n. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all n solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.

  9. Advanced computer algebra algorithms for the expansion of Feynman integrals

    Energy Technology Data Exchange (ETDEWEB)

    Ablinger, Jakob; Round, Mark; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation; Bluemlein, Johannes [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)

    2012-10-15

    Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in 4+{epsilon}-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter n. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist-Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in n. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all n solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.

  10. Leapfrog variants of iterative methods for linear algebra equations

    Science.gov (United States)

    Saylor, Paul E.

    1988-01-01

    Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterates are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

  11. The Automation of Stochastization Algorithm with Use of SymPy Computer Algebra Library

    Science.gov (United States)

    Demidova, Anastasya; Gevorkyan, Migran; Kulyabov, Dmitry; Korolkova, Anna; Sevastianov, Leonid

    2018-02-01

    SymPy computer algebra library is used for automatic generation of ordinary and stochastic systems of differential equations from the schemes of kinetic interaction. Schemes of this type are used not only in chemical kinetics but also in biological, ecological and technical models. This paper describes the automatic generation algorithm with an emphasis on application details.

  12. Revisiting Newtonian and Non-Newtonian Fluid Mechanics Using Computer Algebra

    Science.gov (United States)

    Knight, D. G.

    2006-01-01

    This article illustrates how a computer algebra system, such as Maple[R], can assist in the study of theoretical fluid mechanics, for both Newtonian and non-Newtonian fluids. The continuity equation, the stress equations of motion, the Navier-Stokes equations, and various constitutive equations are treated, using a full, but straightforward,…

  13. Exploring Interactive and Dynamic Simulations Using a Computer Algebra System in an Advanced Placement Chemistry Course

    Science.gov (United States)

    Matsumoto, Paul S.

    2014-01-01

    The article describes the use of Mathematica, a computer algebra system (CAS), in a high school chemistry course. Mathematica was used to generate a graph, where a slider controls the value of parameter(s) in the equation; thus, students can visualize the effect of the parameter(s) on the behavior of the system. Also, Mathematica can show the…

  14. On the Integration of Computer Algebra Systems (CAS) by Canadian Mathematicians: Results of a National Survey

    Science.gov (United States)

    Buteau, Chantal; Jarvis, Daniel H.; Lavicza, Zsolt

    2014-01-01

    In this article, we outline the findings of a Canadian survey study (N = 302) that focused on the extent of computer algebra systems (CAS)-based technology use in postsecondary mathematics instruction. Results suggest that a considerable number of Canadian mathematicians use CAS in research and teaching. CAS use in research was found to be the…

  15. A Study of the Use of a Handheld Computer Algebra System in Discrete Mathematics

    Science.gov (United States)

    Powers, Robert A.; Allison, Dean E.; Grassl, Richard M.

    2005-01-01

    This study investigated the impact of the TI-92 handheld Computer Algebra System (CAS) on student achievement in a discrete mathematics course. Specifically, the researchers examined the differences between a CAS section and a control section of discrete mathematics on students' in-class examinations. Additionally, they analysed student approaches…

  16. ACE - an algebraic compiler and encoder for the Chalk River datatron computer

    International Nuclear Information System (INIS)

    Kennedy, J.M.; Okazaki, E.A.; Millican, M.

    1960-03-01

    ACE is a program written for the Chalk River Datatron (Burroughs 205) Computer to enable the machine to compile a program for solving a problem from instructions supplied by the user in a notation related much more closely to algebra than to the machine's own code. (author)

  17. Non commutative geometry methods for group C*-algebras

    International Nuclear Information System (INIS)

    Do Ngoc Diep.

    1996-09-01

    This book is intended to provide a quick introduction to the subject. The exposition is scheduled in the sequence, as possible for more understanding for beginners. The author exposed a K-theoretic approach to study group C * -algebras: started in the elementary part, with one example of description of the structure of C * -algebra of the group of affine transformations of the real straight line, continued then for some special classes of solvable and nilpotent Lie groups. In the second advanced part, he introduced the main tools of the theory. In particular, the conception of multidimensional geometric quantization and the index of group C * -algebras were created and developed. (author). Refs

  18. An Algebra-Based Introductory Computational Neuroscience Course with Lab.

    Science.gov (United States)

    Fink, Christian G

    2017-01-01

    A course in computational neuroscience has been developed at Ohio Wesleyan University which requires no previous experience with calculus or computer programming, and which exposes students to theoretical models of neural information processing and techniques for analyzing neural data. The exploration of theoretical models of neural processes is conducted in the classroom portion of the course, while data analysis techniques are covered in lab. Students learn to program in MATLAB and are offered the opportunity to conclude the course with a final project in which they explore a topic of their choice within computational neuroscience. Results from a questionnaire administered at the beginning and end of the course indicate significant gains in student facility with core concepts in computational neuroscience, as well as with analysis techniques applied to neural data.

  19. Mathematical Model for Dengue Epidemics with Differential Susceptibility and Asymptomatic Patients Using Computer Algebra

    Science.gov (United States)

    Saldarriaga Vargas, Clarita

    When there are diseases affecting large populations where the social, economic and cultural diversity is significant within the same region, the biological parameters that determine the behavior of the dispersion disease analysis are affected by the selection of different individuals. Therefore and because of the variety and magnitude of the communities at risk of contracting dengue disease around all over the world, suggest defining differentiated populations with individual contributions in the results of the dispersion dengue disease analysis. In this paper those conditions were taken in account when several epidemiologic models were analyzed. Initially a stability analysis was done for a SEIR mathematical model of Dengue disease without differential susceptibility. Both free disease and endemic equilibrium states were found in terms of the basic reproduction number and were defined in the Theorem (3.1). Then a DSEIR model was solved when a new susceptible group was introduced to consider the effects of important biological parameters of non-homogeneous populations in the spreading analysis. The results were compiled in the Theorem (3.2). Finally Theorems (3.3) and (3.4) resumed the basic reproduction numbers for three and n different susceptible groups respectively, giving an idea of how differential susceptibility affects the equilibrium states. The computations were done using an algorithmic method implemented in Maple 11, a general-purpose computer algebra system.

  20. Essential numerical computer methods

    CERN Document Server

    Johnson, Michael L

    2010-01-01

    The use of computers and computational methods has become ubiquitous in biological and biomedical research. During the last 2 decades most basic algorithms have not changed, but what has is the huge increase in computer speed and ease of use, along with the corresponding orders of magnitude decrease in cost. A general perception exists that the only applications of computers and computer methods in biological and biomedical research are either basic statistical analysis or the searching of DNA sequence data bases. While these are important applications they only scratch the surface of the current and potential applications of computers and computer methods in biomedical research. The various chapters within this volume include a wide variety of applications that extend far beyond this limited perception. As part of the Reliable Lab Solutions series, Essential Numerical Computer Methods brings together chapters from volumes 210, 240, 321, 383, 384, 454, and 467 of Methods in Enzymology. These chapters provide ...

  1. INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra"

    CERN Document Server

    Delucchi, Emanuele; Moci, Luca

    2015-01-01

    Combinatorics plays a prominent role in contemporary mathematics, due to the vibrant development it has experienced in the last two decades and its many interactions with other subjects. This book arises from the INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra,'' which was held in Cortona in September 2013. The event brought together emerging and leading researchers at the crossroads of Combinatorics, Topology and Algebra, with a particular focus on new trends in subjects such as: hyperplane arrangements; discrete geometry and combinatorial topology; polytope theory and triangulations of manifolds; combinatorial algebraic geometry and commutative algebra; algebraic combinatorics; and combinatorial representation theory. The book is divided into two parts. The first expands on the topics discussed at the conference by providing additional background and explanations, while the second presents original contributions on new trends in the topics addressed by the conference.

  2. Non commutative geometry methods for group C{sup *}-algebras

    Energy Technology Data Exchange (ETDEWEB)

    Diep, Do Ngoc

    1996-09-01

    This book is intended to provide a quick introduction to the subject. The exposition is scheduled in the sequence, as possible for more understanding for beginners. The author exposed a K-theoretic approach to study group C{sup *}-algebras: started in the elementary part, with one example of description of the structure of C{sup *}-algebra of the group of affine transformations of the real straight line, continued then for some special classes of solvable and nilpotent Lie groups. In the second advanced part, he introduced the main tools of the theory. In particular, the conception of multidimensional geometric quantization and the index of group C{sup *}-algebras were created and developed. (author). Refs.

  3. Algebraic coarsening methods for linear and nonlinear PDE and systems

    International Nuclear Information System (INIS)

    McWilliams, J C

    2000-01-01

    In [l] Brandt describes a general approach for algebraic coarsening. Given fine-grid equations and a prescribed relaxation method, an approach is presented for defining both the coarse-grid variables and the coarse-grid equations corresponding to these variables. Although, these two tasks are not necessarily related (and, indeed, are often performed independently and with distinct techniques) in the approaches of [1] both revolve around the same underlying observation. To determine whether a given set of coarse-grid variables is appropriate it is suggested that one should employ compatible relaxation. This is a generalization of so-called F-relaxation (e.g., [2]). Suppose that the coarse-grid variables are defined as a subset of the fine-grid variables. Then, F-relaxation simply means relaxing only the F-variables (i.e., fine-grid variables that do not correspond to coarse-grid variables), while leaving the remaining fine-grid variables (C-variables) unchanged. The generalization of compatible relaxation is in allowing the coarse-grid variables to be defined differently, say as linear combinations of fine-grid variables, or even nondeterministically (see examples in [1]). For the present summary it suffices to consider the simple case. The central observation regarding the set of coarse-grid variables is the following [1]: Observation 1--A general measure for the quality of the set of coarse-grid variables is the convergence rate of compatible relaxation. The conclusion is that a necessary condition for efficient multigrid solution (e.g., with convergence rates independent of problem size) is that the compatible-relaxation convergence be bounded away from 1, independently of the number of variables. This is often a sufficient condition, provided that the coarse-grid equations are sufficiently accurate. Therefore, it is suggested in [1] that the convergence rate of compatible relaxation should be used as a criterion for choosing and evaluating the set of coarse

  4. Computer-aided tool for the teaching of relational algebra in data base courses

    Directory of Open Access Journals (Sweden)

    Johnny Villalobos Murillo

    2016-03-01

    Full Text Available This article describes the design and implementation of computer-aided tool called Relational Algebra Translator (RAT in data base courses, for the teaching of relational algebra. There was a problem when introducing the relational algebra topic in the course EIF 211 Design and Implementation of Databases, which belongs to the career of Engineering in Information Systems of the National University of Costa Rica, because students attending this course were lacking profound mathematical knowledge, which led to a learning problem, being this an important subject to understand what the data bases search and request do RAT comes along to enhance the teaching-learning process. It introduces the architectural and design principles required for its implementation, such as: the language symbol table, the gramatical rules and the basic algorithms that RAT uses to translate from relational algebra to SQL language. This tool has been used for one periods and has demonstrated to be effective in the learning-teaching process.  This urged investigators to publish it in the web site: www.slinfo.una.ac.cr in order for this tool to be used in other university courses.

  5. Computational efficiency for the surface renewal method

    Science.gov (United States)

    Kelley, Jason; Higgins, Chad

    2018-04-01

    Measuring surface fluxes using the surface renewal (SR) method requires programmatic algorithms for tabulation, algebraic calculation, and data quality control. A number of different methods have been published describing automated calibration of SR parameters. Because the SR method utilizes high-frequency (10 Hz+) measurements, some steps in the flux calculation are computationally expensive, especially when automating SR to perform many iterations of these calculations. Several new algorithms were written that perform the required calculations more efficiently and rapidly, and that tested for sensitivity to length of flux averaging period, ability to measure over a large range of lag timescales, and overall computational efficiency. These algorithms utilize signal processing techniques and algebraic simplifications that demonstrate simple modifications that dramatically improve computational efficiency. The results here complement efforts by other authors to standardize a robust and accurate computational SR method. Increased speed of computation time grants flexibility to implementing the SR method, opening new avenues for SR to be used in research, for applied monitoring, and in novel field deployments.

  6. An algebraic approach to the scattering equations

    Energy Technology Data Exchange (ETDEWEB)

    Huang, Rijun; Rao, Junjie [Zhejiang Institute of Modern Physics, Zhejiang University,Hangzhou, 310027 (China); Feng, Bo [Zhejiang Institute of Modern Physics, Zhejiang University,Hangzhou, 310027 (China); Center of Mathematical Science, Zhejiang University,Hangzhou, 310027 (China); He, Yang-Hui [School of Physics, NanKai University,Tianjin, 300071 (China); Department of Mathematics, City University,London, EC1V 0HB (United Kingdom); Merton College, University of Oxford,Oxford, OX14JD (United Kingdom)

    2015-12-10

    We employ the so-called companion matrix method from computational algebraic geometry, tailored for zero-dimensional ideals, to study the scattering equations. The method renders the CHY-integrand of scattering amplitudes computable using simple linear algebra and is amenable to an algorithmic approach. Certain identities in the amplitudes as well as rationality of the final integrand become immediate in this formalism.

  7. An algebraic approach to the scattering equations

    International Nuclear Information System (INIS)

    Huang, Rijun; Rao, Junjie; Feng, Bo; He, Yang-Hui

    2015-01-01

    We employ the so-called companion matrix method from computational algebraic geometry, tailored for zero-dimensional ideals, to study the scattering equations. The method renders the CHY-integrand of scattering amplitudes computable using simple linear algebra and is amenable to an algorithmic approach. Certain identities in the amplitudes as well as rationality of the final integrand become immediate in this formalism.

  8. Elementary and advanced Lie algebraic methods with applications to accelerator design, electron microscopes, and light optics

    International Nuclear Information System (INIS)

    Dragt, A.J.

    1987-01-01

    A review is given of elementary Lie algebraic methods for treating Hamiltonian systems. This review is followed by a brief exposition of advanced Lie algebraic methods including resonance bases and conjugacy theorems. Finally, applications are made to the design of third-order achromats for use in accelerators, to the design of subangstroem resolution electron microscopes, and to the classification and study of high order aberrations in light optics. (orig.)

  9. GRG computer algebra system in gravitation and general relativity theory

    International Nuclear Information System (INIS)

    Zhitnikov, V.V.; Obukhova, I.G.

    1985-01-01

    The main concepts and capabilities of the GRG specialized computer agebra system intended for performing calculations in the gravitation theory are described. The GRG system is written in the STANDARD LISP language. The program consists of two parts: the first one - for setting initial data, the second one - for specifying a consequence of calculations. The system can function in three formalisms: a coordinate, a tetradic with the Lorentz basis and a spinor ones. The major capabilities of the GRG system are the following: calculation of connectivity and curvature according to the specified metrics, tetrad and torsion; metric type determination according to Petrov; calculation of the Bianchi indentities; operation with an electromagnetic field; tetradic rotations; coordinate conversions

  10. Development process of in-service training intended for teachers to perform teaching of mathematics with computer algebra systems

    Science.gov (United States)

    Ardıç, Mehmet Alper; Işleyen, Tevfik

    2018-01-01

    In this study, we deal with the development process of in-service training activities designed in order for mathematics teachers of secondary education to realize teaching of mathematics, utilizing computer algebra systems. In addition, the results obtained from the researches carried out during and after the in-service training were summarized. Last section focuses on suggestions any teacher can use to carry out activities aimed at using computer algebra systems in teaching environments.

  11. Recent Developments in Complex Analysis and Computer Algebra

    CERN Document Server

    Kajiwara, Joji; Xu, Yongzhi

    1999-01-01

    This volume consists of papers presented in the special sessions on "Complex and Numerical Analysis", "Value Distribution Theory and Complex Domains", and "Use of Symbolic Computation in Mathematics Education" of the ISAAC'97 Congress held at the University of Delaware, during June 2-7, 1997. The ISAAC Congress coincided with a U.S.-Japan Seminar also held at the University of Delaware. The latter was supported by the National Science Foundation through Grant INT-9603029 and the Japan Society for the Promotion of Science through Grant MTCS-134. It was natural that the participants of both meetings should interact and consequently several persons attending the Congress also presented papers in the Seminar. The success of the ISAAC Congress and the U.S.-Japan Seminar has led to the ISAAC'99 Congress being held in Fukuoka, Japan during August 1999. Many of the same participants will return to this Seminar. Indeed, it appears that the spirit of the U.S.-Japan Seminar will be continued every second year as part of...

  12. Hom-Novikov algebras

    International Nuclear Information System (INIS)

    Yau, Donald

    2011-01-01

    We study a twisted generalization of Novikov algebras, called Hom-Novikov algebras, in which the two defining identities are twisted by a linear map. It is shown that Hom-Novikov algebras can be obtained from Novikov algebras by twisting along any algebra endomorphism. All algebra endomorphisms on complex Novikov algebras of dimensions 2 or 3 are computed, and their associated Hom-Novikov algebras are described explicitly. Another class of Hom-Novikov algebras is constructed from Hom-commutative algebras together with a derivation, generalizing a construction due to Dorfman and Gel'fand. Two other classes of Hom-Novikov algebras are constructed from Hom-Lie algebras together with a suitable linear endomorphism, generalizing a construction due to Bai and Meng.

  13. Computational Methods and Function Theory

    CERN Document Server

    Saff, Edward; Salinas, Luis; Varga, Richard

    1990-01-01

    The volume is devoted to the interaction of modern scientific computation and classical function theory. Many problems in pure and more applied function theory can be tackled using modern computing facilities: numerically as well as in the sense of computer algebra. On the other hand, computer algorithms are often based on complex function theory, and dedicated research on their theoretical foundations can lead to great enhancements in performance. The contributions - original research articles, a survey and a collection of problems - cover a broad range of such problems.

  14. Donaldson invariants in algebraic geometry

    International Nuclear Information System (INIS)

    Goettsche, L.

    2000-01-01

    In these lectures I want to give an introduction to the relation of Donaldson invariants with algebraic geometry: Donaldson invariants are differentiable invariants of smooth compact 4-manifolds X, defined via moduli spaces of anti-self-dual connections. If X is an algebraic surface, then these moduli spaces can for a suitable choice of the metric be identified with moduli spaces of stable vector bundles on X. This can be used to compute Donaldson invariants via methods of algebraic geometry and has led to a lot of activity on moduli spaces of vector bundles and coherent sheaves on algebraic surfaces. We will first recall the definition of the Donaldson invariants via gauge theory. Then we will show the relation between moduli spaces of anti-self-dual connections and moduli spaces of vector bundles on algebraic surfaces, and how this makes it possible to compute Donaldson invariants via algebraic geometry methods. Finally we concentrate on the case that the number b + of positive eigenvalues of the intersection form on the second homology of the 4-manifold is 1. In this case the Donaldson invariants depend on the metric (or in the algebraic geometric case on the polarization) via a system of walls and chambers. We will study the change of the invariants under wall-crossing, and use this in particular to compute the Donaldson invariants of rational algebraic surfaces. (author)

  15. Data identification for improving gene network inference using computational algebra.

    Science.gov (United States)

    Dimitrova, Elena; Stigler, Brandilyn

    2014-11-01

    Identification of models of gene regulatory networks is sensitive to the amount of data used as input. Considering the substantial costs in conducting experiments, it is of value to have an estimate of the amount of data required to infer the network structure. To minimize wasted resources, it is also beneficial to know which data are necessary to identify the network. Knowledge of the data and knowledge of the terms in polynomial models are often required a priori in model identification. In applications, it is unlikely that the structure of a polynomial model will be known, which may force data sets to be unnecessarily large in order to identify a model. Furthermore, none of the known results provides any strategy for constructing data sets to uniquely identify a model. We provide a specialization of an existing criterion for deciding when a set of data points identifies a minimal polynomial model when its monomial terms have been specified. Then, we relax the requirement of the knowledge of the monomials and present results for model identification given only the data. Finally, we present a method for constructing data sets that identify minimal polynomial models.

  16. Three-dimensional forward modeling of DC resistivity using the aggregation-based algebraic multigrid method

    Science.gov (United States)

    Chen, Hui; Deng, Ju-Zhi; Yin, Min; Yin, Chang-Chun; Tang, Wen-Wu

    2017-03-01

    To speed up three-dimensional (3D) DC resistivity modeling, we present a new multigrid method, the aggregation-based algebraic multigrid method (AGMG). We first discretize the differential equation of the secondary potential field with mixed boundary conditions by using a seven-point finite-difference method to obtain a large sparse system of linear equations. Then, we introduce the theory behind the pairwise aggregation algorithms for AGMG and use the conjugate-gradient method with the V-cycle AGMG preconditioner (AGMG-CG) to solve the linear equations. We use typical geoelectrical models to test the proposed AGMG-CG method and compare the results with analytical solutions and the 3DDCXH algorithm for 3D DC modeling (3DDCXH). In addition, we apply the AGMG-CG method to different grid sizes and geoelectrical models and compare it to different iterative methods, such as ILU-BICGSTAB, ILU-GCR, and SSOR-CG. The AGMG-CG method yields nearly linearly decreasing errors, whereas the number of iterations increases slowly with increasing grid size. The AGMG-CG method is precise and converges fast, and thus can improve the computational efficiency in forward modeling of three-dimensional DC resistivity.

  17. Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

    Science.gov (United States)

    Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

    2014-06-26

    A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for

  18. The current algebra on the circle as a germ of local field theories

    International Nuclear Information System (INIS)

    Buchholz, D.; Mack, G.; Todorov, I.; Bylgarska Akademiya na Naukite, Sofia. Inst. za Yadrena Izsledvaniya i Yadrena Energetika)

    1988-01-01

    Methods of algebraic quantum field theory are used to classify all field- and observable algebras, whose common germ is the U(1)-current algebra. An elementary way is described to compute characters of such algebras. It exploits the Kubo-Martin-Schwinger condition for Gibbs states. (orig.)

  19. A Numerical Method for Partial Differential Algebraic Equations Based on Differential Transform Method

    Directory of Open Access Journals (Sweden)

    Murat Osmanoglu

    2013-01-01

    Full Text Available We have considered linear partial differential algebraic equations (LPDAEs of the form , which has at least one singular matrix of . We have first introduced a uniform differential time index and a differential space index. The initial conditions and boundary conditions of the given system cannot be prescribed for all components of the solution vector here. To overcome this, we introduced these indexes. Furthermore, differential transform method has been given to solve LPDAEs. We have applied this method to a test problem, and numerical solution of the problem has been compared with analytical solution.

  20. The Effect of the Math Emporium Instructional Method on Students' Performance in College Algebra

    Science.gov (United States)

    Cousins-Cooper, Kathy; Staley, Katrina N.; Kim, Seongtae; Luke, Nicholas S.

    2017-01-01

    This study aims to investigate the effectiveness of the Emporium instructional method in a course of college algebra and trigonometry by comparing to the traditional lecture method. The math emporium method is a nontraditional instructional method of learning math that has been implemented at several universities with much success and has been…

  1. Computer programs for the solution of systems of linear algebraic equations

    Science.gov (United States)

    Sequi, W. T.

    1973-01-01

    FORTRAN subprograms for the solution of systems of linear algebraic equations are described, listed, and evaluated in this report. Procedures considered are direct solution, iteration, and matrix inversion. Both incore methods and those which utilize auxiliary data storage devices are considered. Some of the subroutines evaluated require the entire coefficient matrix to be in core, whereas others account for banding or sparceness of the system. General recommendations relative to equation solving are made, and on the basis of tests, specific subprograms are recommended.

  2. An automatic formulation of inverse free second moment method for algebraic systems

    International Nuclear Information System (INIS)

    Shakshuki, Elhadi; Ponnambalam, Kumaraswamy

    2002-01-01

    In systems with probabilistic uncertainties, an estimation of reliability requires at least the first two moments. In this paper, we focus on probabilistic analysis of linear systems. The important tasks in this analysis are the formulation and the automation of the moment equations. The main objective of the formulation is to provide at least means and variances of the output variables with at least a second-order accuracy. The objective of the automation is to reduce the storage and computational complexities required for implementing (automating) those formulations. This paper extends the recent work done to calculate the first two moments of a set of random algebraic linear equations by developing a stamping procedure to facilitate its automation. The new method has an additional advantage of being able to solve problems when the mean matrix of a system is singular. Lastly, from storage and computational complexities and accuracy point of view, a comparison between the new method and another recently developed first order second moment method is made with numerical examples

  3. 3D algebraic iterative reconstruction for cone-beam x-ray differential phase-contrast computed tomography.

    Science.gov (United States)

    Fu, Jian; Hu, Xinhua; Velroyen, Astrid; Bech, Martin; Jiang, Ming; Pfeiffer, Franz

    2015-01-01

    Due to the potential of compact imaging systems with magnified spatial resolution and contrast, cone-beam x-ray differential phase-contrast computed tomography (DPC-CT) has attracted significant interest. The current proposed FDK reconstruction algorithm with the Hilbert imaginary filter will induce severe cone-beam artifacts when the cone-beam angle becomes large. In this paper, we propose an algebraic iterative reconstruction (AIR) method for cone-beam DPC-CT and report its experiment results. This approach considers the reconstruction process as the optimization of a discrete representation of the object function to satisfy a system of equations that describes the cone-beam DPC-CT imaging modality. Unlike the conventional iterative algorithms for absorption-based CT, it involves the derivative operation to the forward projections of the reconstructed intermediate image to take into account the differential nature of the DPC projections. This method is based on the algebraic reconstruction technique, reconstructs the image ray by ray, and is expected to provide better derivative estimates in iterations. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured with a three-grating interferometer and a mini-focus x-ray tube source. It is shown that the proposed method can reduce the cone-beam artifacts and performs better than FDK under large cone-beam angles. This algorithm is of interest for future cone-beam DPC-CT applications.

  4. Supersymmetry algebra cohomology. I. Definition and general structure

    International Nuclear Information System (INIS)

    Brandt, Friedemann

    2010-01-01

    This paper concerns standard supersymmetry algebras in diverse dimensions, involving bosonic translational generators and fermionic supersymmetry generators. A cohomology related to these supersymmetry algebras, termed supersymmetry algebra cohomology, and corresponding 'primitive elements' are defined by means of a BRST (Becchi-Rouet-Stora-Tyutin)-type coboundary operator. A method to systematically compute this cohomology is outlined and illustrated by simple examples.

  5. An Algebraic Method of Synchronous Pulsewidth Modulation for Converters for Adjustable Speed Drives

    DEFF Research Database (Denmark)

    Oleschuk, Valentin; Blaabjerg, Frede

    2002-01-01

    This paper describes the basic peculiarities of a new method of feedforward synchronous pulsewidth modulation (PWM) of the output voltage of converters, based on one-stage closed-form strategy of PWM with pure algebraic control dependencies. It is applied to voltage source inverters with a contin......This paper describes the basic peculiarities of a new method of feedforward synchronous pulsewidth modulation (PWM) of the output voltage of converters, based on one-stage closed-form strategy of PWM with pure algebraic control dependencies. It is applied to voltage source inverters...... with a continuous scheme of conventional voltage space vector modulation and with two basic variants of symmetrical discontinuous PWM. Simulations give the behaviour of the proposed method and show the advantage of algebraic synchronous PWM compared with the typical asynchronous, for low indices of the frequency...

  6. Calculations of time-of-flight aberrations in practical electrostatic electron lenses using the differential algebraic method

    International Nuclear Information System (INIS)

    Kang, Yongfeng; Zhao, Jingyi; Tang, Tiantong

    2013-01-01

    The high order time-of-flight (TOF) aberrations in a practical electrostatic electron lens are calculated using the differential algebraic (DA) method. The electrostatic fields of the electrostatic lens, which are calculated by the FEM methods, are in the form of discrete arrays. Thus, the proposed DA method is applicable for engineering designs, and programs are written to compute up to fifth order TOF aberrations of practical electrostatic electron lenses. An example is given, and TOF aberrations up to the fifth order are calculated. It is proven that the numerical results for the electrostatic fields in the form of discrete arrays have a good accuracy compared with the theoretical solutions. The accuracy is limited only by the accuracy of the numerical computation of the fields and the numerical computation algorithms for interpolation and integration. Finally, a practical electrostatic electron lens is analysed and discussed as an example.

  7. Non-asymptotic fractional order differentiators via an algebraic parametric method

    KAUST Repository

    Liu, Dayan

    2012-08-01

    Recently, Mboup, Join and Fliess [27], [28] introduced non-asymptotic integer order differentiators by using an algebraic parametric estimation method [7], [8]. In this paper, in order to obtain non-asymptotic fractional order differentiators we apply this algebraic parametric method to truncated expansions of fractional Taylor series based on the Jumarie\\'s modified Riemann-Liouville derivative [14]. Exact and simple formulae for these differentiators are given where a sliding integration window of a noisy signal involving Jacobi polynomials is used without complex mathematical deduction. The efficiency and the stability with respect to corrupting noises of the proposed fractional order differentiators are shown in numerical simulations. © 2012 IEEE.

  8. Non-asymptotic fractional order differentiators via an algebraic parametric method

    KAUST Repository

    Liu, Dayan; Gibaru, O.; Perruquetti, Wilfrid

    2012-01-01

    Recently, Mboup, Join and Fliess [27], [28] introduced non-asymptotic integer order differentiators by using an algebraic parametric estimation method [7], [8]. In this paper, in order to obtain non-asymptotic fractional order differentiators we apply this algebraic parametric method to truncated expansions of fractional Taylor series based on the Jumarie's modified Riemann-Liouville derivative [14]. Exact and simple formulae for these differentiators are given where a sliding integration window of a noisy signal involving Jacobi polynomials is used without complex mathematical deduction. The efficiency and the stability with respect to corrupting noises of the proposed fractional order differentiators are shown in numerical simulations. © 2012 IEEE.

  9. A direct algebraic method applied to obtain complex solutions of some nonlinear partial differential equations

    International Nuclear Information System (INIS)

    Zhang Huiqun

    2009-01-01

    By using some exact solutions of an auxiliary ordinary differential equation, a direct algebraic method is described to construct the exact complex solutions for nonlinear partial differential equations. The method is implemented for the NLS equation, a new Hamiltonian amplitude equation, the coupled Schrodinger-KdV equations and the Hirota-Maccari equations. New exact complex solutions are obtained.

  10. The Model Method: Singapore Children's Tool for Representing and Solving Algebraic Word Problems

    Science.gov (United States)

    Ng, Swee Fong; Lee, Kerry

    2009-01-01

    Solving arithmetic and algebraic word problems is a key component of the Singapore elementary mathematics curriculum. One heuristic taught, the model method, involves drawing a diagram to represent key information in the problem. We describe the model method and a three-phase theoretical framework supporting its use. We conducted 2 studies to…

  11. Schwarz maps of algebraic linear ordinary differential equations

    Science.gov (United States)

    Sanabria Malagón, Camilo

    2017-12-01

    A linear ordinary differential equation is called algebraic if all its solution are algebraic over its field of definition. In this paper we solve the problem of finding closed form solution to algebraic linear ordinary differential equations in terms of standard equations. Furthermore, we obtain a method to compute all algebraic linear ordinary differential equations with rational coefficients by studying their associated Schwarz map through the Picard-Vessiot Theory.

  12. An algebraic approach to linear-optical schemes for deterministic quantum computing

    International Nuclear Information System (INIS)

    Aniello, Paolo; Cagli, Ruben Coen

    2005-01-01

    Linear-optical passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the algebraic structure of LOP transformations and quantum computing. We first show how to decompose the Fock space of N optical modes in finite-dimensional subspaces that are suitable for encoding strings of qubits and invariant under LOP transformations (these subspaces are related to the spaces of irreducible unitary representations of U (N). Next we show how to design in algorithmic fashion LOP circuits which implement any quantum circuit deterministically. We also present some simple examples, such as the circuits implementing a cNOT gate and a Bell state generator/analyser

  13. Open algebraic surfaces

    CERN Document Server

    Miyanishi, Masayoshi

    2000-01-01

    Open algebraic surfaces are a synonym for algebraic surfaces that are not necessarily complete. An open algebraic surface is understood as a Zariski open set of a projective algebraic surface. There is a long history of research on projective algebraic surfaces, and there exists a beautiful Enriques-Kodaira classification of such surfaces. The research accumulated by Ramanujan, Abhyankar, Moh, and Nagata and others has established a classification theory of open algebraic surfaces comparable to the Enriques-Kodaira theory. This research provides powerful methods to study the geometry and topology of open algebraic surfaces. The theory of open algebraic surfaces is applicable not only to algebraic geometry, but also to other fields, such as commutative algebra, invariant theory, and singularities. This book contains a comprehensive account of the theory of open algebraic surfaces, as well as several applications, in particular to the study of affine surfaces. Prerequisite to understanding the text is a basic b...

  14. EXACT SOLITARY WAVE SOLUTIONS TO A CLASS OF NONLINEAR DIFFERENTIAL EQUATIONS USING DIRECT ALGEBRAIC METHOD

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Using direct algebraic method,exact solitary wave solutions are performed for a class of third order nonlinear dispersive disipative partial differential equations. These solutions are obtained under certain conditions for the relationship between the coefficients of the equation. The exact solitary waves of this class are rational functions of real exponentials of kink-type solutions.

  15. High-Speed Computation of the Kleene Star in Max-Plus Algebraic System Using a Cell Broadband Engine

    Science.gov (United States)

    Goto, Hiroyuki

    This research addresses a high-speed computation method for the Kleene star of the weighted adjacency matrix in a max-plus algebraic system. We focus on systems whose precedence constraints are represented by a directed acyclic graph and implement it on a Cell Broadband Engine™ (CBE) processor. Since the resulting matrix gives the longest travel times between two adjacent nodes, it is often utilized in scheduling problem solvers for a class of discrete event systems. This research, in particular, attempts to achieve a speedup by using two approaches: parallelization and SIMDization (Single Instruction, Multiple Data), both of which can be accomplished by a CBE processor. The former refers to a parallel computation using multiple cores, while the latter is a method whereby multiple elements are computed by a single instruction. Using the implementation on a Sony PlayStation 3™ equipped with a CBE processor, we found that the SIMDization is effective regardless of the system's size and the number of processor cores used. We also found that the scalability of using multiple cores is remarkable especially for systems with a large number of nodes. In a numerical experiment where the number of nodes is 2000, we achieved a speedup of 20 times compared with the method without the above techniques.

  16. Helmholtz algebraic solitons

    Energy Technology Data Exchange (ETDEWEB)

    Christian, J M; McDonald, G S [Joule Physics Laboratory, School of Computing, Science and Engineering, Materials and Physics Research Centre, University of Salford, Salford M5 4WT (United Kingdom); Chamorro-Posada, P, E-mail: j.christian@salford.ac.u [Departamento de Teoria de la Senal y Comunicaciones e Ingenieria Telematica, Universidad de Valladolid, ETSI Telecomunicacion, Campus Miguel Delibes s/n, 47011 Valladolid (Spain)

    2010-02-26

    We report, to the best of our knowledge, the first exact analytical algebraic solitons of a generalized cubic-quintic Helmholtz equation. This class of governing equation plays a key role in photonics modelling, allowing a full description of the propagation and interaction of broad scalar beams. New conservation laws are presented, and the recovery of paraxial results is discussed in detail. The stability properties of the new solitons are investigated by combining semi-analytical methods and computer simulations. In particular, new general stability regimes are reported for algebraic bright solitons.

  17. Helmholtz algebraic solitons

    International Nuclear Information System (INIS)

    Christian, J M; McDonald, G S; Chamorro-Posada, P

    2010-01-01

    We report, to the best of our knowledge, the first exact analytical algebraic solitons of a generalized cubic-quintic Helmholtz equation. This class of governing equation plays a key role in photonics modelling, allowing a full description of the propagation and interaction of broad scalar beams. New conservation laws are presented, and the recovery of paraxial results is discussed in detail. The stability properties of the new solitons are investigated by combining semi-analytical methods and computer simulations. In particular, new general stability regimes are reported for algebraic bright solitons.

  18. The Virasoro algebra in integrable hierarchies and the method of matrix models

    International Nuclear Information System (INIS)

    Semikhatov, A.M.

    1992-01-01

    The action of the Virasoro algebra on hierarchies of nonlinear integrable equations, and also the structure and consequences of Virasoro constraints on these hierarchies, are studied. It is proposed that a broad class of hierarchies, restricted by Virasoro constraints, can be defined in terms of dressing operators hidden in the structure of integrable systems. The Virasoro-algebra representation constructed on the dressing operators displays a number of analogies with structures in conformal field theory. The formulation of the Virasoro constraints that stems from this representation makes it possible to translate into the language of integrable systems a number of concepts from the method of the 'matrix models' that describe nonperturbative quantum gravity, and, in particular, to realize a 'hierarchical' version of the double scaling limit. From the Virasoro constraints written in terms of the dressing operators generalized loop equations are derived, and this makes it possible to do calculations on a reconstruction of the field-theoretical description. The reduction of the Kadomtsev-Petviashvili (KP) hierarchy, subject to Virasoro constraints, to generalized Korteweg-deVries (KdV) hierarchies is implemented, and the corresponding representation of the Virasoro algebra on these hierarchies is found both in the language of scalar differential operators and in the matrix formalism of Drinfel'd and Sokolov. The string equation in the matrix formalism does not replicate the structure of the scalar string equation. The symmetry algebras of the KP and N-KdV hierarchies restricted by Virasoro constraints are calculated: A relationship is established with algebras from the family W ∞ (J) of infinite W-algebras

  19. An algebraic method to develop well-posed PML models Absorbing layers, perfectly matched layers, linearized Euler equations

    International Nuclear Information System (INIS)

    Rahmouni, Adib N.

    2004-01-01

    In 1994, Berenger [Journal of Computational Physics 114 (1994) 185] proposed a new layer method: perfectly matched layer, PML, for electromagnetism. This new method is based on the truncation of the computational domain by a layer which absorbs waves regardless of their frequency and angle of incidence. Unfortunately, the technique proposed by Berenger (loc. cit.) leads to a system which has lost the most important properties of the original one: strong hyperbolicity and symmetry. We present in this paper an algebraic technique leading to well-known PML model [IEEE Transactions on Antennas and Propagation 44 (1996) 1630] for the linearized Euler equations, strongly well-posed, preserving the advantages of the initial method, and retaining symmetry. The technique proposed in this paper can be extended to various hyperbolic problems

  20. Alternative algebraic approaches in quantum chemistry

    International Nuclear Information System (INIS)

    Mezey, Paul G.

    2015-01-01

    Various algebraic approaches of quantum chemistry all follow a common principle: the fundamental properties and interrelations providing the most essential features of a quantum chemical representation of a molecule or a chemical process, such as a reaction, can always be described by algebraic methods. Whereas such algebraic methods often provide precise, even numerical answers, nevertheless their main role is to give a framework that can be elaborated and converted into computational methods by involving alternative mathematical techniques, subject to the constraints and directions provided by algebra. In general, algebra describes sets of interrelations, often phrased in terms of algebraic operations, without much concern with the actual entities exhibiting these interrelations. However, in many instances, the very realizations of two, seemingly unrelated algebraic structures by actual quantum chemical entities or properties play additional roles, and unexpected connections between different algebraic structures are often giving new insight. Here we shall be concerned with two alternative algebraic structures: the fundamental group of reaction mechanisms, based on the energy-dependent topology of potential energy surfaces, and the interrelations among point symmetry groups for various distorted nuclear arrangements of molecules. These two, distinct algebraic structures provide interesting interrelations, which can be exploited in actual studies of molecular conformational and reaction processes. Two relevant theorems will be discussed

  1. Alternative algebraic approaches in quantum chemistry

    Energy Technology Data Exchange (ETDEWEB)

    Mezey, Paul G., E-mail: paul.mezey@gmail.com [Canada Research Chair in Scientific Modeling and Simulation, Department of Chemistry and Department of Physics and Physical Oceanography, Memorial University of Newfoundland, 283 Prince Philip Drive, St. John' s, NL A1B 3X7 (Canada)

    2015-01-22

    Various algebraic approaches of quantum chemistry all follow a common principle: the fundamental properties and interrelations providing the most essential features of a quantum chemical representation of a molecule or a chemical process, such as a reaction, can always be described by algebraic methods. Whereas such algebraic methods often provide precise, even numerical answers, nevertheless their main role is to give a framework that can be elaborated and converted into computational methods by involving alternative mathematical techniques, subject to the constraints and directions provided by algebra. In general, algebra describes sets of interrelations, often phrased in terms of algebraic operations, without much concern with the actual entities exhibiting these interrelations. However, in many instances, the very realizations of two, seemingly unrelated algebraic structures by actual quantum chemical entities or properties play additional roles, and unexpected connections between different algebraic structures are often giving new insight. Here we shall be concerned with two alternative algebraic structures: the fundamental group of reaction mechanisms, based on the energy-dependent topology of potential energy surfaces, and the interrelations among point symmetry groups for various distorted nuclear arrangements of molecules. These two, distinct algebraic structures provide interesting interrelations, which can be exploited in actual studies of molecular conformational and reaction processes. Two relevant theorems will be discussed.

  2. Wavelets and quantum algebras

    International Nuclear Information System (INIS)

    Ludu, A.; Greiner, M.

    1995-09-01

    A non-linear associative algebra is realized in terms of translation and dilation operators, and a wavelet structure generating algebra is obtained. We show that this algebra is a q-deformation of the Fourier series generating algebra, and reduces to this for certain value of the deformation parameter. This algebra is also homeomorphic with the q-deformed su q (2) algebra and some of its extensions. Through this algebraic approach new methods for obtaining the wavelets are introduced. (author). 20 refs

  3. Research Progress in Mathematical Analysis of Map Projection by Computer Algebra

    Directory of Open Access Journals (Sweden)

    BIAN Shaofeng

    2017-10-01

    Full Text Available Map projection is an important component of modern cartography, and involves many fussy mathematical analysis processes, such as the power series expansions of elliptical functions, differential of complex and implicit functions, elliptical integral and the operation of complex numbers. The derivation of these problems by hand not only consumes much time and energy but also makes mistake easily, and sometimes can not be realized at all because of the impossible complexity. The research achievements in mathematical analysis of map projection by computer algebra are systematically reviewed in five aspects, i.e., the symbolic expressions of forward and inverse solution of ellipsoidal latitudes, the direct transformations between map projections with different distortion properties, expressions of Gauss projection by complex function, mathematical analysis of oblique Mercator projection, polar chart projection with its transformation. Main problems that need to be further solved in this research field are analyzed. It will be helpful to promote the development of map projection.

  4. Instructional Supports for Representational Fluency in Solving Linear Equations with Computer Algebra Systems and Paper-and-Pencil

    Science.gov (United States)

    Fonger, Nicole L.; Davis, Jon D.; Rohwer, Mary Lou

    2018-01-01

    This research addresses the issue of how to support students' representational fluency--the ability to create, move within, translate across, and derive meaning from external representations of mathematical ideas. The context of solving linear equations in a combined computer algebra system (CAS) and paper-and-pencil classroom environment is…

  5. Efficient computation method of Jacobian matrix

    International Nuclear Information System (INIS)

    Sasaki, Shinobu

    1995-05-01

    As well known, the elements of the Jacobian matrix are complex trigonometric functions of the joint angles, resulting in a matrix of staggering complexity when we write it all out in one place. This article addresses that difficulties to this subject are overcome by using velocity representation. The main point is that its recursive algorithm and computer algebra technologies allow us to derive analytical formulation with no human intervention. Particularly, it is to be noted that as compared to previous results the elements are extremely simplified throughout the effective use of frame transformations. Furthermore, in case of a spherical wrist, it is shown that the present approach is computationally most efficient. Due to such advantages, the proposed method is useful in studying kinematically peculiar properties such as singularity problems. (author)

  6. Lukasiewicz-Moisil algebras

    CERN Document Server

    Boicescu, V; Georgescu, G; Rudeanu, S

    1991-01-01

    The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz. The theory of LM-algebras has developed to a considerable extent both as an algebraic theory of intrinsic interest and in view of its applications to logic and switching theory.This book gives an overview of the theory, comprising both classical results and recent contributions, including those of the authors. N-valued and &THgr;-valued algebras are presented, as well as &THgr;-algebras with negation.Mathematicians interested in lattice theory or symbolic logic, and computer scientists, will find in this monograph stimulating material for further research.

  7. Algebraic classification of the conformal tensor

    International Nuclear Information System (INIS)

    Ares de Parga, Gonzalo; Chavoya, O.; Lopez B, J.L.; Ovando Z, Gerardo

    1989-01-01

    Starting from the Petrov matrix method, we deduce a new algorithm (adaptable to computers), within the Newman-Penrose formalism, to obtain the algebraic type of the Weyl tensor in general relativity. (author)

  8. An algebraic sub-structuring method for large-scale eigenvalue calculation

    International Nuclear Information System (INIS)

    Yang, C.; Gao, W.; Bai, Z.; Li, X.; Lee, L.; Husbands, P.; Ng, E.

    2004-01-01

    We examine sub-structuring methods for solving large-scale generalized eigenvalue problems from a purely algebraic point of view. We use the term 'algebraic sub-structuring' to refer to the process of applying matrix reordering and partitioning algorithms to divide a large sparse matrix into smaller submatrices from which a subset of spectral components are extracted and combined to provide approximate solutions to the original problem. We are interested in the question of which spectral components one should extract from each sub-structure in order to produce an approximate solution to the original problem with a desired level of accuracy. Error estimate for the approximation to the smallest eigenpair is developed. The estimate leads to a simple heuristic for choosing spectral components (modes) from each sub-structure. The effectiveness of such a heuristic is demonstrated with numerical examples. We show that algebraic sub-structuring can be effectively used to solve a generalized eigenvalue problem arising from the simulation of an accelerator structure. One interesting characteristic of this application is that the stiffness matrix produced by a hierarchical vector finite elements scheme contains a null space of large dimension. We present an efficient scheme to deflate this null space in the algebraic sub-structuring process

  9. Representations of quantum bicrossproduct algebras

    International Nuclear Information System (INIS)

    Arratia, Oscar; Olmo, Mariano A del

    2002-01-01

    We present a method to construct induced representations of quantum algebras which have a bicrossproduct structure. We apply this procedure to some quantum kinematical algebras in (1+1) dimensions with this kind of structure: null-plane quantum Poincare algebra, non-standard quantum Galilei algebra and quantum κ-Galilei algebra

  10. Numerical linear algebra with applications using Matlab

    CERN Document Server

    Ford, William

    2014-01-01

    Designed for those who want to gain a practical knowledge of modern computational techniques for the numerical solution of linear algebra problems, Numerical Linear Algebra with Applications contains all the material necessary for a first year graduate or advanced undergraduate course on numerical linear algebra with numerous applications to engineering and science. With a unified presentation of computation, basic algorithm analysis, and numerical methods to compute solutions, this book is ideal for solving real-world problems. It provides necessary mathematical background information for

  11. Introduction to relation algebras relation algebras

    CERN Document Server

    Givant, Steven

    2017-01-01

    The first volume of a pair that charts relation algebras from novice to expert level, this text offers a comprehensive grounding for readers new to the topic. Upon completing this introduction, mathematics students may delve into areas of active research by progressing to the second volume, Advanced Topics in Relation Algebras; computer scientists, philosophers, and beyond will be equipped to apply these tools in their own field. The careful presentation establishes first the arithmetic of relation algebras, providing ample motivation and examples, then proceeds primarily on the basis of algebraic constructions: subalgebras, homomorphisms, quotient algebras, and direct products. Each chapter ends with a historical section and a substantial number of exercises. The only formal prerequisite is a background in abstract algebra and some mathematical maturity, though the reader will also benefit from familiarity with Boolean algebra and naïve set theory. The measured pace and outstanding clarity are particularly ...

  12. Parallel Programming Application to Matrix Algebra in the Spectral Method for Control Systems Analysis, Synthesis and Identification

    Directory of Open Access Journals (Sweden)

    V. Yu. Kleshnin

    2016-01-01

    Full Text Available The article describes the matrix algebra libraries based on the modern technologies of parallel programming for the Spectrum software, which can use a spectral method (in the spectral form of mathematical description to analyse, synthesise and identify deterministic and stochastic dynamical systems. The developed matrix algebra libraries use the following technologies for the GPUs: OmniThreadLibrary, OpenMP, Intel Threading Building Blocks, Intel Cilk Plus for CPUs nVidia CUDA, OpenCL, and Microsoft Accelerated Massive Parallelism.The developed libraries support matrices with real elements (single and double precision. The matrix dimensions are limited by 32-bit or 64-bit memory model and computer configuration. These libraries are general-purpose and can be used not only for the Spectrum software. They can also find application in the other projects where there is a need to perform operations with large matrices.The article provides a comparative analysis of the libraries developed for various matrix operations (addition, subtraction, scalar multiplication, multiplication, powers of matrices, tensor multiplication, transpose, inverse matrix, finding a solution of the system of linear equations through the numerical experiments using different CPU and GPU. The article contains sample programs and performance test results for matrix multiplication, which requires most of all computational resources in regard to the other operations.

  13. Differential Hopf algebra structures on the universal enveloping algebra of a Lie algebra

    NARCIS (Netherlands)

    van den Hijligenberg, N.W.; van den Hijligenberg, N.W.; Martini, Ruud

    1995-01-01

    We discuss a method to construct a De Rham complex (differential algebra) of Poincar'e-Birkhoff-Witt-type on the universal enveloping algebra of a Lie algebra $g$. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebra structure of

  14. Differential Hopf algebra structures on the universal enveloping algebra ofa Lie algebra

    NARCIS (Netherlands)

    N.W. van den Hijligenberg; R. Martini

    1995-01-01

    textabstractWe discuss a method to construct a De Rham complex (differential algebra) of Poincar'e-Birkhoff-Witt-type on the universal enveloping algebra of a Lie algebra $g$. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebra

  15. Emergy Algebra: Improving Matrix Methods for Calculating Tranformities

    Science.gov (United States)

    Transformity is one of the core concepts in Energy Systems Theory and it is fundamental to the calculation of emergy. Accurate evaluation of transformities and other emergy per unit values is essential for the broad acceptance, application and further development of emergy method...

  16. An algebraic topological method for multimodal brain networks comparison

    Directory of Open Access Journals (Sweden)

    Tiago eSimas

    2015-07-01

    Full Text Available Understanding brain connectivity is one of the most important issues in neuroscience. Nonetheless, connectivity data can reflect either functional relationships of brain activities or anatomical connections between brain areas. Although both representations should be related, this relationship is not straightforward. We have devised a powerful method that allows different operations between networks that share the same set of nodes, by embedding them in a common metric space, enforcing transitivity to the graph topology. Here, we apply this method to construct an aggregated network from a set of functional graphs, each one from a different subject. Once this aggregated functional network is constructed, we use again our method to compare it with the structural connectivity to identify particular brain regions that differ in both modalities (anatomical and functional. Remarkably, these brain regions include functional areas that form part of the classical resting state networks. We conclude that our method -based on the comparison of the aggregated functional network- reveals some emerging features that could not be observed when the comparison is performed with the classical averaged functional network.

  17. Calculation of quasi-stationary states parameters within the algebraic version of the resonating group method

    International Nuclear Information System (INIS)

    Okhrimenko, I.P.

    1984-01-01

    The dynamical equations of the algebraic version of the resonating group method are used to determine the positions and the widths of quasi-stationary states or to find the poles of the S-matrix in the fourth quadrant of the K-plane. Concrete calculations are performed by the example of an α-decay of 8 Be. A comparison with the results of the other authors and experiment is made

  18. Algebraic realization of the resonating group method for multichannel scattering problem in an eight nucleon system

    International Nuclear Information System (INIS)

    Badalov, S.A.; Filippov, G.F.

    1983-01-01

    All the basic calculation formulas of an algebraic version of the resonating-group method for a pultichannel problem of the scattering of a nucleon by 7 Li and 7 Be taking into account α+α channel are derived. The spin-orbital and the Coulomb interactions are taken into consideration. The procedure enabling an exact projection into the states with the given values of the channel quantum numbers is proposed

  19. Linear algebra

    CERN Document Server

    Liesen, Jörg

    2015-01-01

    This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...

  20. Investigation of the Practical Possibility of Solving Problems on Generalized Cellular Automata Associated with Cryptanalysis by Mean Algebraic Methods

    Directory of Open Access Journals (Sweden)

    P. G. Klyucharev

    2017-01-01

    Full Text Available A number of previous author’s papers proposed methods for constructing various cryptographic algorithms, including block ciphers and cryptographic hash functions, based on generalized cellular automata. This one is aimed at studying a possibility to use the algebraic cryptanalysis methods related to the construction of Gröbner bases for the generalized cellular automata to be applied in cryptography, i.e. this paper studies the possibility for using algebraic cryptanalysis methods to solve the problems of inversion of a generalized cellular automaton and recovering the key of such an automaton.If the cryptographic algorithm is represented as a system of polynomial equations over a certain finite field, then its breach is reduced to solving this system with respect to the key. Although the problem of solving a system of polynomial equations in a finite field is NP-difficult in the general case, the solution of a particular system can have low computational cost.Cryptanalysis based on the construction of a system of polynomial equations that links plain text, cipher-text and key, and its solution by algebraic methods, is usually called algebraic cryptanalysis. Among the main methods to solve systems of polynomial equations are those to construct Gröbner bases.Cryptanalysis of ciphers and hash functions based on generalized cellular automata can be reduced to various problems. We will consider two such problems: the problem of inversion of a generalized cellular automaton, which, in case we know the values of the cells after k iterations, enables us to find the initial values. And the task of recovering the key, which is to find the initial values of the remaining cells, using the cell values after k steps and the initial values of a part of the cells.A computational experiment was carried out to solve the two problems above stated in order to determine the maximum size of a generalized cellular automaton for which the solution of these

  1. Without derivatives or limits: from visual and geometrical points of view to algebraic methods for identifying tangent lines

    Science.gov (United States)

    Vivier, L.

    2013-07-01

    Usually, the tangent line is considered to be a calculus notion. However, it is also a graphical and an algebraic notion. The graphical frame, where our primary conceptions are conceived, could give rise to algebraic methods to obtain the tangent line to a curve. In this pre-calculus perspective, two methods are described and discussed according to their potential for secondary students and teacher training.

  2. Incomplete projection reconstruction of computed tomography based on the modified discrete algebraic reconstruction technique

    Science.gov (United States)

    Yang, Fuqiang; Zhang, Dinghua; Huang, Kuidong; Gao, Zongzhao; Yang, YaFei

    2018-02-01

    Based on the discrete algebraic reconstruction technique (DART), this study aims to address and test a new improved algorithm applied to incomplete projection data to generate a high quality reconstruction image by reducing the artifacts and noise in computed tomography. For the incomplete projections, an augmented Lagrangian based on compressed sensing is first used in the initial reconstruction for segmentation of the DART to get higher contrast graphics for boundary and non-boundary pixels. Then, the block matching 3D filtering operator was used to suppress the noise and to improve the gray distribution of the reconstructed image. Finally, simulation studies on the polychromatic spectrum were performed to test the performance of the new algorithm. Study results show a significant improvement in the signal-to-noise ratios (SNRs) and average gradients (AGs) of the images reconstructed from incomplete data. The SNRs and AGs of the new images reconstructed by DART-ALBM were on average 30%-40% and 10% higher than the images reconstructed by DART algorithms. Since the improved DART-ALBM algorithm has a better robustness to limited-view reconstruction, which not only makes the edge of the image clear but also makes the gray distribution of non-boundary pixels better, it has the potential to improve image quality from incomplete projections or sparse projections.

  3. Lectures on algebraic statistics

    CERN Document Server

    Drton, Mathias; Sullivant, Seth

    2009-01-01

    How does an algebraic geometer studying secant varieties further the understanding of hypothesis tests in statistics? Why would a statistician working on factor analysis raise open problems about determinantal varieties? Connections of this type are at the heart of the new field of "algebraic statistics". In this field, mathematicians and statisticians come together to solve statistical inference problems using concepts from algebraic geometry as well as related computational and combinatorial techniques. The goal of these lectures is to introduce newcomers from the different camps to algebraic statistics. The introduction will be centered around the following three observations: many important statistical models correspond to algebraic or semi-algebraic sets of parameters; the geometry of these parameter spaces determines the behaviour of widely used statistical inference procedures; computational algebraic geometry can be used to study parameter spaces and other features of statistical models.

  4. Color Algebras

    Science.gov (United States)

    Mulligan, Jeffrey B.

    2017-01-01

    A color algebra refers to a system for computing sums and products of colors, analogous to additive and subtractive color mixtures. The difficulty addressed here is the fact that, because of metamerism, we cannot know with certainty the spectrum that produced a particular color solely on the basis of sensory data. Knowledge of the spectrum is not required to compute additive mixture of colors, but is critical for subtractive (multiplicative) mixture. Therefore, we cannot predict with certainty the multiplicative interactions between colors based solely on sensory data. There are two potential applications of a color algebra: first, to aid modeling phenomena of human visual perception, such as color constancy and transparency; and, second, to provide better models of the interactions of lights and surfaces for computer graphics rendering.

  5. Algebraic partial Boolean algebras

    International Nuclear Information System (INIS)

    Smith, Derek

    2003-01-01

    Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A 5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E 8

  6. Grade 11 Students' Interconnected Use of Conceptual Knowledge, Procedural Skills, and Strategic Competence in Algebra: A Mixed Method Study of Error Analysis

    Science.gov (United States)

    Egodawatte, Gunawardena; Stoilescu, Dorian

    2015-01-01

    The purpose of this mixed-method study was to investigate grade 11 university/college stream mathematics students' difficulties in applying conceptual knowledge, procedural skills, strategic competence, and algebraic thinking in solving routine (instructional) algebraic problems. A standardized algebra test was administered to thirty randomly…

  7. Algorithms in Algebraic Geometry

    CERN Document Server

    Dickenstein, Alicia; Sommese, Andrew J

    2008-01-01

    In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its

  8. Understanding geometric algebra Hamilton, Grassmann, and Clifford for computer vision and graphics

    CERN Document Server

    Kanatani, Kenichi

    2015-01-01

    Introduction PURPOSE OF THIS BOOK ORGANIZATION OF THIS BOOK OTHER FEATURES 3D Euclidean Geometry VECTORS BASIS AND COMPONENTS INNER PRODUCT AND NORM VECTOR PRODUCTS SCALAR TRIPLE PRODUCT PROJECTION, REJECTION, AND REFLECTION ROTATION PLANES LINES PLANES AND LINES Oblique Coordinate Systems RECIPROCAL BASIS RECIPROCAL COMPONENTS INNER, VECTOR, AND SCALAR TRIPLE PRODUCTS METRIC TENSOR RECIPROCITY OF EXPRESSIONS COORDINATE TRANSFORMATIONSHamilton's Quaternion Algebra QUATERNIONS ALGEBRA OF QUATERNIONS CONJUGATE, NORM, AND INVERSE REPRESENTATION OF ROTATION BY QUATERNION Grassmann's Outer Product

  9. Computing Nash equilibria through computational intelligence methods

    Science.gov (United States)

    Pavlidis, N. G.; Parsopoulos, K. E.; Vrahatis, M. N.

    2005-03-01

    Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, to compute Nash equilibria of finite strategic games, as global minima of a real-valued, nonnegative function. An issue of particular interest is to detect more than one Nash equilibria of a game. The performance of the considered computational intelligence methods on this problem is investigated using multistart and deflection.

  10. Dual number algebra method for Green's function derivatives in 3D magneto-electro-elasticity

    Science.gov (United States)

    Dziatkiewicz, Grzegorz

    2018-01-01

    The Green functions are the basic elements of the boundary element method. To obtain the boundary integral formulation the Green function and its derivative should be known for the considered differential operator. Today the interesting group of materials are electronic composites. The special case of the electronic composite is the magnetoelectroelastic continuum. The mentioned continuum is a model of the piezoelectric-piezomagnetic composites. The anisotropy of their physical properties makes the problem of Green's function determination very difficult. For that reason Green's functions for the magnetoelectroelastic continuum are not known in the closed form and numerical methods should be applied to determine such Green's functions. These means that the problem of the accurate and simply determination of Green's function derivatives is even harder. Therefore in the present work the dual number algebra method is applied to calculate numerically the derivatives of 3D Green's functions for the magnetoelectroelastic materials. The introduced method is independent on the step size and it can be treated as a special case of the automatic differentiation method. Therefore, the dual number algebra method can be applied as a tool for checking the accuracy of the well-known finite difference schemes.

  11. Linear-Algebra Programs

    Science.gov (United States)

    Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.

    1982-01-01

    The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.

  12. New simple algebraic root locus method for design of feedback control systems

    Directory of Open Access Journals (Sweden)

    Cingara Aleksandar M.

    2008-01-01

    Full Text Available New concept of algebraic characteristic equation decomposition method is presented to simplify the design of closed-loop systems for practical applications. The method consists of two decompositions. The first one, decomposition of the characteristic equation into two lower order equations, was performed in order to simplify the analysis and design of closed loop systems. The second is the decomposition of Laplace variable, s, into two variables, damping coefficient, ζ, and natural frequency, ω n. Those two decompositions reduce the design of any order feedback systems to setting of two complex dominant poles in the desired position. In the paper, we derived explicit equations for six cases: first, second and third order system with P and PI. We got the analytical solutions for the case of fourth and fifth order characteristic equations with the P and PI controller; one may obtain a complete analytical solution of controller gain as a function of the desired damping coefficient. The complete derivation is given for the third order equation with P and PI controller. We can extend the number of specified poles to the highest order of the characteristic equation working in a similar way, so we can specify the position of each pole. The concept is similar to the root locus but root locus is implicit, which makes it more complicated and this is simpler explicit root locus. Standard procedures, root locus and Bode diagrams or Nichol Charts, are neither algebraic nor explicit. We basically change controller parameters and observe the change of some function until we get the desired specifications. The derived method has three important advantage over the standard procedures. It is general, algebraic and explicit. Those are the best poles design results possible; it is not possible to get better controller design results.

  13. The algebraic method of the scattering inverse problem solution under untraditional statements

    CERN Document Server

    Popushnoj, M N

    2001-01-01

    The algebraic method of the scattering inverse problem solution under untraditional statements is proposed consistently in this review, in the framework of which some quantum theory od scattering charged particles problem were researched afterwards. The inverse problem of scattering theory of charged particles on the complex plane of the Coulomb coupling constant (CCC) is considered. A procedure of interaction potential restoration is established for the case when the energy, orbital moment quadrate and CCC are linearly dependent. The relation between one-parametric problems of the potential scattering of charged particles is investigated

  14. Study of some properties of partial differential equations by Lie algebra method

    International Nuclear Information System (INIS)

    Chongdar, A.K.; Ludu, A.

    1990-05-01

    In this note we present a system of optimal subalgebras of the Lie algebra obtained in course of investigating hypergeometric polynomial. In addition to this we have obtained some reduced equation and invariants of the P.D.E. obtained under certain transformation while studying hypergeometric polynomial by Weisner's method. Some topological properties of the solutions of P.D.E. are pointed out by using the extended jet bundle formalism. Some applications of our work on plasma physics and hydrodynamics are also cited. (author). 8 refs

  15. Symbolic derivation of high-order Rayleigh-Schroedinger perturbation energies using computer algebra: Application to vibrational-rotational analysis of diatomic molecules

    Energy Technology Data Exchange (ETDEWEB)

    Herbert, John M. [Kansas State Univ., Manhattan, KS (United States). Dept. of Chemistry

    1997-01-01

    Rayleigh-Schroedinger perturbation theory is an effective and popular tool for describing low-lying vibrational and rotational states of molecules. This method, in conjunction with ab initio techniques for computation of electronic potential energy surfaces, can be used to calculate first-principles molecular vibrational-rotational energies to successive orders of approximation. Because of mathematical complexities, however, such perturbation calculations are rarely extended beyond the second order of approximation, although recent work by Herbert has provided a formula for the nth-order energy correction. This report extends that work and furnishes the remaining theoretical details (including a general formula for the Rayleigh-Schroedinger expansion coefficients) necessary for calculation of energy corrections to arbitrary order. The commercial computer algebra software Mathematica is employed to perform the prohibitively tedious symbolic manipulations necessary for derivation of generalized energy formulae in terms of universal constants, molecular constants, and quantum numbers. As a pedagogical example, a Hamiltonian operator tailored specifically to diatomic molecules is derived, and the perturbation formulae obtained from this Hamiltonian are evaluated for a number of such molecules. This work provides a foundation for future analyses of polyatomic molecules, since it demonstrates that arbitrary-order perturbation theory can successfully be applied with the aid of commercially available computer algebra software.

  16. Finite automata over algebraic structures: models and some methods of analysis

    Directory of Open Access Journals (Sweden)

    Volodymyr V. Skobelev

    2015-10-01

    Full Text Available In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given. The first trend deals with families of finite automata defined via recurrence relations on algebraic structures over finite rings. The problem of design of some algorithm that simulates with some accuracy any element of given family of automata is investigated. Some general scheme for design of families of hash functions defined by outputless automata is elaborated. Computational security of these families of hash functions is analyzed. Automata defined on varieties with some algebra are presented and their homomorphisms are characterized. Special case of these automata, namely automata on elliptic curves, are investigated in detail. The second trend deals with quantum automata. Languages accepted by some basic models of quantum automata under supposition that unitary operators associated with input alphabet commute each with the others are characterized.

  17. Algebraic method for constructing singular steady solitary waves: a case study

    Science.gov (United States)

    Clamond, Didier; Dutykh, Denys; Galligo, André

    2016-07-01

    This article describes the use of algebraic methods in a phase plane analysis of ordinary differential equations. The method is illustrated by the study of capillary-gravity steady surface waves propagating in shallow water. We consider the (fully nonlinear, weakly dispersive) Serre-Green-Naghdi equation with surface tension, because it provides a tractable model that, at the same time, is not too simple, so interest in the method can be emphasized. In particular, we analyse a special class of solutions, the solitary waves, which play an important role in many fields of physics. In capillary-gravity regime, there are two kinds of localized infinitely smooth travelling wave solutions-solitary waves of elevation and of depression. However, if we allow the solitary waves to have an angular point, then the `zoology' of solutions becomes much richer, and the main goal of this study is to provide a complete classification of such singular localized solutions using the methods of the effective algebraic geometry.

  18. Algebraic topological entropy

    International Nuclear Information System (INIS)

    Hudetz, T.

    1989-01-01

    As a 'by-product' of the Connes-Narnhofer-Thirring theory of dynamical entropy for (originally non-Abelian) nuclear C * -algebras, the well-known variational principle for topological entropy is eqivalently reformulated in purly algebraically defined terms for (separable) Abelian C * -algebras. This 'algebraic variational principle' should not only nicely illustrate the 'feed-back' of methods developed for quantum dynamical systems to the classical theory, but it could also be proved directly by 'algebraic' methods and could thus further simplify the original proof of the variational principle (at least 'in principle'). 23 refs. (Author)

  19. A Structural Model of Algebra Achievement: Computational Fluency and Spatial Visualisation as Mediators of the Effect of Working Memory on Algebra Achievement

    Science.gov (United States)

    Tolar, Tammy Daun; Lederberg, Amy R.; Fletcher, Jack M.

    2009-01-01

    The goal of this study was to develop and evaluate a structural model of the relations among cognitive abilities and arithmetic skills and college students' algebra achievement. The model of algebra achievement was compared to a model of performance on the Scholastic Assessment in Mathematics (SAT-M) to determine whether the pattern of relations…

  20. Assessing Elementary Algebra with STACK

    Science.gov (United States)

    Sangwin, Christopher J.

    2007-01-01

    This paper concerns computer aided assessment (CAA) of mathematics in which a computer algebra system (CAS) is used to help assess students' responses to elementary algebra questions. Using a methodology of documentary analysis, we examine what is taught in elementary algebra. The STACK CAA system, http://www.stack.bham.ac.uk/, which uses the CAS…

  1. Method for computed tomography

    International Nuclear Information System (INIS)

    Wagner, W.

    1980-01-01

    In transversal computer tomography apparatus, in which the positioning zone in which the patient can be positioned is larger than the scanning zone in which a body slice can be scanned, reconstruction errors are liable to occur. These errors are caused by incomplete irradiation of the body during examination. They become manifest not only as an incorrect image of the area not irradiated, but also have an adverse effect on the image of the other, completely irradiated areas. The invention enables reduction of these errors

  2. Computational methods working group

    International Nuclear Information System (INIS)

    Gabriel, T.A.

    1997-09-01

    During the Cold Moderator Workshop several working groups were established including one to discuss calculational methods. The charge for this working group was to identify problems in theory, data, program execution, etc., and to suggest solutions considering both deterministic and stochastic methods including acceleration procedures.

  3. Approach method of the solutions of algebraic models of the N body problem

    International Nuclear Information System (INIS)

    Dufour, M.

    1986-09-01

    We have studied a class of algebraic eigenvalue problems that generate tridiagonal matrices. The Lipkin Hamiltonian was chosen as representative. Three methods have been implemented, whose extension to more general many body problems seems possible i) Degenerate Linked Cluster Theory (LCT), which disregards special symmetries of the interaction and defines a hierarchy of approximation based on model spaces at fixed number of particle-hole excitation of the unperturbed Hamiltonian. The method works for small perturbations but does not yield a complete description. ii) A new linearization method that replaces the matrix to be diagonalized by local (tangent) approximations by harmonic matrices. This method generalizes LCT and is a posteriori reminiscent of semi-classical ones. However of is simpler, more precise and yields a complete description of spectra. iii) A global way to characterize spectra based on Gershgorine-Hadamard disks [fr

  4. Zeta functional equation on Jordan algebras of type II

    International Nuclear Information System (INIS)

    Kayoya, J.B.

    2003-10-01

    Using the Jordan algebras method, specially the properties of Peirce decomposition and the Frobenius transformation, we compute the coefficients of the zeta functional equation, in the case of Jordan algebras of Type II. As particular cases of our result, we can cite the case of V M (n, R) studied by Gelbart and Godement-Jacquet, and the case of V Herm(3, O s ) studied by Muro. Let us also mention, that recently, Bopp and Rubenthaler have obtained a more general result on the zeta functional equation by using methods based on the algebraic properties of regular graded algebras which are in one to one correspondence with simple Jordan algebras. The method used in this paper is a direct application of specific properties of Jordan algebras of Type H. (author)

  5. Algebraic geometry

    CERN Document Server

    Lefschetz, Solomon

    2005-01-01

    An introduction to algebraic geometry and a bridge between its analytical-topological and algebraical aspects, this text for advanced undergraduate students is particularly relevant to those more familiar with analysis than algebra. 1953 edition.

  6. Grassmann algebras

    International Nuclear Information System (INIS)

    Garcia, R.L.

    1983-11-01

    The Grassmann algebra is presented briefly. Exponential and logarithm of matrices functions, whose elements belong to this algebra, are studied with the help of the SCHOONSCHIP and REDUCE 2 algebraic manipulators. (Author) [pt

  7. Differential Hopf algebra structures on the Universal Enveloping Algebra of a Lie Algebra

    NARCIS (Netherlands)

    van den Hijligenberg, N.W.; van den Hijligenberg, N.; Martini, Ruud

    1995-01-01

    We discuss a method to construct a De Rham complex (differential algebra) of Poincaré–Birkhoff–Witt type on the universal enveloping algebra of a Lie algebra g. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebrastructure of U(g).

  8. Transforming an Introductory Linear Algebra Course with a TI-92 Hand-Held Computer.

    Science.gov (United States)

    Quesada, Antonio R.

    2003-01-01

    Describes how the introduction of the TI-92 transformed a traditional first semester linear algebra course into a matrix-oriented course that emphasized conceptual understanding, relevant applications, and numerical issues. Indicates an increase in students' overall performance as they found the calculator very useful, believed it helped them…

  9. Computational Methods in Medicine

    Directory of Open Access Journals (Sweden)

    Angel Garrido

    2010-01-01

    Full Text Available Artificial Intelligence requires Logic. But its Classical version shows too many insufficiencies. So, it is absolutely necessary to introduce more sophisticated tools, such as Fuzzy Logic, Modal Logic, Non-Monotonic Logic, and so on [2]. Among the things that AI needs to represent are Categories, Objects, Properties, Relations between objects, Situations, States, Time, Events, Causes and effects, Knowledge about knowledge, and so on. The problems in AI can be classified in two general types
    [3, 4], Search Problems and Representation Problem. There exist different ways to reach this objective. So, we have [3] Logics, Rules, Frames, Associative Nets, Scripts and so on, that are often interconnected. Also, it will be very useful, in dealing with problems of uncertainty and causality, to introduce Bayesian Networks and particularly, a principal tool as the Essential Graph. We attempt here to show the scope of application of such versatile methods, currently fundamental in Medicine.

  10. Spectral analysis of an algebraic collapsing acceleration for the characteristics method

    International Nuclear Information System (INIS)

    Le Tellier, R.; Hebert, A.

    2005-01-01

    A spectral analysis of a diffusion synthetic acceleration called Algebraic Collapsing Acceleration (ACA) was carried out in the context of the characteristics method to solve the neutron transport equation. Two analysis were performed in order to assess the ACA performances. Both a standard Fourier analysis in a periodic and infinite slab-geometry and a direct spectral analysis for a finite slab-geometry were investigated. In order to evaluate its performance, ACA was compared with two competing techniques used to accelerate the convergence of the characteristics method, the Self-Collision Re-balancing technique and the Asymptotic Synthetic Acceleration. In the restricted framework of 1-dimensional slab-geometries, we conclude that ACA offers a good compromise between the reduction of the spectral radius of the iterative matrix and the resources to construct, store and solve the corrective system. A comparison on a monoenergetic 2-dimensional benchmark was performed and tends to confirm these conclusions. (authors)

  11. General algebraic method applied to control analysis of complex engine types

    Science.gov (United States)

    Boksenbom, Aaron S; Hood, Richard

    1950-01-01

    A general algebraic method of attack on the problem of controlling gas-turbine engines having any number of independent variables was utilized employing operational functions to describe the assumed linear characteristics for the engine, the control, and the other units in the system. Matrices were used to describe the various units of the system, to form a combined system showing all effects, and to form a single condensed matrix showing the principal effects. This method directly led to the conditions on the control system for noninteraction so that any setting disturbance would affect only its corresponding controlled variable. The response-action characteristics were expressed in terms of the control system and the engine characteristics. The ideal control-system characteristics were explicitly determined in terms of any desired response action.

  12. Numerical linear algebra theory and applications

    CERN Document Server

    Beilina, Larisa; Karchevskii, Mikhail

    2017-01-01

    This book combines a solid theoretical background in linear algebra with practical algorithms for numerical solution of linear algebra problems. Developed from a number of courses taught repeatedly by the authors, the material covers topics like matrix algebra, theory for linear systems of equations, spectral theory, vector and matrix norms combined with main direct and iterative numerical methods, least squares problems, and eigen problems. Numerical algorithms illustrated by computer programs written in MATLAB® are also provided as supplementary material on SpringerLink to give the reader a better understanding of professional numerical software for the solution of real-life problems. Perfect for a one- or two-semester course on numerical linear algebra, matrix computation, and large sparse matrices, this text will interest students at the advanced undergraduate or graduate level.

  13. Cohomology of Effect Algebras

    Directory of Open Access Journals (Sweden)

    Frank Roumen

    2017-01-01

    Full Text Available We will define two ways to assign cohomology groups to effect algebras, which occur in the algebraic study of quantum logic. The first way is based on Connes' cyclic cohomology. The resulting cohomology groups are related to the state space of the effect algebra, and can be computed using variations on the Kunneth and Mayer-Vietoris sequences. The second way involves a chain complex of ordered abelian groups, and gives rise to a cohomological characterization of state extensions on effect algebras. This has applications to no-go theorems in quantum foundations, such as Bell's theorem.

  14. Numerical methods in matrix computations

    CERN Document Server

    Björck, Åke

    2015-01-01

    Matrix algorithms are at the core of scientific computing and are indispensable tools in most applications in engineering. This book offers a comprehensive and up-to-date treatment of modern methods in matrix computation. It uses a unified approach to direct and iterative methods for linear systems, least squares and eigenvalue problems. A thorough analysis of the stability, accuracy, and complexity of the treated methods is given. Numerical Methods in Matrix Computations is suitable for use in courses on scientific computing and applied technical areas at advanced undergraduate and graduate level. A large bibliography is provided, which includes both historical and review papers as well as recent research papers. This makes the book useful also as a reference and guide to further study and research work. Åke Björck is a professor emeritus at the Department of Mathematics, Linköping University. He is a Fellow of the Society of Industrial and Applied Mathematics.

  15. Numerical computer methods part D

    CERN Document Server

    Johnson, Michael L

    2004-01-01

    The aim of this volume is to brief researchers of the importance of data analysis in enzymology, and of the modern methods that have developed concomitantly with computer hardware. It is also to validate researchers' computer programs with real and synthetic data to ascertain that the results produced are what they expected. Selected Contents: Prediction of protein structure; modeling and studying proteins with molecular dynamics; statistical error in isothermal titration calorimetry; analysis of circular dichroism data; model comparison methods.

  16. Computational Methods in Plasma Physics

    CERN Document Server

    Jardin, Stephen

    2010-01-01

    Assuming no prior knowledge of plasma physics or numerical methods, Computational Methods in Plasma Physics covers the computational mathematics and techniques needed to simulate magnetically confined plasmas in modern magnetic fusion experiments and future magnetic fusion reactors. Largely self-contained, the text presents the basic concepts necessary for the numerical solution of partial differential equations. Along with discussing numerical stability and accuracy, the author explores many of the algorithms used today in enough depth so that readers can analyze their stability, efficiency,

  17. Shape optimization for Navier-Stokes equations with algebraic turbulence model : numerical analysis and computation

    Czech Academy of Sciences Publication Activity Database

    Haslinger, J.; Stebel, Jan

    2011-01-01

    Roč. 63, č. 2 (2011), s. 277-308 ISSN 0095-4616 R&D Projects: GA MŠk LC06052 Institutional research plan: CEZ:AV0Z10190503 Keywords : optimal shape design * paper machine headbox * incompressible non-Newtonian fluid * algebraic turbulence model Subject RIV: BA - General Mathematics Impact factor: 0.952, year: 2011 http://link.springer.com/article/10.1007%2Fs00245-010-9121-x

  18. Numerical methods design, analysis, and computer implementation of algorithms

    CERN Document Server

    Greenbaum, Anne

    2012-01-01

    Numerical Methods provides a clear and concise exploration of standard numerical analysis topics, as well as nontraditional ones, including mathematical modeling, Monte Carlo methods, Markov chains, and fractals. Filled with appealing examples that will motivate students, the textbook considers modern application areas, such as information retrieval and animation, and classical topics from physics and engineering. Exercises use MATLAB and promote understanding of computational results. The book gives instructors the flexibility to emphasize different aspects--design, analysis, or computer implementation--of numerical algorithms, depending on the background and interests of students. Designed for upper-division undergraduates in mathematics or computer science classes, the textbook assumes that students have prior knowledge of linear algebra and calculus, although these topics are reviewed in the text. Short discussions of the history of numerical methods are interspersed throughout the chapters. The book a...

  19. Bicovariant quantum algebras and quantum Lie algebras

    International Nuclear Information System (INIS)

    Schupp, P.; Watts, P.; Zumino, B.

    1993-01-01

    A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from Fun(G q ) to U q g, given by elements of the pure braid group. These operators - the 'reflection matrix' Y= triple bond L + SL - being a special case - generate algebras that linearly close under adjoint actions, i.e. they form generalized Lie algebras. We establish the connection between the Hopf algebra formulation of the calculus and a formulation in compact matrix form which is quite powerful for actual computations and as applications we find the quantum determinant and an orthogonality relation for Y in SO q (N). (orig.)

  20. Vertex algebras and algebraic curves

    CERN Document Server

    Frenkel, Edward

    2004-01-01

    Vertex algebras are algebraic objects that encapsulate the concept of operator product expansion from two-dimensional conformal field theory. Vertex algebras are fast becoming ubiquitous in many areas of modern mathematics, with applications to representation theory, algebraic geometry, the theory of finite groups, modular functions, topology, integrable systems, and combinatorics. This book is an introduction to the theory of vertex algebras with a particular emphasis on the relationship with the geometry of algebraic curves. The notion of a vertex algebra is introduced in a coordinate-independent way, so that vertex operators become well defined on arbitrary smooth algebraic curves, possibly equipped with additional data, such as a vector bundle. Vertex algebras then appear as the algebraic objects encoding the geometric structure of various moduli spaces associated with algebraic curves. Therefore they may be used to give a geometric interpretation of various questions of representation theory. The book co...

  1. Implicative Algebras

    African Journals Online (AJOL)

    Tadesse

    In this paper we introduce the concept of implicative algebras which is an equivalent definition of lattice implication algebra of Xu (1993) and further we prove that it is a regular Autometrized. Algebra. Further we remark that the binary operation → on lattice implicative algebra can never be associative. Key words: Implicative ...

  2. Geometric Methods in the Algebraic Theory of Quadratic Forms : Summer School

    CERN Document Server

    2004-01-01

    The geometric approach to the algebraic theory of quadratic forms is the study of projective quadrics over arbitrary fields. Function fields of quadrics have been central to the proofs of fundamental results since the renewal of the theory by Pfister in the 1960's. Recently, more refined geometric tools have been brought to bear on this topic, such as Chow groups and motives, and have produced remarkable advances on a number of outstanding problems. Several aspects of these new methods are addressed in this volume, which includes - an introduction to motives of quadrics by Alexander Vishik, with various applications, notably to the splitting patterns of quadratic forms under base field extensions; - papers by Oleg Izhboldin and Nikita Karpenko on Chow groups of quadrics and their stable birational equivalence, with application to the construction of fields which carry anisotropic quadratic forms of dimension 9, but none of higher dimension; - a contribution in French by Bruno Kahn which lays out a general fra...

  3. Reduced-cost second-order algebraic-diagrammatic construction method for excitation energies and transition moments

    Science.gov (United States)

    Mester, Dávid; Nagy, Péter R.; Kállay, Mihály

    2018-03-01

    A reduced-cost implementation of the second-order algebraic-diagrammatic construction [ADC(2)] method is presented. We introduce approximations by restricting virtual natural orbitals and natural auxiliary functions, which results, on average, in more than an order of magnitude speedup compared to conventional, density-fitting ADC(2) algorithms. The present scheme is the successor of our previous approach [D. Mester, P. R. Nagy, and M. Kállay, J. Chem. Phys. 146, 194102 (2017)], which has been successfully applied to obtain singlet excitation energies with the linear-response second-order coupled-cluster singles and doubles model. Here we report further methodological improvements and the extension of the method to compute singlet and triplet ADC(2) excitation energies and transition moments. The various approximations are carefully benchmarked, and conservative truncation thresholds are selected which guarantee errors much smaller than the intrinsic error of the ADC(2) method. Using the canonical values as reference, we find that the mean absolute error for both singlet and triplet ADC(2) excitation energies is 0.02 eV, while that for oscillator strengths is 0.001 a.u. The rigorous cutoff parameters together with the significantly reduced operation count and storage requirements allow us to obtain accurate ADC(2) excitation energies and transition properties using triple-ζ basis sets for systems of up to one hundred atoms.

  4. Real division algebras and other algebras motivated by physics

    International Nuclear Information System (INIS)

    Benkart, G.; Osborn, J.M.

    1981-01-01

    In this survey we discuss several general techniques which have been productive in the study of real division algebras, flexible Lie-admissible algebras, and other nonassociative algebras, and we summarize results obtained using these methods. The principal method involved in this work is to view an algebra A as a module for a semisimple Lie algebra of derivations of A and to use representation theory to study products in A. In the case of real division algebras, we also discuss the use of isotopy and the use of a generalized Peirce decomposition. Most of the work summarized here has appeared in more detail in various other papers. The exceptions are results on a class of algebras of dimension 15, motivated by physics, which admit the Lie algebra sl(3) as an algebra of derivations

  5. Current algebra

    International Nuclear Information System (INIS)

    Jacob, M.

    1967-01-01

    The first three chapters of these lecture notes are devoted to generalities concerning current algebra. The weak currents are defined, and their main properties given (V-A hypothesis, conserved vector current, selection rules, partially conserved axial current,...). The SU (3) x SU (3) algebra of Gell-Mann is introduced, and the general properties of the non-leptonic weak Hamiltonian are discussed. Chapters 4 to 9 are devoted to some important applications of the algebra. First one proves the Adler- Weisberger formula, in two different ways, by either the infinite momentum frame, or the near-by singularities method. In the others chapters, the latter method is the only one used. The following topics are successively dealt with: semi leptonic decays of K mesons and hyperons, Kroll- Ruderman theorem, non leptonic decays of K mesons and hyperons ( ΔI = 1/2 rule), low energy theorems concerning processes with emission (or absorption) of a pion or a photon, super-convergence sum rules, and finally, neutrino reactions. (author) [fr

  6. Practical algebraic renormalization

    International Nuclear Information System (INIS)

    Grassi, Pietro Antonio; Hurth, Tobias; Steinhauser, Matthias

    2001-01-01

    A practical approach is presented which allows the use of a non-invariant regularization scheme for the computation of quantum corrections in perturbative quantum field theory. The theoretical control of algebraic renormalization over non-invariant counterterms is translated into a practical computational method. We provide a detailed introduction into the handling of the Slavnov-Taylor and Ward-Takahashi identities in the standard model both in the conventional and the background gauge. Explicit examples for their practical derivation are presented. After a brief introduction into the Quantum Action Principle the conventional algebraic method which allows for the restoration of the functional identities is discussed. The main point of our approach is the optimization of this procedure which results in an enormous reduction of the calculational effort. The counterterms which have to be computed are universal in the sense that they are independent of the regularization scheme. The method is explicitly illustrated for two processes of phenomenological interest: QCD corrections to the decay of the Higgs boson into two photons and two-loop electroweak corrections to the process B→X s γ

  7. Computational methods in earthquake engineering

    CERN Document Server

    Plevris, Vagelis; Lagaros, Nikos

    2017-01-01

    This is the third book in a series on Computational Methods in Earthquake Engineering. The purpose of this volume is to bring together the scientific communities of Computational Mechanics and Structural Dynamics, offering a wide coverage of timely issues on contemporary Earthquake Engineering. This volume will facilitate the exchange of ideas in topics of mutual interest and can serve as a platform for establishing links between research groups with complementary activities. The computational aspects are emphasized in order to address difficult engineering problems of great social and economic importance. .

  8. Principles of linear algebra with Mathematica

    CERN Document Server

    Shiskowski, Kenneth M

    2013-01-01

    A hands-on introduction to the theoretical and computational aspects of linear algebra using Mathematica® Many topics in linear algebra are simple, yet computationally intensive, and computer algebra systems such as Mathematica® are essential not only for learning to apply the concepts to computationally challenging problems, but also for visualizing many of the geometric aspects within this field of study. Principles of Linear Algebra with Mathematica uniquely bridges the gap between beginning linear algebra and computational linear algebra that is often encountered in applied settings,

  9. Quadratic algebras

    CERN Document Server

    Polishchuk, Alexander

    2005-01-01

    Quadratic algebras, i.e., algebras defined by quadratic relations, often occur in various areas of mathematics. One of the main problems in the study of these (and similarly defined) algebras is how to control their size. A central notion in solving this problem is the notion of a Koszul algebra, which was introduced in 1970 by S. Priddy and then appeared in many areas of mathematics, such as algebraic geometry, representation theory, noncommutative geometry, K-theory, number theory, and noncommutative linear algebra. The book offers a coherent exposition of the theory of quadratic and Koszul algebras, including various definitions of Koszulness, duality theory, Poincar�-Birkhoff-Witt-type theorems for Koszul algebras, and the Koszul deformation principle. In the concluding chapter of the book, they explain a surprising connection between Koszul algebras and one-dependent discrete-time stochastic processes.

  10. Methods for computing color anaglyphs

    Science.gov (United States)

    McAllister, David F.; Zhou, Ya; Sullivan, Sophia

    2010-02-01

    A new computation technique is presented for calculating pixel colors in anaglyph images. The method depends upon knowing the RGB spectral distributions of the display device and the transmission functions of the filters in the viewing glasses. It requires the solution of a nonlinear least-squares program for each pixel in a stereo pair and is based on minimizing color distances in the CIEL*a*b* uniform color space. The method is compared with several techniques for computing anaglyphs including approximation in CIE space using the Euclidean and Uniform metrics, the Photoshop method and its variants, and a method proposed by Peter Wimmer. We also discuss the methods of desaturation and gamma correction for reducing retinal rivalry.

  11. Adaptive algebraic reconstruction technique

    International Nuclear Information System (INIS)

    Lu Wenkai; Yin Fangfang

    2004-01-01

    Algebraic reconstruction techniques (ART) are iterative procedures for reconstructing objects from their projections. It is proven that ART can be computationally efficient by carefully arranging the order in which the collected data are accessed during the reconstruction procedure and adaptively adjusting the relaxation parameters. In this paper, an adaptive algebraic reconstruction technique (AART), which adopts the same projection access scheme in multilevel scheme algebraic reconstruction technique (MLS-ART), is proposed. By introducing adaptive adjustment of the relaxation parameters during the reconstruction procedure, one-iteration AART can produce reconstructions with better quality, in comparison with one-iteration MLS-ART. Furthermore, AART outperforms MLS-ART with improved computational efficiency

  12. Lie algebras and applications

    CERN Document Server

    Iachello, Francesco

    2015-01-01

    This course-based primer provides an introduction to Lie algebras and some of their applications to the spectroscopy of molecules, atoms, nuclei and hadrons. In the first part, it concisely presents the basic concepts of Lie algebras, their representations and their invariants. The second part includes a description of how Lie algebras are used in practice in the treatment of bosonic and fermionic systems. Physical applications considered include rotations and vibrations of molecules (vibron model), collective modes in nuclei (interacting boson model), the atomic shell model, the nuclear shell model, and the quark model of hadrons. One of the key concepts in the application of Lie algebraic methods in physics, that of spectrum generating algebras and their associated dynamic symmetries, is also discussed. The book highlights a number of examples that help to illustrate the abstract algebraic definitions and includes a summary of many formulas of practical interest, such as the eigenvalues of Casimir operators...

  13. QuBiLS-MIDAS: a parallel free-software for molecular descriptors computation based on multilinear algebraic maps.

    Science.gov (United States)

    García-Jacas, César R; Marrero-Ponce, Yovani; Acevedo-Martínez, Liesner; Barigye, Stephen J; Valdés-Martiní, José R; Contreras-Torres, Ernesto

    2014-07-05

    The present report introduces the QuBiLS-MIDAS software belonging to the ToMoCoMD-CARDD suite for the calculation of three-dimensional molecular descriptors (MDs) based on the two-linear (bilinear), three-linear, and four-linear (multilinear or N-linear) algebraic forms. Thus, it is unique software that computes these tensor-based indices. These descriptors, establish relations for two, three, and four atoms by using several (dis-)similarity metrics or multimetrics, matrix transformations, cutoffs, local calculations and aggregation operators. The theoretical background of these N-linear indices is also presented. The QuBiLS-MIDAS software was developed in the Java programming language and employs the Chemical Development Kit library for the manipulation of the chemical structures and the calculation of the atomic properties. This software is composed by a desktop user-friendly interface and an Abstract Programming Interface library. The former was created to simplify the configuration of the different options of the MDs, whereas the library was designed to allow its easy integration to other software for chemoinformatics applications. This program provides functionalities for data cleaning tasks and for batch processing of the molecular indices. In addition, it offers parallel calculation of the MDs through the use of all available processors in current computers. The studies of complexity of the main algorithms demonstrate that these were efficiently implemented with respect to their trivial implementation. Lastly, the performance tests reveal that this software has a suitable behavior when the amount of processors is increased. Therefore, the QuBiLS-MIDAS software constitutes a useful application for the computation of the molecular indices based on N-linear algebraic maps and it can be used freely to perform chemoinformatics studies. Copyright © 2014 Wiley Periodicals, Inc.

  14. An algorithm to construct the basic algebra of a skew group algebra

    NARCIS (Netherlands)

    Horobeţ, E.

    2016-01-01

    We give an algorithm for the computation of the basic algebra Morita equivalent to a skew group algebra of a path algebra by obtaining formulas for the number of vertices and arrows of the new quiver Qb. We apply this algorithm to compute the basic algebra corresponding to all simple quaternion

  15. Applied linear algebra and matrix analysis

    CERN Document Server

    Shores, Thomas S

    2018-01-01

    In its second edition, this textbook offers a fresh approach to matrix and linear algebra. Its blend of theory, computational exercises, and analytical writing projects is designed to highlight the interplay between these aspects of an application. This approach places special emphasis on linear algebra as an experimental science that provides tools for solving concrete problems. The second edition’s revised text discusses applications of linear algebra like graph theory and network modeling methods used in Google’s PageRank algorithm. Other new materials include modeling examples of diffusive processes, linear programming, image processing, digital signal processing, and Fourier analysis. These topics are woven into the core material of Gaussian elimination and other matrix operations; eigenvalues, eigenvectors, and discrete dynamical systems; and the geometrical aspects of vector spaces. Intended for a one-semester undergraduate course without a strict calculus prerequisite, Applied Linear Algebra and M...

  16. Computational methods in drug discovery

    Directory of Open Access Journals (Sweden)

    Sumudu P. Leelananda

    2016-12-01

    Full Text Available The process for drug discovery and development is challenging, time consuming and expensive. Computer-aided drug discovery (CADD tools can act as a virtual shortcut, assisting in the expedition of this long process and potentially reducing the cost of research and development. Today CADD has become an effective and indispensable tool in therapeutic development. The human genome project has made available a substantial amount of sequence data that can be used in various drug discovery projects. Additionally, increasing knowledge of biological structures, as well as increasing computer power have made it possible to use computational methods effectively in various phases of the drug discovery and development pipeline. The importance of in silico tools is greater than ever before and has advanced pharmaceutical research. Here we present an overview of computational methods used in different facets of drug discovery and highlight some of the recent successes. In this review, both structure-based and ligand-based drug discovery methods are discussed. Advances in virtual high-throughput screening, protein structure prediction methods, protein–ligand docking, pharmacophore modeling and QSAR techniques are reviewed.

  17. Combinatorial methods with computer applications

    CERN Document Server

    Gross, Jonathan L

    2007-01-01

    Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation exp

  18. C*-algebras by example

    CERN Document Server

    Davidson, Kenneth R

    1996-01-01

    The subject of C*-algebras received a dramatic revitalization in the 1970s by the introduction of topological methods through the work of Brown, Douglas, and Fillmore on extensions of C*-algebras and Elliott's use of K-theory to provide a useful classification of AF algebras. These results were the beginning of a marvelous new set of tools for analyzing concrete C*-algebras. This book is an introductory graduate level text which presents the basics of the subject through a detailed analysis of several important classes of C*-algebras. The development of operator algebras in the last twenty yea

  19. Total photoionization cross-sections of excited electronic states by the algebraic diagrammatic construction-Stieltjes-Lanczos method.

    Science.gov (United States)

    Ruberti, M; Yun, R; Gokhberg, K; Kopelke, S; Cederbaum, L S; Tarantelli, F; Averbukh, V

    2014-05-14

    Here, we extend the L2 ab initio method for molecular photoionization cross-sections introduced in Gokhberg et al. [J. Chem. Phys. 130, 064104 (2009)] and benchmarked in Ruberti et al. [J. Chem. Phys. 139, 144107 (2013)] to the calculation of total photoionization cross-sections of molecules in electronically excited states. The method is based on the ab initio description of molecular electronic states within the many-electron Green's function approach, known as algebraic diagrammatic construction (ADC), and on the application of Stieltjes-Chebyshev moment theory to Lanczos pseudospectra of the ADC electronic Hamiltonian. The intermediate state representation of the dipole operator in the ADC basis is used to compute the transition moments between the excited states of the molecule. We compare the results obtained using different levels of the many-body theory, i.e., ADC(1), ADC(2), and ADC(2)x for the first two excited states of CO, N2, and H2O both at the ground state and the excited state equilibrium or saddle point geometries. We find that the single excitation ADC(1) method is not adequate even at the qualitative level and that the inclusion of double electronic excitations for description of excited state photoionization is essential. Moreover, we show that the use of the extended ADC(2)x method leads to a substantial systematic difference from the strictly second-order ADC(2). Our calculations demonstrate that a theoretical modelling of photoionization of excited states requires an intrinsically double excitation theory with respect to the ground state and cannot be achieved by the standard single excitation methods with the ground state as a reference.

  20. Finite difference method and algebraic polynomial interpolation for numerically solving Poisson's equation over arbitrary domains

    Directory of Open Access Journals (Sweden)

    Tsugio Fukuchi

    2014-06-01

    Full Text Available The finite difference method (FDM based on Cartesian coordinate systems can be applied to numerical analyses over any complex domain. A complex domain is usually taken to mean that the geometry of an immersed body in a fluid is complex; here, it means simply an analytical domain of arbitrary configuration. In such an approach, we do not need to treat the outer and inner boundaries differently in numerical calculations; both are treated in the same way. Using a method that adopts algebraic polynomial interpolations in the calculation around near-wall elements, all the calculations over irregular domains reduce to those over regular domains. Discretization of the space differential in the FDM is usually derived using the Taylor series expansion; however, if we use the polynomial interpolation systematically, exceptional advantages are gained in deriving high-order differences. In using the polynomial interpolations, we can numerically solve the Poisson equation freely over any complex domain. Only a particular type of partial differential equation, Poisson's equations, is treated; however, the arguments put forward have wider generality in numerical calculations using the FDM.

  1. Resolution of First- and Second-Order Linear Differential Equations with Periodic Inputs by a Computer Algebra System

    Directory of Open Access Journals (Sweden)

    M. Legua

    2008-01-01

    Full Text Available In signal processing, a pulse means a rapid change in the amplitude of a signal from a baseline value to a higher or lower value, followed by a rapid return to the baseline value. A square wave function may be viewed as a pulse that repeats its occurrence periodically but the return to the baseline value takes some time to happen. When these periodic functions act as inputs in dynamic systems, the standard tool commonly used to solve the associated initial value problem (IVP is Laplace transform and its inverse. We show how a computer algebra system may also provide the solution of these IVP straight forwardly by adequately introducing the periodic input.

  2. Boolean algebra

    CERN Document Server

    Goodstein, R L

    2007-01-01

    This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.

  3. A hyperpower iterative method for computing the generalized Drazin ...

    Indian Academy of Sciences (India)

    Shwetabh Srivastava

    [6, 7]. A number of direct and iterative methods for com- putation of the Drazin inverse were developed in [8–12]. Its extension to Banach algebras is known as the generalized Drazin inverse and was established in [13]. Let J denote the complex. Banach algebra with the unit 1. The generalized Drazin inverse of an element ...

  4. Universal algebra

    CERN Document Server

    Grätzer, George

    1979-01-01

    Universal Algebra, heralded as ". . . the standard reference in a field notorious for the lack of standardization . . .," has become the most authoritative, consistently relied on text in a field with applications in other branches of algebra and other fields such as combinatorics, geometry, and computer science. Each chapter is followed by an extensive list of exercises and problems. The "state of the art" account also includes new appendices (with contributions from B. Jónsson, R. Quackenbush, W. Taylor, and G. Wenzel) and a well-selected additional bibliography of over 1250 papers and books which makes this a fine work for students, instructors, and researchers in the field. "This book will certainly be, in the years to come, the basic reference to the subject." --- The American Mathematical Monthly (First Edition) "In this reviewer's opinion [the author] has more than succeeded in his aim. The problems at the end of each chapter are well-chosen; there are more than 650 of them. The book is especially sui...

  5. Computational methods for fluid dynamics

    CERN Document Server

    Ferziger, Joel H

    2002-01-01

    In its 3rd revised and extended edition the book offers an overview of the techniques used to solve problems in fluid mechanics on computers and describes in detail those most often used in practice. Included are advanced methods in computational fluid dynamics, like direct and large-eddy simulation of turbulence, multigrid methods, parallel computing, moving grids, structured, block-structured and unstructured boundary-fitted grids, free surface flows. The 3rd edition contains a new section dealing with grid quality and an extended description of discretization methods. The book shows common roots and basic principles for many different methods. The book also contains a great deal of practical advice for code developers and users, it is designed to be equally useful to beginners and experts. The issues of numerical accuracy, estimation and reduction of numerical errors are dealt with in detail, with many examples. A full-feature user-friendly demo-version of a commercial CFD software has been added, which ca...

  6. Jordan algebras versus C*- algebras

    International Nuclear Information System (INIS)

    Stormer, E.

    1976-01-01

    The axiomatic formulation of quantum mechanics and the problem of whether the observables form self-adjoint operators on a Hilbert space, are discussed. The relation between C*- algebras and Jordan algebras is studied using spectral theory. (P.D.)

  7. Numerical computer methods part E

    CERN Document Server

    Johnson, Michael L

    2004-01-01

    The contributions in this volume emphasize analysis of experimental data and analytical biochemistry, with examples taken from biochemistry. They serve to inform biomedical researchers of the modern data analysis methods that have developed concomitantly with computer hardware. Selected Contents: A practical approach to interpretation of SVD results; modeling of oscillations in endocrine networks with feedback; quantifying asynchronous breathing; sample entropy; wavelet modeling and processing of nasal airflow traces.

  8. Interactions Between Representation Ttheory, Algebraic Topology and Commutative Algebra

    CERN Document Server

    Pitsch, Wolfgang; Zarzuela, Santiago

    2016-01-01

    This book includes 33 expanded abstracts of selected talks given at the two workshops "Homological Bonds Between Commutative Algebra and Representation Theory" and "Brave New Algebra: Opening Perspectives," and the conference "Opening Perspectives in Algebra, Representations, and Topology," held at the Centre de Recerca Matemàtica (CRM) in Barcelona between January and June 2015. These activities were part of the one-semester intensive research program "Interactions Between Representation Theory, Algebraic Topology and Commutative Algebra (IRTATCA)." Most of the abstracts present preliminary versions of not-yet published results and cover a large number of topics (including commutative and non commutative algebra, algebraic topology, singularity theory, triangulated categories, representation theory) overlapping with homological methods. This comprehensive book is a valuable resource for the community of researchers interested in homological algebra in a broad sense, and those curious to learn the latest dev...

  9. Determining the closed forms of the O(α3s) anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra

    International Nuclear Information System (INIS)

    Bluemlein, Johannes; Klein, Sebastian; Kauers, Manuel; Schneider, Carsten

    2009-02-01

    Single scale quantities, as anomalous dimensions and hard scattering cross sections, in renormalizable Quantum Field Theories are found to obey difference equations of finite order in Mellin space. It is often easier to calculate fixed moments for these quantities compared to a direct attempt to derive them in terms of harmonic sums and their generalizations involving the Mellin parameter N. Starting from a sufficiently large number of given moments, we establish linear recurrence relations of lowest possible order with polynomial coefficients of usually high degree. Then these recurrence equations are solved in terms of d'Alembertian solutions where the involved nested sums are represented in optimal nested depth. Given this representation, it is then an easy task to express the result in terms of harmonic sums. In this process we compactify the result such that no algebraic relations occur among the sums involved. We demonstrate the method for the QCD unpolarized anomalous dimensions and massless Wilson coefficients to 3-loop order treating the contributions for individual color coefficients. For the most complicated subproblem 5114 moments were needed in order to produce a recurrence of order 35 whose coefficients have degrees up to 938. About four months of CPU time were needed to establish and solve the recurrences for the anomalous dimensions and Wilson coefficients on a 2 GHz machine requiring less than 10 GB of memory. No algorithm is known yet to provide such a high number of moments for 3-loop quantities. Yet the method presented shows that it is possible to establish and solve recurrences of rather large order and degree, occurring in physics problems, uniquely, fast and reliably with computer algebra. (orig.)

  10. Determining the closed forms of the O({alpha}{sup 3}{sub s}) anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra

    Energy Technology Data Exchange (ETDEWEB)

    Bluemlein, Johannes; Klein, Sebastian [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Kauers, Manuel; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation

    2009-02-15

    Single scale quantities, as anomalous dimensions and hard scattering cross sections, in renormalizable Quantum Field Theories are found to obey difference equations of finite order in Mellin space. It is often easier to calculate fixed moments for these quantities compared to a direct attempt to derive them in terms of harmonic sums and their generalizations involving the Mellin parameter N. Starting from a sufficiently large number of given moments, we establish linear recurrence relations of lowest possible order with polynomial coefficients of usually high degree. Then these recurrence equations are solved in terms of d'Alembertian solutions where the involved nested sums are represented in optimal nested depth. Given this representation, it is then an easy task to express the result in terms of harmonic sums. In this process we compactify the result such that no algebraic relations occur among the sums involved. We demonstrate the method for the QCD unpolarized anomalous dimensions and massless Wilson coefficients to 3-loop order treating the contributions for individual color coefficients. For the most complicated subproblem 5114 moments were needed in order to produce a recurrence of order 35 whose coefficients have degrees up to 938. About four months of CPU time were needed to establish and solve the recurrences for the anomalous dimensions and Wilson coefficients on a 2 GHz machine requiring less than 10 GB of memory. No algorithm is known yet to provide such a high number of moments for 3-loop quantities. Yet the method presented shows that it is possible to establish and solve recurrences of rather large order and degree, occurring in physics problems, uniquely, fast and reliably with computer algebra. (orig.)

  11. Computational methods for stellerator configurations

    International Nuclear Information System (INIS)

    Betancourt, O.

    1992-01-01

    This project had two main objectives. The first one was to continue to develop computational methods for the study of three dimensional magnetic confinement configurations. The second one was to collaborate and interact with researchers in the field who can use these techniques to study and design fusion experiments. The first objective has been achieved with the development of the spectral code BETAS and the formulation of a new variational approach for the study of magnetic island formation in a self consistent fashion. The code can compute the correct island width corresponding to the saturated island, a result shown by comparing the computed island with the results of unstable tearing modes in Tokamaks and with experimental results in the IMS Stellarator. In addition to studying three dimensional nonlinear effects in Tokamaks configurations, these self consistent computed island equilibria will be used to study transport effects due to magnetic island formation and to nonlinearly bifurcated equilibria. The second objective was achieved through direct collaboration with Steve Hirshman at Oak Ridge, D. Anderson and R. Talmage at Wisconsin as well as through participation in the Sherwood and APS meetings

  12. A rapid method for the computation of equilibrium chemical composition of air to 15000 K

    Science.gov (United States)

    Prabhu, Ramadas K.; Erickson, Wayne D.

    1988-01-01

    A rapid computational method has been developed to determine the chemical composition of equilibrium air to 15000 K. Eleven chemically reacting species, i.e., O2, N2, O, NO, N, NO+, e-, N+, O+, Ar, and Ar+ are included. The method involves combining algebraically seven nonlinear equilibrium equations and four linear elemental mass balance and charge neutrality equations. Computational speeds for determining the equilibrium chemical composition are significantly faster than the often used free energy minimization procedure. Data are also included from which the thermodynamic properties of air can be computed. A listing of the computer program together with a set of sample results are included.

  13. An extended algebraic variational multiscale-multigrid-multifractal method (XAVM4) for large-eddy simulation of turbulent two-phase flow

    Science.gov (United States)

    Rasthofer, U.; Wall, W. A.; Gravemeier, V.

    2018-04-01

    A novel and comprehensive computational method, referred to as the eXtended Algebraic Variational Multiscale-Multigrid-Multifractal Method (XAVM4), is proposed for large-eddy simulation of the particularly challenging problem of turbulent two-phase flow. The XAVM4 involves multifractal subgrid-scale modeling as well as a Nitsche-type extended finite element method as an approach for two-phase flow. The application of an advanced structural subgrid-scale modeling approach in conjunction with a sharp representation of the discontinuities at the interface between two bulk fluids promise high-fidelity large-eddy simulation of turbulent two-phase flow. The high potential of the XAVM4 is demonstrated for large-eddy simulation of turbulent two-phase bubbly channel flow, that is, turbulent channel flow carrying a single large bubble of the size of the channel half-width in this particular application.

  14. The relation between quantum W algebras and Lie algebras

    International Nuclear Information System (INIS)

    Boer, J. de; Tjin, T.

    1994-01-01

    By quantizing the generalized Drinfeld-Sokolov reduction scheme for arbitrary sl 2 embeddings we show that a large set W of quantum W algebras can be viewed as (BRST) cohomologies of affine Lie algebras. The set W contains many known W algebras such as W N and W 3 (2) . Our formalism yields a completely algorithmic method for calculating the W algebra generators and their operator product expansions, replacing the cumbersome construction of W algebras as commutants of screening operators. By generalizing and quantizing the Miura transformation we show that any W algebra in W can be embedded into the universal enveloping algebra of a semisimple affine Lie algebra which is, up to shifts in level, isomorphic to a subalgebra of the original affine algebra. Therefore any realization of this semisimple affine Lie algebra leads to a realization of the W algebra. In particular, one obtains in this way a general and explicit method for constructing the free field realizations and Fock resolutions for all algebras in W. Some examples are explicitly worked out. (orig.)

  15. Computational methods for molecular imaging

    CERN Document Server

    Shi, Kuangyu; Li, Shuo

    2015-01-01

    This volume contains original submissions on the development and application of molecular imaging computing. The editors invited authors to submit high-quality contributions on a wide range of topics including, but not limited to: • Image Synthesis & Reconstruction of Emission Tomography (PET, SPECT) and other Molecular Imaging Modalities • Molecular Imaging Enhancement • Data Analysis of Clinical & Pre-clinical Molecular Imaging • Multi-Modal Image Processing (PET/CT, PET/MR, SPECT/CT, etc.) • Machine Learning and Data Mining in Molecular Imaging. Molecular imaging is an evolving clinical and research discipline enabling the visualization, characterization and quantification of biological processes taking place at the cellular and subcellular levels within intact living subjects. Computational methods play an important role in the development of molecular imaging, from image synthesis to data analysis and from clinical diagnosis to therapy individualization. This work will bring readers fro...

  16. Tensor spaces and exterior algebra

    CERN Document Server

    Yokonuma, Takeo

    1992-01-01

    This book explains, as clearly as possible, tensors and such related topics as tensor products of vector spaces, tensor algebras, and exterior algebras. You will appreciate Yokonuma's lucid and methodical treatment of the subject. This book is useful in undergraduate and graduate courses in multilinear algebra. Tensor Spaces and Exterior Algebra begins with basic notions associated with tensors. To facilitate understanding of the definitions, Yokonuma often presents two or more different ways of describing one object. Next, the properties and applications of tensors are developed, including the classical definition of tensors and the description of relative tensors. Also discussed are the algebraic foundations of tensor calculus and applications of exterior algebra to determinants and to geometry. This book closes with an examination of algebraic systems with bilinear multiplication. In particular, Yokonuma discusses the theory of replicas of Chevalley and several properties of Lie algebras deduced from them.

  17. Quantum complexity of graph and algebraic problems

    International Nuclear Information System (INIS)

    Doern, Sebastian

    2008-01-01

    This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

  18. Quantum complexity of graph and algebraic problems

    Energy Technology Data Exchange (ETDEWEB)

    Doern, Sebastian

    2008-02-04

    This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

  19. Differential algebraic method for arbitrary order curvilinear-axis combined geometric-chromatic aberration analysis

    International Nuclear Information System (INIS)

    Cheng Min; Tang Tiantong; Lu Yilong; Yao Zhenhua

    2003-01-01

    The principle of differential algebra is applied to analyse and calculate arbitrary order curvilinear-axis combined geometric-chromatic aberrations of electron optical systems. Expressions of differential algebraic form of high order combined aberrations are obtained and arbitrary order combined aberrations can be calculated numerically. As an example, a typical wide electron beam focusing system with curved optical axes named magnetic immersion lens has been studied. All the second-order and third-order combined geometric-chromatic aberrations of the lens have been calculated, and the patterns of the corresponding geometric aberrations and combined aberrations have been given as well

  20. Templates for Linear Algebra Problems

    NARCIS (Netherlands)

    Bai, Z.; Day, D.; Demmel, J.; Dongarra, J.; Gu, M.; Ruhe, A.; Vorst, H.A. van der

    1995-01-01

    The increasing availability of advanced-architecture computers is having a very signicant eect on all spheres of scientic computation, including algorithm research and software development in numerical linear algebra. Linear algebra {in particular, the solution of linear systems of equations and

  1. MATLAB matrix algebra

    CERN Document Server

    Pérez López, César

    2014-01-01

    MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Matrix Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. Starting with a look at symbolic and numeric variables, with an emphasis on vector and matrix variables, you will go on to examine functions and operations that support vectors and matrices as arguments, including those based on analytic parent functions. Computational methods for finding eigenvalues and eigenvectors of matrices are detailed, leading to various matrix decompositions. Applications such as change of bases, the classification of quadratic forms and ...

  2. Projects Using a Computer Algebra System in First-Year Undergraduate Mathematics

    Science.gov (United States)

    Rosenzweig, Martin

    2007-01-01

    This paper illustrates the use of computer-based projects in two one-semester first-year undergraduate mathematics classes. Developed over a period of years, the approach is one in which the classes are organised into work-groups, with computer-based projects being undertaken periodically to illustrate the class material. These projects are…

  3. Providing Feedback on Computer-Based Algebra Homework in Middle-School Classrooms

    Science.gov (United States)

    Fyfe, Emily R.

    2016-01-01

    Homework is transforming at a rapid rate with continuous advances in educational technology. Computer-based homework, in particular, is gaining popularity across a range of schools, with little empirical evidence on how to optimize student learning. The current aim was to test the effects of different types of feedback on computer-based homework.…

  4. Hopf algebras in noncommutative geometry

    International Nuclear Information System (INIS)

    Varilly, Joseph C.

    2001-10-01

    We give an introductory survey to the use of Hopf algebras in several problems of non- commutative geometry. The main example, the Hopf algebra of rooted trees, is a graded, connected Hopf algebra arising from a universal construction. We show its relation to the algebra of transverse differential operators introduced by Connes and Moscovici in order to compute a local index formula in cyclic cohomology, and to the several Hopf algebras defined by Connes and Kreimer to simplify the combinatorics of perturbative renormalization. We explain how characteristic classes for a Hopf module algebra can be obtained from the cyclic cohomology of the Hopf algebra which acts on it. Finally, we discuss the theory of non- commutative spherical manifolds and show how they arise as homogeneous spaces of certain compact quantum groups. (author)

  5. A new generalized algebra method and its application in the (2 + 1) dimensional Boiti-Leon-Pempinelli equation

    International Nuclear Information System (INIS)

    Ren Yujie; Liu Shutian; Zhang Hongqing

    2007-01-01

    In the present paper, some types of general solutions of a first-order nonlinear ordinary differential equation with six degree are given and a new generalized algebra method is presented to find more exact solutions of nonlinear differential equations. As an application of the method and the solutions of this equation, we choose the (2 + 1) dimensional Boiti Leon Pempinelli equation to illustrate the validity and advantages of the method. As a consequence, more new types and general solutions are found which include rational solutions and irrational solutions and so on. The new method can also be applied to other nonlinear differential equations in mathematical physics

  6. Separable algebras

    CERN Document Server

    Ford, Timothy J

    2017-01-01

    This book presents a comprehensive introduction to the theory of separable algebras over commutative rings. After a thorough introduction to the general theory, the fundamental roles played by separable algebras are explored. For example, Azumaya algebras, the henselization of local rings, and Galois theory are rigorously introduced and treated. Interwoven throughout these applications is the important notion of étale algebras. Essential connections are drawn between the theory of separable algebras and Morita theory, the theory of faithfully flat descent, cohomology, derivations, differentials, reflexive lattices, maximal orders, and class groups. The text is accessible to graduate students who have finished a first course in algebra, and it includes necessary foundational material, useful exercises, and many nontrivial examples.

  7. An efficient computer based wavelets approximation method to solve Fuzzy boundary value differential equations

    Science.gov (United States)

    Alam Khan, Najeeb; Razzaq, Oyoon Abdul

    2016-03-01

    In the present work a wavelets approximation method is employed to solve fuzzy boundary value differential equations (FBVDEs). Essentially, a truncated Legendre wavelets series together with the Legendre wavelets operational matrix of derivative are utilized to convert FB- VDE into a simple computational problem by reducing it into a system of fuzzy algebraic linear equations. The capability of scheme is investigated on second order FB- VDE considered under generalized H-differentiability. Solutions are represented graphically showing competency and accuracy of this method.

  8. Fast computation of the characteristics method on vector computers

    International Nuclear Information System (INIS)

    Kugo, Teruhiko

    2001-11-01

    Fast computation of the characteristics method to solve the neutron transport equation in a heterogeneous geometry has been studied. Two vector computation algorithms; an odd-even sweep (OES) method and an independent sequential sweep (ISS) method have been developed and their efficiency to a typical fuel assembly calculation has been investigated. For both methods, a vector computation is 15 times faster than a scalar computation. From a viewpoint of comparison between the OES and ISS methods, the followings are found: 1) there is a small difference in a computation speed, 2) the ISS method shows a faster convergence and 3) the ISS method saves about 80% of computer memory size compared with the OES method. It is, therefore, concluded that the ISS method is superior to the OES method as a vectorization method. In the vector computation, a table-look-up method to reduce computation time of an exponential function saves only 20% of a whole computation time. Both the coarse mesh rebalance method and the Aitken acceleration method are effective as acceleration methods for the characteristics method, a combination of them saves 70-80% of outer iterations compared with a free iteration. (author)

  9. Categorical Algebra and its Applications

    CERN Document Server

    1988-01-01

    Categorical algebra and its applications contain several fundamental papers on general category theory, by the top specialists in the field, and many interesting papers on the applications of category theory in functional analysis, algebraic topology, algebraic geometry, general topology, ring theory, cohomology, differential geometry, group theory, mathematical logic and computer sciences. The volume contains 28 carefully selected and refereed papers, out of 96 talks delivered, and illustrates the usefulness of category theory today as a powerful tool of investigation in many other areas.

  10. Geometric Algebra Techniques in Flux Compactifications

    International Nuclear Information System (INIS)

    Coman, Ioana Alexandra; Lazaroiu, Calin Iuliu; Babalic, Elena Mirela

    2016-01-01

    We study “constrained generalized Killing (s)pinors,” which characterize supersymmetric flux compactifications of supergravity theories. Using geometric algebra techniques, we give conceptually clear and computationally effective methods for translating supersymmetry conditions into differential and algebraic constraints on collections of differential forms. In particular, we give a synthetic description of Fierz identities, which are an important ingredient of such problems. As an application, we show how our approach can be used to efficiently treat N=1 compactification of M-theory on eight manifolds and prove that we recover results previously obtained in the literature.

  11. Current algebra and differential geometry

    International Nuclear Information System (INIS)

    Alekseev, Anton; Strobl, Thomas

    2005-01-01

    We show that symmetries and gauge symmetries of a large class of 2-dimensional sigma models are described by a new type of a current algebra. The currents are labeled by pairs of a vector field and a 1-form on the target space of the sigma model. We compute the current-current commutator and analyse the anomaly cancellation condition, which can be interpreted geometrically in terms of Dirac structures, previously studied in the mathematical literature. Generalized complex structures correspond to decompositions of the current algebra into pairs of anomaly free subalgebras. Sigma models that we can treat with our method include both physical and topological examples, with and without Wess-Zumino type terms. (author)

  12. NCT-ART - a neutron computer tomography code based on the algebraic reconstruction technique

    International Nuclear Information System (INIS)

    Krueger, A.

    1988-01-01

    A computer code is presented, which calculates two-dimensional cuts of material assemblies from a number of neutron radiographic projections. Mathematically, the reconstruction is performed by an iterative solution of a system of linear equations. If the system is fully determined, clear pictures are obtained. Even for an underdetermined system (low number of projections) reasonable pictures are reconstructed, but then picture artefacts and convergence problems occur increasingly. (orig.) With 37 figs [de

  13. Efficient Adjoint Computation of Hybrid Systems of Differential Algebraic Equations with Applications in Power Systems

    Energy Technology Data Exchange (ETDEWEB)

    Abhyankar, Shrirang [Argonne National Lab. (ANL), Argonne, IL (United States); Anitescu, Mihai [Argonne National Lab. (ANL), Argonne, IL (United States); Constantinescu, Emil [Argonne National Lab. (ANL), Argonne, IL (United States); Zhang, Hong [Argonne National Lab. (ANL), Argonne, IL (United States)

    2016-03-31

    Sensitivity analysis is an important tool to describe power system dynamic behavior in response to parameter variations. It is a central component in preventive and corrective control applications. The existing approaches for sensitivity calculations, namely, finite-difference and forward sensitivity analysis, require a computational effort that increases linearly with the number of sensitivity parameters. In this work, we investigate, implement, and test a discrete adjoint sensitivity approach whose computational effort is effectively independent of the number of sensitivity parameters. The proposed approach is highly efficient for calculating trajectory sensitivities of larger systems and is consistent, within machine precision, with the function whose sensitivity we are seeking. This is an essential feature for use in optimization applications. Moreover, our approach includes a consistent treatment of systems with switching, such as DC exciters, by deriving and implementing the adjoint jump conditions that arise from state and time-dependent discontinuities. The accuracy and the computational efficiency of the proposed approach are demonstrated in comparison with the forward sensitivity analysis approach.

  14. Advanced methods for the computation of particle beam transport and the computation of electromagnetic fields and beam-cavity interactions

    International Nuclear Information System (INIS)

    Dragt, A.J.; Gluckstern, R.L.

    1992-11-01

    The University of Maryland Dynamical Systems and Accelerator Theory Group carries out research in two broad areas: the computation of charged particle beam transport using Lie algebraic methods and advanced methods for the computation of electromagnetic fields and beam-cavity interactions. Important improvements in the state of the art are believed to be possible in both of these areas. In addition, applications of these methods are made to problems of current interest in accelerator physics including the theoretical performance of present and proposed high energy machines. The Lie algebraic method of computing and analyzing beam transport handles both linear and nonlinear beam elements. Tests show this method to be superior to the earlier matrix or numerical integration methods. It has wide application to many areas including accelerator physics, intense particle beams, ion microprobes, high resolution electron microscopy, and light optics. With regard to the area of electromagnetic fields and beam cavity interactions, work is carried out on the theory of beam breakup in single pulses. Work is also done on the analysis of the high frequency behavior of longitudinal and transverse coupling impedances, including the examination of methods which may be used to measure these impedances. Finally, work is performed on the electromagnetic analysis of coupled cavities and on the coupling of cavities to waveguides

  15. Linear Algebra and Smarandache Linear Algebra

    OpenAIRE

    Vasantha, Kandasamy

    2003-01-01

    The present book, on Smarandache linear algebra, not only studies the Smarandache analogues of linear algebra and its applications, it also aims to bridge the need for new research topics pertaining to linear algebra, purely in the algebraic sense. We have introduced Smarandache semilinear algebra, Smarandache bilinear algebra and Smarandache anti-linear algebra and their fuzzy equivalents. Moreover, in this book, we have brought out the study of linear algebra and vector spaces over finite p...

  16. Generating matrix elements of the hamiltonian of the algebraic version of resonating group method on intrinsic wave functions with various oscillator lengths

    International Nuclear Information System (INIS)

    Badalov, S.A.; Filippov, G.F.

    1986-01-01

    The receipts to calculate the generating matrix elements of the algebraic version of resonating group method (RGM) are given for two- and three-cluster nucleon systems, the center of mass motion being separeted exactly. For the Hamiltonian with Gaussian nucleon-nucleon potential dependence the generating matrix elements of the RGM algebraic version can be written down explictly if matrix elements of the corresponding system on wave functions of the Brink cluster model are known

  17. Flexibility of Bricard's linkages and other structures via resultants and computer algebra.

    Science.gov (United States)

    Lewis, Robert H; Coutsias, Evangelos A

    2016-07-01

    Flexibility of structures is extremely important for chemistry and robotics. Following our earlier work, we study flexibility using polynomial equations, resultants, and a symbolic algorithm of our creation that analyzes the resultant. We show that the software solves a classic arrangement of quadrilaterals in the plane due to Bricard. We fill in several gaps in Bricard's work and discover new flexible arrangements that he was apparently unaware of. This provides strong evidence for the maturity of the software, and is a wonderful example of mathematical discovery via computer assisted experiment.

  18. Chiral algebras for trinion theories

    International Nuclear Information System (INIS)

    Lemos, Madalena; Peelaers, Wolfger

    2015-01-01

    It was recently understood that one can identify a chiral algebra in any four-dimensional N=2 superconformal theory. In this note, we conjecture the full set of generators of the chiral algebras associated with the T n theories. The conjecture is motivated by making manifest the critical affine module structure in the graded partition function of the chiral algebras, which is computed by the Schur limit of the superconformal index for T n theories. We also explicitly construct the chiral algebra arising from the T 4 theory. Its null relations give rise to new T 4 Higgs branch chiral ring relations.

  19. Linear Algebra and Image Processing

    Science.gov (United States)

    Allali, Mohamed

    2010-01-01

    We use the computing technology digital image processing (DIP) to enhance the teaching of linear algebra so as to make the course more visual and interesting. Certainly, this visual approach by using technology to link linear algebra to DIP is interesting and unexpected to both students as well as many faculty. (Contains 2 tables and 11 figures.)

  20. Chiral determinant formulae and subsingular vectors for the N=2 superconformal algebras

    International Nuclear Information System (INIS)

    Gato-Rivera, B.; Rosado, J.I.

    1997-01-01

    We derive conjectures for the N=2 ''chiral'' determinant formulae of the topological algebra, the antiperiodic NS algebra, and the periodic R-algebra, corresponding to incomplete Verma modules built on chiral topological primaries, chiral and antichiral NS primaries, and Ramond ground states, respectively. Our method is based on the analysis of the singular vectors in chiral Verma modules and their spectral flow symmetries, together with some computer exploration and some consistency checks. In addition, and as a consequence, we uncover the existence of subsingular vectors in these algebras, giving examples (subsingular vectors are non-highest-weight null vectors which are not descendants of any highest-weight singular vectors). (orig.)

  1. Extended Kac-Moody algebras and applications

    International Nuclear Information System (INIS)

    Ragoucy, E.; Sorba, P.

    1991-04-01

    The notion of a Kac-Moody algebra defined on the S 1 circle is extended to super Kac-Moody algebras defined on MxG N , M being a smooth closed compact manifold of dimension greater than one, and G N the Grassman algebra with N generators. All the central extensions of these algebras are computed. Then, for each such algebra the derivation algebra constructed from the MxG N diffeomorphism is determined. The twists of such super Kac-Moody algebras as well as the generalization to non-compact surfaces are partially studied. Finally, the general construction is applied to the study of conformal and superconformal algebras, as well as area-preserving diffeomorphisms algebra and its supersymmetric extension. (author) 65 refs

  2. Abstract algebra

    CERN Document Server

    Garrett, Paul B

    2007-01-01

    Designed for an advanced undergraduate- or graduate-level course, Abstract Algebra provides an example-oriented, less heavily symbolic approach to abstract algebra. The text emphasizes specifics such as basic number theory, polynomials, finite fields, as well as linear and multilinear algebra. This classroom-tested, how-to manual takes a more narrative approach than the stiff formalism of many other textbooks, presenting coherent storylines to convey crucial ideas in a student-friendly, accessible manner. An unusual feature of the text is the systematic characterization of objects by universal

  3. College algebra

    CERN Document Server

    Kolman, Bernard

    1985-01-01

    College Algebra, Second Edition is a comprehensive presentation of the fundamental concepts and techniques of algebra. The book incorporates some improvements from the previous edition to provide a better learning experience. It provides sufficient materials for use in the study of college algebra. It contains chapters that are devoted to various mathematical concepts, such as the real number system, the theory of polynomial equations, exponential and logarithmic functions, and the geometric definition of each conic section. Progress checks, warnings, and features are inserted. Every chapter c

  4. QUANTUM: A Wolfram Mathematica add-on for Dirac Bra-Ket Notation, Non-Commutative Algebra, and Simulation of Quantum Computing Circuits

    International Nuclear Information System (INIS)

    Muñoz, J L Gómez; Delgado, F

    2016-01-01

    This paper introduces QUANTUM, a free library of commands of Wolfram Mathematica that can be used to perform calculations directly in Dirac braket and operator notation. Its development started several years ago, in order to study quantum random walks. Later, many other features were included, like operator and commutator algebra, simulation and graphing of quantum computing circuits, generation and solution of Heisenberg equations of motion, among others. To the best of our knowledge, QUANTUM remains a unique tool in its use of Dirac notation, because it is used both in the input and output of the calculations. This work depicts its usage and features in Quantum Computing and Quantum Hamilton Dynamics. (paper)

  5. Computational methods for reversed-field equilibrium

    International Nuclear Information System (INIS)

    Boyd, J.K.; Auerbach, S.P.; Willmann, P.A.; Berk, H.L.; McNamara, B.

    1980-01-01

    Investigating the temporal evolution of reversed-field equilibrium caused by transport processes requires the solution of the Grad-Shafranov equation and computation of field-line-averaged quantities. The technique for field-line averaging and the computation of the Grad-Shafranov equation are presented. Application of Green's function to specify the Grad-Shafranov equation boundary condition is discussed. Hill's vortex formulas used to verify certain computations are detailed. Use of computer software to implement computational methods is described

  6. Infinite dimension algebra and conformal symmetry

    International Nuclear Information System (INIS)

    Ragoucy-Aubezon, E.

    1991-04-01

    A generalisation of Kac-Moody algebras (current algebras defined on a circle) to algebras defined on a compact supermanifold of any dimension and with any number of supersymmetries is presented. For such a purpose, we compute all the central extensions of loop algebras defined on this supermanifold, i.e. all the cohomology classes of these loop algebras. Then, we try to extend the relation (i.e. semi-direct sum) that exists between the two dimensional conformal algebras (called Virasoro algebra) and the usual Kac-Moody algebras, by considering the derivation algebra of our extended Kac-Moody algebras. The case of superconformal algebras (used in superstrings theories) is treated, as well as the cases of area-preserving diffeomorphisms (used in membranes theories), and Krichever-Novikov algebras (used for interacting strings). Finally, we present some generalizations of the Sugawara construction to the cases of extended Kac-Moody algebras, and Kac-Moody of superalgebras. These constructions allow us to get new realizations of the Virasoro, and Ramond, Neveu-Schwarz algebras

  7. Data driven linear algebraic methods for analysis of molecular pathways: application to disease progression in shock/trauma.

    Science.gov (United States)

    McGuire, Mary F; Sriram Iyengar, M; Mercer, David W

    2012-04-01

    Although trauma is the leading cause of death for those below 45years of age, there is a dearth of information about the temporal behavior of the underlying biological mechanisms in those who survive the initial trauma only to later suffer from syndromes such as multiple organ failure. Levels of serum cytokines potentially affect the clinical outcomes of trauma; understanding how cytokine levels modulate intra-cellular signaling pathways can yield insights into molecular mechanisms of disease progression and help to identify targeted therapies. However, developing such analyses is challenging since it necessitates the integration and interpretation of large amounts of heterogeneous, quantitative and qualitative data. Here we present the Pathway Semantics Algorithm (PSA), an algebraic process of node and edge analyses of evoked biological pathways over time for in silico discovery of biomedical hypotheses, using data from a prospective controlled clinical study of the role of cytokines in multiple organ failure (MOF) at a major US trauma center. A matrix algebra approach was used in both the PSA node and PSA edge analyses with different matrix configurations and computations based on the biomedical questions to be examined. In the edge analysis, a percentage measure of crosstalk called XTALK was also developed to assess cross-pathway interference. In the node/molecular analysis of the first 24h from trauma, PSA uncovered seven molecules evoked computationally that differentiated outcomes of MOF or non-MOF (NMOF), of which three molecules had not been previously associated with any shock/trauma syndrome. In the edge/molecular interaction analysis, PSA examined four categories of functional molecular interaction relationships--activation, expression, inhibition, and transcription--and found that the interaction patterns and crosstalk changed over time and outcome. The PSA edge analysis suggests that a diagnosis, prognosis or therapy based on molecular interaction

  8. Real space process algebra

    NARCIS (Netherlands)

    Bergstra, J.A.; Baeten, J.C.M.

    1993-01-01

    The real time process algebra of Baeten and Bergstra [Formal Aspects of Computing, 3, 142-188 (1991)] is extended to real space by requiring the presence of spatial coordinates for each atomic action, in addition to the required temporal attribute. It is found that asynchronous communication

  9. Principles of algebraic geometry

    CERN Document Server

    Griffiths, Phillip A

    1994-01-01

    A comprehensive, self-contained treatment presenting general results of the theory. Establishes a geometric intuition and a working facility with specific geometric practices. Emphasizes applications through the study of interesting examples and the development of computational tools. Coverage ranges from analytic to geometric. Treats basic techniques and results of complex manifold theory, focusing on results applicable to projective varieties, and includes discussion of the theory of Riemann surfaces and algebraic curves, algebraic surfaces and the quadric line complex as well as special top

  10. Handbook of linear algebra

    CERN Document Server

    Hogben, Leslie

    2013-01-01

    With a substantial amount of new material, the Handbook of Linear Algebra, Second Edition provides comprehensive coverage of linear algebra concepts, applications, and computational software packages in an easy-to-use format. It guides you from the very elementary aspects of the subject to the frontiers of current research. Along with revisions and updates throughout, the second edition of this bestseller includes 20 new chapters.New to the Second EditionSeparate chapters on Schur complements, additional types of canonical forms, tensors, matrix polynomials, matrix equations, special types of

  11. An algorithm for analysis of the structure of finitely presented Lie algebras

    Directory of Open Access Journals (Sweden)

    Vladimir P. Gerdt

    1997-12-01

    Full Text Available We consider the following problem: what is the most general Lie algebra satisfying a given set of Lie polynomial equations? The presentation of Lie algebras by a finite set of generators and defining relations is one of the most general mathematical and algorithmic schemes of their analysis. That problem is of great practical importance, covering applications ranging from mathematical physics to combinatorial algebra. Some particular applications are constructionof prolongation algebras in the Wahlquist-Estabrook method for integrability analysis of nonlinear partial differential equations and investigation of Lie algebras arising in different physical models. The finite presentations also indicate a way to q-quantize Lie algebras. To solve this problem, one should perform a large volume of algebraic transformations which is sharply increased with growth of the number of generators and relations. For this reason, in practice one needs to use a computer algebra tool. We describe here an algorithm for constructing the basis of a finitely presented Lie algebra and its commutator table, and its implementation in the C language. Some computer results illustrating our algorithmand its actual implementation are also presented.

  12. Ada Linear-Algebra Program

    Science.gov (United States)

    Klumpp, A. R.; Lawson, C. L.

    1988-01-01

    Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.

  13. Algebraic entropy for algebraic maps

    International Nuclear Information System (INIS)

    Hone, A N W; Ragnisco, Orlando; Zullo, Federico

    2016-01-01

    We propose an extension of the concept of algebraic entropy, as introduced by Bellon and Viallet for rational maps, to algebraic maps (or correspondences) of a certain kind. The corresponding entropy is an index of the complexity of the map. The definition inherits the basic properties from the definition of entropy for rational maps. We give an example with positive entropy, as well as two examples taken from the theory of Bäcklund transformations. (letter)

  14. Basic linear algebra

    CERN Document Server

    Blyth, T S

    2002-01-01

    Basic Linear Algebra is a text for first year students leading from concrete examples to abstract theorems, via tutorial-type exercises. More exercises (of the kind a student may expect in examination papers) are grouped at the end of each section. The book covers the most important basics of any first course on linear algebra, explaining the algebra of matrices with applications to analytic geometry, systems of linear equations, difference equations and complex numbers. Linear equations are treated via Hermite normal forms which provides a successful and concrete explanation of the notion of linear independence. Another important highlight is the connection between linear mappings and matrices leading to the change of basis theorem which opens the door to the notion of similarity. This new and revised edition features additional exercises and coverage of Cramer's rule (omitted from the first edition). However, it is the new, extra chapter on computer assistance that will be of particular interest to readers:...

  15. Generalizing the bms3 and 2D-conformal algebras by expanding the Virasoro algebra

    Science.gov (United States)

    Caroca, Ricardo; Concha, Patrick; Rodríguez, Evelyn; Salgado-Rebolledo, Patricio

    2018-03-01

    By means of the Lie algebra expansion method, the centrally extended conformal algebra in two dimensions and the bms3 algebra are obtained from the Virasoro algebra. We extend this result to construct new families of expanded Virasoro algebras that turn out to be infinite-dimensional lifts of the so-called Bk, Ck and Dk algebras recently introduced in the literature in the context of (super)gravity. We also show how some of these new infinite-dimensional symmetries can be obtained from expanded Kač-Moody algebras using modified Sugawara constructions. Applications in the context of three-dimensional gravity are briefly discussed.

  16. Einstein algebras and general relativity

    International Nuclear Information System (INIS)

    Heller, M.

    1992-01-01

    A purely algebraic structure called an Einstein algebra is defined in such a way that every spacetime satisfying Einstein's equations is an Einstein algebra but not vice versa. The Gelfand representation of Einstein algebras is defined, and two of its subrepresentations are discussed. One of them is equivalent to the global formulation of the standard theory of general relativity; the other one leads to a more general theory of gravitation which, in particular, includes so-called regular singularities. In order to include other types of singularities one must change to sheaves of Einstein algebras. They are defined and briefly discussed. As a test of the proposed method, the sheaf of Einstein algebras corresponding to the space-time of a straight cosmic string with quasiregular singularity is constructed. 22 refs

  17. Novel methods in computational finance

    CERN Document Server

    Günther, Michael; Maten, E

    2017-01-01

    This book discusses the state-of-the-art and open problems in computational finance. It presents a collection of research outcomes and reviews of the work from the STRIKE project, an FP7 Marie Curie Initial Training Network (ITN) project in which academic partners trained early-stage researchers in close cooperation with a broader range of associated partners, including from the private sector. The aim of the project was to arrive at a deeper understanding of complex (mostly nonlinear) financial models and to develop effective and robust numerical schemes for solving linear and nonlinear problems arising from the mathematical theory of pricing financial derivatives and related financial products. This was accomplished by means of financial modelling, mathematical analysis and numerical simulations, optimal control techniques and validation of models. In recent years the computational complexity of mathematical models employed in financial mathematics has witnessed tremendous growth. Advanced numerical techni...

  18. COMPUTER METHODS OF GENETIC ANALYSIS.

    Directory of Open Access Journals (Sweden)

    A. L. Osipov

    2017-02-01

    Full Text Available The basic statistical methods used in conducting the genetic analysis of human traits. We studied by segregation analysis, linkage analysis and allelic associations. Developed software for the implementation of these methods support.

  19. Computational methods in drug discovery

    OpenAIRE

    Sumudu P. Leelananda; Steffen Lindert

    2016-01-01

    The process for drug discovery and development is challenging, time consuming and expensive. Computer-aided drug discovery (CADD) tools can act as a virtual shortcut, assisting in the expedition of this long process and potentially reducing the cost of research and development. Today CADD has become an effective and indispensable tool in therapeutic development. The human genome project has made available a substantial amount of sequence data that can be used in various drug discovery project...

  20. The algebraic collective model

    International Nuclear Information System (INIS)

    Rowe, D.J.; Turner, P.S.

    2005-01-01

    A recently proposed computationally tractable version of the Bohr collective model is developed to the extent that we are now justified in describing it as an algebraic collective model. The model has an SU(1,1)xSO(5) algebraic structure and a continuous set of exactly solvable limits. Moreover, it provides bases for mixed symmetry collective model calculations. However, unlike the standard realization of SU(1,1), used for computing beta wave functions and their matrix elements in a spherical basis, the algebraic collective model makes use of an SU(1,1) algebra that generates wave functions appropriate for deformed nuclei with intrinsic quadrupole moments ranging from zero to any large value. A previous paper focused on the SO(5) wave functions, as SO(5) (hyper-)spherical harmonics, and computation of their matrix elements. This paper gives analytical expressions for the beta matrix elements needed in applications of the model and illustrative results to show the remarkable gain in efficiency that is achieved by using such a basis in collective model calculations for deformed nuclei

  1. On some methods of achieving a continuous and differentiated assessment in Linear Algebra and Analytic and Differential Geometry courses and seminars

    Directory of Open Access Journals (Sweden)

    M. A.P. PURCARU

    2017-12-01

    Full Text Available This paper aims at highlighting some aspects related to assessment as regards its use as a differentiated training strategy for Linear Algebra and Analytic and Differential Geometry courses and seminars. Thus, the following methods of continuous differentiated assessment are analyzed and exemplified: the portfolio, the role play, some interactive methods and practical examinations.

  2. SAGA advances in ShApes, Geometry, and Algebra : results from the Marie Curie initial training network

    CERN Document Server

    Muntingh, Georg

    2014-01-01

    This book summarizes research carried out in workshops of the SAGA project, an Initial Training Network exploring the interplay of Shapes, Algebra, Geometry and Algorithms. Written by a combination of young and experienced researchers, the book introduces new ideas in an established context. Among the central topics are approximate and sparse implicitization and surface parametrization; algebraic tools for geometric computing; algebraic geometry for computer aided design applications and problems with industrial applications. Readers will encounter new methods for the (approximate) transition between the implicit and parametric representation; new algebraic tools for geometric computing; new applications of isogeometric analysis, and will gain insight into the emerging research field situated between algebraic geometry and computer aided geometric design.

  3. Algorithmic algebraic geometry and flux vacua

    International Nuclear Information System (INIS)

    Gray, James; He Yanghui; Lukas, Andre

    2006-01-01

    We develop a new and efficient method to systematically analyse four dimensional effective supergravities which descend from flux compactifications. The issue of finding vacua of such systems, both supersymmetric and non-supersymmetric, is mapped into a problem in computational algebraic geometry. Using recent developments in computer algebra, the problem can then be rapidly dealt with in a completely algorithmic fashion. Two main results are (1) a procedure for calculating constraints which the flux parameters must satisfy in these models if any given type of vacuum is to exist; (2) a stepwise process for finding all of the isolated vacua of such systems and their physical properties. We illustrate our discussion with several concrete examples, some of which have eluded conventional methods so far

  4. Hybrid Monte Carlo methods in computational finance

    NARCIS (Netherlands)

    Leitao Rodriguez, A.

    2017-01-01

    Monte Carlo methods are highly appreciated and intensively employed in computational finance in the context of financial derivatives valuation or risk management. The method offers valuable advantages like flexibility, easy interpretation and straightforward implementation. Furthermore, the

  5. Algebraic dynamics solutions and algebraic dynamics algorithm for nonlinear ordinary differential equations

    Institute of Scientific and Technical Information of China (English)

    WANG; Shunjin; ZHANG; Hua

    2006-01-01

    The problem of preserving fidelity in numerical computation of nonlinear ordinary differential equations is studied in terms of preserving local differential structure and approximating global integration structure of the dynamical system.The ordinary differential equations are lifted to the corresponding partial differential equations in the framework of algebraic dynamics,and a new algorithm-algebraic dynamics algorithm is proposed based on the exact analytical solutions of the ordinary differential equations by the algebraic dynamics method.In the new algorithm,the time evolution of the ordinary differential system is described locally by the time translation operator and globally by the time evolution operator.The exact analytical piece-like solution of the ordinary differential equations is expressd in terms of Taylor series with a local convergent radius,and its finite order truncation leads to the new numerical algorithm with a controllable precision better than Runge Kutta Algorithm and Symplectic Geometric Algorithm.

  6. Advanced computational electromagnetic methods and applications

    CERN Document Server

    Li, Wenxing; Elsherbeni, Atef; Rahmat-Samii, Yahya

    2015-01-01

    This new resource covers the latest developments in computational electromagnetic methods, with emphasis on cutting-edge applications. This book is designed to extend existing literature to the latest development in computational electromagnetic methods, which are of interest to readers in both academic and industrial areas. The topics include advanced techniques in MoM, FEM and FDTD, spectral domain method, GPU and Phi hardware acceleration, metamaterials, frequency and time domain integral equations, and statistics methods in bio-electromagnetics.

  7. Computational Methods for Biomolecular Electrostatics

    Science.gov (United States)

    Dong, Feng; Olsen, Brett; Baker, Nathan A.

    2008-01-01

    An understanding of intermolecular interactions is essential for insight into how cells develop, operate, communicate and control their activities. Such interactions include several components: contributions from linear, angular, and torsional forces in covalent bonds, van der Waals forces, as well as electrostatics. Among the various components of molecular interactions, electrostatics are of special importance because of their long range and their influence on polar or charged molecules, including water, aqueous ions, and amino or nucleic acids, which are some of the primary components of living systems. Electrostatics, therefore, play important roles in determining the structure, motion and function of a wide range of biological molecules. This chapter presents a brief overview of electrostatic interactions in cellular systems with a particular focus on how computational tools can be used to investigate these types of interactions. PMID:17964951

  8. Linear algebra

    CERN Document Server

    Stoll, R R

    1968-01-01

    Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand

  9. Lie algebras

    CERN Document Server

    Jacobson, Nathan

    1979-01-01

    Lie group theory, developed by M. Sophus Lie in the 19th century, ranks among the more important developments in modern mathematics. Lie algebras comprise a significant part of Lie group theory and are being actively studied today. This book, by Professor Nathan Jacobson of Yale, is the definitive treatment of the subject and can be used as a textbook for graduate courses.Chapter I introduces basic concepts that are necessary for an understanding of structure theory, while the following three chapters present the theory itself: solvable and nilpotent Lie algebras, Carlan's criterion and its

  10. Basic algebra

    CERN Document Server

    Jacobson, Nathan

    2009-01-01

    A classic text and standard reference for a generation, this volume and its companion are the work of an expert algebraist who taught at Yale for two decades. Nathan Jacobson's books possess a conceptual and theoretical orientation, and in addition to their value as classroom texts, they serve as valuable references.Volume I explores all of the topics typically covered in undergraduate courses, including the rudiments of set theory, group theory, rings, modules, Galois theory, polynomials, linear algebra, and associative algebra. Its comprehensive treatment extends to such rigorous topics as L

  11. ASYS2: a new version of computer algebra package ASYS for analysis and simplification of polynomial systems

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Khutornoj, N.V.

    1993-01-01

    In this paper a new version of a package ASYS for analysis of nonlinear algebraic equations based on the Groebner basis technique is described. In addition to the first version ASYS1 of the package, the current one has a number of new facilities which provide its higher efficiency. Some examples and results of comparison between ASYS2, ASYS1 and two other REDUCE packages GROEBNER and CALI included in REDUCE 3.5, are given. 16 refs., 4 tabs

  12. ALGEBRAIC TOPOLOGY

    Indian Academy of Sciences (India)

    tion - 6. How Architectural Features Affect. Building During Earthquakes? C VRMurty. 48 Turbulence and Dispersion. K 5 Gandhi. BOOK REVIEWS. 86 Algebraic Topology. Siddhartha Gadgil. Front Cover. - .. ..-.......... -. Back Cover. Two-dimensional vertical section through a turbulent plume. (Courtesy: G S Shat, CAOS, IISc.).

  13. Algebraic stacks

    Indian Academy of Sciences (India)

    Deligne, Mumford and Artin [DM, Ar2]) and consider algebraic stacks, then we can cons- truct the 'moduli ... the moduli scheme and the moduli stack of vector bundles. First I will give ... 1–31. © Printed in India. 1 ...... Cultura, Spain. References.

  14. Edix: A Software for Editing Algebraic Expressions.

    OpenAIRE

    Bouhineau , Denis; Nicaud , Jean-François; Pavard , X.

    2001-01-01

    International audience; The paper presents a computer software, called Edix, devoted to the edition of algebraic expressions in their usual 2D representation. At present, many systems display fine algebraic expressions, but the edition of such expressions is weak. Systems like Word and FrameMaker place sub-expressions in too many boxes so that many editing actions are not simple, while usual CAS (computer algebra systems) just use a 1D representation for the edition. Furthermore, Edix allows ...

  15. Computational methods in power system analysis

    CERN Document Server

    Idema, Reijer

    2014-01-01

    This book treats state-of-the-art computational methods for power flow studies and contingency analysis. In the first part the authors present the relevant computational methods and mathematical concepts. In the second part, power flow and contingency analysis are treated. Furthermore, traditional methods to solve such problems are compared to modern solvers, developed using the knowledge of the first part of the book. Finally, these solvers are analyzed both theoretically and experimentally, clearly showing the benefits of the modern approach.

  16. Computational methods for data evaluation and assimilation

    CERN Document Server

    Cacuci, Dan Gabriel

    2013-01-01

    Data evaluation and data combination require the use of a wide range of probability theory concepts and tools, from deductive statistics mainly concerning frequencies and sample tallies to inductive inference for assimilating non-frequency data and a priori knowledge. Computational Methods for Data Evaluation and Assimilation presents interdisciplinary methods for integrating experimental and computational information. This self-contained book shows how the methods can be applied in many scientific and engineering areas. After presenting the fundamentals underlying the evaluation of experiment

  17. A Method for Using Adjacency Matrices to Analyze the Connections Students Make within and between Concepts: The Case of Linear Algebra

    Science.gov (United States)

    Selinski, Natalie E.; Rasmussen, Chris; Wawro, Megan; Zandieh, Michelle

    2014-01-01

    The central goals of most introductory linear algebra courses are to develop students' proficiency with matrix techniques, to promote their understanding of key concepts, and to increase their ability to make connections between concepts. In this article, we present an innovative method using adjacency matrices to analyze students' interpretation…

  18. New family of Maxwell like algebras

    International Nuclear Information System (INIS)

    Concha, P.K.; Durka, R.; Merino, N.; Rodríguez, E.K.

    2016-01-01

    We introduce an alternative way of closing Maxwell like algebras. We show, through a suitable change of basis, that resulting algebras are given by the direct sums of the AdS and the Maxwell algebras already known in the literature. Casting the result into the S-expansion method framework ensures the straightaway construction of the gravity theories based on a found enlargement.

  19. New family of Maxwell like algebras

    Energy Technology Data Exchange (ETDEWEB)

    Concha, P.K., E-mail: patillusion@gmail.com [Departamento de Ciencias, Facultad de Artes y Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Av. Padre Hurtado 750, Viña del Mar (Chile); Instituto de Ciencias Físicas y Matemáticas, Universidad Austral de Chile, Casilla 567, Valdivia (Chile); Durka, R., E-mail: remigiuszdurka@gmail.com [Instituto de Física, Pontificia Universidad Católica de Valparaíso, Casilla 4059, Valparaíso (Chile); Merino, N., E-mail: nemerino@gmail.com [Instituto de Física, Pontificia Universidad Católica de Valparaíso, Casilla 4059, Valparaíso (Chile); Rodríguez, E.K., E-mail: everodriguezd@gmail.com [Departamento de Ciencias, Facultad de Artes y Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Av. Padre Hurtado 750, Viña del Mar (Chile); Instituto de Ciencias Físicas y Matemáticas, Universidad Austral de Chile, Casilla 567, Valdivia (Chile)

    2016-08-10

    We introduce an alternative way of closing Maxwell like algebras. We show, through a suitable change of basis, that resulting algebras are given by the direct sums of the AdS and the Maxwell algebras already known in the literature. Casting the result into the S-expansion method framework ensures the straightaway construction of the gravity theories based on a found enlargement.

  20. Introduction to algebra and trigonometry

    CERN Document Server

    Kolman, Bernard

    1981-01-01

    Introduction to Algebra and Trigonometry provides a complete and self-contained presentation of the fundamentals of algebra and trigonometry.This book describes an axiomatic development of the foundations of algebra, defining complex numbers that are used to find the roots of any quadratic equation. Advanced concepts involving complex numbers are also elaborated, including the roots of polynomials, functions and function notation, and computations with logarithms. This text also discusses trigonometry from a functional standpoint. The angles, triangles, and applications involving triangles are

  1. Applied linear algebra

    CERN Document Server

    Olver, Peter J

    2018-01-01

    This textbook develops the essential tools of linear algebra, with the goal of imparting technique alongside contextual understanding. Applications go hand-in-hand with theory, each reinforcing and explaining the other. This approach encourages students to develop not only the technical proficiency needed to go on to further study, but an appreciation for when, why, and how the tools of linear algebra can be used across modern applied mathematics. Providing an extensive treatment of essential topics such as Gaussian elimination, inner products and norms, and eigenvalues and singular values, this text can be used for an in-depth first course, or an application-driven second course in linear algebra. In this second edition, applications have been updated and expanded to include numerical methods, dynamical systems, data analysis, and signal processing, while the pedagogical flow of the core material has been improved. Throughout, the text emphasizes the conceptual connections between each application and the un...

  2. Algebraic number theory

    CERN Document Server

    Weiss, Edwin

    1998-01-01

    Careful organization and clear, detailed proofs characterize this methodical, self-contained exposition of basic results of classical algebraic number theory from a relatively modem point of view. This volume presents most of the number-theoretic prerequisites for a study of either class field theory (as formulated by Artin and Tate) or the contemporary treatment of analytical questions (as found, for example, in Tate's thesis).Although concerned exclusively with algebraic number fields, this treatment features axiomatic formulations with a considerable range of applications. Modem abstract te

  3. Algebraic characterizations of measure algebras

    Czech Academy of Sciences Publication Activity Database

    Jech, Thomas

    2008-01-01

    Roč. 136, č. 4 (2008), s. 1285-1294 ISSN 0002-9939 R&D Projects: GA AV ČR IAA100190509 Institutional research plan: CEZ:AV0Z10190503 Keywords : Von - Neumann * sequential topology * Boolean-algebras * Souslins problem * Submeasures Subject RIV: BA - General Mathematics Impact factor: 0.584, year: 2008

  4. Electromagnetic field computation by network methods

    CERN Document Server

    Felsen, Leopold B; Russer, Peter

    2009-01-01

    This monograph proposes a systematic and rigorous treatment of electromagnetic field representations in complex structures. The book presents new strong models by combining important computational methods. This is the last book of the late Leopold Felsen.

  5. A hyperpower iterative method for computing the generalized Drazin ...

    Indian Academy of Sciences (India)

    A quadratically convergent Newton-type iterative scheme is proposed for approximating the generalized Drazin inverse bd of the Banach algebra element b. Further, its extension into the form of the hyperpower iterative method of arbitrary order p ≤ 2 is presented. Convergence criteria along with the estimation of error ...

  6. Quantum W-algebras and elliptic algebras

    International Nuclear Information System (INIS)

    Feigin, B.; Kyoto Univ.; Frenkel, E.

    1996-01-01

    We define a quantum W-algebra associated to sl N as an associative algebra depending on two parameters. For special values of the parameters, this algebra becomes the ordinary W-algebra of sl N , or the q-deformed classical W-algebra of sl N . We construct free field realizations of the quantum W-algebras and the screening currents. We also point out some interesting elliptic structures arising in these algebras. In particular, we show that the screening currents satisfy elliptic analogues of the Drinfeld relations in U q (n). (orig.)

  7. A fast iterative method for computing particle beams penetrating matter

    International Nuclear Information System (INIS)

    Boergers, C.

    1997-01-01

    Beams of microscopic particles penetrating matter are important in several fields. The application motivating our parameter choices in this paper is electron beam cancer therapy. Mathematically, a steady particle beam penetrating matter, or a configuration of several such beams, is modeled by a boundary value problem for a Boltzmann equation. Grid-based discretization of this problem leads to a system of algebraic equations. This system is typically very large because of the large number of independent variables in the Boltzmann equation (six if time independence is the only dimension-reducing assumption). If grid-based methods are to be practical at all, it is therefore necessary to develop fast solvers for the discretized problems. This is the subject of the present paper. For two-dimensional, mono-energetic, linear particle beam problems, we describe an iterative domain decomposition algorithm based on overlapping decompositions of the set of particle directions and computationally demonstrate its rapid, grid independent convergence. There appears to be no fundamental obstacle to generalizing the method to three-dimensional, energy dependent problems. 34 refs., 15 figs., 6 tabs

  8. Methods in computed angiotomography of the brain

    International Nuclear Information System (INIS)

    Yamamoto, Yuji; Asari, Shoji; Sadamoto, Kazuhiko.

    1985-01-01

    Authors introduce the methods in computed angiotomography of the brain. Setting of the scan planes and levels and the minimum dose bolus (MinDB) injection of contrast medium are described in detail. These methods are easily and safely employed with the use of already propagated CT scanners. Computed angiotomography is expected for clinical applications in many institutions because of its diagnostic value in screening of cerebrovascular lesions and in demonstrating the relationship between pathological lesions and cerebral vessels. (author)

  9. On 2-Banach algebras

    International Nuclear Information System (INIS)

    Mohammad, N.; Siddiqui, A.H.

    1987-11-01

    The notion of a 2-Banach algebra is introduced and its structure is studied. After a short discussion of some fundamental properties of bivectors and tensor product, several classical results of Banach algebras are extended to the 2-Banach algebra case. A condition under which a 2-Banach algebra becomes a Banach algebra is obtained and the relation between algebra of bivectors and 2-normed algebra is discussed. 11 refs

  10. Algebraic Reconstruction of Current Dipoles and Quadrupoles in Three-Dimensional Space

    Directory of Open Access Journals (Sweden)

    Takaaki Nara

    2013-01-01

    Full Text Available This paper presents an algebraic method for an inverse source problem for the Poisson equation where the source consists of dipoles and quadrupoles. This source model is significant in the magnetoencephalography inverse problem. The proposed method identifies the source parameters directly and algebraically using data without requiring an initial parameter estimate or iterative computation of the forward solution. The obtained parameters could be used for the initial solution in an optimization-based algorithm for further refinement.

  11. Finding the radical of an algebra of linear transformations

    NARCIS (Netherlands)

    Cohen, A.M.; Ivanyos, G.; Wales, D.B.

    1997-01-01

    We present a method that reduces the problem of computing the radical of a matrix algebra over an arbitrary field to solving systems of semilinear equations. The complexity of the algorithm, measured in the number of arithmetic operations and the total number of the coefficients passed to an oracle

  12. Methods and experimental techniques in computer engineering

    CERN Document Server

    Schiaffonati, Viola

    2014-01-01

    Computing and science reveal a synergic relationship. On the one hand, it is widely evident that computing plays an important role in the scientific endeavor. On the other hand, the role of scientific method in computing is getting increasingly important, especially in providing ways to experimentally evaluate the properties of complex computing systems. This book critically presents these issues from a unitary conceptual and methodological perspective by addressing specific case studies at the intersection between computing and science. The book originates from, and collects the experience of, a course for PhD students in Information Engineering held at the Politecnico di Milano. Following the structure of the course, the book features contributions from some researchers who are working at the intersection between computing and science.

  13. A pseudo-discrete algebraic reconstruction technique (PDART) prior image-based suppression of high density artifacts in computed tomography

    Energy Technology Data Exchange (ETDEWEB)

    Pua, Rizza; Park, Miran; Wi, Sunhee; Cho, Seungryong, E-mail: scho@kaist.ac.kr

    2016-12-21

    We propose a hybrid metal artifact reduction (MAR) approach for computed tomography (CT) that is computationally more efficient than a fully iterative reconstruction method, but at the same time achieves superior image quality to the interpolation-based in-painting techniques. Our proposed MAR method, an image-based artifact subtraction approach, utilizes an intermediate prior image reconstructed via PDART to recover the background information underlying the high density objects. For comparison, prior images generated by total-variation minimization (TVM) algorithm, as a realization of fully iterative approach, were also utilized as intermediate images. From the simulation and real experimental results, it has been shown that PDART drastically accelerates the reconstruction to an acceptable quality of prior images. Incorporating PDART-reconstructed prior images in the proposed MAR scheme achieved higher quality images than those by a conventional in-painting method. Furthermore, the results were comparable to the fully iterative MAR that uses high-quality TVM prior images. - Highlights: • An accelerated reconstruction method, PDART, is proposed for exterior problems. • With a few iterations, soft prior image was reconstructed from the exterior data. • PDART framework has enabled an efficient hybrid metal artifact reduction in CT.

  14. Computational techniques of the simplex method

    CERN Document Server

    Maros, István

    2003-01-01

    Computational Techniques of the Simplex Method is a systematic treatment focused on the computational issues of the simplex method. It provides a comprehensive coverage of the most important and successful algorithmic and implementation techniques of the simplex method. It is a unique source of essential, never discussed details of algorithmic elements and their implementation. On the basis of the book the reader will be able to create a highly advanced implementation of the simplex method which, in turn, can be used directly or as a building block in other solution algorithms.

  15. Function algebras on finite sets basic course on many-valued logic and clone theory

    CERN Document Server

    Lau, Dietlinde

    2006-01-01

    Gives an introduction to the theory of function algebras. This book gives the general concepts of the Universal Algebra in order to familiarize the reader from the beginning on with the algebraic side of function algebras. It is a source on function algebras for students and researchers in mathematical logic and theoretical computer science.

  16. Basic algebraic geometry, v.2

    CERN Document Server

    Shafarevich, Igor Rostislavovich

    1994-01-01

    Shafarevich Basic Algebraic Geometry 2 The second edition of Shafarevich's introduction to algebraic geometry is in two volumes. The second volume covers schemes and complex manifolds, generalisations in two different directions of the affine and projective varieties that form the material of the first volume. Two notable additions in this second edition are the section on moduli spaces and representable functors, motivated by a discussion of the Hilbert scheme, and the section on Kähler geometry. The book ends with a historical sketch discussing the origins of algebraic geometry. From the Zentralblatt review of this volume: "... one can only respectfully repeat what has been said about the first part of the book (...): a great textbook, written by one of the leading algebraic geometers and teachers himself, has been reworked and updated. As a result the author's standard textbook on algebraic geometry has become even more important and valuable. Students, teachers, and active researchers using methods of al...

  17. Applications of a Sequence of Points in Teaching Linear Algebra, Numerical Methods and Discrete Mathematics

    Science.gov (United States)

    Shi, Yixun

    2009-01-01

    Based on a sequence of points and a particular linear transformation generalized from this sequence, two recent papers (E. Mauch and Y. Shi, "Using a sequence of number pairs as an example in teaching mathematics". Math. Comput. Educ., 39 (2005), pp. 198-205; Y. Shi, "Case study projects for college mathematics courses based on a particular…

  18. Comparison of the deflated preconditioned conjugate gradient method and algebraic multigrid for composite materials

    NARCIS (Netherlands)

    Jönsthövel, T.B.; Van Gijzen, M.B.; MacLachlan, S.; Vuik, C.; Scarpas, A.

    2012-01-01

    Many applications in computational science and engineering concern composite materials, which are characterized by large discontinuities in the material properties. Such applications require fine-scale finite-element meshes, which lead to large linear systems that are challenging to solve with

  19. Benchmarking Post-Hartree–Fock Methods To Describe the Nonlinear Optical Properties of Polymethines: An Investigation of the Accuracy of Algebraic Diagrammatic Construction (ADC) Approaches

    KAUST Repository

    Knippenberg, Stefan

    2016-10-07

    Third-order nonlinear optical (NLO) properties of polymethine dyes have been widely studied for applications such as all-optical switching. However, the limited accuracy of the current computational methodologies has prevented a comprehensive understanding of the nature of the lowest excited states and their influence on the molecular optical and NLO properties. Here, attention is paid to the lowest excited-state energies and their energetic ratio, as these characteristics impact the figure-of-merit for all-optical switching. For a series of model polymethines, we compare several algebraic diagrammatic construction (ADC) schemes for the polarization propagator with approximate second-order coupled cluster (CC2) theory, the widely used INDO/MRDCI approach and the symmetry-adapted cluster configuration interaction (SAC-CI) algorithm incorporating singles and doubles linked excitation operators (SAC-CI SD-R). We focus in particular on the ground-to-excited state transition dipole moments and the corresponding state dipole moments, since these quantities are found to be of utmost importance for an effective description of the third-order polarizability γ and two-photon absorption spectra. A sum-overstates expression has been used, which is found to quickly converge. While ADC(3/2) has been found to be the most appropriate method to calculate these properties, CC2 performs poorly.

  20. Computational and mathematical methods in brain atlasing.

    Science.gov (United States)

    Nowinski, Wieslaw L

    2017-12-01

    Brain atlases have a wide range of use from education to research to clinical applications. Mathematical methods as well as computational methods and tools play a major role in the process of brain atlas building and developing atlas-based applications. Computational methods and tools cover three areas: dedicated editors for brain model creation, brain navigators supporting multiple platforms, and atlas-assisted specific applications. Mathematical methods in atlas building and developing atlas-aided applications deal with problems in image segmentation, geometric body modelling, physical modelling, atlas-to-scan registration, visualisation, interaction and virtual reality. Here I overview computational and mathematical methods in atlas building and developing atlas-assisted applications, and share my contribution to and experience in this field.

  1. Algebraic K-theory of crystallographic groups the three-dimensional splitting case

    CERN Document Server

    Farley, Daniel Scott

    2014-01-01

    The Farrell-Jones isomorphism conjecture in algebraic K-theory offers a description of the algebraic K-theory of a group using a generalized homology theory. In cases where the conjecture is known to be a theorem, it gives a powerful method for computing the lower algebraic K-theory of a group. This book contains a computation of the lower algebraic K-theory of the split three-dimensional crystallographic groups, a geometrically important class of three-dimensional crystallographic group, representing a third of the total number. The book leads the reader through all aspects of the calculation. The first chapters describe the split crystallographic groups and their classifying spaces. Later chapters assemble the techniques that are needed to apply the isomorphism theorem. The result is a useful starting point for researchers who are interested in the computational side of the Farrell-Jones isomorphism conjecture, and a contribution to the growing literature in the field.

  2. AMPTRACT: an algebraic model for computing pressure tube circumferential and steam temperature transients under stratified channel coolant conditions

    International Nuclear Information System (INIS)

    Gulshani, P.; So, C.B.

    1986-10-01

    In a number of postulated accident scenarios in a CANDU reactor, some of the horizontal fuel channels are predicted to experience periods of stratified channel coolant condition which can lead to a circumferential temperature gradient around the pressure tube. To study pressure tube strain and integrity under stratified flow channel conditions, it is, necessary to determine the pressure tube circumferential temperature distribution. This paper presents an algebraic model, called AMPTRACT (Algebraic Model for Pressure Tube TRAnsient Circumferential Temperature), developed to give the transient temperature distribution in a closed form. AMPTRACT models the following modes of heat transfer: radiation from the outermost elements to the pressure tube and from the pressure to calandria tube, convection between the fuel elements and the pressure tube and superheated steam, and circumferential conduction from the exposed to submerged part of the pressure tube. An iterative procedure is used to solve the mass and energy equations in closed form for axial steam and fuel-sheath transient temperature distributions. The one-dimensional conduction equation is then solved to obtain the pressure tube circumferential transient temperature distribution in a cosine series expansion. In the limit of large times and in the absence of convection and radiation to the calandria tube, the predicted pressure tube temperature distribution reduces identically to a parabolic profile. In this limit, however, radiation cannot be ignored because the temperatures are generally high. Convection and radiation tend to flatten the parabolic distribution

  3. Fibered F-Algebra

    OpenAIRE

    Kleyn, Aleks

    2007-01-01

    The concept of F-algebra and its representation can be extended to an arbitrary bundle. We define operations of fibered F-algebra in fiber. The paper presents the representation theory of of fibered F-algebra as well as a comparison of representation of F-algebra and of representation of fibered F-algebra.

  4. Numerical Methods for Stochastic Computations A Spectral Method Approach

    CERN Document Server

    Xiu, Dongbin

    2010-01-01

    The first graduate-level textbook to focus on fundamental aspects of numerical methods for stochastic computations, this book describes the class of numerical methods based on generalized polynomial chaos (gPC). These fast, efficient, and accurate methods are an extension of the classical spectral methods of high-dimensional random spaces. Designed to simulate complex systems subject to random inputs, these methods are widely used in many areas of computer science and engineering. The book introduces polynomial approximation theory and probability theory; describes the basic theory of gPC meth

  5. Lectures on Algebraic Geometry I

    CERN Document Server

    Harder, Gunter

    2012-01-01

    This book and the following second volume is an introduction into modern algebraic geometry. In the first volume the methods of homological algebra, theory of sheaves, and sheaf cohomology are developed. These methods are indispensable for modern algebraic geometry, but they are also fundamental for other branches of mathematics and of great interest in their own. In the last chapter of volume I these concepts are applied to the theory of compact Riemann surfaces. In this chapter the author makes clear how influential the ideas of Abel, Riemann and Jacobi were and that many of the modern metho

  6. Empirical evaluation methods in computer vision

    CERN Document Server

    Christensen, Henrik I

    2002-01-01

    This book provides comprehensive coverage of methods for the empirical evaluation of computer vision techniques. The practical use of computer vision requires empirical evaluation to ensure that the overall system has a guaranteed performance. The book contains articles that cover the design of experiments for evaluation, range image segmentation, the evaluation of face recognition and diffusion methods, image matching using correlation methods, and the performance of medical image processing algorithms. Sample Chapter(s). Foreword (228 KB). Chapter 1: Introduction (505 KB). Contents: Automate

  7. A computational method for sharp interface advection

    DEFF Research Database (Denmark)

    Roenby, Johan; Bredmose, Henrik; Jasak, Hrvoje

    2016-01-01

    We devise a numerical method for passive advection of a surface, such as the interface between two incompressible fluids, across a computational mesh. The method is called isoAdvector, and is developed for general meshes consisting of arbitrary polyhedral cells. The algorithm is based on the volu...

  8. Constructing canonical bases of quantized enveloping algebras

    OpenAIRE

    Graaf, W.A. de

    2001-01-01

    An algorithm for computing the elements of a given weight of the canonical basis of a quantized enveloping algebra is described. Subsequently, a similar algorithm is presented for computing the canonical basis of a finite-dimensional module.

  9. Computing discharge using the index velocity method

    Science.gov (United States)

    Levesque, Victor A.; Oberg, Kevin A.

    2012-01-01

    Application of the index velocity method for computing continuous records of discharge has become increasingly common, especially since the introduction of low-cost acoustic Doppler velocity meters (ADVMs) in 1997. Presently (2011), the index velocity method is being used to compute discharge records for approximately 470 gaging stations operated and maintained by the U.S. Geological Survey. The purpose of this report is to document and describe techniques for computing discharge records using the index velocity method. Computing discharge using the index velocity method differs from the traditional stage-discharge method by separating velocity and area into two ratings—the index velocity rating and the stage-area rating. The outputs from each of these ratings, mean channel velocity (V) and cross-sectional area (A), are then multiplied together to compute a discharge. For the index velocity method, V is a function of such parameters as streamwise velocity, stage, cross-stream velocity, and velocity head, and A is a function of stage and cross-section shape. The index velocity method can be used at locations where stage-discharge methods are used, but it is especially appropriate when more than one specific discharge can be measured for a specific stage. After the ADVM is selected, installed, and configured, the stage-area rating and the index velocity rating must be developed. A standard cross section is identified and surveyed in order to develop the stage-area rating. The standard cross section should be surveyed every year for the first 3 years of operation and thereafter at a lesser frequency, depending on the susceptibility of the cross section to change. Periodic measurements of discharge are used to calibrate and validate the index rating for the range of conditions experienced at the gaging station. Data from discharge measurements, ADVMs, and stage sensors are compiled for index-rating analysis. Index ratings are developed by means of regression

  10. Computational methods in molecular imaging technologies

    CERN Document Server

    Gunjan, Vinit Kumar; Venkatesh, C; Amarnath, M

    2017-01-01

    This book highlights the experimental investigations that have been carried out on magnetic resonance imaging and computed tomography (MRI & CT) images using state-of-the-art Computational Image processing techniques, and tabulates the statistical values wherever necessary. In a very simple and straightforward way, it explains how image processing methods are used to improve the quality of medical images and facilitate analysis. It offers a valuable resource for researchers, engineers, medical doctors and bioinformatics experts alike.

  11. An Algebraic Method for Constructing Exact Solutions to Difference-Differential Equations

    International Nuclear Information System (INIS)

    Wang Zhen; Zhang Hongqing

    2006-01-01

    In this paper, we present a method to solve difference differential equation(s). As an example, we apply this method to discrete KdV equation and Ablowitz-Ladik lattice equation. As a result, many exact solutions are obtained with the help of Maple including soliton solutions presented by hyperbolic functions sinh and cosh, periodic solutions presented by sin and cos and rational solutions. This method can also be used to other nonlinear difference-differential equation(s).

  12. On the Liouvillian solution of second-order linear differential equations and algebraic invariant curves

    International Nuclear Information System (INIS)

    Man, Yiu-Kwong

    2010-01-01

    In this communication, we present a method for computing the Liouvillian solution of second-order linear differential equations via algebraic invariant curves. The main idea is to integrate Kovacic's results on second-order linear differential equations with the Prelle-Singer method for computing first integrals of differential equations. Some examples on using this approach are provided. (fast track communication)

  13. The Jordan structure of lie and Kac-Moody algebras

    International Nuclear Information System (INIS)

    Ferreira, L.A.; Gomes, J.F.; Teotonio Sobrinho, P.; Zimerman, A.H.

    1989-01-01

    A precise relation between the structures of Lie and Jordan algebras by presenting a method of constructing one type of algebra from the other is established. The method differs in some aspects of the Tits construction and Jordan pairs. The examples of the Lie algebras associated to simple Jordan algebras M m (n ) and Clifford algebras are discussed in detail. This approach will shed light on the role of the realizations of Jordan algebras through some types of Fermi fields used in the construction of Kac-Moodey and Virasoro algebras as well as its relevance in the study of some aspects of conformal fields theories. (author)

  14. A q-deformed Lorentz algebra

    International Nuclear Information System (INIS)

    Schmidke, W.B.; Wess, J.; Muenchen Univ.; Zumino, B.; Lawrence Berkeley Lab., CA

    1991-01-01

    We derive a q-deformed version of the Lorentz algebra by deformating the algebra SL(2, C). The method is based on linear representations of the algebra on the complex quantum spinor space. We find that the generators usually identified with SL q (2, C) generate SU q (2) only. Four additional generators are added which generate Lorentz boosts. The full algebra of all seven generators and their coproduct is presented. We show that in the limit q→1 the generators are those of the classical Lorentz algebra plus an additional U(1). Thus we have a deformation of SL(2, C)xU(1). (orig.)

  15. The C*-algebra of a vector bundle and fields of Cuntz algebras

    OpenAIRE

    Vasselli, Ezio

    2004-01-01

    We study the Pimsner algebra associated with the module of continuous sections of a Hilbert bundle, and prove that it is a continuous bundle of Cuntz algebras. We discuss the role of such Pimsner algebras w.r.t. the notion of inner endomorphism. Furthermore, we study bundles of Cuntz algebras carrying a global circle action, and assign to them a class in the representable KK-group of the zero-grade bundle. We compute such class for the Pimsner algebra of a vector bundle.

  16. Guide to Geometric Algebra in Practice

    CERN Document Server

    Dorst, Leo

    2011-01-01

    This highly practical "Guide to Geometric Algebra in Practice" reviews algebraic techniques for geometrical problems in computer science and engineering, and the relationships between them. The topics covered range from powerful new theoretical developments, to successful applications, and the development of new software and hardware tools. This title: provides hands-on review exercises throughout the book, together with helpful chapter summaries; presents a concise introductory tutorial to conformal geometric algebra (CGA) in the appendices; examines the application of CGA for the d

  17. Digital image processing mathematical and computational methods

    CERN Document Server

    Blackledge, J M

    2005-01-01

    This authoritative text (the second part of a complete MSc course) provides mathematical methods required to describe images, image formation and different imaging systems, coupled with the principle techniques used for processing digital images. It is based on a course for postgraduates reading physics, electronic engineering, telecommunications engineering, information technology and computer science. This book relates the methods of processing and interpreting digital images to the 'physics' of imaging systems. Case studies reinforce the methods discussed, with examples of current research

  18. Generalized symmetry algebras

    International Nuclear Information System (INIS)

    Dragon, N.

    1979-01-01

    The possible use of trilinear algebras as symmetry algebras for para-Fermi fields is investigated. The shortcomings of the examples are argued to be a general feature of such generalized algebras. (author)

  19. Zonal methods and computational fluid dynamics

    International Nuclear Information System (INIS)

    Atta, E.H.

    1985-01-01

    Recent advances in developing numerical algorithms for solving fluid flow problems, and the continuing improvement in the speed and storage of large scale computers have made it feasible to compute the flow field about complex and realistic configurations. Current solution methods involve the use of a hierarchy of mathematical models ranging from the linearized potential equation to the Navier Stokes equations. Because of the increasing complexity of both the geometries and flowfields encountered in practical fluid flow simulation, there is a growing emphasis in computational fluid dynamics on the use of zonal methods. A zonal method is one that subdivides the total flow region into interconnected smaller regions or zones. The flow solutions in these zones are then patched together to establish the global flow field solution. Zonal methods are primarily used either to limit the complexity of the governing flow equations to a localized region or to alleviate the grid generation problems about geometrically complex and multicomponent configurations. This paper surveys the application of zonal methods for solving the flow field about two and three-dimensional configurations. Various factors affecting their accuracy and ease of implementation are also discussed. From the presented review it is concluded that zonal methods promise to be very effective for computing complex flowfields and configurations. Currently there are increasing efforts to improve their efficiency, versatility, and accuracy

  20. Algebraic functions

    CERN Document Server

    Bliss, Gilbert Ames

    1933-01-01

    This book, immediately striking for its conciseness, is one of the most remarkable works ever produced on the subject of algebraic functions and their integrals. The distinguishing feature of the book is its third chapter, on rational functions, which gives an extremely brief and clear account of the theory of divisors.... A very readable account is given of the topology of Riemann surfaces and of the general properties of abelian integrals. Abel's theorem is presented, with some simple applications. The inversion problem is studied for the cases of genus zero and genus unity. The chapter on t

  1. Comparative study of simultaneous algebraic and filtered backprojection reconstruction methods in digital tomosynthesis for nondestructive testing

    International Nuclear Information System (INIS)

    Kim, Dae Cheon; Youn, Hanbean; Kim, Seung Ho; Kim, Ho Kyung

    2015-01-01

    These algorithms have their own merits and demerits, in terms of image quality and reconstruction speed. For the industrial applications, such as multi-layer printed circuit board (PCB) inspection, the automated inspection systems require real time imaging and high spatial resolution. In this study, we quantitatively evaluate the performance of FBP and SART for planar computed tomography (pCT) systems. The performance includes the contrast, and depth resolution. These benefits will be normalized by costs, such as tube loading and speed. In order to accomplish it, further study is needed. First of all, it should be verified by experiment that the algorithm works correctly. Once we prove the algorithm is correct for the PCB phantom, then the results of reconstruction images will be compared by using metric parameters

  2. Comparative study of simultaneous algebraic and filtered backprojection reconstruction methods in digital tomosynthesis for nondestructive testing

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Dae Cheon; Youn, Hanbean; Kim, Seung Ho; Kim, Ho Kyung [Pusan National University, Busan (Korea, Republic of)

    2015-05-15

    These algorithms have their own merits and demerits, in terms of image quality and reconstruction speed. For the industrial applications, such as multi-layer printed circuit board (PCB) inspection, the automated inspection systems require real time imaging and high spatial resolution. In this study, we quantitatively evaluate the performance of FBP and SART for planar computed tomography (pCT) systems. The performance includes the contrast, and depth resolution. These benefits will be normalized by costs, such as tube loading and speed. In order to accomplish it, further study is needed. First of all, it should be verified by experiment that the algorithm works correctly. Once we prove the algorithm is correct for the PCB phantom, then the results of reconstruction images will be compared by using metric parameters.

  3. Comparison of algebraic and analytical approaches to the formulation of the statistical model-based reconstruction problem for X-ray computed tomography.

    Science.gov (United States)

    Cierniak, Robert; Lorent, Anna

    2016-09-01

    The main aim of this paper is to investigate properties of our originally formulated statistical model-based iterative approach applied to the image reconstruction from projections problem which are related to its conditioning, and, in this manner, to prove a superiority of this approach over ones recently used by other authors. The reconstruction algorithm based on this conception uses a maximum likelihood estimation with an objective adjusted to the probability distribution of measured signals obtained from an X-ray computed tomography system with parallel beam geometry. The analysis and experimental results presented here show that our analytical approach outperforms the referential algebraic methodology which is explored widely in the literature and exploited in various commercial implementations. Copyright © 2016 Elsevier Ltd. All rights reserved.

  4. Iterated Leavitt Path Algebras

    International Nuclear Information System (INIS)

    Hazrat, R.

    2009-11-01

    Leavitt path algebras associate to directed graphs a Z-graded algebra and in their simplest form recover the Leavitt algebras L(1,k). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs which have natural ± Z grading and in their simplest form recover the Leavitt algebras L(n,k). We also characterize Leavitt path algebras which are strongly graded. (author)

  5. Domain decomposition methods and parallel computing

    International Nuclear Information System (INIS)

    Meurant, G.

    1991-01-01

    In this paper, we show how to efficiently solve large linear systems on parallel computers. These linear systems arise from discretization of scientific computing problems described by systems of partial differential equations. We show how to get a discrete finite dimensional system from the continuous problem and the chosen conjugate gradient iterative algorithm is briefly described. Then, the different kinds of parallel architectures are reviewed and their advantages and deficiencies are emphasized. We sketch the problems found in programming the conjugate gradient method on parallel computers. For this algorithm to be efficient on parallel machines, domain decomposition techniques are introduced. We give results of numerical experiments showing that these techniques allow a good rate of convergence for the conjugate gradient algorithm as well as computational speeds in excess of a billion of floating point operations per second. (author). 5 refs., 11 figs., 2 tabs., 1 inset

  6. Quantum mechanical algebraic variational methods for inelastic and reactive molecular collisions

    Science.gov (United States)

    Schwenke, David W.; Haug, Kenneth; Zhao, Meishan; Truhlar, Donald G.; Sun, Yan

    1988-01-01

    The quantum mechanical problem of reactive or nonreactive scattering of atoms and molecules is formulated in terms of square-integrable basis sets with variational expressions for the reactance matrix. Several formulations involving expansions of the wave function (the Schwinger variational principle) or amplitude density (a generalization of the Newton variational principle), single-channel or multichannel distortion potentials, and primitive or contracted basis functions are presented and tested. The test results, for inelastic and reactive atom-diatom collisions, suggest that the methods may be useful for a variety of collision calculations and may allow the accurate quantal treatment of systems for which other available methods would be prohibitively expensive.

  7. W-realization of Lie algebras. Application to so(4,2) and Poincare algebras

    International Nuclear Information System (INIS)

    Barbarin, F.; Ragoucy, E.; Sorba, P.

    1996-05-01

    The property of some finite W-algebras to appear as the commutant of a particular subalgebra in a simple Lie algebra G is exploited for the obtention of new G-realizations from a 'canonical' differential one. The method is applied to the conformal algebra so(4,2) and therefore yields also results for its Poincare subalgebra. Unitary irreducible representations of these algebras are recognized in this approach, which is naturally compared -or associated to - the induced representation technique. (author)

  8. Quantum affine algebras and deformations of the virasoro and W-algebras

    International Nuclear Information System (INIS)

    Frenkel, E.; Reshetikhin, N.

    1996-01-01

    Using the Wakimoto realization of quantum affine algebras we define new Poisson algebras, which are q-deformations of the classical W-algebras. We also define their free field realizations, i.e. homomorphisms into some Heisenberg-Poisson algebras. The formulas for these homomorphisms coincide with formulas for spectra of transfer-matrices in the corresponding quantum integrable models derived by the Bethe-Ansatz method. (orig.)

  9. Algebraic method for analysis of nonlinear systems with a normal matrix

    International Nuclear Information System (INIS)

    Konyaev, Yu.A.; Salimova, A.F.

    2014-01-01

    A promising method has been proposed for analyzing a class of quasilinear nonautonomous systems of differential equations whose matrix can be represented as a sum of nonlinear normal matrices, which makes it possible to analyze stability without using the Lyapunov functions [ru

  10. Modified Reduced Differential Transform Method for Partial Differential-Algebraic Equations

    Directory of Open Access Journals (Sweden)

    Brahim Benhammouda

    2014-01-01

    PDAEs in convergent series form. In addition, we present the posttreatment of the power series solutions with the Laplace-Padé resummation method as a useful technique to find exact solutions. The main advantage of the proposed technique is that it is based on a few straightforward steps and does not generate secular terms or depend on a perturbation parameter.

  11. Predicting High School Completion Using Student Performance in High School Algebra: A Mixed Methods Research Study

    Science.gov (United States)

    Chiado, Wendy S.

    2012-01-01

    Too many of our nation's youth have failed to complete high school. Determining why so many of our nation's students fail to graduate is a complex, multi-faceted problem and beyond the scope of any one study. The study presented herein utilized a thirteen-step mixed methods model developed by Leech and Onwuegbuzie (2007) to demonstrate within a…

  12. Computational and instrumental methods in EPR

    CERN Document Server

    Bender, Christopher J

    2006-01-01

    Computational and Instrumental Methods in EPR Prof. Bender, Fordham University Prof. Lawrence J. Berliner, University of Denver Electron magnetic resonance has been greatly facilitated by the introduction of advances in instrumentation and better computational tools, such as the increasingly widespread use of the density matrix formalism. This volume is devoted to both instrumentation and computation aspects of EPR, while addressing applications such as spin relaxation time measurements, the measurement of hyperfine interaction parameters, and the recovery of Mn(II) spin Hamiltonian parameters via spectral simulation. Key features: Microwave Amplitude Modulation Technique to Measure Spin-Lattice (T1) and Spin-Spin (T2) Relaxation Times Improvement in the Measurement of Spin-Lattice Relaxation Time in Electron Paramagnetic Resonance Quantitative Measurement of Magnetic Hyperfine Parameters and the Physical Organic Chemistry of Supramolecular Systems New Methods of Simulation of Mn(II) EPR Spectra: Single Cryst...

  13. Proceedings of computational methods in materials science

    International Nuclear Information System (INIS)

    Mark, J.E. Glicksman, M.E.; Marsh, S.P.

    1992-01-01

    The Symposium on which this volume is based was conceived as a timely expression of some of the fast-paced developments occurring throughout materials science and engineering. It focuses particularly on those involving modern computational methods applied to model and predict the response of materials under a diverse range of physico-chemical conditions. The current easy access of many materials scientists in industry, government laboratories, and academe to high-performance computers has opened many new vistas for predicting the behavior of complex materials under realistic conditions. Some have even argued that modern computational methods in materials science and engineering are literally redefining the bounds of our knowledge from which we predict structure-property relationships, perhaps forever changing the historically descriptive character of the science and much of the engineering

  14. Computational botany methods for automated species identification

    CERN Document Server

    Remagnino, Paolo; Wilkin, Paul; Cope, James; Kirkup, Don

    2017-01-01

    This book discusses innovative methods for mining information from images of plants, especially leaves, and highlights the diagnostic features that can be implemented in fully automatic systems for identifying plant species. Adopting a multidisciplinary approach, it explores the problem of plant species identification, covering both the concepts of taxonomy and morphology. It then provides an overview of morphometrics, including the historical background and the main steps in the morphometric analysis of leaves together with a number of applications. The core of the book focuses on novel diagnostic methods for plant species identification developed from a computer scientist’s perspective. It then concludes with a chapter on the characterization of botanists' visions, which highlights important cognitive aspects that can be implemented in a computer system to more accurately replicate the human expert’s fixation process. The book not only represents an authoritative guide to advanced computational tools fo...

  15. Integration of Lax and Zakharov-Schabat equations by means of algebraic geometry's methods

    International Nuclear Information System (INIS)

    Gozman, N.Ja.; Latyshev, A.V.; Savostjanov, M.V.; Lebedev, D.R.

    1982-01-01

    The solutions of nonlinear partial differential equations of Lax and Zakharov-Schabat types are obtained with the help of algebro-geometric method. The Krichever-Drinfeld bimodule for rational curve with cusp point is constructed. It is noted that rational solutions of Zakharov-Schabat equations can be found by means of constructed bimodule in the case of rank 1 only. The evolution of the poles of these solutions is investigated

  16. Lectures on algebraic quantum field theory and operator algebras

    International Nuclear Information System (INIS)

    Schroer, Bert

    2001-04-01

    In this series of lectures directed towards a mainly mathematically oriented audience I try to motivate the use of operator algebra methods in quantum field theory. Therefore a title as why mathematicians are/should be interested in algebraic quantum field theory would be equally fitting. besides a presentation of the framework and the main results of local quantum physics these notes may serve as a guide to frontier research problems in mathematical. (author)

  17. Filiform Lie algebras of order 3

    International Nuclear Information System (INIS)

    Navarro, R. M.

    2014-01-01

    The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de la variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases

  18. Filiform Lie algebras of order 3

    Science.gov (United States)

    Navarro, R. M.

    2014-04-01

    The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, "Cohomologie des algèbres de Lie nilpotentes. Application à l'étude de la variété des algèbres de Lie nilpotentes," Bull. Soc. Math. France 98, 81-116 (1970)]. Also we give the dimension, using an adaptation of the {sl}(2,{C})-module Method, and a basis of such infinitesimal deformations in some generic cases.

  19. Computer-Aided Modelling Methods and Tools

    DEFF Research Database (Denmark)

    Cameron, Ian; Gani, Rafiqul

    2011-01-01

    The development of models for a range of applications requires methods and tools. In many cases a reference model is required that allows the generation of application specific models that are fit for purpose. There are a range of computer aided modelling tools available that help to define the m...

  20. Applying Human Computation Methods to Information Science

    Science.gov (United States)

    Harris, Christopher Glenn

    2013-01-01

    Human Computation methods such as crowdsourcing and games with a purpose (GWAP) have each recently drawn considerable attention for their ability to synergize the strengths of people and technology to accomplish tasks that are challenging for either to do well alone. Despite this increased attention, much of this transformation has been focused on…

  1. The asymptotic expansion method via symbolic computation

    OpenAIRE

    Navarro, Juan F.

    2012-01-01

    This paper describes an algorithm for implementing a perturbation method based on an asymptotic expansion of the solution to a second-order differential equation. We also introduce a new symbolic computation system which works with the so-called modified quasipolynomials, as well as an implementation of the algorithm on it.

  2. The Asymptotic Expansion Method via Symbolic Computation

    Directory of Open Access Journals (Sweden)

    Juan F. Navarro

    2012-01-01

    Full Text Available This paper describes an algorithm for implementing a perturbation method based on an asymptotic expansion of the solution to a second-order differential equation. We also introduce a new symbolic computation system which works with the so-called modified quasipolynomials, as well as an implementation of the algorithm on it.

  3. Computationally efficient methods for digital control

    NARCIS (Netherlands)

    Guerreiro Tome Antunes, D.J.; Hespanha, J.P.; Silvestre, C.J.; Kataria, N.; Brewer, F.

    2008-01-01

    The problem of designing a digital controller is considered with the novelty of explicitly taking into account the computation cost of the controller implementation. A class of controller emulation methods inspired by numerical analysis is proposed. Through various examples it is shown that these

  4. Yoneda algebras of almost Koszul algebras

    Indian Academy of Sciences (India)

    Abstract. Let k be an algebraically closed field, A a finite dimensional connected. (p,q)-Koszul self-injective algebra with p, q ≥ 2. In this paper, we prove that the. Yoneda algebra of A is isomorphic to a twisted polynomial algebra A![t; β] in one inde- terminate t of degree q +1 in which A! is the quadratic dual of A, β is an ...

  5. Genetic algorithms in teaching artificial intelligence (automated generation of specific algebras)

    Science.gov (United States)

    Habiballa, Hashim; Jendryscik, Radek

    2017-11-01

    The problem of teaching essential Artificial Intelligence (AI) methods is an important task for an educator in the branch of soft-computing. The key focus is often given to proper understanding of the principle of AI methods in two essential points - why we use soft-computing methods at all and how we apply these methods to generate reasonable results in sensible time. We present one interesting problem solved in the non-educational research concerning automated generation of specific algebras in the huge search space. We emphasize above mentioned points as an educational case study of an interesting problem in automated generation of specific algebras.

  6. The bubble algebra: structure of a two-colour Temperley-Lieb Algebra

    International Nuclear Information System (INIS)

    Grimm, Uwe; Martin, Paul P

    2003-01-01

    We define new diagram algebras providing a sequence of multiparameter generalizations of the Temperley-Lieb algebra, suitable for the modelling of dilute lattice systems of two-dimensional statistical mechanics. These algebras give a rigorous foundation to the various 'multi-colour algebras' of Grimm, Pearce and others. We determine the generic representation theory of the simplest of these algebras, and locate the nongeneric cases (at roots of unity of the corresponding parameters). We show by this example how the method used (Martin's general procedure for diagram algebras) may be applied to a wide variety of such algebras occurring in statistical mechanics. We demonstrate how these algebras may be used to solve the Yang-Baxter equations

  7. An approach to 3D magnetic field calculation using numerical and differential algebra methods

    International Nuclear Information System (INIS)

    Caspi, S.; Helm, M.; Laslett, L.J.; Brady, V.O.

    1992-01-01

    Motivated by the need for new means for specification and determination of 3D fields that are produced by electromagnetic lens elements in the region interior to coil windings and seeking to obtain techniques that will be convenient for accurate conductor placement and dynamical study of particle motion, we have conveniently gene the representation of a 2D magnetic field to 3D. We have shown that the 3 dimensioal magnetic field components of a multipole magnet in the curl-fire divergence-fire region near the axis r=0 can be derived from one dimensional functions A n (z) and their derivatives (part 1). In the region interior to coil windings of accelerator magnets the three spatial components of magnet fields can be expressed in terms of ''harmonic components'' proportional to functions sin (nθ) or cos (nθ) of the azimuthal angle. The r,z dependence of any such component can then be expressed in terms of powers of r times functions A n (z) and their derivatives. For twodimensional configurations B z of course is identically zero, the derivatives of A n (z) vanish, and the harmonic components of the transverse field then acquire a simple proportionality B r,n ∝ r n-1 sin (nθ),B θ,n ∝ r n-1 cos (nθ), whereas in a 3-D configuration the more complex nature of the field gives rise to additional so-called ''psuedomultipole'' components as judged by additional powers of r required in the development of the field. Computation of the 3-D magnetic field arising at a sequence of field points, as a direct result of a specified current configuration or coil geometry, can be calculated explicitly through use of the Biot-Savart law and from such data the coefficients can then be derived for a general development of the type indicated above. We indicate, discuss, and illustrate two means by which this development may be performed

  8. Term Satisfiability in FLew-Algebras

    Czech Academy of Sciences Publication Activity Database

    Haniková, Zuzana; Savický, Petr

    2016-01-01

    Roč. 631, 6 June (2016), s. 1-15 ISSN 0304-3975 R&D Projects: GA ČR GBP202/12/G061 Institutional support: RVO:67985807 Keywords : substructural logic * FLew-algebra * MV-algebra * satisfiability * computational complexity Subject RIV: BA - General Mathematics Impact factor: 0.698, year: 2016

  9. Some Applications of Algebraic System Solving

    Science.gov (United States)

    Roanes-Lozano, Eugenio

    2011-01-01

    Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…

  10. Realization Of Algebraic Processor For XML Documents Processing

    International Nuclear Information System (INIS)

    Georgiev, Bozhidar; Georgieva, Adriana

    2010-01-01

    In this paper, are presented some possibilities concerning the implementation of an algebraic method for XML hierarchical data processing which makes faster the XML search mechanism. Here is offered a different point of view for creation of advanced algebraic processor (with all necessary software tools and programming modules respectively). Therefore, this nontraditional approach for fast XML navigation with the presented algebraic processor may help to build an easier user-friendly interface provided XML transformations, which can avoid the difficulties in the complicated language constructions of XSL, XSLT and XPath. This approach allows comparatively simple search of XML hierarchical data by means of the following types of functions: specification functions and so named build-in functions. The choice of programming language Java may appear strange at first, but it isn't when you consider that the applications can run on different kinds of computers. The specific search mechanism based on the linear algebra theory is faster in comparison with MSXML parsers (on the basis of the developed examples with about 30%). Actually, there exists the possibility for creating new software tools based on the linear algebra theory, which cover the whole navigation and search techniques characterizing XSLT/XPath. The proposed method is able to replace more complicated operations in other SOA components.

  11. Priority in Process Algebras

    Science.gov (United States)

    Cleaveland, Rance; Luettgen, Gerald; Natarajan, V.

    1999-01-01

    This paper surveys the semantic ramifications of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. These enriched formalisms allow one to model system features such as interrupts, prioritized choice, or real-time behavior. Approaches to priority in process algebras can be classified according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global pre-emption and static priorities and led to formalisms for modeling interrupts and aspects of real-time, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of pre-emption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the efficient encoding of real-time semantics. Technically, this paper studies the different models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local pre- emption. In each case the operational semantics of CCS is modified appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for different process-algebraic settings are discussed.

  12. Eleven-dimensional gauge theory for the M-algebra as an Abelian semigroup expansion of osp (32 vertical stroke 1)

    International Nuclear Information System (INIS)

    Izaurieta, F.; Rodriguez, E.; Salgado, P.

    2008-01-01

    A new Lagrangian realizing the symmetry of the M-algebra in eleven-dimensional space-time is presented. By means of the novel technique of Abelian semigroup expansion, a link between the M-algebra and the orthosymplectic algebra osp(32 vertical stroke 1) is established, and an M-algebra-invariant symmetric tensor of rank six is computed. This symmetric invariant tensor is a key ingredient in the construction of the new Lagrangian. The gauge-invariant Lagrangian is displayed in an explicitly Lorentz-invariant way by means of a subspace separation method based on the extended Cartan homotopy formula. (orig.)

  13. A constrained regularization method for inverting data represented by linear algebraic or integral equations

    Science.gov (United States)

    Provencher, Stephen W.

    1982-09-01

    CONTIN is a portable Fortran IV package for inverting noisy linear operator equations. These problems occur in the analysis of data from a wide variety experiments. They are generally ill-posed problems, which means that errors in an unregularized inversion are unbounded. Instead, CONTIN seeks the optimal solution by incorporating parsimony and any statistical prior knowledge into the regularizor and absolute prior knowledge into equallity and inequality constraints. This can be greatly increase the resolution and accuracyh of the solution. CONTIN is very flexible, consisting of a core of about 50 subprograms plus 13 small "USER" subprograms, which the user can easily modify to specify special-purpose constraints, regularizors, operator equations, simulations, statistical weighting, etc. Specjial collections of USER subprograms are available for photon correlation spectroscopy, multicomponent spectra, and Fourier-Bessel, Fourier and Laplace transforms. Numerically stable algorithms are used throughout CONTIN. A fairly precise definition of information content in terms of degrees of freedom is given. The regularization parameter can be automatically chosen on the basis of an F-test and confidence region. The interpretation of the latter and of error estimates based on the covariance matrix of the constrained regularized solution are discussed. The strategies, methods and options in CONTIN are outlined. The program itself is described in the following paper.

  14. Grassmann, super-Kac-Moody and super-derivation algebras

    International Nuclear Information System (INIS)

    Frappat, L.; Ragoucy, E.; Sorba, P.

    1989-05-01

    We study the cyclic cocycles of degree one on the Grassmann algebra and on the super-circle with N supersymmetries (i.e. the tensor product of the algebra of functions on the circle times a Grassmann algebra with N generators). They are related to central extensions of graded loop algebras (i.e. super-Kac-Moody algebras). The corresponding algebras of super-derivations have to be compatible with the cocycle characterizing the extension; we give a general method for determining these algebras and examine in particular the cases N = 1,2,3. We also discuss their relations with the Ademollo et al. algebras, and examine the possibility of defining new kinds of super-conformal algebras, which, for N > 1, generalize the N = 1 Ramond-Neveu-Schwarz algebra

  15. Linear algebra

    CERN Document Server

    Said-Houari, Belkacem

    2017-01-01

    This self-contained, clearly written textbook on linear algebra is easily accessible for students. It begins with the simple linear equation and generalizes several notions from this equation for the system of linear equations and introduces the main ideas using matrices. It then offers a detailed chapter on determinants and introduces the main ideas with detailed proofs. The third chapter introduces the Euclidean spaces using very simple geometric ideas and discusses various major inequalities and identities. These ideas offer a solid basis for understanding general Hilbert spaces in functional analysis. The following two chapters address general vector spaces, including some rigorous proofs to all the main results, and linear transformation: areas that are ignored or are poorly explained in many textbooks. Chapter 6 introduces the idea of matrices using linear transformation, which is easier to understand than the usual theory of matrices approach. The final two chapters are more advanced, introducing t...

  16. Advances of evolutionary computation methods and operators

    CERN Document Server

    Cuevas, Erik; Oliva Navarro, Diego Alberto

    2016-01-01

    The goal of this book is to present advances that discuss alternative Evolutionary Computation (EC) developments and non-conventional operators which have proved to be effective in the solution of several complex problems. The book has been structured so that each chapter can be read independently from the others. The book contains nine chapters with the following themes: 1) Introduction, 2) the Social Spider Optimization (SSO), 3) the States of Matter Search (SMS), 4) the collective animal behavior (CAB) algorithm, 5) the Allostatic Optimization (AO) method, 6) the Locust Search (LS) algorithm, 7) the Adaptive Population with Reduced Evaluations (APRE) method, 8) the multimodal CAB, 9) the constrained SSO method.

  17. Gauss Elimination: Workhorse of Linear Algebra.

    Science.gov (United States)

    1995-08-05

    linear algebra computation for solving systems, computing determinants and determining the rank of matrix. All of these are discussed in varying contexts. These include different arithmetic or algebraic setting such as integer arithmetic or polynomial rings as well as conventional real (floating-point) arithmetic. These have effects on both accuracy and complexity analyses of the algorithm. These, too, are covered here. The impact of modern parallel computer architecture on GE is also

  18. Computational Methods in Stochastic Dynamics Volume 2

    CERN Document Server

    Stefanou, George; Papadopoulos, Vissarion

    2013-01-01

    The considerable influence of inherent uncertainties on structural behavior has led the engineering community to recognize the importance of a stochastic approach to structural problems. Issues related to uncertainty quantification and its influence on the reliability of the computational models are continuously gaining in significance. In particular, the problems of dynamic response analysis and reliability assessment of structures with uncertain system and excitation parameters have been the subject of continuous research over the last two decades as a result of the increasing availability of powerful computing resources and technology.   This book is a follow up of a previous book with the same subject (ISBN 978-90-481-9986-0) and focuses on advanced computational methods and software tools which can highly assist in tackling complex problems in stochastic dynamic/seismic analysis and design of structures. The selected chapters are authored by some of the most active scholars in their respective areas and...

  19. A REDUCE program for symbolic computation of Puiseux expansions

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Tiller, P.

    1991-01-01

    The program is described for computation of Puiseux expansions of algebraic functions. The Newton diagram method is used for construction of initial coefficients of all the Puiseux series at the given point. The program is written in computer algebra language Reduce. Some illustrative examples are given. 20 refs

  20. ADvanced IMage Algebra (ADIMA): a novel method for depicting multiple sclerosis lesion heterogeneity, as demonstrated by quantitative MRI.

    Science.gov (United States)

    Yiannakas, Marios C; Tozer, Daniel J; Schmierer, Klaus; Chard, Declan T; Anderson, Valerie M; Altmann, Daniel R; Miller, David H; Wheeler-Kingshott, Claudia A M

    2013-05-01

    There are modest correlations between multiple sclerosis (MS) disability and white matter lesion (WML) volumes, as measured by T2-weighted (T2w) magnetic resonance imaging (MRI) scans (T2-WML). This may partly reflect pathological heterogeneity in WMLs, which is not apparent on T2w scans. To determine if ADvanced IMage Algebra (ADIMA), a novel MRI post-processing method, can reveal WML heterogeneity from proton-density weighted (PDw) and T2w images. We obtained conventional PDw and T2w images from 10 patients with relapsing-remitting MS (RRMS) and ADIMA images were calculated from these. We classified all WML into bright (ADIMA-b) and dark (ADIMA-d) sub-regions, which were segmented. We obtained conventional T2-WML and T1-WML volumes for comparison, as well as the following quantitative magnetic resonance parameters: magnetisation transfer ratio (MTR), T1 and T2. Also, we assessed the reproducibility of the segmentation for ADIMA-b, ADIMA-d and T2-WML. Our study's ADIMA-derived volumes correlated with conventional lesion volumes (p < 0.05). ADIMA-b exhibited higher T1 and T2, and lower MTR than the T2-WML (p < 0.001). Despite the similarity in T1 values between ADIMA-b and T1-WML, these regions were only partly overlapping with each other. ADIMA-d exhibited quantitative characteristics similar to T2-WML; however, they were only partly overlapping. Mean intra- and inter-observer coefficients of variation for ADIMA-b, ADIMA-d and T2-WML volumes were all < 6 % and < 10 %, respectively. ADIMA enabled the simple classification of WML into two groups having different quantitative magnetic resonance properties, which can be reproducibly distinguished.

  1. The Yoneda algebra of a K2 algebra need not be another K2 algebra

    OpenAIRE

    Cassidy, T.; Phan, C.; Shelton, B.

    2010-01-01

    The Yoneda algebra of a Koszul algebra or a D-Koszul algebra is Koszul. K2 algebras are a natural generalization of Koszul algebras, and one would hope that the Yoneda algebra of a K2 algebra would be another K2 algebra. We show that this is not necessarily the case by constructing a monomial K2 algebra for which the corresponding Yoneda algebra is not K2.

  2. Novikov-Jordan algebras

    OpenAIRE

    Dzhumadil'daev, A. S.

    2002-01-01

    Algebras with identity $(a\\star b)\\star (c\\star d) -(a\\star d)\\star(c\\star b)$ $=(a,b,c)\\star d-(a,d,c)\\star b$ are studied. Novikov algebras under Jordan multiplication and Leibniz dual algebras satisfy this identity. If algebra with such identity has unit, then it is associative and commutative.

  3. Computational methods for industrial radiation measurement applications

    International Nuclear Information System (INIS)

    Gardner, R.P.; Guo, P.; Ao, Q.

    1996-01-01

    Computational methods have been used with considerable success to complement radiation measurements in solving a wide range of industrial problems. The almost exponential growth of computer capability and applications in the last few years leads to a open-quotes black boxclose quotes mentality for radiation measurement applications. If a black box is defined as any radiation measurement device that is capable of measuring the parameters of interest when a wide range of operating and sample conditions may occur, then the development of computational methods for industrial radiation measurement applications should now be focused on the black box approach and the deduction of properties of interest from the response with acceptable accuracy and reasonable efficiency. Nowadays, increasingly better understanding of radiation physical processes, more accurate and complete fundamental physical data, and more advanced modeling and software/hardware techniques have made it possible to make giant strides in that direction with new ideas implemented with computer software. The Center for Engineering Applications of Radioisotopes (CEAR) at North Carolina State University has been working on a variety of projects in the area of radiation analyzers and gauges for accomplishing this for quite some time, and they are discussed here with emphasis on current accomplishments

  4. Classical theory of algebraic numbers

    CERN Document Server

    Ribenboim, Paulo

    2001-01-01

    Gauss created the theory of binary quadratic forms in "Disquisitiones Arithmeticae" and Kummer invented ideals and the theory of cyclotomic fields in his attempt to prove Fermat's Last Theorem These were the starting points for the theory of algebraic numbers, developed in the classical papers of Dedekind, Dirichlet, Eisenstein, Hermite and many others This theory, enriched with more recent contributions, is of basic importance in the study of diophantine equations and arithmetic algebraic geometry, including methods in cryptography This book has a clear and thorough exposition of the classical theory of algebraic numbers, and contains a large number of exercises as well as worked out numerical examples The Introduction is a recapitulation of results about principal ideal domains, unique factorization domains and commutative fields Part One is devoted to residue classes and quadratic residues In Part Two one finds the study of algebraic integers, ideals, units, class numbers, the theory of decomposition, iner...

  5. Algebraic structure of chiral anomalies

    International Nuclear Information System (INIS)

    Stora, R.

    1985-09-01

    I will describe first the algebraic aspects of chiral anomalies, exercising however due care about the topological delicacies. I will illustrate the structure and methods in the context of gauge anomalies and will eventually make contact with results obtained from index theory. I will go into two sorts of generalizations: on the one hand, generalizing the algebraic set up yields e.g. gravitational and mixed gauge anomalies, supersymmetric gauge anomalies, anomalies in supergravity theories; on the other hand most constructions applied to the cohomologies which characterize anomalies easily extend to higher cohomologies. Section II is devoted to a description of the general set up as it applies to gauge anomalies. Section III deals with a number of algebraic set ups which characterize more general types of anomalies: gravitational and mixed gauge anomalies, supersymmetric gauge anomalies, anomalies in supergravity theories. It also includes brief remarks on σ models and a reminder on the full BRST algebra of quantized gauge theories

  6. The null-event method in computer simulation

    International Nuclear Information System (INIS)

    Lin, S.L.

    1978-01-01

    The simulation of collisions of ions moving under the influence of an external field through a neutral gas to non-zero temperatures is discussed as an example of computer models of processes in which a probe particle undergoes a series of interactions with an ensemble of other particles, such that the frequency and outcome of the events depends on internal properties of the second particles. The introduction of null events removes the need for much complicated algebra, leads to a more efficient simulation and reduces the likelihood of logical error. (Auth.)

  7. Algebraic model checking for Boolean gene regulatory networks.

    Science.gov (United States)

    Tran, Quoc-Nam

    2011-01-01

    We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.

  8. Banach Synaptic Algebras

    Science.gov (United States)

    Foulis, David J.; Pulmannov, Sylvia

    2018-04-01

    Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

  9. BLUES function method in computational physics

    Science.gov (United States)

    Indekeu, Joseph O.; Müller-Nedebock, Kristian K.

    2018-04-01

    We introduce a computational method in physics that goes ‘beyond linear use of equation superposition’ (BLUES). A BLUES function is defined as a solution of a nonlinear differential equation (DE) with a delta source that is at the same time a Green’s function for a related linear DE. For an arbitrary source, the BLUES function can be used to construct an exact solution to the nonlinear DE with a different, but related source. Alternatively, the BLUES function can be used to construct an approximate piecewise analytical solution to the nonlinear DE with an arbitrary source. For this alternative use the related linear DE need not be known. The method is illustrated in a few examples using analytical calculations and numerical computations. Areas for further applications are suggested.

  10. Spatial analysis statistics, visualization, and computational methods

    CERN Document Server

    Oyana, Tonny J

    2015-01-01

    An introductory text for the next generation of geospatial analysts and data scientists, Spatial Analysis: Statistics, Visualization, and Computational Methods focuses on the fundamentals of spatial analysis using traditional, contemporary, and computational methods. Outlining both non-spatial and spatial statistical concepts, the authors present practical applications of geospatial data tools, techniques, and strategies in geographic studies. They offer a problem-based learning (PBL) approach to spatial analysis-containing hands-on problem-sets that can be worked out in MS Excel or ArcGIS-as well as detailed illustrations and numerous case studies. The book enables readers to: Identify types and characterize non-spatial and spatial data Demonstrate their competence to explore, visualize, summarize, analyze, optimize, and clearly present statistical data and results Construct testable hypotheses that require inferential statistical analysis Process spatial data, extract explanatory variables, conduct statisti...

  11. Computer Animation Based on Particle Methods

    Directory of Open Access Journals (Sweden)

    Rafal Wcislo

    1999-01-01

    Full Text Available The paper presents the main issues of a computer animation of a set of elastic macroscopic objects based on the particle method. The main assumption of the generated animations is to achieve very realistic movements in a scene observed on the computer display. The objects (solid bodies interact mechanically with each other, The movements and deformations of solids are calculated using the particle method. Phenomena connected with the behaviour of solids in the gravitational field, their defomtations caused by collisions and interactions with the optional liquid medium are simulated. The simulation ofthe liquid is performed using the cellular automata method. The paper presents both simulation schemes (particle method and cellular automata rules an the method of combining them in the single animation program. ln order to speed up the execution of the program the parallel version based on the network of workstation was developed. The paper describes the methods of the parallelization and it considers problems of load-balancing, collision detection, process synchronization and distributed control of the animation.

  12. Matlab linear algebra

    CERN Document Server

    Lopez, Cesar

    2014-01-01

    MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Linear Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. In addition to giving an introduction to

  13. Computational methods of electron/photon transport

    International Nuclear Information System (INIS)

    Mack, J.M.

    1983-01-01

    A review of computational methods simulating the non-plasma transport of electrons and their attendant cascades is presented. Remarks are mainly restricted to linearized formalisms at electron energies above 1 keV. The effectiveness of various metods is discussed including moments, point-kernel, invariant imbedding, discrete-ordinates, and Monte Carlo. Future research directions and the potential impact on various aspects of science and engineering are indicated

  14. Mathematical optics classical, quantum, and computational methods

    CERN Document Server

    Lakshminarayanan, Vasudevan

    2012-01-01

    Going beyond standard introductory texts, Mathematical Optics: Classical, Quantum, and Computational Methods brings together many new mathematical techniques from optical science and engineering research. Profusely illustrated, the book makes the material accessible to students and newcomers to the field. Divided into six parts, the text presents state-of-the-art mathematical methods and applications in classical optics, quantum optics, and image processing. Part I describes the use of phase space concepts to characterize optical beams and the application of dynamic programming in optical wave

  15. The classical limit of W-algebras

    International Nuclear Information System (INIS)

    Figueroa-O'Farrill, J.M.; Ramos, E.

    1992-01-01

    We define and compute explicitly the classical limit of the realizations of W n appearing as hamiltonian structures of generalized KdV hierarchies. The classical limit is obtained by taking the commutative limit of the ring of pseudodifferential operators. These algebras - denoted w n - have free field realizations in which the generators are given by the elementary symmetric polynomials in the free fields. We compute the algebras explicitly and we show that they are all reductions of a new algebra w KP , which is proposed as the universal classical W-algebra for the w n series. As a deformation of this algebra we also obtain w 1+∞ , the classical limit of W 1+∞ . (orig.)

  16. A Novel Partial Differential Algebraic Equation (PDAE) Solver

    DEFF Research Database (Denmark)

    Lim, Young-il; Chang, Sin-Chung; Jørgensen, Sten Bay

    2004-01-01

    For solving partial differential algebraic equations (PDAEs), the space-time conservation element/solution element (CE/SE) method is addressed in this study. The method of lines (MOL) using an implicit time integrator is compared with the CE/SE method in terms of computational efficiency, solution...... or nonlinear adsorption isotherm are solved by the two methods. The CE/SE method enforces both local and global flux conservation in space and time, and uses a simple stencil structure (two points at the previous time level and one point at the present time level). Thus, accurate and computationally...

  17. Building bridges between algebra and topology

    CERN Document Server

    Pitsch, Wolfgang; Zarzuela, Santiago

    2018-01-01

    This volume presents an elaborated version of lecture notes for two advanced courses: (Re)Emerging Methods in Commutative Algebra and Representation Theory and Building Bridges Between Algebra and Topology, held at the CRM in the spring of 2015. Homological algebra is a rich and ubiquitous subject; it is both an active field of research and a widespread toolbox for many mathematicians. Together, these notes introduce recent applications and interactions of homological methods in commutative algebra, representation theory and topology, narrowing the gap between specialists from different areas wishing to acquaint themselves with a rapidly growing field. The covered topics range from a fresh introduction to the growing area of support theory for triangulated categories to the striking consequences of the formulation in the homotopy theory of classical concepts in commutative algebra. Moreover, they also include a higher categories view of Hall algebras and an introduction to the use of idempotent functors in al...

  18. Quantum cluster algebras and quantum nilpotent algebras

    Science.gov (United States)

    Goodearl, Kenneth R.; Yakimov, Milen T.

    2014-01-01

    A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197

  19. Delamination detection using methods of computational intelligence

    Science.gov (United States)

    Ihesiulor, Obinna K.; Shankar, Krishna; Zhang, Zhifang; Ray, Tapabrata

    2012-11-01

    Abstract Reliable delamination prediction scheme is indispensable in order to prevent potential risks of catastrophic failures in composite structures. The existence of delaminations changes the vibration characteristics of composite laminates and hence such indicators can be used to quantify the health characteristics of laminates. An approach for online health monitoring of in-service composite laminates is presented in this paper that relies on methods based on computational intelligence. Typical changes in the observed vibration characteristics (i.e. change in natural frequencies) are considered as inputs to identify the existence, location and magnitude of delaminations. The performance of the proposed approach is demonstrated using numerical models of composite laminates. Since this identification problem essentially involves the solution of an optimization problem, the use of finite element (FE) methods as the underlying tool for analysis turns out to be computationally expensive. A surrogate assisted optimization approach is hence introduced to contain the computational time within affordable limits. An artificial neural network (ANN) model with Bayesian regularization is used as the underlying approximation scheme while an improved rate of convergence is achieved using a memetic algorithm. However, building of ANN surrogate models usually requires large training datasets. K-means clustering is effectively employed to reduce the size of datasets. ANN is also used via inverse modeling to determine the position, size and location of delaminations using changes in measured natural frequencies. The results clearly highlight the efficiency and the robustness of the approach.

  20. Method of generating a computer readable model

    DEFF Research Database (Denmark)

    2008-01-01

    A method of generating a computer readable model of a geometrical object constructed from a plurality of interconnectable construction elements, wherein each construction element has a number of connection elements for connecting the construction element with another construction element. The met......A method of generating a computer readable model of a geometrical object constructed from a plurality of interconnectable construction elements, wherein each construction element has a number of connection elements for connecting the construction element with another construction element....... The method comprises encoding a first and a second one of the construction elements as corresponding data structures, each representing the connection elements of the corresponding construction element, and each of the connection elements having associated with it a predetermined connection type. The method...... further comprises determining a first connection element of the first construction element and a second connection element of the second construction element located in a predetermined proximity of each other; and retrieving connectivity information of the corresponding connection types of the first...

  1. Computational method for free surface hydrodynamics

    International Nuclear Information System (INIS)

    Hirt, C.W.; Nichols, B.D.

    1980-01-01

    There are numerous flow phenomena in pressure vessel and piping systems that involve the dynamics of free fluid surfaces. For example, fluid interfaces must be considered during the draining or filling of tanks, in the formation and collapse of vapor bubbles, and in seismically shaken vessels that are partially filled. To aid in the analysis of these types of flow phenomena, a new technique has been developed for the computation of complicated free-surface motions. This technique is based on the concept of a local average volume of fluid (VOF) and is embodied in a computer program for two-dimensional, transient fluid flow called SOLA-VOF. The basic approach used in the VOF technique is briefly described, and compared to other free-surface methods. Specific capabilities of the SOLA-VOF program are illustrated by generic examples of bubble growth and collapse, flows of immiscible fluid mixtures, and the confinement of spilled liquids

  2. Soft Computing Methods for Disulfide Connectivity Prediction.

    Science.gov (United States)

    Márquez-Chamorro, Alfonso E; Aguilar-Ruiz, Jesús S

    2015-01-01

    The problem of protein structure prediction (PSP) is one of the main challenges in structural bioinformatics. To tackle this problem, PSP can be divided into several subproblems. One of these subproblems is the prediction of disulfide bonds. The disulfide connectivity prediction problem consists in identifying which nonadjacent cysteines would be cross-linked from all possible candidates. Determining the disulfide bond connectivity between the cysteines of a protein is desirable as a previous step of the 3D PSP, as the protein conformational search space is highly reduced. The most representative soft computing approaches for the disulfide bonds connectivity prediction problem of the last decade are summarized in this paper. Certain aspects, such as the different methodologies based on soft computing approaches (artificial neural network or support vector machine) or features of the algorithms, are used for the classification of these methods.

  3. Surface defects and chiral algebras

    Energy Technology Data Exchange (ETDEWEB)

    Córdova, Clay [School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, NJ 08540 (United States); Gaiotto, Davide [Perimeter Institute for Theoretical Physics,31 Caroline St N, Waterloo, ON N2L 2Y5 (Canada); Shao, Shu-Heng [School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, NJ 08540 (United States)

    2017-05-26

    We investigate superconformal surface defects in four-dimensional N=2 superconformal theories. Each such defect gives rise to a module of the associated chiral algebra and the surface defect Schur index is the character of this module. Various natural chiral algebra operations such as Drinfeld-Sokolov reduction and spectral flow can be interpreted as constructions involving four-dimensional surface defects. We compute the index of these defects in the free hypermultiplet theory and Argyres-Douglas theories, using both infrared techniques involving BPS states, as well as renormalization group flows onto Higgs branches. In each case we find perfect agreement with the predicted characters.

  4. Computational methods for nuclear criticality safety analysis

    International Nuclear Information System (INIS)

    Maragni, M.G.

    1992-01-01

    Nuclear criticality safety analyses require the utilization of methods which have been tested and verified against benchmarks results. In this work, criticality calculations based on the KENO-IV and MCNP codes are studied aiming the qualification of these methods at the IPEN-CNEN/SP and COPESP. The utilization of variance reduction techniques is important to reduce the computer execution time, and several of them are analysed. As practical example of the above methods, a criticality safety analysis for the storage tubes for irradiated fuel elements from the IEA-R1 research has been carried out. This analysis showed that the MCNP code is more adequate for problems with complex geometries, and the KENO-IV code shows conservative results when it is not used the generalized geometry option. (author)

  5. Leavitt path algebras

    CERN Document Server

    Abrams, Gene; Siles Molina, Mercedes

    2017-01-01

    This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume. Since Leavitt path algebras were first defined in 2005, interest in these algebras has grown substantially, with ring theorists as well as researchers working in graph C*-algebras, group theory and symbolic dynamics attracted to the topic. Providing a historical perspective on the subject, the authors review existing arguments, establish new results, and outline the major themes and ring-theoretic concepts, such as the ideal structure, Z-grading and the close link between Leavitt path algebras and graph C*-algebras. The book also presents key lines of current research, including the Algebraic Kirchberg Phillips Question, various additional classification questions, and connections to noncommutative algebraic geometry. Leavitt Path Algebras will appeal to graduate students and researchers working in the field and related areas, such as C*-algebras and...

  6. NEWLIN: A digital computer program for the linearisation of sets of algebraic and first order differential equations

    International Nuclear Information System (INIS)

    Hopkinson, A.

    1969-05-01

    The techniques normally used for linearisation of equations are not amenable to general treatment by digital computation. This report describes a computer program for linearising sets of equations by numerical evaluations of partial derivatives. The program is written so that the specification of the non-linear equations is the same as for the digital simulation program, FIFI, and the linearised equations can be punched out in form suitable for input to the frequency response program FRP2 and the poles and zeros program ZIP. Full instructions for the use of the program are given and a sample problem input and output are shown. (author)

  7. Evolutionary Computing Methods for Spectral Retrieval

    Science.gov (United States)

    Terrile, Richard; Fink, Wolfgang; Huntsberger, Terrance; Lee, Seugwon; Tisdale, Edwin; VonAllmen, Paul; Tinetti, Geivanna

    2009-01-01

    A methodology for processing spectral images to retrieve information on underlying physical, chemical, and/or biological phenomena is based on evolutionary and related computational methods implemented in software. In a typical case, the solution (the information that one seeks to retrieve) consists of parameters of a mathematical model that represents one or more of the phenomena of interest. The methodology was developed for the initial purpose of retrieving the desired information from spectral image data acquired by remote-sensing instruments aimed at planets (including the Earth). Examples of information desired in such applications include trace gas concentrations, temperature profiles, surface types, day/night fractions, cloud/aerosol fractions, seasons, and viewing angles. The methodology is also potentially useful for retrieving information on chemical and/or biological hazards in terrestrial settings. In this methodology, one utilizes an iterative process that minimizes a fitness function indicative of the degree of dissimilarity between observed and synthetic spectral and angular data. The evolutionary computing methods that lie at the heart of this process yield a population of solutions (sets of the desired parameters) within an accuracy represented by a fitness-function value specified by the user. The evolutionary computing methods (ECM) used in this methodology are Genetic Algorithms and Simulated Annealing, both of which are well-established optimization techniques and have also been described in previous NASA Tech Briefs articles. These are embedded in a conceptual framework, represented in the architecture of the implementing software, that enables automatic retrieval of spectral and angular data and analysis of the retrieved solutions for uniqueness.

  8. Topics in quaternion linear algebra

    CERN Document Server

    Rodman, Leiba

    2014-01-01

    Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses...

  9. Algebra II textbook for students of mathematics

    CERN Document Server

    Gorodentsev, Alexey L

    2017-01-01

    This book is the second volume of an intensive “Russian-style” two-year undergraduate course in abstract algebra, and introduces readers to the basic algebraic structures – fields, rings, modules, algebras, groups, and categories – and explains the main principles of and methods for working with them. The course covers substantial areas of advanced combinatorics, geometry, linear and multilinear algebra, representation theory, category theory, commutative algebra, Galois theory, and algebraic geometry – topics that are often overlooked in standard undergraduate courses. This textbook is based on courses the author has conducted at the Independent University of Moscow and at the Faculty of Mathematics in the Higher School of Economics. The main content is complemented by a wealth of exercises for class discussion, some of which include comments and hints, as well as problems for independent study.

  10. Algebra I textbook for students of mathematics

    CERN Document Server

    Gorodentsev, Alexey L

    2016-01-01

    This book is the first volume of an intensive “Russian-style” two-year undergraduate course in abstract algebra, and introduces readers to the basic algebraic structures – fields, rings, modules, algebras, groups, and categories – and explains the main principles of and methods for working with them. The course covers substantial areas of advanced combinatorics, geometry, linear and multilinear algebra, representation theory, category theory, commutative algebra, Galois theory, and algebraic geometry – topics that are often overlooked in standard undergraduate courses. This textbook is based on courses the author has conducted at the Independent University of Moscow and at the Faculty of Mathematics in the Higher School of Economics. The main content is complemented by a wealth of exercises for class discussion, some of which include comments and hints, as well as problems for independent study.

  11. Algebraic theory of numbers

    CERN Document Server

    Samuel, Pierre

    2008-01-01

    Algebraic number theory introduces students not only to new algebraic notions but also to related concepts: groups, rings, fields, ideals, quotient rings and quotient fields, homomorphisms and isomorphisms, modules, and vector spaces. Author Pierre Samuel notes that students benefit from their studies of algebraic number theory by encountering many concepts fundamental to other branches of mathematics - algebraic geometry, in particular.This book assumes a knowledge of basic algebra but supplements its teachings with brief, clear explanations of integrality, algebraic extensions of fields, Gal

  12. Introduction to quantum algebras

    International Nuclear Information System (INIS)

    Kibler, M.R.

    1992-09-01

    The concept of a quantum algebra is made easy through the investigation of the prototype algebras u qp (2), su q (2) and u qp (1,1). The latter quantum algebras are introduced as deformations of the corresponding Lie algebras; this is achieved in a simple way by means of qp-bosons. The Hopf algebraic structure of u qp (2) is also discussed. The basic ingredients for the representation theory of u qp (2) are given. Finally, in connection with the quantum algebra u qp (2), the qp-analogues of the harmonic oscillator are discussed and of the (spherical and hyperbolical) angular momenta. (author) 50 refs

  13. Basic matrix algebra and transistor circuits

    CERN Document Server

    Zelinger, G

    1963-01-01

    Basic Matrix Algebra and Transistor Circuits deals with mastering the techniques of matrix algebra for application in transistors. This book attempts to unify fundamental subjects, such as matrix algebra, four-terminal network theory, transistor equivalent circuits, and pertinent design matters. Part I of this book focuses on basic matrix algebra of four-terminal networks, with descriptions of the different systems of matrices. This part also discusses both simple and complex network configurations and their associated transmission. This discussion is followed by the alternative methods of de

  14. Geometric computations with interval and new robust methods applications in computer graphics, GIS and computational geometry

    CERN Document Server

    Ratschek, H

    2003-01-01

    This undergraduate and postgraduate text will familiarise readers with interval arithmetic and related tools to gain reliable and validated results and logically correct decisions for a variety of geometric computations plus the means for alleviating the effects of the errors. It also considers computations on geometric point-sets, which are neither robust nor reliable in processing with standard methods. The authors provide two effective tools for obtaining correct results: (a) interval arithmetic, and (b) ESSA the new powerful algorithm which improves many geometric computations and makes th

  15. Exponentiation and deformations of Lie-admissible algebras

    International Nuclear Information System (INIS)

    Myung, H.C.

    1982-01-01

    The exponential function is defined for a finite-dimensional real power-associative algebra with unit element. The application of the exponential function is focused on the power-associative (p,q)-mutation of a real or complex associative algebra. Explicit formulas are computed for the (p,q)-mutation of the real envelope of the spin 1 algebra and the Lie algebra so(3) of the rotation group, in light of earlier investigations of the spin 1/2. A slight variant of the mutated exponential is interpreted as a continuous function of the Lie algebra into some isotope of the corresponding linear Lie group. The second part of this paper is concerned with the representation and deformation of a Lie-admissible algebra. The second cohomology group of a Lie-admissible algebra is introduced as a generalization of those of associative and Lie algebras in the Hochschild and Chevalley-Eilenberg theory. Some elementary theory of algebraic deformation of Lie-admissible algebras is discussed in view of generalization of that of associative and Lie algebras. Lie-admissible deformations are also suggested by the representation of Lie-admissible algebras. Some explicit examples of Lie-admissible deformation are given in terms of the (p,q)-mutation of associative deformation of an associative algebra. Finally, we discuss Lie-admissible deformations of order one

  16. Analysis of Secondary School Students’ Algebraic Thinking and Math-Talk Learning Community to Help Students Learn

    Science.gov (United States)

    Nurhayati, D. M.; Herman, T.; Suhendra, S.

    2017-09-01

    This study aims to determine the difficulties of algebraic thinking ability of students in one of secondary school on quadrilateral subject and to describe Math-Talk Learning Community as the alternative way that can be done to overcome the difficulties of the students’ algebraic thinking ability. Research conducted by using quantitative approach with descriptive method. The population in this research was all students of that school and twenty three students as the sample that was chosen by purposive sampling technique. Data of algebraic thinking were collected through essay test. The results showed the percentage of achievement of students’ algebraic thinking’s indicators on three aspects: a) algebra as generalized arithmetic with the indicators (conceptually based computational strategies and estimation); b) algebra as the language of mathematics (meaning of variables, variable expressions and meaning of solution); c) algebra as a tool for functions and mathematical modelling (representing mathematical ideas using equations, tables, or words and generalizing patterns and rules in real-world contexts) is still low. It is predicted that because the secondary school students was not familiar with the abstract problem and they are still at a semi-concrete stage where the stage of cognitive development is between concrete and abstract. Based on the percentage achievement of each indicators, it can be concluded that the level of achievement of student’s mathematical communication using conventional learning is still low, so students’ algebraic thinking ability need to be improved.

  17. Generalized EMV-Effect Algebras

    Science.gov (United States)

    Borzooei, R. A.; Dvurečenskij, A.; Sharafi, A. H.

    2018-04-01

    Recently in Dvurečenskij and Zahiri (2017), new algebraic structures, called EMV-algebras which generalize both MV-algebras and generalized Boolean algebras, were introduced. We present equivalent conditions for EMV-algebras. In addition, we define a partial algebraic structure, called a generalized EMV-effect algebra, which is close to generalized MV-effect algebras. Finally, we show that every generalized EMV-effect algebra is either an MV-effect algebra or can be embedded into an MV-effect algebra as a maximal ideal.

  18. Fixed point algebras for easy quantum groups

    DEFF Research Database (Denmark)

    Gabriel, Olivier; Weber, Moritz

    2016-01-01

    Compact matrix quantum groups act naturally on Cuntz algebras. The first author isolated certain conditions under which the fixed point algebras under this action are Kirchberg algebras. Hence they are completely determined by their K-groups. Building on prior work by the second author,we prove...... that free easy quantum groups satisfy these conditions and we compute the K-groups of their fixed point algebras in a general form. We then turn to examples such as the quantum permutation group S+ n,the free orthogonal quantum group O+ n and the quantum reflection groups Hs+ n. Our fixed point......-algebra construction provides concrete examples of free actions of free orthogonal easy quantum groups,which are related to Hopf-Galois extensions....

  19. A computational method for sharp interface advection

    Science.gov (United States)

    Bredmose, Henrik; Jasak, Hrvoje

    2016-01-01

    We devise a numerical method for passive advection of a surface, such as the interface between two incompressible fluids, across a computational mesh. The method is called isoAdvector, and is developed for general meshes consisting of arbitrary polyhedral cells. The algorithm is based on the volume of fluid (VOF) idea of calculating the volume of one of the fluids transported across the mesh faces during a time step. The novelty of the isoAdvector concept consists of two parts. First, we exploit an isosurface concept for modelling the interface inside cells in a geometric surface reconstruction step. Second, from the reconstructed surface, we model the motion of the face–interface intersection line for a general polygonal face to obtain the time evolution within a time step of the submerged face area. Integrating this submerged area over the time step leads to an accurate estimate for the total volume of fluid transported across the face. The method was tested on simple two-dimensional and three-dimensional interface advection problems on both structured and unstructured meshes. The results are very satisfactory in terms of volume conservation, boundedness, surface sharpness and efficiency. The isoAdvector method was implemented as an OpenFOAM® extension and is published as open source. PMID:28018619

  20. A computational method for sharp interface advection.

    Science.gov (United States)

    Roenby, Johan; Bredmose, Henrik; Jasak, Hrvoje

    2016-11-01

    We devise a numerical method for passive advection of a surface, such as the interface between two incompressible fluids, across a computational mesh. The method is called isoAdvector, and is developed for general meshes consisting of arbitrary polyhedral cells. The algorithm is based on the volume of fluid (VOF) idea of calculating the volume of one of the fluids transported across the mesh faces during a time step. The novelty of the isoAdvector concept consists of two parts. First, we exploit an isosurface concept for modelling the interface inside cells in a geometric surface reconstruction step. Second, from the reconstructed surface, we model the motion of the face-interface intersection line for a general polygonal face to obtain the time evolution within a time step of the submerged face area. Integrating this submerged area over the time step leads to an accurate estimate for the total volume of fluid transported across the face. The method was tested on simple two-dimensional and three-dimensional interface advection problems on both structured and unstructured meshes. The results are very satisfactory in terms of volume conservation, boundedness, surface sharpness and efficiency. The isoAdvector method was implemented as an OpenFOAM ® extension and is published as open source.