Software for Training in Pre-College Mathematics

NASA Technical Reports Server (NTRS)

Shelton, Robert O.; Moebes, Travis A.; VanAlstine, Scot

2003-01-01

The Intelligent Math Tutor (IMT) is a computer program for training students in pre-college and college-level mathematics courses, including fundamentals, intermediate algebra, college algebra, and trigonometry. The IMT can be executed on a server computer for access by students via the Internet; alternatively, it can be executed on students computers equipped with compact- disk/read-only-memory (CD-ROM) drives. The IMT provides interactive exercises, assessment, tracking, and an on-line graphing calculator with algebraic-manipulation capabilities. The IMT provides an innovative combination of content, delivery mechanism, and artificial intelligence. Careful organization and presentation of the content make it possible to provide intelligent feedback to the student based on performance on exercises and tests. The tracking and feedback mechanisms are implemented within the capabilities of a commercial off-the-shelf development software tool and are written in the Unified Modeling Language to maximize reuse and minimize development cost. The graphical calculator is a standard feature of most college and pre-college algebra and trigonometry courses. Placing this functionality in a Java applet decreases the cost, provides greater capabilities, and provides an opportunity to integrate the calculator with the lessons.

Using e-Learning Platforms for Mastery Learning in Developmental Mathematics Courses

ERIC Educational Resources Information Center

Boggs, Stacey; Shore, Mark; Shore, JoAnna

2004-01-01

Many colleges and universities have adopted e-learning platforms to utilize computers as an instructional tool in developmental (i.e., beginning and intermediate algebra) mathematics courses. An e-learning platform is a computer program used to enhance course instruction via computers and the Internet. Allegany College of Maryland is currently…

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

NASA Astrophysics Data System (ADS)

Trujillo Arredondo, Mariana

2014-06-01

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

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

SPARSKIT: A basic tool kit for sparse matrix computations

NASA Technical Reports Server (NTRS)

Saad, Youcef

1990-01-01

Presented here are the main features of a tool package for manipulating and working with sparse matrices. One of the goals of the package is to provide basic tools to facilitate the exchange of software and data between researchers in sparse matrix computations. The starting point is the Harwell/Boeing collection of matrices for which the authors provide a number of tools. Among other things, the package provides programs for converting data structures, printing simple statistics on a matrix, plotting a matrix profile, and performing linear algebra operations with sparse matrices.

A Cohomological Perspective on Algebraic Quantum Field Theory

NASA Astrophysics Data System (ADS)

Hawkins, Eli

2018-05-01

Algebraic quantum field theory is considered from the perspective of the Hochschild cohomology bicomplex. This is a framework for studying deformations and symmetries. Deformation is a possible approach to the fundamental challenge of constructing interacting QFT models. Symmetry is the primary tool for understanding the structure and properties of a QFT model. This perspective leads to a generalization of the algebraic quantum field theory framework, as well as a more general definition of symmetry. This means that some models may have symmetries that were not previously recognized or exploited. To first order, a deformation of a QFT model is described by a Hochschild cohomology class. A deformation could, for example, correspond to adding an interaction term to a Lagrangian. The cohomology class for such an interaction is computed here. However, the result is more general and does not require the undeformed model to be constructed from a Lagrangian. This computation leads to a more concrete version of the construction of perturbative algebraic quantum field theory.

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.

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.

Computer algebra and operators

NASA Technical Reports Server (NTRS)

Fateman, Richard; Grossman, Robert

1989-01-01

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

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

ERIC Educational Resources Information Center

Gonzalez-Vega, Laureano

1999-01-01

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

Algorithms for computations of Loday algebras' invariants

NASA Astrophysics Data System (ADS)

Hussain, Sharifah Kartini Said; Rakhimov, I. S.; Basri, W.

2017-04-01

The paper is devoted to applications of some computer programs to study structural determination of Loday algebras. We present how these computer programs can be applied in computations of various invariants of Loday algebras and provide several computer programs in Maple to verify Loday algebras' identities, the isomorphisms between the algebras, as a special case, to describe the automorphism groups, centroids and derivations.

RANS modeling of scalar dispersion from localized sources within a simplified urban-area model

NASA Astrophysics Data System (ADS)

Rossi, Riccardo; Capra, Stefano; Iaccarino, Gianluca

2011-11-01

The dispersion of a passive scalar downstream a localized source within a simplified urban-like geometry is examined by means of RANS scalar flux models. The computations are conducted under conditions of neutral stability and for three different incoming wind directions (0°, 45°, 90°) at a roughness Reynolds number of Ret = 391. A Reynolds stress transport model is used to close the flow governing equations whereas both the standard eddy-diffusivity closure and algebraic flux models are employed to close the transport equation for the passive scalar. The comparison with a DNS database shows improved reliability from algebraic scalar flux models towards predicting both the mean concentration and the plume structure. Since algebraic flux models do not increase substantially the computational effort, the results indicate that the use of tensorial-diffusivity can be promising tool for dispersion simulations for the urban environment.

Efficient hybrid-symbolic methods for quantum mechanical calculations

NASA Astrophysics Data System (ADS)

Scott, T. C.; Zhang, Wenxing

2015-06-01

We present hybrid symbolic-numerical tools to generate optimized numerical code for rapid prototyping and fast numerical computation starting from a computer algebra system (CAS) and tailored to any given quantum mechanical problem. Although a major focus concerns the quantum chemistry methods of H. Nakatsuji which has yielded successful and very accurate eigensolutions for small atoms and molecules, the tools are general and may be applied to any basis set calculation with a variational principle applied to its linear and non-linear parameters.

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.

Software Reviews.

ERIC Educational Resources Information Center

Teles, Elizabeth, Ed.; And Others

1990-01-01

Reviewed are two computer software packages for Macintosh microcomputers including "Phase Portraits," an exploratory graphics tool for studying first-order planar systems; and "MacMath," a set of programs for exploring differential equations, linear algebra, and other mathematical topics. Features, ease of use, cost, availability, and hardware…

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…

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…

The Impact on Student Achievement of When CAS Technology Is Introduced

ERIC Educational Resources Information Center

Driver, David

2012-01-01

When a Computer Algebra System (CAS) is used as a pedagogical and functional tool in class and as a functional tool in exams, its effect on student achievement can be quite profound. The timing of when students are first introduced to a CAS has an impact on gains in student achievement. In this action research project, the CAS calculator was…

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

Kitanidis, Peter

As large-scale, commercial storage projects become operational, the problem of utilizing information from diverse sources becomes more critically important. In this project, we developed, tested, and applied an advanced joint data inversion system for CO 2 storage modeling with large data sets for use in site characterization and real-time monitoring. Emphasis was on the development of advanced and efficient computational algorithms for joint inversion of hydro-geophysical data, coupled with state-of-the-art forward process simulations. The developed system consists of (1) inversion tools using characterization data, such as 3D seismic survey (amplitude images), borehole log and core data, as well as hydraulic,more » tracer and thermal tests before CO 2 injection, (2) joint inversion tools for updating the geologic model with the distribution of rock properties, thus reducing uncertainty, using hydro-geophysical monitoring data, and (3) highly efficient algorithms for directly solving the dense or sparse linear algebra systems derived from the joint inversion. The system combines methods from stochastic analysis, fast linear algebra, and high performance computing. The developed joint inversion tools have been tested through synthetic CO 2 storage examples.« less

Computing Gröbner Bases within Linear Algebra

NASA Astrophysics Data System (ADS)

Suzuki, Akira

In this paper, we present an alternative algorithm to compute Gröbner bases, which is based on computations on sparse linear algebra. Both of S-polynomial computations and monomial reductions are computed in linear algebra simultaneously in this algorithm. So it can be implemented to any computational system which can handle linear algebra. For a given ideal in a polynomial ring, it calculates a Gröbner basis along with the corresponding term order appropriately.

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…

Motion Planning in a Society of Intelligent Mobile Agents

NASA Technical Reports Server (NTRS)

Esterline, Albert C.; Shafto, Michael (Technical Monitor)

2002-01-01

The majority of the work on this grant involved formal modeling of human-computer integration. We conceptualize computer resources as a multiagent system so that these resources and human collaborators may be modeled uniformly. In previous work we had used modal for this uniform modeling, and we had developed a process-algebraic agent abstraction. In this work, we applied this abstraction (using CSP) in uniformly modeling agents and users, which allowed us to use tools for investigating CSP models. This work revealed the power of, process-algebraic handshakes in modeling face-to-face conversation. We also investigated specifications of human-computer systems in the style of algebraic specification. This involved specifying the common knowledge required for coordination and process-algebraic patterns of communication actions intended to establish the common knowledge. We investigated the conditions for agents endowed with perception to gain common knowledge and implemented a prototype neural-network system that allows agents to detect when such conditions hold. The literature on multiagent systems conceptualizes communication actions as speech acts. We implemented a prototype system that infers the deontic effects (obligations, permissions, prohibitions) of speech acts and detects violations of these effects. A prototype distributed system was developed that allows users to collaborate in moving proxy agents; it was designed to exploit handshakes and common knowledge Finally. in work carried over from a previous NASA ARC grant, about fifteen undergraduates developed and presented projects on multiagent motion planning.

Enhancing Undergraduate Mathematics Curriculum via Coding Theory and Cryptography

ERIC Educational Resources Information Center

Aydin, Nuh

2009-01-01

The theory of error-correcting codes and cryptography are two relatively recent applications of mathematics to information and communication systems. The mathematical tools used in these fields generally come from algebra, elementary number theory, and combinatorics, including concepts from computational complexity. It is possible to introduce the…

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

NASA Astrophysics Data System (ADS)

Dukkipati, Ambedkar; Manathara, Joel George

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csisźar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Gröbner bases method to compute an implicit representation of minimum KL-divergence models.

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…

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.

Quantization of Poisson Manifolds from the Integrability of the Modular Function

NASA Astrophysics Data System (ADS)

Bonechi, F.; Ciccoli, N.; Qiu, J.; Tarlini, M.

2014-10-01

We discuss a framework for quantizing a Poisson manifold via the quantization of its symplectic groupoid, combining the tools of geometric quantization with the results of Renault's theory of groupoid C*-algebras. This setting allows very singular polarizations. In particular, we consider the case when the modular function is multiplicatively integrable, i.e., when the space of leaves of the polarization inherits a groupoid structure. If suitable regularity conditions are satisfied, then one can define the quantum algebra as the convolution algebra of the subgroupoid of leaves satisfying the Bohr-Sommerfeld conditions. We apply this procedure to the case of a family of Poisson structures on , seen as Poisson homogeneous spaces of the standard Poisson-Lie group SU( n + 1). We show that a bihamiltonian system on defines a multiplicative integrable model on the symplectic groupoid; we compute the Bohr-Sommerfeld groupoid and show that it satisfies the needed properties for applying Renault theory. We recover and extend Sheu's description of quantum homogeneous spaces as groupoid C*-algebras.

Computational Science in Armenia (Invited Talk)

NASA Astrophysics Data System (ADS)

Marandjian, H.; Shoukourian, Yu.

This survey is devoted to the development of informatics and computer science in Armenia. The results in theoretical computer science (algebraic models, solutions to systems of general form recursive equations, the methods of coding theory, pattern recognition and image processing), constitute the theoretical basis for developing problem-solving-oriented environments. As examples can be mentioned: a synthesizer of optimized distributed recursive programs, software tools for cluster-oriented implementations of two-dimensional cellular automata, a grid-aware web interface with advanced service trading for linear algebra calculations. In the direction of solving scientific problems that require high-performance computing resources, examples of completed projects include the field of physics (parallel computing of complex quantum systems), astrophysics (Armenian virtual laboratory), biology (molecular dynamics study of human red blood cell membrane), meteorology (implementing and evaluating the Weather Research and Forecast Model for the territory of Armenia). The overview also notes that the Institute for Informatics and Automation Problems of the National Academy of Sciences of Armenia has established a scientific and educational infrastructure, uniting computing clusters of scientific and educational institutions of the country and provides the scientific community with access to local and international computational resources, that is a strong support for computational science in Armenia.

Assisting Students' Cognitive Strategies with the Use of CAS

ERIC Educational Resources Information Center

Sarvari, Csaba; Lavicza, Zsolt; Klincsik, Mihaly

2010-01-01

This paper examines various cognitive strategies applied while CAS (Computer Algebra System) are used in undergraduate-level engineering mathematics teaching and learning. We posed some questions in relation to such CAS use: What kind of tools can CAS offer to enhance different cognitive strategies of students? How can the use of CAS widen the…

The Effect of Geogebra on Students' Conceptual and Procedural Knowledge: The Case of Applications of Derivative

ERIC Educational Resources Information Center

Ocal, Mehmet Fatih

2017-01-01

Integrating the properties of computer algebra systems and dynamic geometry environments, Geogebra became an effective and powerful tool for teaching and learning mathematics. One of the reasons that teachers use Geogebra in mathematics classrooms is to make students learn mathematics meaningfully and conceptually. From this perspective, the…

Explorations in Elementary Mathematical Modeling

ERIC Educational Resources Information Center

Shahin, Mazen

2010-01-01

In this paper we will present the methodology and pedagogy of Elementary Mathematical Modeling as a one-semester course in the liberal arts core. We will focus on the elementary models in finance and business. The main mathematical tools in this course are the difference equations and matrix algebra. We also integrate computer technology and…

Algebraic geometry and Bethe ansatz. Part I. The quotient ring for BAE

NASA Astrophysics Data System (ADS)

Jiang, Yunfeng; Zhang, Yang

2018-03-01

In this paper and upcoming ones, we initiate a systematic study of Bethe ansatz equations for integrable models by modern computational algebraic geometry. We show that algebraic geometry provides a natural mathematical language and powerful tools for understanding the structure of solution space of Bethe ansatz equations. In particular, we find novel efficient methods to count the number of solutions of Bethe ansatz equations based on Gröbner basis and quotient ring. We also develop analytical approach based on companion matrix to perform the sum of on-shell quantities over all physical solutions without solving Bethe ansatz equations explicitly. To demonstrate the power of our method, we revisit the completeness problem of Bethe ansatz of Heisenberg spin chain, and calculate the sum rules of OPE coefficients in planar N=4 super-Yang-Mills theory.

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

ERIC Educational Resources Information Center

Sangwin, Christopher J.; Naismith, Laura

2008-01-01

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

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

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

Herbert, John M.

1997-01-01

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

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.

Labeled trees and the efficient computation of derivations

NASA Technical Reports Server (NTRS)

Grossman, Robert; Larson, Richard G.

1989-01-01

The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.

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…

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…

A Study on Gröbner Basis with Inexact Input

NASA Astrophysics Data System (ADS)

Nagasaka, Kosaku

Gröbner basis is one of the most important tools in recent symbolic algebraic computations. However, computing a Gröbner basis for the given polynomial ideal is not easy and it is not numerically stable if polynomials have inexact coefficients. In this paper, we study what we should get for computing a Gröbner basis with inexact coefficients and introduce a naive method to compute a Gröbner basis by reduced row echelon form, for the ideal generated by the given polynomial set having a priori errors on their coefficients.

Computing Tutte polynomials of contact networks in classrooms

NASA Astrophysics Data System (ADS)

Hincapié, Doracelly; Ospina, Juan

2013-05-01

Objective: The topological complexity of contact networks in classrooms and the potential transmission of an infectious disease were analyzed by sex and age. Methods: The Tutte polynomials, some topological properties and the number of spanning trees were used to algebraically compute the topological complexity. Computations were made with the Maple package GraphTheory. Published data of mutually reported social contacts within a classroom taken from primary school, consisting of children in the age ranges of 4-5, 7-8 and 10-11, were used. Results: The algebraic complexity of the Tutte polynomial and the probability of disease transmission increases with age. The contact networks are not bipartite graphs, gender segregation was observed especially in younger children. Conclusion: Tutte polynomials are tools to understand the topology of the contact networks and to derive numerical indexes of such topologies. It is possible to establish relationships between the Tutte polynomial of a given contact network and the potential transmission of an infectious disease within such network

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)

GeoGebra: A Global Platform for Teaching and Learning Math Together and Using the Synergy of Mathematicians

NASA Astrophysics Data System (ADS)

Kllogjeri, Pellumb

In present age we are witnesses and practioners of computer-based education which is highly speed progressing. The computer-based education allows educators and students to use educational programming language and e-tutors to teach and learn, to interact with one another and share together the results of their work. The computer-based education is done possible by special electronic tools among which the most important are the mathematical programmes. There are many mathematical programmes, but one which is being embraced and used by a daily increasing number of users throughout the world is GeoGebra. The recently published software GeoGebra by Markus Hohenwater (2004) explicitly links geometry and algebra. GeoGebra affords a bidirectional combination of geometry and algebra that differs from earlier software forms. The bidirectional combination means that, for instance, by typing in an equation in the algebra window, the graph of the equation will be shown in the dynamic and graphic window. This programme is so much preferred because of its three main features: the double representation of the mathematical object(geometric and algebraic), there are not strong requirements as to the age and the knowledge in using it(the students of the elementary school can use it as well) and, it is offered free of charge(simply by downloading it). In this paper we are concentrating in the double representation of the mathematical object and its advantages in explaining and forming mathematical concepts and performing operations, in the global opportunities for using GeoGebra and the benefits of using it by cooperating and sharing experiences.

Simplifications for hydronic system models in modelica

DOE PAGES

Jorissen, F.; Wetter, M.; Helsen, L.

2018-01-12

Building systems and their heating, ventilation and air conditioning flow networks, are becoming increasingly complex. Some building energy simulation tools simulate these flow networks using pressure drop equations. These flow network models typically generate coupled algebraic nonlinear systems of equations, which become increasingly more difficult to solve as their sizes increase. This leads to longer computation times and can cause the solver to fail. These problems also arise when using the equation-based modelling language Modelica and Annex 60-based libraries. This may limit the applicability of the library to relatively small problems unless problems are restructured. This paper discusses two algebraicmore » loop types and presents an approach that decouples algebraic loops into smaller parts, or removes them completely. The approach is applied to a case study model where an algebraic loop of 86 iteration variables is decoupled into smaller parts with a maximum of five iteration variables.« less

Invariant classification of second-order conformally flat superintegrable systems

NASA Astrophysics Data System (ADS)

Capel, J. J.; Kress, J. M.

2014-12-01

In this paper we continue the work of Kalnins et al in classifying all second-order conformally-superintegrable (Laplace-type) systems over conformally flat spaces, using tools from algebraic geometry and classical invariant theory. The results obtained show, through Stäckel equivalence, that the list of known nondegenerate superintegrable systems over three-dimensional conformally flat spaces is complete. In particular, a seven-dimensional manifold is determined such that each point corresponds to a conformal class of superintegrable systems. This manifold is foliated by the nonlinear action of the conformal group in three dimensions. Two systems lie in the same conformal class if and only if they lie in the same leaf of the foliation. This foliation is explicitly described using algebraic varieties formed from representations of the conformal group. The proof of these results rely heavily on Gröbner basis calculations using the computer algebra software packages Maple and Singular.

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.

Combinatorial-topological framework for the analysis of global dynamics.

PubMed

Bush, Justin; Gameiro, Marcio; Harker, Shaun; Kokubu, Hiroshi; Mischaikow, Konstantin; Obayashi, Ippei; Pilarczyk, Paweł

2012-12-01

We discuss an algorithmic framework based on efficient graph algorithms and algebraic-topological computational tools. The framework is aimed at automatic computation of a database of global dynamics of a given m-parameter semidynamical system with discrete time on a bounded subset of the n-dimensional phase space. We introduce the mathematical background, which is based upon Conley's topological approach to dynamics, describe the algorithms for the analysis of the dynamics using rectangular grids both in phase space and parameter space, and show two sample applications.

Combinatorial-topological framework for the analysis of global dynamics

NASA Astrophysics Data System (ADS)

Bush, Justin; Gameiro, Marcio; Harker, Shaun; Kokubu, Hiroshi; Mischaikow, Konstantin; Obayashi, Ippei; Pilarczyk, Paweł

2012-12-01

We discuss an algorithmic framework based on efficient graph algorithms and algebraic-topological computational tools. The framework is aimed at automatic computation of a database of global dynamics of a given m-parameter semidynamical system with discrete time on a bounded subset of the n-dimensional phase space. We introduce the mathematical background, which is based upon Conley's topological approach to dynamics, describe the algorithms for the analysis of the dynamics using rectangular grids both in phase space and parameter space, and show two sample applications.

Digital Tools for Algebra Education: Criteria and Evaluation

ERIC Educational Resources Information Center

Bokhove, Christian; Drijvers, Paul

2010-01-01

In the Netherlands, as in many other countries, the algebraic expertise of students graduating from secondary education is an issue. The use of digital tools for algebra education is expected to change epistemologies, activity structures and student achievement. Therefore, a study was set up to investigate in what way the use of ICT in upper…

Solution of Inverse Kinematics for 6R Robot Manipulators With Offset Wrist Based on Geometric Algebra.

PubMed

Fu, Zhongtao; Yang, Wenyu; Yang, Zhen

2013-08-01

In this paper, we present an efficient method based on geometric algebra for computing the solutions to the inverse kinematics problem (IKP) of the 6R robot manipulators with offset wrist. Due to the fact that there exist some difficulties to solve the inverse kinematics problem when the kinematics equations are complex, highly nonlinear, coupled and multiple solutions in terms of these robot manipulators stated mathematically, we apply the theory of Geometric Algebra to the kinematic modeling of 6R robot manipulators simply and generate closed-form kinematics equations, reformulate the problem as a generalized eigenvalue problem with symbolic elimination technique, and then yield 16 solutions. Finally, a spray painting robot, which conforms to the type of robot manipulators, is used as an example of implementation for the effectiveness and real-time of this method. The experimental results show that this method has a large advantage over the classical methods on geometric intuition, computation and real-time, and can be directly extended to all serial robot manipulators and completely automatized, which provides a new tool on the analysis and application of general robot manipulators.

A Description of the Computer Assisted Assessment Program in University Elementary Algebra at Norfolk State University

ERIC Educational Resources Information Center

White, Ronald L.; Myers, Shadana; Earl, Archie W., Sr.

2008-01-01

Many colleges and universities today are faced with the problem of low student academic achievement in math. Some of them are trying to improve student academic achievement through the use of technology. Their proposed solution is to teach children how to use the technological tools available to them and integrate that technology into the…

Kleene Monads: Handling Iteration in a Framework of Generic Effects

NASA Astrophysics Data System (ADS)

Goncharov, Sergey; Schröder, Lutz; Mossakowski, Till

Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of effects for short, which made its way into modern functional programming in the shape of Haskell’s do-notation. Standard computational idioms call for specific classes of monads that support additional control operations. Here, we introduce Kleene monads, which additionally feature nondeterministic choice and Kleene star, i.e. nondeterministic iteration, and we provide a metalanguage and a sound calculus for Kleene monads, the metalanguage of control and effects, which is the natural joint extension of Kleene algebra and the metalanguage of effects. This provides a framework for studying abstract program equality focussing on iteration and effects. These aspects are known to have decidable equational theories when studied in isolation. However, it is well known that decidability breaks easily; e.g. the Horn theory of continuous Kleene algebras fails to be recursively enumerable. Here, we prove several negative results for the metalanguage of control and effects; in particular, already the equational theory of the unrestricted metalanguage of control and effects over continuous Kleene monads fails to be recursively enumerable. We proceed to identify a fragment of this language which still contains both Kleene algebra and the metalanguage of effects and for which the natural axiomatisation is complete, and indeed the equational theory is decidable.

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.

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…

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…

Some Applications Of Semigroups And Computer Algebra In Discrete Structures

NASA Astrophysics Data System (ADS)

Bijev, G.

2009-11-01

An algebraic approach to the pseudoinverse generalization problem in Boolean vector spaces is used. A map (p) is defined, which is similar to an orthogonal projection in linear vector spaces. Some other important maps with properties similar to those of the generalized inverses (pseudoinverses) of linear transformations and matrices corresponding to them are also defined and investigated. Let Ax = b be an equation with matrix A and vectors x and b Boolean. Stochastic experiments for solving the equation, which involves the maps defined and use computer algebra methods, have been made. As a result, the Hamming distance between vectors Ax = p(b) and b is equal or close to the least possible. We also share our experience in using computer algebra systems for teaching discrete mathematics and linear algebra and research. Some examples for computations with binary relations using Maple are given.

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

Parallel Algorithms for Least Squares and Related Computations.

DTIC Science & Technology

1991-03-22

for dense computations in linear algebra . The work has recently been published in a general reference book on parallel algorithms by SIAM. AFO SR...written his Ph.D. dissertation with the principal investigator. (See publication 6.) • Parallel Algorithms for Dense Linear Algebra Computations. Our...and describe and to put into perspective a selection of the more important parallel algorithms for numerical linear algebra . We give a major new

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.

Redesigning the Quantum Mechanics Curriculum to Incorporate Problem Solving Using a Computer Algebra System

NASA Astrophysics Data System (ADS)

Roussel, Marc R.

1999-10-01

One of the traditional obstacles to learning quantum mechanics is the relatively high level of mathematical proficiency required to solve even routine problems. Modern computer algebra systems are now sufficiently reliable that they can be used as mathematical assistants to alleviate this difficulty. In the quantum mechanics course at the University of Lethbridge, the traditional three lecture hours per week have been replaced by two lecture hours and a one-hour computer-aided problem solving session using a computer algebra system (Maple). While this somewhat reduces the number of topics that can be tackled during the term, students have a better opportunity to familiarize themselves with the underlying theory with this course design. Maple is also available to students during examinations. The use of a computer algebra system expands the class of feasible problems during a time-limited exercise such as a midterm or final examination. A modern computer algebra system is a complex piece of software, so some time needs to be devoted to teaching the students its proper use. However, the advantages to the teaching of quantum mechanics appear to outweigh the disadvantages.

A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry

ERIC Educational Resources Information Center

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

2012-01-01

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

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

ERIC Educational Resources Information Center

Tuluk, Güler

2014-01-01

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

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

NASA Technical Reports Server (NTRS)

Stoutemyer, D. R.

1977-01-01

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

Application of symbolic and algebraic manipulation software in solving applied mechanics problems

NASA Technical Reports Server (NTRS)

Tsai, Wen-Lang; Kikuchi, Noboru

1993-01-01

As its name implies, symbolic and algebraic manipulation is an operational tool which not only can retain symbols throughout computations but also can express results in terms of symbols. This report starts with a history of symbolic and algebraic manipulators and a review of the literatures. With the help of selected examples, the capabilities of symbolic and algebraic manipulators are demonstrated. These applications to problems of applied mechanics are then presented. They are the application of automatic formulation to applied mechanics problems, application to a materially nonlinear problem (rigid-plastic ring compression) by finite element method (FEM) and application to plate problems by FEM. The advantages and difficulties, contributions, education, and perspectives of symbolic and algebraic manipulation are discussed. It is well known that there exist some fundamental difficulties in symbolic and algebraic manipulation, such as internal swelling and mathematical limitation. A remedy for these difficulties is proposed, and the three applications mentioned are solved successfully. For example, the closed from solution of stiffness matrix of four-node isoparametrical quadrilateral element for 2-D elasticity problem was not available before. Due to the work presented, the automatic construction of it becomes feasible. In addition, a new advantage of the application of symbolic and algebraic manipulation found is believed to be crucial in improving the efficiency of program execution in the future. This will substantially shorten the response time of a system. It is very significant for certain systems, such as missile and high speed aircraft systems, in which time plays an important role.

Using the Interactive Learning Environment Aplusix for Teaching and Learning School Algebra: A Research Experiment in a Middle School

ERIC Educational Resources Information Center

Hadjerrouit, Said

2011-01-01

Most software tools that have been developed with the aim of helping students to learn school algebra have not yet achieved successful results in classroom. Almost all of them are menu-based systems that provide transformation rules in menus and buttons. Aplusix is a new interactive software tool for learning school algebra. In contrast to…

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…

Linear-Algebra Programs

NASA Technical Reports Server (NTRS)

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

1982-01-01

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

Computers and the Multiplicity of Polynomial Roots.

ERIC Educational Resources Information Center

Wavrik, John J.

1982-01-01

Described are stages in the development of a computer program to solve a particular algebra problem and the nature of algebraic computation is presented. A program in BASIC is provided to give ideas to others for developing their own programs. (MP)

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,…

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.

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

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

ERIC Educational Resources Information Center

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

2012-01-01

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

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.

Factors That Have an Effect on Students' Scores on the Florida Algebra 1 End-of-Course Assessment in Algebra 1 Classrooms Using Interactive Whiteboard Tools

ERIC Educational Resources Information Center

Kelley, Ginno Paoli

2012-01-01

This study examined the factors that have an effect on student scores on the Florida End-of-Course (EOC) Assessment in four secondary Algebra 1 classrooms using interactive whiteboard tools (IWTs). Four teachers and 335 students were observed in one public suburban school in central Florida during the second half of the spring term. Hierarchical…

Stability Analysis of Finite Difference Schemes for Hyperbolic Systems, and Problems in Applied and Computational Linear Algebra.

DTIC Science & Technology

FINITE DIFFERENCE THEORY, * LINEAR ALGEBRA , APPLIED MATHEMATICS, APPROXIMATION(MATHEMATICS), BOUNDARY VALUE PROBLEMS, COMPUTATIONS, HYPERBOLAS, MATHEMATICAL MODELS, NUMERICAL ANALYSIS, PARTIAL DIFFERENTIAL EQUATIONS, STABILITY.

Libraries for Software Use on Peregrine | High-Performance Computing | NREL

Science.gov Websites

-specific libraries. Libraries List Name Description BLAS Basic Linear Algebra Subroutines, libraries only managing hierarchically structured data. LAPACK Standard Netlib offering for computational linear algebra

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.

Imagination, Intuition, and Computing in School Algebra.

ERIC Educational Resources Information Center

Kieren, Thomas E.; Olson, Alton T.

1989-01-01

Two incidents involving novice teachers with classes in grades 7 and 10 are presented. Then considered are the nature of intuitive mathematics and contributions computers can make to such intuitive mathematics, particularly in Algebra. (MNS)

Towards Student Instrumentation of Computer-Based Algebra Systems in University Courses

ERIC Educational Resources Information Center

Stewart, Sepideh; Thomas, Michael O. J.; Hannah, John

2005-01-01

There are many perceived benefits of using technology, such as computer algebra systems, in undergraduate mathematics courses. However, attaining these benefits sometimes proves elusive. Some of the key variables are the teaching approach and the student instrumentation of the technology. This paper considers the instrumentation of computer-based…

Digital Maps, Matrices and Computer Algebra

ERIC Educational Resources Information Center

Knight, D. G.

2005-01-01

The way in which computer algebra systems, such as Maple, have made the study of complex problems accessible to undergraduate mathematicians with modest computational skills is illustrated by some large matrix calculations, which arise from representing the Earth's surface by digital elevation models. Such problems are often considered to lie in…

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

ERIC Educational Resources Information Center

Whiteley, Richard V., Jr.

2015-01-01

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

Multi-loop Integrand Reduction with Computational Algebraic Geometry

NASA Astrophysics Data System (ADS)

Badger, Simon; Frellesvig, Hjalte; Zhang, Yang

2014-06-01

We discuss recent progress in multi-loop integrand reduction methods. Motivated by the possibility of an automated construction of multi-loop amplitudes via generalized unitarity cuts we describe a procedure to obtain a general parameterisation of any multi-loop integrand in a renormalizable gauge theory. The method relies on computational algebraic geometry techniques such as Gröbner bases and primary decomposition of ideals. We present some results for two and three loop amplitudes obtained with the help of the MACAULAY2 computer algebra system and the Mathematica package BASISDET.

Computing the Moore-Penrose Inverse of a Matrix with a Computer Algebra System

ERIC Educational Resources Information Center

Schmidt, Karsten

2008-01-01

In this paper "Derive" functions are provided for the computation of the Moore-Penrose inverse of a matrix, as well as for solving systems of linear equations by means of the Moore-Penrose inverse. Making it possible to compute the Moore-Penrose inverse easily with one of the most commonly used Computer Algebra Systems--and to have the blueprint…

Didactic Time, Epistemic Gain and Consistent Tool: Taking Care of Teachers' Needs for Classroom Use of CAS--A Reaction to Barzel's "New Technology? New Ways of Teaching--No Time Left for That!"

ERIC Educational Resources Information Center

Lagrange, Jean-Baptiste

2007-01-01

The relationship between teachers and Computer Algebra Systems is generally problematic. The extensive capabilities of CAS provide opportunities for learning but also bring a new complexity that makes it difficult for teachers to take advantage of these opportunities. Barzel's paper contrasts with this observation: in a "Lernwerkstatt"…

An Algebraic Approach to Guarantee Harmonic Balance Method Using Gröbner Base

NASA Astrophysics Data System (ADS)

Yagi, Masakazu; Hisakado, Takashi; Okumura, Kohshi

Harmonic balance (HB) method is well known principle for analyzing periodic oscillations on nonlinear networks and systems. Because the HB method has a truncation error, approximated solutions have been guaranteed by error bounds. However, its numerical computation is very time-consuming compared with solving the HB equation. This paper proposes an algebraic representation of the error bound using Gröbner base. The algebraic representation enables to decrease the computational cost of the error bound considerably. Moreover, using singular points of the algebraic representation, we can obtain accurate break points of the error bound by collisions.

Teaching of Real Numbers by Using the Archimedes-Cantor Approach and Computer Algebra Systems

ERIC Educational Resources Information Center

Vorob'ev, Evgenii M.

2015-01-01

Computer technologies and especially computer algebra systems (CAS) allow students to overcome some of the difficulties they encounter in the study of real numbers. The teaching of calculus can be considerably more effective with the use of CAS provided the didactics of the discipline makes it possible to reveal the full computational potential of…

