Reading Bombelli's x-purgated Algebra.

ERIC Educational Resources Information Center

Arcavi, Abraham; Bruckheimer, Maxim

1991-01-01

Presents the algorithm to approximate square roots as reproduced from the 1579 edition of an algebra book by Rafael Bombelli. The sequence of activities illustrates that the process of understanding an original source of mathematics, first at the algorithmic level and then with respect to its mathematical validity in modern terms, can be an…

Research on numerical algorithms for large space structures

NASA Technical Reports Server (NTRS)

Denman, E. D.

1982-01-01

Numerical algorithms for large space structures were investigated with particular emphasis on decoupling method for analysis and design. Numerous aspects of the analysis of large systems ranging from the algebraic theory to lambda matrices to identification algorithms were considered. A general treatment of the algebraic theory of lambda matrices is presented and the theory is applied to second order lambda matrices.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Jain, A.; Kreutz-Delgado, K.

1991-01-01

A recently developed spatial operator algebra for manipulator modeling, control, and trajectory design is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and for control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics.

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

PubMed

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.

Avoiding Communication in Dense Linear Algebra

DTIC Science & Technology

2013-08-16

Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.1 Asymptotic Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . 6...and parallelizing Strassen’s matrix multiplication algorithm (Chapter 11). 6 Chapter 2 Preliminaries 2.1 Notation and Definitions In this section we...between computations and algo- rithms). The following definition is based on [56]: Definition 2.1. A classical algorithm in linear algebra is one that

Integrand-level reduction of loop amplitudes by computational algebraic geometry methods

NASA Astrophysics Data System (ADS)

Zhang, Yang

2012-09-01

We present an algorithm for the integrand-level reduction of multi-loop amplitudes of renormalizable field theories, based on computational algebraic geometry. This algorithm uses (1) the Gröbner basis method to determine the basis for integrand-level reduction, (2) the primary decomposition of an ideal to classify all inequivalent solutions of unitarity cuts. The resulting basis and cut solutions can be used to reconstruct the integrand from unitarity cuts, via polynomial fitting techniques. The basis determination part of the algorithm has been implemented in the Mathematica package, BasisDet. The primary decomposition part can be readily carried out by algebraic geometry softwares, with the output of the package BasisDet. The algorithm works in both D = 4 and D = 4 - 2 ɛ dimensions, and we present some two and three-loop examples of applications of this algorithm.

GENERAL: Application of Symplectic Algebraic Dynamics Algorithm to Circular Restricted Three-Body Problem

NASA Astrophysics Data System (ADS)

Lu, Wei-Tao; Zhang, Hua; Wang, Shun-Jin

2008-07-01

Symplectic algebraic dynamics algorithm (SADA) for ordinary differential equations is applied to solve numerically the circular restricted three-body problem (CR3BP) in dynamical astronomy for both stable motion and chaotic motion. The result is compared with those of Runge-Kutta algorithm and symplectic algorithm under the fourth order, which shows that SADA has higher accuracy than the others in the long-term calculations of the CR3BP.

Application of Quaternions for Mesh Deformation

NASA Technical Reports Server (NTRS)

Samareh, Jamshid A.

2002-01-01

A new three-dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.

Application of Quaternions for Mesh

NASA Technical Reports Server (NTRS)

Samareh, Jamshid A.

2002-01-01

A new three dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.

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

NASA Astrophysics Data System (ADS)

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 algorithm based on generalization of Weyl character formula. We also offer alternative implementation based on the Freudenthal multiplicity formula which can be faster in some cases. Restrictions: Computational complexity grows fast with the rank of an algebra, so computations for algebras of ranks greater than 8 are not practical. Unusual features: We offer the possibility of using a traditional mathematical notation for the objects in representation theory of Lie algebras in computations if Affine.m is used in the Mathematica notebook interface. Running time: From seconds to days depending on the rank of the algebra and the complexity of the representation.

Sixth SIAM conference on applied linear algebra: Final program and abstracts. Final technical report

DOE Office of Scientific and Technical Information (OSTI.GOV)

NONE

1997-12-31

Linear algebra plays a central role in mathematics and applications. The analysis and solution of problems from an amazingly wide variety of disciplines depend on the theory and computational techniques of linear algebra. In turn, the diversity of disciplines depending on linear algebra also serves to focus and shape its development. Some problems have special properties (numerical, structural) that can be exploited. Some are simply so large that conventional approaches are impractical. New computer architectures motivate new algorithms, and fresh ways to look at old ones. The pervasive nature of linear algebra in analyzing and solving problems means that peoplemore » from a wide spectrum--universities, industrial and government laboratories, financial institutions, and many others--share an interest in current developments in linear algebra. This conference aims to bring them together for their mutual benefit. Abstracts of papers presented are included.« less

Gauss Elimination: Workhorse of Linear Algebra.

DTIC Science & Technology

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Spotz, William F.

PyTrilinos is a set of Python interfaces to compiled Trilinos packages. This collection supports serial and parallel dense linear algebra, serial and parallel sparse linear algebra, direct and iterative linear solution techniques, algebraic and multilevel preconditioners, nonlinear solvers and continuation algorithms, eigensolvers and partitioning algorithms. Also included are a variety of related utility functions and classes, including distributed I/O, coloring algorithms and matrix generation. PyTrilinos vector objects are compatible with the popular NumPy Python package. As a Python front end to compiled libraries, PyTrilinos takes advantage of the flexibility and ease of use of Python, and the efficiency of themore » underlying C++, C and Fortran numerical kernels. This paper covers recent, previously unpublished advances in the PyTrilinos package.« less

Multiple shooting algorithms for jump-discontinuous problems in optimal control and estimation

NASA Technical Reports Server (NTRS)

Mook, D. J.; Lew, Jiann-Shiun

1991-01-01

Multiple shooting algorithms are developed for jump-discontinuous two-point boundary value problems arising in optimal control and optimal estimation. Examples illustrating the origin of such problems are given to motivate the development of the solution algorithms. The algorithms convert the necessary conditions, consisting of differential equations and transversality conditions, into algebraic equations. The solution of the algebraic equations provides exact solutions for linear problems. The existence and uniqueness of the solution are proved.

Tracking problem solving by multivariate pattern analysis and Hidden Markov Model algorithms.

PubMed

Anderson, John R

2012-03-01

Multivariate pattern analysis can be combined with Hidden Markov Model algorithms to track the second-by-second thinking as people solve complex problems. Two applications of this methodology are illustrated with a data set taken from children as they interacted with an intelligent tutoring system for algebra. The first "mind reading" application involves using fMRI activity to track what students are doing as they solve a sequence of algebra problems. The methodology achieves considerable accuracy at determining both what problem-solving step the students are taking and whether they are performing that step correctly. The second "model discovery" application involves using statistical model evaluation to determine how many substates are involved in performing a step of algebraic problem solving. This research indicates that different steps involve different numbers of substates and these substates are associated with different fluency in algebra problem solving. Copyright © 2011 Elsevier Ltd. All rights reserved.

Numerical linear algebra in data mining

NASA Astrophysics Data System (ADS)

Eldén, Lars

Ideas and algorithms from numerical linear algebra are important in several areas of data mining. We give an overview of linear algebra methods in text mining (information retrieval), pattern recognition (classification of handwritten digits), and PageRank computations for web search engines. The emphasis is on rank reduction as a method of extracting information from a data matrix, low-rank approximation of matrices using the singular value decomposition and clustering, and on eigenvalue methods for network analysis.

Implementing dense linear algebra algorithms using multitasking on the CRAY X-MP-4 (or approaching the gigaflop)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dongarra, J.J.; Hewitt, T.

1985-08-01

This note describes some experiments on simple, dense linear algebra algorithms. These experiments show that the CRAY X-MP is capable of small-grain multitasking arising from standard implementations of LU and Cholesky decomposition. The implementation described here provides the ''fastest'' execution rate for LU decomposition, 718 MFLOPS for a matrix of order 1000.

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

NASA Astrophysics Data System (ADS)

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.

Numerical algebraic geometry: a new perspective on gauge and string theories

NASA Astrophysics Data System (ADS)

Mehta, Dhagash; He, Yang-Hui; Hauensteine, Jonathan D.

2012-07-01