Learning algebra on screen and on paper: The effect of using a digital tool on students' understanding

NASA Astrophysics Data System (ADS)

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

2016-02-01

The use of digital tools in algebra education is expected to not only contribute to master skill, but also to acquire conceptual understanding. The question is how digital tools affect students" thinking and understanding. This paper presents an analysis of data of one group of three grade seventh students (12-13 year-old) on the use of a digital tool for algebra, the Cover-up applet for solving equations in particular. This case study was part of a larger teaching experiment on initial algebra enriched with digital technology which aimed to improve students" conceptual understanding and skills in solving equations in one variable. The qualitative analysis of a video observation, digital and written work showed that the use of the applet affects student thinking in terms of strategies used by students while dealing with the equations. We conclude that the effects of the use of the digital tool can be traced from student problem solving strategies on paper-and-pencil environment which are similar to strategies while working with the digital tool. In future research, we recommend to use specific theoretical lenses, such as the theory of instrumental genesis and the onto-semiotic approach, to reveal more explicit relationships between students" conceptual understanding and the use of a digital tool.

Image Algebra Matlab language version 2.3 for image processing and compression research

NASA Astrophysics Data System (ADS)

Schmalz, Mark S.; Ritter, Gerhard X.; Hayden, Eric

2010-08-01

Image algebra is a rigorous, concise notation that unifies linear and nonlinear mathematics in the image domain. Image algebra was developed under DARPA and US Air Force sponsorship at University of Florida for over 15 years beginning in 1984. Image algebra has been implemented in a variety of programming languages designed specifically to support the development of image processing and computer vision algorithms and software. The University of Florida has been associated with development of the languages FORTRAN, Ada, Lisp, and C++. The latter implementation involved a class library, iac++, that supported image algebra programming in C++. Since image processing and computer vision are generally performed with operands that are array-based, the Matlab™ programming language is ideal for implementing the common subset of image algebra. Objects include sets and set operations, images and operations on images, as well as templates and image-template convolution operations. This implementation, called Image Algebra Matlab (IAM), has been found to be useful for research in data, image, and video compression, as described herein. Due to the widespread acceptance of the Matlab programming language in the computing community, IAM offers exciting possibilities for supporting a large group of users. The control over an object's computational resources provided to the algorithm designer by Matlab means that IAM programs can employ versatile representations for the operands and operations of the algebra, which are supported by the underlying libraries written in Matlab. In a previous publication, we showed how the functionality of IAC++ could be carried forth into a Matlab implementation, and provided practical details of a prototype implementation called IAM Version 1. In this paper, we further elaborate the purpose and structure of image algebra, then present a maturing implementation of Image Algebra Matlab called IAM Version 2.3, which extends the previous implementation of IAM to include polymorphic operations over different point sets, as well as recursive convolution operations and functional composition. We also show how image algebra and IAM can be employed in image processing and compression research, as well as algorithm development and analysis.

Multilinear Computing and Multilinear Algebraic Geometry

DTIC Science & Technology

2016-08-10

instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send...performance period of this project. 15. SUBJECT TERMS Tensors , multilinearity, algebraic geometry, numerical computations, computational tractability, high...Reset DISTRIBUTION A: Distribution approved for public release. DISTRIBUTION A: Distribution approved for public release. INSTRUCTIONS FOR COMPLETING

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

ERIC Educational Resources Information Center

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

2011-01-01

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

Computer Algebra Systems in Education Newsletter[s].

ERIC Educational Resources Information Center

Computer Algebra Systems in Education Newsletter, 1990

1990-01-01

Computer Algebra Systems (CAS) are computer systems for the exact solution of problems in symbolic form. The newspaper is designed to serve as a conduit for information and ideas on the use of CAS in education, especially in lower division college and university courses. Articles included are about CAS programs in several colleges, experiences…

Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers

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

Nataf, J.M.; Winkelmann, F.

We show how computer algebra and compiler-compilers are used for automatic code generation in the Simulation Problem Analysis and Research Kernel (SPARK), an object oriented environment for modeling complex physical systems that can be described by differential-algebraic equations. After a brief overview of SPARK, we describe the use of computer algebra in SPARK's symbolic interface, which generates solution code for equations that are entered in symbolic form. We also describe how the Lex/Yacc compiler-compiler is used to achieve important extensions to the SPARK simulation language, including parametrized macro objects and steady-state resetting of a dynamic simulation. The application of thesemore » methods to solving the partial differential equations for two-dimensional heat flow is illustrated.« less

Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers

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

Nataf, J.M.; Winkelmann, F.

We show how computer algebra and compiler-compilers are used for automatic code generation in the Simulation Problem Analysis and Research Kernel (SPARK), an object oriented environment for modeling complex physical systems that can be described by differential-algebraic equations. After a brief overview of SPARK, we describe the use of computer algebra in SPARK`s symbolic interface, which generates solution code for equations that are entered in symbolic form. We also describe how the Lex/Yacc compiler-compiler is used to achieve important extensions to the SPARK simulation language, including parametrized macro objects and steady-state resetting of a dynamic simulation. The application of thesemore » methods to solving the partial differential equations for two-dimensional heat flow is illustrated.« less

Solving of Clock Problems Using An Algebraic Approach And Developing An Application For Automatic Conversion

NASA Astrophysics Data System (ADS)

Lakshmi Devaraj, Shanmuga

2018-04-01

The recent trend in learning Mathematics is through android apps like Byju’s. The clock problems asked in aptitude tests could be learnt using such computer applications. The Clock problems are of four categories namely: 1. What is the angle between the hands of a clock at a particular time 2. When the hands of a clock will meet after a particular time 3. When the hands of a clock will be at right angle after a particular time 4. When the hands of a clock will be in a straight line but not together after a particular time The aim of this article is to convert the clock problems which were solved using the traditional approach to algebraic equations and solve them. Shortcuts are arrived which help in solving the questions in just a few seconds. Any aptitude problem could be converted to an algebraic equation by tracing the way the problem proceeds by applying our analytical skills. Solving of equations would be the easiest part in coming up with the solution. Also a computer application could be developed by using the equations that were arrived at in the analysis part. The computer application aims at solving the four different problems in Clocks. The application helps the learners of aptitude for CAT and other competitive exams to know the approach of the problem. Learning Mathematics with a gaming tool like this would be interesting to the learners. This paper provides a path to creating gaming apps to learn Mathematics.

Fusion of Positive Energy Representations of LSpin(2n)

NASA Astrophysics Data System (ADS)

Toledano-Laredo, V.

2004-09-01

Building upon the Jones-Wassermann program of studying Conformal Field Theory using operator algebraic tools, and the work of A. Wassermann on the loop group of LSU(n) (Invent. Math. 133 (1998), 467-538), we give a solution to the problem of fusion for the loop group of Spin(2n). Our approach relies on the use of A. Connes' tensor product of bimodules over a von Neumann algebra to define a multiplicative operation (Connes fusion) on the (integrable) positive energy representations of a given level. The notion of bimodules arises by restricting these representations to loops with support contained in an interval I of the circle or its complement. We study the corresponding Grothendieck ring and show that fusion with the vector representation is given by the Verlinde rules. The computation rests on 1) the solution of a 6-parameter family of Knizhnik-Zamolodchikhov equations and the determination of its monodromy, 2) the explicit construction of the primary fields of the theory, which allows to prove that they define operator-valued distributions and 3) the algebraic theory of superselection sectors developed by Doplicher-Haag-Roberts.

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

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.

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

HOMAR: A computer code for generating homotopic grids using algebraic relations: User's manual

NASA Technical Reports Server (NTRS)

Moitra, Anutosh

1989-01-01

A computer code for fast automatic generation of quasi-three-dimensional grid systems for aerospace configurations is described. The code employs a homotopic method to algebraically generate two-dimensional grids in cross-sectional planes, which are stacked to produce a three-dimensional grid system. Implementation of the algebraic equivalents of the homotopic relations for generating body geometries and grids are explained. Procedures for controlling grid orthogonality and distortion are described. Test cases with description and specification of inputs are presented in detail. The FORTRAN computer program and notes on implementation and use are included.

Survey of Turbulence Models for the Computation of Turbulent Jet Flow and Noise

NASA Technical Reports Server (NTRS)

Nallasamy, N.

1999-01-01

The report presents an overview of jet noise computation utilizing the computational fluid dynamic solution of the turbulent jet flow field. The jet flow solution obtained with an appropriate turbulence model provides the turbulence characteristics needed for the computation of jet mixing noise. A brief account of turbulence models that are relevant for the jet noise computation is presented. The jet flow solutions that have been directly used to calculate jet noise are first reviewed. Then, the turbulent jet flow studies that compute the turbulence characteristics that may be used for noise calculations are summarized. In particular, flow solutions obtained with the k-e model, algebraic Reynolds stress model, and Reynolds stress transport equation model are reviewed. Since, the small scale jet mixing noise predictions can be improved by utilizing anisotropic turbulence characteristics, turbulence models that can provide the Reynolds stress components must now be considered for jet flow computations. In this regard, algebraic stress models and Reynolds stress transport models are good candidates. Reynolds stress transport models involve more modeling and computational effort and time compared to algebraic stress models. Hence, it is recommended that an algebraic Reynolds stress model (ASM) be implemented in flow solvers to compute the Reynolds stress components.

Analysis of SI models with multiple interacting populations using subpopulations.

PubMed

Thomas, Evelyn K; Gurski, Katharine F; Hoffman, Kathleen A

2015-02-01

Computing endemic equilibria and basic reproductive numbers for systems of differential equations describing epidemiological systems with multiple connections between subpopulations is often algebraically intractable. We present an alternative method which deconstructs the larger system into smaller subsystems and captures the interactions between the smaller systems as external forces using an approximate model. We bound the basic reproductive numbers of the full system in terms of the basic reproductive numbers of the smaller systems and use the alternate model to provide approximations for the endemic equilibrium. In addition to creating algebraically tractable reproductive numbers and endemic equilibria, we can demonstrate the influence of the interactions between subpopulations on the basic reproductive number of the full system. The focus of this paper is to provide analytical tools to help guide public health decisions with limited intervention resources.

FAST TRACK COMMUNICATION Algebraic classification of the Weyl tensor in higher dimensions based on its 'superenergy' tensor

NASA Astrophysics Data System (ADS)

Senovilla, José M. M.

2010-11-01

The algebraic classification of the Weyl tensor in the arbitrary dimension n is recovered by means of the principal directions of its 'superenergy' tensor. This point of view can be helpful in order to compute the Weyl aligned null directions explicitly, and permits one to obtain the algebraic type of the Weyl tensor by computing the principal eigenvalue of rank-2 symmetric future tensors. The algebraic types compatible with states of intrinsic gravitational radiation can then be explored. The underlying ideas are general, so that a classification of arbitrary tensors in the general dimension can be achieved.

Computers in the Classroom: Teacher's Resource Manual for Algebra.

ERIC Educational Resources Information Center

Koetke, Walter

Demonstration programs, possible assignments for students (with solutions), and remedial drill programs for students to use are presented to aid teachers using a computer or a computer terminal in the teaching of algebra. The text can be followed page by page or used as a well-indexed reference work, and specific suggestions are made on how and…

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

ERIC Educational Resources Information Center

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

2010-01-01

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

Teacher's Guide to Secondary Mathematics.

ERIC Educational Resources Information Center

Duval County Schools, Jacksonville, FL.

This is a teacher's guide to secondary school mathematics. Developed for use in the Duval County Public Schools, Jacksonville, Florida. Areas of mathematics covered are algebra, analysis, calculus, computer literacy, computer science, geometry, analytic geometry, general mathematics, consumer mathematics, pre-algebra, probability and statistics,…

Efficient and Robust Optimization for Building Energy Simulation

PubMed Central

Pourarian, Shokouh; Kearsley, Anthony; Wen, Jin; Pertzborn, Amanda

2016-01-01

Efficiently, robustly and accurately solving large sets of structured, non-linear algebraic and differential equations is one of the most computationally expensive steps in the dynamic simulation of building energy systems. Here, the efficiency, robustness and accuracy of two commonly employed solution methods are compared. The comparison is conducted using the HVACSIM+ software package, a component based building system simulation tool. The HVACSIM+ software presently employs Powell’s Hybrid method to solve systems of nonlinear algebraic equations that model the dynamics of energy states and interactions within buildings. It is shown here that the Powell’s method does not always converge to a solution. Since a myriad of other numerical methods are available, the question arises as to which method is most appropriate for building energy simulation. This paper finds considerable computational benefits result from replacing the Powell’s Hybrid method solver in HVACSIM+ with a solver more appropriate for the challenges particular to numerical simulations of buildings. Evidence is provided that a variant of the Levenberg-Marquardt solver has superior accuracy and robustness compared to the Powell’s Hybrid method presently used in HVACSIM+. PMID:27325907

Efficient and Robust Optimization for Building Energy Simulation.

PubMed

Pourarian, Shokouh; Kearsley, Anthony; Wen, Jin; Pertzborn, Amanda

2016-06-15

Efficiently, robustly and accurately solving large sets of structured, non-linear algebraic and differential equations is one of the most computationally expensive steps in the dynamic simulation of building energy systems. Here, the efficiency, robustness and accuracy of two commonly employed solution methods are compared. The comparison is conducted using the HVACSIM+ software package, a component based building system simulation tool. The HVACSIM+ software presently employs Powell's Hybrid method to solve systems of nonlinear algebraic equations that model the dynamics of energy states and interactions within buildings. It is shown here that the Powell's method does not always converge to a solution. Since a myriad of other numerical methods are available, the question arises as to which method is most appropriate for building energy simulation. This paper finds considerable computational benefits result from replacing the Powell's Hybrid method solver in HVACSIM+ with a solver more appropriate for the challenges particular to numerical simulations of buildings. Evidence is provided that a variant of the Levenberg-Marquardt solver has superior accuracy and robustness compared to the Powell's Hybrid method presently used in HVACSIM+.

Understanding the Algebraic Variable: Comparative Study of Mexican and Spanish Students

ERIC Educational Resources Information Center

Álvarez, Isabel; Gómez-Chacón, Inés Mª

2015-01-01

Students' difficulty in learning and suitably understanding the concept of the algebraic variable has been studied with a number of tools and documented for several populations. Little research has been conducted, however, using the same tool to explore understanding of the notion among populations from different countries in an attempt to…

Superitem Test: An Alternative Assessment Tool to Assess Students' Algebraic Solving Ability

ERIC Educational Resources Information Center

Lian, Lim Hooi; Yew, Wun Thiam; Idris, Noraini

2010-01-01

Superitem test based on the SOLO model (Structure of the Observing Learning Outcome) has become a powerful alternative assessment tool for monitoring the growth of students' cognitive ability in solving mathematics problems. This article focused on developing a superitem test to assess students' algebraic solving ability through interview method.…

Algebraic properties of automata associated to Petri nets and applications to computation in biological systems.

PubMed

Egri-Nagy, Attila; Nehaniv, Chrystopher L

2008-01-01

Biochemical and genetic regulatory networks are often modeled by Petri nets. We study the algebraic structure of the computations carried out by Petri nets from the viewpoint of algebraic automata theory. Petri nets comprise a formalized graphical modeling language, often used to describe computation occurring within biochemical and genetic regulatory networks, but the semantics may be interpreted in different ways in the realm of automata. Therefore, there are several different ways to turn a Petri net into a state-transition automaton. Here, we systematically investigate different conversion methods and describe cases where they may yield radically different algebraic structures. We focus on the existence of group components of the corresponding transformation semigroups, as these reflect symmetries of the computation occurring within the biological system under study. Results are illustrated by applications to the Petri net modelling of intermediary metabolism. Petri nets with inhibition are shown to be computationally rich, regardless of the particular interpretation method. Along these lines we provide a mathematical argument suggesting a reason for the apparent all-pervasiveness of inhibitory connections in living systems.

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…

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.

Parallel grid generation algorithm for distributed memory computers

NASA Technical Reports Server (NTRS)

Moitra, Stuti; Moitra, Anutosh

1994-01-01

A parallel grid-generation algorithm and its implementation on the Intel iPSC/860 computer are described. The grid-generation scheme is based on an algebraic formulation of homotopic relations. Methods for utilizing the inherent parallelism of the grid-generation scheme are described, and implementation of multiple levELs of parallelism on multiple instruction multiple data machines are indicated. The algorithm is capable of providing near orthogonality and spacing control at solid boundaries while requiring minimal interprocessor communications. Results obtained on the Intel hypercube for a blended wing-body configuration are used to demonstrate the effectiveness of the algorithm. Fortran implementations bAsed on the native programming model of the iPSC/860 computer and the Express system of software tools are reported. Computational gains in execution time speed-up ratios are given.

Using trees to compute approximate solutions to ordinary differential equations exactly

NASA Technical Reports Server (NTRS)

Grossman, Robert

1991-01-01

Some recent work is reviewed which relates families of trees to symbolic algorithms for the exact computation of series which approximate solutions of ordinary differential equations. It turns out that the vector space whose basis is the set of finite, rooted trees carries a natural multiplication related to the composition of differential operators, making the space of trees an algebra. This algebraic structure can be exploited to yield a variety of algorithms for manipulating vector fields and the series and algebras they generate.

Reducing Communication in Algebraic Multigrid Using Additive Variants

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

Vassilevski, Panayot S.; Yang, Ulrike Meier

Algebraic multigrid (AMG) has proven to be an effective scalable solver on many high performance computers. However, its increasing communication complexity on coarser levels has shown to seriously impact its performance on computers with high communication cost. Moreover, additive AMG variants provide not only increased parallelism as well as decreased numbers of messages per cycle but also generally exhibit slower convergence. Here we present various new additive variants with convergence rates that are significantly improved compared to the classical additive algebraic multigrid method and investigate their potential for decreased communication, and improved communication-computation overlap, features that are essential for goodmore » performance on future exascale architectures.« less

Reducing Communication in Algebraic Multigrid Using Additive Variants

DOE PAGES

Vassilevski, Panayot S.; Yang, Ulrike Meier

2014-02-12

Algebraic multigrid (AMG) has proven to be an effective scalable solver on many high performance computers. However, its increasing communication complexity on coarser levels has shown to seriously impact its performance on computers with high communication cost. Moreover, additive AMG variants provide not only increased parallelism as well as decreased numbers of messages per cycle but also generally exhibit slower convergence. Here we present various new additive variants with convergence rates that are significantly improved compared to the classical additive algebraic multigrid method and investigate their potential for decreased communication, and improved communication-computation overlap, features that are essential for goodmore » performance on future exascale architectures.« less

Arithmetic Circuit Verification Based on Symbolic Computer Algebra

NASA Astrophysics Data System (ADS)

Watanabe, Yuki; Homma, Naofumi; Aoki, Takafumi; Higuchi, Tatsuo

This paper presents a formal approach to verify arithmetic circuits using symbolic computer algebra. Our method describes arithmetic circuits directly with high-level mathematical objects based on weighted number systems and arithmetic formulae. Such circuit description can be effectively verified by polynomial reduction techniques using Gröbner Bases. In this paper, we describe how the symbolic computer algebra can be used to describe and verify arithmetic circuits. The advantageous effects of the proposed approach are demonstrated through experimental verification of some arithmetic circuits such as multiply-accumulator and FIR filter. The result shows that the proposed approach has a definite possibility of verifying practical arithmetic circuits.

Two's company, three (or more) is a simplex : Algebraic-topological tools for understanding higher-order structure in neural data.

PubMed

Giusti, Chad; Ghrist, Robert; Bassett, Danielle S

2016-08-01

The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit of interest in a brain is a dyad - two nodes (neurons or brain regions) connected by an edge. While rarely mentioned, this fundamental assumption inherently limits the types of neural structure and function that graphs can be used to model. Here, we describe a generalization of graphs that overcomes these limitations, thereby offering a broad range of new possibilities in terms of modeling and measuring neural phenomena. Specifically, we explore the use of simplicial complexes: a structure developed in the field of mathematics known as algebraic topology, of increasing applicability to real data due to a rapidly growing computational toolset. We review the underlying mathematical formalism as well as the budding literature applying simplicial complexes to neural data, from electrophysiological recordings in animal models to hemodynamic fluctuations in humans. Based on the exceptional flexibility of the tools and recent ground-breaking insights into neural function, we posit that this framework has the potential to eclipse graph theory in unraveling the fundamental mysteries of cognition.

Soft hairy warped black hole entropy

NASA Astrophysics Data System (ADS)

Grumiller, Daniel; Hacker, Philip; Merbis, Wout

2018-02-01

We reconsider warped black hole solutions in topologically massive gravity and find novel boundary conditions that allow for soft hairy excitations on the horizon. To compute the associated symmetry algebra we develop a general framework to compute asymptotic symmetries in any Chern-Simons-like theory of gravity. We use this to show that the near horizon symmetry algebra consists of two u (1) current algebras and recover the surprisingly simple entropy formula S = 2 π( J 0 + + J 0 - ), where J 0 ± are zero mode charges of the current algebras. This provides the first example of a locally non-maximally symmetric configuration exhibiting this entropy law and thus non-trivial evidence for its universality.

Using the Internet To Investigate Algebra.

ERIC Educational Resources Information Center

Sherwood, Walter

The lesson plans in this book engage students by using a tool they enjoy--the Internet--to explore key concepts in algebra. Working either individually or in groups, students learn to approach algebra from a problem solving perspective. Each lesson shows learners how to use the Internet as a resource for gathering facts, data, and other…

Design of Teacher Assistance Tools in an Exploratory Learning Environment for Algebraic Generalization

ERIC Educational Resources Information Center

Gutierrez-Santos, S.; Geraniou, E.; Pearce-Lazard, D.; Poulovassilis, A.

2012-01-01

The MiGen project is designing and developing an intelligent exploratory environment to support 11-14-year-old students in their learning of algebraic generalization. Deployed within the classroom, the system also provides tools to assist teachers in monitoring students' activities and progress. This paper describes the design of these Teacher…

Image understanding and the man-machine interface II; Proceedings of the Meeting, Los Angeles, CA, Jan. 17, 18, 1989

NASA Technical Reports Server (NTRS)

Barrett, Eamon B. (Editor); Pearson, James J. (Editor)

1989-01-01

Image understanding concepts and models, image understanding systems and applications, advanced digital processors and software tools, and advanced man-machine interfaces are among the topics discussed. Particular papers are presented on such topics as neural networks for computer vision, object-based segmentation and color recognition in multispectral images, the application of image algebra to image measurement and feature extraction, and the integration of modeling and graphics to create an infrared signal processing test bed.

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.

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

Effects of Computer Algebra System (CAS) with Metacognitive Training on Mathematical Reasoning.

ERIC Educational Resources Information Center

Kramarski, Bracha; Hirsch, Chaya

2003-01-01

Describes a study that investigated the differential effects of Computer Algebra Systems (CAS) and metacognitive training (META) on mathematical reasoning. Participants were 83 Israeli eighth-grade students. Results showed that CAS embedded within META significantly outperformed the META and CAS alone conditions, which in turn significantly…

Reflections on John Monaghan's "Computer Algebra, Instrumentation, and the Anthropological Approach"

ERIC Educational Resources Information Center

Blume, Glen

2007-01-01

Reactions to John Monaghan's "Computer Algebra, Instrumentation and the Anthropological Approach" focus on a variety of issues related to the ergonomic approach (instrumentation) and anthropological approach to mathematical activity and practice. These include uses of the term technique; several possibilities for integration of the two approaches;…

A Flexible, Extensible Online Testing System for Mathematics

ERIC Educational Resources Information Center

Passmore, Tim; Brookshaw, Leigh; Butler, Harry

2011-01-01

An online testing system developed for entry-skills testing of first-year university students in algebra and calculus is described. The system combines the open-source computer algebra system "Maxima" with computer scripts to parse student answers, which are entered using standard mathematical notation and conventions. The answers can…

Computer Algebra Systems and Theorems on Real Roots of Polynomials

ERIC Educational Resources Information Center

Aidoo, Anthony Y.; Manthey, Joseph L.; Ward, Kim Y.

2010-01-01

A computer algebra system is used to derive a theorem on the existence of roots of a quadratic equation on any bounded real interval. This is extended to a cubic polynomial. We discuss how students could be led to derive and prove these theorems. (Contains 1 figure.)

Inequalities, Assessment and Computer Algebra

ERIC Educational Resources Information Center

Sangwin, Christopher J.

2015-01-01

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

Computer Algebra System Calculators: Gender Issues and Teachers' Expectations

ERIC Educational Resources Information Center

Forgasz, Helen J.; Griffith, Shirly

2006-01-01

In this paper we present findings from two studies focusing on computer algebra system (CAS) calculators. In Victoria, Australia, it is currently mandatory for students to use graphics calculators in some grade 12 mathematics examinations. Since 2001, a pilot study has been conducted involving Victorian Certificate of Education (VCE) students…

Using Computer Symbolic Algebra to Solve Differential Equations.

ERIC Educational Resources Information Center

Mathews, John H.

1989-01-01

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

Color Algebras

NASA Technical Reports Server (NTRS)

Mulligan, Jeffrey B.

2017-01-01

A color algebra refers to a system for computing sums and products of colors, analogous to additive and subtractive color mixtures. We would like it to match the well-defined algebra of spectral functions describing lights and surface reflectances, but an exact correspondence is impossible after the spectra have been projected to a three-dimensional color space, because of metamerism physically different spectra can produce the same color sensation. Metameric spectra are interchangeable for the purposes of addition, but not multiplication, so any color algebra is necessarily an approximation to physical reality. Nevertheless, because the majority of naturally-occurring spectra are well-behaved (e.g., continuous and slowly-varying), color algebras can be formulated that are largely accurate and agree well with human intuition. Here we explore the family of algebras that result from associating each color with a member of a three-dimensional manifold of spectra. This association can be used to construct a color product, defined as the color of the spectrum of the wavelength-wise product of the spectra associated with the two input colors. The choice of the spectral manifold determines the behavior of the resulting system, and certain special subspaces allow computational efficiencies. The resulting systems can be used to improve computer graphic rendering techniques, and to model various perceptual phenomena such as color constancy.

Class and Homework Problems: The Break-Even Radius of Insulation Computed Using Excel Solver and WolframAlpha

ERIC Educational Resources Information Center

Foley, Greg

2014-01-01

A problem that illustrates two ways of computing the break-even radius of insulation is outlined. The problem is suitable for students who are taking an introductory module in heat transfer or transport phenomena and who have some previous knowledge of the numerical solution of non- linear algebraic equations. The potential for computer algebra,…

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

An algorithm for analytical solution of basic problems featuring elastostatic bodies with cavities and surface flaws

NASA Astrophysics Data System (ADS)

Penkov, V. B.; Levina, L. V.; Novikova, O. S.; Shulmin, A. S.

2018-03-01

Herein we propose a methodology for structuring a full parametric analytical solution to problems featuring elastostatic media based on state-of-the-art computing facilities that support computerized algebra. The methodology includes: direct and reverse application of P-Theorem; methods of accounting for physical properties of media; accounting for variable geometrical parameters of bodies, parameters of boundary states, independent parameters of volume forces, and remote stress factors. An efficient tool to address the task is the sustainable method of boundary states originally designed for the purposes of computerized algebra and based on the isomorphism of Hilbertian spaces of internal states and boundary states of bodies. We performed full parametric solutions of basic problems featuring a ball with a nonconcentric spherical cavity, a ball with a near-surface flaw, and an unlimited medium with two spherical cavities.

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.

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…

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…

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…

Decomposition of algebraic sets and applications to weak centers of cubic systems

NASA Astrophysics Data System (ADS)

Chen, Xingwu; Zhang, Weinian

2009-10-01

There are many methods such as Gröbner basis, characteristic set and resultant, in computing an algebraic set of a system of multivariate polynomials. The common difficulties come from the complexity of computation, singularity of the corresponding matrices and some unnecessary factors in successive computation. In this paper, we decompose algebraic sets, stratum by stratum, into a union of constructible sets with Sylvester resultants, so as to simplify the procedure of elimination. Applying this decomposition to systems of multivariate polynomials resulted from period constants of reversible cubic differential systems which possess a quadratic isochronous center, we determine the order of weak centers and discuss the bifurcation of critical periods.

A path model for Whittaker vectors

NASA Astrophysics Data System (ADS)

Di Francesco, Philippe; Kedem, Rinat; Turmunkh, Bolor

2017-06-01

In this paper we construct weighted path models to compute Whittaker vectors in the completion of Verma modules, as well as Whittaker functions of fundamental type, for all finite-dimensional simple Lie algebras, affine Lie algebras, and the quantum algebra U_q(slr+1) . This leads to series expressions for the Whittaker functions. We show how this construction leads directly to the quantum Toda equations satisfied by these functions, and to the q-difference equations in the quantum case. We investigate the critical limit of affine Whittaker functions computed in this way.

"MONSTROUS MOONSHINE" and Physics

NASA Astrophysics Data System (ADS)

Pushkin, A. V.

The report presents some results obtained by the author on the quantum gravitation theory. Algebraic structure of this theory proves to be related to the commutative nonassociative Griess algebra. The theory symmetry is the automorphism group of Griess algebra: "Monster" simple group. Knowledge of the theory symmetry allows to compute observed physical values in the `zero' approximation. The report presents such computed results for values {m_{p}}/{m_{c}} and α, for the latter the `zero' approximation accuracy, controlled by the theory, being one order of magnitude higher than the accuracy of modern measurements.

Anatomical medial surfaces with efficient resolution of branches singularities.

PubMed

Gil, Debora; Vera, Sergio; Borràs, Agnés; Andaluz, Albert; González Ballester, Miguel A

2017-01-01

Medial surfaces are powerful tools for shape description, but their use has been limited due to the sensibility of existing methods to branching artifacts. Medial branching artifacts are associated to perturbations of the object boundary rather than to geometric features. Such instability is a main obstacle for a confident application in shape recognition and description. Medial branches correspond to singularities of the medial surface and, thus, they are problematic for existing morphological and energy-based algorithms. In this paper, we use algebraic geometry concepts in an energy-based approach to compute a medial surface presenting a stable branching topology. We also present an efficient GPU-CPU implementation using standard image processing tools. We show the method computational efficiency and quality on a custom made synthetic database. Finally, we present some results on a medical imaging application for localization of abdominal pathologies. Copyright © 2016 Elsevier B.V. All rights reserved.

Psi4NumPy: An Interactive Quantum Chemistry Programming Environment for Reference Implementations and Rapid Development.

PubMed

Smith, Daniel G A; Burns, Lori A; Sirianni, Dominic A; Nascimento, Daniel R; Kumar, Ashutosh; James, Andrew M; Schriber, Jeffrey B; Zhang, Tianyuan; Zhang, Boyi; Abbott, Adam S; Berquist, Eric J; Lechner, Marvin H; Cunha, Leonardo A; Heide, Alexander G; Waldrop, Jonathan M; Takeshita, Tyler Y; Alenaizan, Asem; Neuhauser, Daniel; King, Rollin A; Simmonett, Andrew C; Turney, Justin M; Schaefer, Henry F; Evangelista, Francesco A; DePrince, A Eugene; Crawford, T Daniel; Patkowski, Konrad; Sherrill, C David

2018-06-11

Psi4NumPy demonstrates the use of efficient computational kernels from the open-source Psi4 program through the popular NumPy library for linear algebra in Python to facilitate the rapid development of clear, understandable Python computer code for new quantum chemical methods, while maintaining a relatively low execution time. Using these tools, reference implementations have been created for a number of methods, including self-consistent field (SCF), SCF response, many-body perturbation theory, coupled-cluster theory, configuration interaction, and symmetry-adapted perturbation theory. Furthermore, several reference codes have been integrated into Jupyter notebooks, allowing background, underlying theory, and formula information to be associated with the implementation. Psi4NumPy tools and associated reference implementations can lower the barrier for future development of quantum chemistry methods. These implementations also demonstrate the power of the hybrid C++/Python programming approach employed by the Psi4 program.

Phased-mission system analysis using Boolean algebraic methods

NASA Technical Reports Server (NTRS)

Somani, Arun K.; Trivedi, Kishor S.

1993-01-01

Most reliability analysis techniques and tools assume that a system is used for a mission consisting of a single phase. However, multiple phases are natural in many missions. The failure rates of components, system configuration, and success criteria may vary from phase to phase. In addition, the duration of a phase may be deterministic or random. Recently, several researchers have addressed the problem of reliability analysis of such systems using a variety of methods. A new technique for phased-mission system reliability analysis based on Boolean algebraic methods is described. Our technique is computationally efficient and is applicable to a large class of systems for which the failure criterion in each phase can be expressed as a fault tree (or an equivalent representation). Our technique avoids state space explosion that commonly plague Markov chain-based analysis. A phase algebra to account for the effects of variable configurations and success criteria from phase to phase was developed. Our technique yields exact (as opposed to approximate) results. The use of our technique was demonstrated by means of an example and present numerical results to show the effects of mission phases on the system reliability.

Students' Use of Computational Thinking in Linear Algebra

ERIC Educational Resources Information Center

Bagley, Spencer; Rabin, Jeffrey M.

2016-01-01

In this work, we examine students' ways of thinking when presented with a novel linear algebra problem. Our intent was to explore how students employ and coordinate three modes of thinking, which we call computational, abstract, and geometric, following similar frameworks proposed by Hillel (2000) and Sierpinska (2000). However, the undergraduate…

High Level Technology in a Low Level Mathematics Course.

ERIC Educational Resources Information Center

Schultz, James E.; Noguera, Norma

2000-01-01

Describes a teaching experiment in which spreadsheets and computer algebra systems were used to teach a low-level college consumer mathematics course. Students were successful in using different types of functions to solve a variety of problems drawn from real-world situations. Provides an existence proof that computer algebra systems can assist…

Revisiting Newtonian and Non-Newtonian Fluid Mechanics Using Computer Algebra

ERIC Educational Resources Information Center

Knight, D. G.

2006-01-01

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

Algebraic Functions, Computer Programming, and the Challenge of Transfer

ERIC Educational Resources Information Center

Schanzer, Emmanuel Tanenbaum

2015-01-01

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

Some Unexpected Results Using Computer Algebra Systems.

ERIC Educational Resources Information Center

Alonso, Felix; Garcia, Alfonsa; Garcia, Francisco; Hoya, Sara; Rodriguez, Gerardo; de la Villa, Agustin

2001-01-01

Shows how teachers can often use unexpected outputs from Computer Algebra Systems (CAS) to reinforce concepts and to show students the importance of thinking about how they use the software and reflecting on their results. Presents different examples where DERIVE, MAPLE, or Mathematica does not work as expected and suggests how to use them as a…

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

ERIC Educational Resources Information Center

Maat, Siti Mistima; Zakaria, Effandi

2011-01-01

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

Analysis of Computer Algebra System Tutorials Using Cognitive Load Theory

ERIC Educational Resources Information Center

May, Patricia

2004-01-01

Most research in the area of Computer Algebra Systems (CAS) has been designed to compare the effectiveness of instructional technology to traditional lecture-based formats. While results are promising, research also indicates evidence of the steep learning curve imposed by the technology. Yet no studies have been conducted to investigate this…

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

ERIC Educational Resources Information Center

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

2005-01-01

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

Developing a TI-92 Manual Generator Based on Computer Algebra Systems

ERIC Educational Resources Information Center

Jun, Youngcook

2004-01-01

The electronic medium suitable for mathematics learning and teaching is often designed with a notebook interface provided in a computer algebra system. Such a notebook interface facilitates a workspace for mathematical activities along with an online help system. In this paper, the proposed feature is implemented in the Mathematica's notebook…

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.

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.

DISTING: A web application for fast algorithmic computation of alternative indistinguishable linear compartmental models.

PubMed

Davidson, Natalie R; Godfrey, Keith R; Alquaddoomi, Faisal; Nola, David; DiStefano, Joseph J

2017-05-01

We describe and illustrate use of DISTING, a novel web application for computing alternative structurally identifiable linear compartmental models that are input-output indistinguishable from a postulated linear compartmental model. Several computer packages are available for analysing the structural identifiability of such models, but DISTING is the first to be made available for assessing indistinguishability. The computational algorithms embedded in DISTING are based on advanced versions of established geometric and algebraic properties of linear compartmental models, embedded in a user-friendly graphic model user interface. Novel computational tools greatly speed up the overall procedure. These include algorithms for Jacobian matrix reduction, submatrix rank reduction, and parallelization of candidate rank computations in symbolic matrix analysis. The application of DISTING to three postulated models with respectively two, three and four compartments is given. The 2-compartment example is used to illustrate the indistinguishability problem; the original (unidentifiable) model is found to have two structurally identifiable models that are indistinguishable from it. The 3-compartment example has three structurally identifiable indistinguishable models. It is found from DISTING that the four-compartment example has five structurally identifiable models indistinguishable from the original postulated model. This example shows that care is needed when dealing with models that have two or more compartments which are neither perturbed nor observed, because the numbering of these compartments may be arbitrary. DISTING is universally and freely available via the Internet. It is easy to use and circumvents tedious and complicated algebraic analysis previously done by hand. Copyright © 2017 Elsevier B.V. All rights reserved.

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…

Designing Virtual Worlds for Use in Mathematics Education.

ERIC Educational Resources Information Center

Winn, William; Bricken, William

Virtual Reality (VR) is a computer generated, multi-dimensional, inclusive environment that can build axioms of algebra into the behavior of the world. This paper discusses the use of VR to represent part of the algebra curriculum in order to improve students' classroom experiences in learning algebra. Students learn to construct their knowledge…

Linear Algebra and Image Processing

ERIC Educational Resources Information Center

Allali, Mohamed

2010-01-01

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

Teaching the "Diagonalization Concept" in Linear Algebra with Technology: A Case Study at Galatasaray University

ERIC Educational Resources Information Center

Yildiz Ulus, Aysegul

2013-01-01

This paper examines experimental and algorithmic contributions of advanced calculators (graphing and computer algebra system, CAS) in teaching the concept of "diagonalization," one of the key topics in Linear Algebra courses taught at the undergraduate level. Specifically, the proposed hypothesis of this study is to assess the effective…

Mobile Learning: Integrating Text Messaging into a Community College Pre-Algebra Course

ERIC Educational Resources Information Center

Bull, Prince; McCormick, Carlos

2012-01-01

This study investigated the use of text messaging as an educational tool in a pre-algebra course at a community college in the central region of North Carolina. The research was conducted in two pre-algebra classes with thirty-three students and one instructor. Data were gathered using qualitative and quantitative methods. A mixed method design…

Learning Nonadjacent Dependencies: No Need for Algebraic-Like Computations

ERIC Educational Resources Information Center

Perruchet, Pierre; Tyler, Michael D.; Galland, Nadine; Peereman, Ronald

2004-01-01

Is it possible to learn the relation between 2 nonadjacent events? M. Pena, L. L. Bonatti, M. Nespor, and J. Mehler (2002) claimed this to be possible, but only in conditions suggesting the involvement of algebraic-like computations. The present article reports simulation studies and experimental data showing that the observations on which Pe?a et…

Higher Inductive Types as Homotopy-Initial Algebras

DTIC Science & Technology

2016-08-01

Higher Inductive Types as Homotopy-Initial Algebras Kristina Sojakova CMU-CS-16-125 August 2016 School of Computer Science Carnegie Mellon University...talk at the Workshop on Logic, Language, Information and Computation (WoLLIC 2011). 1, 2.1 [38] M. Warren. Homotopy-Theoretic Aspects of Constructive Type Theory. PhD thesis, Carnegie Mellon University, 2008. 1 143

A Computer Program To Increase Comprehension of the Cartesian Rectangular Coordinate System in High School Pre-Algebra Students.

ERIC Educational Resources Information Center

Exley, I. Sheck

The high percentage of high school pre-algebra students having difficulty learning the abstract concept of graphing ordered pairs on the Cartesian rectangular coordinate system was addressed by the creation and implementation of a computer-managed instructional program. Modules consisted of a pretest, instruction, two practice sessions, and a…

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

ERIC Educational Resources Information Center

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

2018-01-01

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

Computer Algebra Systems: Permitted but Are They Used?

ERIC Educational Resources Information Center

Pierce, Robyn; Bardini, Caroline

2015-01-01

Since the 1990s, computer algebra systems (CAS) have been available in Australia as hand-held devices designed for students with the expectation that they will be used in the mathematics classroom. The data discussed in this paper was collected as part of a pilot study that investigated first year university mathematics and statistics students'…

Do Mathematicians Integrate Computer Algebra Systems in University Teaching? Comparing a Literature Review to an International Survey Study

ERIC Educational Resources Information Center

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

2012-01-01

We present a comparative study of a literature review of 326 selected contributions (Buteau, Marshall, Jarvis & Lavicza, 2010) to an international (US, UK, Hungary) survey of mathematicians (Lavicza, 2008) regarding the use of Computer Algebra Systems (CAS) in post-secondary mathematics education. The comparison results are organized with respect…

Examining the Use of Computer Algebra Systems in University-Level Mathematics Teaching

ERIC Educational Resources Information Center

Lavicza, Zsolt

2009-01-01

The use of Computer Algebra Systems (CAS) is becoming increasingly important and widespread in mathematics research and teaching. In this paper, I will report on a questionnaire study enquiring about mathematicians' use of CAS in mathematics teaching in three countries; the United States, the United Kingdom, and Hungary. Based on the responses…

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

ERIC Educational Resources Information Center

Gasyna, Zbigniew L.

2008-01-01

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

Color Algebras

NASA Technical Reports Server (NTRS)

Mulligan, Jeffrey B.

2017-01-01

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

An algebraic interpretation of PSP composition.

PubMed

Vaucher, G

1998-01-01

The introduction of time in artificial neurons is a delicate problem on which many groups are working. Our approach combines some properties of biological models and the algebraic properties of McCulloch and Pitts artificial neuron (AN) (McCulloch and Pitts, 1943) to produce a new model which links both characteristics. In this extended artificial neuron, postsynaptic potentials (PSPs) are considered as numerical elements, having two degrees of freedom, on which the neuron computes operations. Modelled in this manner, a group of neurons can be seen as a computer with an asynchronous architecture. To formalize the functioning of this computer, we propose an algebra of impulses. This approach might also be interesting in the modelling of the passive electrical properties in some biological neurons.

Optical systolic solutions of linear algebraic equations

NASA Technical Reports Server (NTRS)

Neuman, C. P.; Casasent, D.

1984-01-01

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

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.

Some applications of mathematics in theoretical physics - A review

NASA Astrophysics Data System (ADS)

Bora, Kalpana

2016-06-01

Mathematics is a very beautiful subject-very much an indispensible tool for Physics, more so for Theoretical Physics (by which we mean here mainly Field Theory and High Energy Physics). These branches of Physics are based on Quantum Mechanics and Special Theory of Relativity, and many mathematical concepts are used in them. In this work, we shall elucidate upon only some of them, like-differential geometry, infinite series, Mellin transforms, Fourier and integral transforms, special functions, calculus, complex algebra, topology, group theory, Riemannian geometry, functional analysis, linear algebra, operator algebra, etc. We shall also present, some physics issues, where these mathematical tools are used. It is not wrong to say that Mathematics is such a powerful tool, without which, there can not be any Physics theory!! A brief review on our research work is also presented.

A Comparison Study between a Traditional and Experimental Program.

ERIC Educational Resources Information Center

Dogan, Hamide

This paper is part of a dissertation defended in January 2001 as part of the author's Ph.D. requirement. The study investigated the effects of use of Mathematica, a computer algebra system, in learning basic linear algebra concepts, It was done by means of comparing two first year linear algebra classes, one traditional and one Mathematica…

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.

Applications: Using Algebra in an Accounting Practice.

ERIC Educational Resources Information Center

Eisner, Gail A.

1994-01-01

Presents examples of algebra from the field of accounting including proportional ownership of stock, separation of a loan payment into principal and interest portions, depreciation methods, and salary withholdings computations. (MKR)

Students' Comparison of Their Trigonometric Answers with the Answers of a Computer Algebra System in Terms of Equivalence and Correctness

ERIC Educational Resources Information Center

Tonisson, Eno; Lepp, Marina

2015-01-01

The answers offered by computer algebra systems (CAS) can sometimes differ from those expected by the students or teachers. The comparison of the students' answers and CAS answers could provide ground for discussion about equivalence and correctness. Investigating the students' comparison of the answers gives the possibility to study different…

Differences between Expected Answers and the Answers Given by Computer Algebra Systems to School Equations

ERIC Educational Resources Information Center

Tonisson, Eno

2015-01-01

Sometimes Computer Algebra Systems (CAS) offer an answer that is somewhat different from the answer that is probably expected by the student or teacher. These (somewhat unexpected) answers could serve as a catalyst for rich mathematical discussion. In this study, over 120 equations from school mathematics were solved using 8 different CAS. Many…

The Effects of Computer Algebra System on Undergraduate Students' Spatial Visualization Skills in a Calculus Course

ERIC Educational Resources Information Center

Karakus, Fatih; Aydin, Bünyamin

2017-01-01

This study aimed at determining the effects of using a computer algebra system (CAS) on undergraduate students' spatial visualization skills in a calculus course. This study used an experimental design. The "one group pretest-posttest design" was the research model. The participants were 41 sophomore students (26 female and 15 male)…

Introducing Computer Algebra to School Teachers of Mathematics

ERIC Educational Resources Information Center

Man, Yiu-Kwong

2007-01-01

Since the last decade, the use of computer algebra systems at the Hong Kong school level is still very limited. Among various reasons behind, the lack of exposure of this kind of software to local school teachers should be taken into account. In this article, we describe how to introduce MAPLE in a BEd module of a local teacher-training programme.…

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.

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

ERIC Educational Resources Information Center

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

2014-01-01

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

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

PubMed

Ferčec, Brigita; Mahdi, Adam

2013-01-01

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

Ada Linear-Algebra Program

NASA Technical Reports Server (NTRS)

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

1988-01-01

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

General Algebraic Modeling System Tutorial | High-Performance Computing |

Science.gov Websites

power generation from two different fuels. The goal is to minimize the cost for one of the fuels while Here's a basic tutorial for modeling optimization problems with the General Algebraic Modeling System (GAMS). Overview The GAMS (General Algebraic Modeling System) package is essentially a compiler for a

The Effect of an Intelligent Tutoring System (ITS) on Student Achievement in Algebraic Expression

ERIC Educational Resources Information Center

Chien, Tsai Chen; Md. Yunus, Aida Suraya; Ali, Wan Zah Wan; Bakar, Ab. Rahim

2008-01-01

In this experimental study, use of Computer Assisted Instruction (CAI) followed by use of an Intelligent Tutoring System (CAI+ITS) was compared to the use of CAI (CAI only) in tutoring students on the topic of Algebraic Expression. Two groups of students participated in the study. One group of 32 students studied algebraic expression in a CAI…

QuBiLS-MAS, open source multi-platform software for atom- and bond-based topological (2D) and chiral (2.5D) algebraic molecular descriptors computations.

PubMed

Valdés-Martiní, José R; Marrero-Ponce, Yovani; García-Jacas, César R; Martinez-Mayorga, Karina; Barigye, Stephen J; Vaz d'Almeida, Yasser Silveira; Pham-The, Hai; Pérez-Giménez, Facundo; Morell, Carlos A

2017-06-07

In previous reports, Marrero-Ponce et al. proposed algebraic formalisms for characterizing topological (2D) and chiral (2.5D) molecular features through atom- and bond-based ToMoCoMD-CARDD (acronym for Topological Molecular Computational Design-Computer Aided Rational Drug Design) molecular descriptors. These MDs codify molecular information based on the bilinear, quadratic and linear algebraic forms and the graph-theoretical electronic-density and edge-adjacency matrices in order to consider atom- and bond-based relations, respectively. These MDs have been successfully applied in the screening of chemical compounds of different therapeutic applications ranging from antimalarials, antibacterials, tyrosinase inhibitors and so on. To compute these MDs, a computational program with the same name was initially developed. However, this in house software barely offered the functionalities required in contemporary molecular modeling tasks, in addition to the inherent limitations that made its usability impractical. Therefore, the present manuscript introduces the QuBiLS-MAS (acronym for Quadratic, Bilinear and N-Linear mapS based on graph-theoretic electronic-density Matrices and Atomic weightingS) software designed to compute topological (0-2.5D) molecular descriptors based on bilinear, quadratic and linear algebraic forms for atom- and bond-based relations. The QuBiLS-MAS module was designed as standalone software, in which extensions and generalizations of the former ToMoCoMD-CARDD 2D-algebraic indices are implemented, considering the following aspects: (a) two new matrix normalization approaches based on double-stochastic and mutual probability formalisms; (b) topological constraints (cut-offs) to take into account particular inter-atomic relations; (c) six additional atomic properties to be used as weighting schemes in the calculation of the molecular vectors; (d) four new local-fragments to consider molecular regions of interest; (e) number of lone-pair electrons in chemical structure defined by diagonal coefficients in matrix representations; and (f) several aggregation operators (invariants) applied over atom/bond-level descriptors in order to compute global indices. This software permits the parallel computation of the indices, contains a batch processing module and data curation functionalities. This program was developed in Java v1.7 using the Chemistry Development Kit library (version 1.4.19). The QuBiLS-MAS software consists of two components: a desktop interface (GUI) and an API library allowing for the easy integration of the latter in chemoinformatics applications. The relevance of the novel extensions and generalizations implemented in this software is demonstrated through three studies. Firstly, a comparative Shannon's entropy based variability study for the proposed QuBiLS-MAS and the DRAGON indices demonstrates superior performance for the former. A principal component analysis reveals that the QuBiLS-MAS approach captures chemical information orthogonal to that codified by the DRAGON descriptors. Lastly, a QSAR study for the binding affinity to the corticosteroid-binding globulin using Cramer's steroid dataset is carried out. From these analyses, it is revealed that the QuBiLS-MAS approach for atom-pair relations yields similar-to-superior performance with regard to other QSAR methodologies reported in the literature. Therefore, the QuBiLS-MAS approach constitutes a useful tool for the diversity analysis of chemical compound datasets and high-throughput screening of structure-activity data.

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.

FAST TRACK COMMUNICATION: On the Liouvillian solution of second-order linear differential equations and algebraic invariant curves

NASA Astrophysics Data System (ADS)

Man, Yiu-Kwong

2010-10-01

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

Effects of Using a Computer Algebra System (CAS) on Junior College Students' Attitudes towards CAS and Achievement in Mathematics

ERIC Educational Resources Information Center

Leng, Ng Wee; Choo, Kwee Tiow; Soon, Lau Hock; Yi-Huak, Koh; Sun, Yap Yew

2005-01-01

This study examines the effects of using Texas Instruments' Voyage 200 calculator (V200), a graphing calculator with a built-in computer algebra system (CAS), on attitudes towards CAS and achievement in mathematics of junior college students (17 year olds). Students' attitudes towards CAS were examined using a 40-item Likert-type instrument…

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

Mixing Microworld and CAS Features in Building Computer Systems that Help Students Learn Algebra

ERIC Educational Resources Information Center

Nicaud, Jean-Francois; Bouhineau, Denis; Chaachoua, Hamid

2004-01-01

We present the design principles for a new kind of computer system that helps students learn algebra. The fundamental idea is to have a system based on the microworld paradigm that allows students to make their own calculations, as they do with paper and pencil, without being obliged to use commands, and to verify the correctness of these…

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

ERIC Educational Resources Information Center

Matsumoto, Paul S.

2014-01-01

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

Computer Aided Instruction for a Course in Boolean Algebra and Logic Design. Final Report (Revised).

ERIC Educational Resources Information Center

Roy, Rob

The use of computers to prepare deficient college and graduate students for courses that build upon previously acquired information would solve the growing problem of professors who must spend up to one third of their class time in review of material. But examination of students who were taught Boolean Algebra and Logic Design by means of Computer…

Signal Processing for Radar Target Tracking and Identification

DTIC Science & Technology

1996-12-01

Computes the likelihood for various potential jump moves. 12. matrix_mult.m: Parallel implementation of linear algebra ... Elementary Lineary Algebra with Applications, John Wiley k Sons, Inc., New York, 1987. [9] A. K. Bhattacharyya, and D. L. Sengupta, Radar Cross...Miller, ’Target Tracking and Recognition Using Jump-Diffusion Processes," ARO’s 11th Army Conf. on Applied Mathemat- ics and Computing, June 8-11

A Theorem on the Rank of a Product of Matrices with Illustration of Its Use in Goodness of Fit Testing.

PubMed

Satorra, Albert; Neudecker, Heinz

2015-12-01

This paper develops a theorem that facilitates computing the degrees of freedom of Wald-type chi-square tests for moment restrictions when there is rank deficiency of key matrices involved in the definition of the test. An if and only if (iff) condition is developed for a simple rule of difference of ranks to be used when computing the desired degrees of freedom of the test. The theorem is developed exploiting basics tools of matrix algebra. The theorem is shown to play a key role in proving the asymptotic chi-squaredness of a goodness of fit test in moment structure analysis, and in finding the degrees of freedom of this chi-square statistic.

A realizable explicit algebraic Reynolds stress model for compressible turbulent flow with significant mean dilatation

NASA Astrophysics Data System (ADS)

Grigoriev, I. A.; Wallin, S.; Brethouwer, G.; Johansson, A. V.

2013-10-01

The explicit algebraic Reynolds stress model of Wallin and Johansson [J. Fluid Mech. 403, 89 (2000)] is extended to compressible and variable-density turbulent flows. This is achieved by correctly taking into account the influence of the mean dilatation on the rapid pressure-strain correlation. The resulting model is formally identical to the original model in the limit of constant density. For two-dimensional mean flows the model is analyzed and the physical root of the resulting quartic equation is identified. Using a fixed-point analysis of homogeneously sheared and strained compressible flows, we show that the new model is realizable, unlike the previous model. Application of the model together with a K - ω model to quasi one-dimensional plane nozzle flow, transcending from subsonic to supersonic regime, also demonstrates realizability. Negative "dilatational" production of turbulence kinetic energy competes with positive "incompressible" production, eventually making the total production negative during the spatial evolution of the nozzle flow. Finally, an approach to include the baroclinic effect into the dissipation equation is proposed and an algebraic model for density-velocity correlations is outlined to estimate the corrections associated with density fluctuations. All in all, the new model can become a significant tool for CFD (computational fluid dynamics) of compressible flows.

Examples of testing global identifiability of biological and biomedical models with the DAISY software.

PubMed

Saccomani, Maria Pia; Audoly, Stefania; Bellu, Giuseppina; D'Angiò, Leontina

2010-04-01

DAISY (Differential Algebra for Identifiability of SYstems) is a recently developed computer algebra software tool which can be used to automatically check global identifiability of (linear and) nonlinear dynamic models described by differential equations involving polynomial or rational functions. Global identifiability is a fundamental prerequisite for model identification which is important not only for biological or medical systems but also for many physical and engineering systems derived from first principles. Lack of identifiability implies that the parameter estimation techniques may not fail but any obtained numerical estimates will be meaningless. The software does not require understanding of the underlying mathematical principles and can be used by researchers in applied fields with a minimum of mathematical background. We illustrate the DAISY software by checking the a priori global identifiability of two benchmark nonlinear models taken from the literature. The analysis of these two examples includes comparison with other methods and demonstrates how identifiability analysis is simplified by this tool. Thus we illustrate the identifiability analysis of other two examples, by including discussion of some specific aspects related to the role of observability and knowledge of initial conditions in testing identifiability and to the computational complexity of the software. The main focus of this paper is not on the description of the mathematical background of the algorithm, which has been presented elsewhere, but on illustrating its use and on some of its more interesting features. DAISY is available on the web site http://www.dei.unipd.it/ approximately pia/. 2010 Elsevier Ltd. All rights reserved.

The Effect of a Math Emporium Course Redesign in Developmental and Introductory Mathematics Courses on Student Achievement and Students' Attitudes toward Mathematics at a Two-Year College

ERIC Educational Resources Information Center

Bishop, Amy Renee

2010-01-01

The purpose of this research was to determine the effect of computer-based instruction on student mathematics achievement and students' attitudes toward mathematics in developmental and introductory mathematics courses, namely Elementary Algebra, Intermediate Algebra, and College Algebra, at a community college. The researcher also examined the…

Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines

DTIC Science & Technology