There is a rich interplay between algebraic geometry and string and gauge theories which has been recently aided immensely by advances in computational algebra. However, symbolic (Gröbner) methods are severely limited by algorithmic issues such as exponential space complexity and being highly sequential. In this paper, we introduce a novel paradigm of numerical algebraic geometry which in a plethora of situations overcomes these shortcomings. The so-called `embarrassing parallelizability' allows us to solve many problems and extract physical information which elude symbolic methods. We describe the method and then use it to solve various problems arising from physics which could not be otherwise solved.

Non-AdS holography in 3-dimensional higher spin gravity — General recipe and example

NASA Astrophysics Data System (ADS)

Afshar, H.; Gary, M.; Grumiller, D.; Rashkov, R.; Riegler, M.

2012-11-01

We present the general algorithm to establish the classical and quantum asymptotic symmetry algebra for non-AdS higher spin gravity and implement it for the specific example of spin-3 gravity in the non-principal embedding with Lobachevsky ( {{{{H}}^2}× {R}} ) boundary conditions. The asymptotic symmetry algebra for this example consists of a quantum W_3^{(2) } (Polyakov-Bershadsky) and an affine û(1) algebra. We show that unitary representations of the quantum W_3^{(2) } algebra exist only for two values of its central charge, the trivial c = 0 "theory" and the simple c = 1 theory.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, K.; Jain, A.

1989-01-01

A spatial operator algebra for modeling the control and trajectory design of manipulation is discussed, with emphasis on its analytical formulation and implementation in the Ada programming language. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of the manipulator. Inversion is obtained using techniques of recursive filtering and smoothing. The operator alegbra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. Implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection, thus greatly simplifying the transition from an abstract problem formulation and solution to the detailed mechanization of a specific algorithm.

A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs

DOE PAGES

Azad, Ariful; Buluç, Aydın

2016-05-16

We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributed-memory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simultaneously using a matrix-algebraic formulation of maximal matching. This generic matrix-algebraic framework is used to develop three efficient maximal matching algorithms with minimal changes. The newly developed algorithms have two benefits over existing graph-based algorithms. First, unlike existing parallel algorithms, cardinality of matching obtained by the new algorithms stays constant with increasing processor counts, which is important for predictable and reproducible performance. Second, relying on bulk-synchronous matrix operations,more » these algorithms expose a higher degree of parallelism on distributed-memory platforms than existing graph-based algorithms. We report high-performance implementations of three maximal matching algorithms using hybrid OpenMP-MPI and evaluate the performance of these algorithm using more than 35 real and randomly generated graphs. On real instances, our algorithms achieve up to 200 × speedup on 2048 cores of a Cray XC30 supercomputer. Even higher speedups are obtained on larger synthetically generated graphs where our algorithms show good scaling on up to 16,384 cores.« less

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, K.; Milman, M.

1988-01-01

A powerful new spatial operator algebra for modeling, control, and trajectory design of manipulators is discussed along with its implementation in the Ada programming language. Applications of this algebra to robotics include an operator representation of the manipulator Jacobian matrix; the robot dynamical equations formulated in terms of the spatial algebra, showing the complete equivalence between the recursive Newton-Euler formulations to robot dynamics; the operator factorization and inversion of the manipulator mass matrix which immediately results in O(N) recursive forward dynamics algorithms; the joint accelerations of a manipulator due to a tip contact force; the recursive computation of the equivalent mass matrix as seen at the tip of a manipulator; and recursive forward dynamics of a closed chain system. Finally, additional applications and current research involving the use of the spatial operator algebra are discussed in general terms.

Communication Avoiding and Overlapping for Numerical Linear Algebra

DTIC Science & Technology

2012-05-08

future exascale systems, communication cost must be avoided or overlapped. Communication-avoiding 2.5D algorithms improve scalability by reducing...linear algebra problems to future exascale systems, communication cost must be avoided or overlapped. Communication-avoiding 2.5D algorithms improve...will continue to grow relative to the cost of computation. With exascale computing as the long-term goal, the community needs to develop techniques

Bisimulation equivalence of differential-algebraic systems

NASA Astrophysics Data System (ADS)

Megawati, Noorma Yulia; Schaft, Arjan van der

2018-01-01

In this paper, the notion of bisimulation relation for linear input-state-output systems is extended to general linear differential-algebraic (DAE) systems. Geometric control theory is used to derive a linear-algebraic characterisation of bisimulation relations, and an algorithm for computing the maximal bisimulation relation between two linear DAE systems. The general definition is specialised to the case where the matrix pencil sE - A is regular. Furthermore, by developing a one-sided version of bisimulation, characterisations of simulation and abstraction are obtained.

Symbolic integration of a class of algebraic functions. [by an algorithmic approach

NASA Technical Reports Server (NTRS)

Ng, E. W.

1974-01-01

An algorithm is presented for the symbolic integration of a class of algebraic functions. This class consists of functions made up of rational expressions of an integration variable x and square roots of polynomials, trigonometric and hyperbolic functions of x. The algorithm is shown to consist of the following components:(1) the reduction of input integrands to conical form; (2) intermediate internal representations of integrals; (3) classification of outputs; and (4) reduction and simplification of outputs to well-known functions.

Comparison of methods for developing the dynamics of rigid-body systems

NASA Technical Reports Server (NTRS)

Ju, M. S.; Mansour, J. M.

1989-01-01

Several approaches for developing the equations of motion for a three-degree-of-freedom PUMA robot were compared on the basis of computational efficiency (i.e., the number of additions, subtractions, multiplications, and divisions). Of particular interest was the investigation of the use of computer algebra as a tool for developing the equations of motion. Three approaches were implemented algebraically: Lagrange's method, Kane's method, and Wittenburg's method. Each formulation was developed in absolute and relative coordinates. These six cases were compared to each other and to a recursive numerical formulation. The results showed that all of the formulations implemented algebraically required fewer calculations than the recursive numerical algorithm. The algebraic formulations required fewer calculations in absolute coordinates than in relative coordinates. Each of the algebraic formulations could be simplified, using patterns from Kane's method, to yield the same number of calculations in a given coordinate system.

Cubic map algebra functions for spatio-temporal analysis

USGS Publications Warehouse

Mennis, J.; Viger, R.; Tomlin, C.D.

2005-01-01

We propose an extension of map algebra to three dimensions for spatio-temporal data handling. This approach yields a new class of map algebra functions that we call "cube functions." Whereas conventional map algebra functions operate on data layers representing two-dimensional space, cube functions operate on data cubes representing two-dimensional space over a third-dimensional period of time. We describe the prototype implementation of a spatio-temporal data structure and selected cube function versions of conventional local, focal, and zonal map algebra functions. The utility of cube functions is demonstrated through a case study analyzing the spatio-temporal variability of remotely sensed, southeastern U.S. vegetation character over various land covers and during different El Nin??o/Southern Oscillation (ENSO) phases. Like conventional map algebra, the application of cube functions may demand significant data preprocessing when integrating diverse data sets, and are subject to limitations related to data storage and algorithm performance. Solutions to these issues include extending data compression and computing strategies for calculations on very large data volumes to spatio-temporal data handling.

Symbolic Algebra Development for Higher-Order Electron Propagator Formulation and Implementation.

PubMed

Tamayo-Mendoza, Teresa; Flores-Moreno, Roberto

2014-06-10

Through the use of symbolic algebra, implemented in a program, the algebraic expression of the elements of the self-energy matrix for the electron propagator to different orders were obtained. In addition, a module for the software package Lowdin was automatically generated. Second- and third-order electron propagator results have been calculated to test the correct operation of the program. It was found that the Fortran 90 modules obtained automatically with our algorithm succeeded in calculating ionization energies with the second- and third-order electron propagator in the diagonal approximation. The strategy for the development of this symbolic algebra program is described in detail. This represents a solid starting point for the automatic derivation and implementation of higher-order electron propagator methods.

C-semiring Frameworks for Minimum Spanning Tree Problems

NASA Astrophysics Data System (ADS)

Bistarelli, Stefano; Santini, Francesco

In this paper we define general algebraic frameworks for the Minimum Spanning Tree problem based on the structure of c-semirings. We propose general algorithms that can compute such trees by following different cost criteria, which must be all specific instantiation of c-semirings. Our algorithms are extensions of well-known procedures, as Prim or Kruskal, and show the expressivity of these algebraic structures. They can deal also with partially-ordered costs on the edges.

A Linear Algebra Measure of Cluster Quality.

ERIC Educational Resources Information Center

Mather, Laura A.

2000-01-01

Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)

Algebraic Procedures and Creative Thinking

ERIC Educational Resources Information Center

Tabach, Michal; Friedlander, Alex

2017-01-01

Simplifying symbolic expressions is usually perceived in middle school algebra as an algorithmic activity, achieved by performing sequences of short drill-and-practice tasks, which have little to do with conceptual learning or with creative mathematical thinking. The aim of this study is to explore possible ways by which ninth-grade students can…

Intelligently deciphering unintelligible designs: algorithmic algebraic model checking in systems biology

PubMed Central

Mishra, Bud

2009-01-01

Systems biology, as a subject, has captured the imagination of both biologists and systems scientists alike. But what is it? This review provides one researcher's somewhat idiosyncratic view of the subject, but also aims to persuade young scientists to examine the possible evolution of this subject in a rich historical context. In particular, one may wish to read this review to envision a subject built out of a consilience of many interesting concepts from systems sciences, logic and model theory, and algebra, culminating in novel tools, techniques and theories that can reveal deep principles in biology—seen beyond mere observations. A particular focus in this review is on approaches embedded in an embryonic program, dubbed ‘algorithmic algebraic model checking’, and its powers and limitations. PMID:19364723

Robot Control Based On Spatial-Operator Algebra

NASA Technical Reports Server (NTRS)

Rodriguez, Guillermo; Kreutz, Kenneth K.; Jain, Abhinandan

1992-01-01

Method for mathematical modeling and control of robotic manipulators based on spatial-operator algebra providing concise representation and simple, high-level theoretical frame-work for solution of kinematical and dynamical problems involving complicated temporal and spatial relationships. Recursive algorithms derived immediately from abstract spatial-operator expressions by inspection. Transition from abstract formulation through abstract solution to detailed implementation of specific algorithms to compute solution greatly simplified. Complicated dynamical problems like two cooperating robot arms solved more easily.

Algebraic, geometric, and stochastic aspects of genetic operators

NASA Technical Reports Server (NTRS)

Foo, N. Y.; Bosworth, J. L.

1972-01-01

Genetic algorithms for function optimization employ genetic operators patterned after those observed in search strategies employed in natural adaptation. Two of these operators, crossover and inversion, are interpreted in terms of their algebraic and geometric properties. Stochastic models of the operators are developed which are employed in Monte Carlo simulations of their behavior.

Generic, Type-Safe and Object Oriented Computer Algebra Software

NASA Astrophysics Data System (ADS)

Kredel, Heinz; Jolly, Raphael

Advances in computer science, in particular object oriented programming, and software engineering have had little practical impact on computer algebra systems in the last 30 years. The software design of existing systems is still dominated by ad-hoc memory management, weakly typed algorithm libraries and proprietary domain specific interactive expression interpreters. We discuss a modular approach to computer algebra software: usage of state-of-the-art memory management and run-time systems (e.g. JVM) usage of strongly typed, generic, object oriented programming languages (e.g. Java) and usage of general purpose, dynamic interactive expression interpreters (e.g. Python) To illustrate the workability of this approach, we have implemented and studied computer algebra systems in Java and Scala. In this paper we report on the current state of this work by presenting new examples.

Properties of coupled-cluster equations originating in excitation sub-algebras

NASA Astrophysics Data System (ADS)

Kowalski, Karol

2018-03-01

In this paper, we discuss properties of single-reference coupled cluster (CC) equations associated with the existence of sub-algebras of excitations that allow one to represent CC equations in a hybrid fashion where the cluster amplitudes associated with these sub-algebras can be obtained by solving the corresponding eigenvalue problem. For closed-shell formulations analyzed in this paper, the hybrid representation of CC equations provides a natural way for extending active-space and seniority number concepts to provide an accurate description of electron correlation effects. Moreover, a new representation can be utilized to re-define iterative algorithms used to solve CC equations, especially for tough cases defined by the presence of strong static and dynamical correlation effects. We will also explore invariance properties associated with excitation sub-algebras to define a new class of CC approximations referred to in this paper as the sub-algebra-flow-based CC methods. We illustrate the performance of these methods on the example of ground- and excited-state calculations for commonly used small benchmark systems.

Vertex Algebras W(p)Am and W(p)Dm and Constant Term Identities

NASA Astrophysics Data System (ADS)

Adamović, Dražen; Lin, Xianzu; Milas, Antun

2015-03-01

We consider AD-type orbifolds of the triplet vertex algebras W(p) extending the well-known c=1 orbifolds of lattice vertex algebras. We study the structure of Zhu's algebras A(W(p)^{A_m}) and A(W(p)^{D_m}), where A_m and D_m are cyclic and dihedral groups, respectively. A combinatorial algorithm for classification of irreducible W(p)^Γ-modules is developed, which relies on a family of constant term identities and properties of certain polynomials based on constant terms. All these properties can be checked for small values of m and p with a computer software. As a result, we argue that if certain constant term properties hold, the irreducible modules constructed in [Commun. Contemp. Math. 15 (2013), 1350028, 30 pages; Internat. J. Math. 25 (2014), 1450001, 34 pages] provide a complete list of irreducible W(p)^{A_m} and W(p)^{D_m}-modules. This paper is a continuation of our previous work on the ADE subalgebras of the triplet vertex algebra W(p).

Optical linear algebra processors - Architectures and algorithms

NASA Technical Reports Server (NTRS)

Casasent, David

1986-01-01

Attention is given to the component design and optical configuration features of a generic optical linear algebra processor (OLAP) architecture, as well as the large number of OLAP architectures, number representations, algorithms and applications encountered in current literature. Number-representation issues associated with bipolar and complex-valued data representations, high-accuracy (including floating point) performance, and the base or radix to be employed, are discussed, together with case studies on a space-integrating frequency-multiplexed architecture and a hybrid space-integrating and time-integrating multichannel architecture.

A note on probabilistic models over strings: the linear algebra approach.

PubMed

Bouchard-Côté, Alexandre

2013-12-01

Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems.

Exact solution of some linear matrix equations using algebraic methods

NASA Technical Reports Server (NTRS)

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

1979-01-01

Algebraic methods are used to construct the exact solution P of the linear matrix equation PA + BP = - C, where A, B, and C are matrices with real entries. The emphasis of this equation 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 paper is divided into six sections which include the proof of the basic lemma, the Liapunov equation, and the computer implementation for the rational, integer and modular algorithms. Two numerical examples are given and the entire calculation process is depicted.

Algebraic criteria for positive realness relative to the unit circle.

NASA Technical Reports Server (NTRS)

Siljak, D. D.

1973-01-01

A definition is presented of the circle positive realness of real rational functions relative to the unit circle in the complex variable plane. The problem of testing this kind of positive reality is reduced to the algebraic problem of determining the distribution of zeros of a real polynomial with respect to and on the unit circle. Such reformulation of the problem avoids the search for explicit information about imaginary poles of rational functions. The stated algebraic problem is solved by applying the polynomial criteria of Marden (1966) and Jury (1964), and a completely recursive algorithm for circle positive realness is obtained.

Algebraic methods for the solution of some linear matrix equations

NASA Technical Reports Server (NTRS)

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

1979-01-01

The characterization of polynomials whose zeros lie in certain algebraic domains (and the unification of the ideas of Hermite and Lyapunov) is the basis for developing finite algorithms for the solution of linear matrix equations. Particular attention is given to equations PA + A'P = Q (the Lyapunov equation) and P - A'PA = Q the (discrete Lyapunov equation). The Lyapunov equation appears in several areas of control theory such as stability theory, optimal control (evaluation of quadratic integrals), stochastic control (evaluation of covariance matrices) and in the solution of the algebraic Riccati equation using Newton's method.

Complementary Reliability-Based Decodings of Binary Linear Block Codes

NASA Technical Reports Server (NTRS)

Fossorier, Marc P. C.; Lin, Shu

1997-01-01

This correspondence presents a hybrid reliability-based decoding algorithm which combines the reprocessing method based on the most reliable basis and a generalized Chase-type algebraic decoder based on the least reliable positions. It is shown that reprocessing with a simple additional algebraic decoding effort achieves significant coding gain. For long codes, the order of reprocessing required to achieve asymptotic optimum error performance is reduced by approximately 1/3. This significantly reduces the computational complexity, especially for long codes. Also, a more efficient criterion for stopping the decoding process is derived based on the knowledge of the algebraic decoding solution.

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

PubMed

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.

Computation of indirect nuclear spin-spin couplings with reduced complexity in pure and hybrid density functional approximations.

PubMed

Luenser, Arne; Kussmann, Jörg; Ochsenfeld, Christian

2016-09-28

We present a (sub)linear-scaling algorithm to determine indirect nuclear spin-spin coupling constants at the Hartree-Fock and Kohn-Sham density functional levels of theory. Employing efficient integral algorithms and sparse algebra routines, an overall (sub)linear scaling behavior can be obtained for systems with a non-vanishing HOMO-LUMO gap. Calculations on systems with over 1000 atoms and 20 000 basis functions illustrate the performance and accuracy of our reference implementation. Specifically, we demonstrate that linear algebra dominates the runtime of conventional algorithms for 10 000 basis functions and above. Attainable speedups of our method exceed 6 × in total runtime and 10 × in the linear algebra steps for the tested systems. Furthermore, a convergence study of spin-spin couplings of an aminopyrazole peptide upon inclusion of the water environment is presented: using the new method it is shown that large solvent spheres are necessary to converge spin-spin coupling values.

Numerical methods on some structured matrix algebra problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jessup, E.R.

1996-06-01

This proposal concerned the design, analysis, and implementation of serial and parallel algorithms for certain structured matrix algebra problems. It emphasized large order problems and so focused on methods that can be implemented efficiently on distributed-memory MIMD multiprocessors. Such machines supply the computing power and extensive memory demanded by the large order problems. We proposed to examine three classes of matrix algebra problems: the symmetric and nonsymmetric eigenvalue problems (especially the tridiagonal cases) and the solution of linear systems with specially structured coefficient matrices. As all of these are of practical interest, a major goal of this work was tomore » translate our research in linear algebra into useful tools for use by the computational scientists interested in these and related applications. Thus, in addition to software specific to the linear algebra problems, we proposed to produce a programming paradigm and library to aid in the design and implementation of programs for distributed-memory MIMD computers. We now report on our progress on each of the problems and on the programming tools.« less

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

PubMed

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-based tool for several different input formats, and it makes analysis of complex models accessible to a larger community, as it is platform independent as a web-service and does not require understanding of the underlying mathematics.

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

NASA Astrophysics Data System (ADS)

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.

Exact solution of some linear matrix equations using algebraic methods

NASA Technical Reports Server (NTRS)

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.

ADART: an adaptive algebraic reconstruction algorithm for discrete tomography.

PubMed

Maestre-Deusto, F Javier; Scavello, Giovanni; Pizarro, Joaquín; Galindo, Pedro L

2011-08-01

In this paper we suggest an algorithm based on the Discrete Algebraic Reconstruction Technique (DART) which is capable of computing high quality reconstructions from substantially fewer projections than required for conventional continuous tomography. Adaptive DART (ADART) goes a step further than DART on the reduction of the number of unknowns of the associated linear system achieving a significant reduction in the pixel error rate of reconstructed objects. The proposed methodology automatically adapts the border definition criterion at each iteration, resulting in a reduction of the number of pixels belonging to the border, and consequently of the number of unknowns in the general algebraic reconstruction linear system to be solved, being this reduction specially important at the final stage of the iterative process. Experimental results show that reconstruction errors are considerably reduced using ADART when compared to original DART, both in clean and noisy environments.

Many-core graph analytics using accelerated sparse linear algebra routines

NASA Astrophysics Data System (ADS)

Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric

2016-05-01

Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.

Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

DOE PAGES

Bank, R.; Falgout, R. D.; Jones, T.; ...

2015-10-29

In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods inmore » Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.« less

Matrix preconditioning: a robust operation for optical linear algebra processors.

PubMed

Ghosh, A; Paparao, P

1987-07-15

Analog electrooptical processors are best suited for applications demanding high computational throughput with tolerance for inaccuracies. Matrix preconditioning is one such application. Matrix preconditioning is a preprocessing step for reducing the condition number of a matrix and is used extensively with gradient algorithms for increasing the rate of convergence and improving the accuracy of the solution. In this paper, we describe a simple parallel algorithm for matrix preconditioning, which can be implemented efficiently on a pipelined optical linear algebra processor. From the results of our numerical experiments we show that the efficacy of the preconditioning algorithm is affected very little by the errors of the optical system.

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barker, Andrew T.; Benson, Thomas R.; Lee, Chak Shing

ParELAG is a parallel C++ library for numerical upscaling of finite element discretizations and element-based algebraic multigrid solvers. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured meshes. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Generalized EMV-Effect Algebras

NASA Astrophysics Data System (ADS)

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.

Optical pattern recognition algorithms on neural-logic equivalent models and demonstration of their prospects and possible implementations

NASA Astrophysics Data System (ADS)

Krasilenko, Vladimir G.; Nikolsky, Alexander I.; Zaitsev, Alexandr V.; Voloshin, Victor M.

2001-03-01

Historic information regarding the appearance and creation of fundamentals of algebra-logical apparatus-`equivalental algebra' for description of neuro-nets paradigms and algorithms is considered which is unification of theory of neuron nets (NN), linear algebra and the most generalized neuro-biology extended for matrix case. A survey is given of `equivalental models' of neuron nets and associative memory is suggested new, modified matrix-tenzor neurological equivalental models (MTNLEMS) are offered with double adaptive-equivalental weighing (DAEW) for spatial-non- invariant recognition (SNIR) and space-invariant recognition (SIR) of 2D images (patterns). It is shown, that MTNLEMS DAEW are the most generalized, they can describe the processes in NN both within the frames of known paradigms and within new `equivalental' paradigm of non-interaction type, and the computing process in NN under using the offered MTNLEMs DAEW is reduced to two-step and multi-step algorithms and step-by-step matrix-tenzor procedures (for SNIR) and procedures of defining of space-dependent equivalental functions from two images (for SIR).

Continuum analogues of contragredient Lie algebras (Lie algebras with a Cartan operator and nonlinear dynamical systems)

NASA Astrophysics Data System (ADS)

Saveliev, M. V.; Vershik, A. M.

1989-12-01

We present an axiomatic formulation of a new class of infinitedimensional Lie algebras-the generalizations of Z-graded Lie algebras with, generally speaking, an infinite-dimensional Cartan subalgebra and a contiguous set of roots. We call such algebras “continuum Lie algebras.” The simple Lie algebras of constant growth are encapsulated in our formulation. We pay particular attention to the case when the local algebra is parametrized by a commutative algebra while the Cartan operator (the generalization of the Cartan matrix) is a linear operator. Special examples of these algebras are the Kac-Moody algebras, algebras of Poisson brackets, algebras of vector fields on a manifold, current algebras, and algebras with differential or integro-differential cartan operator. The nonlinear dynamical systems associated with the continuum contragredient Lie algebras are also considered.

Real-time dynamics simulation of the Cassini spacecraft using DARTS. Part 1: Functional capabilities and the spatial algebra algorithm

NASA Technical Reports Server (NTRS)

Jain, A.; Man, G. K.

1993-01-01

This paper describes the Dynamics Algorithms for Real-Time Simulation (DARTS) real-time hardware-in-the-loop dynamics simulator for the National Aeronautics and Space Administration's Cassini spacecraft. The spacecraft model consists of a central flexible body with a number of articulated rigid-body appendages. The demanding performance requirements from the spacecraft control system require the use of a high fidelity simulator for control system design and testing. The DARTS algorithm provides a new algorithmic and hardware approach to the solution of this hardware-in-the-loop simulation problem. It is based upon the efficient spatial algebra dynamics for flexible multibody systems. A parallel and vectorized version of this algorithm is implemented on a low-cost, multiprocessor computer to meet the simulation timing requirements.

Computational approach to compact Riemann surfaces

NASA Astrophysics Data System (ADS)

Frauendiener, Jörg; Klein, Christian

2017-01-01

A purely numerical approach to compact Riemann surfaces starting from plane algebraic curves is presented. The critical points of the algebraic curve are computed via a two-dimensional Newton iteration. The starting values for this iteration are obtained from the resultants with respect to both coordinates of the algebraic curve and a suitable pairing of their zeros. A set of generators of the fundamental group for the complement of these critical points in the complex plane is constructed from circles around these points and connecting lines obtained from a minimal spanning tree. The monodromies are computed by solving the defining equation of the algebraic curve on collocation points along these contours and by analytically continuing the roots. The collocation points are chosen to correspond to Chebychev collocation points for an ensuing Clenshaw-Curtis integration of the holomorphic differentials which gives the periods of the Riemann surface with spectral accuracy. At the singularities of the algebraic curve, Puiseux expansions computed by contour integration on the circles around the singularities are used to identify the holomorphic differentials. The Abel map is also computed with the Clenshaw-Curtis algorithm and contour integrals. As an application of the code, solutions to the Kadomtsev-Petviashvili equation are computed on non-hyperelliptic Riemann surfaces.

Prime factorization using quantum annealing and computational algebraic geometry

NASA Astrophysics Data System (ADS)

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.

Kleene Algebra and Bytecode Verification

DTIC Science & Technology

2016-04-27

computing the star (Kleene closure) of a matrix of transfer functions. In this paper we show how this general framework applies to the problem of Java ...bytecode verification. We show how to specify transfer functions arising in Java bytecode verification in such a way that the Kleene algebra operations...potentially improve the performance over the standard worklist algorithm when a small cutset can be found. Key words: Java , bytecode, verification, static

Numerical Methods for Forward and Inverse Problems in Discontinuous Media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chartier, Timothy P.

The research emphasis under this grant's funding is in the area of algebraic multigrid methods. The research has two main branches: 1) exploring interdisciplinary applications in which algebraic multigrid can make an impact and 2) extending the scope of algebraic multigrid methods with algorithmic improvements that are based in strong analysis.The work in interdisciplinary applications falls primarily in the field of biomedical imaging. Work under this grant demonstrated the effectiveness and robustness of multigrid for solving linear systems that result from highly heterogeneous finite element method models of the human head. The results in this work also give promise tomore » medical advances possible with software that may be developed. Research to extend the scope of algebraic multigrid has been focused in several areas. In collaboration with researchers at the University of Colorado, Lawrence Livermore National Laboratory, and Los Alamos National Laboratory, the PI developed an adaptive multigrid with subcycling via complementary grids. This method has very cheap computing costs per iterate and is showing promise as a preconditioner for conjugate gradient. Recent work with Los Alamos National Laboratory concentrates on developing algorithms that take advantage of the recent advances in adaptive multigrid research. The results of the various efforts in this research could ultimately have direct use and impact to researchers for a wide variety of applications, including, astrophysics, neuroscience, contaminant transport in porous media, bi-domain heart modeling, modeling of tumor growth, and flow in heterogeneous porous media. This work has already led to basic advances in computational mathematics and numerical linear algebra and will continue to do so into the future.« less

On recent advances and future research directions for computational fluid dynamics

NASA Technical Reports Server (NTRS)

Baker, A. J.; Soliman, M. O.; Manhardt, P. D.

1986-01-01

This paper highlights some recent accomplishments regarding CFD numerical algorithm constructions for generation of discrete approximate solutions to classes of Reynolds-averaged Navier-Stokes equations. Following an overview of turbulent closure modeling, and development of appropriate conservation law systems, a Taylor weak-statement semi-discrete approximate solution algorithm is developed. Various forms for completion to the final linear algebra statement are cited, as are a range of candidate numerical linear algebra solution procedures. This development sequence emphasizes the key building blocks of a CFD RNS algorithm, including solution trial and test spaces, integration procedure and added numerical stability mechanisms. A range of numerical results are discussed focusing on key topics guiding future research directions.

Multigrid solutions to quasi-elliptic schemes

NASA Technical Reports Server (NTRS)

Brandt, A.; Taasan, S.

1985-01-01

Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate then corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.

Multigrid solutions to quasi-elliptic schemes

NASA Technical Reports Server (NTRS)

Brandt, A.; Taasan, S.

1985-01-01

Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate than corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.

Software Development Of XML Parser Based On Algebraic Tools

NASA Astrophysics Data System (ADS)

Georgiev, Bozhidar; Georgieva, Adriana

2011-12-01

In this paper, is presented one software development and implementation of an algebraic method for XML data processing, which accelerates XML parsing process. Therefore, the proposed in this article nontraditional approach for fast XML navigation with algebraic tools contributes to advanced efforts in the making of an easier user-friendly API for XML transformations. Here the proposed software for XML documents processing (parser) is easy to use and can manage files with strictly defined data structure. The purpose of the presented algorithm is to offer a new approach for search and restructuring hierarchical XML data. This approach permits fast XML documents processing, using algebraic model developed in details in previous works of the same authors. So proposed parsing mechanism is easy accessible to the web consumer who is able to control XML file processing, to search different elements (tags) in it, to delete and to add a new XML content as well. The presented various tests show higher rapidity and low consumption of resources in comparison with some existing commercial parsers.

Strategies Toward Automation of Overset Structured Surface Grid Generation

NASA Technical Reports Server (NTRS)

Chan, William M.

2017-01-01

An outline of a strategy for automation of overset structured surface grid generation on complex geometries is described. The starting point of the process consists of an unstructured surface triangulation representation of the geometry derived from a native CAD, STEP, or IGES definition, and a set of discretized surface curves that captures all geometric features of interest. The procedure for surface grid generation is decomposed into an algebraic meshing step, a hyperbolic meshing step, and a gap-filling step. This paper will focus primarily on the high-level plan with details on the algebraic step. The algorithmic procedure for the algebraic step involves analyzing the topology of the network of surface curves, distributing grid points appropriately on these curves, identifying domains bounded by four curves that can be meshed algebraically, concatenating the resulting grids into fewer patches, and extending appropriate boundaries of the concatenated grids to provide proper overlap. Results are presented for grids created on various aerospace vehicle components.

Final Report: Subcontract B623868 Algebraic Multigrid solvers for coupled PDE systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brannick, J.

The Pennsylvania State University (“Subcontractor”) continued to work on the design of algebraic multigrid solvers for coupled systems of partial differential equations (PDEs) arising in numerical modeling of various applications, with a main focus on solving the Dirac equation arising in Quantum Chromodynamics (QCD). The goal of the proposed work was to develop combined geometric and algebraic multilevel solvers that are robust and lend themselves to efficient implementation on massively parallel heterogeneous computers for these QCD systems. The research in these areas built on previous works, focusing on the following three topics: (1) the development of parallel full-multigrid (PFMG) andmore » non-Galerkin coarsening techniques in this frame work for solving the Wilson Dirac system; (2) the use of these same Wilson MG solvers for preconditioning the Overlap and Domain Wall formulations of the Dirac equation; and (3) the design and analysis of algebraic coarsening algorithms for coupled PDE systems including Stokes equation, Maxwell equation and linear elasticity.« less

In Praise of Numerical Computation

NASA Astrophysics Data System (ADS)

Yap, Chee K.

Theoretical Computer Science has developed an almost exclusively discrete/algebraic persona. We have effectively shut ourselves off from half of the world of computing: a host of problems in Computational Science & Engineering (CS&E) are defined on the continuum, and, for them, the discrete viewpoint is inadequate. The computational techniques in such problems are well-known to numerical analysis and applied mathematics, but are rarely discussed in theoretical algorithms: iteration, subdivision and approximation. By various case studies, I will indicate how our discrete/algebraic view of computing has many shortcomings in CS&E. We want embrace the continuous/analytic view, but in a new synthesis with the discrete/algebraic view. I will suggest a pathway, by way of an exact numerical model of computation, that allows us to incorporate iteration and approximation into our algorithms’ design. Some recent results give a peek into how this view of algorithmic development might look like, and its distinctive form suggests the name “numerical computational geometry” for such activities.

Verifying a Computer Algorithm Mathematically.

ERIC Educational Resources Information Center

Olson, Alton T.

1986-01-01

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra

PubMed Central

2011-01-01

Background 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. Results 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. Conclusions 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-based tool for several different input formats, and it makes analysis of complex models accessible to a larger community, as it is platform independent as a web-service and does not require understanding of the underlying mathematics. PMID:21774817

Prime factorization using quantum annealing and computational algebraic geometry

PubMed Central

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. PMID:28220854

Graphs and matroids weighted in a bounded incline algebra.

PubMed

Lu, Ling-Xia; Zhang, Bei

2014-01-01

Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.

The algebraic decoding of the (41, 21, 9) quadratic residue code

NASA Technical Reports Server (NTRS)

Reed, Irving S.; Truong, T. K.; Chen, Xuemin; Yin, Xiaowei

1992-01-01

A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes.

Virasoro algebra in the KN algebra; Bosonic string with fermionic ghosts on Riemann surfaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Koibuchi, H.

1991-10-10

In this paper the bosonic string model with fermionic ghosts is considered in the framework of the KN algebra. The authors' attentions are paid to representations of KN algebra and a Clifford algebra of the ghosts. The authors show that a Virasoro-like algebra is obtained from KN algebra when KN algebra has certain antilinear anti-involution, and that it is isomorphic to the usual Virasoro algebra. The authors show that there is an expected relation between a central charge of this Virasoro-like algebra and an anomaly of the combined system.

Mathematical Modeling for Inherited Diseases.

PubMed

Anis, Saima; Khan, Madad; Khan, Saqib

2017-01-01

We introduced a new nonassociative algebra, namely, left almost algebra, and discussed some of its genetic properties. We discussed the relation of this algebra with flexible algebra, Jordan algebra, and generalized Jordan algebra.

Classification of commutator algebras leading to the new type of closed Baker-Campbell-Hausdorff formulas

NASA Astrophysics Data System (ADS)

Matone, Marco

2015-11-01

We show that there are {\\it 13 types} of commutator algebras leading to the new closed forms of the Baker-Campbell-Hausdorff (BCH) formula $$\\exp(X)\\exp(Y)\\exp(Z)=\\exp({AX+BZ+CY+DI}) \\ , $$ derived in arXiv:1502.06589, JHEP {\\bf 1505} (2015) 113. This includes, as a particular case, $\\exp(X) \\exp(Z)$, with $[X,Z]$ containing other elements in addition to $X$ and $Z$. The algorithm exploits the associativity of the BCH formula and is based on the decomposition $\\exp(X)\\exp(Y)\\exp(Z)=\\exp(X)\\exp({\\alpha Y}) \\exp({(1-\\alpha) Y}) \\exp(Z)$, with $\\alpha$ fixed in such a way that it reduces to $\\exp({\\tilde X})\\exp({\\tilde Y})$, with $\\tilde X$ and $\\tilde Y$ satisfying the Van-Brunt and Visser condition $[\\tilde X,\\tilde Y]=\\tilde u\\tilde X+\\tilde v\\tilde Y+\\tilde cI$. It turns out that $e^\\alpha$ satisfies, in the generic case, an algebraic equation whose exponents depend on the parameters defining the commutator algebra. In nine {\\it types} of commutator algebras, such an equation leads to rational solutions for $\\alpha$. We find all the equations that characterize the solution of the above decomposition problem by combining it with the Jacobi identity.

Mathematical Modeling for Inherited Diseases

PubMed Central

Khan, Saqib

2017-01-01

We introduced a new nonassociative algebra, namely, left almost algebra, and discussed some of its genetic properties. We discussed the relation of this algebra with flexible algebra, Jordan algebra, and generalized Jordan algebra. PMID:28781606

Closed form of the Baker-Campbell-Hausdorff formula for the generators of semisimple complex Lie algebras

NASA Astrophysics Data System (ADS)

Matone, Marco

2016-11-01

Recently it has been introduced an algorithm for the Baker-Campbell-Hausdorff (BCH) formula, which extends the Van-Brunt and Visser recent results, leading to new closed forms of BCH formula. More recently, it has been shown that there are 13 types of such commutator algebras. We show, by providing the explicit solutions, that these include the generators of the semisimple complex Lie algebras. More precisely, for any pair, X, Y of the Cartan-Weyl basis, we find W, linear combination of X, Y, such that exp (X) exp (Y)=exp (W). The derivation of such closed forms follows, in part, by using the above mentioned recent results. The complete derivation is provided by considering the structure of the root system. Furthermore, if X, Y, and Z are three generators of the Cartan-Weyl basis, we find, for a wide class of cases, W, a linear combination of X, Y and Z, such that exp (X) exp (Y) exp (Z)=exp (W). It turns out that the relevant commutator algebras are type 1c-i, type 4 and type 5. A key result concerns an iterative application of the algorithm leading to relevant extensions of the cases admitting closed forms of the BCH formula. Here we provide the main steps of such an iteration that will be developed in a forthcoming paper.

Smooth function approximation using neural networks.

PubMed

Ferrari, Silvia; Stengel, Robert F

2005-01-01

An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.

Acoustooptic linear algebra processors - Architectures, algorithms, and applications

NASA Technical Reports Server (NTRS)

Casasent, D.

1984-01-01

Architectures, algorithms, and applications for systolic processors are described with attention to the realization of parallel algorithms on various optical systolic array processors. Systolic processors for matrices with special structure and matrices of general structure, and the realization of matrix-vector, matrix-matrix, and triple-matrix products and such architectures are described. Parallel algorithms for direct and indirect solutions to systems of linear algebraic equations and their implementation on optical systolic processors are detailed with attention to the pipelining and flow of data and operations. Parallel algorithms and their optical realization for LU and QR matrix decomposition are specifically detailed. These represent the fundamental operations necessary in the implementation of least squares, eigenvalue, and SVD solutions. Specific applications (e.g., the solution of partial differential equations, adaptive noise cancellation, and optimal control) are described to typify the use of matrix processors in modern advanced signal processing.

A note on derivations of Murray-von Neumann algebras.

PubMed

Kadison, Richard V; Liu, Zhe

2014-02-11

A Murray-von Neumann algebra is the algebra of operators affiliated with a finite von Neumann algebra. In this article, we first present a brief introduction to the theory of derivations of operator algebras from both the physical and mathematical points of view. We then describe our recent work on derivations of Murray-von Neumann algebras. We show that the "extended derivations" of a Murray-von Neumann algebra, those that map the associated finite von Neumann algebra into itself, are inner. In particular, we prove that the only derivation that maps a Murray-von Neumann algebra associated with a factor of type II1 into that factor is 0. Those results are extensions of Singer's seminal result answering a question of Kaplansky, as applied to von Neumann algebras: The algebra may be noncommutative and may even contain unbounded elements.

Banach Synaptic Algebras

NASA Astrophysics Data System (ADS)

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.

Hopf algebras of rooted forests, cocyles, and free Rota-Baxter algebras

NASA Astrophysics Data System (ADS)

Zhang, Tianjie; Gao, Xing; Guo, Li

2016-10-01

The Hopf algebra and the Rota-Baxter algebra are the two algebraic structures underlying the algebraic approach of Connes and Kreimer to renormalization of perturbative quantum field theory. In particular, the Hopf algebra of rooted trees serves as the "baby model" of Feynman graphs in their approach and can be characterized by certain universal properties involving a Hochschild 1-cocycle. Decorated rooted trees have also been applied to study Feynman graphs. We will continue the study of universal properties of various spaces of decorated rooted trees with such a 1-cocycle, leading to the concept of a cocycle Hopf algebra. We further apply the universal properties to equip a free Rota-Baxter algebra with the structure of a cocycle Hopf algebra.

The Unitality of Quantum B-algebras

NASA Astrophysics Data System (ADS)

Han, Shengwei; Xu, Xiaoting; Qin, Feng

2018-02-01

Quantum B-algebras as a generalization of quantales were introduced by Rump and Yang, which cover the majority of implicational algebras and provide a unified semantic for a wide class of substructural logics. Unital quantum B-algebras play an important role in the classification of implicational algebras. The main purpose of this paper is to construct unital quantum B-algebras from non-unital quantum B-algebras.

Generalized algebraic scene-based nonuniformity correction algorithm.

PubMed

Ratliff, Bradley M; Hayat, Majeed M; Tyo, J Scott

2005-02-01

A generalization of a recently developed algebraic scene-based nonuniformity correction algorithm for focal plane array (FPA) sensors is presented. The new technique uses pairs of image frames exhibiting arbitrary one- or two-dimensional translational motion to compute compensator quantities that are then used to remove nonuniformity in the bias of the FPA response. Unlike its predecessor, the generalization does not require the use of either a blackbody calibration target or a shutter. The algorithm has a low computational overhead, lending itself to real-time hardware implementation. The high-quality correction ability of this technique is demonstrated through application to real IR data from both cooled and uncooled infrared FPAs. A theoretical and experimental error analysis is performed to study the accuracy of the bias compensator estimates in the presence of two main sources of error.

New matrix bounds and iterative algorithms for the discrete coupled algebraic Riccati equation

NASA Astrophysics Data System (ADS)

Liu, Jianzhou; Wang, Li; Zhang, Juan

2017-11-01

The discrete coupled algebraic Riccati equation (DCARE) has wide applications in control theory and linear system. In general, for the DCARE, one discusses every term of the coupled term, respectively. In this paper, we consider the coupled term as a whole, which is different from the recent results. When applying eigenvalue inequalities to discuss the coupled term, our method has less error. In terms of the properties of special matrices and eigenvalue inequalities, we propose several upper and lower matrix bounds for the solution of DCARE. Further, we discuss the iterative algorithms for the solution of the DCARE. In the fixed point iterative algorithms, the scope of Lipschitz factor is wider than the recent results. Finally, we offer corresponding numerical examples to illustrate the effectiveness of the derived results.

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

NASA Astrophysics Data System (ADS)

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.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suh, Uhi Rinn, E-mail: uhrisu1@math.snu.ac.kr

We introduce a classical BRST complex (See Definition 3.2.) and show that one can construct a classical affine W-algebra via the complex. This definition clarifies that classical affine W-algebras can be considered as quasi-classical limits of quantum affine W-algebras. We also give a definition of a classical affine fractional W-algebra as a Poisson vertex algebra. As in the classical affine case, a classical affine fractional W-algebra has two compatible λ-brackets and is isomorphic to an algebra of differential polynomials as a differential algebra. When a classical affine fractional W-algebra is associated to a minimal nilpotent, we describe explicit forms ofmore » free generators and compute λ-brackets between them. Provided some assumptions on a classical affine fractional W-algebra, we find an infinite sequence of integrable systems related to the algebra, using the generalized Drinfel’d and Sokolov reduction.« less

A note on derivations of Murray–von Neumann algebras

PubMed Central

Kadison, Richard V.; Liu, Zhe

2014-01-01

A Murray–von Neumann algebra is the algebra of operators affiliated with a finite von Neumann algebra. In this article, we first present a brief introduction to the theory of derivations of operator algebras from both the physical and mathematical points of view. We then describe our recent work on derivations of Murray–von Neumann algebras. We show that the “extended derivations” of a Murray–von Neumann algebra, those that map the associated finite von Neumann algebra into itself, are inner. In particular, we prove that the only derivation that maps a Murray–von Neumann algebra associated with a factor of type II1 into that factor is 0. Those results are extensions of Singer’s seminal result answering a question of Kaplansky, as applied to von Neumann algebras: The algebra may be noncommutative and may even contain unbounded elements. PMID:24469831

A double commutant theorem for Murray–von Neumann algebras

PubMed Central

Liu, Zhe

2012-01-01

Murray–von Neumann algebras are algebras of operators affiliated with finite von Neumann algebras. In this article, we study commutativity and affiliation of self-adjoint operators (possibly unbounded). We show that a maximal abelian self-adjoint subalgebra of the Murray–von Neumann algebra associated with a finite von Neumann algebra is the Murray–von Neumann algebra , where is a maximal abelian self-adjoint subalgebra of and, in addition, is . We also prove that the Murray–von Neumann algebra with the center of is the center of the Murray–von Neumann algebra . Von Neumann’s celebrated double commutant theorem characterizes von Neumann algebras as those for which , where , the commutant of , is the set of bounded operators on the Hilbert space that commute with all operators in . At the end of this article, we present a double commutant theorem for Murray–von Neumann algebras. PMID:22543165

DNA algorithms of implementing biomolecular databases on a biological computer.

PubMed

Chang, Weng-Long; Vasilakos, Athanasios V

2015-01-01

In this paper, DNA algorithms are proposed to perform eight operations of relational algebra (calculus), which include Cartesian product, union, set difference, selection, projection, intersection, join, and division, on biomolecular relational databases.

"ON ALGEBRAIC DECODING OF Q-ARY REED-MULLER AND PRODUCT REED-SOLOMON CODES"

DOE Office of Scientific and Technical Information (OSTI.GOV)

SANTHI, NANDAKISHORE

We consider a list decoding algorithm recently proposed by Pellikaan-Wu for q-ary Reed-Muller codes RM{sub q}({ell}, m, n) of length n {le} q{sup m} when {ell} {le} q. A simple and easily accessible correctness proof is given which shows that this algorithm achieves a relative error-correction radius of {tau} {le} (1-{radical}{ell}q{sup m-1}/n). This is an improvement over the proof using one-point Algebraic-Geometric decoding method given in. The described algorithm can be adapted to decode product Reed-Solomon codes. We then propose a new low complexity recursive aJgebraic decoding algorithm for product Reed-Solomon codes and Reed-Muller codes. This algorithm achieves a relativemore » error correction radius of {tau} {le} {Pi}{sub i=1}{sup m} (1 - {radical}k{sub i}/q). This algorithm is then proved to outperform the Pellikaan-Wu algorithm in both complexity and error correction radius over a wide range of code rates.« less

Tracking control of concentration profiles in a fed-batch bioreactor using a linear algebra methodology.

PubMed

Rómoli, Santiago; Serrano, Mario Emanuel; Ortiz, Oscar Alberto; Vega, Jorge Rubén; Eduardo Scaglia, Gustavo Juan

2015-07-01

Based on a linear algebra approach, this paper aims at developing a novel control law able to track reference profiles that were previously-determined in the literature. A main advantage of the proposed strategy is that the control actions are obtained by solving a system of linear equations. The optimal controller parameters are selected through Monte Carlo Randomized Algorithm in order to minimize a proposed cost index. The controller performance is evaluated through several tests, and compared with other controller reported in the literature. Finally, a Monte Carlo Randomized Algorithm is conducted to assess the performance of the proposed controller. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Assessing Algebraic Solving Ability: A Theoretical Framework

ERIC Educational Resources Information Center

Lian, Lim Hooi; Yew, Wun Thiam

2012-01-01

Algebraic solving ability had been discussed by many educators and researchers. There exists no definite definition for algebraic solving ability as it can be viewed from different perspectives. In this paper, the nature of algebraic solving ability in terms of algebraic processes that demonstrate the ability in solving algebraic problem is…

On the intersection of irreducible components of the space of finite-dimensional Lie algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gorbatsevich, Vladimir V

2012-07-31

The irreducible components of the space of n-dimensional Lie algebras are investigated. The properties of Lie algebras belonging to the intersection of all the irreducible components of this kind are studied (these Lie algebras are said to be basic or founding Lie algebras). It is proved that all Lie algebras of this kind are nilpotent and each of these Lie algebras has an Abelian ideal of codimension one. Specific examples of founding Lie algebras of arbitrary dimension are described and, to describe the Lie algebras in general, we state a conjecture. The concept of spectrum of a Lie algebra ismore » considered and some of the most elementary properties of the spectrum are studied. Bibliography: 6 titles.« less

Duncan F. Gregory, William Walton and the development of British algebra: 'algebraical geometry', 'geometrical algebra', abstraction.

PubMed

Verburgt, Lukas M

2016-01-01

This paper provides a detailed account of the period of the complex history of British algebra and geometry between the publication of George Peacock's Treatise on Algebra in 1830 and William Rowan Hamilton's paper on quaternions of 1843. During these years, Duncan Farquharson Gregory and William Walton published several contributions on 'algebraical geometry' and 'geometrical algebra' in the Cambridge Mathematical Journal. These contributions enabled them not only to generalize Peacock's symbolical algebra on the basis of geometrical considerations, but also to initiate the attempts to question the status of Euclidean space as the arbiter of valid geometrical interpretations. At the same time, Gregory and Walton were bound by the limits of symbolical algebra that they themselves made explicit; their work was not and could not be the 'abstract algebra' and 'abstract geometry' of figures such as Hamilton and Cayley. The central argument of the paper is that an understanding of the contributions to 'algebraical geometry' and 'geometrical algebra' of the second generation of 'scientific' symbolical algebraists is essential for a satisfactory explanation of the radical transition from symbolical to abstract algebra that took place in British mathematics in the 1830s-1840s.

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

PubMed

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.

From simplicial Lie algebras and hypercrossed complexes to differential graded Lie algebras via 1-jets

NASA Astrophysics Data System (ADS)

Jurčo, Branislav

2012-12-01

Let g be a simplicial Lie algebra with Moore complex Ng of length k. Let G be the simplicial Lie group integrating g, such that each Gn is simply connected. We use the 1-jet of the classifying space W¯ G to construct, starting from g, a Lie k-algebra L. The so constructed Lie k-algebra L is actually a differential graded Lie algebra. The differential and the brackets are explicitly described in terms (of a part) of the corresponding k-hypercrossed complex structure of Ng. The result can be seen as a geometric interpretation of Quillen's (purely algebraic) construction of the adjunction between simplicial Lie algebras and dg-Lie algebras.

Algebra: A Challenge at the Crossroads of Policy and Practice

ERIC Educational Resources Information Center

Stein, Mary Kay; Kaufman, Julia Heath; Sherman, Milan; Hillen, Amy F.

2011-01-01

The authors review what is known about early and universal algebra, including who is getting access to algebra and student outcomes associated with algebra course taking in general and specifically with universal algebra policies. The findings indicate that increasing numbers of students, some of whom are underprepared, are taking algebra earlier.…

Making Algebra Work: Instructional Strategies that Deepen Student Understanding, within and between Algebraic Representations

ERIC Educational Resources Information Center

Star, Jon R.; Rittle-Johnson, Bethany

2009-01-01

Competence in algebra is increasingly recognized as a critical milestone in students' middle and high school years. The transition from arithmetic to algebra is a notoriously difficult one, and improvements in algebra instruction are greatly needed (National Research Council, 2001). Algebra historically has represented students' first sustained…

Algebraic K-theory, K-regularity, and -duality of -stable C ∗-algebras

NASA Astrophysics Data System (ADS)

Mahanta, Snigdhayan

2015-12-01

We develop an algebraic formalism for topological -duality. More precisely, we show that topological -duality actually induces an isomorphism between noncommutative motives that in turn implements the well-known isomorphism between twisted K-theories (up to a shift). In order to establish this result we model topological K-theory by algebraic K-theory. We also construct an E ∞ -operad starting from any strongly self-absorbing C ∗-algebra . Then we show that there is a functorial topological K-theory symmetric spectrum construction on the category of separable C ∗-algebras, such that is an algebra over this operad; moreover, is a module over this algebra. Along the way we obtain a new symmetric spectra valued functorial model for the (connective) topological K-theory of C ∗-algebras. We also show that -stable C ∗-algebras are K-regular providing evidence for a conjecture of Rosenberg. We conclude with an explicit description of the algebraic K-theory of a x+ b-semigroup C ∗-algebras coming from number theory and that of -stabilized noncommutative tori.

Fast and accurate computation of system matrix for area integral model-based algebraic reconstruction technique

NASA Astrophysics Data System (ADS)

Zhang, Shunli; Zhang, Dinghua; Gong, Hao; Ghasemalizadeh, Omid; Wang, Ge; Cao, Guohua

2014-11-01

Iterative algorithms, such as the algebraic reconstruction technique (ART), are popular for image reconstruction. For iterative reconstruction, the area integral model (AIM) is more accurate for better reconstruction quality than the line integral model (LIM). However, the computation of the system matrix for AIM is more complex and time-consuming than that for LIM. Here, we propose a fast and accurate method to compute the system matrix for AIM. First, we calculate the intersection of each boundary line of a narrow fan-beam with pixels in a recursive and efficient manner. Then, by grouping the beam-pixel intersection area into six types according to the slopes of the two boundary lines, we analytically compute the intersection area of the narrow fan-beam with the pixels in a simple algebraic fashion. Overall, experimental results show that our method is about three times faster than the Siddon algorithm and about two times faster than the distance-driven model (DDM) in computation of the system matrix. The reconstruction speed of our AIM-based ART is also faster than the LIM-based ART that uses the Siddon algorithm and DDM-based ART, for one iteration. The fast reconstruction speed of our method was accomplished without compromising the image quality.

DEGAS: Dynamic Exascale Global Address Space Programming Environments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Demmel, James

The Dynamic, Exascale Global Address Space programming environment (DEGAS) project will develop the next generation of programming models and runtime systems to meet the challenges of Exascale computing. The Berkeley part of the project concentrated on communication-optimal code generation to optimize speed and energy efficiency by reducing data movement. Our work developed communication lower bounds, and/or communication avoiding algorithms (that either meet the lower bound, or do much less communication than their conventional counterparts) for a variety of algorithms, including linear algebra, machine learning and genomics. The Berkeley part of the project concentrated on communication-optimal code generation to optimize speedmore » and energy efficiency by reducing data movement. Our work developed communication lower bounds, and/or communication avoiding algorithms (that either meet the lower bound, or do much less communication than their conventional counterparts) for a variety of algorithms, including linear algebra, machine learning and genomics.« less

Blur kernel estimation with algebraic tomography technique and intensity profiles of object boundaries

NASA Astrophysics Data System (ADS)

Ingacheva, Anastasia; Chukalina, Marina; Khanipov, Timur; Nikolaev, Dmitry

2018-04-01

Motion blur caused by camera vibration is a common source of degradation in photographs. In this paper we study the problem of finding the point spread function (PSF) of a blurred image using the tomography technique. The PSF reconstruction result strongly depends on the particular tomography technique used. We present a tomography algorithm with regularization adapted specifically for this task. We use the algebraic reconstruction technique (ART algorithm) as the starting algorithm and introduce regularization. We use the conjugate gradient method for numerical implementation of the proposed approach. The algorithm is tested using a dataset which contains 9 kernels extracted from real photographs by the Adobe corporation where the point spread function is known. We also investigate influence of noise on the quality of image reconstruction and investigate how the number of projections influence the magnitude change of the reconstruction error.

Fast template matching with polynomials.

PubMed

Omachi, Shinichiro; Omachi, Masako

2007-08-01

Template matching is widely used for many applications in image and signal processing. This paper proposes a novel template matching algorithm, called algebraic template matching. Given a template and an input image, algebraic template matching efficiently calculates similarities between the template and the partial images of the input image, for various widths and heights. The partial image most similar to the template image is detected from the input image for any location, width, and height. In the proposed algorithm, a polynomial that approximates the template image is used to match the input image instead of the template image. The proposed algorithm is effective especially when the width and height of the template image differ from the partial image to be matched. An algorithm using the Legendre polynomial is proposed for efficient approximation of the template image. This algorithm not only reduces computational costs, but also improves the quality of the approximated image. It is shown theoretically and experimentally that the computational cost of the proposed algorithm is much smaller than the existing methods.

Generalized Clifford Algebras as Algebras in Suitable Symmetric Linear Gr-Categories

NASA Astrophysics Data System (ADS)

Cheng, Tao; Huang, Hua-Lin; Yang, Yuping

2016-01-01

By viewing Clifford algebras as algebras in some suitable symmetric Gr-categories, Albuquerque and Majid were able to give a new derivation of some well known results about Clifford algebras and to generalize them. Along the same line, Bulacu observed that Clifford algebras are weak Hopf algebras in the aforementioned categories and obtained other interesting properties. The aim of this paper is to study generalized Clifford algebras in a similar manner and extend the results of Albuquerque, Majid and Bulacu to the generalized setting. In particular, by taking full advantage of the gauge transformations in symmetric linear Gr-categories, we derive the decomposition theorem and provide categorical weak Hopf structures for generalized Clifford algebras in a conceptual and simpler manner.

Dynamical systems defined on infinite dimensional lie algebras of the ''current algebra'' or ''Kac-Moody'' type

NASA Astrophysics Data System (ADS)

Hermann, Robert

1982-07-01

Recent work by Morrison, Marsden, and Weinstein has drawn attention to the possibility of utilizing the cosymplectic structure of the dual of the Lie algebra of certain infinite dimensional Lie groups to study hydrodynamical and plasma systems. This paper treats certain models arising in elementary particle physics, considered by Lee, Weinberg, and Zumino; Sugawara; Bardacki, Halpern, and Frishman; Hermann; and Dolan. The lie algebras involved are associated with the ''current algebras'' of Gell-Mann. This class of Lie algebras contains certain of the algebras that are called ''Kac-Moody algebras'' in the recent mathematics and mathematical physics literature.

Trees, bialgebras and intrinsic numerical algorithms

NASA Technical Reports Server (NTRS)

Crouch, Peter; Grossman, Robert; Larson, Richard

1990-01-01

Preliminary work about intrinsic numerical integrators evolving on groups is described. Fix a finite dimensional Lie group G; let g denote its Lie algebra, and let Y(sub 1),...,Y(sub N) denote a basis of g. A class of numerical algorithms is presented that approximate solutions to differential equations evolving on G of the form: dot-x(t) = F(x(t)), x(0) = p is an element of G. The algorithms depend upon constants c(sub i) and c(sub ij), for i = 1,...,k and j is less than i. The algorithms have the property that if the algorithm starts on the group, then it remains on the group. In addition, they also have the property that if G is the abelian group R(N), then the algorithm becomes the classical Runge-Kutta algorithm. The Cayley algebra generated by labeled, ordered trees is used to generate the equations that the coefficients c(sub i) and c(sub ij) must satisfy in order for the algorithm to yield an rth order numerical integrator and to analyze the resulting algorithms.

Iterative algorithms for tridiagonal matrices on a WSI-multiprocessor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gajski, D.D.; Sameh, A.H.; Wisniewski, J.A.

1982-01-01

With the rapid advances in semiconductor technology, the construction of Wafer Scale Integration (WSI)-multiprocessors consisting of a large number of processors is now feasible. We illustrate the implementation of some basic linear algebra algorithms on such multiprocessors.

Performance improvements in temperature reconstructions of 2-D tunable diode laser absorption spectroscopy (TDLAS)

NASA Astrophysics Data System (ADS)

Choi, Doo-Won; Jeon, Min-Gyu; Cho, Gyeong-Rae; Kamimoto, Takahiro; Deguchi, Yoshihiro; Doh, Deog-Hee

2016-02-01

Performance improvement was attained in data reconstructions of 2-dimensional tunable diode laser absorption spectroscopy (TDLAS). Multiplicative Algebraic Reconstruction Technique (MART) algorithm was adopted for data reconstruction. The data obtained in an experiment for the measurement of temperature and concentration fields of gas flows were used. The measurement theory is based upon the Beer-Lambert law, and the measurement system consists of a tunable laser, collimators, detectors, and an analyzer. Methane was used as a fuel for combustion with air in the Bunsen-type burner. The data used for the reconstruction are from the optical signals of 8-laser beams passed on a cross-section of the methane flame. The performances of MART algorithm in data reconstruction were validated and compared with those obtained by Algebraic Reconstruction Technique (ART) algorithm.

Radiometrically accurate scene-based nonuniformity correction for array sensors.

PubMed

Ratliff, Bradley M; Hayat, Majeed M; Tyo, J Scott

2003-10-01

A novel radiometrically accurate scene-based nonuniformity correction (NUC) algorithm is described. The technique combines absolute calibration with a recently reported algebraic scene-based NUC algorithm. The technique is based on the following principle: First, detectors that are along the perimeter of the focal-plane array are absolutely calibrated; then the calibration is transported to the remaining uncalibrated interior detectors through the application of the algebraic scene-based algorithm, which utilizes pairs of image frames exhibiting arbitrary global motion. The key advantage of this technique is that it can obtain radiometric accuracy during NUC without disrupting camera operation. Accurate estimates of the bias nonuniformity can be achieved with relatively few frames, which can be fewer than ten frame pairs. Advantages of this technique are discussed, and a thorough performance analysis is presented with use of simulated and real infrared imagery.

Block iterative restoration of astronomical images with the massively parallel processor

NASA Technical Reports Server (NTRS)

Heap, Sara R.; Lindler, Don J.

1987-01-01

A method is described for algebraic image restoration capable of treating astronomical images. For a typical 500 x 500 image, direct algebraic restoration would require the solution of a 250,000 x 250,000 linear system. The block iterative approach is used to reduce the problem to solving 4900 121 x 121 linear systems. The algorithm was implemented on the Goddard Massively Parallel Processor, which can solve a 121 x 121 system in approximately 0.06 seconds. Examples are shown of the results for various astronomical images.

A study of digital holographic filters generation. Phase 2: Digital data communication system, volume 1

NASA Technical Reports Server (NTRS)

Ingels, F. M.; Mo, C. D.

1978-01-01

An empirical study of the performance of the Viterbi decoders in bursty channels was carried out and an improved algebraic decoder for nonsystematic codes was developed. The hybrid algorithm was simulated for the (2,1), k = 7 code on a computer using 20 channels having various error statistics, ranging from pure random error to pure bursty channels. The hybrid system outperformed both the algebraic and the Viterbi decoders in every case, except the 1% random error channel where the Viterbi decoder had one bit less decoding error.

Multidimensional Hermite-Gaussian quadrature formulae and their application to nonlinear estimation

NASA Technical Reports Server (NTRS)

Mcreynolds, S. R.

1975-01-01

A simplified technique is proposed for calculating multidimensional Hermite-Gaussian quadratures that involves taking the square root of a matrix by the Cholesky algorithm rather than computation of the eigenvectors of the matrix. Ways of reducing the dimension, number, and order of the quadratures are set forth. If the function f(x) under the integral sign is not well approximated by a low-order algebraic expression, the order of the quadrature may be reduced by factoring f(x) into an expression that is nearly algebraic and one that is Gaussian.

The general symmetry algebra structure of the underdetermined equation ux=(vxx)2

NASA Astrophysics Data System (ADS)

Kersten, Paul H. M.

1991-08-01

In a recent paper, Anderson, Kamran, and Olver [``Interior, exterior, and generalized symmetries,'' preprint (1990)] obtained the first- and second-order generalized symmetry algebra for the system ux=(vxx)2, leading to the noncompact real form of the exceptional Lie algebra G2. Here, the structure of the general higher-order symmetry algebra is obtained. Moreover, the Lie algebra G2 is obtained as ordinary symmetry algebra of the associated first-order system. The general symmetry algebra for ux=f(u,v,vx,...,) is established also.

A calculus based on a q-deformed Heisenberg algebra

DOE PAGES

Cerchiai, B. L.; Hinterding, R.; Madore, J.; ...

1999-04-27

We show how one can construct a differential calculus over an algebra where position variables $x$ and momentum variables p have be defined. As the simplest example we consider the one-dimensional q-deformed Heisenberg algebra. This algebra has a subalgebra generated by cursive Greek chi and its inverse which we call the coordinate algebra. A physical field is considered to be an element of the completion of this algebra. We can construct a derivative which leaves invariant the coordinate algebra and so takes physical fields into physical fields. A generalized Leibniz rule for this algebra can be found. Based on thismore » derivative differential forms and an exterior differential calculus can be constructed.« less

An Algorithm for Interactive Modeling of Space-Transportation Engine Simulations: A Constraint Satisfaction Approach

NASA Technical Reports Server (NTRS)

Mitra, Debasis; Thomas, Ajai; Hemminger, Joseph; Sakowski, Barbara

2001-01-01

In this research we have developed an algorithm for the purpose of constraint processing by utilizing relational algebraic operators. Van Beek and others have investigated in the past this type of constraint processing from within a relational algebraic framework, producing some unique results. Apart from providing new theoretical angles, this approach also gives the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the Constraint-satisfaction problem (CSP) area could be also plugged easily within this algorithm for further enhancements of efficiency. The algorithm as developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The research addresses the algorithm and many aspects of the problem IMBSES that we are currently handling.

Extensions of algebraic image operators: An approach to model-based vision

NASA Technical Reports Server (NTRS)

Lerner, Bao-Ting; Morelli, Michael V.

1990-01-01

Researchers extend their previous research on a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, researchers devised an innovative, efficient edge detection scheme. An accurate method for deriving gradient component information from this edge detector is presented. Based upon this new edge detection system researchers developed a robust method for linear feature extraction by combining the techniques of a Hough transform and a line follower. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The algebraic operators are global operations which are easily reconfigured to operate on any size or shape region. This provides a natural platform from which to pursue dynamic scene analysis. A method for optimizing the linear feature extractor which capitalizes on the spatially reconfiguration nature of the edge detector/gradient component operator is discussed.

Highest-weight representations of Brocherd`s algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Slansky, R.

1997-01-01