1989-09-01

Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines Srinivas Devadas and Kurt Keutzer F ( Abstract In this...Projects Agency under contract number N00014-87-K-0825. Author Information Devadas : Department of Electrical Engineering and Computer Science, Room 36...MA 02139; (617) 253-0292. 0 * Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines Siivas Devadas

An Example of Competence-Based Learning: Use of Maxima in Linear Algebra for Engineers

ERIC Educational Resources Information Center

Diaz, Ana; Garcia, Alfonsa; de la Villa, Agustin

2011-01-01

This paper analyses the role of Computer Algebra Systems (CAS) in a model of learning based on competences. The proposal is an e-learning model Linear Algebra course for Engineering, which includes the use of a CAS (Maxima) and focuses on problem solving. A reference model has been taken from the Spanish Open University. The proper use of CAS is…

Linear algebraic theory of partial coherence: discrete fields and measures of partial coherence.

PubMed

Ozaktas, Haldun M; Yüksel, Serdar; Kutay, M Alper

2002-08-01

A linear algebraic theory of partial coherence is presented that allows precise mathematical definitions of concepts such as coherence and incoherence. This not only provides new perspectives and insights but also allows us to employ the conceptual and algebraic tools of linear algebra in applications. We define several scalar measures of the degree of partial coherence of an optical field that are zero for full incoherence and unity for full coherence. The mathematical definitions are related to our physical understanding of the corresponding concepts by considering them in the context of Young's experiment.

Celestial mechanics with geometric algebra

NASA Technical Reports Server (NTRS)

Hestenes, D.

1983-01-01

Geometric algebra is introduced as a general tool for Celestial Mechanics. A general method for handling finite rotations and rotational kinematics is presented. The constants of Kepler motion are derived and manipulated in a new way. A new spinor formulation of perturbation theory is developed.

A three-dimensional algebraic grid generation scheme for gas turbine combustors with inclined slots

NASA Technical Reports Server (NTRS)

Yang, S. L.; Cline, M. C.; Chen, R.; Chang, Y. L.

1993-01-01

A 3D algebraic grid generation scheme is presented for generating the grid points inside gas turbine combustors with inclined slots. The scheme is based on the 2D transfinite interpolation method. Since the scheme is a 2D approach, it is very efficient and can easily be extended to gas turbine combustors with either dilution hole or slot configurations. To demonstrate the feasibility and the usefulness of the technique, a numerical study of the quick-quench/lean-combustion (QQ/LC) zones of a staged turbine combustor is given. Preliminary results illustrate some of the major features of the flow and temperature fields in the QQ/LC zones. Formation of co- and counter-rotating bulk flow and shape temperature fields can be observed clearly, and the resulting patterns are consistent with experimental observations typical of the confined slanted jet-in-cross flow. Numerical solutions show the method to be an efficient and reliable tool for generating computational grids for analyzing gas turbine combustors with slanted slots.

Modular Hamiltonians on the null plane and the Markov property of the vacuum state

NASA Astrophysics Data System (ADS)

Casini, Horacio; Testé, Eduardo; Torroba, Gonzalo

2017-09-01

We compute the modular Hamiltonians of regions having the future horizon lying on a null plane. For a CFT this is equivalent to regions with a boundary of arbitrary shape lying on the null cone. These Hamiltonians have a local expression on the horizon formed by integrals of the stress tensor. We prove this result in two different ways, and show that the modular Hamiltonians of these regions form an infinite dimensional Lie algebra. The corresponding group of unitary transformations moves the fields on the null surface locally along the null generators with arbitrary null line dependent velocities, but act non-locally outside the null plane. We regain this result in greater generality using more abstract tools on the algebraic quantum field theory. Finally, we show that modular Hamiltonians on the null surface satisfy a Markov property that leads to the saturation of the strong sub-additive inequality for the entropies and to the strong super-additivity of the relative entropy.

Remarks on a one-parameter family of singular matrices

NASA Astrophysics Data System (ADS)

Sharma, Ramesh; Pariso, Chris; Duda, Michelle

2015-01-01

This short article will present to the reader a family of matrices that form an algebra over the reals. This presentation provides both current and former students of modern abstract algebra a better illustration of the concepts of rings, fields, and algebra itself. In addition, this article relates eigenspaces of 3×3 matrices with the arithmetic-geometric mean equality, an attribute that teachers might enjoy utilizing as a teaching tool in their classes.

Algebraic model checking for Boolean gene regulatory networks.

PubMed

Tran, Quoc-Nam

2011-01-01

We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.

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.

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.

A finite element computation of turbulent boundary layer flows with an algebraic stress turbulence model

NASA Technical Reports Server (NTRS)

Kim, Sang-Wook; Chen, Yen-Sen

1988-01-01

An algebraic stress turbulence model and a computational procedure for turbulent boundary layer flows which is based on the semidiscrete Galerkin FEM are discussed. In the algebraic stress turbulence model, the eddy viscosity expression is obtained from the Reynolds stress turbulence model, and the turbulent kinetic energy dissipation rate equation is improved by including a production range time scale. Good agreement with experimental data is found for the examples of a fully developed channel flow, a fully developed pipe flow, a flat plate boundary layer flow, a plane jet exhausting into a moving stream, a circular jet exhausting into a moving stream, and a wall jet flow.

Weak completions, bornologies and rigid cohomology

NASA Astrophysics Data System (ADS)

Cortiñas, Guillermo; Cuntz, Joachim; Meyer, Ralf; Tamme, Georg

2018-07-01

Let V be a complete discrete valuation ring with residue field k of positive characteristic and with fraction field K of characteristic 0. We clarify the analysis behind the Monsky-Washnitzer completion of a commutative V-algebra using completions of bornological V-algebras. This leads us to a functorial chain complex for a finitely generated commutative algebra over the residue field k that computes its rigid cohomology in the sense of Berthelot.

Grid generation methodology and CFD simulations in sliding vane compressors and expanders

NASA Astrophysics Data System (ADS)

Bianchi, Giuseppe; Rane, Sham; Kovacevic, Ahmed; Cipollone, Roberto; Murgia, Stefano; Contaldi, Giulio

2017-08-01

The limiting factor for the employment of advanced 3D CFD tools in the analysis and design of rotary vane machines is the unavailability of methods for generation of computational grids suitable for fast and reliable numerical analysis. The paper addresses this challenge presenting the development of an analytical grid generation for vane machines that is based on the user defined nodal displacement. In particular, mesh boundaries are defined as parametric curves generated using trigonometrical modelling of the axial cross section of the machine while the distribution of computational nodes is performed using algebraic algorithms with transfinite interpolation, post orthogonalisation and smoothing. Algebraic control functions are introduced for distribution of nodes on the rotor and casing boundaries in order to achieve good grid quality in terms of cell size and expansion. In this way, the moving and deforming fluid domain of the sliding vane machine is discretized and the conservation of intrinsic quantities in ensured by maintaining the cell connectivity and structure. For validation of generated grids, a mid-size air compressor and a small-scale expander for Organic Rankine Cycle applications have been investigated in this paper. Remarks on implementation of the mesh motion algorithm, stability and robustness experienced with the ANSYS CFX solver as well as the obtained flow results are presented.

Automated analysis in generic groups

NASA Astrophysics Data System (ADS)

Fagerholm, Edvard

This thesis studies automated methods for analyzing hardness assumptions in generic group models, following ideas of symbolic cryptography. We define a broad class of generic and symbolic group models for different settings---symmetric or asymmetric (leveled) k-linear groups --- and prove ''computational soundness'' theorems for the symbolic models. Based on this result, we formulate a master theorem that relates the hardness of an assumption to solving problems in polynomial algebra. We systematically analyze these problems identifying different classes of assumptions and obtain decidability and undecidability results. Then, we develop automated procedures for verifying the conditions of our master theorems, and thus the validity of hardness assumptions in generic group models. The concrete outcome is an automated tool, the Generic Group Analyzer, which takes as input the statement of an assumption, and outputs either a proof of its generic hardness or shows an algebraic attack against the assumption. Structure-preserving signatures are signature schemes defined over bilinear groups in which messages, public keys and signatures are group elements, and the verification algorithm consists of evaluating ''pairing-product equations''. Recent work on structure-preserving signatures studies optimality of these schemes in terms of the number of group elements needed in the verification key and the signature, and the number of pairing-product equations in the verification algorithm. While the size of keys and signatures is crucial for many applications, another aspect of performance is the time it takes to verify a signature. The most expensive operation during verification is the computation of pairings. However, the concrete number of pairings is not captured by the number of pairing-product equations considered in earlier work. We consider the question of what is the minimal number of pairing computations needed to verify structure-preserving signatures. We build an automated tool to search for structure-preserving signatures matching a template. Through exhaustive search we conjecture lower bounds for the number of pairings required in the Type~II setting and prove our conjecture to be true. Finally, our tool exhibits examples of structure-preserving signatures matching the lower bounds, which proves tightness of our bounds, as well as improves on previously known structure-preserving signature schemes.

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

Witzel, Wayne; Rudinger, Kenneth Michael; Sarovar, Mohan

Using a novel formal methods approach, we have generated computer-veri ed proofs of major theorems pertinent to the quantum phase estimation algorithm. This was accomplished using our Prove-It software package in Python. While many formal methods tools are available, their practical utility is limited. Translating a problem of interest into these systems and working through the steps of a proof is an art form that requires much expertise. One must surrender to the preferences and restrictions of the tool regarding how mathematical notions are expressed and what deductions are allowed. Automation is a major driver that forces restrictions. Our focus,more » on the other hand, is to produce a tool that allows users the ability to con rm proofs that are essentially known already. This goal is valuable in itself. We demonstrate the viability of our approach that allows the user great exibility in expressing state- ments and composing derivations. There were no major obstacles in following a textbook proof of the quantum phase estimation algorithm. There were tedious details of algebraic manipulations that we needed to implement (and a few that we did not have time to enter into our system) and some basic components that we needed to rethink, but there were no serious roadblocks. In the process, we made a number of convenient additions to our Prove-It package that will make certain algebraic manipulations easier to perform in the future. In fact, our intent is for our system to build upon itself in this manner.« less

Modules as Learning Tools in Linear Algebra

ERIC Educational Resources Information Center

Cooley, Laurel; Vidakovic, Draga; Martin, William O.; Dexter, Scott; Suzuki, Jeff; Loch, Sergio

2014-01-01

This paper reports on the experience of STEM and mathematics faculty at four different institutions working collaboratively to integrate learning theory with curriculum development in a core undergraduate linear algebra context. The faculty formed a Professional Learning Community (PLC) with a focus on learning theories in mathematics and…

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

Construction of Orthonormal Wavelets Using Symbolic Algebraic Methods

NASA Astrophysics Data System (ADS)

Černá, Dana; Finěk, Václav

2009-09-01

Our contribution is concerned with the solution of nonlinear algebraic equations systems arising from the computation of scaling coefficients of orthonormal wavelets with compact support. Specifically Daubechies wavelets, symmlets, coiflets, and generalized coiflets. These wavelets are defined as a solution of equation systems which are partly linear and partly nonlinear. The idea of presented methods consists in replacing those equations for scaling coefficients by equations for scaling moments. It enables us to eliminate some quadratic conditions in the original system and then simplify it. The simplified system is solved with the aid of the Gröbner basis method. The advantage of our approach is that in some cases, it provides all possible solutions and these solutions can be computed to arbitrary precision. For small systems, we are even able to find explicit solutions. The computation was carried out by symbolic algebra software Maple.

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.

The Jukes-Cantor Model of Molecular Evolution

ERIC Educational Resources Information Center

Erickson, Keith

2010-01-01

The material in this module introduces students to some of the mathematical tools used to examine molecular evolution. This topic is standard fare in many mathematical biology or bioinformatics classes, but could also be suitable for classes in linear algebra or probability. While coursework in matrix algebra, Markov processes, Monte Carlo…

Using an Online Tool for Learning about and Implementing Algebra Progress Monitoring

ERIC Educational Resources Information Center

Foegen, Anne; Stecker, Pamela M.; Genareo, Vincent R.; Lyons, Renée; Olson, Jeannette R.; Simpson, Amber; Romig, John Elwood; Jones, Rachel

2016-01-01

Research supports special educators' use of progress-monitoring data for instructional decision-making purposes as an evidence-based practice for improving student achievement. This article describes the Professional Development for Algebra Progress Monitoring (PD-APM) system. PD-APM, is an online system that includes two "hubs" that…

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.

MULTIVARIATERESIDUES : A Mathematica package for computing multivariate residues

NASA Astrophysics Data System (ADS)

Larsen, Kasper J.; Rietkerk, Robbert

2018-01-01

Multivariate residues appear in many different contexts in theoretical physics and algebraic geometry. In theoretical physics, they for example give the proper definition of generalized-unitarity cuts, and they play a central role in the Grassmannian formulation of the S-matrix by Arkani-Hamed et al. In realistic cases their evaluation can be non-trivial. In this paper we provide a Mathematica package for efficient evaluation of multivariate residues based on methods from computational algebraic geometry.

(q,{mu}) and (p,q,{zeta})-exponential functions: Rogers-Szego'' polynomials and Fourier-Gauss transform

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

Hounkonnou, Mahouton Norbert; Nkouankam, Elvis Benzo Ngompe

2010-10-15

From the realization of q-oscillator algebra in terms of generalized derivative, we compute the matrix elements from deformed exponential functions and deduce generating functions associated with Rogers-Szego polynomials as well as their relevant properties. We also compute the matrix elements associated with the (p,q)-oscillator algebra (a generalization of the q-one) and perform the Fourier-Gauss transform of a generalization of the deformed exponential functions.

A Electro-Optical Image Algebra Processing System for Automatic Target Recognition

NASA Astrophysics Data System (ADS)

Coffield, Patrick Cyrus

The proposed electro-optical image algebra processing system is designed specifically for image processing and other related computations. The design is a hybridization of an optical correlator and a massively paralleled, single instruction multiple data processor. The architecture of the design consists of three tightly coupled components: a spatial configuration processor (the optical analog portion), a weighting processor (digital), and an accumulation processor (digital). The systolic flow of data and image processing operations are directed by a control buffer and pipelined to each of the three processing components. The image processing operations are defined in terms of basic operations of an image algebra developed by the University of Florida. The algebra is capable of describing all common image-to-image transformations. The merit of this architectural design is how it implements the natural decomposition of algebraic functions into spatially distributed, point use operations. The effect of this particular decomposition allows convolution type operations to be computed strictly as a function of the number of elements in the template (mask, filter, etc.) instead of the number of picture elements in the image. Thus, a substantial increase in throughput is realized. The implementation of the proposed design may be accomplished in many ways. While a hybrid electro-optical implementation is of primary interest, the benefits and design issues of an all digital implementation are also discussed. The potential utility of this architectural design lies in its ability to control a large variety of the arithmetic and logic operations of the image algebra's generalized matrix product. The generalized matrix product is the most powerful fundamental operation in the algebra, thus allowing a wide range of applications. No other known device or design has made this claim of processing speed and general implementation of a heterogeneous image algebra.

Pre-Algebra Groups. Concepts & Applications.

ERIC Educational Resources Information Center

Montgomery County Public Schools, Rockville, MD.

Discussion material and exercises related to pre-algebra groups are provided in this five chapter manual. Chapter 1 (mappings) focuses on restricted domains, order of operations (parentheses and exponents), rules of assignment, and computer extensions. Chapter 2 considers finite number systems, including binary operations, clock arithmetic,…

A ∞-Algebra of an Elliptic Curve and Eisenstein Series

NASA Astrophysics Data System (ADS)

Polishchuk, Alexander

2011-02-01

We compute explicitly the A ∞-structure on the algebra {Ext^*(mathcal{O}_C oplus L, mathcal{O}_C oplus L)} , where L is a line bundle of degree 1 on an elliptic curve C. The answer involves higher derivatives of Eisenstein series.

The Golden Ratio: A Golden Opportunity to Investigate Multiple Representations of a Problem.

ERIC Educational Resources Information Center

Dickey, Edwin M.

1993-01-01

This article explores the multiple representations (verbal, algebraic, graphical, and numerical) that can be used to study the golden ratio. Emphasis is placed on using technology (both calculators and computers) to investigate the algebraic, graphical, and numerical representations. (JAF)

Heterogeneous Software System Interoperability Through Computer-Aided Resolution of Modeling Differences

DTIC Science & Technology

2002-06-01

techniques for addressing the software component retrieval problem. Steigerwald [Ste91] introduced the use of algebraic specifications for defining the...provided in terms of a specification written using Luqi’s Prototype Specification Description Language (PSDL) [LBY88] augmented with an algebraic

An Ada Linear-Algebra Software Package Modeled After HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, Allan R.; Lawson, Charles L.

1990-01-01

New avionics software written more easily. Software package extends Ada programming language to include linear-algebra capabilities similar to those of HAL/S programming language. Designed for such avionics applications as Space Station flight software. In addition to built-in functions of HAL/S, package incorporates quaternion functions used in Space Shuttle and Galileo projects and routines from LINPAK solving systems of equations involving general square matrices. Contains two generic programs: one for floating-point computations and one for integer computations. Written on IBM/AT personal computer running under PC DOS, v.3.1.

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.

Perturbation theory in light-cone quantization

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

Langnau, A.

1992-01-01

A thorough investigation of light-cone properties which are characteristic for higher dimensions is very important. The easiest way of addressing these issues is by analyzing the perturbative structure of light-cone field theories first. Perturbative studies cannot be substituted for an analysis of problems related to a nonperturbative approach. However, in order to lay down groundwork for upcoming nonperturbative studies, it is indispensable to validate the renormalization methods at the perturbative level, i.e., to gain control over the perturbative treatment first. A clear understanding of divergences in perturbation theory, as well as their numerical treatment, is a necessary first step towardsmore » formulating such a program. The first objective of this dissertation is to clarify this issue, at least in second and fourth-order in perturbation theory. The work in this dissertation can provide guidance for the choice of counterterms in Discrete Light-Cone Quantization or the Tamm-Dancoff approach. A second objective of this work is the study of light-cone perturbation theory as a competitive tool for conducting perturbative Feynman diagram calculations. Feynman perturbation theory has become the most practical tool for computing cross sections in high energy physics and other physical properties of field theory. Although this standard covariant method has been applied to a great range of problems, computations beyond one-loop corrections are very difficult. Because of the algebraic complexity of the Feynman calculations in higher-order perturbation theory, it is desirable to automatize Feynman diagram calculations so that algebraic manipulation programs can carry out almost the entire calculation. This thesis presents a step in this direction. The technique we are elaborating on here is known as light-cone perturbation theory.« less

Classification of quantum groups and Belavin–Drinfeld cohomologies for orthogonal and symplectic Lie algebras

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

Kadets, Boris; Karolinsky, Eugene; Pop, Iulia

2016-05-15

In this paper we continue to study Belavin–Drinfeld cohomology introduced in Kadets et al., Commun. Math. Phys. 344(1), 1-24 (2016) and related to the classification of quantum groups whose quasi-classical limit is a given simple complex Lie algebra #Mathematical Fraktur Small G#. Here we compute Belavin–Drinfeld cohomology for all non-skewsymmetric r-matrices on the Belavin–Drinfeld list for simple Lie algebras of type B, C, and D.

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

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.

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.

Designing Tasks for Math Modeling in College Algebra: A Critical Review

ERIC Educational Resources Information Center

Staats, Susan; Robertson, Douglas

2014-01-01

Over the last decade, the pedagogical approach known as mathematical modeling has received increased interest in college algebra classes in the United States. Math modeling assignments ask students to develop their own problem-solving tools to address non-routine, realistic scenarios. The open-ended quality of modeling activities creates dilemmas…

Some applications of mathematics in theoretical physics - A review

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

Bora, Kalpana

2016-06-21

Mathematics is a very beautiful subject−very much an indispensible tool for Physics, more so for Theoretical Physics (by which we mean here mainly Field Theory and High Energy Physics). These branches of Physics are based on Quantum Mechanics and Special Theory of Relativity, and many mathematical concepts are used in them. In this work, we shall elucidate upon only some of them, like−differential geometry, infinite series, Mellin transforms, Fourier and integral transforms, special functions, calculus, complex algebra, topology, group theory, Riemannian geometry, functional analysis, linear algebra, operator algebra, etc. We shall also present, some physics issues, where these mathematical toolsmore » are used. It is not wrong to say that Mathematics is such a powerful tool, without which, there can not be any Physics theory!! A brief review on our research work is also presented.« less

A computing method for sound propagation through a nonuniform jet stream

NASA Technical Reports Server (NTRS)

Padula, S. L.; Liu, C. H.

1974-01-01

The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

The ALARM Experiment

ERIC Educational Resources Information Center

Gerhardt, Ira

2015-01-01

An experiment was conducted over three recent semesters of an introductory calculus course to test whether it was possible to quantify the effect that difficulty with basic algebraic and arithmetic computation had on individual performance. Points lost during the term were classified as being due to either algebraic and arithmetic mistakes…

Applications of Maple To Algebraic Cryptography.

ERIC Educational Resources Information Center

Sigmon, Neil P.

1997-01-01

Demonstrates the use of technology to enhance the appreciation of applications involving abstract algebra. The symbolic manipulator Maple can perform computations required for a linear cryptosystem. One major benefit of this process is that students can encipher and decipher messages using a linear cryptosystem without becoming confused and…

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.

Teaching of real numbers by using the Archimedes-Cantor approach and computer algebra systems

NASA Astrophysics Data System (ADS)

Vorob'ev, Evgenii M.

2015-11-01

Computer technologies and especially computer algebra systems (CAS) allow students to overcome some of the difficulties they encounter in the study of real numbers. The teaching of calculus can be considerably more effective with the use of CAS provided the didactics of the discipline makes it possible to reveal the full computational potential of CAS. In the case of real numbers, the Archimedes-Cantor approach satisfies this requirement. The name of Archimedes brings back the exhaustion method. Cantor's name reminds us of the use of Cauchy rational sequences to represent real numbers. The usage of CAS with the Archimedes-Cantor approach enables the discussion of various representations of real numbers such as graphical, decimal, approximate decimal with precision estimates, and representation as points on a straight line. Exercises with numbers such as e, π, the golden ratio ϕ, and algebraic irrational numbers can help students better understand the real numbers. The Archimedes-Cantor approach also reveals a deep and close relationship between real numbers and continuity, in particular the continuity of functions.

Cryptographic Properties of Monotone Boolean Functions

DTIC Science & Technology

2016-01-01

Algebraic attacks on stream ciphers with linear feedback, in: Advances in Cryptology (Eurocrypt 2003), Lecture Notes in Comput. Sci. 2656, Springer, Berlin...spectrum, algebraic immu- nity MSC 2010: 06E30, 94C10, 94A60, 11T71, 05E99 || Communicated by: Carlo Blundo 1 Introduction Let F 2 be the prime eld of...7]. For the reader’s convenience, we recall some basic notions below. Any f ∈ Bn can be expressed in algebraic normal form (ANF) as f(x 1 , x 2

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.

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

Chung, Won Sang, E-mail: mimip4444@hanmail.net; Hounkonnou, Mahouton Norbert, E-mail: norbert.hounkonnou@cipma.uac.bj; Arjika, Sama, E-mail: rjksama2008@gmail.com

In this paper, we propose a full characterization of a generalized q-deformed Tamm-Dancoff oscillator algebra and investigate its main mathematical and physical properties. Specifically, we study its various representations and find the condition satisfied by the deformed q-number to define the algebra structure function. Particular Fock spaces involving finite and infinite dimensions are examined. A deformed calculus is performed as well as a coordinate realization for this algebra. A relevant example is exhibited. Associated coherent states are constructed. Finally, some thermodynamics aspects are computed and discussed.

Workflows in bioinformatics: meta-analysis and prototype implementation of a workflow generator.

PubMed

Garcia Castro, Alexander; Thoraval, Samuel; Garcia, Leyla J; Ragan, Mark A

2005-04-07

Computational methods for problem solving need to interleave information access and algorithm execution in a problem-specific workflow. The structures of these workflows are defined by a scaffold of syntactic, semantic and algebraic objects capable of representing them. Despite the proliferation of GUIs (Graphic User Interfaces) in bioinformatics, only some of them provide workflow capabilities; surprisingly, no meta-analysis of workflow operators and components in bioinformatics has been reported. We present a set of syntactic components and algebraic operators capable of representing analytical workflows in bioinformatics. Iteration, recursion, the use of conditional statements, and management of suspend/resume tasks have traditionally been implemented on an ad hoc basis and hard-coded; by having these operators properly defined it is possible to use and parameterize them as generic re-usable components. To illustrate how these operations can be orchestrated, we present GPIPE, a prototype graphic pipeline generator for PISE that allows the definition of a pipeline, parameterization of its component methods, and storage of metadata in XML formats. This implementation goes beyond the macro capacities currently in PISE. As the entire analysis protocol is defined in XML, a complete bioinformatic experiment (linked sets of methods, parameters and results) can be reproduced or shared among users. http://if-web1.imb.uq.edu.au/Pise/5.a/gpipe.html (interactive), ftp://ftp.pasteur.fr/pub/GenSoft/unix/misc/Pise/ (download). From our meta-analysis we have identified syntactic structures and algebraic operators common to many workflows in bioinformatics. The workflow components and algebraic operators can be assimilated into re-usable software components. GPIPE, a prototype implementation of this framework, provides a GUI builder to facilitate the generation of workflows and integration of heterogeneous analytical tools.

Motivating the Concept of Eigenvectors via Cryptography

ERIC Educational Resources Information Center

Siap, Irfan

2008-01-01

New methods of teaching linear algebra in the undergraduate curriculum have attracted much interest lately. Most of this work is focused on evaluating and discussing the integration of special computer software into the Linear Algebra curriculum. In this article, I discuss my approach on introducing the concept of eigenvectors and eigenvalues,…

Solving Optimization Problems with Spreadsheets

ERIC Educational Resources Information Center

Beigie, Darin

2017-01-01

Spreadsheets provide a rich setting for first-year algebra students to solve problems. Individual spreadsheet cells play the role of variables, and creating algebraic expressions for a spreadsheet to perform a task allows students to achieve a glimpse of how mathematics is used to program a computer and solve problems. Classic optimization…

Lattices, vertex algebras, and modular categories

NASA Astrophysics Data System (ADS)

van Ekeren, Jethro

2018-03-01

In this note we give an account of recent progress on the construction of holomorphic vertex algebras as cyclic orbifolds as well as related topics in lattices and modular categories. We present a novel computation of the Schur indicator of a lattice involution orbifold using finite Heisenberg groups and discriminant forms.

Racing against Time: Using Technology To Explore Distance, Rate, and Time.

ERIC Educational Resources Information Center

Essex, N. Kathryn; Lambdin, Diana V.; McGraw, Rebecca H.

2002-01-01

Investigates ways to analyze change in various contexts. Focuses on computer technology providing contexts for children's investigations of patterns of change and helping to develop foundational ideas of algebra and calculus. Discusses relationships between patterns of change, fundamental algebraic notions as linear and nonlinear functions, and…

Titration Calculations with Computer Algebra Software

ERIC Educational Resources Information Center

Lachance, Russ; Biaglow, Andrew

2012-01-01

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

Equations of motion for a spectrum-generating algebra: Lipkin Meshkov Glick model

NASA Astrophysics Data System (ADS)

Rosensteel, G.; Rowe, D. J.; Ho, S. Y.

2008-01-01

For a spectrum-generating Lie algebra, a generalized equations-of-motion scheme determines numerical values of excitation energies and algebra matrix elements. In the approach to the infinite particle number limit or, more generally, whenever the dimension of the quantum state space is very large, the equations-of-motion method may achieve results that are impractical to obtain by diagonalization of the Hamiltonian matrix. To test the method's effectiveness, we apply it to the well-known Lipkin-Meshkov-Glick (LMG) model to find its low-energy spectrum and associated generator matrix elements in the eigenenergy basis. When the dimension of the LMG representation space is 106, computation time on a notebook computer is a few minutes. For a large particle number in the LMG model, the low-energy spectrum makes a quantum phase transition from a nondegenerate harmonic vibrator to a twofold degenerate harmonic oscillator. The equations-of-motion method computes critical exponents at the transition point.

A Module Language for Typing by Contracts

NASA Technical Reports Server (NTRS)

Glouche, Yann; Talpin, Jean-Pierre; LeGuernic, Paul; Gautier, Thierry

2009-01-01

Assume-guarantee reasoning is a popular and expressive paradigm for modular and compositional specification of programs. It is becoming a fundamental concept in some computer-aided design tools for embedded system design. In this paper, we elaborate foundations for contract-based embedded system design by proposing a general-purpose module language based on a Boolean algebra allowing to define contracts. In this framework, contracts are used to negotiate the correctness of assumptions made on the definition of a component at the point where it is used and provides guarantees to its environment. We illustrate this presentation with the specification of a simplified 4-stroke engine model.

Computers and the Rational-Root Theorem--Another View.

ERIC Educational Resources Information Center

Waits, Bert K.; Demana, Franklin

1989-01-01

An approach to finding the rational roots of polynomial equations based on computer graphing is given. It integrates graphing with the purely algebraic approach. Either computers or graphing calculators can be used. (MNS)

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

ERIC Educational Resources Information Center

Ng, Swee Fong; Lee, Kerry

2009-01-01

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

Mathematical Modelling and the Learning Trajectory: Tools to Support the Teaching of Linear Algebra

ERIC Educational Resources Information Center

Cárcamo Bahamonde, Andrea Dorila; Fortuny Aymemí, Josep Maria; Gómez i Urgellés, Joan Vicenç

2017-01-01

In this article we present a didactic proposal for teaching linear algebra based on two compatible theoretical models: emergent models and mathematical modelling. This proposal begins with a problematic situation related to the creation and use of secure passwords, which leads students toward the construction of the concepts of spanning set and…

Effective Communication, Critical Aspects and Compositionality in Algebra

ERIC Educational Resources Information Center

Olteanu, Lucian

2014-01-01

This paper contains a discussion of how the concept of critical aspects and the principle of compositionality can provide a powerful tool to analyse and understand the communications that occur in the classroom. It is grounded in data collected in a longitudinal study. The content chosen is algebra. It is argued that the critical aspects and the…

Current algebra, statistical mechanics and quantum models

NASA Astrophysics Data System (ADS)

Vilela Mendes, R.

2017-11-01

Results obtained in the past for free boson systems at zero and nonzero temperatures are revisited to clarify the physical meaning of current algebra reducible functionals which are associated to systems with density fluctuations, leading to observable effects on phase transitions. To use current algebra as a tool for the formulation of quantum statistical mechanics amounts to the construction of unitary representations of diffeomorphism groups. Two mathematical equivalent procedures exist for this purpose. One searches for quasi-invariant measures on configuration spaces, the other for a cyclic vector in Hilbert space. Here, one argues that the second approach is closer to the physical intuition when modelling complex systems. An example of application of the current algebra methodology to the pairing phenomenon in two-dimensional fermion systems is discussed.

Commutative Algebras of Toeplitz Operators in Action

NASA Astrophysics Data System (ADS)

Vasilevski, Nikolai

2011-09-01

We will discuss a quite unexpected phenomenon in the theory of Toeplitz operators on the Bergman space: the existence of a reach family of commutative C*-algebras generated by Toeplitz operators with non-trivial symbols. As it tuns out the smoothness properties of symbols do not play any role in the commutativity, the symbols can be merely measurable. Everything is governed here by the geometry of the underlying manifold, the hyperbolic geometry of the unit disk. We mention as well that the complete characterization of these commutative C*-algebras of Toeplitz operators requires the Berezin quantization procedure. These commutative algebras come with a powerful research tool, the spectral type representation for the operators under study, which permit us to answer to many important questions in the area.

Supersymmetric symplectic quantum mechanics

NASA Astrophysics Data System (ADS)

de Menezes, Miralvo B.; Fernandes, M. C. B.; Martins, Maria das Graças R.; Santana, A. E.; Vianna, J. D. M.

2018-02-01

Symplectic Quantum Mechanics SQM considers a non-commutative algebra of functions on a phase space Γ and an associated Hilbert space HΓ to construct a unitary representation for the Galilei group. From this unitary representation the Schrödinger equation is rewritten in phase space variables and the Wigner function can be derived without the use of the Liouville-von Neumann equation. In this article we extend the methods of supersymmetric quantum mechanics SUSYQM to SQM. With the purpose of applications in quantum systems, the factorization method of the quantum mechanical formalism is then set within supersymmetric SQM. A hierarchy of simpler hamiltonians is generated leading to new computation tools for solving the eigenvalue problem in SQM. We illustrate the results by computing the states and spectra of the problem of a charged particle in a homogeneous magnetic field as well as the corresponding Wigner function.

Accelerating the weighted histogram analysis method by direct inversion in the iterative subspace.

PubMed

Zhang, Cheng; Lai, Chun-Liang; Pettitt, B Montgomery

The weighted histogram analysis method (WHAM) for free energy calculations is a valuable tool to produce free energy differences with the minimal errors. Given multiple simulations, WHAM obtains from the distribution overlaps the optimal statistical estimator of the density of states, from which the free energy differences can be computed. The WHAM equations are often solved by an iterative procedure. In this work, we use a well-known linear algebra algorithm which allows for more rapid convergence to the solution. We find that the computational complexity of the iterative solution to WHAM and the closely-related multiple Bennett acceptance ratio (MBAR) method can be improved by using the method of direct inversion in the iterative subspace. We give examples from a lattice model, a simple liquid and an aqueous protein solution.

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.

Classical affine W-algebras associated to Lie superalgebras

NASA Astrophysics Data System (ADS)

Suh, Uhi Rinn

2016-02-01

In this paper, we prove classical affine W-algebras associated to Lie superalgebras (W-superalgebras), which can be constructed in two different ways: via affine classical Hamiltonian reductions and via taking quasi-classical limits of quantum affine W-superalgebras. Also, we show that a classical finite W-superalgebra can be obtained by a Zhu algebra of a classical affine W-superalgebra. Using the definition by Hamiltonian reductions, we find free generators of a classical W-superalgebra associated to a minimal nilpotent. Moreover, we compute generators of the classical W-algebra associated to spo(2|3) and its principal nilpotent. In the last part of this paper, we introduce a generalization of classical affine W-superalgebras called classical affine fractional W-superalgebras. We show these have Poisson vertex algebra structures and find generators of a fractional W-superalgebra associated to a minimal nilpotent.

Conformal field algebras with quantum symmetry from the theory of superselection sectors

NASA Astrophysics Data System (ADS)

Mack, Gerhard; Schomerus, Volker

1990-11-01

According to the theory of superselection sectors of Doplicher, Haag, and Roberts, field operators which make transitions between different superselection sectors—i.e. different irreducible representations of the observable algebra—are to be constructed by adjoining localized endomorphisms to the algebra of local observables. We find the relevant endomorphisms of the chiral algebra of observables in the minimal conformal model with central charge c=1/2 (Ising model). We show by explicit and elementary construction how they determine a representation of the braid group B ∞ which is associated with a Temperley-Lieb-Jones algebra. We recover fusion rules, and compute the quantum dimensions of the superselection sectors. We exhibit a field algebra which is quantum group covariant and acts in the Hilbert space of physical states. It obeys local braid relations in an appropriate weak sense.

On explicit algebraic stress models for complex turbulent flows

NASA Technical Reports Server (NTRS)

Gatski, T. B.; Speziale, C. G.

1992-01-01

Explicit algebraic stress models that are valid for three-dimensional turbulent flows in noninertial frames are systematically derived from a hierarchy of second-order closure models. This represents a generalization of the model derived by Pope who based his analysis on the Launder, Reece, and Rodi model restricted to two-dimensional turbulent flows in an inertial frame. The relationship between the new models and traditional algebraic stress models -- as well as anistropic eddy visosity models -- is theoretically established. The need for regularization is demonstrated in an effort to explain why traditional algebraic stress models have failed in complex flows. It is also shown that these explicit algebraic stress models can shed new light on what second-order closure models predict for the equilibrium states of homogeneous turbulent flows and can serve as a useful alternative in practical computations.

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.

Maple procedures for the coupling of angular momenta. IX. Wigner D-functions and rotation matrices

NASA Astrophysics Data System (ADS)

Pagaran, J.; Fritzsche, S.; Gaigalas, G.

2006-04-01

The Wigner D-functions, Dpqj(α,β,γ), are known for their frequent use in quantum mechanics. Defined as the matrix elements of the rotation operator Rˆ(α,β,γ) in R and parametrized in terms of the three Euler angles α, β, and γ, these functions arise not only in the transformation of tensor components under the rotation of the coordinates, but also as the eigenfunctions of the spherical top. In practice, however, the use of the Wigner D-functions is not always that simple, in particular, if expressions in terms of these and other functions from the theory of angular momentum need to be simplified before some computations can be carried out in detail. To facilitate the manipulation of such Racah expressions, here we present an extension to the RACAH program [S. Fritzsche, Comput. Phys. Comm. 103 (1997) 51] in which the properties and the algebraic rules of the Wigner D-functions and reduced rotation matrices are implemented. Care has been taken to combine the standard knowledge about the rotation matrices with the previously implemented rules for the Clebsch-Gordan coefficients, Wigner n-j symbols, and the spherical harmonics. Moreover, the application of the program has been illustrated below by means of three examples. Program summaryTitle of program:RACAH Catalogue identifier:ADFv_9_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADFv_9_0 Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Catalogue identifier of previous version: ADFW, ADHW, title RACAH Journal reference of previous version(s): S. Fritzsche, Comput. Phys. Comm. 103 (1997) 51; S. Fritzsche, S. Varga, D. Geschke, B. Fricke, Comput. Phys. Comm. 111 (1998) 167; S. Fritzsche, T. Inghoff, M. Tomaselli, Comput. Phys. Comm. 153 (2003) 424. Does the new version supersede the previous one: Yes, in addition to the spherical harmonics and recoupling coefficients, the program now supports also the occurrence of the Wigner rotation matrices in the algebraic expressions to be evaluated. Licensing provisions:None Computer for which the program is designed and others on which it is operable: All computers with a license for the computer algebra package Maple [Maple is a registered trademark of Waterloo Maple Inc.] Installations:University of Kassel (Germany) Operating systems under which the program has been tested: Linux 8.2+ Program language used:MAPLE, Release 8 and 9 Memory required to execute with typical data:10-50 MB No. of lines in distributed program, including test data, etc.:52 653 No. of bytes in distributed program, including test data, etc.:1 195 346 Distribution format:tar.gzip Nature of the physical problem: The Wigner D-functions and (reduced) rotation matrices occur very frequently in physical applications. They are known not only as the (infinite) representation of the rotation group but also to obey a number of integral and summation rules, including those for their orthogonality and completeness. Instead of the direct computation of these matrices, therefore, one first often wishes to find algebraic simplifications before the computations can be carried out in practice. Reasons for new version: The RACAH program has been found an efficient tool during recent years, in order to evaluate and simplify expressions from Racah's algebra. Apart from the Wigner n-j symbols ( j=3,6,9) and spherical harmonics, we now extended the code to allow for Wigner rotation matrices. This extension will support the study of those quantum processes especially where different axis of quantization occurs in course of the theoretical deviations. Summary of revisions: In a revised version of the RACAH program [S. Fritzsche, Comput. Phys. Comm. 103 (1997) 51; S. Fritzsche, T. Inghoff, M. Tomaselli, Comput. Phys. Comm. 153 (2003) 424], we now also support the occurrence of the Wigner D-functions and reduced rotation matrices. By following our previous design, the (algebraic) properties of these rotation matrices as well as a number of summation and integration rules are implemented to facilitate the algebraic simplification of expressions from the theories of angular momentum and the spherical tensor operators. Restrictions onto the complexity of the problem: The definition as well as the properties of the rotation matrices, as used in our implementation, are based mainly on the book of Varshalovich et al. [D.A. Varshalovich, A.N. Moskalev, V.K. Khersonskii, Quantum Theory of Angular Momentum, World Scientific, Singapore, 1988], Chapter 4. From this monograph, most of the relations involving the Wigner D-functions and rotation matrices are taken into account although, in practice, only a rather selected set was needed to be implemented explicitly owing to the symmetries of these functions. In the integration over the rotation matrices, products of up to three Wigner D-functions or reduced matrices (with the same angular arguments) are recognized and simplified properly; for the integration over a solid angle, however, the domain of integration must be specified for the Euler angles α and γ. This restriction arose because MAPLE does not generate a constant of integration when the limits in the integral are omitted. For any integration over the angle β the range of the integration, if omitted, is always taken from 0 to π. Unusual features of the program: The RACAH program is designed for interactive use that allows a quick and algebraic evaluation of (complex) expression from Racah's algebra. It is based on a number of well-defined data structures that are now extended to incorporate the Wigner rotation matrices. For these matrices, the transformation properties, sum rules, recursion relations, as well as a variety of special function expansions have been added to the previous functionality of the RACAH program. Moreover, the knowledge about the orthogonality as well as the completeness of the Wigner D-functions is also implemented. Typical running time:All the examples presented in Section 4 take only a few seconds on a 1.5 GHz Pentium Pro computer.

Algebraic grid adaptation method using non-uniform rational B-spline surface modeling

NASA Technical Reports Server (NTRS)

Yang, Jiann-Cherng; Soni, B. K.

1992-01-01

An algebraic adaptive grid system based on equidistribution law and utilized by the Non-Uniform Rational B-Spline (NURBS) surface for redistribution is presented. A weight function, utilizing a properly weighted boolean sum of various flow field characteristics is developed. Computational examples are presented to demonstrate the success of this technique.

Math/Measurement Literacy for Upgrading Skills of Industrial Hourly Workers. Math Manual.

ERIC Educational Resources Information Center

McMahon, Joan L.

This manual contains materials for a numeracy course for adult industrial workers. In addition to assessment tests, seven units are provided. Unit topics are whole numbers; fractions; decimals; percents, median, and range; measurement and signed numbers; ratio/proportion and introduction to algebra; and computer literacy using algebra software.…

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

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

ERIC Educational Resources Information Center

Quesada, Antonio R.

2003-01-01

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

Preliminary Success and Retention Rates in Selected Math Courses. Research Report.

ERIC Educational Resources Information Center

Cuesta Coll., San Luis Obispo, CA. Matriculation and Research Services.

This report presents findings of exploratory research on success, retention, and persistence in math courses at Cuesta College. The following research questions were addressed: (1) How do success rates in Math 23 (elementary algebra) and Math 27 (intermediate algebra) compare with traditional and computer-assisted formats? (2) What are the…

Analysis of Costs in an Algebra I Curriculum Effectiveness Study. Technical Report

ERIC Educational Resources Information Center

Daugherty, Lindsay; Phillips, Andrea; Pane, John F.; Karam, Rita

2012-01-01

In an ongoing study, RAND researchers are evaluating the effectiveness of Carnegie Learning's Cognitive Tutor Algebra I (CTAI) curriculum, a technology-based curriculum that combines classroom instruction with individualized instruction by a computer-based tutor. While the effectiveness of the curriculum in raising student achievement is the main…

Student Distractor Choices on the Mathematics Virginia Standards of Learning Middle School Assessments

ERIC Educational Resources Information Center

Lewis, Virginia Vimpeny

2011-01-01

Number Concepts; Measurement; Geometry; Probability; Statistics; and Patterns, Functions and Algebra. Procedural Errors were further categorized into the following content categories: Computation; Measurement; Statistics; and Patterns, Functions, and Algebra. The results of the analysis showed the main sources of error for 6th, 7th, and 8th…

Stability of Linear Equations--Algebraic Approach

ERIC Educational Resources Information Center

Cherif, Chokri; Goldstein, Avraham; Prado, Lucio M. G.

2012-01-01

This article could be of interest to teachers of applied mathematics as well as to people who are interested in applications of linear algebra. We give a comprehensive study of linear systems from an application point of view. Specifically, we give an overview of linear systems and problems that can occur with the computed solution when the…

High level language-based robotic control system

NASA Technical Reports Server (NTRS)

Rodriguez, Guillermo (Inventor); Kruetz, Kenneth K. (Inventor); Jain, Abhinandan (Inventor)

1994-01-01

This invention is a robot control system based on a high level language implementing a spatial operator algebra. There are two high level languages included within the system. At the highest level, applications programs can be written in a robot-oriented applications language including broad operators such as MOVE and GRASP. The robot-oriented applications language statements are translated into statements in the spatial operator algebra language. Programming can also take place using the spatial operator algebra language. The statements in the spatial operator algebra language from either source are then translated into machine language statements for execution by a digital control computer. The system also includes the capability of executing the control code sequences in a simulation mode before actual execution to assure proper action at execution time. The robot's environment is checked as part of the process and dynamic reconfiguration is also possible. The languages and system allow the programming and control of multiple arms and the use of inward/outward spatial recursions in which every computational step can be related to a transformation from one point in the mechanical robot to another point to name two major advantages.

High level language-based robotic control system

NASA Technical Reports Server (NTRS)

Rodriguez, Guillermo (Inventor); Kreutz, Kenneth K. (Inventor); Jain, Abhinandan (Inventor)

1996-01-01

This invention is a robot control system based on a high level language implementing a spatial operator algebra. There are two high level languages included within the system. At the highest level, applications programs can be written in a robot-oriented applications language including broad operators such as MOVE and GRASP. The robot-oriented applications language statements are translated into statements in the spatial operator algebra language. Programming can also take place using the spatial operator algebra language. The statements in the spatial operator algebra language from either source are then translated into machine language statements for execution by a digital control computer. The system also includes the capability of executing the control code sequences in a simulation mode before actual execution to assure proper action at execution time. The robot's environment is checked as part of the process and dynamic reconfiguration is also possible. The languages and system allow the programming and control of multiple arms and the use of inward/outward spatial recursions in which every computational step can be related to a transformation from one point in the mechanical robot to another point to name two major advantages.

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.

Realization of preconditioned Lanczos and conjugate gradient algorithms on optical linear algebra processors.

PubMed

Ghosh, A

1988-08-01

Lanczos and conjugate gradient algorithms are important in computational linear algebra. In this paper, a parallel pipelined realization of these algorithms on a ring of optical linear algebra processors is described. The flow of data is designed to minimize the idle times of the optical multiprocessor and the redundancy of computations. The effects of optical round-off errors on the solutions obtained by the optical Lanczos and conjugate gradient algorithms are analyzed, and it is shown that optical preconditioning can improve the accuracy of these algorithms substantially. Algorithms for optical preconditioning and results of numerical experiments on solving linear systems of equations arising from partial differential equations are discussed. Since the Lanczos algorithm is used mostly with sparse matrices, a folded storage scheme to represent sparse matrices on spatial light modulators is also described.

Preserving Simplecticity in the Numerical Integration of Linear Beam Optics

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

Allen, Christopher K.

2017-07-01

Presented are mathematical tools and methods for the development of numerical integration techniques that preserve the symplectic condition inherent to mechanics. The intended audience is for beam physicists with backgrounds in numerical modeling and simulation with particular attention to beam optics applications. The paper focuses on Lie methods that are inherently symplectic regardless of the integration accuracy order. Section 2 provides the mathematically tools used in the sequel and necessary for the reader to extend the covered techniques. Section 3 places those tools in the context of charged-particle beam optics; in particular linear beam optics is presented in terms ofmore » a Lie algebraic matrix representation. Section 4 presents numerical stepping techniques with particular emphasis on a third-order leapfrog method. Section 5 discusses the modeling of field imperfections with particular attention to the fringe fields of quadrupole focusing magnets. The direct computation of a third order transfer matrix for a fringe field is shown.« less

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

Heroux, Michael Allen; Marker, Bryan

This report summarizes the progress made as part of a one year lab-directed research and development (LDRD) project to fund the research efforts of Bryan Marker at the University of Texas at Austin. The goal of the project was to develop new techniques for automatically tuning the performance of dense linear algebra kernels. These kernels often represent the majority of computational time in an application. The primary outcome from this work is a demonstration of the value of model driven engineering as an approach to accurately predict and study performance trade-offs for dense linear algebra computations.

Dual-scale topology optoelectronic processor.

PubMed

Marsden, G C; Krishnamoorthy, A V; Esener, S C; Lee, S H

1991-12-15

The dual-scale topology optoelectronic processor (D-STOP) is a parallel optoelectronic architecture for matrix algebraic processing. The architecture can be used for matrix-vector multiplication and two types of vector outer product. The computations are performed electronically, which allows multiplication and summation concepts in linear algebra to be generalized to various nonlinear or symbolic operations. This generalization permits the application of D-STOP to many computational problems. The architecture uses a minimum number of optical transmitters, which thereby reduces fabrication requirements while maintaining area-efficient electronics. The necessary optical interconnections are space invariant, minimizing space-bandwidth requirements.

The Development and Validation of the Algebra Curriculum Based Measure: A Measure of Preschool Children's Sorting and Classifying Skills

ERIC Educational Resources Information Center

Maherally, Mohammad Iqbal

2014-01-01

The purpose of this study was to develop and validate an assessment tool entitled the Algebra Curriculum Based Measure (ACBM) with the intent of measuring preschool children's sorting and classifying skills based on one attribute (color, shape, and size) and two attributes (color and shape) simultaneously; and their ability to explain their…

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.

Symbolic computation of the Birkhoff normal form in the problem of stability of the triangular libration points

NASA Astrophysics Data System (ADS)

Shevchenko, I. I.

2008-05-01

The problem of stability of the triangular libration points in the planar circular restricted three-body problem is considered. A software package, intended for normalization of autonomous Hamiltonian systems by means of computer algebra, is designed so that normalization problems of high analytical complexity could be solved. It is used to obtain the Birkhoff normal form of the Hamiltonian in the given problem. The normalization is carried out up to the 6th order of expansion of the Hamiltonian in the coordinates and momenta. Analytical expressions for the coefficients of the normal form of the 6th order are derived. Though intermediary expressions occupy gigabytes of the computer memory, the obtained coefficients of the normal form are compact enough for presentation in typographic format. The analogue of the Deprit formula for the stability criterion is derived in the 6th order of normalization. The obtained floating-point numerical values for the normal form coefficients and the stability criterion confirm the results by Markeev (1969) and Coppola and Rand (1989), while the obtained analytical and exact numeric expressions confirm the results by Meyer and Schmidt (1986) and Schmidt (1989). The given computational problem is solved without constructing a specialized algebraic processor, i.e., the designed computer algebra package has a broad field of applicability.

Curve Fitting via the Criterion of Least Squares. Applications of Algebra and Elementary Calculus to Curve Fitting. [and] Linear Programming in Two Dimensions: I. Applications of High School Algebra to Operations Research. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Units 321, 453.

ERIC Educational Resources Information Center

Alexander, John W., Jr.; Rosenberg, Nancy S.

This document consists of two modules. The first of these views applications of algebra and elementary calculus to curve fitting. The user is provided with information on how to: 1) construct scatter diagrams; 2) choose an appropriate function to fit specific data; 3) understand the underlying theory of least squares; 4) use a computer program to…

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

PubMed

Dovlo, Edem; Baddour, Natalie

2015-01-01

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

AN EFFICIENT HIGHER-ORDER FAST MULTIPOLE BOUNDARY ELEMENT SOLUTION FOR POISSON-BOLTZMANN BASED MOLECULAR ELECTROSTATICS

PubMed Central

Bajaj, Chandrajit; Chen, Shun-Chuan; Rand, Alexander

2011-01-01

In order to compute polarization energy of biomolecules, we describe a boundary element approach to solving the linearized Poisson-Boltzmann equation. Our approach combines several important features including the derivative boundary formulation of the problem and a smooth approximation of the molecular surface based on the algebraic spline molecular surface. State of the art software for numerical linear algebra and the kernel independent fast multipole method is used for both simplicity and efficiency of our implementation. We perform a variety of computational experiments, testing our method on a number of actual proteins involved in molecular docking and demonstrating the effectiveness of our solver for computing molecular polarization energy. PMID:21660123

A braided monoidal category for free super-bosons

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

Runkel, Ingo, E-mail: ingo.runkel@uni-hamburg.de

The chiral conformal field theory of free super-bosons is generated by weight one currents whose mode algebra is the affinisation of an abelian Lie super-algebra h with non-degenerate super-symmetric pairing. The mode algebras of a single free boson and of a single pair of symplectic fermions arise for even|odd dimension 1|0 and 0|2 of h, respectively. In this paper, the representations of the untwisted mode algebra of free super-bosons are equipped with a tensor product, a braiding, and an associator. In the symplectic fermion case, i.e., if h is purely odd, the braided monoidal structure is extended to representations ofmore » the Z/2Z-twisted mode algebra. The tensor product is obtained by computing spaces of vertex operators. The braiding and associator are determined by explicit calculations from three- and four-point conformal blocks.« less

Classical affine W-algebras associated to Lie superalgebras

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

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

2016-02-15

In this paper, we prove classical affine W-algebras associated to Lie superalgebras (W-superalgebras), which can be constructed in two different ways: via affine classical Hamiltonian reductions and via taking quasi-classical limits of quantum affine W-superalgebras. Also, we show that a classical finite W-superalgebra can be obtained by a Zhu algebra of a classical affine W-superalgebra. Using the definition by Hamiltonian reductions, we find free generators of a classical W-superalgebra associated to a minimal nilpotent. Moreover, we compute generators of the classical W-algebra associated to spo(2|3) and its principal nilpotent. In the last part of this paper, we introduce a generalizationmore » of classical affine W-superalgebras called classical affine fractional W-superalgebras. We show these have Poisson vertex algebra structures and find generators of a fractional W-superalgebra associated to a minimal nilpotent.« less

Unique Factorization in Cyclotomic Integers of Degree Seven

ERIC Educational Resources Information Center

Duckworth, W. Ethan

2008-01-01

This article provides a survey of some basic results in algebraic number theory and applies this material to prove that the cyclotomic integers generated by a seventh root of unity are a unique factorization domain. Part of the proof uses the computer algebra system Maple to find and verify factorizations. The proofs use a combination of historic…

Temporal mapping and analysis

NASA Technical Reports Server (NTRS)

O'Hara, Charles G. (Inventor); Shrestha, Bijay (Inventor); Vijayaraj, Veeraraghavan (Inventor); Mali, Preeti (Inventor)

2011-01-01

A compositing process for selecting spatial data collected over a period of time, creating temporal data cubes from the spatial data, and processing and/or analyzing the data using temporal mapping algebra functions. In some embodiments, the temporal data cube is creating a masked cube using the data cubes, and computing a composite from the masked cube by using temporal mapping algebra.

Teaching Mathematics in the PC Lab--The Students' Viewpoints

ERIC Educational Resources Information Center

Schmidt, Karsten; Kohler, Anke

2013-01-01

The Matrix Algebra portion of the intermediate mathematics course at the Schmalkalden University Faculty of Business and Economics has been moved from a traditional classroom setting to a technology-based setting in the PC lab. A Computer Algebra System license was acquired that also allows its use on the students' own PCs. A survey was carried…

Semiclassical spectrum for BMN string in Sch 5 × S 5

NASA Astrophysics Data System (ADS)

Ouyang, Hao

2017-12-01

We investigate the algebraic curve for string in Sch 5 × S 5. We compute the semiclassical spectrum for BMN string in Sch 5 × S 5 from the algebraic curve. We compare our results with the anomalous dimensions in sl(2) sector of the null dipole deformation of N=4 superYang-Millstheory.

Redesigning College Algebra: Combining Educational Theory and Web-Based Learning to Improve Student Attitudes and Performance

ERIC Educational Resources Information Center

Hagerty, Gary; Smith, Stanley; Goodwin, Danielle

2010-01-01

In 2001, Black Hills State University (BHSU) redesigned college algebra to use the computer-based mastery learning program, Assessment and Learning in Knowledge Spaces [1], historical development of concepts modules, whole class discussions, cooperative activities, relevant applications problems, and many fewer lectures. This resulted in a 21%…

Algebraic Reasoning: Professor Arbegla Introduces Variables and Functions. GEMS Teacher's Guide for Grades 3-5.

ERIC Educational Resources Information Center

Kopp, Jaine; Bergman, Lincoln

This teacher guide helps build a solid foundation in algebra for students in grades 3-5 in which students gain essential understanding of properties of numbers, variables, functions, equations, and formulas. Throughout the problem solving activities, students use computational skills and gain a deeper understanding of the number system. Students…

Diagonalization and Jordan Normal Form--Motivation through "Maple"[R

ERIC Educational Resources Information Center

Glaister, P.

2009-01-01

Following an introduction to the diagonalization of matrices, one of the more difficult topics for students to grasp in linear algebra is the concept of Jordan normal form. In this note, we show how the important notions of diagonalization and Jordan normal form can be introduced and developed through the use of the computer algebra package…

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

ERIC Educational Resources Information Center

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

2010-01-01

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

Intelligent Machines in the 21st Century: Automating the Processes of Inference and Inquiry

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2003-01-01

The last century saw the application of Boolean algebra toward the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines. in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. However, modern intelligent machines work by inferring knowledge using only their pre-programmed prior knowledge and the data provided. They lack the ability to ask questions, or request data that would aid their inferences. Recent advances in understanding the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we identified the algebra of questions as the free distributive algebra, which now allows us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper we describe this logic of inference and inquiry using the mathematics of partially ordered sets and the scaffolding of lattice theory, discuss the far-reaching implications of the methodology, and demonstrate its application with current examples in machine learning. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them to not only make inferences from data, but also decide which question to ask, experiment to perform, or measurement to take given what they have learned and what they are designed to understand.

Volume-preserving normal forms of Hopf-zero singularity

NASA Astrophysics Data System (ADS)

Gazor, Majid; Mokhtari, Fahimeh

2013-10-01

A practical method is described for computing the unique generator of the algebra of first integrals associated with a large class of Hopf-zero singularity. The set of all volume-preserving classical normal forms of this singularity is introduced via a Lie algebra description. This is a maximal vector space of classical normal forms with first integral; this is whence our approach works. Systems with a nonzero condition on their quadratic parts are considered. The algebra of all first integrals for any such system has a unique (modulo scalar multiplication) generator. The infinite level volume-preserving parametric normal forms of any nondegenerate perturbation within the Lie algebra of any such system is computed, where it can have rich dynamics. The associated unique generator of the algebra of first integrals are derived. The symmetry group of the infinite level normal forms are also discussed. Some necessary formulas are derived and applied to appropriately modified Rössler and generalized Kuramoto-Sivashinsky equations to demonstrate the applicability of our theoretical results. An approach (introduced by Iooss and Lombardi) is applied to find an optimal truncation for the first level normal forms of these examples with exponentially small remainders. The numerically suggested radius of convergence (for the first integral) associated with a hypernormalization step is discussed for the truncated first level normal forms of the examples. This is achieved by an efficient implementation of the results using Maple.

Explicating mathematical thinking in differential equations using a computer algebra system

NASA Astrophysics Data System (ADS)

Zeynivandnezhad, Fereshteh; Bates, Rachel

2018-07-01

The importance of developing students' mathematical thinking is frequently highlighted in literature regarding the teaching and learning of mathematics. Despite this importance, most curricula and instructional activities for undergraduate mathematics fail to bring the learner beyond the mathematics. The purpose of this study was to enhance students' mathematical thinking by implementing a computer algebra system and active learning pedagogical approaches. students' mathematical thinking processes were analyzed while completing specific differential equations tasks based on posed prompts and questions and Instrumental Genesis. Data were collected from 37 engineering students in a public Malaysian university. This study used the descriptive and interpretive qualitative research design to investigate the students' perspectives of emerging mathematical understanding and approaches to learning mathematics in an undergraduate differential equations course. Results of this study concluded that students used a variety of mathematical thinking processes in a non-sequential manner. Additionally, the outcomes provide justification for continued use of technologies such as computer algebra systems in undergraduate mathematics courses and the need for further studies to uncover the various processes students utilize to complete specific mathematical tasks.

Development and Initial Evaluation of the ClearSpeak Style for Automated Speaking of Algebra. Research Report No. RR-16-23

ERIC Educational Resources Information Center

Frankel, Lois; Brownstein, Beth; Soiffer, Neil; Hansen, Eric

2016-01-01

The work described in this report is the first phase of a project to provide easy-to-use tools for authoring and rendering secondary-school algebra-level math expressions in synthesized speech that is useful for students with blindness or low vision. This report describes the initial development, software implementation, and evaluation of the…

Development and Initial Evaluation of the ClearSpeak Style for Automated Speaking of Algebra. Research Report. ETS RR-16-23

ERIC Educational Resources Information Center

Frankel, Lois; Brownstein, Beth; Soiffer, Neil; Hansen, Eric

2016-01-01

The work described in this report is the first phase of a project to provide easy-to-use tools for authoring and rendering secondary-school algebra-level math expressions in synthesized speech that is useful for students with blindness or low vision. This report describes the initial development, software implementation, and evaluation of the…

Some Issues about the Introduction of First Concepts in Linear Algebra during Tutorial Sessions at the Beginning of University

ERIC Educational Resources Information Center

Grenier-Boley, Nicolas

2014-01-01

Certain mathematical concepts were not introduced to solve a specific open problem but rather to solve different problems with the same tools in an economic formal way or to unify several approaches: such concepts, as some of those of linear algebra, are presumably difficult to introduce to students as they are potentially interwoven with many…

A quantum approach to homomorphic encryption

PubMed Central

Tan, Si-Hui; Kettlewell, Joshua A.; Ouyang, Yingkai; Chen, Lin; Fitzsimons, Joseph F.

2016-01-01

Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data. The quantum data is encoded on bosons of distinct species in distinct spatial modes, and the quantum computations are manipulations of these bosons in a manner independent of their species. A particular instance of our encoding hides up to a constant fraction of the information encrypted. This fraction can be made arbitrarily close to unity with overhead scaling only polynomially in the message length. This highlights the potential of our protocol to hide a non-trivial amount of information, and is suggestive of a large class of encodings that might yield better security. PMID:27658349

Efficient computation paths for the systematic analysis of sensitivities

NASA Astrophysics Data System (ADS)

Greppi, Paolo; Arato, Elisabetta

2013-01-01

A systematic sensitivity analysis requires computing the model on all points of a multi-dimensional grid covering the domain of interest, defined by the ranges of variability of the inputs. The issues to efficiently perform such analyses on algebraic models are handling solution failures within and close to the feasible region and minimizing the total iteration count. Scanning the domain in the obvious order is sub-optimal in terms of total iterations and is likely to cause many solution failures. The problem of choosing a better order can be translated geometrically into finding Hamiltonian paths on certain grid graphs. This work proposes two paths, one based on a mixed-radix Gray code and the other, a quasi-spiral path, produced by a novel heuristic algorithm. Some simple, easy-to-visualize examples are presented, followed by performance results for the quasi-spiral algorithm and the practical application of the different paths in a process simulation tool.

The Overgrid Interface for Computational Simulations on Overset Grids

NASA Technical Reports Server (NTRS)

Chan, William M.; Kwak, Dochan (Technical Monitor)

2002-01-01

Computational simulations using overset grids typically involve multiple steps and a variety of software modules. A graphical interface called OVERGRID has been specially designed for such purposes. Data required and created by the different steps include geometry, grids, domain connectivity information and flow solver input parameters. The interface provides a unified environment for the visualization, processing, generation and diagnosis of such data. General modules are available for the manipulation of structured grids and unstructured surface triangulations. Modules more specific for the overset approach include surface curve generators, hyperbolic and algebraic surface grid generators, a hyperbolic volume grid generator, Cartesian box grid generators, and domain connectivity: pre-processing tools. An interface provides automatic selection and viewing of flow solver boundary conditions, and various other flow solver inputs. For problems involving multiple components in relative motion, a module is available to build the component/grid relationships and to prescribe and animate the dynamics of the different components.

A simple method for processing data with least square method

NASA Astrophysics Data System (ADS)

Wang, Chunyan; Qi, Liqun; Chen, Yongxiang; Pang, Guangning

2017-08-01

The least square method is widely used in data processing and error estimation. The mathematical method has become an essential technique for parameter estimation, data processing, regression analysis and experimental data fitting, and has become a criterion tool for statistical inference. In measurement data analysis, the distribution of complex rules is usually based on the least square principle, i.e., the use of matrix to solve the final estimate and to improve its accuracy. In this paper, a new method is presented for the solution of the method which is based on algebraic computation and is relatively straightforward and easy to understand. The practicability of this method is described by a concrete example.

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

PubMed Central

Dovlo, Edem; Baddour, Natalie

2015-01-01

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

Perturbative computation in a generalized quantum field theory

NASA Astrophysics Data System (ADS)

Bezerra, V. B.; Curado, E. M.; Rego-Monteiro, M. A.

2002-10-01

We consider a quantum field theory that creates at any point of the space-time particles described by a q-deformed Heisenberg algebra which is interpreted as a phenomenological quantum theory describing the scattering of spin-0 composed particles. We discuss the generalization of Wick's expansion for this case and we compute perturbatively the scattering 1+2-->1'+2' to second order in the coupling constant. The result we find shows that the structure of a composed particle, described here phenomenologically by the deformed algebraic structure, can modify in a simple but nontrivial way the perturbation expansion for the process under consideration.

On ``Overestimation-free Computational Version of Interval Analysis''

NASA Astrophysics Data System (ADS)

Popova, Evgenija D.

2013-10-01

The transformation of interval parameters into trigonometric functions, proposed in Int. J. Comput. Meth. Eng. Sci. Mech., vol. 13, pp. 319-328 (2012), is not motivated in comparison to the infinitely many equivalent algebraic transformations. The conclusions about the efficacy of the methodology used are based on incorrect comparisons between solutions of different problems. We show theoretically, and in the examples considered in the commented article, that changing the number of the parameters in a system of linear algebraic equations may change the initial problem, respectively, its solution set. We also correct various misunderstandings and bugs that appear in the article noted above.

An analysis of thermal response factors and how to reduce their computational time requirement

NASA Technical Reports Server (NTRS)

Wiese, M. R.

1982-01-01

Te RESFAC2 version of the Thermal Response Factor Program (RESFAC) is the result of numerous modifications and additions to the original RESFAC. These modifications and additions have significantly reduced the program's computational time requirement. As a result of this work, the program is more efficient and its code is both readable and understandable. This report describes what a thermal response factor is; analyzes the original matrix algebra calculations and root finding techniques; presents a new root finding technique and streamlined matrix algebra; supplies ten validation cases and their results.

Surface defects and chiral algebras

NASA Astrophysics Data System (ADS)

Córdova, Clay; Gaiotto, Davide; Shao, Shu-Heng

2017-05-01

We investigate superconformal surface defects in four-dimensional N=2 superconformal theories. Each such defect gives rise to a module of the associated chiral algebra and the surface defect Schur index is the character of this module. Various natural chiral algebra operations such as Drinfeld-Sokolov reduction and spectral flow can be interpreted as constructions involving four-dimensional surface defects. We compute the index of these defects in the free hypermultiplet theory and Argyres-Douglas theories, using both infrared techniques involving BPS states, as well as renormalization group flows onto Higgs branches. In each case we find perfect agreement with the predicted characters.

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.

Relations between elliptic multiple zeta values and a special derivation algebra

NASA Astrophysics Data System (ADS)

Broedel, Johannes; Matthes, Nils; Schlotterer, Oliver

2016-04-01

We investigate relations between elliptic multiple zeta values (eMZVs) and describe a method to derive the number of indecomposable elements of given weight and length. Our method is based on representing eMZVs as iterated integrals over Eisenstein series and exploiting the connection with a special derivation algebra. Its commutator relations give rise to constraints on the iterated integrals over Eisenstein series relevant for eMZVs and thereby allow to count the indecomposable representatives. Conversely, the above connection suggests apparently new relations in the derivation algebra. Under https://tools.aei.mpg.de/emzv we provide relations for eMZVs over a wide range of weights and lengths.

Computer Classification of Triangles and Quadrilaterals--A Challenging Application

ERIC Educational Resources Information Center

Dennis, J. Richard

1978-01-01

Two computer exercises involving the classification of geometric figures are given. The mathematics required is relatively simple but comes from several areas--synthetic geometry, analytic geometry, and linear algebra. (MN)

Evaluation of Madison Park PLATO Training on August 2000 BPS City Algebra Test Achievement.

ERIC Educational Resources Information Center

Baum, Christopher F.

This report presents empirical findings from the analysis of the performance of 85 students from Madison Park High School, Boston, Massachusetts, on the Boston Public Schools City Algebra Test (BPSCAT) in June and August 2000, and how their participation in Jobs for Youths Boston PLATO computer-based instruction in the intervening months may have…

Are Patterns Important? An Investigation of the Relationships between Proficiencies in Patterns, Computation, Executive Functioning, and Algebraic Word Problems

ERIC Educational Resources Information Center

Lee, Kerry; Ng, Swee Fong; Bull, Rebecca; Pe, Madeline Lee; Ho, Ringo Ho Moon

2011-01-01

Although mathematical pattern tasks are often found in elementary school curricula and are deemed a building block for algebra, a recent report (National Mathematics Advisory Panel, 2008) suggests the resources devoted to its teaching and assessment need to be rebalanced. We examined whether children's developing proficiency in solving algebraic…

Using Technology to Optimize and Generalize: The Least-Squares Line

ERIC Educational Resources Information Center

Burke, Maurice J.; Hodgson, Ted R.

2007-01-01

With the help of technology and a basic high school algebra method for finding the vertex of a quadratic polynomial, students can develop and prove the formula for least-squares lines. Students are exposed to the power of a computer algebra system to generalize processes they understand and to see deeper patterns in those processes. (Contains 4…

Method of generating features optimal to a dataset and classifier

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

Bruillard, Paul J.; Gosink, Luke J.; Jarman, Kenneth D.

A method of generating features optimal to a particular dataset and classifier is disclosed. A dataset of messages is inputted and a classifier is selected. An algebra of features is encoded. Computable features that are capable of describing the dataset from the algebra of features are selected. Irredundant features that are optimal for the classifier and the dataset are selected.

Real-Time Algebraic Derivative Estimations Using a Novel Low-Cost Architecture Based on Reconfigurable Logic

PubMed Central

Morales, Rafael; Rincón, Fernando; Gazzano, Julio Dondo; López, Juan Carlos

2014-01-01

Time derivative estimation of signals plays a very important role in several fields, such as signal processing and control engineering, just to name a few of them. For that purpose, a non-asymptotic algebraic procedure for the approximate estimation of the system states is used in this work. The method is based on results from differential algebra and furnishes some general formulae for the time derivatives of a measurable signal in which two algebraic derivative estimators run simultaneously, but in an overlapping fashion. The algebraic derivative algorithm presented in this paper is computed online and in real-time, offering high robustness properties with regard to corrupting noises, versatility and ease of implementation. Besides, in this work, we introduce a novel architecture to accelerate this algebraic derivative estimator using reconfigurable logic. The core of the algorithm is implemented in an FPGA, improving the speed of the system and achieving real-time performance. Finally, this work proposes a low-cost platform for the integration of hardware in the loop in MATLAB. PMID:24859033

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.

A short note on calculating the adjusted SAR index

USDA-ARS?s Scientific Manuscript database

A simple algebraic technique is presented for computing the adjusted SAR Index proposed by Suarez (1981). The statistical formula presented in this note facilitates the computation of the adjusted SAR without the use of either a look-up table, custom computer software or the need to compute exact a...

Mathematical modelling in engineering: an alternative way to teach Linear Algebra

NASA Astrophysics Data System (ADS)

Domínguez-García, S.; García-Planas, M. I.; Taberna, J.

2016-10-01

Technological advances require that basic science courses for engineering, including Linear Algebra, emphasize the development of mathematical strengths associated with modelling and interpretation of results, which are not limited only to calculus abilities. Based on this consideration, we have proposed a project-based learning, giving a dynamic classroom approach in which students modelled real-world problems and turn gain a deeper knowledge of the Linear Algebra subject. Considering that most students are digital natives, we use the e-portfolio as a tool of communication between students and teachers, besides being a good place making the work visible. In this article, we present an overview of the design and implementation of a project-based learning for a Linear Algebra course taught during the 2014-2015 at the 'ETSEIB'of Universitat Politècnica de Catalunya (UPC).

Symbolic-numeric interface: A review

NASA Technical Reports Server (NTRS)

Ng, E. W.

1980-01-01

A survey of the use of a combination of symbolic and numerical calculations is presented. Symbolic calculations primarily refer to the computer processing of procedures from classical algebra, analysis, and calculus. Numerical calculations refer to both numerical mathematics research and scientific computation. This survey is intended to point out a large number of problem areas where a cooperation of symbolic and numerical methods is likely to bear many fruits. These areas include such classical operations as differentiation and integration, such diverse activities as function approximations and qualitative analysis, and such contemporary topics as finite element calculations and computation complexity. It is contended that other less obvious topics such as the fast Fourier transform, linear algebra, nonlinear analysis and error analysis would also benefit from a synergistic approach.

Systems of nonlinear algebraic equations with positive solutions.

PubMed

Ciurte, Anca; Nedevschi, Sergiu; Rasa, Ioan

2017-01-01

We are concerned with the positive solutions of an algebraic system depending on a parameter [Formula: see text] and arising in economics. For [Formula: see text] we prove that the system has at least a solution. For [Formula: see text] we give three proofs of the existence and a proof of the uniqueness of the solution. Brouwer's theorem and inequalities involving convex functions are essential tools in our proofs.

Relational Algebra in Spatial Decision Support Systems Ontologies.

PubMed

Diomidous, Marianna; Chardalias, Kostis; Koutonias, Panagiotis; Magnita, Adrianna; Andrianopoulos, Charalampos; Zimeras, Stelios; Mechili, Enkeleint Aggelos

2017-01-01

Decision Support Systems (DSS) is a powerful tool, for facilitates researchers to choose the correct decision based on their final results. Especially in medical cases where doctors could use these systems, to overcome the problem with the clinical misunderstanding. Based on these systems, queries must be constructed based on the particular questions that doctors must answer. In this work, combination between questions and queries would be presented via relational algebra.

Engineering and Scientific Applications: Using MatLab(Registered Trademark) for Data Processing and Visualization

NASA Technical Reports Server (NTRS)

Sen, Syamal K.; Shaykhian, Gholam Ali

2011-01-01

MatLab(TradeMark)(MATrix LABoratory) is a numerical computation and simulation tool that is used by thousands Scientists and Engineers in many countries. MatLab does purely numerical calculations, which can be used as a glorified calculator or interpreter programming language; its real strength is in matrix manipulations. Computer algebra functionalities are achieved within the MatLab environment using "symbolic" toolbox. This feature is similar to computer algebra programs, provided by Maple or Mathematica to calculate with mathematical equations using symbolic operations. MatLab in its interpreter programming language form (command interface) is similar with well known programming languages such as C/C++, support data structures and cell arrays to define classes in object oriented programming. As such, MatLab is equipped with most of the essential constructs of a higher programming language. MatLab is packaged with an editor and debugging functionality useful to perform analysis of large MatLab programs and find errors. We believe there are many ways to approach real-world problems; prescribed methods to ensure foregoing solutions are incorporated in design and analysis of data processing and visualization can benefit engineers and scientist in gaining wider insight in actual implementation of their perspective experiments. This presentation will focus on data processing and visualizations aspects of engineering and scientific applications. Specifically, it will discuss methods and techniques to perform intermediate-level data processing covering engineering and scientific problems. MatLab programming techniques including reading various data files formats to produce customized publication-quality graphics, importing engineering and/or scientific data, organizing data in tabular format, exporting data to be used by other software programs such as Microsoft Excel, data presentation and visualization will be discussed.

Application of numerical grid generation for improved CFD analysis of multiphase screw machines

NASA Astrophysics Data System (ADS)

Rane, S.; Kovačević, A.

2017-08-01

Algebraic grid generation is widely used for discretization of the working domain of twin screw machines. Algebraic grid generation is fast and has good control over the placement of grid nodes. However, the desired qualities of grid which should be able to handle multiphase flows such as oil injection, may be difficult to achieve at times. In order to obtain fast solution of multiphase screw machines, it is important to further improve the quality and robustness of the computational grid. In this paper, a deforming grid of a twin screw machine is generated using algebraic transfinite interpolation to produce initial mesh upon which an elliptic partial differential equations (PDE) of the Poisson’s form is solved numerically to produce smooth final computational mesh. The quality of numerical cells and their distribution obtained by the differential method is greatly improved. In addition, a similar procedure was introduced to fully smoothen the transition of the partitioning rack curve between the rotors thus improving continuous movement of grid nodes and in turn improve robustness and speed of the Computational Fluid Dynamic (CFD) solver. Analysis of an oil injected twin screw compressor is presented to compare the improvements in grid quality factors in the regions of importance such as interlobe space, radial tip and the core of the rotor. The proposed method that combines algebraic and differential grid generation offer significant improvement in grid quality and robustness of numerical solution.

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.

Proceedings of the 1977 MACSYMA users' conference (NASA)

NASA Technical Reports Server (NTRS)

1977-01-01

The MACSYMA program for symbolic and algebraic manipulation enables exact, symbolic mathematical computations to be performed on a computer. This program is rather large, and various approaches to the hardware and software problems are examined.

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).

Space Mathematics: A Resource for Secondary School Teachers

NASA Technical Reports Server (NTRS)

Kastner, Bernice

1985-01-01

A collection of mathematical problems related to NASA space science projects is presented. In developing the examples and problems, attention was given to preserving the authenticity and significance of the original setting while keeping the level of mathematics within the secondary school curriculum. Computation and measurement, algebra, geometry, probability and statistics, exponential and logarithmic functions, trigonometry, matrix algebra, conic sections, and calculus are among the areas addressed.

Group analysis of dynamics equations of self-gravitating polytropic gas

NASA Astrophysics Data System (ADS)

Klebanov, I.; Panov, A.; Ivanov, S.; Maslova, O.

2018-06-01

The Lie algebras admitted by the dynamics equations of self-gravitating gas for an arbitrary equation of state and a polytropic gas are calculated. A spherically symmetric submodel is constructed for the case of a polytropic gas. The Lie algebras and the optimal system of subalgebras for a spherically symmetric submodel are computed. An invariant solution describing the steady motion is obtained.

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.

High-performance image processing architecture

NASA Astrophysics Data System (ADS)

Coffield, Patrick C.

1992-04-01

The proposed architecture is a logical design specifically for image processing and other related computations. The design is a hybrid electro-optical concept consisting of three tightly coupled components: a spatial configuration processor (the optical analog portion), a weighting processor (digital), and an accumulation processor (digital). The systolic flow of data and image processing operations are directed by a control buffer and pipelined to each of the three processing components. The image processing operations are defined by an image algebra developed by the University of Florida. The algebra is capable of describing all common image-to-image transformations. The merit of this architectural design is how elegantly it handles the natural decomposition of algebraic functions into spatially distributed, point-wise operations. The effect of this particular decomposition allows convolution type operations to be computed strictly as a function of the number of elements in the template (mask, filter, etc.) instead of the number of picture elements in the image. Thus, a substantial increase in throughput is realized. The logical architecture may take any number of physical forms. While a hybrid electro-optical implementation is of primary interest, the benefits and design issues of an all digital implementation are also discussed. The potential utility of this architectural design lies in its ability to control all the arithmetic and logic operations of the image algebra's generalized matrix product. This is the most powerful fundamental formulation in the algebra, thus allowing a wide range of applications.

A Computing Method for Sound Propagation Through a Nonuniform Jet Stream

NASA Technical Reports Server (NTRS)

Padula, S. L.; Liu, C. H.

1974-01-01

Understanding the principles of jet noise propagation is an essential ingredient of systematic noise reduction research. High speed computer methods offer a unique potential for dealing with complex real life physical systems whereas analytical solutions are restricted to sophisticated idealized models. The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions and a more suitable approach was needed. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

Deformation Theory and Physics Model Building

NASA Astrophysics Data System (ADS)

Sternheimer, Daniel

2006-08-01

The mathematical theory of deformations has proved to be a powerful tool in modeling physical reality. We start with a short historical and philosophical review of the context and concentrate this rapid presentation on a few interrelated directions where deformation theory is essential in bringing a new framework - which has then to be developed using adapted tools, some of which come from the deformation aspect. Minkowskian space-time can be deformed into Anti de Sitter, where massless particles become composite (also dynamically): this opens new perspectives in particle physics, at least at the electroweak level, including prediction of new mesons. Nonlinear group representations and covariant field equations, coming from interactions, can be viewed as some deformation of their linear (free) part: recognizing this fact can provide a good framework for treating problems in this area, in particular global solutions. Last but not least, (algebras associated with) classical mechanics (and field theory) on a Poisson phase space can be deformed to (algebras associated with) quantum mechanics (and quantum field theory). That is now a frontier domain in mathematics and theoretical physics called deformation quantization, with multiple ramifications, avatars and connections in both mathematics and physics. These include representation theory, quantum groups (when considering Hopf algebras instead of associative or Lie algebras), noncommutative geometry and manifolds, algebraic geometry, number theory, and of course what is regrouped under the name of M-theory. We shall here look at these from the unifying point of view of deformation theory and refer to a limited number of papers as a starting point for further study.

How the twain can meet: Prospect theory and models of heuristics in risky choice.

PubMed

Pachur, Thorsten; Suter, Renata S; Hertwig, Ralph

2017-03-01

Two influential approaches to modeling choice between risky options are algebraic models (which focus on predicting the overt decisions) and models of heuristics (which are also concerned with capturing the underlying cognitive process). Because they rest on fundamentally different assumptions and algorithms, the two approaches are usually treated as antithetical, or even incommensurable. Drawing on cumulative prospect theory (CPT; Tversky & Kahneman, 1992) as the currently most influential instance of a descriptive algebraic model, we demonstrate how the two modeling traditions can be linked. CPT's algebraic functions characterize choices in terms of psychophysical (diminishing sensitivity to probabilities and outcomes) as well as psychological (risk aversion and loss aversion) constructs. Models of heuristics characterize choices as rooted in simple information-processing principles such as lexicographic and limited search. In computer simulations, we estimated CPT's parameters for choices produced by various heuristics. The resulting CPT parameter profiles portray each of the choice-generating heuristics in psychologically meaningful ways-capturing, for instance, differences in how the heuristics process probability information. Furthermore, CPT parameters can reflect a key property of many heuristics, lexicographic search, and track the environment-dependent behavior of heuristics. Finally, we show, both in an empirical and a model recovery study, how CPT parameter profiles can be used to detect the operation of heuristics. We also address the limits of CPT's ability to capture choices produced by heuristics. Our results highlight an untapped potential of CPT as a measurement tool to characterize the information processing underlying risky choice. Copyright © 2017 Elsevier Inc. All rights reserved.

Affine Kac-Moody symmetric spaces related with A1^{(1)}, A2^{(1)},} A2^{(2)}