General features of highest-weight representations of Borcherd`s algebras are described. to show their typical features, several representations of Borcherd`s extensions of finite-dimensional algebras are analyzed. Then the example of the extension of affine- su(2) to a Borcherd`s algebra is examined. These algebras provide a natural way to extend a Kac-Moody algebra to include the hamiltonian and number-changing operators in a generalized symmetry structure.

Identities of Finitely Generated Algebras Over AN Infinite Field

NASA Astrophysics Data System (ADS)

Kemer, A. R.

1991-02-01

It is proved that for each finitely generated associative PI-algebra U over an infinite field F, there is a finite-dimensional F-algebra C such that the ideals of identities of the algebras U and C coincide. This yields a positive solution to the local problem of Specht for algebras over an infinite field: A finitely generated free associative algebra satisfies the maximum condition for T-ideals.

Quantum cluster algebras and quantum nilpotent algebras.

PubMed

Goodearl, Kenneth R; Yakimov, Milen T

2014-07-08

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.

Quantum cluster algebras and quantum nilpotent algebras

PubMed Central

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carpenter, J.A.

This report is a sequel to ORNL/CSD-106 in the ongoing supplements to Professor A.S. Householder's KWIC Index for Numerical Algebra. Beginning with the previous supplement, the subject has been restricted to Numerical Linear Algebra, roughly characterized by the American Mathematical Society's classification sections 15 and 65F but with little coverage of infinite matrices, matrices over fields of characteristics other than zero, operator theory, optimization and those parts of matrix theory primarily combinatorial in nature. Some consideration is given to the uses of graph theory in Numerical Linear Algebra, particularly with respect to algorithms for sparse matrix computations. The period coveredmore » by this report is roughly the calendar year 1982 as measured by the appearance of the articles in the American Mathematical Society's Contents of Mathematical Publications lagging actual appearance dates by up to nearly half a year. The review citations are limited to the Mathematical Reviews (MR).« less

SEGMENTATION OF MITOCHONDRIA IN ELECTRON MICROSCOPY IMAGES USING ALGEBRAIC CURVES.

PubMed

Seyedhosseini, Mojtaba; Ellisman, Mark H; Tasdizen, Tolga

2013-01-01

High-resolution microscopy techniques have been used to generate large volumes of data with enough details for understanding the complex structure of the nervous system. However, automatic techniques are required to segment cells and intracellular structures in these multi-terabyte datasets and make anatomical analysis possible on a large scale. We propose a fully automated method that exploits both shape information and regional statistics to segment irregularly shaped intracellular structures such as mitochondria in electron microscopy (EM) images. The main idea is to use algebraic curves to extract shape features together with texture features from image patches. Then, these powerful features are used to learn a random forest classifier, which can predict mitochondria locations precisely. Finally, the algebraic curves together with regional information are used to segment the mitochondria at the predicted locations. We demonstrate that our method outperforms the state-of-the-art algorithms in segmentation of mitochondria in EM images.

Polynomial algebra of discrete models in systems biology.

PubMed

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

Geometric descriptions of entangled states by auxiliary varieties

NASA Astrophysics Data System (ADS)

Holweck, Frédéric; Luque, Jean-Gabriel; Thibon, Jean-Yves

2012-10-01

The aim of the paper is to propose geometric descriptions of multipartite entangled states using algebraic geometry. In the context of this paper, geometric means each stratum of the Hilbert space, corresponding to an entangled state, is an open subset of an algebraic variety built by classical geometric constructions (tangent lines, secant lines) from the set of separable states. In this setting, we describe well-known classifications of multipartite entanglement such as 2 × 2 × (n + 1), for n ⩾ 1, quantum systems and a new description with the 2 × 3 × 3 quantum system. Our results complete the approach of Miyake and make stronger connections with recent work of algebraic geometers. Moreover, for the quantum systems detailed in this paper, we propose an algorithm, based on the classical theory of invariants, to decide to which subvariety of the Hilbert space a given state belongs.

The Feigin Tetrahedron

NASA Astrophysics Data System (ADS)

Rupel, Dylan

2015-03-01

The first goal of this note is to extend the well-known Feigin homomorphisms taking quantum groups to quantum polynomial algebras. More precisely, we define generalized Feigin homomorphisms from a quantum shuffle algebra to quantum polynomial algebras which extend the classical Feigin homomorphisms along the embedding of the quantum group into said quantum shuffle algebra. In a recent work of Berenstein and the author, analogous extensions of Feigin homomorphisms from the dual Hall-Ringel algebra of a valued quiver to quantum polynomial algebras were defined. To relate these constructions, we establish a homomorphism, dubbed the quantum shuffle character, from the dual Hall-Ringel algebra to the quantum shuffle algebra which relates the generalized Feigin homomorphisms. These constructions can be compactly described by a commuting tetrahedron of maps beginning with the quantum group and terminating in a quantum polynomial algebra. The second goal in this project is to better understand the dual canonical basis conjecture for skew-symmetrizable quantum cluster algebras. In the symmetrizable types it is known that dual canonical basis elements need not have positive multiplicative structure constants, while this is still suspected to hold for skew-symmetrizable quantum cluster algebras. We propose an alternate conjecture for the symmetrizable types: the cluster monomials should correspond to irreducible characters of a KLR algebra. Indeed, the main conjecture of this note would establish this ''KLR conjecture'' for acyclic skew-symmetrizable quantum cluster algebras: that is, we conjecture that the images of rigid representations under the quantum shuffle character give irreducible characters for KLR algebras. We sketch a proof in the symmetric case giving an alternative to the proof of Kimura-Qin that all non-initial cluster variables in an acyclic skew-symmetric quantum cluster algebra are contained in the dual canonical basis. With these results in mind we interpret the cluster mutations directly in terms of the representation theory of the KLR algebra.

Form in Algebra: Reflecting, with Peacock, on Upper Secondary School Teaching.

ERIC Educational Resources Information Center

Menghini, Marta

1994-01-01

Discusses algebra teaching by looking back into the history of algebra and the work of George Peacock, who considered algebra from two points of view: symbolic and instrumental. Claims that, to be meaningful, algebra must be linked to real-world problems. (18 references) (MKR)

TDIGG - TWO-DIMENSIONAL, INTERACTIVE GRID GENERATION CODE

NASA Technical Reports Server (NTRS)

Vu, B. T.

1994-01-01

TDIGG is a fast and versatile program for generating two-dimensional computational grids for use with finite-difference flow-solvers. Both algebraic and elliptic grid generation systems are included. The method for grid generation by algebraic transformation is based on an interpolation algorithm and the elliptic grid generation is established by solving the partial differential equation (PDE). Non-uniform grid distributions are carried out using a hyperbolic tangent stretching function. For algebraic grid systems, interpolations in one direction (univariate) and two directions (bivariate) are considered. These interpolations are associated with linear or cubic Lagrangian/Hermite/Bezier polynomial functions. The algebraic grids can subsequently be smoothed using an elliptic solver. For elliptic grid systems, the PDE can be in the form of Laplace (zero forcing function) or Poisson. The forcing functions in the Poisson equation come from the boundary or the entire domain of the initial algebraic grids. A graphics interface procedure using the Silicon Graphics (GL) Library is included to allow users to visualize the grid variations at each iteration. This will allow users to interactively modify the grid to match their applications. TDIGG is written in FORTRAN 77 for Silicon Graphics IRIS series computers running IRIX. This package requires either MIT's X Window System, Version 11 Revision 4 or SGI (Motif) Window System. A sample executable is provided on the distribution medium. It requires 148K of RAM for execution. The standard distribution medium is a .25 inch streaming magnetic IRIX tape cartridge in UNIX tar format. This program was developed in 1992.

Abstract Algebra for Algebra Teaching: Influencing School Mathematics Instruction

ERIC Educational Resources Information Center

Wasserman, Nicholas H.

2016-01-01

This article explores the potential for aspects of abstract algebra to be influential for the teaching of school algebra (and early algebra). Using national standards for analysis, four primary areas common in school mathematics--and their progression across elementary, middle, and secondary mathematics--where teaching may be transformed by…

Constructing Meanings and Utilities within Algebraic Tasks

ERIC Educational Resources Information Center

Ainley, Janet; Bills, Liz; Wilson, Kirsty

2004-01-01

The Purposeful Algebraic Activity project aims to explore the potential of spreadsheets in the introduction to algebra and algebraic thinking. We discuss two sub-themes within the project: tracing the development of pupils' construction of meaning for variable from arithmetic-based activity, through use of spreadsheets, and into formal algebra,…

Equivariant Gromov-Witten Invariants of Algebraic GKM Manifolds

NASA Astrophysics Data System (ADS)

Liu, Chiu-Chu Melissa; Sheshmani, Artan

2017-07-01

An algebraic GKM manifold is a non-singular algebraic variety equipped with an algebraic action of an algebraic torus, with only finitely many torus fixed points and finitely many 1-dimensional orbits. In this expository article, we use virtual localization to express equivariant Gromov-Witten invariants of any algebraic GKM manifold (which is not necessarily compact) in terms of Hodge integrals over moduli stacks of stable curves and the GKM graph of the GKM manifold.

Asymptotic aspect of derivations in Banach algebras.

PubMed

Roh, Jaiok; Chang, Ick-Soon

2017-01-01

We prove that every approximate linear left derivation on a semisimple Banach algebra is continuous. Also, we consider linear derivations on Banach algebras and we first study the conditions for a linear derivation on a Banach algebra. Then we examine the functional inequalities related to a linear derivation and their stability. We finally take central linear derivations with radical ranges on semiprime Banach algebras and a continuous linear generalized left derivation on a semisimple Banach algebra.

Lie algebra of conformal Killing-Yano forms

NASA Astrophysics Data System (ADS)

Ertem, Ümit

2016-06-01

We provide a generalization of the Lie algebra of conformal Killing vector fields to conformal Killing-Yano forms. A new Lie bracket for conformal Killing-Yano forms that corresponds to slightly modified Schouten-Nijenhuis bracket of differential forms is proposed. We show that conformal Killing-Yano forms satisfy a graded Lie algebra in constant curvature manifolds. It is also proven that normal conformal Killing-Yano forms in Einstein manifolds also satisfy a graded Lie algebra. The constructed graded Lie algebras reduce to the graded Lie algebra of Killing-Yano forms and the Lie algebras of conformal Killing and Killing vector fields in special cases.

Generalized Galilean algebras and Newtonian gravity

NASA Astrophysics Data System (ADS)

González, N.; Rubio, G.; Salgado, P.; Salgado, S.

2016-04-01

The non-relativistic versions of the generalized Poincaré algebras and generalized AdS-Lorentz algebras are obtained. These non-relativistic algebras are called, generalized Galilean algebras of type I and type II and denoted by GBn and GLn respectively. Using a generalized Inönü-Wigner contraction procedure we find that the generalized Galilean algebras of type I can be obtained from the generalized Galilean algebras type II. The S-expansion procedure allows us to find the GB5 algebra from the Newton Hooke algebra with central extension. The procedure developed in Ref. [1] allows us to show that the nonrelativistic limit of the five dimensional Einstein-Chern-Simons gravity is given by a modified version of the Poisson equation. The modification could be compatible with the effects of Dark Matter, which leads us to think that Dark Matter can be interpreted as a non-relativistic limit of Dark Energy.

On the structure of quantum L∞ algebras

NASA Astrophysics Data System (ADS)

Blumenhagen, Ralph; Fuchs, Michael; Traube, Matthias

2017-10-01

It is believed that any classical gauge symmetry gives rise to an L∞ algebra. Based on the recently realized relation between classical W algebras and L∞ algebras, we analyze how this generalizes to the quantum case. Guided by the existence of quantum W algebras, we provide a physically well motivated definition of quantum L∞ algebras describing the consistency of global symmetries in quantum field theories. In this case we are restricted to only two non-trivial graded vector spaces X 0 and X -1 containing the symmetry variations and the symmetry generators. This quantum L∞ algebra structure is explicitly exemplified for the quantum W_3 algebra. The natural quantum product between fields is the normal ordered one so that, due to contractions between quantum fields, the higher L∞ relations receive off-diagonal quantum corrections. Curiously, these are not present in the loop L∞ algebra of closed string field theory.

Efficient computer algebra algorithms for polynomial matrices in control design

NASA Technical Reports Server (NTRS)

Baras, J. S.; Macenany, D. C.; Munach, R.

1989-01-01

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

On special Lie algebras having a faithful module with Krull dimension

NASA Astrophysics Data System (ADS)

Pikhtilkova, O. A.; Pikhtilkov, S. A.

2017-02-01

For special Lie algebras we prove an analogue of Markov's theorem on {PI}-algebras having a faithful module with Krull dimension: the solubility of the prime radical. We give an example of a semiprime Lie algebra that has a faithful module with Krull dimension but cannot be represented as a subdirect product of finitely many prime Lie algebras. We prove a criterion for a semiprime Lie algebra to be representable as such a subdirect product.

Algebra for Everyone.

ERIC Educational Resources Information Center

Edwards, Edgar L., Jr., Ed.

The fundamentals of algebra and algebraic thinking should be a part of the background of all citizens in society. The vast increase in the use of technology requires that school mathematics ensure the teaching of algebraic thinking as well as its use at both the elementary and secondary school levels. Algebra is a universal theme that runs through…

Chinese Algebra: Using Historical Problems to Think about Current Curricula

ERIC Educational Resources Information Center

Tillema, Erik

2005-01-01

The Chinese used the idea of generating equivalent expressions for solving problems where the problems from a historical Chinese text are studied to understand the ways in which the ideas can lead into algebraic calculations and help students to learn algebra. The texts unify algebraic problem solving through complex algebraic thought and afford…

Conceptualizing Routines of Practice That Support Algebraic Reasoning in Elementary Schools: A Constructivist Grounded Theory

ERIC Educational Resources Information Center

Store, Jessie Chitsanzo

2012-01-01

There is ample literature documenting that, for many decades, high school students view algebra as difficult and do not demonstrate understanding of algebraic concepts. Algebraic reasoning in elementary school aims at meaningfully introducing algebra to elementary school students in preparation for higher-level mathematics. While there is research…

Derive Workshop Matrix Algebra and Linear Algebra.

ERIC Educational Resources Information Center

Townsley Kulich, Lisa; Victor, Barbara

This document presents the course content for a workshop that integrates the use of the computer algebra system Derive with topics in matrix and linear algebra. The first section is a guide to using Derive that provides information on how to write algebraic expressions, make graphs, save files, edit, define functions, differentiate expressions,…

Prospective Teachers' Views on the Use of Calculators with Computer Algebra System in Algebra Instruction

ERIC Educational Resources Information Center

Ozgun-Koca, S. Ash

2010-01-01

Although growing numbers of secondary school mathematics teachers and students use calculators to study graphs, they mainly rely on paper-and-pencil when manipulating algebraic symbols. However, the Computer Algebra Systems (CAS) on computers or handheld calculators create new possibilities for teaching and learning algebraic manipulation. This…

A Richer Understanding of Algebra

ERIC Educational Resources Information Center

Foy, Michelle

2008-01-01

Algebra is one of those hard-to-teach topics where pupils seem to struggle to see it as more than a set of rules to learn, but this author recently used the software "Grid Algebra" from ATM, which engaged her Year 7 pupils in exploring algebraic concepts for themselves. "Grid Algebra" allows pupils to experience number,…

A set for relational reasoning: Facilitation of algebraic modeling by a fraction task.

PubMed

DeWolf, Melissa; Bassok, Miriam; Holyoak, Keith J

2016-12-01

Recent work has identified correlations between early mastery of fractions and later math achievement, especially in algebra. However, causal connections between aspects of reasoning with fractions and improved algebra performance have yet to be established. The current study investigated whether relational reasoning with fractions facilitates subsequent algebraic reasoning using both pre-algebra students and adult college students. Participants were first given either a relational reasoning fractions task or a fraction algebra procedures control task. Then, all participants solved word problems and constructed algebraic equations in either multiplication or division format. The word problems and the equation construction tasks involved simple multiplicative comparison statements such as "There are 4 times as many students as teachers in a classroom." Performance on the algebraic equation construction task was enhanced for participants who had previously completed the relational fractions task compared with those who completed the fraction algebra procedures task. This finding suggests that relational reasoning with fractions can establish a relational set that promotes students' tendency to model relations using algebraic expressions. Copyright © 2016 Elsevier Inc. All rights reserved.

Topics in elementary particle physics

NASA Astrophysics Data System (ADS)

Jin, Xiang

The author of this thesis discusses two topics in elementary particle physics: n-ary algebras and their applications to M-theory (Part I), and functional evolution and Renormalization Group flows (Part II). In part I, Lie algebra is extended to four different n-ary algebraic structure: generalized Lie algebra, Filippov algebra, Nambu algebra and Nambu-Poisson tensor; though there are still many other n-ary algebras. A natural property of Generalized Lie algebras — the Bremner identity, is studied, and proved with a totally different method from its original version. We extend Bremner identity to n-bracket cases, where n is an arbitrary odd integer. Filippov algebras do not focus on associativity, and are defined by the Fundamental identity. We add associativity to Filippov algebras, and give examples of how to construct Filippov algebras from su(2), bosonic oscillator, Virasoro algebra. We try to include fermionic charges into the ternary Virasoro-Witt algebra, but the attempt fails because fermionic charges keep generating new charges that make the algebra not closed. We also study the Bremner identity restriction on Nambu algebras and Nambu-Poisson tensors. So far, the only example 3-algebra being used in physics is the BLG model with 3-algebra A4, describing two M2-branes interactions. Its extension with Nambu algebra, BLG-NB model, is believed to describe infinite M2-branes condensation. Also, there is another propose for M2-brane interactions, the ABJM model, which is constructed by ordinary Lie algebra. We compare the symmetry properties between them, and discuss the possible approaches to include these three models into a grand unification theory. In Part II, we give an approximate solution for Schroeder's equations, based on series and conjugation methods. We use the logistic map as an example, and demonstrate that this approximate solution converges to known analytical solutions around the fixed point, around which the approximate solution is constructed. Although the closed-form solutions for Schroeder's equations can not always be approached analytically, by fitting the approximation solutions, one can still obtain closed-form solutions sometimes. Based on Schroeder's theory, approximate solutions for trajectories, velocities and potentials can also be constructed. The approximate solution is significantly useful to calculate the beta function in renormalization group trajectory. By "wrapping" the series solutions with the conjugations from different inverse functions, we generate different branches of the trajectory, and construct a counterexample for a folk theorem about limited cycles.

Application of polynomial su(1, 1) algebra to Pöschl-Teller potentials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Hong-Biao, E-mail: zhanghb017@nenu.edu.cn; Lu, Lu

2013-12-15

Two novel polynomial su(1, 1) algebras for the physical systems with the first and second Pöschl-Teller (PT) potentials are constructed, and their specific representations are presented. Meanwhile, these polynomial su(1, 1) algebras are used as an algebraic technique to solve eigenvalues and eigenfunctions of the Hamiltonians associated with the first and second PT potentials. The algebraic approach explores an appropriate new pair of raising and lowing operators K-circumflex{sub ±} of polynomial su(1, 1) algebra as a pair of shift operators of our Hamiltonians. In addition, two usual su(1, 1) algebras associated with the first and second PT potentials are derivedmore » naturally from the polynomial su(1, 1) algebras built by us.« less

A Novel Image Encryption Based on Algebraic S-box and Arnold Transform

NASA Astrophysics Data System (ADS)

Farwa, Shabieh; Muhammad, Nazeer; Shah, Tariq; Ahmad, Sohail

2017-09-01

Recent study shows that substitution box (S-box) only cannot be reliably used in image encryption techniques. We, in this paper, propose a novel and secure image encryption scheme that utilizes the combined effect of an algebraic substitution box along with the scrambling effect of the Arnold transform. The underlying algorithm involves the application of S-box, which is the most imperative source to create confusion and diffusion in the data. The speciality of the proposed algorithm lies, firstly, in the high sensitivity of our S-box to the choice of the initial conditions which makes this S-box stronger than the chaos-based S-boxes as it saves computational labour by deploying a comparatively simple and direct approach based on the algebraic structure of the multiplicative cyclic group of the Galois field. Secondly the proposed method becomes more secure by considering a combination of S-box with certain number of iterations of the Arnold transform. The strength of the S-box is examined in terms of various performance indices such as nonlinearity, strict avalanche criterion, bit independence criterion, linear and differential approximation probabilities etc. We prove through the most significant techniques used for the statistical analyses of the encrypted image that our image encryption algorithm satisfies all the necessary criteria to be usefully and reliably implemented in image encryption applications.

An algebraic algorithm for nonuniformity correction in focal-plane arrays.

PubMed

Ratliff, Bradley M; Hayat, Majeed M; Hardie, Russell C

2002-09-01

A scene-based algorithm is developed to compensate for bias nonuniformity in focal-plane arrays. Nonuniformity can be extremely problematic, especially for mid- to far-infrared imaging systems. The technique is based on use of estimates of interframe subpixel shifts in an image sequence, in conjunction with a linear-interpolation model for the motion, to extract information on the bias nonuniformity algebraically. The performance of the proposed algorithm is analyzed by using real infrared and simulated data. One advantage of this technique is its simplicity; it requires relatively few frames to generate an effective correction matrix, thereby permitting the execution of frequent on-the-fly nonuniformity correction as drift occurs. Additionally, the performance is shown to exhibit considerable robustness with respect to lack of the common types of temporal and spatial irradiance diversity that are typically required by statistical scene-based nonuniformity correction techniques.

Reduction by invariants and projection of linear representations of Lie algebras applied to the construction of nonlinear realizations

NASA Astrophysics Data System (ADS)

Campoamor-Stursberg, R.

2018-03-01

A procedure for the construction of nonlinear realizations of Lie algebras in the context of Vessiot-Guldberg-Lie algebras of first-order systems of ordinary differential equations (ODEs) is proposed. The method is based on the reduction of invariants and projection of lowest-dimensional (irreducible) representations of Lie algebras. Applications to the description of parameterized first-order systems of ODEs related by contraction of Lie algebras are given. In particular, the kinematical Lie algebras in (2 + 1)- and (3 + 1)-dimensions are realized simultaneously as Vessiot-Guldberg-Lie algebras of parameterized nonlinear systems in R3 and R4, respectively.

(Fuzzy) Ideals of BN-Algebras

PubMed Central

Walendziak, Andrzej

2015-01-01

The notions of an ideal and a fuzzy ideal in BN-algebras are introduced. The properties and characterizations of them are investigated. The concepts of normal ideals and normal congruences of a BN-algebra are also studied, the properties of them are displayed, and a one-to-one correspondence between them is presented. Conditions for a fuzzy set to be a fuzzy ideal are given. The relationships between ideals and fuzzy ideals of a BN-algebra are established. The homomorphic properties of fuzzy ideals of a BN-algebra are provided. Finally, characterizations of Noetherian BN-algebras and Artinian BN-algebras via fuzzy ideals are obtained. PMID:26125050

The algebra of supertraces for 2+1 super de Sitter gravity

NASA Technical Reports Server (NTRS)

Urrutia, L. F.; Waelbroeck, H.; Zertuche, F.

1993-01-01

The algebra of the observables for 2+1 super de Sitter gravity, for one genus of the spatial surface is calculated. The algebra turns out to be an infinite Lie algebra subject to non-linear constraints. The constraints are solved explicitly in terms of five independent complex supertraces. These variables are the true degrees of freedom of the system and their quantized algebra generates a new structure which is referred to as a 'central extension' of the quantum algebra SU(2)q.

a Triangular Deformation of the Two-Dimensional POINCARÉ Algebra

NASA Astrophysics Data System (ADS)

Khorrami, M.; Shariati, A.; Abolhassani, M. R.; Aghamohammadi, A.

Contracting the h-deformation of SL(2, ℝ), we construct a new deformation of two-dimensional Poincaré's algebra, the algebra of functions on its group and its differential structure. It is seen that these dual Hopf algebras are isomorphic to each other. It is also shown that the Hopf algebra is triangular, and its universal R-matrix is also constructed explicitly. We then find a deformation map for the universal enveloping algebra, and at the end, give the deformed mass shells and Lorentz transformation.

Linear Algebra and Sequential Importance Sampling for Network Reliability

DTIC Science & Technology

2011-12-01

first test case is an Erdős- Renyi graph with 100 vertices and 150 edges. Figure 1 depicts the relative variance of the three Algorithms: Algorithm TOP...e va ria nc e Figure 1: Relative variance of various algorithms on Erdős Renyi graph, 100 vertices 250 edges. Key: Solid = TOP-DOWN algorithm

An Arithmetic-Algebraic Work Space for the Promotion of Arithmetic and Algebraic Thinking: Triangular Numbers

ERIC Educational Resources Information Center

Hitt, Fernando; Saboya, Mireille; Cortés Zavala, Carlos

2016-01-01

This paper presents an experiment that attempts to mobilise an arithmetic-algebraic way of thinking in order to articulate between arithmetic thinking and the early algebraic thinking, which is considered a prelude to algebraic thinking. In the process of building this latter way of thinking, researchers analysed pupils' spontaneous production…

Spontaneous Meta-Arithmetic as a First Step toward School Algebra

ERIC Educational Resources Information Center

Caspi, Shai; Sfard, Anna

2012-01-01

Taking as the point of departure the vision of school algebra as a formalized meta-discourse of arithmetic, we have been following five pairs of 7th grade students as they progress in algebraic discourse during 24 months, from their informal algebraic talk to the formal algebraic discourse, as taught in school. Our analysis follows changes that…

Mapping chemicals in air using an environmental CAT scanning system: evaluation of algorithms

NASA Astrophysics Data System (ADS)

Samanta, A.; Todd, L. A.

A new technique is being developed which creates near real-time maps of chemical concentrations in air for environmental and occupational environmental applications. This technique, we call Environmental CAT Scanning, combines the real-time measuring technique of open-path Fourier transform infrared spectroscopy with the mapping capabilitites of computed tomography to produce two-dimensional concentration maps. With this system, a network of open-path measurements is obtained over an area; measurements are then processed using a tomographic algorithm to reconstruct the concentrations. This research focussed on the process of evaluating and selecting appropriate reconstruction algorithms, for use in the field, by using test concentration data from both computer simultation and laboratory chamber studies. Four algorithms were tested using three types of data: (1) experimental open-path data from studies that used a prototype opne-path Fourier transform/computed tomography system in an exposure chamber; (2) synthetic open-path data generated from maps created by kriging point samples taken in the chamber studies (in 1), and; (3) synthetic open-path data generated using a chemical dispersion model to create time seires maps. The iterative algorithms used to reconstruct the concentration data were: Algebraic Reconstruction Technique without Weights (ART1), Algebraic Reconstruction Technique with Weights (ARTW), Maximum Likelihood with Expectation Maximization (MLEM) and Multiplicative Algebraic Reconstruction Technique (MART). Maps were evaluated quantitatively and qualitatively. In general, MART and MLEM performed best, followed by ARTW and ART1. However, algorithm performance varied under different contaminant scenarios. This study showed the importance of using a variety of maps, particulary those generated using dispersion models. The time series maps provided a more rigorous test of the algorithms and allowed distinctions to be made among the algorithms. A comprehensive evaluation of algorithms, for the environmental application of tomography, requires the use of a battery of test concentration data before field implementation, which models reality and tests the limits of the algorithms.

Gender differences in algebraic thinking ability to solve mathematics problems

NASA Astrophysics Data System (ADS)

Kusumaningsih, W.; Darhim; Herman, T.; Turmudi

2018-05-01

This study aimed to conduct a gender study on students' algebraic thinking ability in solving a mathematics problem, polyhedron concept, for grade VIII. This research used a qualitative method. The data was collected using: test and interview methods. The subjects in this study were eight male and female students with different level of abilities. It was found that the algebraic thinking skills of male students reached high group of five categories. They were superior in terms of reasoning and quick understanding in solving problems. Algebraic thinking ability of high-achieving group of female students also met five categories of algebraic thinking indicators. They were more diligent, tenacious and thorough in solving problems. Algebraic thinking ability of male students in medium category only satisfied three categories of algebraic thinking indicators. They were sufficient in terms of reasoning and understanding in solving problems. Algebraic thinking ability group of female students in medium group also satisfied three categories of algebraic thinking indicators. They were fairly diligent, tenacious and meticulous on working on the problems.

Particle-like structure of coaxial Lie algebras

NASA Astrophysics Data System (ADS)

Vinogradov, A. M.

2018-01-01

This paper is a natural continuation of Vinogradov [J. Math. Phys. 58, 071703 (2017)] where we proved that any Lie algebra over an algebraically closed field or over R can be assembled in a number of steps from two elementary constituents, called dyons and triadons. Here we consider the problems of the construction and classification of those Lie algebras which can be assembled in one step from base dyons and triadons, called coaxial Lie algebras. The base dyons and triadons are Lie algebra structures that have only one non-trivial structure constant in a given basis, while coaxial Lie algebras are linear combinations of pairwise compatible base dyons and triadons. We describe the maximal families of pairwise compatible base dyons and triadons called clusters, and, as a consequence, we give a complete description of the coaxial Lie algebras. The remarkable fact is that dyons and triadons in clusters are self-organised in structural groups which are surrounded by casings and linked by connectives. We discuss generalisations and applications to the theory of deformations of Lie algebras.

The Growing Importance of Linear Algebra in Undergraduate Mathematics.

ERIC Educational Resources Information Center

Tucker, Alan

1993-01-01

Discusses the theoretical and practical importance of linear algebra. Presents a brief history of linear algebra and matrix theory and describes the place of linear algebra in the undergraduate curriculum. (MDH)

Maximizing algebraic connectivity in air transportation networks

NASA Astrophysics Data System (ADS)

Wei, Peng

In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the weight assignment can not be studied separately for the problem with operating cost constraint. Therefore a relaxed SDP method with golden section search is developed to solve both at the same time. The cluster decomposition is utilized to solve large scale networks.

Introduction to Mathematica® for Physicists

NASA Astrophysics Data System (ADS)

Grozin, Andrey

We were taught at calculus classes that integration is an art, not a science (in contrast to differentiation—even a monkey can be trained to take derivatives). And we were taught wrong. The Risch algorithm (which is known for decades) allows one to find, in a finite number of steps, if a given indefinite integral can be taken in elementary functions, and if so, to calculate it. This algorithm has been constructed in works by an American mathematician Risch near 1970; many cases were not analyzed completely in these works and were later considered by other mathematicians. The algorithm is very complicated, and no computer algebra system implements it fully. Its implementation in Mathematica is rather complete, even with extensions to some classes of special functions, but details are not publicly known. Strictly speaking, it is not quite an algorithm, because it contains algorithmically unsolvable subproblems, such as finding out if a given combination of elementary functions vanishes. But in practice computer algebra systems are quite good in solving such problems. Here we shall consider, at a very elementary level, the main ideas of the Risch algorithm; see [16] for more details.

On a programming language for graph algorithms

NASA Technical Reports Server (NTRS)

Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.

1971-01-01

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Numerical evaluation of mobile robot navigation in static indoor environment via EGAOR Iteration

NASA Astrophysics Data System (ADS)

Dahalan, A. A.; Saudi, A.; Sulaiman, J.; Din, W. R. W.

2017-09-01

One of the key issues in mobile robot navigation is the ability for the robot to move from an arbitrary start location to a specified goal location without colliding with any obstacles while traveling, also known as mobile robot path planning problem. In this paper, however, we examined the performance of a robust searching algorithm that relies on the use of harmonic potentials of the environment to generate smooth and safe path for mobile robot navigation in a static known indoor environment. The harmonic potentials will be discretized by using Laplacian’s operator to form a system of algebraic approximation equations. This algebraic linear system will be computed via 4-Point Explicit Group Accelerated Over-Relaxation (4-EGAOR) iterative method for rapid computation. The performance of the proposed algorithm will then be compared and analyzed against the existing algorithms in terms of number of iterations and execution time. The result shows that the proposed algorithm performed better than the existing methods.

Representing k-graphs as Matrix Algebras

NASA Astrophysics Data System (ADS)

Rosjanuardi, R.

2018-05-01

For any commutative unital ring R and finitely aligned k-graph Λ with |Λ| < ∞ without cycles, we can realise Kumjian-Pask algebra KP R (Λ) as a direct sum of of matrix algebra over some vertices v with properties ν = νΛ, i.e: ⊕ νΛ=ν M |Λv|(R). When there is only a single vertex ν ∈ Λ° such that ν = νΛ, we can realise the Kumjian-Pask algebra as the matrix algebra M |ΛV|(R). Hence the matrix algebra M |vΛ|(R) can be regarded as a representation of the k-graph Λ. In this talk we will figure out the relation between finitely aligned k-graph and matrix algebra.

A description of pseudo-bosons in terms of nilpotent Lie algebras

NASA Astrophysics Data System (ADS)

Bagarello, Fabio; Russo, Francesco G.

2018-02-01

We show how the one-mode pseudo-bosonic ladder operators provide concrete examples of nilpotent Lie algebras of dimension five. It is the first time that an algebraic-geometric structure of this kind is observed in the context of pseudo-bosonic operators. Indeed we do not find the well known Heisenberg algebras, which are involved in several quantum dynamical systems, but different Lie algebras which may be decomposed into the sum of two abelian Lie algebras in a prescribed way. We introduce the notion of semidirect sum (of Lie algebras) for this scope and find that it describes very well the behavior of pseudo-bosonic operators in many quantum models.

Trace of totally positive algebraic integers and integer transfinite diameter

NASA Astrophysics Data System (ADS)

Flammang, V.

2009-06-01

Explicit auxiliary functions can be used in the ``Schur-Siegel- Smyth trace problem''. In the previous works, these functions were constructed only with polynomials having all their roots positive. Here, we use several polynomials with complex roots, which are found with Wu's algorithm, and we improve the known lower bounds for the absolute trace of totally positive algebraic integers. This improvement has a consequence for the search of Salem numbers that have a negative trace. The same method also gives a small improvement of the upper bound for the integer transfinite diameter of [0,1].

Accelerate quasi Monte Carlo method for solving systems of linear algebraic equations through shared memory

NASA Astrophysics Data System (ADS)

Lai, Siyan; Xu, Ying; Shao, Bo; Guo, Menghan; Lin, Xiaola

2017-04-01

In this paper we study on Monte Carlo method for solving systems of linear algebraic equations (SLAE) based on shared memory. Former research demostrated that GPU can effectively speed up the computations of this issue. Our purpose is to optimize Monte Carlo method simulation on GPUmemoryachritecture specifically. Random numbers are organized to storein shared memory, which aims to accelerate the parallel algorithm. Bank conflicts can be avoided by our Collaborative Thread Arrays(CTA)scheme. The results of experiments show that the shared memory based strategy can speed up the computaions over than 3X at most.

Negative base encoding in optical linear algebra processors

NASA Technical Reports Server (NTRS)

Perlee, C.; Casasent, D.

1986-01-01

In the digital multiplication by analog convolution algorithm, the bits of two encoded numbers are convolved to form the product of the two numbers in mixed binary representation; this output can be easily converted to binary. Attention is presently given to negative base encoding, treating base -2 initially, and then showing that the negative base system can be readily extended to any radix. In general, negative base encoding in optical linear algebra processors represents a more efficient technique than either sign magnitude or 2's complement encoding, when the additions of digitally encoded products are performed in parallel.

The hopf algebra of vector fields on complex quantum groups

NASA Astrophysics Data System (ADS)

Drabant, Bernhard; Jurčo, Branislav; Schlieker, Michael; Weich, Wolfgang; Zumino, Bruno

1992-10-01

We derive the equivalence of the complex quantum enveloping algebra and the algebra of complex quantum vector fields for the Lie algebra types A n , B n , C n , and D n by factorizing the vector fields uniquely into a triangular and a unitary part and identifying them with the corresponding elements of the algebra of regular functionals.

Algebra for All: The Effect of Algebra Coursework and Classroom Peer Academic Composition on Low-Achieving Students

ERIC Educational Resources Information Center

Nomi, Takako; Raudenbush, Stephen W.

2014-01-01

Algebra is often considered as a gateway for later achievement. A recent report by the Mathematics Advisory Panel (2008) underscores the importance of improving algebra learning in secondary school. Today, a growing number of states and districts require algebra for all students in ninth grade or earlier. Chicago is at the forefront of this…

Rupture or Continuity: The Arithmetico-Algebraic Thinking as an Alternative in a Modelling Process in a Paper and Pencil and Technology Environment

ERIC Educational Resources Information Center

Hitt, Fernando; Saboya, Mireille; Zavala, Carlos Cortés

2017-01-01

Part of the research community that has followed the Early Algebra paradigm is currently delimiting the differences between arithmetic thinking and algebraic thinking. This trend could prevent new research approaches to the problem of learning algebra, hiding the importance of considering an arithmetico-algebraic thinking, a new approach which…

Derivation in INK-algebras

NASA Astrophysics Data System (ADS)

Kaviyarasu, M.; Indhira, K.

2018-04-01

In 2017 we introduced a new notion of algebra called IKN-algebra. Motivated by some result on derivations (rightleft)-derivation and (leftright)- derivation in ring. In this paper we introduce derivation in INK-Algebras and investigate some important result.

The 6th International Conference on Computer Science and Computational Mathematics (ICCSCM 2017)

NASA Astrophysics Data System (ADS)

2017-09-01

The ICCSCM 2017 (The 6th International Conference on Computer Science and Computational Mathematics) has aimed to provide a platform to discuss computer science and mathematics related issues including Algebraic Geometry, Algebraic Topology, Approximation Theory, Calculus of Variations, Category Theory; Homological Algebra, Coding Theory, Combinatorics, Control Theory, Cryptology, Geometry, Difference and Functional Equations, Discrete Mathematics, Dynamical Systems and Ergodic Theory, Field Theory and Polynomials, Fluid Mechanics and Solid Mechanics, Fourier Analysis, Functional Analysis, Functions of a Complex Variable, Fuzzy Mathematics, Game Theory, General Algebraic Systems, Graph Theory, Group Theory and Generalizations, Image Processing, Signal Processing and Tomography, Information Fusion, Integral Equations, Lattices, Algebraic Structures, Linear and Multilinear Algebra; Matrix Theory, Mathematical Biology and Other Natural Sciences, Mathematical Economics and Financial Mathematics, Mathematical Physics, Measure Theory and Integration, Neutrosophic Mathematics, Number Theory, Numerical Analysis, Operations Research, Optimization, Operator Theory, Ordinary and Partial Differential Equations, Potential Theory, Real Functions, Rings and Algebras, Statistical Mechanics, Structure Of Matter, Topological Groups, Wavelets and Wavelet Transforms, 3G/4G Network Evolutions, Ad-Hoc, Mobile, Wireless Networks and Mobile Computing, Agent Computing & Multi-Agents Systems, All topics related Image/Signal Processing, Any topics related Computer Networks, Any topics related ISO SC-27 and SC- 17 standards, Any topics related PKI(Public Key Intrastructures), Artifial Intelligences(A.I.) & Pattern/Image Recognitions, Authentication/Authorization Issues, Biometric authentication and algorithms, CDMA/GSM Communication Protocols, Combinatorics, Graph Theory, and Analysis of Algorithms, Cryptography and Foundation of Computer Security, Data Base(D.B.) Management & Information Retrievals, Data Mining, Web Image Mining, & Applications, Defining Spectrum Rights and Open Spectrum Solutions, E-Comerce, Ubiquitous, RFID, Applications, Fingerprint/Hand/Biometrics Recognitions and Technologies, Foundations of High-performance Computing, IC-card Security, OTP, and Key Management Issues, IDS/Firewall, Anti-Spam mail, Anti-virus issues, Mobile Computing for E-Commerce, Network Security Applications, Neural Networks and Biomedical Simulations, Quality of Services and Communication Protocols, Quantum Computing, Coding, and Error Controls, Satellite and Optical Communication Systems, Theory of Parallel Processing and Distributed Computing, Virtual Visions, 3-D Object Retrievals, & Virtual Simulations, Wireless Access Security, etc. The success of ICCSCM 2017 is reflected in the received papers from authors around the world from several countries which allows a highly multinational and multicultural idea and experience exchange. The accepted papers of ICCSCM 2017 are published in this Book. Please check http://www.iccscm.com for further news. A conference such as ICCSCM 2017 can only become successful using a team effort, so herewith we want to thank the International Technical Committee and the Reviewers for their efforts in the review process as well as their valuable advices. We are thankful to all those who contributed to the success of ICCSCM 2017. The Secretary

Contractions and deformations of quasiclassical Lie algebras preserving a nondegenerate quadratic Casimir operator

DOE Office of Scientific and Technical Information (OSTI.GOV)

Campoamor-Stursberg, R., E-mail: rutwig@mat.ucm.e

2008-05-15

By means of contractions of Lie algebras, we obtain new classes of indecomposable quasiclassical Lie algebras that satisfy the Yang-Baxter equations in its reformulation in terms of triple products. These algebras are shown to arise naturally from noncompact real simple algebras with nonsimple complexification, where we impose that a nondegenerate quadratic Casimir operator is preserved by the limiting process. We further consider the converse problem and obtain sufficient conditions on integrable cocycles of quasiclassical Lie algebras in order to preserve nondegenerate quadratic Casimir operators by the associated linear deformations.

Roughness in Lattice Ordered Effect Algebras

PubMed Central

Xin, Xiao Long; Hua, Xiu Juan; Zhu, Xi

2014-01-01

Many authors have studied roughness on various algebraic systems. In this paper, we consider a lattice ordered effect algebra and discuss its roughness in this context. Moreover, we introduce the notions of the interior and the closure of a subset and give some of their properties in effect algebras. Finally, we use a Riesz ideal induced congruence and define a function e(a, b) in a lattice ordered effect algebra E and build a relationship between it and congruence classes. Then we study some properties about approximation of lattice ordered effect algebras. PMID:25170523

D{sub {infinity}}-differential E{sub {infinity}}-algebras and spectral sequences of fibrations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lapin, Sergei V

2007-10-31

The notion of an E{sub {infinity}}-algebra with a filtration is introduced. The connections are established between E{sub {infinity}}-algebras with filtrations and the theory of D{sub {infinity}}-differential E{sub {infinity}}-algebras over fields. Based on the technique of D{sub {infinity}}-differential E{sub {infinity}}-algebras, the apparatus of spectral sequences is developed for E{sub {infinity}}-algebras with filtrations, and applications of this apparatus to the multiplicative cohomology spectral sequences of fibrations are given. Bibliography: 21 titles.

q-Derivatives, quantization methods and q-algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Twarock, Reidun

1998-12-15

Using the example of Borel quantization on S{sup 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 {tau}. This extension is denoted as quasi-crystal Lie algebra, because thismore » 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.« less

Generalized conformal realizations of Kac-Moody algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Palmkvist, Jakob

2009-01-15

We present a construction which associates an infinite sequence of Kac-Moody algebras, labeled by a positive integer n, to one single Jordan algebra. For n=1, this reduces to the well known Kantor-Koecher-Tits construction. Our generalization utilizes a new relation between different generalized Jordan triple systems, together with their known connections to Jordan and Lie algebras. Applied to the Jordan algebra of Hermitian 3x3 matrices over the division algebras R, C, H, O, the construction gives the exceptional Lie algebras f{sub 4}, e{sub 6}, e{sub 7}, e{sub 8} for n=2. Moreover, we obtain their infinite-dimensional extensions for n{>=}3. In the casemore » of 2x2 matrices, the resulting Lie algebras are of the form so(p+n,q+n) and the concomitant nonlinear realization generalizes the conformal transformations in a spacetime of signature (p,q)« less

Filiform Lie algebras of order 3

DOE Office of Scientific and Technical Information (OSTI.GOV)

Navarro, R. M., E-mail: rnavarro@unex.es

2014-04-15

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 lamore » 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.« less

Differential calculus and gauge transformations on a deformed space

NASA Astrophysics Data System (ADS)

Wess, Julius

2007-08-01

We consider a formalism by which gauge theories can be constructed on noncommutative space time structures. The coordinates are supposed to form an algebra, restricted by certain requirements that allow us to realise the algebra in terms of star products. In this formulation it is useful to define derivatives and to extend the algebra of coordinates by these derivatives. The elements of this extended algebra are deformed differential operators. We then show that there is a morphism between these deformed differential operators and the usual higher order differential operators acting on functions of commuting coordinates. In this way we obtain deformed gauge transformations and a deformed version of the algebra of diffeomorphisms. The deformation of these algebras can be clearly seen in the category of Hopf algebras. The comultiplication will be twisted. These twisted algebras can be realised on noncommutative spaces and allow the construction of deformed gauge theories and deformed gravity theory.

I CAN Learn[R] Pre-Algebra and Algebra. What Works Clearinghouse Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2009

2009-01-01

The I CAN Learn[R] Education System is an interactive, self-paced, mastery-based software system that includes the I CAN Learn[R] Fundamentals of Math (5th-6th grade math) curriculum, the I CAN Learn[R] Pre-Algebra curriculum, and the I CAN Learn[R] Algebra curriculum. College algebra credit is also available to students in participating schools…

A Characterization of a Unified Notion of Mathematical Function: The Case of High School Function and Linear Transformation

ERIC Educational Resources Information Center

Zandieh, Michelle; Ellis, Jessica; Rasmussen, Chris

2017-01-01

As part of a larger study of student understanding of concepts in linear algebra, we interviewed 10 university linear algebra students as to their conceptions of functions from high school algebra and linear transformation from their study of linear algebra. An overarching goal of this study was to examine how linear algebra students see linear…

Simple nuclear C*-algebras not isomorphic to their opposites

PubMed Central

Hirshberg, Ilan

2017-01-01

We show that it is consistent with Zermelo–Fraenkel set theory with the axiom of choice (ZFC) that there is a simple nuclear nonseparable C∗-algebra, which is not isomorphic to its opposite algebra. We can furthermore guarantee that this example is an inductive limit of unital copies of the Cuntz algebra O2 or of the canonical anticommutation relations (CAR) algebra. PMID:28559339

Implementation of Algebra I in Eighth Grade: An "Ex-Post Facto" Study on Student Achievement

ERIC Educational Resources Information Center

Realdine, Dorothy S.

2010-01-01

Only recently have school districts across the nation begun to offer Algebra I to all eighth grade students. Currently, most eighth grade Algebra I curriculum does not have a national consistent focus of topics or level of rigor. A key issue of implementing Algebra I in eighth grade is defining national Algebra I concepts and skills that students…

The Xs and Whys of Algebra: Key Ideas and Common Misconceptions

ERIC Educational Resources Information Center

Collins, Anne; Dacey, Linda

2011-01-01

In many ways, algebra can be as challenging for teachers as it is for students. With so much emphasis placed on procedural knowledge and the manipulations of variables and symbols, it can be easy to lose sight of the key ideas that underlie algebraic thinking and the relevance algebra has to the real world. In the The Xs and Whys of Algebra: Key…

Boolean Operations with Prism Algebraic Patches

PubMed Central

Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi

2009-01-01

In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262

The applications of a higher-dimensional Lie algebra and its decomposed subalgebras

PubMed Central

Yu, Zhang; Zhang, Yufeng

2009-01-01

With the help of invertible linear transformations and the known Lie algebras, a higher-dimensional 6 × 6 matrix Lie algebra sμ(6) is constructed. It follows a type of new loop algebra is presented. By using a (2 + 1)-dimensional partial-differential equation hierarchy we obtain the integrable coupling of the (2 + 1)-dimensional KN integrable hierarchy, then its corresponding Hamiltonian structure is worked out by employing the quadratic-form identity. Furthermore, a higher-dimensional Lie algebra denoted by E, is given by decomposing the Lie algebra sμ(6), then a discrete lattice integrable coupling system is produced. A remarkable feature of the Lie algebras sμ(6) and E is used to directly construct integrable couplings. PMID:20084092

The applications of a higher-dimensional Lie algebra and its decomposed subalgebras.

PubMed

Yu, Zhang; Zhang, Yufeng

2009-01-15

With the help of invertible linear transformations and the known Lie algebras, a higher-dimensional 6 x 6 matrix Lie algebra smu(6) is constructed. It follows a type of new loop algebra is presented. By using a (2 + 1)-dimensional partial-differential equation hierarchy we obtain the integrable coupling of the (2 + 1)-dimensional KN integrable hierarchy, then its corresponding Hamiltonian structure is worked out by employing the quadratic-form identity. Furthermore, a higher-dimensional Lie algebra denoted by E, is given by decomposing the Lie algebra smu(6), then a discrete lattice integrable coupling system is produced. A remarkable feature of the Lie algebras smu(6) and E is used to directly construct integrable couplings.

QCCM Center for Quantum Algorithms

DTIC Science & Technology

2008-10-17

algorithms (e.g., quantum walks and adiabatic computing ), as well as theoretical advances relating algorithms to physical implementations (e.g...Park, NC 27709-2211 15. SUBJECT TERMS Quantum algorithms, quantum computing , fault-tolerant error correction Richard Cleve MITACS East Academic...0511200 Algebraic results on quantum automata A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, D. Thrien Theory of Computing Systems 39(2006

Schwarz maps of algebraic linear ordinary differential equations

NASA Astrophysics Data System (ADS)

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.

Spatial-Operator Algebra For Robotic Manipulators

NASA Technical Reports Server (NTRS)

Rodriguez, Guillermo; Kreutz, Kenneth K.; Milman, Mark H.

1991-01-01

Report discusses spatial-operator algebra developed in recent studies of mathematical modeling, control, and design of trajectories of robotic manipulators. Provides succinct representation of mathematically complicated interactions among multiple joints and links of manipulator, thereby relieving analyst of most of tedium of detailed algebraic manipulations. Presents analytical formulation of spatial-operator algebra, describes some specific applications, summarizes current research, and discusses implementation of spatial-operator algebra in the Ada programming language.

Difficulties in initial algebra learning in Indonesia

NASA Astrophysics Data System (ADS)

Jupri, Al; Drijvers, Paul; van den Heuvel-Panhuizen, Marja

2014-12-01

Within mathematics curricula, algebra has been widely recognized as one of the most difficult topics, which leads to learning difficulties worldwide. In Indonesia, algebra performance is an important issue. In the Trends in International Mathematics and Science Study (TIMSS) 2007, Indonesian students' achievement in the algebra domain was significantly below the average student performance in other Southeast Asian countries such as Thailand, Malaysia, and Singapore. This fact gave rise to this study which aims to investigate Indonesian students' difficulties in algebra. In order to do so, a literature study was carried out on students' difficulties in initial algebra. Next, an individual written test on algebra tasks was administered, followed by interviews. A sample of 51 grade VII Indonesian students worked the written test, and 37 of them were interviewed afterwards. Data analysis revealed that mathematization, i.e., the ability to translate back and forth between the world of the problem situation and the world of mathematics and to reorganize the mathematical system itself, constituted the most frequently observed difficulty in both the written test and the interview data. Other observed difficulties concerned understanding algebraic expressions, applying arithmetic operations in numerical and algebraic expressions, understanding the different meanings of the equal sign, and understanding variables. The consequences of these findings on both task design and further research in algebra education are discussed.

Algebraic special functions and SO(3,2)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Celeghini, E., E-mail: celeghini@fi.infn.it; Olmo, M.A. del, E-mail: olmo@fta.uva.es

2013-06-15

A ladder structure of operators is presented for the associated Legendre polynomials and the sphericas harmonics. In both cases these operators belong to the irreducible representation of the Lie algebra so(3,2) with quadratic Casimir equals to −5/4. As both are also bases of square-integrable functions, the universal enveloping algebra of so(3,2) is thus shown to be homomorphic to the space of linear operators acting on the L{sup 2} functions defined on (−1,1)×Z and on the sphere S{sup 2}, respectively. The presence of a ladder structure is suggested to be the general condition to obtain a Lie algebra representation defining inmore » this way the “algebraic special functions” that are proposed to be the connection between Lie algebras and square-integrable functions so that the space of linear operators on the L{sup 2} functions is homomorphic to the universal enveloping algebra. The passage to the group, by means of the exponential map, shows that the associated Legendre polynomials and the spherical harmonics support the corresponding unitary irreducible representation of the group SO(3,2). -- Highlights: •The algebraic ladder structure is constructed for the associated Legendre polynomials (ALP). •ALP and spherical harmonics support a unitary irreducible SO(3,2)-representation. •A ladder structure is the condition to get a Lie group representation defining “algebraic special functions”. •The “algebraic special functions” connect Lie algebras and L{sup 2} functions.« less

Locally Compact Quantum Groups. A von Neumann Algebra Approach

NASA Astrophysics Data System (ADS)

Van Daele, Alfons

2014-08-01

In this paper, we give an alternative approach to the theory of locally compact quantum groups, as developed by Kustermans and Vaes. We start with a von Neumann algebra and a comultiplication on this von Neumann algebra. We assume that there exist faithful left and right Haar weights. Then we develop the theory within this von Neumann algebra setting. In [Math. Scand. 92 (2003), 68-92] locally compact quantum groups are also studied in the von Neumann algebraic context. This approach is independent of the original C^*-algebraic approach in the sense that the earlier results are not used. However, this paper is not really independent because for many proofs, the reader is referred to the original paper where the C^*-version is developed. In this paper, we give a completely self-contained approach. Moreover, at various points, we do things differently. We have a different treatment of the antipode. It is similar to the original treatment in [Ann. Sci. & #201;cole Norm. Sup. (4) 33 (2000), 837-934]. But together with the fact that we work in the von Neumann algebra framework, it allows us to use an idea from [Rev. Roumaine Math. Pures Appl. 21 (1976), 1411-1449] to obtain the uniqueness of the Haar weights in an early stage. We take advantage of this fact when deriving the other main results in the theory. We also give a slightly different approach to duality. Finally, we collect, in a systematic way, several important formulas. In an appendix, we indicate very briefly how the C^*-approach and the von Neumann algebra approach eventually yield the same objects. The passage from the von Neumann algebra setting to the C^*-algebra setting is more or less standard. For the other direction, we use a new method. It is based on the observation that the Haar weights on the C^*-algebra extend to weights on the double dual with central support and that all these supports are the same. Of course, we get the von Neumann algebra by cutting down the double dual with this unique support projection in the center. All together, we see that there are many advantages when we develop the theory of locally compact quantum groups in the von Neumann algebra framework, rather than in the C^*-algebra framework. It is not only simpler, the theory of weights on von Neumann algebras is better known and one needs very little to go from the C^*-algebras to the von Neumann algebras. Moreover, in many cases when constructing examples, the von Neumann algebra with the coproduct is constructed from the very beginning and the Haar weights are constructed as weights on this von Neumann algebra (using left Hilbert algebra theory). This paper is written in a concise way. In many cases, only indications for the proofs of the results are given. This information should be enough to see that these results are correct. We will give more details in forthcoming paper, which will be expository, aimed at non-specialists. See also [Bull. Kerala Math. Assoc. (2005), 153-177] for an 'expanded' version of the appendix.

Algebraic theory of molecules

NASA Technical Reports Server (NTRS)

Iachello, Franco

1995-01-01

An algebraic formulation of quantum mechanics is presented. In this formulation, operators of interest are expanded onto elements of an algebra, G. For bound state problems in nu dimensions the algebra G is taken to be U(nu + 1). Applications to the structure of molecules are presented.

FRT presentation of the Onsager algebras

NASA Astrophysics Data System (ADS)

Baseilhac, Pascal; Belliard, Samuel; Crampé, Nicolas

2018-03-01

A presentation à la Faddeev-Reshetikhin-Takhtajan (FRT) of the Onsager, augmented Onsager and sl_2 -invariant Onsager algebras is given, using the framework of the nonstandard classical Yang-Baxter algebras. Associated current algebras are identified, and generating functions of mutually commuting quantities are obtained.

The BMS4 algebra at spatial infinity

NASA Astrophysics Data System (ADS)

Troessaert, Cédric

2018-04-01

We show how a global BMS4 algebra appears as part of the asymptotic symmetry algebra at spatial infinity. Using linearised theory, we then show that this global BMS4 algebra is the one introduced by Strominger as a symmetry of the S-matrix.

Eigenvectors determination of the ribosome dynamics model during mRNA translation using the Kleene Star algorithm

NASA Astrophysics Data System (ADS)

Ernawati; Carnia, E.; Supriatna, A. K.

2018-03-01

Eigenvalues and eigenvectors in max-plus algebra have the same important role as eigenvalues and eigenvectors in conventional algebra. In max-plus algebra, eigenvalues and eigenvectors are useful for knowing dynamics of the system such as in train system scheduling, scheduling production systems and scheduling learning activities in moving classes. In the translation of proteins in which the ribosome move uni-directionally along the mRNA strand to recruit the amino acids that make up the protein, eigenvalues and eigenvectors are used to calculate protein production rates and density of ribosomes on the mRNA. Based on this, it is important to examine the eigenvalues and eigenvectors in the process of protein translation. In this paper an eigenvector formula is given for a ribosome dynamics during mRNA translation by using the Kleene star algorithm in which the resulting eigenvector formula is simpler and easier to apply to the system than that introduced elsewhere. This paper also discusses the properties of the matrix {B}λ \\otimes n of model. Among the important properties, it always has the same elements in the first column for n = 1, 2,… if the eigenvalue is the time of initiation, λ = τin , and the column is the eigenvector of the model corresponding to λ.

Combined geometric and algebraic solutions for removal of bSSFP banding artifacts with performance comparisons.

PubMed

Hoff, Michael N; Andre, Jalal B; Xiang, Qing-San

2017-02-01

Balanced steady state free precession (bSSFP) imaging suffers from off-resonance artifacts such as signal modulation and banding. Solutions for removal of bSSFP off-resonance dependence are described and compared, and an optimal solution is proposed. An Algebraic Solution (AS) that complements a previously described Geometric Solution (GS) is derived from four phase-cycled bSSFP datasets. A composite Geometric-Algebraic Solution (GAS) is formed from a noise-variance-weighted average of the AS and GS images. Two simulations test the solutions over a range of parameters, and phantom and in vivo experiments are implemented. Image quality and performance of the GS, AS, and GAS are compared with the complex sum and a numerical parameter estimation algorithm. The parameter estimation algorithm, GS, AS, and GAS remove most banding and signal modulation in bSSFP imaging. The variable performance of the GS and AS on noisy data justifies generation of the GAS, which consistently provides the highest performance. The GAS is a robust technique for bSSFP signal demodulation that balances the regional efficacy of the GS and AS to remove banding, a feat not possible with prevalent techniques. Magn Reson Med 77:644-654, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.

Geometric descriptions of entangled states by auxiliary varieties

DOE Office of Scientific and Technical Information (OSTI.GOV)

Holweck, Frederic; Luque, Jean-Gabriel; Thibon, Jean-Yves

2012-10-15

The aim of the paper is to propose geometric descriptions of multipartite entangled states using algebraic geometry. In the context of this paper, geometric means each stratum of the Hilbert space, corresponding to an entangled state, is an open subset of an algebraic variety built by classical geometric constructions (tangent lines, secant lines) from the set of separable states. In this setting, we describe well-known classifications of multipartite entanglement such as 2 Multiplication-Sign 2 Multiplication-Sign (n+ 1), for n Greater-Than-Or-Slanted-Equal-To 1, quantum systems and a new description with the 2 Multiplication-Sign 3 Multiplication-Sign 3 quantum system. Our results complete themore » approach of Miyake and make stronger connections with recent work of algebraic geometers. Moreover, for the quantum systems detailed in this paper, we propose an algorithm, based on the classical theory of invariants, to decide to which subvariety of the Hilbert space a given state belongs.« less

Understanding Division of Fractions: An Alternative View

ERIC Educational Resources Information Center

Fredua-Kwarteng, E.; Ahia, Francis

2006-01-01

The purpose of this paper is to offer three alternatives to patterns or visualization used to justify division of fraction "algorithm" invert and multiply". The three main approaches are historical, similar denominators and algebraic, that teachers could use to justify the standard algorithm of division of fraction. The historical approach uses…

Post-Lie algebras and factorization theorems

NASA Astrophysics Data System (ADS)

Ebrahimi-Fard, Kurusch; Mencattini, Igor; Munthe-Kaas, Hans

2017-09-01

In this note we further explore the properties of universal enveloping algebras associated to a post-Lie algebra. Emphasizing the role of the Magnus expansion, we analyze the properties of group like-elements belonging to (suitable completions of) those Hopf algebras. Of particular interest is the case of post-Lie algebras defined in terms of solutions of modified classical Yang-Baxter equations. In this setting we will study factorization properties of the aforementioned group-like elements.

Comparison of the Effectiveness of a Traditional Intermediate Algebra Course With That of a Less Rigorous Intermediate Algebra Course in Preparing Students for Success in a Subsequent Mathematics Course

ERIC Educational Resources Information Center

Sworder, Steven C.

2007-01-01

An experimental two-track intermediate algebra course was offered at Saddleback College, Mission Viejo, CA, between the Fall, 2002 and Fall, 2005 semesters. One track was modeled after the existing traditional California community college intermediate algebra course and the other track was a less rigorous intermediate algebra course in which the…

Hom Gel'fand-Dorfman bialgebras and Hom-Lie conformal algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yuan, Lamei, E-mail: lmyuan@hit.edu.cn

2014-04-15

The aim of this paper is to introduce the notions of Hom Gel'fand-Dorfman bialgebra and Hom-Lie conformal algebra. In this paper, we give four constructions of Hom Gel'fand-Dorfman bialgebras. Also, we provide a general construction of Hom-Lie conformal algebras from Hom-Lie algebras. Finally, we prove that a Hom Gel'fand-Dorfman bialgebra is equivalent to a Hom-Lie conformal algebra of degree 2.

Internally connected graphs and the Kashiwara-Vergne Lie algebra

NASA Astrophysics Data System (ADS)

Felder, Matteo

2018-06-01

It is conjectured that the Kashiwara-Vergne Lie algebra \\widehat{krv}_2 is isomorphic to the direct sum of the Grothendieck-Teichmüller Lie algebra grt_1 and a one-dimensional Lie algebra. In this paper, we use the graph complex of internally connected graphs to define a nested sequence of Lie subalgebras of \\widehat{krv}_2 whose intersection is grt_1, thus giving a way to interpolate between these two Lie algebras.

Discrimination in a General Algebraic Setting

PubMed Central

Fine, Benjamin; Lipschutz, Seymour; Spellman, Dennis

2015-01-01

Discriminating groups were introduced by G. Baumslag, A. Myasnikov, and V. Remeslennikov as an outgrowth of their theory of algebraic geometry over groups. Algebraic geometry over groups became the main method of attack on the solution of the celebrated Tarski conjectures. In this paper we explore the notion of discrimination in a general universal algebra context. As an application we provide a different proof of a theorem of Malcev on axiomatic classes of Ω-algebras. PMID:26171421

Generalized derivation extensions of 3-Lie algebras and corresponding Nambu-Poisson structures

NASA Astrophysics Data System (ADS)

Song, Lina; Jiang, Jun

2018-01-01

In this paper, we introduce the notion of a generalized derivation on a 3-Lie algebra. We construct a new 3-Lie algebra using a generalized derivation and call it the generalized derivation extension. We show that the corresponding Leibniz algebra on the space of fundamental objects is the double of a matched pair of Leibniz algebras. We also determine the corresponding Nambu-Poisson structures under some conditions.

Metric 3-Leibniz algebras and M2-branes

NASA Astrophysics Data System (ADS)

Méndez-Escobar, Elena

2010-08-01

This thesis is concerned with superconformal Chern-Simons theories with matter in 3 dimensions. The interest in these theories is two-fold. On the one hand, it is a new family of theories in which to test the AdS/CFT correspondence and on the other, they are important to study one of the main objects of M-theory (M2-branes). All these theories have something in common: they can be written in terms of 3-Leibniz algebras. Here we study the structure theory of such algebras, paying special attention to a subclass of them that gives rise to maximal supersymmetry and that was the first to appear in this context: 3-Lie algebras. In chapter 2, we review the structure theory of metric Lie algebras and their unitary representations. In chapter 3, we study metric 3-Leibniz algebras and show, by specialising a construction originally due to Faulkner, that they are in one to one correspondence with pairs of real metric Lie algebras and unitary representations of them. We also show a third characterisation for six extreme cases of 3-Leibniz algebras as graded Lie (super)algebras. In chapter 4, we study metric 3-Lie algebras in detail. We prove a structural result and also classify those with a maximally isotropic centre, which is the requirement that ensures unitarity of the corresponding conformal field theory. Finally, in chapter 5, we study the universal structure of superpotentials in this class of superconformal Chern-Simons theories with matter in three dimensions. We provide a uniform formulation for all these theories and establish the connection between the amount of supersymmetry preserved and the gauge Lie algebra and the appropriate unitary representation to be used to write down the Lagrangian. The conditions for supersymmetry enhancement are then expressed equivalently in the language of representation theory of Lie algebras or the language of 3-Leibniz algebras.

On Maximal Subalgebras and the Hypercentre of Lie Algebras.

ERIC Educational Resources Information Center

Honda, Masanobu

1997-01-01

Derives two sufficient conditions for a finitely generated Lie algebra to have the nilpotent hypercenter. Presents a relatively large class of generalized soluble Lie algebras. Proves that if a finitely generated Lie algebra has a nilpotent maximal subalgebra, the Fitting radical is nilpotent. (DDR)

An algebra of reversible computation.

PubMed

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.

On Weak-BCC-Algebras

PubMed Central

Thomys, Janus; Zhang, Xiaohong

2013-01-01

We describe weak-BCC-algebras (also called BZ-algebras) in which the condition (x∗y)∗z = (x∗z)∗y is satisfied only in the case when elements x, y belong to the same branch. We also characterize ideals, nilradicals, and nilpotent elements of such algebras. PMID:24311983

Macdonald index and chiral algebra

NASA Astrophysics Data System (ADS)

Song, Jaewon

2017-08-01

For any 4d N = 2 SCFT, there is a subsector described by a 2d chiral algebra. The vacuum character of the chiral algebra reproduces the Schur index of the corresponding 4d theory. The Macdonald index counts the same set of operators as the Schur index, but the former has one more fugacity than the latter. We conjecture a prescription to obtain the Macdonald index from the chiral algebra. The vacuum module admits a filtration, from which we construct an associated graded vector space. From this grading, we conjecture a notion of refined character for the vacuum module of a chiral algebra, which reproduces the Macdonald index. We test this prescription for the Argyres-Douglas theories of type ( A 1 , A 2 n ) and ( A 1 , D 2 n+1) where the chiral algebras are given by Virasoro and \\widehat{su}(2) affine Kac-Moody algebra. When the chiral algebra has more than one family of generators, our prescription requires a knowledge of the generators from the 4d.

Macdonald index and chiral algebra

DOE Office of Scientific and Technical Information (OSTI.GOV)

Song, Jaewon

For any 4dN = 2 SCFT, there is a subsector described by a 2d chiral algebra. The vacuum character of the chiral algebra reproduces the Schur index of the corresponding 4d theory. The Macdonald index counts the same set of operators as the Schur index, but the former has one more fugacity than the latter. Here, we conjecture a prescription to obtain the Macdonald index from the chiral algebra. The vacuum module admits a filtration, from which we construct an associated graded vector space. From this grading, we conjecture a notion of refined character for the vacuum module of a chiral algebra, which reproduces the Macdonald index. We test this prescription for the Argyres-Douglas theories of type (A 1, A 2n) and (A 1, D 2n+1) where the chiral algebras are given by Virasoro andmore » $$ˆ\\atop{su}$$(2) affine Kac-Moody algebra. When the chiral algebra has more than one family of generators, our prescription requires a knowledge of the generators from the 4d.« less

Macdonald index and chiral algebra

DOE PAGES

Song, Jaewon

2017-08-10

For any 4dN = 2 SCFT, there is a subsector described by a 2d chiral algebra. The vacuum character of the chiral algebra reproduces the Schur index of the corresponding 4d theory. The Macdonald index counts the same set of operators as the Schur index, but the former has one more fugacity than the latter. Here, we conjecture a prescription to obtain the Macdonald index from the chiral algebra. The vacuum module admits a filtration, from which we construct an associated graded vector space. From this grading, we conjecture a notion of refined character for the vacuum module of a chiral algebra, which reproduces the Macdonald index. We test this prescription for the Argyres-Douglas theories of type (A 1, A 2n) and (A 1, D 2n+1) where the chiral algebras are given by Virasoro andmore » $$ˆ\\atop{su}$$(2) affine Kac-Moody algebra. When the chiral algebra has more than one family of generators, our prescription requires a knowledge of the generators from the 4d.« less

Comparison of Co-Temporal Modeling Algorithms on Sparse Experimental Time Series Data Sets.

PubMed

Allen, Edward E; Norris, James L; John, David J; Thomas, Stan J; Turkett, William H; Fetrow, Jacquelyn S

2010-01-01

Multiple approaches for reverse-engineering biological networks from time-series data have been proposed in the computational biology literature. These approaches can be classified by their underlying mathematical algorithms, such as Bayesian or algebraic techniques, as well as by their time paradigm, which includes next-state and co-temporal modeling. The types of biological relationships, such as parent-child or siblings, discovered by these algorithms are quite varied. It is important to understand the strengths and weaknesses of the various algorithms and time paradigms on actual experimental data. We assess how well the co-temporal implementations of three algorithms, continuous Bayesian, discrete Bayesian, and computational algebraic, can 1) identify two types of entity relationships, parent and sibling, between biological entities, 2) deal with experimental sparse time course data, and 3) handle experimental noise seen in replicate data sets. These algorithms are evaluated, using the shuffle index metric, for how well the resulting models match literature models in terms of siblings and parent relationships. Results indicate that all three co-temporal algorithms perform well, at a statistically significant level, at finding sibling relationships, but perform relatively poorly in finding parent relationships.

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

PubMed

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.

SU-E-J-02: 4D Digital Tomosynthesis Based On Algebraic Image Reconstruction and Total-Variation Minimization for the Improvement of Image Quality

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kim, D; Kang, S; Kim, T

2014-06-01

Purpose: In this paper, we implemented the four-dimensional (4D) digital tomosynthesis (DTS) imaging based on algebraic image reconstruction technique and total-variation minimization method in order to compensate the undersampled projection data and improve the image quality. Methods: The projection data were acquired as supposed the cone-beam computed tomography system in linear accelerator by the Monte Carlo simulation and the in-house 4D digital phantom generation program. We performed 4D DTS based upon simultaneous algebraic reconstruction technique (SART) among the iterative image reconstruction technique and total-variation minimization method (TVMM). To verify the effectiveness of this reconstruction algorithm, we performed systematic simulation studiesmore » to investigate the imaging performance. Results: The 4D DTS algorithm based upon the SART and TVMM seems to give better results than that based upon the existing method, or filtered-backprojection. Conclusion: The advanced image reconstruction algorithm for the 4D DTS would be useful to validate each intra-fraction motion during radiation therapy. In addition, it will be possible to give advantage to real-time imaging for the adaptive radiation therapy. This research was supported by Leading Foreign Research Institute Recruitment Program (Grant No.2009-00420) and Basic Atomic Energy Research Institute (BAERI); (Grant No. 2009-0078390) through the National Research Foundation of Korea(NRF) funded by the Ministry of Science, ICT and Future Planning (MSIP)« less

Using Spherical-Harmonics Expansions for Optics Surface Reconstruction from Gradients.

PubMed

Solano-Altamirano, Juan Manuel; Vázquez-Otero, Alejandro; Khikhlukha, Danila; Dormido, Raquel; Duro, Natividad

2017-11-30

In this paper, we propose a new algorithm to reconstruct optics surfaces (aka wavefronts) from gradients, defined on a circular domain, by means of the Spherical Harmonics. The experimental results indicate that this algorithm renders the same accuracy, compared to the reconstruction based on classical Zernike polynomials, using a smaller number of polynomial terms, which potentially speeds up the wavefront reconstruction. Additionally, we provide an open-source C++ library, released under the terms of the GNU General Public License version 2 (GPLv2), wherein several polynomial sets are coded. Therefore, this library constitutes a robust software alternative for wavefront reconstruction in a high energy laser field, optical surface reconstruction, and, more generally, in surface reconstruction from gradients. The library is a candidate for being integrated in control systems for optical devices, or similarly to be used in ad hoc simulations. Moreover, it has been developed with flexibility in mind, and, as such, the implementation includes the following features: (i) a mock-up generator of various incident wavefronts, intended to simulate the wavefronts commonly encountered in the field of high-energy lasers production; (ii) runtime selection of the library in charge of performing the algebraic computations; (iii) a profiling mechanism to measure and compare the performance of different steps of the algorithms and/or third-party linear algebra libraries. Finally, the library can be easily extended to include additional dependencies, such as porting the algebraic operations to specific architectures, in order to exploit hardware acceleration features.

Using Spherical-Harmonics Expansions for Optics Surface Reconstruction from Gradients

PubMed Central

Solano-Altamirano, Juan Manuel; Khikhlukha, Danila

2017-01-01

In this paper, we propose a new algorithm to reconstruct optics surfaces (aka wavefronts) from gradients, defined on a circular domain, by means of the Spherical Harmonics. The experimental results indicate that this algorithm renders the same accuracy, compared to the reconstruction based on classical Zernike polynomials, using a smaller number of polynomial terms, which potentially speeds up the wavefront reconstruction. Additionally, we provide an open-source C++ library, released under the terms of the GNU General Public License version 2 (GPLv2), wherein several polynomial sets are coded. Therefore, this library constitutes a robust software alternative for wavefront reconstruction in a high energy laser field, optical surface reconstruction, and, more generally, in surface reconstruction from gradients. The library is a candidate for being integrated in control systems for optical devices, or similarly to be used in ad hoc simulations. Moreover, it has been developed with flexibility in mind, and, as such, the implementation includes the following features: (i) a mock-up generator of various incident wavefronts, intended to simulate the wavefronts commonly encountered in the field of high-energy lasers production; (ii) runtime selection of the library in charge of performing the algebraic computations; (iii) a profiling mechanism to measure and compare the performance of different steps of the algorithms and/or third-party linear algebra libraries. Finally, the library can be easily extended to include additional dependencies, such as porting the algebraic operations to specific architectures, in order to exploit hardware acceleration features. PMID:29189722

Line defect Schur indices, Verlinde algebras and U(1) r fixed points

NASA Astrophysics Data System (ADS)

Neitzke, Andrew; Yan, Fei

2017-11-01

Given an N=2 superconformal field theory, we reconsider the Schur index ℐ L ( q) in the presence of a half line defect L. Recently Cordova-Gaiotto-Shao found that ℐ L ( q) admits an expansion in terms of characters of the chiral algebra A introduced by Beem et al., with simple coefficients υ L, β ( q). We report a puzzling new feature of this expansion: the q → 1 limit of the coefficients υ L, β ( q) is linearly related to the vacuum expectation values 〈 L〉 in U(1) r -invariant vacua of the theory compactified on S 1. This relation can be expressed algebraically as a commutative diagram involving three algebras: the algebra generated by line defects, the algebra of functions on U(1) r -invariant vacua, and a Verlindelike algebra associated to A . Our evidence is experimental, by direct computation in the Argyres-Douglas theories of type ( A 1, A 2), ( A 1, A 4), ( A 1, A 6), ( A 1, D 3) and ( A 1, D 5). In the latter two theories, which have flavor symmetries, the Verlinde-like algebra which appears is a new deformation of algebras previously considered.

Constraint-Referenced Analytics of Algebra Learning

ERIC Educational Resources Information Center

Sutherland, Scot M.; White, Tobin F.

2016-01-01

The development of the constraint-referenced analytics tool for monitoring algebra learning activities presented here came from the desire to firstly, take a more quantitative look at student responses in collaborative algebra activities, and secondly, to situate those activities in a more traditional introductory algebra setting focusing on…

Teaching Strategies to Improve Algebra Learning

ERIC Educational Resources Information Center

Zbiek, Rose Mary; Larson, Matthew R.

2015-01-01

Improving student learning is the primary goal of every teacher of algebra. Teachers seek strategies to help all students learn important algebra content and develop mathematical practices. The new Institute of Education Sciences[IES] practice guide, "Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students"…

Preparing Elementary Prospective Teachers to Teach Early Algebra

ERIC Educational Resources Information Center

Hohensee, Charles

2017-01-01

Researchers have argued that integrating early algebra into elementary grades will better prepare students for algebra. However, currently little research exists to guide teacher preparation programs on how to prepare prospective elementary teachers to teach early algebra. This study examines the insights and challenges that prospective teachers…

Difficulties in Initial Algebra Learning in Indonesia

ERIC Educational Resources Information Center

Jupri, Al; Drijvers, Paul; van den Heuvel-Panhuizen, Marja

2014-01-01

Within mathematics curricula, algebra has been widely recognized as one of the most difficult topics, which leads to learning difficulties worldwide. In Indonesia, algebra performance is an important issue. In the Trends in International Mathematics and Science Study (TIMSS) 2007, Indonesian students' achievement in the algebra domain was…

Visual Salience of Algebraic Transformations

ERIC Educational Resources Information Center

Kirshner, David; Awtry, Thomas

2004-01-01

Information processing researchers have assumed that algebra symbol skills depend on mastery of the abstract rules presented in the curriculum (Matz, 1980; Sleeman, 1986). Thus, students' ubiquitous algebra errors have been taken as indicating the need to embed algebra in rich contextual settings (Kaput, 1995; National Council of Teachers of…

Quantum walled Brauer algebra: commuting families, Baxterization, and representations

NASA Astrophysics Data System (ADS)

Semikhatov, A. M.; Tipunin, I. Yu

2017-02-01

For the quantum walled Brauer algebra, we construct its Specht modules and (for generic parameters of the algebra) seminormal modules. The latter construction yields the spectrum of a commuting family of Jucys-Murphy elements. We also propose a Baxterization prescription; it involves representing the quantum walled Brauer algebra in terms of morphisms in a braided monoidal category and introducing parameters into these morphisms, which allows constructing a ‘universal transfer matrix’ that generates commuting elements of the algebra.

A grid spacing control technique for algebraic grid generation methods

NASA Technical Reports Server (NTRS)

Smith, R. E.; Kudlinski, R. A.; Everton, E. L.

1982-01-01

A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

Assessment of an Explicit Algebraic Reynolds Stress Model

NASA Technical Reports Server (NTRS)

Carlson, Jan-Renee

2005-01-01

This study assesses an explicit algebraic Reynolds stress turbulence model in the in the three-dimensional Reynolds averaged Navier-Stokes (RANS) solver, ISAAC (Integrated Solution Algorithm for Arbitrary Con gurations). Additionally, it compares solutions for two select configurations between ISAAC and the RANS solver PAB3D. This study compares with either direct numerical simulation data, experimental data, or empirical models for several different geometries with compressible, separated, and high Reynolds number flows. In general, the turbulence model matched data or followed experimental trends well, and for the selected configurations, the computational results of ISAAC closely matched those of PAB3D using the same turbulence model.

Tropical geometry of statistical models.

PubMed

Pachter, Lior; Sturmfels, Bernd

2004-11-16

This article presents a unified mathematical framework for inference in graphical models, building on the observation that graphical models are algebraic varieties. From this geometric viewpoint, observations generated from a model are coordinates of a point in the variety, and the sum-product algorithm is an efficient tool for evaluating specific coordinates. Here, we address the question of how the solutions to various inference problems depend on the model parameters. The proposed answer is expressed in terms of tropical algebraic geometry. The Newton polytope of a statistical model plays a key role. Our results are applied to the hidden Markov model and the general Markov model on a binary tree.

Spatial operator algebra framework for multibody system dynamics

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Jain, Abhinandan; Kreutz, K.

1989-01-01

The Spatial Operator Algebra framework for the dynamics of general multibody systems is described. The use of a spatial operator-based methodology permits the formulation of the dynamical equations of motion of multibody systems in a concise and systematic way. The dynamical equations of progressively more complex grid multibody systems are developed in an evolutionary manner beginning with a serial chain system, followed by a tree topology system and finally, systems with arbitrary closed loops. Operator factorizations and identities are used to develop novel recursive algorithms for the forward dynamics of systems with closed loops. Extensions required to deal with flexible elements are also discussed.

Spatial Operator Algebra for multibody system dynamics

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Jain, A.; Kreutz-Delgado, K.

1992-01-01

The Spatial Operator Algebra framework for the dynamics of general multibody systems is described. The use of a spatial operator-based methodology permits the formulation of the dynamical equations of motion of multibody systems in a concise and systematic way. The dynamical equations of progressively more complex grid multibody systems are developed in an evolutionary manner beginning with a serial chain system, followed by a tree topology system and finally, systems with arbitrary closed loops. Operator factorizations and identities are used to develop novel recursive algorithms for the forward dynamics of systems with closed loops. Extensions required to deal with flexible elements are also discussed.

Abstract Numeric Relations and the Visual Structure of Algebra

ERIC Educational Resources Information Center

Landy, David; Brookes, David; Smout, Ryan

2014-01-01

Formal algebras are among the most powerful and general mechanisms for expressing quantitative relational statements; yet, even university engineering students, who are relatively proficient with algebraic manipulation, struggle with and often fail to correctly deploy basic aspects of algebraic notation (Clement, 1982). In the cognitive tradition,…

Classical versus Computer Algebra Methods in Elementary Geometry

ERIC Educational Resources Information Center

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…

UCSMP Algebra. What Works Clearinghouse Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2007

2007-01-01

"University of Chicago School Mathematics Project (UCSMP) Algebra," designed to increase students' skills in algebra, is appropriate for students in grades 7-10, depending on the students' incoming knowledge. This one-year course highlights applications, uses statistics and geometry to develop the algebra of linear equations and inequalities, and…

Teacher Actions to Facilitate Early Algebraic Reasoning

ERIC Educational Resources Information Center

Hunter, Jodie

2015-01-01

In recent years there has been an increased emphasis on integrating the teaching of arithmetic and algebra in primary school classrooms. This requires teachers to develop links between arithmetic and algebra and use pedagogical actions that facilitate algebraic reasoning. Drawing on findings from a classroom-based study, this paper provides an…

Abstract Algebra to Secondary School Algebra: Building Bridges

ERIC Educational Resources Information Center

Christy, Donna; Sparks, Rebecca

2015-01-01

The authors have experience with secondary mathematics teacher candidates struggling to make connections between the theoretical abstract algebra course they take as college students and the algebra they will be teaching in secondary schools. As a mathematician and a mathematics educator, the authors collaborated to create and implement a…

A Proposed Algebra Assessment for Use in a Problem-Analysis Framework

ERIC Educational Resources Information Center

Walick, Christopher M.; Burns, Matthew K.

2017-01-01

Algebra is critical to high school graduation and college success, but student achievement in algebra frequently falls significantly below expected proficiency levels. While existing research emphasizes the importance of quality algebra instruction, there is little research about how to conduct problem analysis for struggling secondary students.…

A Relational Algebra Query Language for Programming Relational Databases

ERIC Educational Resources Information Center

McMaster, Kirby; Sambasivam, Samuel; Anderson, Nicole

2011-01-01

In this paper, we describe a Relational Algebra Query Language (RAQL) and Relational Algebra Query (RAQ) software product we have developed that allows database instructors to teach relational algebra through programming. Instead of defining query operations using mathematical notation (the approach commonly taken in database textbooks), students…

Assessing Mathematics Automatically Using Computer Algebra and the Internet

ERIC Educational Resources Information Center

Sangwin, Chris

2004-01-01

This paper reports some recent developments in mathematical computer-aided assessment which employs computer algebra to evaluate students' work using the Internet. Technical and educational issues raised by this use of computer algebra are addressed. Working examples from core calculus and algebra which have been used with first year university…

Matematica Para La Escuela Secundaria, Primer Curso de Algebra (Parte 1). Traduccion Preliminar de la Edicion Inglesa Revisada. (Mathematics for High School, First Course in Algebra, Part 1. Preliminary Translation of the Revised English Edition).

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

This is the student text for part one of a three-part SMSG algebra course for high school students. The principal objective of the text is to help the student develop an understanding and appreciation of some of the algebraic structure as a basis for the techniques of algebra. Chapter topics include congruence; numbers and variables; operations;…

Matematica Para La Escuela Secundaria, Primer Curso de Algebra (Parte 1), Comentario. Traduccion Preliminar de la Edicion en Ingles Revisada. (Mathematics for High School, First Course in Algebra, Part 1, Teacher's Commentary. Translation of the Revised English Edition).

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

This is the teacher's commentary for part one of a three-part SMSG algebra text for high school students. The principal objective of the text is to help the student develop an understanding and appreciation of some of the algebraic structure as a basis for the techniques of algebra. Chapter topics include congruence; numbers and variables;…

Matematica Para La Escuela Secundaria, Primer Curso de Algebra (Parte 2). Traduccion Preliminar de la Edicion Inglesa Revisada. (Mathematics for High School, First Course in Algebra, Part 2. Preliminary Translation of the Revised English Edition).

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

This is part two of a three-part SMSG algebra text for high school students. The principal objective of the text is to help the student develop an understanding and appreciation of some of the algebraic structure as a basis for the techniques of algebra. Chapter topics include addition and multiplication of real numbers, subtraction and division…

Quiver W-algebras

NASA Astrophysics Data System (ADS)

Kimura, Taro; Pestun, Vasily

2018-06-01

For a quiver with weighted arrows, we define gauge-theory K-theoretic W-algebra generalizing the definition of Shiraishi et al. and Frenkel and Reshetikhin. In particular, we show that the qq-character construction of gauge theory presented by Nekrasov is isomorphic to the definition of the W-algebra in the operator formalism as a commutant of screening charges in the free field representation. Besides, we allow arbitrary quiver and expect interesting applications to representation theory of generalized Borcherds-Kac-Moody Lie algebras, their quantum affinizations and associated W-algebras.

Computational efficiency for the surface renewal method

NASA Astrophysics Data System (ADS)

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.

An Algebraic Formulation of Level One Wess-Zumino Models

NASA Astrophysics Data System (ADS)

Böckenhauer, Jens

The highest weight modules of the chiral algebra of orthogonal WZW models at level one possess a realization in fermionic representation spaces; the Kac-Moody and Virasoro generators are represented as unbounded limits of even CAR algebras. It is shown that the representation theory of the underlying even CAR algebras reproduces precisely the sectors of the chiral algebra. This fact allows to develop a theory of local von Neumann algebras on the punctured circle, fitting nicely in the Doplicher-Haag-Roberts framework. The relevant localized endomorphisms which generate the charged sectors are explicitly constructed by means of Bogoliubov transformations. Using CAR theory, the fusion rules in terms of sector equivalence classes are proven.

Efficient parallel linear scaling construction of the density matrix for Born-Oppenheimer molecular dynamics.

PubMed

Mniszewski, S M; Cawkwell, M J; Wall, M E; Mohd-Yusof, J; Bock, N; Germann, T C; Niklasson, A M N

2015-10-13

We present an algorithm for the calculation of the density matrix that for insulators scales linearly with system size and parallelizes efficiently on multicore, shared memory platforms with small and controllable numerical errors. The algorithm is based on an implementation of the second-order spectral projection (SP2) algorithm [ Niklasson, A. M. N. Phys. Rev. B 2002 , 66 , 155115 ] in sparse matrix algebra with the ELLPACK-R data format. We illustrate the performance of the algorithm within self-consistent tight binding theory by total energy calculations of gas phase poly(ethylene) molecules and periodic liquid water systems containing up to 15,000 atoms on up to 16 CPU cores. We consider algorithm-specific performance aspects, such as local vs nonlocal memory access and the degree of matrix sparsity. Comparisons to sparse matrix algebra implementations using off-the-shelf libraries on multicore CPUs, graphics processing units (GPUs), and the Intel many integrated core (MIC) architecture are also presented. The accuracy and stability of the algorithm are illustrated with long duration Born-Oppenheimer molecular dynamics simulations of 1000 water molecules and a 303 atom Trp cage protein solvated by 2682 water molecules.

On Correspondence of BRST-BFV, Dirac, and Refined Algebraic Quantizations of Constrained Systems

NASA Astrophysics Data System (ADS)

Shvedov, O. Yu.

2002-11-01

The correspondence between BRST-BFV, Dirac, and refined algebraic (group averaging, projection operator) approaches to quantizing constrained systems is analyzed. For the closed-algebra case, it is shown that the component of the BFV wave function corresponding to maximal (minimal) value of number of ghosts and antighosts in the Schrodinger representation may be viewed as a wave function in the refined algebraic (Dirac) quantization approach. The Giulini-Marolf group averaging formula for the inner product in the refined algebraic quantization approach is obtained from the Batalin-Marnelius prescription for the BRST-BFV inner product, which should be generally modified due to topological problems. The considered prescription for the correspondence of states is observed to be applicable to the open-algebra case. The refined algebraic quantization approach is generalized then to the case of nontrivial structure functions. A simple example is discussed. The correspondence of observables for different quantization methods is also investigated.

Toward the classification of differential calculi on κ-Minkowski space and related field theories

NASA Astrophysics Data System (ADS)

Jurić, Tajron; Meljanac, Stjepan; Pikutić, Danijel; Štrajn, Rina

2015-07-01

Classification of differential forms on κ-Minkowski space, particularly, the classification of all bicovariant differential calculi of classical dimension is presented. By imposing super-Jacobi identities we derive all possible differential algebras compatible with the κ-Minkowski algebra for time-like, space-like and light-like deformations. Embedding into the super-Heisenberg algebra is constructed using non-commutative (NC) coordinates and one-forms. Particularly, a class of differential calculi with an undeformed exterior derivative and one-forms is considered. Corresponding NC differential calculi are elaborated. Related class of new Drinfeld twists is proposed. It contains twist leading to κ-Poincaré Hopf algebra for light-like deformation. Corresponding super-algebra and deformed super-Hopf algebras, as well as the symmetries of differential algebras are presented and elaborated. Using the NC differential calculus, we analyze NC field theory, modified dispersion relations, and discuss further physical applications.

Eighth Grade Algebra Placement Policies: Promoting Equity, Achievement, and Access

ERIC Educational Resources Information Center

Wambsgans, Cynthia

2014-01-01

This study was an investigation of a standardized 8th grade Algebra I placement policy across multiple educational districts. Researchers have documented benefits of students' 8th grade Algebra I education, while others have detailed the consequences of algebra enrollment without necessary prerequisite skills. The purpose of this study was to…

Designing Virtual Worlds for Use in Mathematics Education: The Example of Experiential Algebra.

ERIC Educational Resources Information Center

Winn, William; Bricken, William

1992-01-01

Discussion of the use of virtual reality (VR) to help students learn highlights the use of VR with elementary algebra. Learning theory is examined, including knowledge construction; knowledge representation is discussed, including the symbol systems of algebra; and spatial algebra is described and illustrated. (34 references) (LRW)

Meanings Given to Algebraic Symbolism in Problem-Posing

ERIC Educational Resources Information Center

Cañadas, María C.; Molina, Marta; del Río, Aurora

2018-01-01

Some errors in the learning of algebra suggest that students might have difficulties giving meaning to algebraic symbolism. In this paper, we use problem posing to analyze the students' capacity to assign meaning to algebraic symbolism and the difficulties that students encounter in this process, depending on the characteristics of the algebraic…

Build an Early Foundation for Algebra Success

ERIC Educational Resources Information Center

Knuth, Eric; Stephens, Ana; Blanton, Maria; Gardiner, Angela

2016-01-01

Research tells us that success in algebra is a factor in many other important student outcomes. Emerging research also suggests that students who are started on an algebra curriculum in the earlier grades may have greater success in the subject in secondary school. What's needed is a consistent, algebra-infused mathematics curriculum all…

A Balancing Act: Making Sense of Algebra

ERIC Educational Resources Information Center

Gavin, M. Katherine; Sheffield, Linda Jensen

2015-01-01

For most students, algebra seems like a totally different subject than the number topics they studied in elementary school. In reality, the procedures followed in arithmetic are actually based on the properties and laws of algebra. Algebra should be a logical next step for students in extending the proficiencies they developed with number topics…

Unifying the Algebra for All Movement

ERIC Educational Resources Information Center

Eddy, Colleen M.; Quebec Fuentes, Sarah; Ward, Elizabeth K.; Parker, Yolanda A.; Cooper, Sandi; Jasper, William A.; Mallam, Winifred A.; Sorto, M. Alejandra; Wilkerson, Trena L.

2015-01-01

There exists an increased focus on school mathematics, especially first-year algebra, due to recent efforts for all students to be college and career ready. In addition, there are calls, policies, and legislation advocating for all students to study algebra epitomized by four rationales of the "Algebra for All" movement. In light of this…

A Meta-Analysis of Algebra Interventions for Learners with Disabilities and Struggling Learners

ERIC Educational Resources Information Center

Hughes, Elizabeth M.; Witzel, Bradley S.; Riccomini, Paul J.; Fries, Karen M.; Kanyongo, Gibbs Y.

2014-01-01

The need for global competence in mathematics is apparent. Algebra is considered a gateway course to prepare students for the demands of a competitive global market. Many students demonstrate low performance in algebra; this is especially true for students with disabilities. Effective algebra instruction is essential to increase algebra…

Effectiveness of Cognitive Tutor Algebra I at Scale

ERIC Educational Resources Information Center

Pane, John F.; Griffin, Beth Ann; McCaffrey, Daniel F.; Karam, Rita

2014-01-01

This article examines the effectiveness of a technology-based algebra curriculum in a wide variety of middle schools and high schools in seven states. Participating schools were matched into similar pairs and randomly assigned to either continue with the current algebra curriculum for 2 years or to adopt Cognitive Tutor Algebra I (CTAI), which…

Using Linguistics in the Teaching of Developmental and Remedial Algebra.

ERIC Educational Resources Information Center

Lesnak, Richard J.

Basic algebra at Robert Morris College (RMC) in Pittsburgh, Pennsylvania, is a remedial course for students with virtually no algebra background, and for students whose previous experiences with algebra have created math blocks and math anxiety. A study was conducted in an effort to measure quantitatively the benefits of using linguistic methods…

How Middle Grade Teachers Think about Algebraic Reasoning

ERIC Educational Resources Information Center

Glassmeyer, David; Edwards, Belinda

2016-01-01

Algebraic reasoning is an essential habit of mind for building conceptual knowledge in K-12 mathematics, yet little is known about how middle school mathematics teachers think about algebraic reasoning. In this article we describe a research project examining how algebraic reasoning was considered by grades 6, 7, or 8 mathematics teachers in a…

Assessing Elementary Algebra with STACK

ERIC Educational Resources Information Center

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…

Students’ Algebraic Reasonsing In Solving Mathematical Problems With Adversity Quotient

NASA Astrophysics Data System (ADS)

Aryani, F.; Amin, S. M.; Sulaiman, R.

2018-01-01

Algebraic reasoning is a process in which students generalize mathematical ideas from a set of particular instances and express them in increasingly formal and age-appropriate ways. Using problem solving approach to develop algebraic reasoning of mathematics may enhace the long-term learning trajectory of the majority students. The purpose of this research was to describe the algebraic reasoning of quitter, camper, and climber junior high school students in solving mathematical problems. This research used qualitative descriptive method. Subjects were determined by purposive sampling. The technique of collecting data was done by task-based interviews.The results showed that the algebraic reasoning of three students in the process of pattern seeking by identifying the things that are known and asked in a similar way. But three students found the elements of pattern recognition in different ways or method. So, they are generalize the problem of pattern formation with different ways. The study of algebraic reasoning and problem solving can be a learning paradigm in the improve students’ knowledge and skills in algebra work. The goal is to help students’ improve academic competence, develop algebraic reasoning in problem solving.

Asymptotic symmetries of Rindler space at the horizon and null infinity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chung, Hyeyoun

2010-08-15

We investigate the asymptotic symmetries of Rindler space at null infinity and at the event horizon using both systematic and ad hoc methods. We find that the approaches that yield infinite-dimensional asymptotic symmetry algebras in the case of anti-de Sitter and flat spaces only give a finite-dimensional algebra for Rindler space at null infinity. We calculate the charges corresponding to these symmetries and confirm that they are finite, conserved, and integrable, and that the algebra of charges gives a representation of the asymptotic symmetry algebra. We also use relaxed boundary conditions to find infinite-dimensional asymptotic symmetry algebras for Rindler spacemore » at null infinity and at the event horizon. We compute the charges corresponding to these symmetries and confirm that they are finite and integrable. We also determine sufficient conditions for the charges to be conserved on-shell, and for the charge algebra to give a representation of the asymptotic symmetry algebra. In all cases, we find that the central extension of the charge algebra is trivial.« less

The Dixmier Map for Nilpotent Super Lie Algebras

NASA Astrophysics Data System (ADS)

Herscovich, Estanislao

2012-07-01

In this article we prove that there exists a Dixmier map for nilpotent super Lie algebras. In other words, if we denote by {Prim({U}({g}))} the set of (graded) primitive ideals of the enveloping algebra {{U}({g})} of a nilpotent Lie superalgebra {{g}} and {{A}d0} the adjoint group of {{g}0}, we prove that the usual Dixmier map for nilpotent Lie algebras can be naturally extended to the context of nilpotent super Lie algebras, i.e. there exists a bijective map I : {g}0^{*}/{A}d0 rightarrow Prim({U}({g})) defined by sending the equivalence class [ λ] of a functional λ to a primitive ideal I( λ) of {{U}({g})}, and which coincides with the Dixmier map in the case of nilpotent Lie algebras. Moreover, the construction of the previous map is explicit, and more or less parallel to the one for Lie algebras, a major difference with a previous approach ( cf. [18]). One key fact in the construction is the existence of polarizations for super Lie algebras, generalizing the concept defined for Lie algebras. As a corollary of the previous description, we obtain the isomorphism {{U}({g})/I(λ) ˜eq Cliffq(k) ⊗ Ap(k)}, where {(p,q) = (dim({g}0/{g}0^{λ})/2,dim({g}1/{g}1^{λ}))}, we get a direct construction of the maximal ideals of the underlying algebra of {{U}({g})} and also some properties of the stabilizers of the primitive ideals of {{U}({g})}.

Priority in Process Algebras

NASA Technical Reports Server (NTRS)

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.

Intermediate grouping on remotely sensed data using Gestalt algebra

NASA Astrophysics Data System (ADS)

Michaelsen, Eckart

2014-10-01

Human observers often achieve striking recognition performance on remotely sensed data unmatched by machine vision algorithms. This holds even for thermal images (IR) or synthetic aperture radar (SAR). Psychologists refer to these capabilities as Gestalt perceptive skills. Gestalt Algebra is a mathematical structure recently proposed for such laws of perceptual grouping. It gives operations for mirror symmetry, continuation in rows and rotational symmetric patterns. Each of these operations forms an aggregate-Gestalt of a tuple of part-Gestalten. Each Gestalt is attributed with a position, an orientation, a rotational frequency, a scale, and an assessment respectively. Any Gestalt can be combined with any other Gestalt using any of the three operations. Most often the assessment of the new aggregate-Gestalt will be close to zero. Only if the part-Gestalten perfectly fit into the desired pattern the new aggregate-Gestalt will be assessed with value one. The algebra is suitable in both directions: It may render an organized symmetric mandala using random numbers. Or it may recognize deep hidden visual relationships between meaningful parts of a picture. For the latter primitives must be obtained from the image by some key-point detector and a threshold. Intelligent search strategies are required for this search in the combinatorial space of possible Gestalt Algebra terms. Exemplarily, maximal assessed Gestalten found in selected aerial images as well as in IR and SAR images are presented.

Automatic Blocking Of QR and LU Factorizations for Locality

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yi, Q; Kennedy, K; You, H

2004-03-26

QR and LU factorizations for dense matrices are important linear algebra computations that are widely used in scientific applications. To efficiently perform these computations on modern computers, the factorization algorithms need to be blocked when operating on large matrices to effectively exploit the deep cache hierarchy prevalent in today's computer memory systems. Because both QR (based on Householder transformations) and LU factorization algorithms contain complex loop structures, few compilers can fully automate the blocking of these algorithms. Though linear algebra libraries such as LAPACK provides manually blocked implementations of these algorithms, by automatically generating blocked versions of the computations, moremore » benefit can be gained such as automatic adaptation of different blocking strategies. This paper demonstrates how to apply an aggressive loop transformation technique, dependence hoisting, to produce efficient blockings for both QR and LU with partial pivoting. We present different blocking strategies that can be generated by our optimizer and compare the performance of auto-blocked versions with manually tuned versions in LAPACK, both using reference BLAS, ATLAS BLAS and native BLAS specially tuned for the underlying machine architectures.« less

Attributions for Success and Failure in Algebra of Samoan Community College Students: A Profile Analysis.

ERIC Educational Resources Information Center

Powers, Stephen; And Others

Sex differences in attributions for success and failure in algebra of Samoan community college students were examined and compared with attributions of a large group of mainland U.S. students. study included the Mathematics Attribution Scale: Algebra Version (MAS), which assessed students' attributions of achievement in algebra to their effort,…

Using CRA to Teach Algebra to Students with Math Difficulties in Inclusive Settings

ERIC Educational Resources Information Center

Witzel, Bradley S.

2005-01-01

The importance of algebra instruction has increased in the United States in the past few years. Thus, in most states, middle school students are required to take Algebra 1. Middle school students with math difficulties in inclusion algebra settings may require a different instructional approach. The purpose of this research was to compare student…

Learning to Apply Algebra in the Community for Adults with Intellectual Developmental Disabilities

ERIC Educational Resources Information Center

Rodriguez, Anthony M.

2016-01-01

Students with intellectual and developmental disabilities (IDD) are routinely excluded from algebra and other high-level mathematics courses. High school students with IDD take courses in arithmetic and life skills rather than having an opportunity to learn algebra. Yet algebra skills can support the learning of money and budgeting skills. This…

Capitalizing on Basic Brain Processes in Developmental Algebra--Part 2

ERIC Educational Resources Information Center

Laughbaum, Edward D.

2011-01-01

Basic brain function is not a mystery. Given that neuroscientists understand its basic functioning processes, one wonders what their research suggests to teachers of developmental algebra. What if we knew how to teach so as to improve understanding of the algebra taught to developmental algebra students? What if we knew how the brain processes…

Capitalizing on Basic Brain Processes in Developmental Algebra--Part One

ERIC Educational Resources Information Center

Laughbaum, Edward D.

2011-01-01

Basic brain function is not a mystery. Given that neuroscientists understand the brain's basic functioning processes, one wonders what their research suggests to teachers of developmental algebra. What if we knew how to teach so as to improve understanding of the algebra taught to developmental algebra students? What if we knew how the brain…

Reinventing Fractions and Division as They Are Used in Algebra: The Power of Preformal Productions

ERIC Educational Resources Information Center

Peck, Frederick; Matassa, Michael

2016-01-01

In this paper, we explore algebra students' mathematical realities around fractions and division, and the ways in which students reinvented mathematical productions involving fractions and division. We find that algebra students' initial realities do not include the fraction-as-quotient sub-construct. This can be problematic because in algebra,…

The Development of Children's Algebraic Thinking: The Impact of a Comprehensive Early Algebra Intervention in Third Grade

ERIC Educational Resources Information Center

Blanton, Maria; Stephens, Ana; Knuth, Eric; Gardiner, Angela Murphy; Isler, Isil; Kim, Jee-Seon

2015-01-01

This article reports results from a study investigating the impact of a sustained, comprehensive early algebra intervention in third grade. Participants included 106 students; 39 received the early algebra intervention, and 67 received their district's regularly planned mathematics instruction. We share and discuss students' responses to a written…

Algebra? A Gate! A Barrier! A Mystery!

ERIC Educational Resources Information Center

Mathematics Educatio Dialogues, 2000

2000-01-01

This issue of Mathematics Education Dialogues focuses on the nature and the role of algebra in the K-14 curriculum. Articles on this theme include: (1) "Algebra For All? Why?" (Nel Noddings); (2) "Algebra For All: It's a Matter of Equity, Expectations, and Effectiveness" (Dorothy S. Strong and Nell B. Cobb); (3) "Don't Delay: Build and Talk about…

Introducing Algebraic Structures through Solving Equations: Vertical Content Knowledge for K-12 Mathematics Teachers

ERIC Educational Resources Information Center

Wasserman, Nicholas H.

2014-01-01

Algebraic structures are a necessary aspect of algebraic thinking for K-12 students and teachers. An approach for introducing the algebraic structure of groups and fields through the arithmetic properties required for solving simple equations is summarized; the collective (not individual) importance of these axioms as a foundation for algebraic…

The State of the Gate: A Description of Instructional Practice in Algebra in Five Urban Districts

ERIC Educational Resources Information Center

Litke, Erica G.

2015-01-01

Algebra is considered a linchpin for success in secondary mathematics, serving as a gatekeeper to higher-level courses. Access to algebra is also considered an important lever for educational equity. Yet despite its prominence, large-scale examinations of algebra instruction are rare. In my dissertation, I endeavor to better understand what…

Relationships between Classroom Schedule Types and Performance on the Algebra I Criterion-Referenced Test

ERIC Educational Resources Information Center

Murray, Gregory V.; Moyer-Packenham, Patricia S.

2014-01-01

One option for length of individual mathematics class periods is the schedule type selected for Algebra I classes. This study examined the relationship between student achievement, as indicated by Algebra I Criterion-Referenced Test scores, and the schedule type for Algebra I classes. Data obtained from the Utah State Office of Education included…

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

ERIC Educational Resources Information Center

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…

The Ideas of Algebra, K-12. 1988 Yearbook.

ERIC Educational Resources Information Center

Coxford, Arthur F., Ed.; Shulte, Albert P., Ed.

This volume is organized into six parts. Chapters 1-5, which make up Part 1, first discuss the forces impinging on algebra in the curriculum and suggest possible directions for change. Chapters 6-8, Part 2, concentrate on concepts and teaching possibilities available prior to the formal introduction of algebra. The notion that algebraic ideas are…

Solving the Unknown with Algebra: Poster/Teaching Guide for Pre-Algebra Students. Expect the Unexpected with Math[R

ERIC Educational Resources Information Center

Actuarial Foundation, 2013

2013-01-01

"Solving the Unknown with Algebra" is a new math program aligned with the National Council of Teachers of Mathematics (NCTM) standards and designed to help students practice pre-algebra skills including using formulas, solving for unknowns, and manipulating equations. Developed by The Actuarial Foundation with Scholastic, this program provides…

Developing "Algebraic Thinking": Two Key Ways to Establish Some Early Algebraic Ideas in Primary Classrooms

ERIC Educational Resources Information Center

Ormond, Christine

2012-01-01

Primary teachers play a key role in their students' future mathematical success in the early secondary years. While the word "algebra" may make some primary teachers feel uncomfortable or worried, the basic arithmetic ideas underlying algebra are vitally important for older primary students as they are increasingly required to use "algebraic…

Investigating Students' Modes of Thinking in Linear Algebra: The Case of Linear Independence

ERIC Educational Resources Information Center

Çelik, Derya

2015-01-01

Linear algebra is one of the most challenging topics to learn and teach in many countries. To facilitate the teaching and learning of linear algebra, priority should be given to epistemologically analyze the concepts that the undergraduate students have difficulty in conceptualizing and to define their ways of reasoning in linear algebra. After…

Exploring Teacher Noticing of Student Algebraic Thinking in a Video Club

ERIC Educational Resources Information Center

Walkoe, Janet

2015-01-01

Learning algebra is critical for students in the USA today, yet many students in the USA struggle in algebra classes. Researchers claim that one reason for these difficulties is that algebra classes often focus on symbol manipulation and procedures above, and many times at the expense of, a more conceptual understanding of the content. Teaching…

Algebra and Algebraic Thinking in School Math: 70th YB

ERIC Educational Resources Information Center

National Council of Teachers of Mathematics, 2008

2008-01-01

Algebra is no longer just for college-bound students. After a widespread push by the National Council of Teachers of Mathematics (NCTM) and teachers across the country, algebra is now a required part of most curricula. However, students' standardized test scores are not at the level they should be. NCTM's seventieth yearbook takes a look at the…

Matematica Para La Escuela Secundaria, Primer Curso de Algebra (Parte 2), Comentario. Traduccion Preliminar de la Edicion en Ingles Revisada. (Mathematics for High School, First Course in Algebra, Part 2, Teacher's Commentary. Preliminary Translation of the Revised English Edition).

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

This is the teacher's commentary for part two of a three-part SMSG algebra text for high school students. The principal objective of the text is to help the student develop an understanding and appreciation of some of the algebraic structure as a basis for the techniques of algebra. Chapter topics include addition and multiplication of real…

Quantum superintegrable system with a novel chain structure of quadratic algebras

NASA Astrophysics Data System (ADS)

Liao, Yidong; Marquette, Ian; Zhang, Yao-Zhong

2018-06-01

We analyse the n-dimensional superintegrable Kepler–Coulomb system with non-central terms. We find a novel underlying chain structure of quadratic algebras formed by the integrals of motion. We identify the elements for each sub-structure and obtain the algebra relations satisfied by them and the corresponding Casimir operators. These quadratic sub-algebras are realized in terms of a chain of deformed oscillators with factorized structure functions. We construct the finite-dimensional unitary representations of the deformed oscillators, and give an algebraic derivation of the energy spectrum of the superintegrable system.

Literal algebra for satellite dynamics. [perturbation analysis

NASA Technical Reports Server (NTRS)

Gaposchkin, E. M.

1975-01-01

A description of the rather general class of operations available is given and the operations are related to problems in satellite dynamics. The implementation of an algebra processor is discussed. The four main categories of symbol processors are related to list processing, string manipulation, symbol manipulation, and formula manipulation. Fundamental required operations for an algebra processor are considered. It is pointed out that algebra programs have been used for a number of problems in celestial mechanics with great success. The advantage of computer algebra is its accuracy and speed.

Contractions from grading

NASA Astrophysics Data System (ADS)

Krishnan, Chethan; Raju, Avinash

2018-04-01

We note that large classes of contractions of algebras that arise in physics can be understood purely algebraically via identifying appropriate Zm-gradings (and their generalizations) on the parent algebra. This includes various types of flat space/Carroll limits of finite and infinite dimensional (A)dS algebras, as well as Galilean and Galilean conformal algebras. Our observations can be regarded as providing a natural context for the Grassmann approach of Krishnan et al. [J. High Energy Phys. 2014(3), 36]. We also introduce a related notion, which we call partial grading, that arises naturally in this context.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mozrzymas, Marek; Horodecki, Michał; Studziński, Michał

We consider the structure of algebra of operators, acting in n-fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its regular representation, we derive basic properties of the algebra. In particular, we describe all irreducible representations of the algebra of partially transposed operators and derive expressions for matrix elements of the representations. It appears that there are two kinds of irreducible representations of the algebra. The first one is strictly connected with the representations of the group S(n − 1) induced by irreduciblemore » representations of the group S(n − 2). The second kind is structurally connected with irreducible representations of the group S(n − 1)« less

Remainder Wheels and Group Theory

ERIC Educational Resources Information Center

Brenton, Lawrence

2008-01-01

Why should prospective elementary and high school teachers study group theory in college? This paper examines applications of abstract algebra to the familiar algorithm for converting fractions to repeating decimals, revealing ideas of surprising substance beneath an innocent facade.

An effective automatic procedure for testing parameter identifiability of HIV/AIDS models.

PubMed

Saccomani, Maria Pia

2011-08-01

Realistic HIV models tend to be rather complex and many recent models proposed in the literature could not yet be analyzed by traditional identifiability testing techniques. In this paper, we check a priori global identifiability of some of these nonlinear HIV models taken from the recent literature, by using a differential algebra algorithm based on previous work of the author. The algorithm is implemented in a software tool, called DAISY (Differential Algebra for Identifiability of SYstems), which has been recently released (DAISY is freely available on the web site http://www.dei.unipd.it/~pia/ ). The software can be used to automatically check global identifiability of (linear and) nonlinear models described by polynomial or rational differential equations, thus providing a general and reliable tool to test global identifiability of several HIV models proposed in the literature. It can be used by researchers with a minimum of mathematical background.

Layout optimization with algebraic multigrid methods

NASA Technical Reports Server (NTRS)

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.

Versatile and declarative dynamic programming using pair algebras.

PubMed

Steffen, Peter; Giegerich, Robert

2005-09-12

Dynamic programming is a widely used programming technique in bioinformatics. In sharp contrast to the simplicity of textbook examples, implementing a dynamic programming algorithm for a novel and non-trivial application is a tedious and error prone task. The algebraic dynamic programming approach seeks to alleviate this situation by clearly separating the dynamic programming recurrences and scoring schemes. Based on this programming style, we introduce a generic product operation of scoring schemes. This leads to a remarkable variety of applications, allowing us to achieve optimizations under multiple objective functions, alternative solutions and backtracing, holistic search space analysis, ambiguity checking, and more, without additional programming effort. We demonstrate the method on several applications for RNA secondary structure prediction. The product operation as introduced here adds a significant amount of flexibility to dynamic programming. It provides a versatile testbed for the development of new algorithmic ideas, which can immediately be put to practice.

On iterative processes in the Krylov-Sonneveld subspaces

NASA Astrophysics Data System (ADS)

Ilin, Valery P.

2016-10-01

The iterative Induced Dimension Reduction (IDR) methods are considered for solving large systems of linear algebraic equations (SLAEs) with nonsingular nonsymmetric matrices. These approaches are investigated by many authors and are charachterized sometimes as the alternative to the classical processes of Krylov type. The key moments of the IDR algorithms consist in the construction of the embedded Sonneveld subspaces, which have the decreasing dimensions and use the orthogonalization to some fixed subspace. Other independent approaches for research and optimization of the iterations are based on the augmented and modified Krylov subspaces by using the aggregation and deflation procedures with present various low rank approximations of the original matrices. The goal of this paper is to show, that IDR method in Sonneveld subspaces present an original interpretation of the modified algorithms in the Krylov subspaces. In particular, such description is given for the multi-preconditioned semi-conjugate direction methods which are actual for the parallel algebraic domain decomposition approaches.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luszczek, Piotr R; Tomov, Stanimire Z; Dongarra, Jack J

We present an efficient and scalable programming model for the development of linear algebra in heterogeneous multi-coprocessor environments. The model incorporates some of the current best design and implementation practices for the heterogeneous acceleration of dense linear algebra (DLA). Examples are given as the basis for solving linear systems' algorithms - the LU, QR, and Cholesky factorizations. To generate the extreme level of parallelism needed for the efficient use of coprocessors, algorithms of interest are redesigned and then split into well-chosen computational tasks. The tasks execution is scheduled over the computational components of a hybrid system of multi-core CPUs andmore » coprocessors using a light-weight runtime system. The use of lightweight runtime systems keeps scheduling overhead low, while enabling the expression of parallelism through otherwise sequential code. This simplifies the development efforts and allows the exploration of the unique strengths of the various hardware components.« less

Systems with outer constraints. Gupta-Bleuler electromagnetism as an algebraic field theory

NASA Astrophysics Data System (ADS)

Grundling, Hendrik

1988-03-01

Since there are some important systems which have constraints not contained in their field algebras, we develop here in a C*-context the algebraic structures of these. The constraints are defined as a group G acting as outer automorphisms on the field algebra ℱ, α: G ↦ Aut ℱ, α G ⊄ Inn ℱ, and we find that the selection of G-invariant states on ℱ is the same as the selection of states ω on M( G M(Gmathop × limits_α F) ℱ) by ω( U g)=1∨ g∈ G, where U g ∈ M ( G M(Gmathop × limits_α F) ℱ)/ℱ are the canonical elements implementing α g . These states are taken as the physical states, and this specifies the resulting algebraic structure of the physics in M( G M(Gmathop × limits_α F) ℱ), and in particular the maximal constraint free physical algebra ℛ. A nontriviality condition is given for ℛ to exist, and we extend the notion of a crossed product to deal with a situation where G is not locally compact. This is necessary to deal with the field theoretical aspect of the constraints. Next the C*-algebra of the CCR is employed to define the abstract algebraic structure of Gupta-Bleuler electromagnetism in the present framework. The indefinite inner product representation structure is obtained, and this puts Gupta-Bleuler electromagnetism on a rigorous footing. Finally, as a bonus, we find that the algebraic structures just set up, provide a blueprint for constructive quadratic algebraic field theory.

Developing Meaning for Algebraic Procedures: An Exploration of the Connections Undergraduate Students Make between Algebraic Rational Expressions and Basic Number Properties

ERIC Educational Resources Information Center

Yantz, Jennifer

2013-01-01

The attainment and retention of later algebra skills in high school has been identified as a factor significantly impacting the postsecondary success of students majoring in STEM fields. Researchers maintain that learners develop meaning for algebraic procedures by forming connections to the basic number system properties. The present study…

Curricula Alignment and Its Impact on End of Course Assessment Scores

ERIC Educational Resources Information Center

Burti, Neil, Jr.

2011-01-01

The purpose of this mixed methods study was to examine the alignment of the written, enacted, and tested Algebra I curricula in the Cherry Hill (NJ) Public School District. Furthermore, this QUAN-QUAL study sought to determine the impact of course selection (Algebra I, Enriched Algebra) on achievement as measured by the Algebra I End of Course…

The Impact of New State Accountability Standards on Algebra I Students

ERIC Educational Resources Information Center

Heath, Kyle G.

2013-01-01

The purpose of this quasi-experimental quantitative study was to determine if a new Algebra I curriculum resulted in improved student performance on the state Algebra I exam. The treatment group consisted of 383 9th grade Algebra I students who received the college-ready standards-based (CRSB) curricula. The control group consisted of 338 9th…

From No to Yes: The Impact of an Intervention on The Persistence of Algebraic Misconceptions among Secondary School Algebra Students

ERIC Educational Resources Information Center

Zielinski, Susan F.

2017-01-01

Many students enter high school with persistent algebraic misconceptions that limit their success in mathematics and, by extension, limit potential educational attainment and future earnings. The purpose of this study was to assess the effectiveness of a warm conceptual change based intervention on remediating algebraic misconceptions held by…

Card Games and Algebra Tic Tacmatics on Achievement of Junior Secondary II Students in Algebraic Expressions

ERIC Educational Resources Information Center

Okpube, Nnaemeka Michael; Anugwo, M. N.

2016-01-01

This study investigated the Card Games and Algebra tic-Tacmatics on Junior Secondary II Students' Achievement in Algebraic Expressions. Three research questions and three null hypotheses guided the study. The study adopted the pre-test, post-test control group design. A total of two hundred and forty (240) Junior Secondary School II students were…

A Study of Improving Eighth Graders' Learning Deficiency in Algebra by Applying a Realistic Context Instructional Design

ERIC Educational Resources Information Center

Chang, Yu-Liang; Huang, Yu-I

2014-01-01

The intention of this study was to improve the learning deficiency in algebraic learning and to enhance Taiwanese middle students' learning achievement and interest in algebra. By using a grade skipping experimental design, the research team intended to find out an effective way to benefit these students' leaning in abstract algebraic concepts.…

Effects of Comparison and Game-Challenge on Sixth Graders' Algebra Variable Learning Achievement, Learning Attitude, and Meta-Cognitive Awareness

ERIC Educational Resources Information Center

Sun Lin, Hong-Zheng; Chiou, Guey-Fa

2017-01-01

This study examined the effects of comparison and game-challenge strategies on sixth graders' learning achievement of algebra variable, learning attitude towards algebra variable learning, and meta-cognitive awareness of algebra variable learning. A 2 × 2 factorial design was used, and 86 students were invited to participate in the experimental…

Middle School Math Acceleration and Equitable Access to Eighth-Grade Algebra: Evidence from the Wake County Public School System

ERIC Educational Resources Information Center

Dougherty, Shaun M.; Goodman, Joshua S.; Hill, Darryl V.; Litke, Erica G.; Page, Lindsay C.

2015-01-01

Taking algebra by eighth grade is considered an important milestone on the pathway to college readiness. We highlight a collaboration to investigate one district's effort to increase middle school algebra course-taking. In 2010, the Wake County Public Schools began assigning middle school students to accelerated math and eighth-grade algebra based…

It's a Wonderful Life: Using Public Domain Cinema Clips To Teach Affective Objectives and Illustrate Real-World Algebra Applications.

ERIC Educational Resources Information Center

Palmer, Loretta

A basic algebra unit was developed at Utah Valley State College to emphasize applications of mathematical concepts in the work world, using video and computer-generated graphics to integrate textual material. The course was implemented in three introductory algebra sections involving 80 students and taught algebraic concepts using such areas as…

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

ERIC Educational Resources Information Center

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…

Assessing non-uniqueness: An algebraic approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vasco, Don W.

Geophysical inverse problems are endowed with a rich mathematical structure. When discretized, most differential and integral equations of interest are algebraic (polynomial) in form. Techniques from algebraic geometry and computational algebra provide a means to address questions of existence and uniqueness for both linear and non-linear inverse problem. In a sense, the methods extend ideas which have proven fruitful in treating linear inverse problems.

Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students. Educator's Practice Guide. What Works Clearinghouse.™ NCEE 2015-4010

ERIC Educational Resources Information Center

Star, Jon R.; Foegen, Anne; Larson, Matthew R.; McCallum, William G.; Porath, Jane; Zbiek, Rose Mary; Caronongan, Pia; Furgeson, Joshua,; Keating, Betsy; Lyskawa, Julia

2015-01-01

Mastering algebra is important for future math and postsecondary success. Educators will find practical recommendations for how to improve algebra instruction in the What Works Clearinghouse (WWC) practice guide, "Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students". The methods and examples included in…

Students’ Algebraic Thinking Process in Context of Point and Line Properties

NASA Astrophysics Data System (ADS)

Nurrahmi, H.; Suryadi, D.; Fatimah, S.

2017-09-01

Learning of schools algebra is limited to symbols and operating procedures, so students are able to work on problems that only require the ability to operate symbols but unable to generalize a pattern as one of part of algebraic thinking. The purpose of this study is to create a didactic design that facilitates students to do algebraic thinking process through the generalization of patterns, especially in the context of the property of point and line. This study used qualitative method and includes Didactical Design Research (DDR). The result is students are able to make factual, contextual, and symbolic generalization. This happen because the generalization arises based on facts on local terms, then the generalization produced an algebraic formula that was described in the context and perspective of each student. After that, the formula uses the algebraic letter symbol from the symbol t hat uses the students’ language. It can be concluded that the design has facilitated students to do algebraic thinking process through the generalization of patterns, especially in the context of property of the point and line. The impact of this study is this design can use as one of material teaching alternative in learning of school algebra.

A Geometric Construction of Cyclic Cocycles on Twisted Convolution Algebras

NASA Astrophysics Data System (ADS)

Angel, Eitan

2010-09-01

In this thesis we give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. In his seminal book, Connes constructs a map from the equivariant cohomology of a manifold carrying the action of a discrete group into the periodic cyclic cohomology of the associated convolution algebra. Furthermore, for proper étale groupoids, J.-L. Tu and P. Xu provide a map between the periodic cyclic cohomology of a gerbe twisted convolution algebra and twisted cohomology groups. Our focus will be the convolution algebra with a product defined by a gerbe over a discrete translation groupoid. When the action is not proper, we cannot construct an invariant connection on the gerbe; therefore to study this algebra, we instead develop simplicial notions related to ideas of J. Dupont to construct a simplicial form representing the Dixmier-Douady class of the gerbe. Then by using a JLO formula we define a morphism from a simplicial complex twisted by this simplicial Dixmier-Douady form to the mixed bicomplex of certain matrix algebras. Finally, we define a morphism from this complex to the mixed bicomplex computing the periodic cyclic cohomology of the twisted convolution algebras.

Eighth Grade Algebra Course Placement and Student Motivation for Mathematics

PubMed Central

Simzar, Rahila M.; Domina, Thurston; Tran, Cathy

2016-01-01

This study uses student panel data to examine the association between Algebra placement and student motivation for mathematics. Changes in achievement goals, expectancy, and task value for students in eighth grade Algebra are compared with those of peers placed in lower-level mathematics courses (N = 3,306). In our sample, students placed in Algebra reported an increase in performance-avoidance goals as well as decreases in academic self-efficacy and task value. These relations were attenuated for students who had high mathematics achievement prior to Algebra placement. Whereas all students reported an overall decline in performance-approach goals over the course of eighth grade, previously high-achieving students reported an increase in these goals. Lastly, previously high-achieving students reported an increase in mastery goals. These findings suggest that while previously high-achieving students may benefit motivationally from eighth grade Algebra placement, placing previously average- and low-performing students in Algebra can potentially undermine their motivation for mathematics. PMID:26942210

On the homotopy equivalence of simple AI-algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aristov, O Yu

1999-02-28

Let A and B be simple unital AI-algebras (an AI-algebra is an inductive limit of C*-algebras of the form BigOplus{sub i}{sup k}C([0,1],M{sub N{sub i}}). It is proved that two arbitrary unital homomorphisms from A into B such that the corresponding maps K{sub 0}A{yields}K{sub 0}B coincide are homotopic. Necessary and sufficient conditions on the Elliott invariant for A and B to be homotopy equivalent are indicated. Moreover, two algebras in the above class having the same K-theory but not homotopy equivalent are constructed. A theorem on the homotopy of approximately unitarily equivalent homomorphisms between AI-algebras is used in the proof, whichmore » is deduced in its turn from a generalization to the case of AI-algebras of a theorem of Manuilov stating that a unitary matrix almost commuting with a self-adjoint matrix h can be joined to 1 by a continuous path consisting of unitary matrices almost commuting with h.« less

On the quantum symmetry of the chiral Ising model

NASA Astrophysics Data System (ADS)

Vecsernyés, Peter

1994-03-01

We introduce the notion of rational Hopf algebras that we think are able to describe the superselection symmetries of rational quantum field theories. As an example we show that a six-dimensional rational Hopf algebra H can reproduce the fusion rules, the conformal weights, the quantum dimensions and the representation of the modular group of the chiral Ising model. H plays the role of the global symmetry algebra of the chiral Ising model in the following sense: (1) a simple field algebra F and a representation π on Hπ of it is given, which contains the c = {1}/{2} unitary representations of the Virasoro algebra as subrepresentations; (2) the embedding U: H → B( Hπ) is such that the observable algebra π( A) - is the invariant subalgebra of B( Hπ) with respect to the left adjoint action of H and U(H) is the commutant of π( A); (3) there exist H-covariant primary fields in B( Hπ), which obey generalized Cuntz algebra properties and intertwine between the inequivalent sectors of the observables.

Non-associativity in non-geometric string and M-theory backgrounds, the algebra of octonions, and missing momentum modes

DOE PAGES

Günaydin, Murat; Lüst, Dieter; Malek, Emanuel

2016-11-07

We propose a non-associative phase space algebra for M-theory backgrounds with locally non-geometric fluxes based on the non-associative algebra of octonions. Our proposal is based on the observation that the non-associative algebra of the non-geometric R-flux background in string theory can be obtained by a proper contraction of the simple Malcev algebra generated by imaginary octonions. Furthermore, by studying a toy model of a four-dimensional locally non-geometric M-theory background which is dual to a twisted torus, we show that the non-geometric background is “missing” a momentum mode. The resulting seven-dimensional phase space can thus be naturally identified with the imaginarymore » octonions. This allows us to interpret the full uncontracted algebra of imaginary octonions as the uplift of the string theory R-flux algebra to M-theory, with the contraction parameter playing the role of the string coupling constant g s.« less

Non-associativity in non-geometric string and M-theory backgrounds, the algebra of octonions, and missing momentum modes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Günaydin, Murat; Lüst, Dieter; Malek, Emanuel

We propose a non-associative phase space algebra for M-theory backgrounds with locally non-geometric fluxes based on the non-associative algebra of octonions. Our proposal is based on the observation that the non-associative algebra of the non-geometric R-flux background in string theory can be obtained by a proper contraction of the simple Malcev algebra generated by imaginary octonions. Furthermore, by studying a toy model of a four-dimensional locally non-geometric M-theory background which is dual to a twisted torus, we show that the non-geometric background is “missing” a momentum mode. The resulting seven-dimensional phase space can thus be naturally identified with the imaginarymore » octonions. This allows us to interpret the full uncontracted algebra of imaginary octonions as the uplift of the string theory R-flux algebra to M-theory, with the contraction parameter playing the role of the string coupling constant g s.« less

Eighth Grade Algebra Course Placement and Student Motivation for Mathematics.

PubMed

Simzar, Rahila M; Domina, Thurston; Tran, Cathy

2016-01-01

This study uses student panel data to examine the association between Algebra placement and student motivation for mathematics. Changes in achievement goals, expectancy, and task value for students in eighth grade Algebra are compared with those of peers placed in lower-level mathematics courses (N = 3,306). In our sample, students placed in Algebra reported an increase in performance-avoidance goals as well as decreases in academic self-efficacy and task value. These relations were attenuated for students who had high mathematics achievement prior to Algebra placement. Whereas all students reported an overall decline in performance-approach goals over the course of eighth grade, previously high-achieving students reported an increase in these goals. Lastly, previously high-achieving students reported an increase in mastery goals. These findings suggest that while previously high-achieving students may benefit motivationally from eighth grade Algebra placement, placing previously average- and low-performing students in Algebra can potentially undermine their motivation for mathematics.

A natural history of mathematics: George Peacock and the making of English algebra.

PubMed

Lambert, Kevin

2013-06-01

In a series of papers read to the Cambridge Philosophical Society through the 1820s, the Cambridge mathematician George Peacock laid the foundation for a natural history of arithmetic that would tell a story of human progress from counting to modern arithmetic. The trajectory of that history, Peacock argued, established algebraic analysis as a form of universal reasoning that used empirically warranted operations of mind to think with symbols on paper. The science of counting would suggest arithmetic, arithmetic would suggest arithmetical algebra, and, finally, arithmetical algebra would suggest symbolic algebra. This philosophy of suggestion provided the foundation for Peacock's "principle of equivalent forms," which justified the practice of nineteenth-century English symbolic algebra. Peacock's philosophy of suggestion owed a considerable debt to the early Cambridge Philosophical Society culture of natural history. The aim of this essay is to show how that culture of natural history was constitutively significant to the practice of nineteenth-century English algebra.

Situating the Debate on "Geometrical Algebra" within the Framework of Premodern Algebra.

PubMed

Sialaros, Michalis; Christianidis, Jean

2016-06-01

Argument The aim of this paper is to employ the newly contextualized historiographical category of "premodern algebra" in order to revisit the arguably most controversial topic of the last decades in the field of Greek mathematics, namely the debate on "geometrical algebra." Within this framework, we shift focus from the discrepancy among the views expressed in the debate to some of the historiographical assumptions and methodological approaches that the opposing sides shared. Moreover, by using a series of propositions related to Elem. II.5 as a case study, we discuss Euclid's geometrical proofs, the so-called "semi-algebraic" alternative demonstrations attributed to Heron of Alexandria, as well as the solutions given by Diophantus, al-Sulamī, and al-Khwārizmī to the corresponding numerical problem. This comparative analysis offers a new reading of Heron's practice, highlights the significance of contextualizing "premodern algebra," and indicates that the origins of algebraic reasoning should be sought in the problem-solving practice, rather than in the theorem-proving tradition.

Simplification of multiple Fourier series - An example of algorithmic approach

NASA Technical Reports Server (NTRS)

Ng, E. W.

1981-01-01

This paper describes one example of multiple Fourier series which originate from a problem of spectral analysis of time series data. The example is exercised here with an algorithmic approach which can be generalized for other series manipulation on a computer. The generalized approach is presently pursued towards applications to a variety of multiple series and towards a general purpose algorithm for computer algebra implementation.

Implicit Plasma Kinetic Simulation Using The Jacobian-Free Newton-Krylov Method

NASA Astrophysics Data System (ADS)

Taitano, William; Knoll, Dana; Chacon, Luis

2009-11-01

The use of fully implicit time integration methods in kinetic simulation is still area of algorithmic research. A brute-force approach to simultaneously including the field equations and the particle distribution function would result in an intractable linear algebra problem. A number of algorithms have been put forward which rely on an extrapolation in time. They can be thought of as linearly implicit methods or one-step Newton methods. However, issues related to time accuracy of these methods still remain. We are pursuing a route to implicit plasma kinetic simulation which eliminates extrapolation, eliminates phase-space from the linear algebra problem, and converges the entire nonlinear system within a time step. We accomplish all this using the Jacobian-Free Newton-Krylov algorithm. The original research along these lines considered particle methods to advance the distribution function [1]. In the current research we are advancing the Vlasov equations on a grid. Results will be presented which highlight algorithmic details for single species electrostatic problems and coupled ion-electron electrostatic problems. [4pt] [1] H. J. Kim, L. Chac'on, G. Lapenta, ``Fully implicit particle in cell algorithm,'' 47th Annual Meeting of the Division of Plasma Physics, Oct. 24-28, 2005, Denver, CO

Visualizing the inner product space ℝm×n in a MATLAB-assisted linear algebra classroom

NASA Astrophysics Data System (ADS)

Caglayan, Günhan

2018-05-01

This linear algebra note offers teaching and learning ideas in the treatment of the inner product space ? in a technology-supported learning environment. Classroom activities proposed in this note demonstrate creative ways of integrating MATLAB technology into various properties of Frobenius inner product as visualization tools that complement the algebraic approach. As implemented in linear algebra lessons in a university in the Unites States, the article also incorporates algebraic and visual work of students who experienced these activities with MATLAB software. The connection between the Frobenius norm and the Euclidean norm is also emphasized.

Spatial-Operator Algebra For Flexible-Link Manipulators

NASA Technical Reports Server (NTRS)

Jain, Abhinandan; Rodriguez, Guillermo

1994-01-01

Method of computing dynamics of multiple-flexible-link robotic manipulators based on spatial-operator algebra, which originally applied to rigid-link manipulators. Aspects of spatial-operator-algebra approach described in several previous articles in NASA Tech Briefs-most recently "Robot Control Based on Spatial-Operator Algebra" (NPO-17918). In extension of spatial-operator algebra to manipulators with flexible links, each link represented by finite-element model: mass of flexible link apportioned among smaller, lumped-mass rigid bodies, coupling of motions expressed in terms of vibrational modes. This leads to operator expression for modal-mass matrix of link.

Graph C ∗-algebras and Z2-quotients of quantum spheres

NASA Astrophysics Data System (ADS)

Hajac, Piotr M.; Matthes, Rainer; Szymański, Wojciech

2003-06-01

We consider two Z2-actions on the Podleś generic quantum spheres. They yield, as noncommutative quotient spaces, the Klimek-Lesmewski q-disc and the quantum real projective space, respectively. The C ∗-algebas of all these quantum spaces are described as graph C ∗-algebras. The K-groups of the thus presented C ∗-algebras are then easily determined from the general theory of graph C ∗-algebas. For the quantum real projective space, we also recall the classification of the classes of irreducible ∗-representations of its algebra and give a linear basis for this algebra.

Quiver elliptic W-algebras

NASA Astrophysics Data System (ADS)

Kimura, Taro; Pestun, Vasily

2018-06-01

We define elliptic generalization of W-algebras associated with arbitrary quiver using our construction (Kimura and Pestun in Quiver W-algebras, 2015. arXiv:1512.08533 [hep-th]) with six-dimensional gauge theory.

Hurwitz Algebras and the Octonion Algebra

NASA Astrophysics Data System (ADS)

Burdik, Čestmir; Catto, Sultan

2018-02-01

We explore some consequences of a theory of internal symmetries for elementary particles constructed on exceptional quantum mechanical spaces based on Jordan algebra formulation that admit exceptional groups as gauge groups.

Computer Program For Linear Algebra

NASA Technical Reports Server (NTRS)

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.

The effects of an integrated Algebra 1/physical science curriculum on student achievement in Algebra 1, proportional reasoning and graphing abilities

NASA Astrophysics Data System (ADS)

Lawrence, Lettie Carol

1997-08-01

The purpose of this investigation was to determine if an integrated curriculum in algebra 1/physical science facilitates acquisition of proportional reasoning and graphing abilities better than a non-integrated, traditional, algebra 1 curriculum. Also, this study was to ascertain if the integrated algebra 1/physical science curriculum resulted in greater student achievement in algebra 1. The curriculum used in the experimental class was SAM 9 (Science and Mathematics 9), an investigation-based curriculum that was written to integrate physical science and basic algebra content. The experiment was conducted over one school year. The subjects in the study were 61 ninth grade students. The experimental group consisted of one class taught concurrently by a mathematics teacher and a physical science teacher. The control group consisted of three classes of algebra 1 students taught by one mathematics teacher and taking physical science with other teachers in the school who were not participating in the SAM 9 program. This study utilized a quasi-experimental non-randomized control group pretest-posttest design. The investigator obtained end-of-algebra 1 scores from student records. The written open-ended graphing instruments and the proportional reasoning instrument were administered to both groups as pretests and posttests. The graphing instruments were also administered as a midtest. A two sample t-test for independent means was used to determine significant differences in achievement on the end-of-course algebra 1 test. Quantitative data from the proportional reasoning and graphing instruments were analyzed using a repeated measures analysis of variance to determine differences in scores over time for the experimental and control groups. The findings indicate no significant difference between the experimental and control groups on the end-of-course algebra 1 test. Results also indicate no significant differences in proportional reasoning and graphing abilities between the two groups over time. However, all subjects (experimental and control groups) made significant improvement in graphing abilities over one school year. In this study, students participating in an investigation-based curriculum integrating algebra 1 and physical science performed as well on the instruments as the students in the traditional curriculum. Therefore, an argument can be made that instruction using an integrated curriculum (algebra l/physical science) is a viable alternative to instruction using a more traditional algebra 1 curriculum. Finally, the integrated curriculum adheres to the constructivist theoretical perspective (Krupnik-Gotlieb, 1995) and is more consistent with recommendations in the NCTM Standards (1992) than the traditional curriculum.

Computing Principal Eigenvectors of Large Web Graphs: Algorithms and Accelerations Related to PageRank and HITS

ERIC Educational Resources Information Center

Nagasinghe, Iranga

2010-01-01

This thesis investigates and develops a few acceleration techniques for the search engine algorithms used in PageRank and HITS computations. PageRank and HITS methods are two highly successful applications of modern Linear Algebra in computer science and engineering. They constitute the essential technologies accounted for the immense growth and…

Tracking Problem Solving by Multivariate Pattern Analysis and Hidden Markov Model Algorithms

ERIC Educational Resources Information Center

Anderson, John R.

2012-01-01

Multivariate pattern analysis can be combined with Hidden Markov Model algorithms to track the second-by-second thinking as people solve complex problems. Two applications of this methodology are illustrated with a data set taken from children as they interacted with an intelligent tutoring system for algebra. The first "mind reading" application…

The Great Debate: Should All 8th Graders Take Algebra?

ERIC Educational Resources Information Center

McKibben, Sarah

2009-01-01

While 8th grade algebra was once reserved as a course for the gifted, today, more U.S. 8th graders take algebra than any other math course. This article discusses a report from the Brookings Institution which chronicles the history of the 8th-grade algebra surge and its impact on today's low-performing students. The report indicates that many of…

Characterizing the Nature of Students' Feature Noticing-and-Using with Respect to Mathematical Symbols across Different Levels of Algebra Exposure

ERIC Educational Resources Information Center

Sullivan, Patrick

2013-01-01

The purpose of this study is to examine the nature of what students notice about symbols and use as they solve unfamiliar algebra problems based on familiar algebra concepts and involving symbolic inscriptions. The researcher conducted a study of students at three levels of algebra exposure: (a) students enrolled in a high school pre-calculus…

The Effects of Teacher Collective Responsibility on the Mathematics Achievement of Students Who Repeat Algebra

ERIC Educational Resources Information Center

Morales-Chicas, Jessica; Agger, Charlotte

2017-01-01

In this article, the authors use the national High School Longitudinal Study of 2009 (HSLS:09) dataset to explore (a) if repeating algebra in the eighth grade was associated with overall mathematics grades and course-taking patterns by twelfth grade, (b) if repeating algebra in the eighth grade was associated with students' final grade in algebra,…

Quantum mechanics on periodic and non-periodic lattices and almost unitary Schwinger operators

NASA Astrophysics Data System (ADS)

Arik, Metin; Ildes, Medine

2018-05-01

In this work, we uncover the mathematical structure of the Schwinger algebra and introduce almost unitary Schwinger operators which are derived by considering translation operators on a finite lattice. We calculate mathematical relations between these algebras and show that the almost unitary Schwinger operators are equivalent to the Schwinger algebra. We introduce new representations for MN(C) in terms of these algebras.

Those Do What? Connecting Eigenvectors and Eigenvalues to the Rest of Linear Algebra: Using Visual Enhancements to Help Students Connect Eigenvectors to the Rest of Linear Algebra

ERIC Educational Resources Information Center

Nyman, Melvin A.; Lapp, Douglas A.; St. John, Dennis; Berry, John S.

2010-01-01

This paper discusses student difficulties in grasping concepts from Linear Algebra--in particular, the connection of eigenvalues and eigenvectors to other important topics in linear algebra. Based on our prior observations from student interviews, we propose technology-enhanced instructional approaches that might positively impact student…

Change in Peer Ability as a Mediator and Moderator of the Effect of the Algebra-For-All Policy on Ninth Graders' Math Outcomes

ERIC Educational Resources Information Center

Hong, Guanglei; Nomi, Takako

2011-01-01

A recent report by the Mathematics Advisory Panel referred to algebra as a "gateway" to later achievement (National Mathematics Advisory Panel, 2008). To address the problem of low academic performance in algebra, an increasing number of states and districts have started to implement a policy of requiring algebra for all students in…

The Effect of Scheduling Models for Introductory Algebra on 9th-Grade Students, Test Scores and Grades

ERIC Educational Resources Information Center

O'Hanlon, Angela L.

2011-01-01

The purpose of the study was to determine the effect of pacing and scheduling of algebra coursework on assigned 9th-grade students who traditionally would qualify for pre-algebra instruction and same course 9th-grade students who traditionally would qualify for standard algebra instruction. Students were selected based on completion of first-year…

Associative Algebraic Approach to Logarithmic CFT in the Bulk: The Continuum Limit of the {gl(1|1)} Periodic Spin Chain, Howe Duality and the Interchiral Algebra

NASA Astrophysics Data System (ADS)

Gainutdinov, A. M.; Read, N.; Saleur, H.

2016-01-01

We develop in this paper the principles of an associative algebraic approach to bulk logarithmic conformal field theories (LCFTs). We concentrate on the closed {gl(1|1)} spin-chain and its continuum limit—the {c=-2} symplectic fermions theory—and rely on two technical companion papers, Gainutdinov et al. (Nucl Phys B 871:245-288, 2013) and Gainutdinov et al. (Nucl Phys B 871:289-329, 2013). Our main result is that the algebra of local Hamiltonians, the Jones-Temperley-Lieb algebra JTL N , goes over in the continuum limit to a bigger algebra than {V}, the product of the left and right Virasoro algebras. This algebra, {S}—which we call interchiral, mixes the left and right moving sectors, and is generated, in the symplectic fermions case, by the additional field {S(z,bar{z})≡ S_{αβ} ψ^α(z)bar{ψ}^β(bar{z})}, with a symmetric form {S_{αβ}} and conformal weights (1,1). We discuss in detail how the space of states of the LCFT (technically, a Krein space) decomposes onto representations of this algebra, and how this decomposition is related with properties of the finite spin-chain. We show that there is a complete correspondence between algebraic properties of finite periodic spin chains and the continuum limit. An important technical aspect of our analysis involves the fundamental new observation that the action of JTL N in the {gl(1|1)} spin chain is in fact isomorphic to an enveloping algebra of a certain Lie algebra, itself a non semi-simple version of {sp_{N-2}}. The semi-simple part of JTL N is represented by {U sp_{N-2}}, providing a beautiful example of a classical Howe duality, for which we have a non semi-simple version in the full JTL N image represented in the spin-chain. On the continuum side, simple modules over {S} are identified with "fundamental" representations of {sp_∞}.

Deformed twistors and higher spin conformal (super-)algebras in four dimensions

DOE PAGES

Govil, Karan; Gunaydin, Murat

2015-03-05

Massless conformal scalar field in d = 4 corresponds to the minimal unitary representation (minrep) of the conformal group SU(2, 2) which admits a one-parameter family of deformations that describe massless fields of arbitrary helicity. The minrep and its deformations were obtained by quantization of the nonlinear realization of SU(2, 2) as a quasiconformal group in arXiv:0908.3624. We show that the generators of SU(2,2) for these unitary irreducible representations can be written as bilinears of deformed twistorial oscillators which transform nonlinearly under the Lorentz group and apply them to define and study higher spin algebras and superalgebras in AdS 5.more » The higher spin (HS) algebra of Fradkin-Vasiliev type in AdS 5 is simply the enveloping algebra of SU(2, 2) quotiented by a two-sided ideal (Joseph ideal) which annihilates the minrep. We show that the Joseph ideal vanishes identically for the quasiconformal realization of the minrep and its enveloping algebra leads directly to the HS algebra in AdS 5. Furthermore, the enveloping algebras of the deformations of the minrep define a one parameter family of HS algebras in AdS 5 for which certain 4d covariant deformations of the Joseph ideal vanish identically. These results extend to superconformal algebras SU(2, 2|N) and we find a one parameter family of HS superalgebras as enveloping algebras of the minimal unitary supermultiplet and its deformations. Our results suggest the existence of a family of (supersymmetric) HS theories in AdS 5 which are dual to free (super)conformal field theories (CFTs) or to interacting but integrable (supersymmetric) CFTs in 4d. We also discuss the corresponding picture in HS algebras in AdS 4 where the corresponding 3d conformal group Sp(4,R) admits only two massless representations (minreps), namely the scalar and spinor singletons.« less

Combinatorial Formulas for Characteristic Classes, and Localization of Secondary Topological Invariants.

NASA Astrophysics Data System (ADS)

Smirnov, Mikhail

1995-01-01

The problems solved in this thesis originated from combinatorial formulas for characteristic classes. This thesis deals with Chern-Simons classes, their generalizations and related algebraic and analytic problems. (1) In this thesis, I describe a new class of algebras whose elements contain Chern and generalized Chern -Simons classes. There is a Poisson bracket in these algebras, similar to the bracket in Kontsevich's noncommutative symplectic geometry (Kon). I prove that the Poisson bracket gives rise to a graded Lie algebra containing differential forms representing Chern and Chern-Simons classes. This is a new result. I describe algebraic analogs of the dilogarithm and higher polylogarithms in the algebra corresponding to Chern-Simons classes. (2) I study the properties of this bracket. It is possible to write the exterior differential and other operations in the algebra using this bracket. The bracket of any two Chern classes is zero and the bracket of a Chern class and a Chern-Simons class is d-closed. The construction developed here easily gives explicit formulas for known secondary classes and makes it possible to construct new ones. (3) I develop an algebraic model for the action of the gauge group and describe how elements of algebra corresponding to the secondary characteristic classes change under this action (see theorem 3 page xi). (4) It is possible give new explicit formulas for cocycles on a gauge group of a bundle and for the corresponding cocycles on the Lie algebra of the gauge group. I use formulas for secondary characteristic classes and an algebraic approach developed in chapter 1. I also use the work of Faddeev, Reiman and Semyonov-Tian-Shanskii (FRS) on cocycles as quantum anomalies. (5) I apply the methods of differential geometry of formal power series to construct universal characteristic and secondary characteristic classes. Given a pair of gauge equivalent connections using local formulas I obtain dilogarithmic and trilogarithmic analogs of Chern-Simons classes.

Algebra for Gifted Third Graders.

ERIC Educational Resources Information Center

Borenson, Henry

1987-01-01

Elementary school children who are exposed to a concrete, hands-on experience in algebraic linear equations will more readily develop a positive mind-set and expectation for success in later formal, algebraic studies. (CB)

Using Student Work to Develop Teachers' Knowledge of Algebra

ERIC Educational Resources Information Center

Herbel-Eisenmann, Beth A.; Phillips, Elizabeth Difanis

2005-01-01

This article describes a set of learning activities that use algebraic problems and written student work to help preservice and in-service teachers understand students' algebraic thinking. (Contains 4 figures.)

Quantum Superalgebras at Roots of Unity and Topological Invariants of Three-manifolds

NASA Astrophysics Data System (ADS)

Blumen, Sacha C.

2006-01-01

The general method of Reshetikhin and Turaev is followed to develop topological invariants of closed, connected, orientable 3-manifolds from a new class of algebras called pseudo-modular Hopf algebras. Pseudo-modular Hopf algebras are a class of Z_2-graded ribbon Hopf algebras that generalise the concept of a modular Hopf algebra. The quantum superalgebra U_q(osp(1|2n)) over C is considered with q a primitive N^th root of unity for all integers N >= 3. For such a q, a certain left ideal I of U_q(osp(1|2n)) is also a two-sided Hopf ideal, and the quotient algebra U_q^(N)(osp(1|2n)) = U_q(osp(1|2n)) / I is a Z_2-graded ribbon Hopf algebra. For all n and all N >= 3, a finite collection of finite dimensional representations of U_q^(N)(osp(1|2n)) is defined. Each such representation of U_q^(N)(osp(1|2n)) is labelled by an integral dominant weight belonging to the truncated dominant Weyl chamber. Properties of these representations are considered: the quantum superdimension of each representation is calculated, each representation is shown to be self-dual, and more importantly, the decomposition of the tensor product of an arbitrary number of such representations is obtained for even N. It is proved that the quotient algebra U_q^(N)(osp(1|2n)), together with the set of finite dimensional representations discussed above, form a pseudo-modular Hopf algebra when N >= 6 is twice an odd number. Using this pseudo-modular Hopf algebra, we construct a topological invariant of 3-manifolds. This invariant is shown to be different to the topological invariants of 3-manifolds arising from quantum so(2n+1) at roots of unity.

A Loomis-Sikorski theorem and functional calculus for a generalized Hermitian algebra

NASA Astrophysics Data System (ADS)

Foulis, David J.; Jenčová, Anna; Pulmannová, Sylvia

2017-10-01

A generalized Hermitian (GH-) algebra is a generalization of the partially ordered Jordan algebra of all Hermitian operators on a Hilbert space. We introduce the notion of a gh-tribe, which is a commutative GH-algebra of functions on a nonempty set X with pointwise partial order and operations, and we prove that every commutative GH-algebra is the image of a gh-tribe under a surjective GH-morphism. Using this result, we prove that each element a of a GH-algebra A corresponds to a real observable ξa on the σ-orthomodular lattice of projections in A and that ξa determines the spectral resolution of a. Also, if f is a continuous function defined on the spectrum of a, we formulate a definition of f (a), thus obtaining a continuous functional calculus for A.

Symmetries and Invariants of Twisted Quantum Algebras and Associated Poisson Algebras

NASA Astrophysics Data System (ADS)

Molev, A. I.; Ragoucy, E.

We construct an action of the braid group BN on the twisted quantized enveloping algebra U q'( {o}N) where the elements of BN act as automorphisms. In the classical limit q → 1, we recover the action of BN on the polynomial functions on the space of upper triangular matrices with ones on the diagonal. The action preserves the Poisson bracket on the space of polynomials which was introduced by Nelson and Regge in their study of quantum gravity and rediscovered in the mathematical literature. Furthermore, we construct a Poisson bracket on the space of polynomials associated with another twisted quantized enveloping algebra U q'( {sp}2n). We use the Casimir elements of both twisted quantized enveloping algebras to reproduce and construct some well-known and new polynomial invariants of the corresponding Poisson algebras.

Analysis of Secondary School Students’ Algebraic Thinking and Math-Talk Learning Community to Help Students Learn

NASA Astrophysics Data System (ADS)

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.

Mastering algebra retrains the visual system to perceive hierarchical structure in equations.

PubMed

Marghetis, Tyler; Landy, David; Goldstone, Robert L

2016-01-01

Formal mathematics is a paragon of abstractness. It thus seems natural to assume that the mathematical expert should rely more on symbolic or conceptual processes, and less on perception and action. We argue instead that mathematical proficiency relies on perceptual systems that have been retrained to implement mathematical skills. Specifically, we investigated whether the visual system-in particular, object-based attention-is retrained so that parsing algebraic expressions and evaluating algebraic validity are accomplished by visual processing. Object-based attention occurs when the visual system organizes the world into discrete objects, which then guide the deployment of attention. One classic signature of object-based attention is better perceptual discrimination within, rather than between, visual objects. The current study reports that object-based attention occurs not only for simple shapes but also for symbolic mathematical elements within algebraic expressions-but only among individuals who have mastered the hierarchical syntax of algebra. Moreover, among these individuals, increased object-based attention within algebraic expressions is associated with a better ability to evaluate algebraic validity. These results suggest that, in mastering the rules of algebra, people retrain their visual system to represent and evaluate abstract mathematical structure. We thus argue that algebraic expertise involves the regimentation and reuse of evolutionarily ancient perceptual processes. Our findings implicate the visual system as central to learning and reasoning in mathematics, leading us to favor educational approaches to mathematics and related STEM fields that encourage students to adapt, not abandon, their use of perception.

Minimal unitary representation of 5d superconformal algebra F(4) and AdS 6/CFT 5 higher spin (super)-algebras

DOE PAGES

Fernando, Sudarshan; Günaydin, Murat

2014-11-28

We study the minimal unitary representation (minrep) of SO(5, 2), obtained by quantization of its geometric quasiconformal action, its deformations and supersymmetric extensions. The minrep of SO(5, 2) describes a massless conformal scalar field in five dimensions and admits a unique “deformation” which describes a massless conformal spinor. Scalar and spinor minreps of SO(5, 2) are the 5d analogs of Dirac’s singletons of SO(3, 2). We then construct the minimal unitary representation of the unique 5d supercon-formal algebra F(4) with the even subalgebra SO(5, 2) ×SU(2). The minrep of F(4) describes a massless conformal supermultiplet consisting of two scalar andmore » one spinor fields. We then extend our results to the construction of higher spin AdS 6/CFT 5 (super)-algebras. The Joseph ideal of the minrep of SO(5, 2) vanishes identically as operators and hence its enveloping algebra yields the AdS 6/CFT 5 bosonic higher spin algebra directly. The enveloping algebra of the spinor minrep defines a “deformed” higher spin algebra for which a deformed Joseph ideal vanishes identically as operators. These results are then extended to the construction of the unique higher spin AdS 6/CFT 5 superalgebra as the enveloping algebra of the minimal unitary realization of F(4) obtained by the quasiconformal methods.« less

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

ERIC Educational Resources Information Center

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…

Students' Perceptions about the Symbols, Letters and Signs in Algebra and How Do These Affect Their Learning of Algebra: A Case Study in a Government Girls Secondary School Karachi

ERIC Educational Resources Information Center

Samo, Mashooque Ali

2009-01-01

Algebra uses symbols for generalizing arithmetic. These symbols have different meanings and interpretations in different situations. Students have different perceptions about these symbols, letters and signs. Despite the vast research by on the students' difficulties in understanding letters in Algebra, the overall image that emerges from the…

Continuous family of finite-dimensional representations of a solvable Lie algebra arising from singularities

PubMed Central

Yau, Stephen S.-T.

1983-01-01

A natural mapping from the set of complex analytic isolated hypersurface singularities to the set of finite dimensional Lie algebras is first defined. It is proven that the image under this natural mapping is contained in the set of solvable Lie algebras. This approach gives rise to a continuous inequivalent family of finite dimensional representations of a solvable Lie algebra. PMID:16593401

Exceptional quantum geometry and particle physics

NASA Astrophysics Data System (ADS)

Dubois-Violette, Michel

2016-11-01

Based on an interpretation of the quark-lepton symmetry in terms of the unimodularity of the color group SU (3) and on the existence of 3 generations, we develop an argumentation suggesting that the "finite quantum space" corresponding to the exceptional real Jordan algebra of dimension 27 (the Euclidean Albert algebra) is relevant for the description of internal spaces in the theory of particles. In particular, the triality which corresponds to the 3 off-diagonal octonionic elements of the exceptional algebra is associated to the 3 generations of the Standard Model while the representation of the octonions as a complex 4-dimensional space C ⊕C3 is associated to the quark-lepton symmetry (one complex for the lepton and 3 for the corresponding quark). More generally it is suggested that the replacement of the algebra of real functions on spacetime by the algebra of functions on spacetime with values in a finite-dimensional Euclidean Jordan algebra which plays the role of "the algebra of real functions" on the corresponding almost classical quantum spacetime is relevant in particle physics. This leads us to study the theory of Jordan modules and to develop the differential calculus over Jordan algebras (i.e. to introduce the appropriate notion of differential forms). We formulate the corresponding definition of connections on Jordan modules.

Working memory, worry, and algebraic ability.

PubMed

Trezise, Kelly; Reeve, Robert A

2014-05-01

Math anxiety (MA)-working memory (WM) relationships have typically been examined in the context of arithmetic problem solving, and little research has examined the relationship in other math domains (e.g., algebra). Moreover, researchers have tended to examine MA/worry separate from math problem solving activities and have used general WM tasks rather than domain-relevant WM measures. Furthermore, it seems to have been assumed that MA affects all areas of math. It is possible, however, that MA is restricted to particular math domains. To examine these issues, the current research assessed claims about the impact on algebraic problem solving of differences in WM and algebraic worry. A sample of 80 14-year-old female students completed algebraic worry, algebraic WM, algebraic problem solving, nonverbal IQ, and general math ability tasks. Latent profile analysis of worry and WM measures identified four performance profiles (subgroups) that differed in worry level and WM capacity. Consistent with expectations, subgroup membership was associated with algebraic problem solving performance: high WM/low worry>moderate WM/low worry=moderate WM/high worry>low WM/high worry. Findings are discussed in terms of the conceptual relationship between emotion and cognition in mathematics and implications for the MA-WM-performance relationship. Copyright © 2013 Elsevier Inc. All rights reserved.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miyadera, Takayuki; Imai, Hideki; Graduate School of Science and Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551

This paper discusses the no-cloning theorem in a logicoalgebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result, indicating a relation between the cloningmore » on effect algebras and hidden variables.« less

The noncommutative Poisson bracket and the deformation of the family algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wei, Zhaoting, E-mail: zhaotwei@indiana.edu

The family algebras are introduced by Kirillov in 2000. In this paper, we study the noncommutative Poisson bracket P on the classical family algebra C{sub τ}(g). We show that P controls the first-order 1-parameter formal deformation from C{sub τ}(g) to Q{sub τ}(g) where the latter is the quantum family algebra. Moreover, we will prove that the noncommutative Poisson bracket is in fact a Hochschild 2-coboundary, and therefore, the deformation is infinitesimally trivial. In the last part of this paper, we discuss the relation between Mackey’s analogue and the quantization problem of the family algebras.

On character amenability of Banach algebras

NASA Astrophysics Data System (ADS)

Kaniuth, E.; Lau, A. T.; Pym, J.

2008-08-01

We continue our work [E. Kaniuth, A.T. Lau, J. Pym, On [phi]-amenability of Banach algebras, Math. Proc. Cambridge Philos. Soc. 144 (2008) 85-96] in the study of amenability of a Banach algebra A defined with respect to a character [phi] of A. Various necessary and sufficient conditions of a global and a pointwise nature are found for a Banach algebra to possess a [phi]-mean of norm 1. We also completely determine the size of the set of [phi]-means for a separable weakly sequentially complete Banach algebra A with no [phi]-mean in A itself. A number of illustrative examples are discussed.

Gopakumar-Vafa Invariants Do Not Determine Flops

NASA Astrophysics Data System (ADS)

Brown, Gavin; Wemyss, Michael

2017-11-01

Two 3-fold flops are exhibited, both of which have precisely one flopping curve. One of the two flops is new and is distinct from all known algebraic D 4-flops. It is shown that the two flops are neither algebraically nor analytically isomorphic, yet their curve-counting Gopakumar-Vafa invariants are the same. We further show that the contraction algebras associated to both are not isomorphic, so the flops are distinguished at this level. This shows that the contraction algebra is a finer invariant than various curve-counting theories, and it also provides more evidence for the proposed analytic classification of 3-fold flops via contraction algebras.

On Finding and Using Identifiable Parameter Combinations in Nonlinear Dynamic Systems Biology Models and COMBOS: A Novel Web Implementation

PubMed Central

DiStefano, Joseph

2014-01-01

Parameter identifiability problems can plague biomodelers when they reach the quantification stage of development, even for relatively simple models. Structural identifiability (SI) is the primary question, usually understood as knowing which of P unknown biomodel parameters p 1,…, pi,…, pP are-and which are not-quantifiable in principle from particular input-output (I-O) biodata. It is not widely appreciated that the same database also can provide quantitative information about the structurally unidentifiable (not quantifiable) subset, in the form of explicit algebraic relationships among unidentifiable pi. Importantly, this is a first step toward finding what else is needed to quantify particular unidentifiable parameters of interest from new I–O experiments. We further develop, implement and exemplify novel algorithms that address and solve the SI problem for a practical class of ordinary differential equation (ODE) systems biology models, as a user-friendly and universally-accessible web application (app)–COMBOS. Users provide the structural ODE and output measurement models in one of two standard forms to a remote server via their web browser. COMBOS provides a list of uniquely and non-uniquely SI model parameters, and–importantly-the combinations of parameters not individually SI. If non-uniquely SI, it also provides the maximum number of different solutions, with important practical implications. The behind-the-scenes symbolic differential algebra algorithms are based on computing Gröbner bases of model attributes established after some algebraic transformations, using the computer-algebra system Maxima. COMBOS was developed for facile instructional and research use as well as modeling. We use it in the classroom to illustrate SI analysis; and have simplified complex models of tumor suppressor p53 and hormone regulation, based on explicit computation of parameter combinations. It’s illustrated and validated here for models of moderate complexity, with and without initial conditions. Built-in examples include unidentifiable 2 to 4-compartment and HIV dynamics models. PMID:25350289

Homomorphisms in C*-ternary algebras and JB*-triples

NASA Astrophysics Data System (ADS)

Park, Choonkil; Rassias, Themistocles M.

2008-01-01

In this paper, we investigate homomorphisms between C*-ternary algebras and derivations on C*-ternary algebras, and homomorphisms between JB*-triples and derivations on JB*-triples, associated with the following Apollonius type additive functional equation

Using Homemade Algebra Tiles To Develop Algebra and Prealgebra Concepts.

ERIC Educational Resources Information Center

Leitze, Annette Ricks; Kitt, Nancy A.

2000-01-01

Describes how to use homemade tiles, sketches, and the box method to reach a broader group of students for successful algebra learning. Provides a list of concepts appropriate for such an approach. (KHR)

Yang-Baxter algebras, integrable theories and Bethe Ansatz

DOE Office of Scientific and Technical Information (OSTI.GOV)

De Vega, H.J.

1990-03-10

This paper presents the Yang-Baxter algebras (YBA) in a general framework stressing their power to exactly solve the lattice models associated to them. The algebraic Behe Ansatz is developed as an eigenvector construction based on the YBA. The six-vertex model solution is given explicitly. The generalization of YB algebras to face language is considered. The algebraic BA for the SOS model of Andrews, Baxter and Forrester is described using these face YB algebras. It is explained how these lattice models yield both solvable massive QFT and conformal models in appropriated scaling (continuous) limits within the lattice light-cone approach. This approachmore » permit to define and solve rigorously massive QFT as an appropriate continuum limit of gapless vertex models. The deep links between the YBA and Lie algebras are analyzed including the quantum groups that underlay the trigonometric/hyperbolic YBA. Braid and quantum groups are derived from trigonometric/hyperbolic YBA in the limit of infinite spectral parameter. To conclude, some recent developments in the domain of integrable theories are summarized.« less

A new family of N dimensional superintegrable double singular oscillators and quadratic algebra Q(3) ⨁ so(n) ⨁ so(N-n)

NASA Astrophysics Data System (ADS)

Fazlul Hoque, Md; Marquette, Ian; Zhang, Yao-Zhong

2015-11-01

We introduce a new family of N dimensional quantum superintegrable models consisting of double singular oscillators of type (n, N-n). The special cases (2,2) and (4,4) have previously been identified as the duals of 3- and 5-dimensional deformed Kepler-Coulomb systems with u(1) and su(2) monopoles, respectively. The models are multiseparable and their wave functions are obtained in (n, N-n) double-hyperspherical coordinates. We obtain the integrals of motion and construct the finitely generated polynomial algebra that is the direct sum of a quadratic algebra Q(3) involving three generators, so(n), so(N-n) (i.e. Q(3) ⨁ so(n) ⨁ so(N-n)). The structure constants of the quadratic algebra itself involve the Casimir operators of the two Lie algebras so(n) and so(N-n). Moreover, we obtain the finite dimensional unitary representations (unirreps) of the quadratic algebra and present an algebraic derivation of the degenerate energy spectrum of the superintegrable model.

Deformed oscillator algebra approach of some quantum superintegrable Lissajous systems on the sphere and of their rational extensions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marquette, Ian, E-mail: i.marquette@uq.edu.au; Quesne, Christiane, E-mail: cquesne@ulb.ac.be

2015-06-15

We extend the construction of 2D superintegrable Hamiltonians with separation of variables in spherical coordinates using combinations of shift, ladder, and supercharge operators to models involving rational extensions of the two-parameter Lissajous systems on the sphere. These new families of superintegrable systems with integrals of arbitrary order are connected with Jacobi exceptional orthogonal polynomials of type I (or II) and supersymmetric quantum mechanics. Moreover, we present an algebraic derivation of the degenerate energy spectrum for the one- and two-parameter Lissajous systems and the rationally extended models. These results are based on finitely generated polynomial algebras, Casimir operators, realizations as deformedmore » oscillator algebras, and finite-dimensional unitary representations. Such results have only been established so far for 2D superintegrable systems separable in Cartesian coordinates, which are related to a class of polynomial algebras that display a simpler structure. We also point out how the structure function of these deformed oscillator algebras is directly related with the generalized Heisenberg algebras spanned by the nonpolynomial integrals.« less

Algebraic Systems and Pushdown Automata

NASA Astrophysics Data System (ADS)

Petre, Ion; Salomaa, Arto

We concentrate in this chapter on the core aspects of algebraic series, pushdown automata, and their relation to formal languages. We choose to follow here a presentation of their theory based on the concept of properness. We introduce in Sect. 2 some auxiliary notions and results needed throughout the chapter, in particular the notions of discrete convergence in semirings and C-cycle free infinite matrices. In Sect. 3 we introduce the algebraic power series in terms of algebraic systems of equations. We focus on interconnections with context-free grammars and on normal forms. We then conclude the section with a presentation of the theorems of Shamir and Chomsky-Schützenberger. We discuss in Sect. 4 the algebraic and the regulated rational transductions, as well as some representation results related to them. Section 5 is dedicated to pushdown automata and focuses on the interconnections with classical (non-weighted) pushdown automata and on the interconnections with algebraic systems. We then conclude the chapter with a brief discussion of some of the other topics related to algebraic systems and pushdown automata.

Linear {GLP}-algebras and their elementary theories

NASA Astrophysics Data System (ADS)

Pakhomov, F. N.

2016-12-01

The polymodal provability logic {GLP} was introduced by Japaridze in 1986. It is the provability logic of certain chains of provability predicates of increasing strength. Every polymodal logic corresponds to a variety of polymodal algebras. Beklemishev and Visser asked whether the elementary theory of the free {GLP}-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable [1]. For every positive integer n we solve the corresponding question for the logics {GLP}_n that are the fragments of {GLP} with n modalities. We prove that the elementary theory of the free {GLP}_n-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable for all n. We introduce the notion of a linear {GLP}_n-algebra and prove that all free {GLP}_n-algebras generated by the constants \\mathbf{0}, \\mathbf{1} are linear. We also consider the more general case of the logics {GLP}_α whose modalities are indexed by the elements of a linearly ordered set α: we define the notion of a linear algebra and prove the latter result in this case.

Research issues of geometry-based visual languages and some solutions

NASA Astrophysics Data System (ADS)

Green, Thorn G.

This dissertation addresses the problem of how to design visual language systems that are based upon Geometric Algebra, and provide a visual coupling of algebraic expressions and geometric depictions. This coupling of algebraic expressions and geometric depictions provides a new means for expressing both mathematical and geometric relationships present in mathematics, physics, and Computer-Aided Geometric Design (CAGD). Another significant feature of such a system is that the result of changing a parameter (by dragging the mouse) can be seen immediately in the depiction(s) of all expressions that use that parameter. This greatly aides the cognition of the relationships between variables. Systems for representing such a coupling of algebra and geometry have characteristics of both visual language systems, and systems for scientific visualization. Instead of using a parsing or dataflow paradigm for the visual language representation, the systems instead represent equations as manipulatible constrained diagrams for their visualization. This requires that the design of such a system have (but is not limited to) a means for parsing equations entered by the user, a scheme for producing a visual representation of these equations; techniques for maintaining the coupling between the expressions entered and the diagrams displayed; algorithms for maintaining the consistency of the diagrams; and, indexing capabilities that are efficient enough to allow diagrams to be created, and manipulated in a short enough period of time. The author proposes solutions for how such a design can be realized.

Spectral relationships between kicked Harper and on-resonance double kicked rotor operators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lawton, Wayne; Mouritzen, Anders S.; Wang Jiao

2009-03-15

Kicked Harper operators and on-resonance double kicked rotor operators model quantum systems whose semiclassical limits exhibit chaotic dynamics. Recent computational studies indicate a striking resemblance between the spectra of these operators. In this paper we apply C*-algebra methods to explain this resemblance. We show that each pair of corresponding operators belongs to a common rotation C*-algebra B{sub {alpha}}, prove that their spectra are equal if {alpha} is irrational, and prove that the Hausdorff distance between their spectra converges to zero as q increases if {alpha}=p/q with p and q coprime integers. Moreover, we show that corresponding operators in B{sub {alpha}}more » are homomorphic images of mother operators in the universal rotation C*-algebra A{sub {alpha}} that are unitarily equivalent and hence have identical spectra. These results extend analogous results for almost Mathieu operators. We also utilize the C*-algebraic framework to develop efficient algorithms to compute the spectra of these mother operators for rational {alpha} and present preliminary numerical results that support the conjecture that their spectra are Cantor sets if {alpha} is irrational. This conjecture for almost Mathieu operators, called the ten Martini problem, was recently proven after intensive efforts over several decades. This proof for the almost Mathieu operators utilized transfer matrix methods, which do not exist for the kicked operators. We outline a strategy, based on a special property of loop groups of semisimple Lie groups, to prove this conjecture for the kicked operators.« less

A splitting algorithm for the wavelet transform of cubic splines on a nonuniform grid

NASA Astrophysics Data System (ADS)

Sulaimanov, Z. M.; Shumilov, B. M.

2017-10-01

For cubic splines with nonuniform nodes, splitting with respect to the even and odd nodes is used to obtain a wavelet expansion algorithm in the form of the solution to a three-diagonal system of linear algebraic equations for the coefficients. Computations by hand are used to investigate the application of this algorithm for numerical differentiation. The results are illustrated by solving a prediction problem.

Computer Algebra Systems in Undergraduate Instruction.

ERIC Educational Resources Information Center

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)

Operator algebra as an application of logarithmic representation of infinitesimal generators

NASA Astrophysics Data System (ADS)

Iwata, Yoritaka

2018-02-01

The operator algebra is introduced based on the framework of logarithmic representation of infinitesimal generators. In conclusion a set of generally-unbounded infinitesimal generators is characterized as a module over the Banach algebra.

Quantum deformations of conformal algebras with mass-like deformation parameters

DOE Office of Scientific and Technical Information (OSTI.GOV)

Frydryszak, Andrzej; Lukierski, Jerzy; Mozrzymas, Marek

1998-12-15

We recall the mathematical apparatus necessary for the quantum deformation of Lie algebras, namely the notions of coboundary Lie algebras, classical r-matrices, classical Yang-Baxter equations (CYBE), Froebenius algebras and parabolic subalgebras. Then we construct the quantum deformation of D=1, D=2 and D=3 conformal algebras, showing that this quantization introduce fundamental mass parameters. Finally we consider with more details the quantization of D=4 conformal algebra. We build three classes of sl(4,C) classical r-matrices, satisfying CYBE and depending respectively on 8, 10 and 12 generators of parabolic subalgebras. We show that only the 8-dimensional r-matrices allow to impose the D=4 conformal o(4,2){approx_equal}su(2,2)more » reality conditions. Weyl reflections and Dynkin diagram automorphisms for o(4,2) define the class of admissible bases for given classical r-matrices.« less

Quantum teleportation and Birman-Murakami-Wenzl algebra

NASA Astrophysics Data System (ADS)

Zhang, Kun; Zhang, Yong

2017-02-01

In this paper, we investigate the relationship of quantum teleportation in quantum information science and the Birman-Murakami-Wenzl (BMW) algebra in low-dimensional topology. For simplicity, we focus on the two spin-1/2 representation of the BMW algebra, which is generated by both the Temperley-Lieb projector and the Yang-Baxter gate. We describe quantum teleportation using the Temperley-Lieb projector and the Yang-Baxter gate, respectively, and study teleportation-based quantum computation using the Yang-Baxter gate. On the other hand, we exploit the extended Temperley-Lieb diagrammatical approach to clearly show that the tangle relations of the BMW algebra have a natural interpretation of quantum teleportation. Inspired by this interpretation, we construct a general representation of the tangle relations of the BMW algebra and obtain interesting representations of the BMW algebra. Therefore, our research sheds a light on a link between quantum information science and low-dimensional topology.

Ermakov's Superintegrable Toy and Nonlocal Symmetries

NASA Astrophysics Data System (ADS)

Leach, P. G. L.; Karasu Kalkanli, A.; Nucci, M. C.; Andriopoulos, K.

2005-11-01

We investigate the symmetry properties of a pair of Ermakov equations. The system is superintegrable and yet possesses only three Lie point symmetries with the algebra sl(2, R). The number of point symmetries is insufficient and the algebra unsuitable for the complete specification of the system. We use the method of reduction of order to reduce the nonlinear fourth-order system to a third-order system comprising a linear second-order equation and a conservation law. We obtain the representation of the complete symmetry group from this system. Four of the required symmetries are nonlocal and the algebra is the direct sum of a one-dimensional Abelian algebra with the semidirect sum of a two-dimensional solvable algebra with a two-dimensional Abelian algebra. The problem illustrates the difficulties which can arise in very elementary systems. Our treatment demonstrates the existence of possible routes to overcome these problems in a systematic fashion.

Algebra for Enterprise Ontology: towards analysis and synthesis of enterprise models

NASA Astrophysics Data System (ADS)

Suga, Tetsuya; Iijima, Junichi

2018-03-01

Enterprise modeling methodologies have made enterprises more likely to be the object of systems engineering rather than craftsmanship. However, the current state of research in enterprise modeling methodologies lacks investigations of the mathematical background embedded in these methodologies. Abstract algebra, a broad subfield of mathematics, and the study of algebraic structures may provide interesting implications in both theory and practice. Therefore, this research gives an empirical challenge to establish an algebraic structure for one aspect model proposed in Design & Engineering Methodology for Organizations (DEMO), which is a major enterprise modeling methodology in the spotlight as a modeling principle to capture the skeleton of enterprises for developing enterprise information systems. The results show that the aspect model behaves well in the sense of algebraic operations and indeed constructs a Boolean algebra. This article also discusses comparisons with other modeling languages and suggests future work.

Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Druinsky, Alex; Ghysels, Pieter; Li, Xiaoye S.

In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism andmore » made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.« less

Attitude determination using vector observations: A fast optimal matrix algorithm

NASA Technical Reports Server (NTRS)

Markley, F. Landis

1993-01-01

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Teaching Structure in Algebra

ERIC Educational Resources Information Center

Merlin, Ethan M.

2013-01-01

This article describes how the author has developed tasks for students that address the missed "essence of the matter" of algebraic transformations. Specifically, he has found that having students practice "perceiving" algebraic structure--by naming the "glue" in the expressions, drawing expressions using…

Error-Detecting Identification Codes for Algebra Students.

ERIC Educational Resources Information Center

Sutherland, David C.

1990-01-01

Discusses common error-detecting identification codes using linear algebra terminology to provide an interesting application of algebra. Presents examples from the International Standard Book Number, the Universal Product Code, bank identification numbers, and the ZIP code bar code. (YP)

Highest weight representation for Sklyanin algebra sl(3)(u) with application to the Gaudin model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Burdik, C., E-mail: burdik@kmlinux.fjfi.cvut.cz; Navratil, O.

2011-06-15

We study the infinite-dimensional Sklyanin algebra sl(3)(u). Specifically we construct the highest weight representation for this algebra in an explicit form. Its application to the Gaudin model is mentioned.

Linear time-invariant controller design for two-channel decentralized control systems

NASA Technical Reports Server (NTRS)

Desoer, Charles A.; Gundes, A. Nazli

1987-01-01

This paper analyzes a linear time-invariant two-channel decentralized control system with a 2 x 2 strictly proper plant. It presents an algorithm for the algebraic design of a class of decentralized compensators which stabilize the given plant.

Category-theoretic models of algebraic computer systems

NASA Astrophysics Data System (ADS)

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.

Elliptic biquaternion algebra

NASA Astrophysics Data System (ADS)

Özen, Kahraman Esen; Tosun, Murat

2018-01-01

In this study, we define the elliptic biquaternions and construct the algebra of elliptic biquaternions over the elliptic number field. Also we give basic properties of elliptic biquaternions. An elliptic biquaternion is in the form A0 + A1i + A2j + A3k which is a linear combination of {1, i, j, k} where the four components A0, A1, A2 and A3 are elliptic numbers. Here, 1, i, j, k are the quaternion basis of the elliptic biquaternion algebra and satisfy the same multiplication rules which are satisfied in both real quaternion algebra and complex quaternion algebra. In addition, we discuss the terms; conjugate, inner product, semi-norm, modulus and inverse for elliptic biquaternions.

Learning to Apply Algebra in the Community for Adults With Intellectual Developmental Disabilities.

PubMed

Rodriguez, Anthony M

2016-02-01

Students with intellectual and developmental disabilities (IDD) are routinely excluded from algebra and other high-level mathematics courses. High school students with IDD take courses in arithmetic and life skills rather than having an opportunity to learn algebra. Yet algebra skills can support the learning of money and budgeting skills. This study explores the feasibility of algebra instruction for adults with IDD through an experimental curriculum. Ten individuals with IDD participated in a 6-week course framing mathematics concepts within the context of everyday challenges in handling money. The article explores classroom techniques, discusses student strategies, and proposes possible avenues for future research analyzing mathematics instructional design strategies for individuals with IDD.

Quantum walks, deformed relativity and Hopf algebra symmetries.

PubMed

Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo

2016-05-28

We show how the Weyl quantum walk derived from principles in D'Ariano & Perinotti (D'Ariano & Perinotti 2014Phys. Rev. A90, 062106. (doi:10.1103/PhysRevA.90.062106)), enjoying a nonlinear Lorentz symmetry of dynamics, allows one to introduce Hopf algebras for position and momentum of the emerging particle. We focus on two special models of Hopf algebras-the usual Poincaré and theκ-Poincaré algebras. © 2016 The Author(s).

Dynamical Correspondence in a Generalized Quantum Theory

NASA Astrophysics Data System (ADS)

Niestegge, Gerd

2015-05-01

In order to figure out why quantum physics needs the complex Hilbert space, many attempts have been made to distinguish the C*-algebras and von Neumann algebras in more general classes of abstractly defined Jordan algebras (JB- and JBW-algebras). One particularly important distinguishing property was identified by Alfsen and Shultz and is the existence of a dynamical correspondence. It reproduces the dual role of the selfadjoint operators as observables and generators of dynamical groups in quantum mechanics. In the paper, this concept is extended to another class of nonassociative algebras, arising from recent studies of the quantum logics with a conditional probability calculus and particularly of those that rule out third-order interference. The conditional probability calculus is a mathematical model of the Lüders-von Neumann quantum measurement process, and third-order interference is a property of the conditional probabilities which was discovered by Sorkin (Mod Phys Lett A 9:3119-3127, 1994) and which is ruled out by quantum mechanics. It is shown then that the postulates that a dynamical correspondence exists and that the square of any algebra element is positive still characterize, in the class considered, those algebras that emerge from the selfadjoint parts of C*-algebras equipped with the Jordan product. Within this class, the two postulates thus result in ordinary quantum mechanics using the complex Hilbert space or, vice versa, a genuine generalization of quantum theory must omit at least one of them.

From rational numbers to algebra: separable contributions of decimal magnitude and relational understanding of fractions.

PubMed

DeWolf, Melissa; Bassok, Miriam; Holyoak, Keith J

2015-05-01

To understand the development of mathematical cognition and to improve instructional practices, it is critical to identify early predictors of difficulty in learning complex mathematical topics such as algebra. Recent work has shown that performance with fractions on a number line estimation task predicts algebra performance, whereas performance with whole numbers on similar estimation tasks does not. We sought to distinguish more specific precursors to algebra by measuring multiple aspects of knowledge about rational numbers. Because fractions are the first numbers that are relational expressions to which students are exposed, we investigated how understanding the relational bipartite format (a/b) of fractions might connect to later algebra performance. We presented middle school students with a battery of tests designed to measure relational understanding of fractions, procedural knowledge of fractions, and placement of fractions, decimals, and whole numbers onto number lines as well as algebra performance. Multiple regression analyses revealed that the best predictors of algebra performance were measures of relational fraction knowledge and ability to place decimals (not fractions or whole numbers) onto number lines. These findings suggest that at least two specific components of knowledge about rational numbers--relational understanding (best captured by fractions) and grasp of unidimensional magnitude (best captured by decimals)--can be linked to early success with algebraic expressions. Copyright © 2015 Elsevier Inc. All rights reserved.

Combining Automated Theorem Provers with Symbolic Algebraic Systems: Position Paper

NASA Technical Reports Server (NTRS)

Schumann, Johann; Koga, Dennis (Technical Monitor)

1999-01-01

In contrast to pure mathematical applications where automated theorem provers (ATPs) are quite capable, proof tasks arising form real-world applications from the area of Software Engineering show quite different characteristics: they usually do not only contain much arithmetic (albeit often quite simple one), but they also often contain reasoning about specific structures (e.g. graphics, sets). Thus, an ATP must be capable of performing reasoning together with a fair amount of simplification, calculation and solving. Therefore, powerful simplifiers and other (symbolic and semi-symbolic) algorithms seem to be ideally suited to augment ATPs. In the following we shortly describe two major points of interest in combining SASs (symbolic algebraic systems) with top-down automated theorem provers (here: SETHEO [Let92, GLMS94]).

A Method for the Construction of Hereditary Constitutive Equations of Laminates Bases on a Hereditary Constitutive Equation for a Layer

NASA Astrophysics Data System (ADS)

Dumansky, Alexander M.; Tairova, Lyudmila P.

2008-09-01

A method for the construction of hereditary constitutive equation is proposed for the laminate on the basis of hereditary constitutive equations of a layer. The method is developed from the assumption that in the directions of axes of orthotropy the layer follows elastic behavior, and obeys hereditary constitutive equations under shear. The constitutive equations of the laminate are constructed on the basis of classical laminate theory and algebra of resolvent operators. Effective matrix algorithm and relationships of operator algebra are used to derive visco-elastic stiffness and compliance of the laminate. The example of construction of hereditary constitutive equations of cross-ply carbon fiber-reinforced plastic is presented.

An Algebraic Approach to the Eigenstates of the Calogero Model

NASA Astrophysics Data System (ADS)

Ujino, Hideaki

2002-11-01

An algebraic treatment of the eigenstates of the (AN-1-) Calogero model is presented, which provides an algebraic construction of the nonsymmetric orthogonal eigenvectors, symmetrization, antisymmetrization and calculation of square norms in a unified way.

Solving Our Algebra Problem: Getting All Students through Algebra I to Improve Graduation Rates

ERIC Educational Resources Information Center

Schachter, Ron

2013-01-01

graduation as well as admission to most colleges. But taking algebra also can turn into a pathway for failure, from which some students never recover. In 2010, a national U.S. Department of Education study…

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

NASA Astrophysics Data System (ADS)

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.

A wavelet-based ECG delineation algorithm for 32-bit integer online processing

PubMed Central

2011-01-01

Background Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. Methods This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. Results The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. Conclusions The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra. PMID:21457580

A wavelet-based ECG delineation algorithm for 32-bit integer online processing.

PubMed

Di Marco, Luigi Y; Chiari, Lorenzo

2011-04-03

Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra.

FINAL REPORT (MILESTONE DATE 9/30/11) FOR SUBCONTRACT NO. B594099 NUMERICAL METHODS FOR LARGE-SCALE DATA FACTORIZATION

DOE Office of Scientific and Technical Information (OSTI.GOV)

De Sterck, H

2011-10-18

The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead ofmore » the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Govil, Karan; Gunaydin, Murat

Massless conformal scalar field in d = 4 corresponds to the minimal unitary representation (minrep) of the conformal group SU(2, 2) which admits a one-parameter family of deformations that describe massless fields of arbitrary helicity. The minrep and its deformations were obtained by quantization of the nonlinear realization of SU(2, 2) as a quasiconformal group in arXiv:0908.3624. We show that the generators of SU(2,2) for these unitary irreducible representations can be written as bilinears of deformed twistorial oscillators which transform nonlinearly under the Lorentz group and apply them to define and study higher spin algebras and superalgebras in AdS 5.more » The higher spin (HS) algebra of Fradkin-Vasiliev type in AdS 5 is simply the enveloping algebra of SU(2, 2) quotiented by a two-sided ideal (Joseph ideal) which annihilates the minrep. We show that the Joseph ideal vanishes identically for the quasiconformal realization of the minrep and its enveloping algebra leads directly to the HS algebra in AdS 5. Furthermore, the enveloping algebras of the deformations of the minrep define a one parameter family of HS algebras in AdS 5 for which certain 4d covariant deformations of the Joseph ideal vanish identically. These results extend to superconformal algebras SU(2, 2|N) and we find a one parameter family of HS superalgebras as enveloping algebras of the minimal unitary supermultiplet and its deformations. Our results suggest the existence of a family of (supersymmetric) HS theories in AdS 5 which are dual to free (super)conformal field theories (CFTs) or to interacting but integrable (supersymmetric) CFTs in 4d. We also discuss the corresponding picture in HS algebras in AdS 4 where the corresponding 3d conformal group Sp(4,R) admits only two massless representations (minreps), namely the scalar and spinor singletons.« less

Does Early Algebraic Reasoning Differ as a Function of Students’ Difficulty with Calculations versus Word Problems?

PubMed Central

Powell, Sarah R.; Fuchs, Lynn S.

2014-01-01

According to national mathematics standards, algebra instruction should begin at kindergarten and continue through elementary school. Most often, teachers address algebra in the elementary grades with problems related to solving equations or understanding functions. With 789 2nd- grade students, we administered (a) measures of calculations and word problems in the fall and (b) an assessment of pre-algebraic reasoning, with items that assessed solving equations and functions, in the spring. Based on the calculation and word-problem measures, we placed 148 students into 1 of 4 difficulty status categories: typically performing, calculation difficulty, word-problem difficulty, or difficulty with calculations and word problems. Analyses of variance were conducted on the 148 students; path analytic mediation analyses were conducted on the larger sample of 789 students. Across analyses, results corroborated the finding that word-problem difficulty is more strongly associated with difficulty with pre-algebraic reasoning. As an indicator of later algebra difficulty, word-problem difficulty may be a more useful predictor than calculation difficulty, and students with word-problem difficulty may require a different level of algebraic reasoning intervention than students with calculation difficulty. PMID:25309044

Analysis of algebraic reasoning ability of cognitive style perspectives on field dependent field independent and gender

NASA Astrophysics Data System (ADS)

Rosita, N. T.

2018-03-01

The purpose of this study is to analyse algebraic reasoning ability using the SOLO model as a theoretical framework to assess students’ algebraic reasoning abilities of Field Dependent cognitive (FD), Field Independent (FI) and Gender perspectives. The method of this study is a qualitative research. The instrument of this study is the researcher himself assisted with algebraic reasoning tests, the problems have been designed based on NCTM indicators and algebraic reasoning according to SOLO model. While the cognitive style of students is determined using Group Embedded Figure Test (GEFT), as well as interviews on the subject as triangulation. The subjects are 15 female and 15 males of the sixth semester students of mathematics education, STKIP Sebelas April. The results of the qualitative data analysis is that most subjects are at the level of unistructural and multi-structural, subjects at the relational level have difficulty in forming a new linear pattern. While the subjects at the extended abstract level are able to meet all the indicators of algebraic reasoning ability even though some of the answers are not perfect yet. Subjects of FI tend to have higher algebraic reasoning abilities than of the subject of FD.

Massless conformal fields, AdS (d+1)/CFT d higher spin algebras and their deformations

DOE PAGES

Fernando, Sudarshan; Gunaydin, Murat

2016-02-04

Here, we extend our earlier work on the minimal unitary representation of SO(d, 2)and its deformations for d=4, 5and 6to arbitrary dimensions d. We show that there is a one-to-one correspondence between the minrep of SO(d, 2)and its deformations and massless conformal fields in Minkowskian spacetimes in ddimensions. The minrep describes a massless conformal scalar field, and its deformations describe massless conformal fields of higher spin. The generators of Joseph ideal vanish identically as operators for the quasiconformal realization of the minrep, and its enveloping algebra yields directly the standard bosonic AdS (d+1)/CFT d higher spin algebra. For deformed minrepsmore » the generators of certain deformations of Joseph ideal vanish as operators and their enveloping algebras lead to deformations of the standard bosonic higher spin algebra. In odd dimensions there is a unique deformation of the higher spin algebra corresponding to the spinor singleton. In even dimensions one finds infinitely many deformations of the higher spin algebra labelled by the eigenvalues of Casimir operator of the little group SO(d–2)for massless representations.« less

Individual Differences in Algebraic Cognition: Relation to the Approximate Number and Sematic Memory Systems

PubMed Central

Geary, David C.; Hoard, Mary K.; Nugent, Lara; Rouder, Jeffrey N.

2015-01-01

The relation between performance on measures of algebraic cognition and acuity of the approximate number system (ANS) and memory for addition facts was assessed for 171 (92 girls) 9th graders, controlling parental education, sex, reading achievement, speed of numeral processing, fluency of symbolic number processing, intelligence, and the central executive component of working memory. The algebraic tasks assessed accuracy in placing x,y pairs in the coordinate plane, speed and accuracy of expression evaluation, and schema memory for algebra equations. ANS acuity was related to accuracy of placements in the coordinate plane and expression evaluation, but not schema memory. Frequency of fact-retrieval errors was related to schema memory but not coordinate plane or expression evaluation accuracy. The results suggest the ANS may contribute to or is influenced by spatial-numerical and numerical only quantity judgments in algebraic contexts, whereas difficulties in committing addition facts to long-term memory may presage slow formation of memories for the basic structure of algebra equations. More generally, the results suggest different brain and cognitive systems are engaged during the learning of different components of algebraic competence, controlling demographic and domain general abilities. PMID:26255604

Modular operads and the quantum open-closed homotopy algebra

NASA Astrophysics Data System (ADS)

Doubek, Martin; Jurčo, Branislav; Münster, Korbinian

2015-12-01

We verify that certain algebras appearing in string field theory are algebras over Feynman transform of modular operads which we describe explicitly. Equivalent description in terms of solutions of generalized BV master equations are explained from the operadic point of view.

Mathematics in the Real World.

ERIC Educational Resources Information Center

Borenstein, Matt

1997-01-01

The abstract nature of algebra causes difficulties for many students. Describes "Real-World Data," an algebra course designed for students with low grades in algebra and provides multidisciplinary experiments (linear functions and variations; quadratic, square-root, and inverse relations; and exponential and periodic variation)…

Elementary maps on nest algebras

NASA Astrophysics Data System (ADS)

Li, Pengtong

2006-08-01

Let , be algebras and let , be maps. An elementary map of is an ordered pair (M,M*) such that for all , . In this paper, the general form of surjective elementary maps on standard subalgebras of nest algebras is described. In particular, such maps are automatically additive.

On differential operators generating iterative systems of linear ODEs of maximal symmetry algebra

NASA Astrophysics Data System (ADS)

Ndogmo, J. C.

2017-06-01

Although every iterative scalar linear ordinary differential equation is of maximal symmetry algebra, the situation is different and far more complex for systems of linear ordinary differential equations, and an iterative system of linear equations need not be of maximal symmetry algebra. We illustrate these facts by examples and derive families of vector differential operators whose iterations are all linear systems of equations of maximal symmetry algebra. Some consequences of these results are also discussed.

Towards classical spectrum generating algebras for f-deformations

NASA Astrophysics Data System (ADS)

Kullock, Ricardo; Latini, Danilo

2016-01-01

In this paper we revise the classical analog of f-oscillators, a generalization of q-oscillators given in Man'ko et al. (1997) [8], in the framework of classical spectrum generating algebras (SGA) introduced in Kuru and Negro (2008) [9]. We write down the deformed Poisson algebra characterizing the entire family of non-linear oscillators and construct its general solution algebraically. The latter, covering the full range of f-deformations, shows an energy dependence both in the amplitude and the frequency of the motion.

Selecting Students for Pre-Algebra: Examination of the Relative Utility of the Anchorage Pre-Algebra Screening Tests and the State of Alaska Standards Based Benchmark 2 Mathematics Study. An Examination of Consequential Validity and Recommendation.

ERIC Educational Resources Information Center

Fenton, Ray

This study examined the relative efficacy of the Anchorage (Alaska) Pre-Algebra Test and the State of Alaska Benchmark in 2 Math examination as tools used in the process of recommending grade 6 students for grade 7 Pre-Algebra placement. The consequential validity of the tests is explored in the context of class placements and grades earned. The…

Geometry of quantum state manifolds generated by the Lie algebra operators

NASA Astrophysics Data System (ADS)

Kuzmak, A. R.

2018-03-01

The Fubini-Study metric of quantum state manifold generated by the operators which satisfy the Heisenberg Lie algebra is calculated. The similar problem is studied for the manifold generated by the so(3) Lie algebra operators. Using these results, we calculate the Fubini-Study metrics of state manifolds generated by the position and momentum operators. Also the metrics of quantum state manifolds generated by some spin systems are obtained. Finally, we generalize this problem for operators of an arbitrary Lie algebra.

On Non-Abelian Extensions of 3-Lie Algebras

NASA Astrophysics Data System (ADS)

Song, Li-Na; Makhlouf, Abdenacer; Tang, Rong

2018-04-01

In this paper, we study non-abelian extensions of 3-Lie algebras through Maurer-Cartan elements. We show that there is a one-to-one correspondence between isomorphism classes of non-abelian extensions of 3-Lie algebras and equivalence classes of Maurer-Cartan elements in a DGLA. The structure of the Leibniz algebra on the space of fundamental objects is also analyzed. Supported by National Natural Science Foundation of China under Grant No. 11471139 and National Natural Science Foundation of Jilin Province under Grant No. 20170101050JC

A Quantum Groups Primer

NASA Astrophysics Data System (ADS)

Majid, Shahn

2002-05-01

Here is a self-contained introduction to quantum groups as algebraic objects. Based on the author's lecture notes for the Part III pure mathematics course at Cambridge University, the book is suitable as a primary text for graduate courses in quantum groups or supplementary reading for modern courses in advanced algebra. The material assumes knowledge of basic and linear algebra. Some familiarity with semisimple Lie algebras would also be helpful. The volume is a primer for mathematicians but it will also be useful for mathematical physicists.

A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets

DTIC Science & Technology

2014-11-01

linear hybrid systems by linear algebraic methods. In SAS, volume 6337 of LNCS, pages 373–389. Springer, 2010. [19] E. W. Mayr. Membership in polynomial...383–394, 2009. [31] A. Tarski. A decision method for elementary algebra and geometry. Bull. Amer. Math. Soc., 59, 1951. [32] A. Tiwari. Abstractions...A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets Khalil Ghorbal1 Andrew Sogokon2 André Platzer1 November 2014 CMU

Topology-preserving quantum deformation with non-numerical parameter

NASA Astrophysics Data System (ADS)

Aukhadiev, Marat; Grigoryan, Suren; Lipacheva, Ekaterina

2013-11-01

We introduce a class of compact quantum semigroups, that we call semigroup deformations of compact Abelian qroups. These objects arise from reduced semigroup -algebras, the generalization of the Toeplitz algebra. We study quantum subgroups, quantum projective spaces and quantum quotient groups for such objects, and show that the group is contained as a compact quantum subgroup in the deformation of itself. The connection with the weak Hopf algebra notion is described. We give a grading on the -algebra of the compact quantum semigroups constructed.

A Study to Determine Differences in the Level of Perceived Preparedness in Teaching Algebra to Eighth Graders between Teachers in the United States and Teachers in Lebanon

ERIC Educational Resources Information Center

Khajarian, Seta

2011-01-01

Algebra is a branch in mathematics and taking Algebra in middle school is often a gateway to advanced courses in high school. The problem is that the United States and Lebanon had low scores in Algebra in the 2007 Trends in Mathematics and Sciences Study (TIMSS), an international assessment administered to 4th and 8th graders every 4 years. On the…

Realization of Uq(sp(2n)) within the Differential Algebra on Quantum Symplectic Space

NASA Astrophysics Data System (ADS)

Zhang, Jiao; Hu, Naihong

2017-10-01

We realize the Hopf algebra U_q({sp}_{2n}) as an algebra of quantum differential operators on the quantum symplectic space X(f_s;R) and prove that X(f_s;R) is a U_q({sp}_{2n})-module algebra whose irreducible summands are just its homogeneous subspaces. We give a coherence realization for all the positive root vectors under the actions of Lusztig's braid automorphisms of U_q({sp}_{2n}).

Double-Stage Delay Multiply and Sum Beamforming Algorithm Applied to Ultrasound Medical Imaging.

PubMed

Mozaffarzadeh, Moein; Sadeghi, Masume; Mahloojifar, Ali; Orooji, Mahdi

2018-03-01

In ultrasound (US) imaging, delay and sum (DAS) is the most common beamformer, but it leads to low-quality images. Delay multiply and sum (DMAS) was introduced to address this problem. However, the reconstructed images using DMAS still suffer from the level of side lobes and low noise suppression. Here, a novel beamforming algorithm is introduced based on expansion of the DMAS formula. We found that there is a DAS algebra inside the expansion, and we proposed use of the DMAS instead of the DAS algebra. The introduced method, namely double-stage DMAS (DS-DMAS), is evaluated numerically and experimentally. The quantitative results indicate that DS-DMAS results in an approximately 25% lower level of side lobes compared with DMAS. Moreover, the introduced method leads to 23%, 22% and 43% improvement in signal-to-noise ratio, full width at half-maximum and contrast ratio, respectively, compared with the DMAS beamformer. Copyright © 2018. Published by Elsevier Inc.

Communication: A reduced scaling J-engine based reformulation of SOS-MP2 using graphics processing units.

PubMed

Maurer, S A; Kussmann, J; Ochsenfeld, C

2014-08-07

We present a low-prefactor, cubically scaling scaled-opposite-spin second-order Møller-Plesset perturbation theory (SOS-MP2) method which is highly suitable for massively parallel architectures like graphics processing units (GPU). The scaling is reduced from O(N⁵) to O(N³) by a reformulation of the MP2-expression in the atomic orbital basis via Laplace transformation and the resolution-of-the-identity (RI) approximation of the integrals in combination with efficient sparse algebra for the 3-center integral transformation. In contrast to previous works that employ GPUs for post Hartree-Fock calculations, we do not simply employ GPU-based linear algebra libraries to accelerate the conventional algorithm. Instead, our reformulation allows to replace the rate-determining contraction step with a modified J-engine algorithm, that has been proven to be highly efficient on GPUs. Thus, our SOS-MP2 scheme enables us to treat large molecular systems in an accurate and efficient manner on a single GPU-server.

Open-Closed Homotopy Algebras and Strong Homotopy Leibniz Pairs Through Koszul Operad Theory

NASA Astrophysics Data System (ADS)

Hoefel, Eduardo; Livernet, Muriel

2012-08-01

Open-closed homotopy algebras (OCHA) and strong homotopy Leibniz pairs (SHLP) were introduced by Kajiura and Stasheff in 2004. In an appendix to their paper, Markl observed that an SHLP is equivalent to an algebra over the minimal model of a certain operad, without showing that the operad is Koszul. In the present paper, we show that both OCHA and SHLP are algebras over the minimal model of the zeroth homology of two versions of the Swiss-cheese operad and prove that these two operads are Koszul. As an application, we show that the OCHA operad is non-formal as a 2-colored operad but is formal as an algebra in the category of 2-collections.

Assessment of polytechnic students' understanding of basic algebra

NASA Astrophysics Data System (ADS)

Mokmin, Nur Azlina Mohamed; Masood, Mona

2015-12-01

It is important for engineering students to excel in algebra. Previous studies show that the algebraic fraction is a subtopic of algebra that was found to be the most challenging for engineering students. This study is done with 191 first semester engineering students who have enrolled in engineering programs in Malaysian polytechnic. The respondents are divided into Group 1 (Distinction) and Group 2 (Credit) based on their Mathematics SPM result. A computer application is developed for this study to assess student information and understanding of the algebraic fraction topic. The result is analyzed using SPSS and Microsoft Excel. The test results show that there are significant differences between Group 1 and Group 2 and that most of the students scored below the minimum requirement.

Structure of Lie point and variational symmetry algebras for a class of odes

NASA Astrophysics Data System (ADS)

Ndogmo, J. C.

2018-04-01

It is known for scalar ordinary differential equations, and for systems of ordinary differential equations of order not higher than the third, that their Lie point symmetry algebras is of maximal dimension if and only if they can be reduced by a point transformation to the trivial equation y(n)=0. For arbitrary systems of ordinary differential equations of order n ≥ 3 reducible by point transformations to the trivial equation, we determine the complete structure of their Lie point symmetry algebras as well as that for their variational, and their divergence symmetry algebras. As a corollary, we obtain the maximal dimension of the Lie point symmetry algebra for any system of linear or nonlinear ordinary differential equations.

An embedding of the universal Askey-Wilson algebra into Uq (sl2) ⊗Uq (sl2) ⊗Uq (sl2)

NASA Astrophysics Data System (ADS)

Huang, Hau-Wen

2017-09-01

The Askey-Wilson algebras were used to interpret the algebraic structure hidden in the Racah-Wigner coefficients of the quantum algebra Uq (sl2). In this paper, we display an injection of a universal analog △q of Askey-Wilson algebras into Uq (sl2) ⊗Uq (sl2) ⊗Uq (sl2) behind the application. Moreover we establish the decomposition rules for 3-fold tensor products of irreducible Verma Uq (sl2)-modules and of finite-dimensional irreducible Uq (sl2)-modules into the direct sums of finite-dimensional irreducible △q-modules. As an application, we derive a formula for the Racah-Wigner coefficients of Uq (sl2).

The Effects of History of Mathematics on Attitudes Toward Mathematics of College Algebra Students

ERIC Educational Resources Information Center

McBride, Cecil; Rollins, James H.

1977-01-01

Two college algebra classes were exposed to items from mathematics history in their classroom instruction, while two other college algebra classes received no such exposure. Results showed a significant positive attitude change of the mathematics history group. (DT)

A Worked Example for Creating Worked Examples

ERIC Educational Resources Information Center

McGinn, Kelly M.; Lange, Karin E.; Booth, Julie L.

2015-01-01

Researchers have extensively documented, and math teachers know from experience, that algebra is a "gatekeeper" to more advanced mathematical topics. Students must have a strong understanding of fundamental algebraic concepts to be successful in later mathematics courses. Unfortunately, algebraic misconceptions that students may form or…

Earth Algebra: Real-Life Mathematics in Navajoland.

ERIC Educational Resources Information Center

Schaufele, Christopher; Srivastava, Ravindra

1995-01-01

An algebra class at Navajo Community College (Shiprock, New Mexico) uses traditional algebra topics to study real-life situations, focuses on environmental issues, encourages collaborative learning, uses modern technology, and promotes development of critical thinking and decision-making skills. Students follow principles of Dine educational…

Learning Activity Package, Algebra.

ERIC Educational Resources Information Center

Evans, Diane

A set of ten teacher-prepared Learning Activity Packages (LAPs) in beginning algebra and nine in intermediate algebra, these units cover sets, properties of operations, number systems, open expressions, solution sets of equations and inequalities in one and two variables, exponents, factoring and polynomials, relations and functions, radicals,…

Algebra 1r, Mathematics (Experimental): 5215.13.

ERIC Educational Resources Information Center

Strachan, Florence

This third of six guidebooks on minimum course content for first-year algebra includes work with laws of exponents; multiplication, division, and factoring of polynomials; and fundamental operations with rational algebraic expressions. Course goals are stated, performance objectives listed, a course outline provided, testbook references specified…

Relational Algebra and SQL: Better Together

ERIC Educational Resources Information Center

McMaster, Kirby; Sambasivam, Samuel; Hadfield, Steven; Wolthuis, Stuart

2013-01-01

In this paper, we describe how database instructors can teach Relational Algebra and Structured Query Language together through programming. Students write query programs consisting of sequences of Relational Algebra operations vs. Structured Query Language SELECT statements. The query programs can then be run interactively, allowing students to…

Using Students' Interests as Algebraic Models

ERIC Educational Resources Information Center

Whaley, Kenneth A.

2012-01-01

Fostering algebraic thinking is an important goal for middle-grades mathematics teachers. Developing mathematical reasoning requires that teachers cultivate students' habits of mind. Teachers develop students' understanding of algebra by engaging them in tasks that involve modeling and representation. This study was designed to investigate how…

Oleanna Math Program Materials.

ERIC Educational Resources Information Center

Coole, Walter A.

This document is a collection of course outlines, syllabi, and test materials designed for several high school level and lower division mathematics courses taught in an auto-tutorial learning laboratory at Skagit Valley College (Washington). The courses included are: Pre-Algebra, Basic Algebra, Plan Geometry, Intermediate Algebra, Probability and…

Utilization of variation theory in the classroom: Effect on students' algebraic achievement and motivation

NASA Astrophysics Data System (ADS)

Jing, Ting Jing; Tarmizi, Rohani Ahmad; Bakar, Kamariah Abu; Aralas, Dalia

2017-01-01

This study investigates the effect of utilizing Variation Theory Based Strategy on students' algebraic achievement and motivation in learning algebra. The study used quasi-experimental non-equivalent control group research design and involved 56 Form Two (Secondary Two) students in two classes (28 in experimental group, 28 in control group) in Malaysia The first class of students went through algebra class taught with Variation Theory Based Strategy (VTBS) while the second class of students experienced conventional teaching strategy. The instruments used for the study were a 24-item Algebra Test and 36-item Instructional Materials Motivation Survey. Result from analysis of Covariance indicated that experimental group students achieved significantly better test scores than control group. Result of Multivariate Analysis of Variance also shows evidences of significant effect of VTBS on experimental students' overall motivation in all the five subscales; attention, relevance, confidence, and satisfaction. These results suggested the utilization of VTBS would improve students' learning in algebra.

Contributions of Domain-General Cognitive Resources and Different Forms of Arithmetic Development to Pre-Algebraic Knowledge

PubMed Central

Fuchs, Lynn S.; Compton, Donald L.; Fuchs, Douglas; Powell, Sarah R.; Schumacher, Robin F.; Hamlett, Carol L.; Vernier, Emily; Namkung, Jessica M.; Vukovic, Rose K.

2012-01-01

The purpose of this study was to investigate the contributions of domain-general cognitive resources and different forms of arithmetic development to individual differences in pre-algebraic knowledge. Children (n=279; mean age=7.59 yrs) were assessed on 7 domain-general cognitive resources as well as arithmetic calculations and word problems at start of 2nd grade and on calculations, word problems, and pre-algebraic knowledge at end of 3rd grade. Multilevel path analysis, controlling for instructional effects associated with the sequence of classrooms in which students were nested across grades 2–3, indicated arithmetic calculations and word problems are foundational to pre-algebraic knowledge. Also, results revealed direct contributions of nonverbal reasoning and oral language to pre-algebraic knowledge, beyond indirect effects that are mediated via arithmetic calculations and word problems. By contrast, attentive behavior, phonological processing, and processing speed contributed to pre-algebraic knowledge only indirectly via arithmetic calculations and word problems. PMID:22409764

Brain activity associated with translation from a visual to a symbolic representation in algebra and geometry.

PubMed

Leikin, Mark; Waisman, Ilana; Shaul, Shelley; Leikin, Roza

2014-03-01

This paper presents a small part of a larger interdisciplinary study that investigates brain activity (using event related potential methodology) of male adolescents when solving mathematical problems of different types. The study design links mathematics education research with neurocognitive studies. In this paper we performed a comparative analysis of brain activity associated with the translation from visual to symbolic representations of mathematical objects in algebra and geometry. Algebraic tasks require translation from graphical to symbolic representation of a function, whereas tasks in geometry require translation from a drawing of a geometric figure to a symbolic representation of its property. The findings demonstrate that electrical activity associated with the performance of geometrical tasks is stronger than that associated with solving algebraic tasks. Additionally, we found different scalp topography of the brain activity associated with algebraic and geometric tasks. Based on these results, we argue that problem solving in algebra and geometry is associated with different patterns of brain activity.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Genest, Vincent X.; Vinet, Luc; Zhedanov, Alexei

The algebra H of the dual -1 Hahn polynomials is derived and shown to arise in the Clebsch-Gordan problem of sl{sub -1}(2). The dual -1 Hahn polynomials are the bispectral polynomials of a discrete argument obtained from the q{yields}-1 limit of the dual q-Hahn polynomials. The Hopf algebra sl{sub -1}(2) has four generators including an involution, it is also a q{yields}-1 limit of the quantum algebra sl{sub q}(2) and furthermore, the dynamical algebra of the parabose oscillator. The algebra H, a two-parameter generalization of u(2) with an involution as additional generator, is first derived from the recurrence relation of themore » -1 Hahn polynomials. It is then shown that H can be realized in terms of the generators of two added sl{sub -1}(2) algebras, so that the Clebsch-Gordan coefficients of sl{sub -1}(2) are dual -1 Hahn polynomials. An irreducible representation of H involving five-diagonal matrices and connected to the difference equation of the dual -1 Hahn polynomials is constructed.« less

Strings on complex multiplication tori and rational conformal field theory with matrix level

NASA Astrophysics Data System (ADS)

Nassar, Ali

Conformal invariance in two dimensions is a powerful symmetry. Two-dimensional quantum field theories which enjoy conformal invariance, i.e., conformal field theories (CFTs) are of great interest in both physics and mathematics. CFTs describe the dynamics of the world sheet in string theory where conformal symmetry arises as a remnant of reparametrization invariance of the world-sheet coordinates. In statistical mechanics, CFTs describe the critical points of second order phase transitions. On the mathematics side, conformal symmetry gives rise to infinite dimensional chiral algebras like the Virasoro algebra or extensions thereof. This gave rise to the study of vertex operator algebras (VOAs) which is an interesting branch of mathematics. Rational conformal theories are a simple class of CFTs characterized by a finite number of representations of an underlying chiral algebra. The chiral algebra leads to a set of Ward identities which gives a complete non-perturbative solution of the RCFT. Identifying the chiral algebra of an RCFT is a very important step in solving it. Particularly interesting RCFTs are the ones which arise from the compactification of string theory as sigma-models on a target manifold M. At generic values of the geometric moduli of M, the corresponding CFT is not rational. Rationality can arise at particular values of the moduli of M. At these special values of the moduli, the chiral algebra is extended. This interplay between the geometric picture and the algebraic description encoded in the chiral algebra makes CFTs/RCFTs a perfect link between physics and mathematics. It is always useful to find a geometric interpretation of a chiral algebra in terms of a sigma-model on some target manifold M. Then the next step is to figure out the conditions on the geometric moduli of M which gives a RCFT. In this thesis, we limit ourselves to the simplest class of string compactifications, i.e., strings on tori. As Gukov and Vafa proved, rationality selects the complex-multiplication tori. On the other hand, the study of the matrix-level affine algebra Um,K is motivated by conformal field theory and the fractional quantum Hall effect. Gannon completed the classification of U m,K modular-invariant partition functions. Here we connect the algebra U2,K to strings on 2-tori describable by rational conformal field theories. We point out that the rational conformal field theories describing strings on complex-multiplication tori have characters and partition functions identical to those of the matrix-level algebra Um,K. This connection makes obvious that the rational theories are dense in the moduli space of strings on Tm, and may prove useful in other ways.

The detection and stabilisation of limit cycle for deterministic finite automata

NASA Astrophysics Data System (ADS)

Han, Xiaoguang; Chen, Zengqiang; Liu, Zhongxin; Zhang, Qing

2018-04-01

In this paper, the topological structure properties of deterministic finite automata (DFA), under the framework of the semi-tensor product of matrices, are investigated. First, the dynamics of DFA are converted into a new algebraic form as a discrete-time linear system by means of Boolean algebra. Using this algebraic description, the approach of calculating the limit cycles of different lengths is given. Second, we present two fundamental concepts, namely, domain of attraction of limit cycle and prereachability set. Based on the prereachability set, an explicit solution of calculating domain of attraction of a limit cycle is completely characterised. Third, we define the globally attractive limit cycle, and then the necessary and sufficient condition for verifying whether all state trajectories of a DFA enter a given limit cycle in a finite number of transitions is given. Fourth, the problem of whether a DFA can be stabilised to a limit cycle by the state feedback controller is discussed. Criteria for limit cycle-stabilisation are established. All state feedback controllers which implement the minimal length trajectories from each state to the limit cycle are obtained by using the proposed algorithm. Finally, an illustrative example is presented to show the theoretical results.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carpenter, J.A.

This report is a sequel to ORNL/CSD-96 in the ongoing supplements to Professor A.S. Householder's KWIC Index for Numerical Algebra. With this supplement, the coverage has been restricted to Numerical Linear Algebra and is now roughly characterized by the American Mathematical Society's classification section 15 and 65F but with little coverage of inifinite matrices, matrices over fields of characteristics other than zero, operator theory, optimization and those parts of matrix theory primarily combinatorial in nature. Some recognition is made of the uses of graph theory in Numerical Linear Algebra, particularly as regards their use in algorithms for sparse matrix computations.more » The period covered by this report is roughly the calendar year 1981 as measured by the appearance of the articles in the American Mathematical Society's Contents of Mathematical Publications. The review citations are limited to the Mathematical Reviews (MR) and Das Zentralblatt fur Mathematik und Ihre Grenzgebiete (ZBL). Future reports will be made more timely by closer ovservation of the few journals which supply the bulk of the listings rather than what appears to be too much reliance on secondary sources. Some thought is being given to the physical appearance of these reports and the author welcomes comments concerning both their appearance and contents.« less

Closed, analytic, boson realizations for Sp(4)

NASA Astrophysics Data System (ADS)

Klein, Abraham; Zhang, Qing-Ying

1986-08-01

The problem of determing a boson realization for an arbitrary irrep of the unitary simplectic algebra Sp(2d) [or of the corresponding discrete unitary irreps of the unbounded algebra Sp(2d,R)] has been solved completely in recent papers by Deenen and Quesne [J. Deenen and C. Quesne, J. Math. Phys. 23, 878, 2004 (1982); 25, 1638 (1984); 26, 2705 (1985)] and by Moshinsky and co-workers [O. Castaños, E. Chacón, M. Moshinsky, and C. Quesne, J. Math. Phys. 26, 2107 (1985); M. Moshinsky, ``Boson realization of symplectic algebras,'' to be published]. This solution is not known in closed analytic form except for d=1 and for special classes of irreps for d>1. A different method of obtaining a boson realization that solves the full problem for Sp(4) is described. The method utilizes the chain Sp(2d)⊇SU(2)×SU(2) ×ṡṡṡ×SU(2) (d times), which, for d≥4, does not provide a complete set of quantum numbers. Though a simple solution of the missing label problem can be given, this solution does not help in the construction of a mapping algorithm for general d.

Two-spectral Yang-Baxter operators in topological quantum computation

NASA Astrophysics Data System (ADS)

Sanchez, William F.

2011-05-01

One of the current trends in quantum computing is the application of algebraic topological methods in the design of new algorithms and quantum computers, giving rise to topological quantum computing. One of the tools used in it is the Yang-Baxter equation whose solutions are interpreted as universal quantum gates. Lately, more general Yang-Baxter equations have been investigated, making progress as two-spectral equations and Yang-Baxter systems. This paper intends to apply these new findings to the field of topological quantum computation, more specifically, the proposition of the two-spectral Yang-Baxter operators as universal quantum gates for 2 qubits and 2 qutrits systems, obtaining 4x4 and 9x9 matrices respectively, and further elaboration of the corresponding Hamiltonian by the use of computer algebra software Mathematica® and its Qucalc package. In addition, possible physical systems to which the Yang-Baxter operators obtained can be applied are considered. In the present work it is demonstrated the utility of the Yang-Baxter equation to generate universal quantum gates and the power of computer algebra to design them; it is expected that these mathematical studies contribute to the further development of quantum computers

An algebra-based method for inferring gene regulatory networks.

PubMed

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 dynamic patterns present in the network. Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html.

Algebraic Thinking through Koch Snowflake Constructions

ERIC Educational Resources Information Center

Ghosh, Jonaki B.

2016-01-01

Generalizing is a foundational mathematical practice for the algebra classroom. It entails an act of abstraction and forms the core of algebraic thinking. Kinach (2014) describes two kinds of generalization--by analogy and by extension. This article illustrates how exploration of fractals provides ample opportunity for generalizations of both…

Practicing Algebraic Skills: A Conceptual Approach

ERIC Educational Resources Information Center

Friedlander, Alex; Arcavi, Abraham

2012-01-01

Traditionally, a considerable part of teaching and learning algebra has focused on routine practice and the application of rules, procedures, and techniques. Although today's computerized environments may have decreased the need to master algebraic skills, procedural competence is still a central component in any mathematical activity. However,…

The Structural Algebra Option: A Discussion Paper.

ERIC Educational Resources Information Center

Kirshner, David

The goal of this paper is to renew interest in the structural option to algebra instruction. Concern for the usual secondary school algebra curriculum related to simplifying expressions, solving equations, and rationalizing numerators and denominators is viewed from three pedagogical approaches: (1) structural approach, (2) empirical approach, and…

Abstract Algebra for Teachers: An Evaluative Case Study

ERIC Educational Resources Information Center

Hoffman, Andrew Joseph

2017-01-01

This manuscript describes the study of an abstract algebra course for preservice secondary mathematics teachers (PSMTs). Often, courses in abstract algebra have not been viewed as productive, beneficial learning experiences for future teachers, both by researchers and PSMTs themselves. This despite calls for increased content knowledge for…

Solving Absolute Value Equations Algebraically and Geometrically

ERIC Educational Resources Information Center

Shiyuan, Wei

2005-01-01

The way in which students can improve their comprehension by understanding the geometrical meaning of algebraic equations or solving algebraic equation geometrically is described. Students can experiment with the conditions of the absolute value equation presented, for an interesting way to form an overall understanding of the concept.

Implementing the Curriculum and Evaluation Standards: First-Year Algebra.

ERIC Educational Resources Information Center

Kysh, Judith

1991-01-01

Described is an alternative first year algebra program developed to bridge the gap between the NCTM's Curriculum and Evaluation Standards and institutional demands of schools. Increased attention is given to graphing as a context for algebra, calculator use, solving "memorable problems," and incorporating geometry concepts, while…

Focus on Fractions to Scaffold Algebra

ERIC Educational Resources Information Center

Ooten, Cheryl Thomas

2013-01-01

Beginning algebra is a gatekeeper course into the pipeline to higher mathematics courses required for respected professions in engineering, science, statistics, mathematics, education, and technology. Beginning algebra can also be a perfect storm if the necessary foundational skills are not within a student's grasp. What skills ensure beginning…

Statistical Aspects of Coherent States of the Higgs Algebra

NASA Astrophysics Data System (ADS)

Shreecharan, T.; Kumar, M. Naveen

2018-04-01

We construct and study various aspects of coherent states of a polynomial angular momentum algebra. The coherent states are constructed using a new unitary representation of the nonlinear algebra. The new representation involves a parameter γ that shifts the eigenvalues of the diagonal operator J 0.

Playing Your Cards Right: Integers for Algebra

ERIC Educational Resources Information Center

Tillema, Erik; Gatza, Andrew; Ulrich, Catherine

2017-01-01

The number and algebra strand of the "Australian Curriculum: Mathematics" (2015) advocates for holding together the study of number and algebra across years K-8--a position that mathematics educators have endorsed in many countries. This recommendation along with the report "Shape of the Australian Curriculum: Mathematics"…

Institute for Defense Analysis. Annual Report 1995.

DTIC Science & Technology

1995-01-01

staff have been involved in the community-wide development of MPI as well as in its application to specific NSA problems. 35 Parallel Groebner ...Basis Code — Symbolic Computing on Parallel Machines The Groebner basis method is a set of algorithms for reformulating very complex algebraic expres

Advanced Algebra and Calculus. High School Mathematics Curricula. Instructor's Guide.

ERIC Educational Resources Information Center

Natour, Denise M.

This manual is an instructor's guide for the utilization of the "CCA High School Mathematics Curricula: Advanced Algebra and Calculus" courseware developed by the Computer-based Education Research Laboratory (CERL). The curriculum comprises 34 algebra lessons within 12 units and 15 calculus lessons that are computer-based and require…

The Algebra of Complex Numbers.

ERIC Educational Resources Information Center

LePage, Wilbur R.

This programed text is an introduction to the algebra of complex numbers for engineering students, particularly because of its relevance to important problems of applications in electrical engineering. It is designed for a person who is well experienced with the algebra of real numbers and calculus, but who has no experience with complex number…

Soft translations and soft extensions of BCI/BCK-algebras.

PubMed

Sultana, Nazra; Rani, Nazia; Ali, Muhammad Irfan; Hussain, Azhar

2014-01-01

The concept of soft translations of soft subalgebras and soft ideals over BCI/BCK-algebras is introduced and some related properties are studied. Notions of Soft extensions of soft subalgebras and soft ideals over BCI/BCK-algebras are also initiated. Relationships between soft translations and soft extensions are explored.

Funny Face Contest: A Formative Assessment

ERIC Educational Resources Information Center

Colen, Yong S.

2010-01-01

Many American students begin their high school mathematics study with the algebra 1-geometry-algebra 2 sequence. After algebra 2, then, students with average or below-average mathematical ability face a dilemma in choosing their next mathematics course. For students to succeed in higher mathematics, understanding the concept of functions is…

University of Chicago School Mathematics Project (UCSMP) Algebra. WWC Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2009

2009-01-01

University of Chicago School Mathematics Project (UCSMP) Algebra is a one-year course covering three primary topics: (1) linear and quadratic expressions, sentences, and functions; (2) exponential expressions and functions; and (3) linear systems. Topics from geometry, probability, and statistics are integrated with the appropriate algebra.…

Earth Algebra.

ERIC Educational Resources Information Center

Schaufele, Christopher; Zumoff, Nancy

Earth Algebra is an entry level college algebra course that incorporates the spirit of the National Council of Teachers of Mathematics (NCTM) Curriculum and Evaluation Standards for School Mathematics at the college level. The context of the course places mathematics at the center of one of the major current concerns of the world. Through…

Pre-Algebra Lexicon.

ERIC Educational Resources Information Center

Hayden, Dunstan; Cuevas, Gilberto

The pre-algebra lexicon is a set of classroom exercises designed to teach the technical words and phrases of pre-algebra mathematics, and includes the terms most commonly found in related mathematics courses. The lexicon has three parts, each with its own introduction. The first introduces vocabulary items in three groups forming a learning…

Algebridge. Concept Based Instructional Assessment.

ERIC Educational Resources Information Center

College Entrance Examination Board, Princeton, NJ.

Students who study algebra are more likely to attend college than those who don't. A major hurdle for students in studying algebra is the transition from arithmetic to algebra. In response to overcoming this hurdle, the College Board and Educational Testing Service has developed "Algebridge," a teaching supplement that integrates…

Generalized Quantum Field Theory Based on a Nonlinear Deformed Heisenberg Algebra

NASA Astrophysics Data System (ADS)

Ribeiro-Silva, C. I.; Oliveira-Neto, N. M.

We consider a quantum field theory based on a nonlinear Heisenberg algebra which describes phenomenologically a composite particle. Perturbative computation, considering the λϕ4 interaction was done and we also performed some comparison with a quantum field theory based on the q-oscillator algebra.

Learning Algebra from Worked Examples

ERIC Educational Resources Information Center

Lange, Karin E.; Booth, Julie L.; Newton, Kristie J.

2014-01-01

For students to be successful in algebra, they must have a truly conceptual understanding of key algebraic features as well as the procedural skills to complete a problem. One strategy to correct students' misconceptions combines the use of worked example problems in the classroom with student self-explanation. "Self-explanation" is the…

Some Applications of Algebraic System Solving

ERIC Educational Resources Information Center

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…

Cognitive Tutor[R] Algebra I. What Works Clearinghouse Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2009

2009-01-01

The "Cognitive Tutor[R] Algebra I" curriculum, published by Carnegie Learning, is an approach that combines algebra textbooks with interactive software. The software is developed around an artificial intelligence model that identifies strengths and weaknesses in each individual student's mastery of mathematical concepts. It then customizes prompts…

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

ERIC Educational Resources Information Center

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…

The Zero Product Principle Error.

ERIC Educational Resources Information Center

Padula, Janice

1996-01-01

Argues that the challenge for teachers of algebra in Australia is to find ways of making the structural aspects of algebra accessible to a greater percentage of students. Uses the zero product principle to provide an example of a common student error grounded in the difficulty of understanding the structure of algebra. (DDR)

Pre-Service Teachers' Perceptions and Beliefs of Technological Pedagogical Content Knowledge on Algebra

ERIC Educational Resources Information Center

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

2015-01-01

The purpose of this study was to investigate elementary pre-service teachers' content knowledge in algebra (Linear Equation, Quadratic Equation, Functions, System Equations and Polynomials) as well as their technological pedagogical content knowledge (TPACK) in teaching algebra. Participants were 79 undergraduate pre-service teachers who were…

Improving Algebra Preparation: Implications from Research on Student Misconceptions and Difficulties

ERIC Educational Resources Information Center

Welder, Rachael M.

2012-01-01

Through historical and contemporary research, educators have identified widespread misconceptions and difficulties faced by students in learning algebra. Many of these universal issues stem from content addressed long before students take their first algebra course. Yet elementary and middle school teachers may not understand how the subtleties of…

Who Takes College Algebra?

ERIC Educational Resources Information Center

Herriott, Scott R.; Dunbar, Steven R.

2009-01-01

The common understanding within the mathematics community is that the role of the college algebra course is to prepare students for calculus. Though exceptions are emerging, the curriculum of most college algebra courses and the content of most textbooks on the market both reflect that assumption. This article calls that assumption into question…

An Analysis of Content Knowledge and Cognitive Abilities as Factors That Are Associated with Algebra Performance

ERIC Educational Resources Information Center

McLean, Tamika Ann

2017-01-01

The current study investigated college students' content knowledge and cognitive abilities as factors associated with their algebra performance, and examined how combinations of content knowledge and cognitive abilities related to their algebra performance. Specifically, the investigation examined the content knowledge factors of computational…

Teaching Linear Algebra: Must the Fog Always Roll In?

ERIC Educational Resources Information Center

Carlson, David

1993-01-01

Proposes methods to teach the more difficult concepts of linear algebra. Examines features of the Linear Algebra Curriculum Study Group Core Syllabus, and presents problems from the core syllabus that utilize the mathematical process skills of making conjectures, proving the results, and communicating the results to colleagues. Presents five…

Math 3013--Developmental Mathematics I and II. Course Outline.

ERIC Educational Resources Information Center

New York Inst. of Tech., Old Westbury.

This document contains the course syllabus and 12 independent practice modules for an introductory college algebra course that requires some previous knowledge of algebra and the ability to work at a rapid pace. Topics include the basic operations with signed integers; fractions; decimals; literal expressions; algebraic fractions; radicals;…

A Learning Progressions Approach to Early Algebra Research and Practice

ERIC Educational Resources Information Center

Fonger, Nicole L.; Stephens, Ana; Blanton, Maria; Knuth, Eric

2015-01-01

We detail a learning progressions approach to early algebra research and how existing work around learning progressions and trajectories in mathematics and science education has informed our development of a four-component theoretical framework consisting of: a curricular progression of learning goals across big algebraic ideas; an instructional…

Ten-Year-Old Students Solving Linear Equations

ERIC Educational Resources Information Center

Brizuela, Barbara; Schliemann, Analucia

2004-01-01

In this article, the authors seek to re-conceptualize the perspective regarding students' difficulties with algebra. While acknowledging that students "do" have difficulties when learning algebra, they also argue that the generally espoused criteria for algebra as the ability to work with the syntactical rules for solving equations is…

Measuring the Readability of Elementary Algebra Using the Cloze Technique.

ERIC Educational Resources Information Center

Kulm, Gerald

The relationship to readability of ten variables characterizing structural properties of mathematical prose was investigated in elementary algebra textbooks. Readability was measured by algebra student's responses to two forms of cloze tests. Linear and currilinear correlations were calculated between each structural variable and the cloze test.…

Astro Algebra [CD-ROM].

ERIC Educational Resources Information Center

1997

Astro Algebra is one of six titles in the Mighty Math Series from Edmark, a comprehensive line of math software for students from kindergarten through ninth grade. Many of the activities in Astro Algebra contain a unique technology that uses the computer to help students make the connection between concrete and abstract mathematics. This software…

An Inquiry-Based Linear Algebra Class

ERIC Educational Resources Information Center

Wang, Haohao; Posey, Lisa

2011-01-01

Linear algebra is a standard undergraduate mathematics course. This paper presents an overview of the design and implementation of an inquiry-based teaching material for the linear algebra course which emphasizes discovery learning, analytical thinking and individual creativity. The inquiry-based teaching material is designed to fit the needs of a…

Numerical Linear Algebra.

DTIC Science & Technology

1980-09-08

February 1979 through 31 March 1980 Title of Research: NUMERICAL LINEAR ALGEBRA Principal Investigators: Gene H. Golub James H. Wilkinson Research...BEFORE COMPLETING FORM 2 OTAgSSION NO. 3. RECIPIENT’S CATALOG NUMBER ITE~ btitle) ~qEE NUMERICAL LINEAR ALGEBRA #I ~ f#7&/8 PER.ORMING ORG. REPORT NUM 27R 7

Three Phase Ranking Framework for Assessing Conceptual Understanding in Algebra Using Multiple Representations

ERIC Educational Resources Information Center

Panasuk, Regina M.

2010-01-01

Algebra students may often demonstrate a certain degree of proficiency when manipulating algebraic expressions and verbalizing their behaviors. Do these abilities imply conceptual understanding? What is a reliable indicator that would provide educators with a relatively trustworthy and consistent measure to identify whether students learn…

The interplay between group crossed products, semigroup crossed products and toeplitz algebras

NASA Astrophysics Data System (ADS)

Yusnitha, I.

2018-05-01

Realization of group crossed products constructed by decomposition, as semigroup crossed products. And connected it to Toeplitz algebra of ordered group quotient to get some preliminaries description for the further study on the structure of Toeplitz algebras of ordered group which is finitely generated.

Promoting Quantitative Literacy in an Online College Algebra Course

ERIC Educational Resources Information Center

Tunstall, Luke; Bossé, Michael J.

2016-01-01

College algebra (a university freshman level algebra course) fulfills the quantitative literacy requirement of many college's general education programs and is a terminal course for most who take it. An online problem-based learning environment provides a unique means of engaging students in quantitative discussions and research. This article…

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

ERIC Educational Resources Information Center

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…

Algebraic Concepts: What's Really New in New Curricula?

ERIC Educational Resources Information Center

Star, Jon R.; Herbel-Eisenmann, Beth A.; Smith, John P., III

2000-01-01

Examines 8th grade units from the Connected Mathematics Project (CMP). Identifies differences in older and newer conceptions, fundamental objects of study, typical problems, and typical solution methods in algebra. Also discusses where the issue of what is new in algebra is relevant to many other innovative middle school curricula. (KHR)

Seeing through Symbols: The Case of Equivalent Expressions.

ERIC Educational Resources Information Center

Kieran, Carolyn; Sfard, Anna

1999-01-01

Presents a teaching experiment to turn students from external observers into active participants in a game of algebra learning where students use graphs to build meaning for equivalence of algebraic expressions. Concludes that the graphic-functional approach seems to make the introduction to algebra much more meaningful for the learner. (ASK)

Lattice Virasoro algebra and corner transfer matrices in the Baxter eight-vertex model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Itoyama, H.; Thacker, H.B.

1987-04-06

A lattice Virasoro algebra is constructed for the Baxter eight-vertex model. The operator L/sub 0/ is obtained from the logarithm of the corner transfer matrix and is given by the first moment of the XYZ spin-chain Hamiltonian. The algebra is valid even when the Hamiltonian includes a mass term, in which case it represents lattice coordinate transformations which distinguish between even and odd sublattices. We apply the quantum inverse scattering method to demonstrate that the Virasoro algebra follows from the Yang-Baxter relations.