NASA Astrophysics Data System (ADS)

Nayak, Saudamini; Pati, K. C.

2014-08-01

Symmetric spaces associated with Lie algebras and Lie groups which are Riemannian manifolds have recently got a lot of attention in various branches of Physics for their role in classical/quantum integrable systems, transport phenomena, etc. Their infinite dimensional counter parts have recently been discovered which are affine Kac-Moody symmetric spaces. In this paper we have (algebraically) explicitly computed the affine Kac-Moody symmetric spaces associated with affine Kac-Moody algebras A1^{(1)}, A2^{(1)}, A2^{(2)}. We hope these types of spaces will play similar roles as that of symmetric spaces in many physical systems.

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.

Surface defects and chiral algebras

DOE PAGES

Córdova, Clay; Gaiotto, Davide; Shao, Shu-Heng

2017-05-26

Here, we investigate superconformal surface defects in four-dimensional N = 2 superconformal theories. Each such defect gives rise to a module of the associated chiral algebra and the surface defect Schur index is the character of this module. Various natural chiral algebra operations such as Drinfield-Sokolov reduction and spectral flow can be interpreted as constructions involving four-dimensional surface defects. We compute the index of these defects in the free hypermultiplet theory and Argyres-Douglas theories, using both infrared techniques involving BPS states, as well as renormalization group flows onto Higgs branches. We find perfect agreement with the predicted characters, in eachmore » case.« less

Surface defects and chiral algebras

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

Córdova, Clay; Gaiotto, Davide; Shao, Shu-Heng

Here, we investigate superconformal surface defects in four-dimensional N = 2 superconformal theories. Each such defect gives rise to a module of the associated chiral algebra and the surface defect Schur index is the character of this module. Various natural chiral algebra operations such as Drinfield-Sokolov reduction and spectral flow can be interpreted as constructions involving four-dimensional surface defects. We compute the index of these defects in the free hypermultiplet theory and Argyres-Douglas theories, using both infrared techniques involving BPS states, as well as renormalization group flows onto Higgs branches. We find perfect agreement with the predicted characters, in eachmore » case.« less

Recursive boson system in the Cuntz algebra O{sub {infinity}}

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

Kawamura, Katsunori

2007-09-15

Bosons and fermions are often written by elements of other algebras. Abe (private communication) gave a realization of bosons by formal infinite sums of the canonical generators of the Cuntz algebra O{sub {infinity}}. We show that such formal infinite sum always makes sense on a certain dense subspace of any permutative representation of O{sub {infinity}}. In this meaning, we can regard as if the algebra B of bosons was a unital *-subalgebra of O{sub {infinity}} on a given permutative representation. According to this relation, we compute branching laws arising from restrictions of representations of O{sub {infinity}} on B. For example,more » it is shown that the Fock representation of B is given as the restriction of the standard representation of O{sub {infinity}} on B.« less

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

NASA Technical Reports Server (NTRS)

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

2008-01-01

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

Implementation of control point form of algebraic grid-generation technique

NASA Technical Reports Server (NTRS)

Choo, Yung K.; Miller, David P.; Reno, Charles J.

1991-01-01

The control point form (CPF) provides explicit control of physical grid shape and grid spacing through the movement of the control points. The control point array, called a control net, is a space grid type arrangement of locations in physical space with an index for each direction. As an algebraic method CPF is efficient and works well with interactive computer graphics. A family of menu-driven, interactive grid-generation computer codes (TURBO) is being developed by using CPF. Key features of TurboI (a TURBO member) are discussed and typical results are presented. TurboI runs on any IRIS 4D series workstation.

Analysis and synthesis of distributed-lumped-active networks by digital computer

NASA Technical Reports Server (NTRS)

1973-01-01

The use of digital computational techniques in the analysis and synthesis of DLA (distributed lumped active) networks is considered. This class of networks consists of three distinct types of elements, namely, distributed elements (modeled by partial differential equations), lumped elements (modeled by algebraic relations and ordinary differential equations), and active elements (modeled by algebraic relations). Such a characterization is applicable to a broad class of circuits, especially including those usually referred to as linear integrated circuits, since the fabrication techniques for such circuits readily produce elements which may be modeled as distributed, as well as the more conventional lumped and active ones.

Nonunitary Lagrangians and Unitary Non-Lagrangian Conformal Field Theories.

PubMed

Buican, Matthew; Laczko, Zoltan

2018-02-23

In various dimensions, we can sometimes compute observables of interacting conformal field theories (CFTs) that are connected to free theories via the renormalization group (RG) flow by computing protected quantities in the free theories. On the other hand, in two dimensions, it is often possible to algebraically construct observables of interacting CFTs using free fields without the need to explicitly construct an underlying RG flow. In this Letter, we begin to extend this idea to higher dimensions by showing that one can compute certain observables of an infinite set of unitary strongly interacting four-dimensional N=2 superconformal field theories (SCFTs) by performing simple calculations involving sets of nonunitary free four-dimensional hypermultiplets. These free fields are distant cousins of the Majorana fermion underlying the two-dimensional Ising model and are not obviously connected to our interacting theories via an RG flow. Rather surprisingly, this construction gives us Lagrangians for particular observables in certain subsectors of many "non-Lagrangian" SCFTs by sacrificing unitarity while preserving the full N=2 superconformal algebra. As a by-product, we find relations between characters in unitary and nonunitary affine Kac-Moody algebras. We conclude by commenting on possible generalizations of our construction.

Mathematical model for Dengue with three states of infection

NASA Astrophysics Data System (ADS)

Hincapie, Doracelly; Ospina, Juan

2012-06-01

A mathematical model for dengue with three states of infection is proposed and analyzed. The model consists in a system of differential equations. The three states of infection are respectively asymptomatic, partially asymptomatic and fully asymptomatic. The model is analyzed using computer algebra software, specifically Maple, and the corresponding basic reproductive number and the epidemic threshold are computed. The resulting basic reproductive number is an algebraic synthesis of all epidemic parameters and it makes clear the possible control measures. The microscopic structure of the epidemic parameters is established using the quantum theory of the interactions between the atoms and radiation. In such approximation, the human individual is represented by an atom and the mosquitoes are represented by radiation. The force of infection from the mosquitoes to the humans is considered as the transition probability from the fundamental state of atom to excited states. The combination of computer algebra software and quantum theory provides a very complete formula for the basic reproductive number and the possible control measures tending to stop the propagation of the disease. It is claimed that such result may be important in military medicine and the proposed method can be applied to other vector-borne diseases.

A multiple-time-scale turbulence model based on variable partitioning of turbulent kinetic energy spectrum

NASA Technical Reports Server (NTRS)

Kim, S.-W.; Chen, C.-P.

1987-01-01

A multiple-time-scale turbulence model of a single point closure and a simplified split-spectrum method is presented. In the model, the effect of the ratio of the production rate to the dissipation rate on eddy viscosity is modeled by use of the multiple-time-scales and a variable partitioning of the turbulent kinetic energy spectrum. The concept of a variable partitioning of the turbulent kinetic energy spectrum and the rest of the model details are based on the previously reported algebraic stress turbulence model. Example problems considered include: a fully developed channel flow, a plane jet exhausting into a moving stream, a wall jet flow, and a weakly coupled wake-boundary layer interaction flow. The computational results compared favorably with those obtained by using the algebraic stress turbulence model as well as experimental data. The present turbulence model, as well as the algebraic stress turbulence model, yielded significantly improved computational results for the complex turbulent boundary layer flows, such as the wall jet flow and the wake boundary layer interaction flow, compared with available computational results obtained by using the standard kappa-epsilon turbulence model.

A multiple-time-scale turbulence model based on variable partitioning of the turbulent kinetic energy spectrum

NASA Technical Reports Server (NTRS)

Kim, S.-W.; Chen, C.-P.

1989-01-01

A multiple-time-scale turbulence model of a single point closure and a simplified split-spectrum method is presented. In the model, the effect of the ratio of the production rate to the dissipation rate on eddy viscosity is modeled by use of the multiple-time-scales and a variable partitioning of the turbulent kinetic energy spectrum. The concept of a variable partitioning of the turbulent kinetic energy spectrum and the rest of the model details are based on the previously reported algebraic stress turbulence model. Example problems considered include: a fully developed channel flow, a plane jet exhausting into a moving stream, a wall jet flow, and a weakly coupled wake-boundary layer interaction flow. The computational results compared favorably with those obtained by using the algebraic stress turbulence model as well as experimental data. The present turbulence model, as well as the algebraic stress turbulence model, yielded significantly improved computational results for the complex turbulent boundary layer flows, such as the wall jet flow and the wake boundary layer interaction flow, compared with available computational results obtained by using the standard kappa-epsilon turbulence model.

Nonunitary Lagrangians and Unitary Non-Lagrangian Conformal Field Theories

NASA Astrophysics Data System (ADS)

Buican, Matthew; Laczko, Zoltan

2018-02-01

In various dimensions, we can sometimes compute observables of interacting conformal field theories (CFTs) that are connected to free theories via the renormalization group (RG) flow by computing protected quantities in the free theories. On the other hand, in two dimensions, it is often possible to algebraically construct observables of interacting CFTs using free fields without the need to explicitly construct an underlying RG flow. In this Letter, we begin to extend this idea to higher dimensions by showing that one can compute certain observables of an infinite set of unitary strongly interacting four-dimensional N =2 superconformal field theories (SCFTs) by performing simple calculations involving sets of nonunitary free four-dimensional hypermultiplets. These free fields are distant cousins of the Majorana fermion underlying the two-dimensional Ising model and are not obviously connected to our interacting theories via an RG flow. Rather surprisingly, this construction gives us Lagrangians for particular observables in certain subsectors of many "non-Lagrangian" SCFTs by sacrificing unitarity while preserving the full N =2 superconformal algebra. As a by-product, we find relations between characters in unitary and nonunitary affine Kac-Moody algebras. We conclude by commenting on possible generalizations of our construction.

Matthew Reynolds | NREL

Science.gov Websites

food science. Matthew's research at NREL is focused on applying uncertainty quantification techniques . Research Interests Uncertainty quantification Computational multilinear algebra Approximation theory of and the Canonical Tensor Decomposition, Journal of Computational Physics (2017) Randomized Alternating

Prediction of High-Lift Flows using Turbulent Closure Models

NASA Technical Reports Server (NTRS)

Rumsey, Christopher L.; Gatski, Thomas B.; Ying, Susan X.; Bertelrud, Arild

1997-01-01

The flow over two different multi-element airfoil configurations is computed using linear eddy viscosity turbulence models and a nonlinear explicit algebraic stress model. A subset of recently-measured transition locations using hot film on a McDonnell Douglas configuration is presented, and the effect of transition location on the computed solutions is explored. Deficiencies in wake profile computations are found to be attributable in large part to poor boundary layer prediction on the generating element, and not necessarily inadequate turbulence modeling in the wake. Using measured transition locations for the main element improves the prediction of its boundary layer thickness, skin friction, and wake profile shape. However, using measured transition locations on the slat still yields poor slat wake predictions. The computation of the slat flow field represents a key roadblock to successful predictions of multi-element flows. In general, the nonlinear explicit algebraic stress turbulence model gives very similar results to the linear eddy viscosity models.

The preconditioned Gauss-Seidel method faster than the SOR method

NASA Astrophysics Data System (ADS)

Niki, Hiroshi; Kohno, Toshiyuki; Morimoto, Munenori

2008-09-01

In recent years, a number of preconditioners have been applied to linear systems [A.D. Gunawardena, S.K. Jain, L. Snyder, Modified iterative methods for consistent linear systems, Linear Algebra Appl. 154-156 (1991) 123-143; T. Kohno, H. Kotakemori, H. Niki, M. Usui, Improving modified Gauss-Seidel method for Z-matrices, Linear Algebra Appl. 267 (1997) 113-123; H. Kotakemori, K. Harada, M. Morimoto, H. Niki, A comparison theorem for the iterative method with the preconditioner (I+Smax), J. Comput. Appl. Math. 145 (2002) 373-378; H. Kotakemori, H. Niki, N. Okamoto, Accelerated iteration method for Z-matrices, J. Comput. Appl. Math. 75 (1996) 87-97; M. Usui, H. Niki, T.Kohno, Adaptive Gauss-Seidel method for linear systems, Internat. J. Comput. Math. 51(1994)119-125 [10

On squares of representations of compact Lie algebras

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

Zeier, Robert, E-mail: robert.zeier@ch.tum.de; Zimborás, Zoltán, E-mail: zimboras@gmail.com

We study how tensor products of representations decompose when restricted from a compact Lie algebra to one of its subalgebras. In particular, we are interested in tensor squares which are tensor products of a representation with itself. We show in a classification-free manner that the sum of multiplicities and the sum of squares of multiplicities in the corresponding decomposition of a tensor square into irreducible representations has to strictly grow when restricted from a compact semisimple Lie algebra to a proper subalgebra. For this purpose, relevant details on tensor products of representations are compiled from the literature. Since the summore » of squares of multiplicities is equal to the dimension of the commutant of the tensor-square representation, it can be determined by linear-algebra computations in a scenario where an a priori unknown Lie algebra is given by a set of generators which might not be a linear basis. Hence, our results offer a test to decide if a subalgebra of a compact semisimple Lie algebra is a proper one without calculating the relevant Lie closures, which can be naturally applied in the field of controlled quantum systems.« less

Using Information Technology in Mathematics Education.

ERIC Educational Resources Information Center

Tooke, D. James, Ed.; Henderson, Norma, Ed.

This collection of essays examines the history and impact of computers in mathematics and mathematics education from the early, computer-assisted instruction efforts through LOGO, the constructivist educational software for K-9 schools developed in the 1980s, to MAPLE, the computer algebra system for mathematical problem solving developed in the…

Student Performance in Computer-Assisted Instruction in Programming.

ERIC Educational Resources Information Center

Friend, Jamesine E.; And Others

A computer-assisted instructional system to teach college students the computer language, AID (Algebraic Interpretive Dialogue), two control programs, and data collected by the two control programs are described. It was found that although first response errors were often those of AID syntax, such errors were easily corrected. Secondly, while…

Teaching mathematics in the PC lab - the students' viewpoints

NASA Astrophysics Data System (ADS)

Schmidt, Karsten; Köhler, Anke

2013-04-01

The Matrix Algebra portion of the intermediate mathematics course at the Schmalkalden University Faculty of Business and Economics has been moved from a traditional classroom setting to a technology-based setting in the PC lab. A Computer Algebra System license was acquired that also allows its use on the students' own PCs. A survey was carried out to analyse the students' attitudes towards the use of technology in mathematics teaching.

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

Intelligent machines in the twenty-first century: foundations of inference and inquiry.

PubMed

Knuth, Kevin H

2003-12-15

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Intelligent machines in the twenty-first century: foundations of inference and inquiry

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2003-01-01

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Quantum privacy and Schur product channels

NASA Astrophysics Data System (ADS)

Levick, Jeremy; Kribs, David W.; Pereira, Rajesh

2017-12-01

We investigate the quantum privacy properties of an important class of quantum channels, by making use of a connection with Schur product matrix operations and associated correlation matrix structures. For channels implemented by mutually commuting unitaries, which cannot privatise qubits encoded directly into subspaces, we nevertheless identify private algebras and subsystems that can be privatised by the channels. We also obtain further results by combining our analysis with tools from the theory of quasi-orthogonal operator algebras and graph theory.

Spacetime algebra as a powerful tool for electromagnetism

NASA Astrophysics Data System (ADS)

Dressel, Justin; Bliokh, Konstantin Y.; Nori, Franco

2015-08-01

We present a comprehensive introduction to spacetime algebra that emphasizes its practicality and power as a tool for the study of electromagnetism. We carefully develop this natural (Clifford) algebra of the Minkowski spacetime geometry, with a particular focus on its intrinsic (and often overlooked) complex structure. Notably, the scalar imaginary that appears throughout the electromagnetic theory properly corresponds to the unit 4-volume of spacetime itself, and thus has physical meaning. The electric and magnetic fields are combined into a single complex and frame-independent bivector field, which generalizes the Riemann-Silberstein complex vector that has recently resurfaced in studies of the single photon wavefunction. The complex structure of spacetime also underpins the emergence of electromagnetic waves, circular polarizations, the normal variables for canonical quantization, the distinction between electric and magnetic charge, complex spinor representations of Lorentz transformations, and the dual (electric-magnetic field exchange) symmetry that produces helicity conservation in vacuum fields. This latter symmetry manifests as an arbitrary global phase of the complex field, motivating the use of a complex vector potential, along with an associated transverse and gauge-invariant bivector potential, as well as complex (bivector and scalar) Hertz potentials. Our detailed treatment aims to encourage the use of spacetime algebra as a readily available and mature extension to existing vector calculus and tensor methods that can greatly simplify the analysis of fundamentally relativistic objects like the electromagnetic field.

Image-algebraic design of multispectral target recognition algorithms

NASA Astrophysics Data System (ADS)

Schmalz, Mark S.; Ritter, Gerhard X.

1994-06-01

In this paper, we discuss methods for multispectral ATR (Automated Target Recognition) of small targets that are sensed under suboptimal conditions, such as haze, smoke, and low light levels. In particular, we discuss our ongoing development of algorithms and software that effect intelligent object recognition by selecting ATR filter parameters according to ambient conditions. Our algorithms are expressed in terms of IA (image algebra), a concise, rigorous notation that unifies linear and nonlinear mathematics in the image processing domain. IA has been implemented on a variety of parallel computers, with preprocessors available for the Ada and FORTRAN languages. An image algebra C++ class library has recently been made available. Thus, our algorithms are both feasible implementationally and portable to numerous machines. Analyses emphasize the aspects of image algebra that aid the design of multispectral vision algorithms, such as parameterized templates that facilitate the flexible specification of ATR filters.

A rigorous approach to investigating common assumptions about disease transmission: Process algebra as an emerging modelling methodology for epidemiology.

PubMed

McCaig, Chris; Begon, Mike; Norman, Rachel; Shankland, Carron

2011-03-01

Changing scale, for example, the ability to move seamlessly from an individual-based model to a population-based model, is an important problem in many fields. In this paper, we introduce process algebra as a novel solution to this problem in the context of models of infectious disease spread. Process algebra allows us to describe a system in terms of the stochastic behaviour of individuals, and is a technique from computer science. We review the use of process algebra in biological systems, and the variety of quantitative and qualitative analysis techniques available. The analysis illustrated here solves the changing scale problem: from the individual behaviour we can rigorously derive equations to describe the mean behaviour of the system at the level of the population. The biological problem investigated is the transmission of infection, and how this relates to individual interactions.

Graphical tensor product reduction scheme for the Lie algebras so(5) = sp(2) , su(3) , and g(2)

NASA Astrophysics Data System (ADS)

Vlasii, N. D.; von Rütte, F.; Wiese, U.-J.

2016-08-01

We develop in detail a graphical tensor product reduction scheme, first described by Antoine and Speiser, for the simple rank 2 Lie algebras so(5) = sp(2) , su(3) , and g(2) . This leads to an efficient practical method to reduce tensor products of irreducible representations into sums of such representations. For this purpose, the 2-dimensional weight diagram of a given representation is placed in a ;landscape; of irreducible representations. We provide both the landscapes and the weight diagrams for a large number of representations for the three simple rank 2 Lie algebras. We also apply the algebraic ;girdle; method, which is much less efficient for calculations by hand for moderately large representations. Computer code for reducing tensor products, based on the graphical method, has been developed as well and is available from the authors upon request.

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

Analysis of the Harrier forebody/inlet design using computational techniques

NASA Technical Reports Server (NTRS)

Chow, Chuen-Yen

1993-01-01

Under the support of this Cooperative Agreement, computations of transonic flow past the complex forebody/inlet configuration of the AV-8B Harrier II have been performed. The actual aircraft configuration was measured and its surface and surrounding domain were defined using computational structured grids. The thin-layer Navier-Stokes equations were used to model the flow along with the Chimera embedded multi-grid technique. A fully conservative, alternating direction implicit (ADI), approximately-factored, partially flux-split algorithm was employed to perform the computation. An existing code was altered to conform with the needs of the study, and some special engine face boundary conditions were developed. The algorithm incorporated the Chimera technique and an algebraic turbulence model in order to deal with the embedded multi-grids and viscous governing equations. Comparison with experimental data has yielded good agreement for the simplifications incorporated into the analysis. The aim of the present research was to provide a methodology for the numerical solution of complex, combined external/internal flows. This is the first time-dependent Navier-Stokes solution for a geometry in which the fuselage and inlet share a wall. The results indicate the methodology used here is a viable tool for transonic aircraft modeling.

Computer program determines chemical equilibria in complex systems

NASA Technical Reports Server (NTRS)

Gordon, S.; Zeleznik, F. J.

1966-01-01

Computer program numerically solves nonlinear algebraic equations for chemical equilibrium based on iteration equations independent of choice of components. This program calculates theoretical performance for frozen and equilibrium composition during expansion and Chapman-Jouguet flame properties, studies combustion, and designs hardware.

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.

Reusable Software Component Retrieval via Normalized Algebraic Specifications

DTIC Science & Technology

1991-12-01

outputs. In fact, this method of query is simpler for matching since it relieves the system from the burden of generating a test set. Eichmann [Eich9l...September 1991. [Eich9l] Eichmann , David A., "Selecting Reusable Components Using Algebraic Specifications", Proceedings of the Second International...Technology Atlanta, Georgia 30332-0800 12. Dr. David Eichmann 1 Department of Statistics and Computer Science Knapp Hall West Virginia University Morgantown, West Virginia 26506 226

Turbulence Model Predictions of Strongly Curved Flow in a U-Duct

NASA Technical Reports Server (NTRS)

Rumsey, Christopher L.; Gatski, Thomas B.; Morrison, Joseph H.

2000-01-01

The ability of three types of turbulence models to accurately predict the effects of curvature on the flow in a U-duct is studied. An explicit algebraic stress model performs slightly better than one- or two-equation linear eddy viscosity models, although it is necessary to fully account for the variation of the production-to-dissipation-rate ratio in the algebraic stress model formulation. In their original formulations, none of these turbulence models fully captures the suppressed turbulence near the convex wall, whereas a full Reynolds stress model does. Some of the underlying assumptions used in the development of algebraic stress models are investigated and compared with the computed flowfield from the full Reynolds stress model. Through this analysis, the assumption of Reynolds stress anisotropy equilibrium used in the algebraic stress model formulation is found to be incorrect in regions of strong curvature. By the accounting for the local variation of the principal axes of the strain rate tensor, the explicit algebraic stress model correctly predicts the suppressed turbulence in the outer part of the boundary layer near the convex wall.

Eigenmode computation of cavities with perturbed geometry using matrix perturbation methods applied on generalized eigenvalue problems

NASA Astrophysics Data System (ADS)

Gorgizadeh, Shahnam; Flisgen, Thomas; van Rienen, Ursula

2018-07-01

Generalized eigenvalue problems are standard problems in computational sciences. They may arise in electromagnetic fields from the discretization of the Helmholtz equation by for example the finite element method (FEM). Geometrical perturbations of the structure under concern lead to a new generalized eigenvalue problems with different system matrices. Geometrical perturbations may arise by manufacturing tolerances, harsh operating conditions or during shape optimization. Directly solving the eigenvalue problem for each perturbation is computationally costly. The perturbed eigenpairs can be approximated using eigenpair derivatives. Two common approaches for the calculation of eigenpair derivatives, namely modal superposition method and direct algebraic methods, are discussed in this paper. Based on the direct algebraic methods an iterative algorithm is developed for efficiently calculating the eigenvalues and eigenvectors of the perturbed geometry from the eigenvalues and eigenvectors of the unperturbed geometry.

HEP - A semaphore-synchronized multiprocessor with central control. [Heterogeneous Element Processor

NASA Technical Reports Server (NTRS)

Gilliland, M. C.; Smith, B. J.; Calvert, W.

1976-01-01

The paper describes the design concept of the Heterogeneous Element Processor (HEP), a system tailored to the special needs of scientific simulation. In order to achieve high-speed computation required by simulation, HEP features a hierarchy of processes executing in parallel on a number of processors, with synchronization being largely accomplished by hardware. A full-empty-reserve scheme of synchronization is realized by zero-one-valued hardware semaphores. A typical system has, besides the control computer and the scheduler, an algebraic module, a memory module, a first-in first-out (FIFO) module, an integrator module, and an I/O module. The architecture of the scheduler and the algebraic module is examined in detail.

Accuracy requirements of optical linear algebra processors in adaptive optics imaging systems

NASA Technical Reports Server (NTRS)

Downie, John D.; Goodman, Joseph W.

1989-01-01

The accuracy requirements of optical processors in adaptive optics systems are determined by estimating the required accuracy in a general optical linear algebra processor (OLAP) that results in a smaller average residual aberration than that achieved with a conventional electronic digital processor with some specific computation speed. Special attention is given to an error analysis of a general OLAP with regard to the residual aberration that is created in an adaptive mirror system by the inaccuracies of the processor, and to the effect of computational speed of an electronic processor on the correction. Results are presented on the ability of an OLAP to compete with a digital processor in various situations.

Radical Computing II

DTIC Science & Technology

1984-06-01

A.Arays, G.V.Sibiriskov. The AVTO -ANALTZE J. Comput. Math. and Mth. Phys., v. 11, N.4, Progrn eg System. J. Comput. Math. and Cinpur. 1971, pp. 1071...1075. Mach., No.3, Kharkov, 1972. 2. S.A.Abhrmov. On Sam Algorithms for Algebraic 13. Z.A.Arays, C.V.Sibiriakov. AVTO -AALM.K. Novo- Transformstions of

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

ERIC Educational Resources Information Center

Rosenzweig, Martin

2007-01-01

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

Helical Axis Data Visualization and Analysis of the Knee Joint Articulation.

PubMed

Millán Vaquero, Ricardo Manuel; Vais, Alexander; Dean Lynch, Sean; Rzepecki, Jan; Friese, Karl-Ingo; Hurschler, Christof; Wolter, Franz-Erich

2016-09-01

We present processing methods and visualization techniques for accurately characterizing and interpreting kinematical data of flexion-extension motion of the knee joint based on helical axes. We make use of the Lie group of rigid body motions and particularly its Lie algebra for a natural representation of motion sequences. This allows to analyze and compute the finite helical axis (FHA) and instantaneous helical axis (IHA) in a unified way without redundant degrees of freedom or singularities. A polynomial fitting based on Legendre polynomials within the Lie algebra is applied to provide a smooth description of a given discrete knee motion sequence which is essential for obtaining stable instantaneous helical axes for further analysis. Moreover, this allows for an efficient overall similarity comparison across several motion sequences in order to differentiate among several cases. Our approach combines a specifically designed patient-specific three-dimensional visualization basing on the processed helical axes information and incorporating computed tomography (CT) scans for an intuitive interpretation of the axes and their geometrical relation with respect to the knee joint anatomy. In addition, in the context of the study of diseases affecting the musculoskeletal articulation, we propose to integrate the above tools into a multiscale framework for exploring related data sets distributed across multiple spatial scales. We demonstrate the utility of our methods, exemplarily processing a collection of motion sequences acquired from experimental data involving several surgery techniques. Our approach enables an accurate analysis, visualization and comparison of knee joint articulation, contributing to the evaluation and diagnosis in medical applications.

Dynamic analysis methods for detecting anomalies in asynchronously interacting systems

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

Kumar, Akshat; Solis, John Hector; Matschke, Benjamin

2014-01-01

Detecting modifications to digital system designs, whether malicious or benign, is problematic due to the complexity of the systems being analyzed. Moreover, static analysis techniques and tools can only be used during the initial design and implementation phases to verify safety and liveness properties. It is computationally intractable to guarantee that any previously verified properties still hold after a system, or even a single component, has been produced by a third-party manufacturer. In this paper we explore new approaches for creating a robust system design by investigating highly-structured computational models that simplify verification and analysis. Our approach avoids the needmore » to fully reconstruct the implemented system by incorporating a small verification component that dynamically detects for deviations from the design specification at run-time. The first approach encodes information extracted from the original system design algebraically into a verification component. During run-time this component randomly queries the implementation for trace information and verifies that no design-level properties have been violated. If any deviation is detected then a pre-specified fail-safe or notification behavior is triggered. Our second approach utilizes a partitioning methodology to view liveness and safety properties as a distributed decision task and the implementation as a proposed protocol that solves this task. Thus the problem of verifying safety and liveness properties is translated to that of verifying that the implementation solves the associated decision task. We develop upon results from distributed systems and algebraic topology to construct a learning mechanism for verifying safety and liveness properties from samples of run-time executions.« less

Vectors and Rotations in 3-Dimensions: Vector Algebra for the C++ Programmer

DTIC Science & Technology

2016-12-01

Proving Ground, MD 21005-5068 This report describes 2 C++ classes: a Vector class for performing vector algebra in 3-dimensional space ( 3D ) and a Rotation...class for performing rotations of vectors in 3D . Each class is self-contained in a single header file (Vector.h and Rotation.h) so that a C...vector, rotation, 3D , quaternion, C++ tools, rotation sequence, Euler angles, yaw, pitch, roll, orientation 98 Richard Saucier 410-278-6721Unclassified

NaviSE: superenhancer navigator integrating epigenomics signal algebra.

PubMed

Ascensión, Alex M; Arrospide-Elgarresta, Mikel; Izeta, Ander; Araúzo-Bravo, Marcos J

2017-06-06

Superenhancers are crucial structural genomic elements determining cell fate, and they are also involved in the determination of several diseases, such as cancer or neurodegeneration. Although there are pipelines which use independent pieces of software to predict the presence of superenhancers from genome-wide chromatin marks or DNA-interaction protein binding sites, there is not yet an integrated software tool that processes automatically algebra combinations of raw data sequencing into a comprehensive final annotated report of predicted superenhancers. We have developed NaviSE, a user-friendly streamlined tool which performs a fully-automated parallel processing of genome-wide epigenomics data from sequencing files into a final report, built with a comprehensive set of annotated files that are navigated through a graphic user interface dynamically generated by NaviSE. NaviSE also implements an 'epigenomics signal algebra' that allows the combination of multiple activation and repression epigenomics signals. NaviSE provides an interactive chromosomal landscaping of the locations of superenhancers, which can be navigated to obtain annotated information about superenhancer signal profile, associated genes, gene ontology enrichment analysis, motifs of transcription factor binding sites enriched in superenhancers, graphs of the metrics evaluating the superenhancers quality, protein-protein interaction networks and enriched metabolic pathways among other features. We have parallelised the most time-consuming tasks achieving a reduction up to 30% for a 15 CPUs machine. We have optimized the default parameters of NaviSE to facilitate its use. NaviSE allows different entry levels of data processing, from sra-fastq files to bed files; and unifies the processing of multiple replicates. NaviSE outperforms the more time-consuming processes required in a non-integrated pipeline. Alongside its high performance, NaviSE is able to provide biological insights, predicting cell type specific markers, such as SOX2 and ZIC3 in embryonic stem cells, CDK5R1 and REST in neurons and CD86 and TLR2 in monocytes. NaviSE is a user-friendly streamlined solution for superenhancer analysis, annotation and navigation, requiring only basic computer and next generation sequencing knowledge. NaviSE binaries and documentation are available at: https://sourceforge.net/projects/navise-superenhancer/ .

Qudit-Basis Universal Quantum Computation Using χ^{(2)} Interactions.

PubMed

Niu, Murphy Yuezhen; Chuang, Isaac L; Shapiro, Jeffrey H

2018-04-20

We prove that universal quantum computation can be realized-using only linear optics and χ^{(2)} (three-wave mixing) interactions-in any (n+1)-dimensional qudit basis of the n-pump-photon subspace. First, we exhibit a strictly universal gate set for the qubit basis in the one-pump-photon subspace. Next, we demonstrate qutrit-basis universality by proving that χ^{(2)} Hamiltonians and photon-number operators generate the full u(3) Lie algebra in the two-pump-photon subspace, and showing how the qutrit controlled-Z gate can be implemented with only linear optics and χ^{(2)} interactions. We then use proof by induction to obtain our general qudit result. Our induction proof relies on coherent photon injection or subtraction, a technique enabled by χ^{(2)} interaction between the encoding modes and ancillary modes. Finally, we show that coherent photon injection is more than a conceptual tool, in that it offers a route to preparing high-photon-number Fock states from single-photon Fock states.

Qudit-Basis Universal Quantum Computation Using χ(2 ) Interactions

NASA Astrophysics Data System (ADS)

Niu, Murphy Yuezhen; Chuang, Isaac L.; Shapiro, Jeffrey H.

2018-04-01

We prove that universal quantum computation can be realized—using only linear optics and χ(2 ) (three-wave mixing) interactions—in any (n +1 )-dimensional qudit basis of the n -pump-photon subspace. First, we exhibit a strictly universal gate set for the qubit basis in the one-pump-photon subspace. Next, we demonstrate qutrit-basis universality by proving that χ(2 ) Hamiltonians and photon-number operators generate the full u (3 ) Lie algebra in the two-pump-photon subspace, and showing how the qutrit controlled-Z gate can be implemented with only linear optics and χ(2 ) interactions. We then use proof by induction to obtain our general qudit result. Our induction proof relies on coherent photon injection or subtraction, a technique enabled by χ(2 ) interaction between the encoding modes and ancillary modes. Finally, we show that coherent photon injection is more than a conceptual tool, in that it offers a route to preparing high-photon-number Fock states from single-photon Fock states.

Short Round Sub-Linear Zero-Knowledge Argument for Linear Algebraic Relations

NASA Astrophysics Data System (ADS)

Seo, Jae Hong

Zero-knowledge arguments allows one party to prove that a statement is true, without leaking any other information than the truth of the statement. In many applications such as verifiable shuffle (as a practical application) and circuit satisfiability (as a theoretical application), zero-knowledge arguments for mathematical statements related to linear algebra are essentially used. Groth proposed (at CRYPTO 2009) an elegant methodology for zero-knowledge arguments for linear algebraic relations over finite fields. He obtained zero-knowledge arguments of the sub-linear size for linear algebra using reductions from linear algebraic relations to equations of the form z = x *' y, where x, y ∈ Fnp are committed vectors, z ∈ Fp is a committed element, and *' : Fnp × Fnp → Fp is a bilinear map. These reductions impose additional rounds on zero-knowledge arguments of the sub-linear size. The round complexity of interactive zero-knowledge arguments is an important measure along with communication and computational complexities. We focus on minimizing the round complexity of sub-linear zero-knowledge arguments for linear algebra. To reduce round complexity, we propose a general transformation from a t-round zero-knowledge argument, satisfying mild conditions, to a (t - 2)-round zero-knowledge argument; this transformation is of independent interest.

Tensor models, Kronecker coefficients and permutation centralizer algebras

NASA Astrophysics Data System (ADS)

Geloun, Joseph Ben; Ramgoolam, Sanjaye

2017-11-01

We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin decompositions into matrix blocks are given in terms of Clebsch-Gordan coefficients of symmetric groups. The matrix basis for the algebras also gives an orthogonal basis for the tensor observables which diagonalizes the Gaussian two-point functions. The centres of the algebras are associated with correlators which are expressible in terms of Kronecker coefficients (Clebsch-Gordan multiplicities of symmetric groups). The color-exchange symmetry present in the Gaussian model, as well as a large class of interacting models, is used to refine the description of the permutation centralizer algebras. This discussion is extended to a general number of colors d: it is used to prove the integrality of an infinite family of number sequences related to color-symmetrizations of colored graphs, and expressible in terms of symmetric group representation theory data. Generalizing a connection between matrix models and Belyi maps, correlators in Gaussian tensor models are interpreted in terms of covers of singular 2-complexes. There is an intriguing difference, between matrix and higher rank tensor models, in the computational complexity of superficially comparable correlators of observables parametrized by Young diagrams.

Two dissimilar approaches to dynamical systems on hyper MV -algebras and their information entropy

NASA Astrophysics Data System (ADS)

Mehrpooya, Adel; Ebrahimi, Mohammad; Davvaz, Bijan

2017-09-01

Measuring the flow of information that is related to the evolution of a system which is modeled by applying a mathematical structure is of capital significance for science and usually for mathematics itself. Regarding this fact, a major issue in concern with hyperstructures is their dynamics and the complexity of the varied possible dynamics that exist over them. Notably, the dynamics and uncertainty of hyper MV -algebras which are hyperstructures and extensions of a central tool in infinite-valued Lukasiewicz propositional calculus that models many valued logics are of primary concern. Tackling this problem, in this paper we focus on the subject of dynamical systems on hyper MV -algebras and their entropy. In this respect, we adopt two varied approaches. One is the set-based approach in which hyper MV -algebra dynamical systems are developed by employing set functions and set partitions. By the other method that is based on points and point partitions, we establish the concept of hyper injective dynamical systems on hyper MV -algebras. Next, we study the notion of entropy for both kinds of systems. Furthermore, we consider essential ergodic characteristics of those systems and their entropy. In particular, we introduce the concept of isomorphic hyper injective and hyper MV -algebra dynamical systems, and we demonstrate that isomorphic systems have the same entropy. We present a couple of theorems in order to help calculate entropy. In particular, we prove a contemporary version of addition and Kolmogorov-Sinai Theorems. Furthermore, we provide a comparison between the indispensable properties of hyper injective and semi-independent dynamical systems. Specifically, we present and prove theorems that draw comparisons between the entropies of such systems. Lastly, we discuss some possible relationships between the theories of hyper MV -algebra and MV -algebra dynamical systems.

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.

Estrategias Didácticas y Conocimiento Especializado de Profesores de Matemáticas. Un Caso en Álgebra Escolar = Teaching Strategies and Mathematics Teacher's Specialized Knowledge. A Case in School Algebra

ERIC Educational Resources Information Center

Sandoval, Ivonne; Solares Rojas, Armando; García-Campos, Montserrat

2017-01-01

We present results of the analysis of knowledge used by a secondary school mathematics teacher in her classroom practice. This knowledge takes shape and is displayed as specific teaching strategies in the management of her class when she incorporates Computer Algebra Systems. Based on observations of regular classes, we find that her knowledge…

Relations between Some Characteristic Lengths in a Triangle

ERIC Educational Resources Information Center

Koepf, Wolfram; Brede, Markus

2005-01-01

The paper's aim is to note a remarkable (and apparently unknown) relation for right triangles, its generalisation to arbitrary triangles and the possibility to derive these and some related relations by elimination using Groebner basis computations with a modern computer algebra system. (Contains 9 figures.)

A RUTCOR Project on Discrete Applied Mathematics

DTIC Science & Technology

1989-01-30

the more important results of this work is the possibility that Groebner basis methods of computational commutative algebra might lead to effective...Billera, L.J., " Groebner Basis Methods for Multivariate Splines," prepared for the Proceedings of the Oslo Conference on Computer-aided Geometric Design

Efficient Computations and Representations of Visible Surfaces.

DTIC Science & Technology

1979-12-01

position as stated. The smooth contour generator may lie along a sharp ridge, for instance. Richards & Stevens -28- 6m lace contout s ?S ,.......... ceoonec...From understanding computation to understanding neural circuitry. Neurosci. Res. Prog. Bull. 13. 470-488. Metelli, F. 1970 An algebraic development of

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…

Using Animation to Support the Teaching of Computer Game Development Techniques

ERIC Educational Resources Information Center

Taylor, Mark John; Pountney, David C.; Baskett, M.

2008-01-01

In this paper, we examine the potential use of animation for supporting the teaching of some of the mathematical concepts that underlie computer games development activities, such as vector and matrix algebra. An experiment was conducted with a group of UK undergraduate computing students to compare the perceived usefulness of animated and static…

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

ERIC Educational Resources Information Center

Fyfe, Emily R.

2016-01-01

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

Using computer algebra and SMT solvers in algebraic biology

NASA Astrophysics Data System (ADS)

Pineda Osorio, Mateo

2014-05-01

Biologic processes are represented as Boolean networks, in a discrete time. The dynamics within these networks are approached with the help of SMT Solvers and the use of computer algebra. Software such as Maple and Z3 was used in this case. The number of stationary states for each network was calculated. The network studied here corresponds to the immune system under the effects of drastic mood changes. Mood is considered as a Boolean variable that affects the entire dynamics of the immune system, changing the Boolean satisfiability and the number of stationary states of the immune network. Results obtained show Z3's great potential as a SMT Solver. Some of these results were verified in Maple, even though it showed not to be as suitable for the problem approach. The solving code was constructed using Z3-Python and Z3-SMT-LiB. Results obtained are important in biology systems and are expected to help in the design of immune therapies. As a future line of research, more complex Boolean network representations of the immune system as well as the whole psychological apparatus are suggested.

Multilinear Computing and Multilinear Algebraic Geometry

DTIC Science & Technology

2016-08-10

landmark paper titled “Most tensor problems are NP-hard” (see [14] in Section 3) in the Journal of the ACM, the premier journal in Computer Science ...Higher-order cone programming,” Machine Learning Thematic Trimester, International Centre for Mathematics and Computer Science , Toulouse, France...geometry-and-data-analysis • 2014 SIMONS INSTITUTE WORKSHOP: Workshop on Tensors in Computer Science and Geometry, University of California, Berkeley, CA

Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov-Zhabotinsky reaction.

PubMed

Dini, Paolo; Nehaniv, Chrystopher L; Egri-Nagy, Attila; Schilstra, Maria J

2013-05-01

Interaction computing (IC) aims to map the properties of integrable low-dimensional non-linear dynamical systems to the discrete domain of finite-state automata in an attempt to reproduce in software the self-organizing and dynamically stable properties of sub-cellular biochemical systems. As the work reported in this paper is still at the early stages of theory development it focuses on the analysis of a particularly simple chemical oscillator, the Belousov-Zhabotinsky (BZ) reaction. After retracing the rationale for IC developed over the past several years from the physical, biological, mathematical, and computer science points of view, the paper presents an elementary discussion of the Krohn-Rhodes decomposition of finite-state automata, including the holonomy decomposition of a simple automaton, and of its interpretation as an abstract positional number system. The method is then applied to the analysis of the algebraic properties of discrete finite-state automata derived from a simplified Petri net model of the BZ reaction. In the simplest possible and symmetrical case the corresponding automaton is, not surprisingly, found to contain exclusively cyclic groups. In a second, asymmetrical case, the decomposition is much more complex and includes five different simple non-abelian groups whose potential relevance arises from their ability to encode functionally complete algebras. The possible computational relevance of these findings is discussed and possible conclusions are drawn. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

Assessing the Effectiveness of Studio Physics in Introductory-Level Courses at Georgia State University

NASA Astrophysics Data System (ADS)

Upton, Brianna; Evans, John; Morrow, Cherilynn; Thoms, Brian

2009-11-01

Previous studies have shown that many students have misconceptions about basic concepts in physics. Moreover, it has been concluded that one of the challenges lies in the teaching methodology. To address this, Georgia State University has begun teaching studio algebra-based physics. Although many institutions have implemented studio physics, most have done so in calculus-based sequences. The effectiveness of the studio approach in an algebra-based introductory physics course needs further investigation. A 3-semester study assessing the effectiveness of studio physics in an algebra-based physics sequence has been performed. This study compares the results of student pre- and post-tests using the Force Concept Inventory. Using the results from this assessment tool, we will discuss the effectiveness of the studio approach to teaching physics at GSU.

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

Generating and Analyzing Visual Representations of Conic Sections with the Use of Technological Tools

ERIC Educational Resources Information Center

Santos-Trigo, Manuel; Espinosa-Perez, Hugo; Reyes-Rodriguez, Aaron

2006-01-01

Technological tools have the potential to offer students the possibility to represent information and relationships embedded in problems and concepts in ways that involve numerical, algebraic, geometric, and visual approaches. In this paper, the authors present and discuss an example in which an initial representation of a mathematical object…

Affine Kac-Moody symmetric spaces related with A{sub 1}{sup (1)}, A{sub 2}{sup (1)}, A{sub 2}{sup (2)}

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

Nayak, Saudamini, E-mail: anumama.nayak07@gmail.com; Pati, K. C., E-mail: kcpati@nitrkl.ac.in

Symmetric spaces associated with Lie algebras and Lie groups which are Riemannian manifolds have recently got a lot of attention in various branches of Physics for their role in classical/quantum integrable systems, transport phenomena, etc. Their infinite dimensional counter parts have recently been discovered which are affine Kac-Moody symmetric spaces. In this paper we have (algebraically) explicitly computed the affine Kac-Moody symmetric spaces associated with affine Kac-Moody algebras A{sub 1}{sup (1)},A{sub 2}{sup (1)},A{sub 2}{sup (2)}. We hope these types of spaces will play similar roles as that of symmetric spaces in many physical systems.

O carater de Chern-Connes para C^*-sistemas dinamicos calculado em algumas algebras de operadores pseudodiferenciais

NASA Astrophysics Data System (ADS)

Dias, David P.

2008-08-01

Given a C^*-dynamical system (A, G, α) one defines a homomorphism, called the Chern-Connes character, that take an element in K_0(A) oplus K_1(A), the K-theory groups of the C^*-algebra A, and maps it into H_{{R}}^*(G), the real deRham cohomology ring of G. We explictly compute this homomorphism for the examples (overline{Psi_{cl}^0(S^1)}, S^1, α) and (overline{Psi_{cl}^0(S^2)}, SO(3), α), where overline{Psi_{cl}^0(M)} denotes the C^*-algebra generated by the classical pseudodifferential operators of zero order in the manifold M and α the action of conjugation by the regular representation (translations).

Modeling formalisms in Systems Biology

PubMed Central

2011-01-01

Systems Biology has taken advantage of computational tools and high-throughput experimental data to model several biological processes. These include signaling, gene regulatory, and metabolic networks. However, most of these models are specific to each kind of network. Their interconnection demands a whole-cell modeling framework for a complete understanding of cellular systems. We describe the features required by an integrated framework for modeling, analyzing and simulating biological processes, and review several modeling formalisms that have been used in Systems Biology including Boolean networks, Bayesian networks, Petri nets, process algebras, constraint-based models, differential equations, rule-based models, interacting state machines, cellular automata, and agent-based models. We compare the features provided by different formalisms, and discuss recent approaches in the integration of these formalisms, as well as possible directions for the future. PMID:22141422

DCA_Tools

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

Summers, Michael S

2017-11-08

HPC software for ab-initio, condensed-matter physics, quantum mechanics calculations needs to be built on top of well tested libraries some of which address requirements unique to the programming domain. During the development of the DCA++ code, that we use in our research, we have developed a collection of libraries that may be of use to other computational scientists working in the same or similar domains. The libraries include: a) a pythonic input-language system, b) tensors whose shape is constructed from generalized dimension objects such at time domains. frequency domains, momentum domains, vertex domains et. al. and c) linear algebra operationsmore » that resolve to BLA/LAPACK operations when possible. This supports the implementation of Greens functions and operations on them such as are used in condensed matter physics.« less

Turbulence modeling of free shear layers for high-performance aircraft

NASA Technical Reports Server (NTRS)

Sondak, Douglas L.

1993-01-01

The High Performance Aircraft (HPA) Grand Challenge of the High Performance Computing and Communications (HPCC) program involves the computation of the flow over a high performance aircraft. A variety of free shear layers, including mixing layers over cavities, impinging jets, blown flaps, and exhaust plumes, may be encountered in such flowfields. Since these free shear layers are usually turbulent, appropriate turbulence models must be utilized in computations in order to accurately simulate these flow features. The HPCC program is relying heavily on parallel computers. A Navier-Stokes solver (POVERFLOW) utilizing the Baldwin-Lomax algebraic turbulence model was developed and tested on a 128-node Intel iPSC/860. Algebraic turbulence models run very fast, and give good results for many flowfields. For complex flowfields such as those mentioned above, however, they are often inadequate. It was therefore deemed that a two-equation turbulence model will be required for the HPA computations. The k-epsilon two-equation turbulence model was implemented on the Intel iPSC/860. Both the Chien low-Reynolds-number model and a generalized wall-function formulation were included.

Interactive algebraic grid-generation technique

NASA Technical Reports Server (NTRS)

Smith, R. E.; Wiese, M. R.

1986-01-01

An algebraic grid generation technique and use of an associated interactive computer program are described. The technique, called the two boundary technique, is based on Hermite cubic interpolation between two fixed, nonintersecting boundaries. The boundaries are referred to as the bottom and top, and they are defined by two ordered sets of points. Left and right side boundaries which intersect the bottom and top boundaries may also be specified by two ordered sets of points. when side boundaries are specified, linear blending functions are used to conform interior interpolation to the side boundaries. Spacing between physical grid coordinates is determined as a function of boundary data and uniformly space computational coordinates. Control functions relating computational coordinates to parametric intermediate variables that affect the distance between grid points are embedded in the interpolation formulas. A versatile control function technique with smooth-cubic-spline functions is presented. The technique works best in an interactive graphics environment where computational displays and user responses are quickly exchanged. An interactive computer program based on the technique and called TBGG (two boundary grid generation) is also described.

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

Study-simulation of space station dynamics

NASA Technical Reports Server (NTRS)

Gaitens, M. J.

1971-01-01

Matrix algebra translator and executor /MATE/ takes equations describing structural control system environmental interaction problem for flexible spacecraft components and loads them into self programming computer.

Selected computations of transonic cavity flows

NASA Technical Reports Server (NTRS)

Atwood, Christopher A.

1993-01-01

An efficient diagonal scheme implemented in an overset mesh framework has permitted the analysis of geometrically complex cavity flows via the Reynolds averaged Navier-Stokes equations. Use of rapid hyperbolic and algebraic grid methods has allowed simple specification of critical turbulent regions with an algebraic turbulence model. Comparisons between numerical and experimental results are made in two dimensions for the following problems: a backward-facing step; a resonating cavity; and two quieted cavity configurations. In three-dimensions the flow about three early concepts of the stratospheric Observatory For Infrared Astronomy (SOFIA) are compared to wind-tunnel data. Shedding frequencies of resolved shear layer structures are compared against experiment for the quieted cavities. The results demonstrate the progress of computational assessment of configuration safety and performance.

Full thermomechanical coupling in modelling of micropolar thermoelasticity

NASA Astrophysics Data System (ADS)

Murashkin, E. V.; Radayev, Y. N.

2018-04-01

The present paper is devoted to plane harmonic waves of displacements and microrotations propagating in fully coupled thermoelastic continua. The analysis is carried out in the framework of linear conventional thermoelastic micropolar continuum model. The reduced energy balance equation and the special form of the Helmholtz free energy are discussed. The constitutive constants providing fully coupling of equations of motion and heat conduction are considered. The dispersion equation is derived and analysed in the form bi-cubic and bi-quadratic polynoms product. The equation are analyzed by the computer algebra system Mathematica. Algebraic forms expressed by complex multivalued square and cubic radicals are obtained for wavenumbers of transverse and longitudinal waves. The exact forms of wavenumbers of a plane harmonic coupled thermoelastic waves are computed.

Sedimentation equilibrium analysis of protein interactions with global implicit mass conservation constraints and systematic noise decomposition.

PubMed

Vistica, Jennifer; Dam, Julie; Balbo, Andrea; Yikilmaz, Emine; Mariuzza, Roy A; Rouault, Tracey A; Schuck, Peter

2004-03-15

Sedimentation equilibrium is a powerful tool for the characterization of protein self-association and heterogeneous protein interactions. Frequently, it is applied in a configuration with relatively long solution columns and with equilibrium profiles being acquired sequentially at several rotor speeds. The present study proposes computational tools, implemented in the software SEDPHAT, for the global analysis of equilibrium data at multiple rotor speeds with multiple concentrations and multiple optical detection methods. The detailed global modeling of such equilibrium data can be a nontrivial computational problem. It was shown previously that mass conservation constraints can significantly improve and extend the analysis of heterogeneous protein interactions. Here, a method for using conservation of mass constraints for the macromolecular redistribution is proposed in which the effective loading concentrations are calculated from the sedimentation equilibrium profiles. The approach is similar to that described by Roark (Biophys. Chem. 5 (1976) 185-196), but its utility is extended by determining the bottom position of the solution columns from the macromolecular redistribution. For analyzing heterogeneous associations at multiple protein concentrations, additional constraints that relate the effective loading concentrations of the different components or their molar ratio in the global analysis are introduced. Equilibrium profiles at multiple rotor speeds also permit the algebraic determination of radial-dependent baseline profiles, which can govern interference optical ultracentrifugation data, but usually also occur, to a smaller extent, in absorbance optical data. Finally, the global analysis of equilibrium profiles at multiple rotor speeds with implicit mass conservation and computation of the bottom of the solution column provides an unbiased scale for determining molar mass distributions of noninteracting species. The properties of these tools are studied with theoretical and experimental data sets.

Teacher Teams and Computer Technology.

ERIC Educational Resources Information Center

Hecht, Jeffrey B.; Roberts, Nicole K.; Schoon, Perry L.; Fansler, Gigi

This research used three groups in a quasi-experimental approach to assess the combined impact of teacher teaming and computer technology on student grade point averages (GPAs). Ninth-grade students' academic achievement in each of four different subject areas (algebra, biology, world cultures, and English) was studied. Two separate treatments…

Computer-Aided Instruction: College Algebra Students' Perceptions

ERIC Educational Resources Information Center

Aichele, Douglas B.; Tree, D. Rae; Utley, Juliana; Wescoatt, Benjamin

2012-01-01

Technology permeates our daily lives; education has not been untouched. Liaw (2002) points out that "teachers, trainers, and instructional designers of computer-based or Web-based instruction would benefit by being more attentive to learners' perceptions toward Web-based environments." Reviewing the earlier research into student perceptions toward…

Computer programs for the solution of systems of linear algebraic equations

NASA Technical Reports Server (NTRS)

Sequi, W. T.

1973-01-01

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

Hedgehog bases for A n cluster polylogarithms and an application to six-point amplitudes

DOE PAGES

Parker, Daniel E.; Scherlis, Adam; Spradlin, Marcus; ...

2015-11-20

Multi-loop scattering amplitudes in N=4 Yang-Mills theory possess cluster algebra structure. In order to develop a computational framework which exploits this connection, we show how to construct bases of Goncharov polylogarithm functions, at any weight, whose symbol alphabet consists of cluster coordinates on the A n cluster algebra. As a result, using such a basis we present a new expression for the 2-loop 6-particle NMHV amplitude which makes some of its cluster structure manifest.

The theory of Enceladus and Dione: An application of computerized algebra in dynamical astronomy

NASA Technical Reports Server (NTRS)

Jefferys, W. H.; Ries, L. M.

1974-01-01

A theory of Saturn's satellites Enceladus and Dione is discussed which is literal (all constants of integration appear explicitly), canonically invariant (the Hori-Lie method is used), and which correctly handles the eccentricity-type resonance between the two satellites. Algebraic manipulations are designed to be performed using the TRIGMAN formula manipulation language, and computer programs were developed so that, with minor modifications, they can be used on the Mimas-Tethys and Titan-Hyperion systems.

Proceedings of the International Conference on Algebraic Methodology and Software Technology (2nd) Held in Iowa City, Iowa on May 22-25, 1991.

DTIC Science & Technology

1992-05-25

d’Etat, University of Paris-Sud. [Boudol 84] G. Boudol, An asynchronous calculus MEIJE, in NATO summer school, La - Colle - sur - Loup , France (1984). [Da...on the propositional p-calculus. Theoretical Comput. Sci., 27:333-354, 1983. [12] M. Nivat. Sur la synchronisation des processus. Revue Technique...Meulen, E.A. Deriving In- Traynor, 0., de la Cruz, P., Uniform (Meta- ) De- cremental Implementations from Algebraic Specifica- velopment in the PROSPECTRA

On Some Nonclassical Algebraic Properties of Interval-Valued Fuzzy Soft Sets

PubMed Central

2014-01-01

Interval-valued fuzzy soft sets realize a hybrid soft computing model in a general framework. Both Molodtsov's soft sets and interval-valued fuzzy sets can be seen as special cases of interval-valued fuzzy soft sets. In this study, we first compare four different types of interval-valued fuzzy soft subsets and reveal the relations among them. Then we concentrate on investigating some nonclassical algebraic properties of interval-valued fuzzy soft sets under the soft product operations. We show that some fundamental algebraic properties including the commutative and associative laws do not hold in the conventional sense, but hold in weaker forms characterized in terms of the relation =L. We obtain a number of algebraic inequalities of interval-valued fuzzy soft sets characterized by interval-valued fuzzy soft inclusions. We also establish the weak idempotent law and the weak absorptive law of interval-valued fuzzy soft sets using interval-valued fuzzy soft J-equal relations. It is revealed that the soft product operations ∧ and ∨ of interval-valued fuzzy soft sets do not always have similar algebraic properties. Moreover, we find that only distributive inequalities described by the interval-valued fuzzy soft L-inclusions hold for interval-valued fuzzy soft sets. PMID:25143964

On some nonclassical algebraic properties of interval-valued fuzzy soft sets.

PubMed

Liu, Xiaoyan; Feng, Feng; Zhang, Hui

2014-01-01

Interval-valued fuzzy soft sets realize a hybrid soft computing model in a general framework. Both Molodtsov's soft sets and interval-valued fuzzy sets can be seen as special cases of interval-valued fuzzy soft sets. In this study, we first compare four different types of interval-valued fuzzy soft subsets and reveal the relations among them. Then we concentrate on investigating some nonclassical algebraic properties of interval-valued fuzzy soft sets under the soft product operations. We show that some fundamental algebraic properties including the commutative and associative laws do not hold in the conventional sense, but hold in weaker forms characterized in terms of the relation = L . We obtain a number of algebraic inequalities of interval-valued fuzzy soft sets characterized by interval-valued fuzzy soft inclusions. We also establish the weak idempotent law and the weak absorptive law of interval-valued fuzzy soft sets using interval-valued fuzzy soft J-equal relations. It is revealed that the soft product operations ∧ and ∨ of interval-valued fuzzy soft sets do not always have similar algebraic properties. Moreover, we find that only distributive inequalities described by the interval-valued fuzzy soft L-inclusions hold for interval-valued fuzzy soft sets.

Diagnosing students' misconceptions in algebra: results from an experimental pilot study.

PubMed

Russell, Michael; O'Dwyer, Laura M; Miranda, Helena

2009-05-01

Computer-based diagnostic assessment systems hold potential to help teachers identify sources of poor performance and to connect teachers and students to learning activities designed to help advance students' conceptual understandings. The present article presents findings from a study that examined how students' performance in algebra and their overcoming of common algebraic misconceptions were affected by the use of a diagnostic assessment system that focused on important algebra concepts. This study used a four-group randomized cluster trial design in which teachers were assigned randomly to one of four groups: a "business as usual" control group, a partial intervention group that was provided with access to diagnostic tests results, a partial intervention group that was provided with access to the learning activities, and a full intervention group that was given access to the test results and learning activities. Data were collected from 905 students (6th-12th grade) nested within 44 teachers. We used hierarchical linear modeling techniques to compare the effects of full, partial, and no (control) intervention on students' algebraic ability and misconceptions. The analyses indicate that full intervention had a net positive effect on ability and misconception measures.

The connection-set algebra--a novel formalism for the representation of connectivity structure in neuronal network models.

PubMed

Djurfeldt, Mikael

2012-07-01

The connection-set algebra (CSA) is a novel and general formalism for the description of connectivity in neuronal network models, from small-scale to large-scale structure. The algebra provides operators to form more complex sets of connections from simpler ones and also provides parameterization of such sets. CSA is expressive enough to describe a wide range of connection patterns, including multiple types of random and/or geometrically dependent connectivity, and can serve as a concise notation for network structure in scientific writing. CSA implementations allow for scalable and efficient representation of connectivity in parallel neuronal network simulators and could even allow for avoiding explicit representation of connections in computer memory. The expressiveness of CSA makes prototyping of network structure easy. A C+ + version of the algebra has been implemented and used in a large-scale neuronal network simulation (Djurfeldt et al., IBM J Res Dev 52(1/2):31-42, 2008b) and an implementation in Python has been publicly released.

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

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

Integration of CAI into a Freshmen Liberal Arts Math Course in the Community College.

ERIC Educational Resources Information Center

McCall, Michael B.; Holton, Jean L.

1982-01-01

Discusses four computer-assisted-instruction programs used in a college-level mathematics course to introduce computer literacy and improve mathematical skills. The BASIC programs include polynomial functions, trigonometric functions, matrix algebra, and differential calculus. Each program discusses mathematics theory and introduces programming…

Elliptic Curve Cryptography with Java

ERIC Educational Resources Information Center

Klima, Richard E.; Sigmon, Neil P.

2005-01-01

The use of the computer, and specifically the mathematics software package Maple, has played a central role in the authors' abstract algebra course because it provides their students with a way to see realistic examples of the topics they discuss without having to struggle with extensive computations. However, Maple does not provide the computer…

A Functional Analytic Approach to Computer-Interactive Mathematics

ERIC Educational Resources Information Center

Ninness, Chris; Rumph, Robin; McCuller, Glen; Harrison, Carol; Ford, Angela M.; Ninness, Sharon K.

2005-01-01

Following a pretest, 11 participants who were naive with regard to various algebraic and trigonometric transformations received an introductory lecture regarding the fundamentals of the rectangular coordinate system. Following the lecture, they took part in a computer-interactive matching-to-sample procedure in which they received training on…

A Pulsatile Cardiovascular Computer Model for Teaching Heart-Blood Vessel Interaction.

ERIC Educational Resources Information Center

Campbell, Kenneth; And Others

1982-01-01

Describes a model which gives realistic predictions of pulsatile pressure, flow, and volume events in the cardiovascular system. Includes computer oriented laboratory exercises for veterinary and graduate students; equations of the dynamic and algebraic models; and a flow chart for the cardiovascular teaching program. (JN)

Compressed Continuous Computation v. 12/20/2016

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

Gorodetsky, Alex

2017-02-17

A library for performing numerical computation with low-rank functions. The (C3) library enables performing continuous linear and multilinear algebra with multidimensional functions. Common tasks include taking "matrix" decompositions of vector- or matrix-valued functions, approximating multidimensional functions in low-rank format, adding or multiplying functions together, integrating multidimensional functions.

Teaching Pascal's Triangle from a Computer Science Perspective

ERIC Educational Resources Information Center

Skurnick, Ronald

2004-01-01

Pascal's Triangle is named for the seventeenth-century French philosopher and mathematician Blaise Pascal (the same person for whom the computer programming language is named). Students are generally introduced to Pascal's Triangle in an algebra or precalculus class in which the Binomial Theorem is presented. This article, presents a new method…

Teaching Mathematics Using a Computer Algebra.

ERIC Educational Resources Information Center

Westermann, Thomas

2001-01-01

Demonstrates the principal concept and the application of MAPLE in mathematical education in various examples. Discusses lengthy and abstract topics like the convergence of Fourier series to a given function, performs the visualization of the wave equation in the case of a vibrating string, and computes the oscillations of an idealized skyscraper…

Making Connections: Integrating Computer Applications with the Academic Core

ERIC Educational Resources Information Center

Harter, Christi

2011-01-01

In order to improve the quality of technology instruction, the Career and Technical Education (CTE) Business Department in the Spokane Public School district has aligned its Computer Applications (CA) course to the district's ninth-grade Springboard (Language Arts) curriculum, Algebra I curriculum, and the Culminating Project (senior project)…

An Intelligent Tutor for Basic Algebra.

ERIC Educational Resources Information Center

McArthur, David; Stasz, Cathleen

The stated goal of Individual Computer-Assisted Instruction (ICAI) research is the development of computer software that combines much of the subject matter being studied, any particular student's learning schema, and the pedagogical knowledge of human tutors into a powerful one-to-one learning environment. This report describes the initial steps…

Software Reviews.

ERIC Educational Resources Information Center

Davis, Shelly J., Ed.; Knaupp, Jon, Ed.

1984-01-01

Reviewed is computer software on: (1) classification of living things, a tutorial program for grades 5-10; and (2) polynomial practice using tiles, a drill-and-practice program for algebra students. (MNS)

Schwinger-Keldysh formalism. Part II: thermal equivariant cohomology

NASA Astrophysics Data System (ADS)

Haehl, Felix M.; Loganayagam, R.; Rangamani, Mukund

2017-06-01

Causally ordered correlation functions of local operators in near-thermal quantum systems computed using the Schwinger-Keldysh formalism obey a set of Ward identities. These can be understood rather simply as the consequence of a topological (BRST) algebra, called the universal Schwinger-Keldysh superalgebra, as explained in our compan-ion paper [1]. In the present paper we provide a mathematical discussion of this topological algebra. In particular, we argue that the structures can be understood in the language of extended equivariant cohomology. To keep the discussion self-contained, we provide a ba-sic review of the algebraic construction of equivariant cohomology and explain how it can be understood in familiar terms as a superspace gauge algebra. We demonstrate how the Schwinger-Keldysh construction can be succinctly encoded in terms a thermal equivariant cohomology algebra which naturally acts on the operator (super)-algebra of the quantum system. The main rationale behind this exploration is to extract symmetry statements which are robust under renormalization group flow and can hence be used to understand low-energy effective field theory of near-thermal physics. To illustrate the general prin-ciples, we focus on Langevin dynamics of a Brownian particle, rephrasing some known results in terms of thermal equivariant cohomology. As described elsewhere, the general framework enables construction of effective actions for dissipative hydrodynamics and could potentially illumine our understanding of black holes.

Are Online Quizzes an Effective Tool for Mastering Basic Algebra?

ERIC Educational Resources Information Center

Read, Wayne; Higgins, Patrick

2012-01-01

On-line quizzes are used to help first year University Mathematics students identify weaknesses in their basic skills and improve them. Quizzes developed as a formative tool have been utilised at JCU [James Cook University] for eight years. However, before this research no-one has questioned the effectiveness of quizzes for this task. We present a…

Optimal control in a model of malaria with differential susceptibility

NASA Astrophysics Data System (ADS)

Hincapié, Doracelly; Ospina, Juan

2014-06-01

A malaria model with differential susceptibility is analyzed using the optimal control technique. In the model the human population is classified as susceptible, infected and recovered. Susceptibility is assumed dependent on genetic, physiological, or social characteristics that vary between individuals. The model is described by a system of differential equations that relate the human and vector populations, so that the infection is transmitted to humans by vectors, and the infection is transmitted to vectors by humans. The model considered is analyzed using the optimal control method when the control consists in using of insecticide-treated nets and educational campaigns; and the optimality criterion is to minimize the number of infected humans, while keeping the cost as low as is possible. One first goal is to determine the effects of differential susceptibility in the proposed control mechanism; and the second goal is to determine the algebraic form of the basic reproductive number of the model. All computations are performed using computer algebra, specifically Maple. It is claimed that the analytical results obtained are important for the design and implementation of control measures for malaria. It is suggested some future investigations such as the application of the method to other vector-borne diseases such as dengue or yellow fever; and also it is suggested the possible application of free software of computer algebra like Maxima.

NPTool: Towards Scalability and Reliability of Business Process Management

NASA Astrophysics Data System (ADS)

Braghetto, Kelly Rosa; Ferreira, João Eduardo; Pu, Calton

Currently one important challenge in business process management is provide at the same time scalability and reliability of business process executions. This difficulty becomes more accentuated when the execution control assumes complex countless business processes. This work presents NavigationPlanTool (NPTool), a tool to control the execution of business processes. NPTool is supported by Navigation Plan Definition Language (NPDL), a language for business processes specification that uses process algebra as formal foundation. NPTool implements the NPDL language as a SQL extension. The main contribution of this paper is a description of the NPTool showing how the process algebra features combined with a relational database model can be used to provide a scalable and reliable control in the execution of business processes. The next steps of NPTool include reuse of control-flow patterns and support to data flow management.

Kinematic state estimation and motion planning for stochastic nonholonomic systems using the exponential map.

PubMed

Park, Wooram; Liu, Yan; Zhou, Yu; Moses, Matthew; Chirikjian, Gregory S

2008-04-11

A nonholonomic system subjected to external noise from the environment, or internal noise in its own actuators, will evolve in a stochastic manner described by an ensemble of trajectories. This ensemble of trajectories is equivalent to the solution of a Fokker-Planck equation that typically evolves on a Lie group. If the most likely state of such a system is to be estimated, and plans for subsequent motions from the current state are to be made so as to move the system to a desired state with high probability, then modeling how the probability density of the system evolves is critical. Methods for solving Fokker-Planck equations that evolve on Lie groups then become important. Such equations can be solved using the operational properties of group Fourier transforms in which irreducible unitary representation (IUR) matrices play a critical role. Therefore, we develop a simple approach for the numerical approximation of all the IUR matrices for two of the groups of most interest in robotics: the rotation group in three-dimensional space, SO(3), and the Euclidean motion group of the plane, SE(2). This approach uses the exponential mapping from the Lie algebras of these groups, and takes advantage of the sparse nature of the Lie algebra representation matrices. Other techniques for density estimation on groups are also explored. The computed densities are applied in the context of probabilistic path planning for kinematic cart in the plane and flexible needle steering in three-dimensional space. In these examples the injection of artificial noise into the computational models (rather than noise in the actual physical systems) serves as a tool to search the configuration spaces and plan paths. Finally, we illustrate how density estimation problems arise in the characterization of physical noise in orientational sensors such as gyroscopes.

A new S-type eigenvalue inclusion set for tensors and its applications.

PubMed

Huang, Zheng-Ge; Wang, Li-Gong; Xu, Zhong; Cui, Jing-Jing

2016-01-01

In this paper, a new S -type eigenvalue localization set for a tensor is derived by dividing [Formula: see text] into disjoint subsets S and its complement. It is proved that this new set is sharper than those presented by Qi (J. Symb. Comput. 40:1302-1324, 2005), Li et al. (Numer. Linear Algebra Appl. 21:39-50, 2014) and Li et al. (Linear Algebra Appl. 481:36-53, 2015). As applications of the results, new bounds for the spectral radius of nonnegative tensors and the minimum H -eigenvalue of strong M -tensors are established, and we prove that these bounds are tighter than those obtained by Li et al. (Numer. Linear Algebra Appl. 21:39-50, 2014) and He and Huang (J. Inequal. Appl. 2014:114, 2014).

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

The orbifolder: A tool to study the low-energy effective theory of heterotic orbifolds

NASA Astrophysics Data System (ADS)

Nilles, H. P.; Ramos-Sánchez, S.; Vaudrevange, P. K. S.; Wingerter, A.

2012-06-01

The orbifolder is a program developed in C++ that computes and analyzes the low-energy effective theory of heterotic orbifold compactifications. The program includes routines to compute the massless spectrum, to identify the allowed couplings in the superpotential, to automatically generate large sets of orbifold models, to identify phenomenologically interesting models (e.g. MSSM-like models) and to analyze their vacuum configurations. Program summaryProgram title: orbifolder Catalogue identifier: AELR_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AELR_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License version 3 No. of lines in distributed program, including test data, etc.: 145 572 No. of bytes in distributed program, including test data, etc.: 930 517 Distribution format: tar.gz Programming language:C++ Computer: Personal computer Operating system: Tested on Linux (Fedora 15, Ubuntu 11, SuSE 11) Word size: 32 bits or 64 bits Classification: 11.1 External routines: Boost (http://www.boost.org/), GSL (http://www.gnu.org/software/gsl/) Nature of problem: Calculating the low-energy spectrum of heterotic orbifold compactifications. Solution method: Quadratic equations on a lattice; representation theory; polynomial algebra. Running time: Less than a second per model.

Occlusions in Camera Networks and Vision: The Bridge between Topological Recovery and Metric Reconstruction

DTIC Science & Technology

2009-05-18

serves as a didactic tool to understand the information required for the approach to coordinate free tracking and navigation problems. Observe that the...layout (left), and in the CN -Complex (right). These paths can be compared by using the algebraic topological tools covered in chapter 2. . . . 34 3.9...right). mathematical tools necessary to make our discussion formal; chapter 3 will present the construction of a simplicial representation called

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.

A look at scalable dense linear algebra libraries

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

Dongarra, J.J.; Van de Geijn, R.A.; Walker, D.W.

1992-01-01

We discuss the essential design features of a library of scalable software for performing dense linear algebra computations on distributed memory concurrent computers. The square block scattered decomposition is proposed as a flexible and general-purpose way of decomposing most, if not all, dense matrix problems. An object- oriented interface to the library permits more portable applications to be written, and is easy to learn and use, since details of the parallel implementation are hidden from the user. Experiments on the Intel Touchstone Delta system with a prototype code that uses the square block scattered decomposition to perform LU factorization aremore » presented and analyzed. It was found that the code was both scalable and efficient, performing at about 14 GFLOPS (double precision) for the largest problem considered.« less

A look at scalable dense linear algebra libraries

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

Dongarra, J.J.; Van de Geijn, R.A.; Walker, D.W.

1992-08-01

We discuss the essential design features of a library of scalable software for performing dense linear algebra computations on distributed memory concurrent computers. The square block scattered decomposition is proposed as a flexible and general-purpose way of decomposing most, if not all, dense matrix problems. An object- oriented interface to the library permits more portable applications to be written, and is easy to learn and use, since details of the parallel implementation are hidden from the user. Experiments on the Intel Touchstone Delta system with a prototype code that uses the square block scattered decomposition to perform LU factorization aremore » presented and analyzed. It was found that the code was both scalable and efficient, performing at about 14 GFLOPS (double precision) for the largest problem considered.« less

Towards reversible basic linear algebra subprograms: A performance study

DOE PAGES

Perumalla, Kalyan S.; Yoginath, Srikanth B.

2014-12-06

Problems such as fault tolerance and scalable synchronization can be efficiently solved using reversibility of applications. Making applications reversible by relying on computation rather than on memory is ideal for large scale parallel computing, especially for the next generation of supercomputers in which memory is expensive in terms of latency, energy, and price. In this direction, a case study is presented here in reversing a computational core, namely, Basic Linear Algebra Subprograms, which is widely used in scientific applications. A new Reversible BLAS (RBLAS) library interface has been designed, and a prototype has been implemented with two modes: (1) amore » memory-mode in which reversibility is obtained by checkpointing to memory in forward and restoring from memory in reverse, and (2) a computational-mode in which nothing is saved in the forward, but restoration is done entirely via inverse computation in reverse. The article is focused on detailed performance benchmarking to evaluate the runtime dynamics and performance effects, comparing reversible computation with checkpointing on both traditional CPU platforms and recent GPU accelerator platforms. For BLAS Level-1 subprograms, data indicates over an order of magnitude better speed of reversible computation compared to checkpointing. For BLAS Level-2 and Level-3, a more complex tradeoff is observed between reversible computation and checkpointing, depending on computational and memory complexities of the subprograms.« less

Thermodynamic characterization of networks using graph polynomials

NASA Astrophysics Data System (ADS)

Ye, Cheng; Comin, César H.; Peron, Thomas K. DM.; Silva, Filipi N.; Rodrigues, Francisco A.; Costa, Luciano da F.; Torsello, Andrea; Hancock, Edwin R.

2015-09-01

In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.

Remediating Number Combination and Word Problem Deficits Among Students With Mathematics Difficulties: A Randomized Control Trial

PubMed Central

Fuchs, Lynn S.; Powell, Sarah R.; Seethaler, Pamela M.; Cirino, Paul T.; Fletcher, Jack M.; Fuchs, Douglas; Hamlett, Carol L.; Zumeta, Rebecca O.

2009-01-01

The purposes of this study were to assess the efficacy of remedial tutoring for 3rd graders with mathematics difficulty, to investigate whether tutoring is differentially efficacious depending on students’ math difficulty status (mathematics difficulty alone vs. mathematics plus reading difficulty), to explore transfer from number combination (NC) remediation, and to examine the transportability of the tutoring protocols. At 2 sites, 133 students were stratified on mathematics difficulty status and site and then randomly assigned to 3 conditions: control (no tutoring), tutoring on automatic retrieval of NCs (i.e., Math Flash), or tutoring on word problems with attention to the foundational skills of NCs, procedural calculations, and algebra (i.e., Pirate Math). Tutoring occurred for 16 weeks, 3 sessions per week and 20–30 min per session. Math Flash enhanced fluency with NCs with transfer to procedural computation but without transfer to algebra or word problems. Pirate Math enhanced word problem skill as well as fluency with NCs, procedural computation, and algebra. Tutoring was not differentially efficacious as a function of students’ mathematics difficulty status. The tutoring protocols proved transportable across sites. PMID:19865600

An algebraic homotopy method for generating quasi-three-dimensional grids for high-speed configurations

NASA Technical Reports Server (NTRS)

Moitra, Anutosh

1989-01-01

A fast and versatile procedure for algebraically generating boundary conforming computational grids for use with finite-volume Euler flow solvers is presented. A semi-analytic homotopic procedure is used to generate the grids. Grids generated in two-dimensional planes are stacked to produce quasi-three-dimensional grid systems. The body surface and outer boundary are described in terms of surface parameters. An interpolation scheme is used to blend between the body surface and the outer boundary in order to determine the field points. The method, albeit developed for analytically generated body geometries is equally applicable to other classes of geometries. The method can be used for both internal and external flow configurations, the only constraint being that the body geometries be specified in two-dimensional cross-sections stationed along the longitudinal axis of the configuration. Techniques for controlling various grid parameters, e.g., clustering and orthogonality are described. Techniques for treating problems arising in algebraic grid generation for geometries with sharp corners are addressed. A set of representative grid systems generated by this method is included. Results of flow computations using these grids are presented for validation of the effectiveness of the method.

A Simple Algebraic Grid Adaptation Scheme with Applications to Two- and Three-dimensional Flow Problems

NASA Technical Reports Server (NTRS)

Hsu, Andrew T.; Lytle, John K.

1989-01-01

An algebraic adaptive grid scheme based on the concept of arc equidistribution is presented. The scheme locally adjusts the grid density based on gradients of selected flow variables from either finite difference or finite volume calculations. A user-prescribed grid stretching can be specified such that control of the grid spacing can be maintained in areas of known flowfield behavior. For example, the grid can be clustered near a wall for boundary layer resolution and made coarse near the outer boundary of an external flow. A grid smoothing technique is incorporated into the adaptive grid routine, which is found to be more robust and efficient than the weight function filtering technique employed by other researchers. Since the present algebraic scheme requires no iteration or solution of differential equations, the computer time needed for grid adaptation is trivial, making the scheme useful for three-dimensional flow problems. Applications to two- and three-dimensional flow problems show that a considerable improvement in flowfield resolution can be achieved by using the proposed adaptive grid scheme. Although the scheme was developed with steady flow in mind, it is a good candidate for unsteady flow computations because of its efficiency.

Projectile Motion with Mathematica.

ERIC Educational Resources Information Center

de Alwis, Tilak

2000-01-01

Describes how to use the computer algebra system (CAS) Mathematica to analyze projectile motion with and without air resistance. These experiments result in several conjectures leading to theorems. (Contains 17 references.) (Author/ASK)

[North Carolina Gifted and Talented Minigrant Curriculum Projects: Two Microcomputer Projects].

ERIC Educational Resources Information Center

Parrish, Ronald; Baker, Reginald

Computer awareness and literacy programs for gifted and talented high school students were developed at two Washington City Schools (North Carolina). At Carteret High School, a variety of computer programs were purchased for biology and physics studies, trigonometry and algebra studies, aptitude and merit exam preparation, basic skills math…

Developing Computational Fluency with the Help of Science: A Turkish Middle and High School Grades Study

ERIC Educational Resources Information Center

Corlu, M. Sencer; Capraro, Robert M.; Corlu, M. Ali

2011-01-01

Students need to achieve automaticity in learning mathematics without sacrificing conceptual understanding of the algorithms that are essential in being successful in algebra and problem solving, as well as in science. This research investigated the relationship between science-contextualized problems and computational fluency by testing an…

SymPy: Symbolic computing in python

DOE PAGES

Meurer, Aaron; Smith, Christopher P.; Paprocki, Mateusz; ...

2017-01-02

Here, SymPy is a full featured computer algebra system (CAS) written in the Python programming language. It is open source, being licensed under the extremely permissive 3-clause BSD license. SymPy was started by Ondrej Certik in 2005, and it has since grown into a large open source project, with over 500 contributors.

Improving the Fraction Word Problem Solving of Students with Mathematics Learning Disabilities: Interactive Computer Application

ERIC Educational Resources Information Center

Shin, Mikyung; Bryant, Diane P.

2017-01-01

Students with mathematics learning disabilities (MLD) have a weak understanding of fraction concepts and skills, which are foundations of algebra. Such students might benefit from computer-assisted instruction that utilizes evidence-based instructional components (cognitive strategies, feedback, virtual manipulatives). As a pilot study using a…

Mathematics Objectives and Measurement Specifications 1986-1990. Exit Level. Texas Educational Assessment of Minimum Skills (TEAMS).

ERIC Educational Resources Information Center

Texas Education Agency, Austin. Div. of Educational Assessment.

This document lists the objectives for the Texas educational assessment program in mathematics. Eighteen objectives for exit level mathematics are listed, by category: number concepts (4); computation (3); applied computation (5); statistical concepts (3); geometric concepts (2); and algebraic concepts (1). Then general specifications are listed…

The Multiple Pendulum Problem via Maple[R

ERIC Educational Resources Information Center

Salisbury, K. L.; Knight, D. G.

2002-01-01

The way in which computer algebra systems, such as Maple, have made the study of physical problems of some considerable complexity accessible to mathematicians and scientists with modest computational skills is illustrated by solving the multiple pendulum problem. A solution is obtained for four pendulums with no restriction on the size of the…

Modelling the Landing of a Plane in a Calculus Lab

ERIC Educational Resources Information Center

Morante, Antonio; Vallejo, Jose A.

2012-01-01

We exhibit a simple model of a plane landing that involves only basic concepts of differential calculus, so it is suitable for a first-year calculus lab. We use the computer algebra system Maxima and the interactive geometry software GeoGebra to do the computations and graphics. (Contains 5 figures and 1 note.)

Comparison of different models for non-invasive FFR estimation

NASA Astrophysics Data System (ADS)

Mirramezani, Mehran; Shadden, Shawn

2017-11-01

Coronary artery disease is a leading cause of death worldwide. Fractional flow reserve (FFR), derived from invasively measuring the pressure drop across a stenosis, is considered the gold standard to diagnose disease severity and need for treatment. Non-invasive estimation of FFR has gained recent attention for its potential to reduce patient risk and procedural cost versus invasive FFR measurement. Non-invasive FFR can be obtained by using image-based computational fluid dynamics to simulate blood flow and pressure in a patient-specific coronary model. However, 3D simulations require extensive effort for model construction and numerical computation, which limits their routine use. In this study we compare (ordered by increasing computational cost/complexity): reduced-order algebraic models of pressure drop across a stenosis; 1D, 2D (multiring) and 3D CFD models; as well as 3D FSI for the computation of FFR in idealized and patient-specific stenosis geometries. We demonstrate the ability of an appropriate reduced order algebraic model to closely predict FFR when compared to FFR from a full 3D simulation. This work was supported by the NIH, Grant No. R01-HL103419.

Rosen's (M,R) system in process algebra.

PubMed

Gatherer, Derek; Galpin, Vashti

2013-11-17

Robert Rosen's Metabolism-Replacement, or (M,R), system can be represented as a compact network structure with a single source and three products derived from that source in three consecutive reactions. (M,R) has been claimed to be non-reducible to its components and algorithmically non-computable, in the sense of not being evaluable as a function by a Turing machine. If (M,R)-like structures are present in real biological networks, this suggests that many biological networks will be non-computable, with implications for those branches of systems biology that rely on in silico modelling for predictive purposes. We instantiate (M,R) using the process algebra Bio-PEPA, and discuss the extent to which our model represents a true realization of (M,R). We observe that under some starting conditions and parameter values, stable states can be achieved. Although formal demonstration of algorithmic computability remains elusive for (M,R), we discuss the extent to which our Bio-PEPA representation of (M,R) allows us to sidestep Rosen's fundamental objections to computational systems biology. We argue that the behaviour of (M,R) in Bio-PEPA shows life-like properties.

Computing chemical organizations in biological networks.

PubMed

Centler, Florian; Kaleta, Christoph; di Fenizio, Pietro Speroni; Dittrich, Peter

2008-07-15

Novel techniques are required to analyze computational models of intracellular processes as they increase steadily in size and complexity. The theory of chemical organizations has recently been introduced as such a technique that links the topology of biochemical reaction network models to their dynamical repertoire. The network is decomposed into algebraically closed and self-maintaining subnetworks called organizations. They form a hierarchy representing all feasible system states including all steady states. We present three algorithms to compute the hierarchy of organizations for network models provided in SBML format. Two of them compute the complete organization hierarchy, while the third one uses heuristics to obtain a subset of all organizations for large models. While the constructive approach computes the hierarchy starting from the smallest organization in a bottom-up fashion, the flux-based approach employs self-maintaining flux distributions to determine organizations. A runtime comparison on 16 different network models of natural systems showed that none of the two exhaustive algorithms is superior in all cases. Studying a 'genome-scale' network model with 762 species and 1193 reactions, we demonstrate how the organization hierarchy helps to uncover the model structure and allows to evaluate the model's quality, for example by detecting components and subsystems of the model whose maintenance is not explained by the model. All data and a Java implementation that plugs into the Systems Biology Workbench is available from http://www.minet.uni-jena.de/csb/prj/ot/tools.

Reviews

NASA Astrophysics Data System (ADS)

2005-11-01

WE RECOMMEND Joule and Watt Meter This versatile tool is aimed at low-voltage DC devices. Wireless datalogger Bluetooth enables data to be downloaded to your computer. WORTH A LOOK Amusement Park Physics This handbook contains teaching materials to excite students. Copper in the Curriculum Two free CDs cover aspects of Key Stages 3, 4 and 5. Launchpad A kit for making 25 devices that fire ping-pong balls. Solar water-heating kit This kit provides a good introduction to green energy. Solar voltaic cell The unit is ideal for Key Stages 1, 2 and 3. Wind turbine kit An impressive turbine that has many educational uses. HANDLE WITH CARE Hurdles and Strategies in the Teaching of Algebra A collection of tips that is really just for maths teachers. WEB WATCH A wealth of resources on the Internet support physics activities for students at amusement parks.

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.

LAPACKrc: Fast linear algebra kernels/solvers for FPGA accelerators

NASA Astrophysics Data System (ADS)

Gonzalez, Juan; Núñez, Rafael C.

2009-07-01

We present LAPACKrc, a family of FPGA-based linear algebra solvers able to achieve more than 100x speedup per commodity processor on certain problems. LAPACKrc subsumes some of the LAPACK and ScaLAPACK functionalities, and it also incorporates sparse direct and iterative matrix solvers. Current LAPACKrc prototypes demonstrate between 40x-150x speedup compared against top-of-the-line hardware/software systems. A technology roadmap is in place to validate current performance of LAPACKrc in HPC applications, and to increase the computational throughput by factors of hundreds within the next few years.

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.

On the ⋆-PRODUCT Quantization and the Duflo Map in Three Dimensions

NASA Astrophysics Data System (ADS)

Rosa, Luigi; Vitale, Patrizia

2012-11-01

We analyze the ⋆-product induced on ℱ(ℝ3) by a suitable reduction of the Moyal product defined on ℱ(ℝ4). This is obtained through the identification ℝ3≃𝔤*, with 𝔤 a three-dimensional Lie algebra. We consider the 𝔰𝔲(2) case, exhibit a matrix basis and realize the algebra of functions on 𝔰𝔲(2)* in such a basis. The relation to the Duflo map is discussed. As an application to quantum mechanics we compute the spectrum of the hydrogen atom.

Methods of mathematical modeling using polynomials of algebra of sets

NASA Astrophysics Data System (ADS)

Kazanskiy, Alexandr; Kochetkov, Ivan

2018-03-01

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

The Geometry of Generations

NASA Astrophysics Data System (ADS)

He, Yang-Hui; Jejjala, Vishnu; Matti, Cyril; Nelson, Brent D.; Stillman, Michael

2015-10-01

We present an intriguing and precise interplay between algebraic geometry and the phenomenology of generations of particles. Using the electroweak sector of the MSSM as a testing ground, we compute the moduli space of vacua as an algebraic variety for multiple generations of Standard Model matter and Higgs doublets. The space is shown to have Calabi-Yau, Grassmannian, and toric signatures, which sensitively depend on the number of generations of leptons, as well as inclusion of Majorana mass terms for right-handed neutrinos. We speculate as to why three generations is special.

Foundations of Tensor Analysis for Students of Physics and Engineering With an Introduction to the Theory of Relativity

NASA Technical Reports Server (NTRS)

Kolecki, Joseph C.

2005-01-01

Tensor analysis is one of the more abstruse, even if one of the more useful, higher math subjects enjoined by students of physics and engineering. It is abstruse because of the intellectual gap that exists between where most physics and engineering mathematics leave off and where tensor analysis traditionally begins. It is useful because of its great generality, computational power, and compact, easy to use, notation. This paper bridges the intellectual gap. It is divided into three parts: algebra, calculus, and relativity. Algebra: In tensor analysis, coordinate independent quantities are sought for applications in physics and engineering. Coordinate independence means that the quantities have such coordinate transformations as to leave them invariant relative to a particular observer s coordinate system. Calculus: Non-zero base vector derivatives contribute terms to dynamical equations that correspond to pseudoaccelerations in accelerated coordinate systems and to curvature or gravity in relativity. These derivatives have a specific general form in tensor analysis. Relativity: Spacetime has an intrinsic geometry. Light is the tool for investigating that geometry. Since the observed geometry of spacetime cannot be made to match the classical geometry of Euclid, Einstein applied another more general geometry differential geometry. The merger of differential geometry and cosmology was accomplished in the theory of relativity. In relativity, gravity is equivalent to curvature.

A linear programming manual

NASA Technical Reports Server (NTRS)

Tuey, R. C.

1972-01-01

Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.

A Process Algebra Approach to Quantum Electrodynamics

NASA Astrophysics Data System (ADS)

Sulis, William

2017-12-01

The process algebra program is directed towards developing a realist model of quantum mechanics free of paradoxes, divergences and conceptual confusions. From this perspective, fundamental phenomena are viewed as emerging from primitive informational elements generated by processes. The process algebra has been shown to successfully reproduce scalar non-relativistic quantum mechanics (NRQM) without the usual paradoxes and dualities. NRQM appears as an effective theory which emerges under specific asymptotic limits. Space-time, scalar particle wave functions and the Born rule are all emergent in this framework. In this paper, the process algebra model is reviewed, extended to the relativistic setting, and then applied to the problem of electrodynamics. A semiclassical version is presented in which a Minkowski-like space-time emerges as well as a vector potential that is discrete and photon-like at small scales and near-continuous and wave-like at large scales. QED is viewed as an effective theory at small scales while Maxwell theory becomes an effective theory at large scales. The process algebra version of quantum electrodynamics is intuitive and realist, free from divergences and eliminates the distinction between particle, field and wave. Computations are carried out using the configuration space process covering map, although the connection to second quantization has not been fully explored.

xPerm: fast index canonicalization for tensor computer algebra

NASA Astrophysics Data System (ADS)

Martín-García, José M.

2008-10-01

We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a combination of a Mathematica package and a C subroutine. The latter performs the most demanding parts of the computations and can be linked from any other program or computer algebra system. We demonstrate with tests and timings the effectively polynomial performance of the Butler-Portugal algorithm with respect to the number of indices, though we also show a case in which it is exponential. Our implementation handles generic tensorial expressions with several dozen indices in hundredths of a second, or one hundred indices in a few seconds, clearly outperforming all other current canonicalizers. The code has been already under intensive testing for several years and has been essential in recent investigations in large-scale tensor computer algebra. Program summaryProgram title: xPerm Catalogue identifier: AEBH_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBH_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 93 582 No. of bytes in distributed program, including test data, etc.: 1 537 832 Distribution format: tar.gz Programming language: C and Mathematica (version 5.0 or higher) Computer: Any computer running C and Mathematica (version 5.0 or higher) Operating system: Linux, Unix, Windows XP, MacOS RAM:: 20 Mbyte Word size: 64 or 32 bits Classification: 1.5, 5 Nature of problem: Canonicalization of indexed expressions with respect to permutation symmetries. Solution method: The Butler-Portugal algorithm. Restrictions: Multiterm symmetries are not considered. Running time: A few seconds with generic expressions of up to 100 indices. The xPermDoc.nb notebook supplied with the distribution takes approximately one and a half hours to execute in full.

Umbral Calculus and Holonomic Modules in Positive Characteristic

NASA Astrophysics Data System (ADS)

Kochubei, Anatoly N.

2006-03-01

In the framework of analysis over local fields of positive characteristic, we develop algebraic tools for introducing and investigating various polynomial systems. In this survey paper we describe a function field version of umbral calculus developed on the basis of a relation of binomial type satisfied by the Carlitz polynomials. We consider modules over the Weyl-Carlitz ring, a function field counterpart of the Weyl algebra. It is shown that some basic objects of function field arithmetic, like the Carlitz module, Thakur's hypergeometric polynomials, and analogs of binomial coefficients arising in the positive characteristic version of umbral calculus, generate holonomic modules.

A Comparison of Solver Performance for Complex Gastric Electrophysiology Models

PubMed Central

Sathar, Shameer; Cheng, Leo K.; Trew, Mark L.

2016-01-01

Computational techniques for solving systems of equations arising in gastric electrophysiology have not been studied for efficient solution process. We present a computationally challenging problem of simulating gastric electrophysiology in anatomically realistic stomach geometries with multiple intracellular and extracellular domains. The multiscale nature of the problem and mesh resolution required to capture geometric and functional features necessitates efficient solution methods if the problem is to be tractable. In this study, we investigated and compared several parallel preconditioners for the linear systems arising from tetrahedral discretisation of electrically isotropic and anisotropic problems, with and without stimuli. The results showed that the isotropic problem was computationally less challenging than the anisotropic problem and that the application of extracellular stimuli increased workload considerably. Preconditioning based on block Jacobi and algebraic multigrid solvers were found to have the best overall solution times and least iteration counts, respectively. The algebraic multigrid preconditioner would be expected to perform better on large problems. PMID:26736543

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.

Reflection states in Ding-Iohara-Miki algebra and brane-web for D-type quiver

NASA Astrophysics Data System (ADS)

Bourgine, J.-E.; Fukuda, M.; Matsuo, Y.; Zhu, R.-D.

2017-12-01

Reflection states are introduced in the vertical and horizontal modules of the Ding-Iohara-Miki (DIM) algebra (quantum toroidal gl_1 ). Webs of DIM representations are in correspondence with ( p, q)-web diagrams of type IIB string theory, under the identification of the algebraic intertwiner of Awata, Feigin and Shiraishi with the refined topological vertex. Extending the correspondence to the vertical reflection states, it is possible to engineer the N=1 quiver gauge theory of D-type (with unitary gauge groups). In this way, the Nekrasov instanton partition function is reproduced from the evaluation of expectation values of intertwiners. This computation leads to the identification of the vertical reflection state with the orientifold plane of string theory. We also provide a translation of this construction in the Iqbal-Kozcaz-Vafa refined topological vertex formalism.

Linear-scaling density-functional simulations of charged point defects in Al2O3 using hierarchical sparse matrix algebra.

PubMed

Hine, N D M; Haynes, P D; Mostofi, A A; Payne, M C

2010-09-21

We present calculations of formation energies of defects in an ionic solid (Al(2)O(3)) extrapolated to the dilute limit, corresponding to a simulation cell of infinite size. The large-scale calculations required for this extrapolation are enabled by developments in the approach to parallel sparse matrix algebra operations, which are central to linear-scaling density-functional theory calculations. The computational cost of manipulating sparse matrices, whose sizes are determined by the large number of basis functions present, is greatly improved with this new approach. We present details of the sparse algebra scheme implemented in the ONETEP code using hierarchical sparsity patterns, and demonstrate its use in calculations on a wide range of systems, involving thousands of atoms on hundreds to thousands of parallel processes.

Application of geometric algebra for the description of polymer conformations.

PubMed

Chys, Pieter

2008-03-14

In this paper a Clifford algebra-based method is applied to calculate polymer chain conformations. The approach enables the calculation of the position of an atom in space with the knowledge of the bond length (l), valence angle (theta), and rotation angle (phi) of each of the preceding bonds in the chain. Hence, the set of geometrical parameters {l(i),theta(i),phi(i)} yields all the position coordinates p(i) of the main chain atoms. Moreover, the method allows the calculation of side chain conformations and the computation of rotations of chain segments. With these features it is, in principle, possible to generate conformations of any type of chemical structure. This method is proposed as an alternative for the classical approach by matrix algebra. It is more straightforward and its final symbolic representation considerably simpler than that of matrix algebra. Approaches for realistic modeling by means of incorporation of energetic considerations can be combined with it. This article, however, is entirely focused at showing the suitable mathematical framework on which further developments and applications can be built.