Tensor computations in computer algebra systems
Korolkova, A V; Sevastyanov, L A
2014-01-01
This paper considers three types of tensor computations. On their basis, we attempt to formulate criteria that must be satisfied by a computer algebra system dealing with tensors. We briefly overview the current state of tensor computations in different computer algebra systems. The tensor computations are illustrated with appropriate examples implemented in specific systems: Cadabra and Maxima.
Computer algebra in systems biology
Laubenbacher, Reinhard
2007-01-01
Systems biology focuses on the study of entire biological systems rather than on their individual components. With the emergence of high-throughput data generation technologies for molecular biology and the development of advanced mathematical modeling techniques, this field promises to provide important new insights. At the same time, with the availability of increasingly powerful computers, computer algebra has developed into a useful tool for many applications. This article illustrates the use of computer algebra in systems biology by way of a well-known gene regulatory network, the Lac Operon in the bacterium E. coli.
Computer Algebra Systems, Pedagogy, and Epistemology
Bosse, Michael J.; Nandakumar, N. R.
2004-01-01
The advent of powerful Computer Algebra Systems (CAS) continues to dramatically affect curricula, pedagogy, and epistemology in secondary and college algebra classrooms. However, epistemological and pedagogical research regarding the role and effectiveness of CAS in the learning of algebra lags behind. This paper investigates concerns regarding…
Pavelle, Richard; And Others
1981-01-01
Describes the nature and use of computer algebra and its applications to various physical sciences. Includes diagrams illustrating, among others, a computer algebra system and flow chart of operation of the Euclidean algorithm. (SK)
Some Unexpected Results Using Computer Algebra Systems.
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…
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…
The Application of a Computer Algebra System as a Tool in College Algebra.
Mayes, Robert L.
1995-01-01
Students (n=61) in an experimental course stressing active student involvement and the use of a computer algebra system scored higher than students (n=76) in a traditional college algebra course on final measures of inductive reasoning, visualization, and problem solving while maintaining equivalent manipulation and computation skills. (Author/MLB)
The Necessary Fundamental Algebraic Competence in the Age of Computer Algebra Systems.
Heugl, Helmut
This lecture addresses the exploration of algebraic fundamental competence by examining the Austrian Computer Algebraic Systems (CAS). Data are used to support answers and conclusions related to two questions that explore the role that instrumental understanding plays in supporting a high level of relational understanding and the idea that…
SD-CAS: Spin Dynamics by Computer Algebra System.
Filip, Xenia; Filip, Claudiu
2010-11-01
A computer algebra tool for describing the Liouville-space quantum evolution of nuclear 1/2-spins is introduced and implemented within a computational framework named Spin Dynamics by Computer Algebra System (SD-CAS). A distinctive feature compared with numerical and previous computer algebra approaches to solving spin dynamics problems results from the fact that no matrix representation for spin operators is used in SD-CAS, which determines a full symbolic character to the performed computations. Spin correlations are stored in SD-CAS as four-entry nested lists of which size increases linearly with the number of spins into the system and are easily mapped into analytical expressions in terms of spin operator products. For the so defined SD-CAS spin correlations a set of specialized functions and procedures is introduced that are essential for implementing basic spin algebra operations, such as the spin operator products, commutators, and scalar products. They provide results in an abstract algebraic form: specific procedures to quantitatively evaluate such symbolic expressions with respect to the involved spin interaction parameters and experimental conditions are also discussed. Although the main focus in the present work is on laying the foundation for spin dynamics symbolic computation in NMR based on a non-matrix formalism, practical aspects are also considered throughout the theoretical development process. In particular, specific SD-CAS routines have been implemented using the YACAS computer algebra package (http://yacas.sourceforge.net), and their functionality was demonstrated on a few illustrative examples.
Motivating Constraints of a Pedagogy-Embedded Computer Algebra System
Dana-Picard, Thierry
2007-01-01
The constraints of a computer algebra system (CAS) generally induce limitations on its usage. Via the pedagogical features implemented in such a system, "motivating constraints" can appear, encouraging advanced theoretical learning, providing a broader mathematical knowledge and more profound mathematical understanding. We discuss this issue,…
THE USE OF COMPUTER ALGEBRA SYSTEMS IN THE TEACHING PROCESS
Directory of Open Access Journals (Sweden)
Mychaylo Paszeczko
2014-11-01
Full Text Available This work discusses computational capabilities of the programs belonging to the CAS (Computer Algebra Systems. A review of commercial and non-commercial software has been done here as well. In addition, there has been one of the programs belonging to the this group (program Mathcad selected and its application to the chosen example has been presented. Computational capabilities and ease of handling were decisive factors for the selection.
Computer Algebra Systems and Theorems on Real Roots of Polynomials
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.)
Computer Algebra Systems: Permitted but Are They Used?
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'…
TRIP: General computer algebra system for celestial mechanics
Laskar, J.; Gastineau, M.
2012-10-01
TRIP is an interactive computer algebra system that is devoted to perturbation series computations, and specially adapted to celestial mechanics. Its development started in 1988, as an upgrade of the special purpose FORTRAN routines elaborated by J. Laskar for the demonstration of the chaotic behavior of the Solar System. TRIP is a mature and efficient tool for handling multivariate generalized power series, and embeds two kernels, a symbolic and a numerical kernel. This numerical kernel communicates with Gnuplot or Grace to plot the graphics and allows one to plot the numerical evaluation of symbolic objects.
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…
Computing the Moore-Penrose Inverse of a Matrix with a Computer Algebra System
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…
Maxima Bridge System: A software interface between Stata and the Maxima computer algebra system
2013-01-01
Maxima is a free and open-source computer algebra system (CAS), namely, software that can perform symbolic computations such as solving equations, determining derivatives of functions, obtaining Taylor series, and manipulating algebraic expressions. In this presentation, I discuss the Maxima Bridge System (MBS), a collection of software that allows Stata to interface with Maxima to use it as an engine for symbolic computation, transfer data from Stata to Maxima, and retrieve results from Maxi...
Algebraic statistics computational commutative algebra in statistics
Pistone, Giovanni; Wynn, Henry P
2000-01-01
Written by pioneers in this exciting new field, Algebraic Statistics introduces the application of polynomial algebra to experimental design, discrete probability, and statistics. It begins with an introduction to Gröbner bases and a thorough description of their applications to experimental design. A special chapter covers the binary case with new application to coherent systems in reliability and two level factorial designs. The work paves the way, in the last two chapters, for the application of computer algebra to discrete probability and statistical modelling through the important concept of an algebraic statistical model.As the first book on the subject, Algebraic Statistics presents many opportunities for spin-off research and applications and should become a landmark work welcomed by both the statistical community and its relatives in mathematics and computer science.
Computer algebra and operators
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.
Applications of computer algebra
1985-01-01
Today, certain computer software systems exist which surpass the computational ability of researchers when their mathematical techniques are applied to many areas of science and engineering. These computer systems can perform a large portion of the calculations seen in mathematical analysis. Despite this massive power, thousands of people use these systems as a routine resource for everyday calculations. These software programs are commonly called "Computer Algebra" systems. They have names such as MACSYMA, MAPLE, muMATH, REDUCE and SMP. They are receiving credit as a computational aid with in creasing regularity in articles in the scientific and engineering literature. When most people think about computers and scientific research these days, they imagine a machine grinding away, processing numbers arithmetically. It is not generally realized that, for a number of years, computers have been performing non-numeric computations. This means, for example, that one inputs an equa tion and obtains a closed for...
Microeconomic theory and computation applying the maxima open-source computer algebra system
Hammock, Michael R
2014-01-01
This book provides a step-by-step tutorial for using Maxima, an open-source multi-platform computer algebra system, to examine the economic relationships that form the core of microeconomics in a way that complements traditional modeling techniques.
Maple (Computer Algebra System) in Teaching Pre-Calculus: Example of Absolute Value Function
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…
Using Two Types of Computer Algebra Systems to Solve Maxwell Optics Problems
Kulyabov, D. S.
2016-01-01
To synthesize Maxwell optics systems, the mathematical apparatus of tensor and vector analysis is generally employed. This mathematical apparatus implies executing a great number of simple stereotyped operations, which are adequately supported by computer algebra systems. In this paper, we distinguish between two stages of working with a mathematical model: model development and model usage. Each of these stages implies its own computer algebra system. As a model problem, we consider the prob...
Multiple Representations for Systems of Linear Equations Via the Computer Algebra System Maple
Directory of Open Access Journals (Sweden)
Dann G. Mallet
2007-02-01
Full Text Available A number of different representational methods exist for presenting the theory of linear equations and associated solution spaces. Discussed in this paper are the findings of a case study where first year undergraduate students were exposed to a new (to the department method of teaching linear systems which used visual, algebraic and data-based representations constructed using the computer algebra system Maple. Positive and negative impacts on the students are discussed as they apply to representational translation and perceived learning.
ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
Hinkelmann, Franziska; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard
2010-01-01
Motivation: Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, bounded Petri nets, and agent-based models. Simulation is a common practice for analyzing discrete models, but many systems are far too large to capture all the relevant dynamical features through simulation alone. Results: We convert discrete models into algebraic models and apply tools from computational algebra to analyze their dynamics. The key feature of biological systems that is exploited by our algorithms is their sparsity: while the number of nodes in a biological network may be quite large, each node is affected only by a small number of other nodes. In our experience with models arising in systems biology and random models, this structure leads to fast computations when using algebraic models, and thus efficient analysis. Availability: All algorithms and methods are available in our package Analysis of Dynamic Algebraic Models (ADAM), a user friendly web-interf...
Teaching of Real Numbers by Using the Archimedes-Cantor Approach and Computer Algebra Systems
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…
Introduction to Redberry: the computer algebra system designed for tensor manipulation
Bolotin, D A
2013-01-01
In this paper we introduce Redberry - an open source computer algebra system designed to manipulate with symbolic tensorial expressions. It implements basic computer algebra system routines as well as complex tools for real computations in physics. Redberry core provides common for majority of computer algebra systems tools for expressions manipulation, generalized on tensorial objects, as well as tensor-specific features: indices symmetries, LaTeX-style input, natural dummy indices handling, multiple index types etc. The high energy physics package includes tools for Feynman diagrams calculation: Dirac and SU(N) traces, Levi-Civita simplifications and tools for one-loop calculations in general field theory. In the present paper we give detailed description of Redberry functionality: from basic manipulations with tensors to real Feynman diagrams calculation, accompanied by many examples. We also introduce graph representation of a tensor - the basic underlying idea of the Redberry architecture, which clarifie...
Computational linear and commutative algebra
Kreuzer, Martin
2016-01-01
This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is not available at all. The authors continue to prese...
Ardıç, Mehmet Alper; Işleyen, Tevfik
2017-04-01
This study discusses a process of material development towards teaching the subject of the graphs of quadratic functions (parabola) by utilizing computer algebra systems. Additionally, the results obtained during and after the process of developing materials are summarized. The last section of the study provides recommendations for teachers and researchers who want to develop computer-assisted instruction materials.
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…
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)…
Buteau, Chantal; Marshall, Neil; Jarvis, Daniel; Lavicza, Zsolt
2010-01-01
We present results of a literature review pilot study (326 papers) regarding the use of Computer Algebra Systems (CAS) in tertiary mathematics education. Several themes that have emerged from the review are discussed: diverse uses of CAS, benefits to student learning, issues of integration and mathematics learning, common and innovative usage of…
A Study of the Use of a Handheld Computer Algebra System in Discrete Mathematics
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…
Introducing a Computer Algebra System in Mathematics Education--Empirical Evidence from Germany
Schmidt, Karsten; Kohler, Anke; Moldenhauer, Wolfgang
2009-01-01
This paper reports on the effects the use of a pocket calculator-based computer algebra system (CAS) has on the performance in mathematics of grade 11 students in Germany. A project started at 8 of about one hundred upper secondary schools in the federal state of Thuringia in 1999; 3 years later the former restrictions on the use of technology in…
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…
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.
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.
An algebra of reversible computation
2016-01-01
We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules, basic reversible processes algebra (BRPA), algebra of reversible communicating processes (ARCP), recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.
An Algebra of Reversible Computation
Yong WANG
2014-01-01
We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules, basic reversible processes algebra (BRPA), algebra of reversible communicating processes (ARCP), recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.
An algebra of reversible computation.
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.
Computations in finite-dimensional Lie algebras
Cohen, A.M.; Graaf, W.A. de; Rónyai, L.
2001-01-01
This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System), within the computer algebra package GAP. A first sketch of the packagecan be found in Cohen and de Graaf[1]. Since then, in a collaborative
Computer algebra in spacetime embedding
Roque, Waldir L
2014-01-01
In this paper we describe an algorithm to determine the vectors normal to a space-time V4 embedded in a pseudo-Euclidean manifold M4+n. An application of this algorithm is given considering the Schwarzchild space-time geometry embedded in a 6 dimensional pseudo-Euclidean manifold, using the algebraic computing system REDUCE.
Inequalities, Assessment and Computer Algebra
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…
Inequalities, Assessment and Computer Algebra
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…
Model Based Control System Design Using SysML, Simulink, and Computer Algebra System
Directory of Open Access Journals (Sweden)
Takashi Sakairi
2013-01-01
Full Text Available The Systems Modeling Language (SysML is a standard, general-purpose, modeling language for model-based systems engineering (MBSE. SysML supports the specification, analysis, and design of a broad range of complex systems such as control systems. The authors demonstrate how they can integrate a SysML modeling tool (IBM Rational Rhapsody with a proprietary simulation tool (MathWorks Simulink and a Computer Algebra System (CAS to validate system specification. The integration with Simulink enables users to perform systems engineering process in a SysML model, while designing continuous control algorithms and plant behavior in Simulink, and to validate the behavior by simulating the overall composition in Simulink. The integration with a CAS enables the evaluation of mathematical constraints defined in SysML parametric diagrams. The authors also show the overall approach using a Dual Clutch Transmission (DCT and a Cruise Control System as examples.
Foerster, A.; Leymann, H. A. M.; Wiersig, J.
2017-03-01
We introduce an equation of motion approach that allows for an approximate evaluation of the time evolution of a quantum system, where the algebraic work to derive the equations of motion is done by the computer. The introduced procedures offer a variety of different types of approximations applicable for finite systems with strong coupling as well as for arbitrary large systems where augmented mean-field theories like the cluster expansion can be applied.
Corrochano, Eduardo Bayro
2010-01-01
This book presents contributions from a global selection of experts in the field. This useful text offers new insights and solutions for the development of theorems, algorithms and advanced methods for real-time applications across a range of disciplines. Written in an accessible style, the discussion of all applications is enhanced by the inclusion of numerous examples, figures and experimental analysis. Features: provides a thorough discussion of several tasks for image processing, pattern recognition, computer vision, robotics and computer graphics using the geometric algebra framework; int
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)
Applications of Computer Algebra Conference
Martínez-Moro, Edgar
2017-01-01
The Applications of Computer Algebra (ACA) conference covers a wide range of topics from Coding Theory to Differential Algebra to Quantam Computing, focusing on the interactions of these and other areas with the discipline of Computer Algebra. This volume provides the latest developments in the field as well as its applications in various domains, including communications, modelling, and theoretical physics. The book will appeal to researchers and professors of computer algebra, applied mathematics, and computer science, as well as to engineers and computer scientists engaged in research and development.
ADAM: analysis of discrete models of biological systems using computer algebra.
Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard
2011-07-20
Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web
Directory of Open Access Journals (Sweden)
Svetoslav Markov
2005-12-01
Full Text Available This survey paper aims to promote certain novel mathematical tools, such as computer algebra systems, enclosure methods and interval analysis, to the mathematical modelling and optimization of biotechnological processes.
Computations in finite-dimensional Lie algebras
Directory of Open Access Journals (Sweden)
A. M. Cohen
1997-12-01
Full Text Available This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System, within the computer algebra package GAP. A first sketch of the package can be found in Cohen and de Graaf[1]. Since then, in a collaborative effort with G. Ivanyos, the authors have continued to develop algorithms which were implemented in ELIAS by the second author. These activities are part of a bigger project, called ACELA and financed by STW, the Dutch Technology Foundation, which aims at an interactive book on Lie algebras (cf. Cohen and Meertens [2]. This paper gives a global description of the main ways in which to present Lie algebras on a computer. We focus on the transition from a Lie algebra abstractly given by an array of structure constants to a Lie algebra presented as a subalgebra of the Lie algebra of n×n matrices. We describe an algorithm typical of the structure analysis of a finite-dimensional Lie algebra: finding a Levi subalgebra of a Lie algebra.
ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
Directory of Open Access Journals (Sweden)
Blekherman Grigoriy
2011-07-01
Full Text Available Abstract Background Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. Results We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM, which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Conclusions Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides
Kim, Joshua; Guan, Huaiqun; Gersten, David; Zhang, Tiezhi
2013-01-01
Tetrahedron beam computed tomography (TBCT) performs volumetric imaging using a stack of fan beams generated by a multiple pixel X-ray source. While the TBCT system was designed to overcome the scatter and detector issues faced by cone beam computed tomography (CBCT), it still suffers the same large cone angle artifacts as CBCT due to the use of approximate reconstruction algorithms. It has been shown that iterative reconstruction algorithms are better able to model irregular system geometries and that algebraic iterative algorithms in particular have been able to reduce cone artifacts appearing at large cone angles. In this paper, the SART algorithm is modified for the use with the different TBCT geometries and is tested using both simulated projection data and data acquired using the TBCT benchtop system. The modified SART reconstruction algorithms were able to mitigate the effects of using data generated at large cone angles and were also able to reconstruct CT images without the introduction of artifacts due to either the longitudinal or transverse truncation in the data sets. Algebraic iterative reconstruction can be especially useful for dual-source dual-detector TBCT, wherein the cone angle is the largest in the center of the field of view.
Directory of Open Access Journals (Sweden)
Joshua Kim
2013-01-01
Full Text Available Tetrahedron beam computed tomography (TBCT performs volumetric imaging using a stack of fan beams generated by a multiple pixel X-ray source. While the TBCT system was designed to overcome the scatter and detector issues faced by cone beam computed tomography (CBCT, it still suffers the same large cone angle artifacts as CBCT due to the use of approximate reconstruction algorithms. It has been shown that iterative reconstruction algorithms are better able to model irregular system geometries and that algebraic iterative algorithms in particular have been able to reduce cone artifacts appearing at large cone angles. In this paper, the SART algorithm is modified for the use with the different TBCT geometries and is tested using both simulated projection data and data acquired using the TBCT benchtop system. The modified SART reconstruction algorithms were able to mitigate the effects of using data generated at large cone angles and were also able to reconstruct CT images without the introduction of artifacts due to either the longitudinal or transverse truncation in the data sets. Algebraic iterative reconstruction can be especially useful for dual-source dual-detector TBCT, wherein the cone angle is the largest in the center of the field of view.
Introduction to computational linear algebra
Nassif, Nabil; Erhel, Jocelyne
2015-01-01
Introduction to Computational Linear Algebra introduces the reader with a background in basic mathematics and computer programming to the fundamentals of dense and sparse matrix computations with illustrating examples. The textbook is a synthesis of conceptual and practical topics in ""Matrix Computations."" The book's learning outcomes are twofold: to understand state-of-the-art computational tools to solve matrix computations problems (BLAS primitives, MATLAB® programming) as well as essential mathematical concepts needed to master the topics of numerical linear algebra. It is suitable for s
Directory of Open Access Journals (Sweden)
S. Aslı Özgün-Koca
2014-02-01
Full Text Available This study investigated the views of Turkish and U.S. prospective mathematics teachers on the use of advanced calculators with Computer Algebra Systems (CAS in algebra instruction. The possible roles for CAS suggested by Heid and Edwards (2001, along with the black and white box dichotomy and Technological, Pedagogical, and Content Knowledge model were used as conceptual frameworks. An open-ended questionnaire and group interviews revealed participants' views and beliefs about why, when, and how they prefer to use CAS. Results revealed the similarities and differences in Turkish and U.S. participants' views regarding the use of CAS when teaching and learning of algebraic manipulation.Key Words: Mathematics education, teachers' views, technology
MODEL IDENTIFICATION AND COMPUTER ALGEBRA.
Bollen, Kenneth A; Bauldry, Shawn
2010-10-07
Multiequation models that contain observed or latent variables are common in the social sciences. To determine whether unique parameter values exist for such models, one needs to assess model identification. In practice analysts rely on empirical checks that evaluate the singularity of the information matrix evaluated at sample estimates of parameters. The discrepancy between estimates and population values, the limitations of numerical assessments of ranks, and the difference between local and global identification make this practice less than perfect. In this paper we outline how to use computer algebra systems (CAS) to determine the local and global identification of multiequation models with or without latent variables. We demonstrate a symbolic CAS approach to local identification and develop a CAS approach to obtain explicit algebraic solutions for each of the model parameters. We illustrate the procedures with several examples, including a new proof of the identification of a model for handling missing data using auxiliary variables. We present an identification procedure for Structural Equation Models that makes use of CAS and that is a useful complement to current methods.
Computing Gröbner Bases within Linear Algebra
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.
DEFF Research Database (Denmark)
Perram, John; Andersen, Morten; Ellerkilde, Lars
2005-01-01
This paper discusses experience with alternative assessment strategies for an introductory course in dynamical systems, where the use of computer algebra and calculus is fully integrated into the learning process, so that the standard written examination would not be appropriate. Instead, students...
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…
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…
Computational triadic algebras of signs
Energy Technology Data Exchange (ETDEWEB)
Zadrozny, W. [T.J. Watson Research Center, Yorktown Heights, NY (United States)
1996-12-31
We present a finite model of Peirce`s ten classes of signs. We briefly describe Peirce`s taxonomy of signs; we prove that any finite collection of signs can be extended to a finite algebra of signs in which all interpretants are themselves being interpreted; and we argue that Peirce`s ten classes of signs can be defined using constraints on algebras of signs. The paper opens the possibility of defining multimodal cognitive agents using Peirce`s classes of signs, and is a first step towards building a computational logic of signs based on Peirce`s taxonomies.
Process algebra for Hybrid systems
Bergstra, J.A.; Middelburg, C.A.
2008-01-01
We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and Bergstra [Theoretical Computer
Computational algebraic geometry of epidemic models
Rodríguez Vega, Martín.
2014-06-01
Computational Algebraic Geometry is applied to the analysis of various epidemic models for Schistosomiasis and Dengue, both, for the case without control measures and for the case where control measures are applied. The models were analyzed using the mathematical software Maple. Explicitly the analysis is performed using Groebner basis, Hilbert dimension and Hilbert polynomials. These computational tools are included automatically in Maple. Each of these models is represented by a system of ordinary differential equations, and for each model the basic reproductive number (R0) is calculated. The effects of the control measures are observed by the changes in the algebraic structure of R0, the changes in Groebner basis, the changes in Hilbert dimension, and the changes in Hilbert polynomials. It is hoped that the results obtained in this paper become of importance for designing control measures against the epidemic diseases described. For future researches it is proposed the use of algebraic epidemiology to analyze models for airborne and waterborne diseases.
Arrangement Computation for Planar Algebraic Curves
Berberich, Eric; Kobel, Alexander; Sagraloff, Michael
2011-01-01
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition of the plane. Compared to previous approaches, we improve in two main aspects: Firstly, we significantly reduce the amount of exact operations, that is, our algorithms only uses resultant and gcd as purely symbolic operations. Secondly, we introduce a new hybrid method in the lifting step of our algorithm which combines the usage of a certified numerical complex root solver and information derived from the resultant computation. Additionally, we never consider any coordinate transformation and the output is also given with respect to the initial coordinate system. We implemented our algorithm as a prototypical package of the C++-library CGAL. Our implementation exploits graphics hardware to expedite the resultant and gcd...
Some Applications of Algebraic System Solving
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…
Computers in nonassociative rings and algebras
Beck, Robert E
1977-01-01
Computers in Nonassociative Rings and Algebras provides information pertinent to the computational aspects of nonassociative rings and algebras. This book describes the algorithmic approaches for solving problems using a computer.Organized into 10 chapters, this book begins with an overview of the concept of a symmetrized power of a group representation. This text then presents data structures and other computational methods that may be useful in the field of computational algebra. Other chapters consider several mathematical ideas, including identity processing in nonassociative algebras, str
Linear algebra on high-performance computers
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.; Sorensen, D.C.
1986-01-01
This paper surveys work recently done at Argonne National Laboratory in an attempt to discover ways to construct numerical software for high-performance computers. The numerical algorithms are taken from several areas of numerical linear algebra. We discuss certain architectural features of advanced-computer architectures that will affect the design of algorithms. The technique of restructuring algorithms in terms of certain modules is reviewed. This technique has proved successful in obtaining a high level of transportability without severe loss of performance on a wide variety of both vector and parallel computers. The module technique is demonstrably effective for dense linear algebra problems. However, in the case of sparse and structured problems it may be difficult to identify general modules that will be as effective. New algorithms have been devised for certain problems in this category. We present examples in three important areas: banded systems, sparse QR factorization, and symmetric eigenvalue problems. 32 refs., 10 figs., 6 tabs.
A Deductive Approach towards Reasoning about Algebraic Transition Systems
Directory of Open Access Journals (Sweden)
Jun Fu
2015-01-01
Full Text Available Algebraic transition systems are extended from labeled transition systems by allowing transitions labeled by algebraic equations for modeling more complex systems in detail. We present a deductive approach for specifying and verifying algebraic transition systems. We modify the standard dynamic logic by introducing algebraic equations into modalities. Algebraic transition systems are embedded in modalities of logic formulas which specify properties of algebraic transition systems. The semantics of modalities and formulas is defined with solutions of algebraic equations. A proof system for this logic is constructed to verify properties of algebraic transition systems. The proof system combines with inference rules decision procedures on the theory of polynomial ideals to reduce a proof-search problem to an algebraic computation problem. The proof system proves to be sound but inherently incomplete. Finally, a typical example illustrates that reasoning about algebraic transition systems with our approach is feasible.
Energy Technology Data Exchange (ETDEWEB)
Abhyankar, Shrirang [Argonne National Lab. (ANL), Argonne, IL (United States); Anitescu, Mihai [Argonne National Lab. (ANL), Argonne, IL (United States); Constantinescu, Emil [Argonne National Lab. (ANL), Argonne, IL (United States); Zhang, Hong [Argonne National Lab. (ANL), Argonne, IL (United States)
2016-03-31
Sensitivity analysis is an important tool to describe power system dynamic behavior in response to parameter variations. It is a central component in preventive and corrective control applications. The existing approaches for sensitivity calculations, namely, finite-difference and forward sensitivity analysis, require a computational effort that increases linearly with the number of sensitivity parameters. In this work, we investigate, implement, and test a discrete adjoint sensitivity approach whose computational effort is effectively independent of the number of sensitivity parameters. The proposed approach is highly efficient for calculating trajectory sensitivities of larger systems and is consistent, within machine precision, with the function whose sensitivity we are seeking. This is an essential feature for use in optimization applications. Moreover, our approach includes a consistent treatment of systems with switching, such as DC exciters, by deriving and implementing the adjoint jump conditions that arise from state and time-dependent discontinuities. The accuracy and the computational efficiency of the proposed approach are demonstrated in comparison with the forward sensitivity analysis approach.
Instrumentation of ICT-tools : the case of algebra in a computer algebra environment
Drijvers, P.; Herwaarden, van O.A.
2001-01-01
This paper describes a classroom experiment using hand held computer algebra for the learning of algebra. During a five week period students of the ninth grade (14-15 years old) used a symbolic calculator for solving systems of equations that contained parameters. In doing so, the aim was to develop
Algebraic Structure of Dynamical Systems
2017-05-22
Scholar project report; no. 461 (2017) ALGEBRAIC STRUCTURE OF DYNAMICAL SYSTEMS by MIDN 1/C James P. Talisse United States Naval Academy Annapolis, MD...based on the structure of algebraic objects associated with it. In this project we study two algebraic objects, centralizers and topological full groups...group completely defines the system up to time reversal. We apply numerical estimates to draw conclusions about the algebraic properties of this group
Computer Algebra Recipes for Mathematical Physics
Enns, Richard H
2005-01-01
Over two hundred novel and innovative computer algebra worksheets or "recipes" will enable readers in engineering, physics, and mathematics to easily and rapidly solve and explore most problems they encounter in their mathematical physics studies. While the aim of this text is to illustrate applications, a brief synopsis of the fundamentals for each topic is presented, the topics being organized to correlate with those found in traditional mathematical physics texts. The recipes are presented in the form of stories and anecdotes, a pedagogical approach that makes a mathematically challenging subject easier and more fun to learn. Key features: * Uses the MAPLE computer algebra system to allow the reader to easily and quickly change the mathematical models and the parameters and then generate new answers * No prior knowledge of MAPLE is assumed; the relevant MAPLE commands are introduced on a need-to-know basis * All MAPLE commands are indexed for easy reference * A classroom-tested story/anecdote format is use...
Computer Program For Linear Algebra
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.
Computer Program For Linear Algebra
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.
Parallel computations in linear algebra. II
Energy Technology Data Exchange (ETDEWEB)
Faddeeva, V.N.; Faddeev, D.K.
1982-05-01
For pt.I, see Kibernetika, vol.13, no.6, p.28 (1977). Considerable effort was devoted in the surveyed period to automatic decomposition of sequential algorithms, or rather of procedures or subprograms written in the algorithmic languages ALGOL or FORTRAN. The authors do not consider this body of research, they only note that, on the one hand, the available linear algebra subprograms included in Eispack provide convenient objects for testing various approaches to automatic construction of parallel programs and, on the other, an important state in this activity is the development of methods for fast and efficient solution of linear recurrences, which reduce to solving systems of linear equations with band-triangular matrix (in particular, of sufficiently small width). This article reflects the penetration of the parallelism ideas into the computational methods of linear algebra in recent years. 74 references.
Drijvers, P.H.M.
2003-01-01
It is well known that algebra is a difficult topic in the school mathematics curriculum, and is often experienced as a stumbling-block. One of the directions in which solutions to the problems with the learning of algebra can be sought is the integration of information technology (IT) into mathematics education. Although originally not developed for educational purposes, a computer algebra system is an IT tool that seems promising because of its algebraic power. The basic aim of this study, t...
Directory of Open Access Journals (Sweden)
M. Legua
2008-01-01
Full Text Available In signal processing, a pulse means a rapid change in the amplitude of a signal from a baseline value to a higher or lower value, followed by a rapid return to the baseline value. A square wave function may be viewed as a pulse that repeats its occurrence periodically but the return to the baseline value takes some time to happen. When these periodic functions act as inputs in dynamic systems, the standard tool commonly used to solve the associated initial value problem (IVP is Laplace transform and its inverse. We show how a computer algebra system may also provide the solution of these IVP straight forwardly by adequately introducing the periodic input.
Examinations in the Final Year of Transition to Mathematical Methods Computer Algebra System (CAS)
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…
Methods of Computer Algebra and the Many Bodies Algebra
Grebenikov, E. A.; Kozak-Skoworodkina, D.; Yakubiak, M.
2001-07-01
The monograph concerns with qualitative methoids in n>3 bodies restricted problems by methods of computer algebra. The book consists of 4 chapters. The first two chapters contain the theory of homographic solutions in the many bodies problem. Other two chapters concern with Lyapunov stability of new solutions of differential equations based on KAM -theory. The computer method of the Birkhoff's normalisation method of the hamiltonians for the restricted 4, 5, 6, and 7 bodies is presented in detail. The book is designed for scientific researchers, doctorants, and students of the Physical-Mathematical departments. It could be used as well in University courses of qualitative theory of differential equations.
Elements of algebraic coding systems
Cardoso da Rocha, Jr, Valdemar
2014-01-01
Elements of Algebraic Coding Systems is an introductory textto algebraic coding theory. In the first chapter, you'll gain insideknowledge of coding fundamentals, which is essential for a deeperunderstanding of state-of-the-art coding systems.This book is a quick reference for those who are unfamiliar withthis topic, as well as for use with specific applications such as cryptographyand communication. Linear error-correcting block codesthrough elementary principles span eleven chapters of the text.Cyclic codes, some finite field algebra, Goppa codes, algebraic decodingalgorithms, and applications in public-key cryptography andsecret-key cryptography are discussed, including problems and solutionsat the end of each chapter. Three appendices cover the Gilbertbound and some related derivations, a derivation of the Mac-Williams' identities based on the probability of undetected error,and two important tools for algebraic decoding-namely, the finitefield Fourier transform and the Euclidean algorithm for polynomials.
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
Berberich, Eric; Kobel, Alexander; Sagraloff, Michael
2012-01-01
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition. From a high-level perspective, the overall method splits into two main subroutines, namely an algorithm denoted Bisolve to isolate the real solutions of a zero-dimensional bivariate system, and an algorithm denoted GeoTop to analyze a single algebraic curve. Compared to existing approaches based on elimination techniques, we considerably improve the corresponding lifting steps in both subroutines. As a result, generic position of the input system is never assumed, and thus our algorithm never demands for any change of coordinates. In addition, we significantly limit the types of involved exact operations, that is, we only use resultant and gcd computations as purely symbolic operations. The latter results are achieved by combini...
Partially ordered algebraic systems
Fuchs, Laszlo
2011-01-01
Originally published in an important series of books on pure and applied mathematics, this monograph by a distinguished mathematician explores a high-level area in algebra. It constitutes the first systematic summary of research concerning partially ordered groups, semigroups, rings, and fields. The self-contained treatment features numerous problems, complete proofs, a detailed bibliography, and indexes. It presumes some knowledge of abstract algebra, providing necessary background and references where appropriate. This inexpensive edition of a hard-to-find systematic survey will fill a gap i
Multilinear Computing and Multilinear Algebraic Geometry
2016-08-10
algebra : linear systems, least squares, eigevalue problems, singular value problems, determinant evaluation, low-rank approximations, etc — problems...intractability to move beyond linear algebra , substantiating what the PI had proposed. High-resolution MRI with tensors: In another piece of work... applications . One reason is that we found out that many statistical estimation problems ( linear regression, errors-in-variables regression, principal components
Implementing Computer Algebra Enabled Questions for the Assessment and Learning of Mathematics
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.…
Algebraic Systems and Pushdown Automata
Petre, Ion; Salomaa, Arto
We concentrate in this chapter on the core aspects of algebraic series, pushdown automata, and their relation to formal languages. We choose to follow here a presentation of their theory based on the concept of properness. We introduce in Sect. 2 some auxiliary notions and results needed throughout the chapter, in particular the notions of discrete convergence in semirings and C-cycle free infinite matrices. In Sect. 3 we introduce the algebraic power series in terms of algebraic systems of equations. We focus on interconnections with context-free grammars and on normal forms. We then conclude the section with a presentation of the theorems of Shamir and Chomsky-Schützenberger. We discuss in Sect. 4 the algebraic and the regulated rational transductions, as well as some representation results related to them. Section 5 is dedicated to pushdown automata and focuses on the interconnections with classical (non-weighted) pushdown automata and on the interconnections with algebraic systems. We then conclude the chapter with a brief discussion of some of the other topics related to algebraic systems and pushdown automata.
Computer Assisted Assessment in Elementary Algebra
Bouhineau, Denis; Bronner, Alain; Chaachoua, Hamid; Mezerette, Sophie; Nicaud, Jean-François
2005-01-01
reviewed article for online journal available : http://mathstore.ac.uk/articles/maths-caa-series/nov2005/; Experiences and points of view from the APLUSIX project about Computer Assisted Assessment in Elementary Algebra (http://mathstore.ac.uk/articles/maths-caa-series/nov2005/)
Computer Algebra, Instrumentation and the Anthropological Approach
Monaghan, John
2007-01-01
This article considers research and scholarship on the use of computer algebra in mathematics education following the instrumentation and the anthropological approaches. It outlines what these approaches are, positions them with regard to other approaches, examines tensions between the two approaches and makes suggestions for how work in this…
Advanced Algebra and Trigonometry: Supplemental Computer Units.
Dotseth, Karen
A set of computer-oriented, supplemental activities is offered which can be used with a course in advanced algebra and trigonometry. The activities involve use of the BASIC programming language; it is assumed that the teacher is familiar with programming in BASIC. Students will learn some BASIC; however, the intent is not to develop proficient…
Identifying Causal Effects with Computer Algebra
García-Puente, Luis David; Sullivant, Seth
2010-01-01
The long-standing identification problem for causal effects in graphical models has many partial results but lacks a systematic study. We show how computer algebra can be used to either prove that a causal effect can be identified, generically identified, or show that the effect is not generically identifiable. We report on the results of our computations for linear structural equation models, where we determine precisely which causal effects are generically identifiable for all graphs on three and four vertices.
Computing Numerical Singular Points of Plane Algebraic Curves
Institute of Scientific and Technical Information of China (English)
LUO ZHONG-XUAN; FENG ER-BAO; HU WEN-YU
2012-01-01
Given an irreducible plane algebraic curve of degree d ≥ 3,we compute its numerical singular points,determine their multiplicities,and count the number of distinct tangents at each to decide whether the singular points are ordinary.The numerical procedures rely on computing numerical solutions of polynomial systems by homotopy continuation method and a reliable method that calculates multiple roots of the univariate polynomials accurately using standard machine precision.It is completely different from the traditional symbolic computation and provides singular points and their related properties of some plane algebraic curves that the symbolic software Maple cannot work out.Without using multiprecision arithmetic,extensive numerical experiments show that our numerical procedures are accurate,efficient and robust,even if the coefficients of plane algebraic curves are inexact.
Using a Computer Algebra System to Facilitate the Learning of Mathematical Induction
McAndrew, Alasdair
2010-01-01
Mathematical induction is one of the major proof techniques taught to mathematics students in the first years of their undergraduate degrees. In addition to its importance to mathematics, induction is also required for computer science and related disciplines. However, even if the concepts of a proof by induction are taught and understood, many…
Computing Algebraic Immunity by Reconfigurable Computer
2012-09-01
the linear system, then the amount of computation required is O (( n d )ω) , where ω is the well–known “exponent of Gaussian reduction” (ω = 3 ( Gauss ...x2, x3) = x1x2 ⊕ x1x3 ⊕ x2x3. The top half of Table 2 shows the minterm canonical form of f̄ . Here, the first (leftmost) column represents all
Calculus and design of discrete velocity models using computer algebra
Babovsky, Hans; Grabmeier, Johannes
2016-11-01
In [2, 3], a framework for a calculus with Discrete Velocity Models (DVM) has been derived. The rotatonal symmetry of the discrete velocities can be modelled algebraically by the action of the cyclic group C4 - or including reflections of the dihedral group D4. Taking this point of view, the linearized collision operator can be represented in a compact form as a matrix of elements in the group algebra. Or in other words, by choosing a special numbering it exhibits a certain block structure which lets it appear as a matrix with entries in a certain polynomial ring. A convenient way for approaching such a structure is the use of a computer algebra system able to treat these (predefined) algebraic structures. We used the computer algebra system FriCAS/AXIOM [4, 5] for the generation of the velocity and the collision sets and for the analysis of the structure of the collision operator. Concerning the fluid dynamic limit, the system provides the characterization of sets of collisions and their contribution to the flow parameters. It allows the design of rotationally invariant symmetric models for prescribed Prandtl numbers. The implementation in FriCAS/AXIOM is explained and its results for a 25-velocity model are presented.
Classical versus Computer Algebra Methods in Elementary Geometry
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…
Dynamical systems of algebraic origin
Schmidt, Klaus
1995-01-01
Although much of classical ergodic theory is concerned with single transformations and one-parameter flows, the subject inherits from statistical mechanics not only its name, but also an obligation to analyze spatially extended systems with multidimensional symmetry groups. However, the wealth of concrete and natural examples which has contributed so much to the appeal and development of classical dynamics, is noticeably absent in this more general theory. The purpose of this book is to help remedy this scarcity of explicit examples by introducing a class of continuous Zd-actions diverse enough to exhibit many of the new phenomena encountered in the transition from Z to Zd, but which nevertheless lends itself to systematic study: the Zd-actions by automorphisms of compact, abelian groups. One aspect of these actions, not surprising in itself but quite striking in its extent and depth nonetheless, is the connection with commutative algebra and arithmetical algebraic geometry. The algebraic framework resulting...
Algebraic methods in system theory
Brockett, R. W.; Willems, J. C.; Willsky, A. S.
1975-01-01
Investigations on problems of the type which arise in the control of switched electrical networks are reported. The main results concern the algebraic structure and stochastic aspects of these systems. Future reports will contain more detailed applications of these results to engineering studies.
Primitive parallel operations for computational linear algebra
Energy Technology Data Exchange (ETDEWEB)
Panetta, J.
1985-01-01
This work is a small step in the direction of code portability over parallel and vector machines. The proposal consists of a style of programming and a set of parallel operators built over abstract data types. Objects and operators are directed to the Computational Linear Algebra area, although the principles of the proposal can be applied to any other area. A subset of the operators was implemented on a 64-processor, distributed memory MIMD machine, and the results are that computationally intensive operators achieve asymptotically optimal speed-ups, but data movement operators are inefficient, some even intrinsically sequential.
Non-commutative computer algebra and molecular computing
Directory of Open Access Journals (Sweden)
Svetlana Cojocaru
2001-12-01
Full Text Available Non-commutative calculations are considered from the molecular computing point of view. The main idea is that one can get more advantage in using molecular computing for non-commutative computer algebra compared with a commutative one. The restrictions, connected with the coefficient handling in Grobner basis calculations are investigated. Semigroup and group cases are considered as more appropriate. SAGBI basis constructions and possible implementations are discussed.
Non-commutative computer algebra and molecular computing
2001-01-01
Non-commutative calculations are considered from the molecular computing point of view. The main idea is that one can get more advantage in using molecular computing for non-commutative computer algebra compared with a commutative one. The restrictions, connected with the coefficient handling in Grobner basis calculations are investigated. Semigroup and group cases are considered as more appropriate. SAGBI basis constructions and possible implementations are discussed.
Cox, David A; O'Shea, Donal
2015-01-01
This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry—the elimination theorem, the extension theorem, the closure theorem, and the Nullstellensatz—this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D). The book may serve as a first or second course in undergraduate abstract algebra and, with some supplementation perhaps, for beginning graduate level courses in algebraic geom...
Process algebra for hybrid systems
Bergstra, J.A.; Middelburg, C.A.
2005-01-01
We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg (Process Algebra with Timing, Springer,Berlin, 2002, Chapter 4), and the process algebra with propositional signals from Baeten and Bergstra(Theoret. Com
The design of linear algebra libraries for high performance computers
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J. [Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science]|[Oak Ridge National Lab., TN (United States); Walker, D.W. [Oak Ridge National Lab., TN (United States)
1993-08-01
This paper discusses the design of linear algebra libraries for high performance computers. Particular emphasis is placed on the development of scalable algorithms for MIMD distributed memory concurrent computers. A brief description of the EISPACK, LINPACK, and LAPACK libraries is given, followed by an outline of ScaLAPACK, which is a distributed memory version of LAPACK currently under development. The importance of block-partitioned algorithms in reducing the frequency of data movement between different levels of hierarchical memory is stressed. The use of such algorithms helps reduce the message startup costs on distributed memory concurrent computers. Other key ideas in our approach are the use of distributed versions of the Level 3 Basic Linear Algebra Subprograms (BLAS) as computational building blocks, and the use of Basic Linear Algebra Communication Subprograms (BLACS) as communication building blocks. Together the distributed BLAS and the BLACS can be used to construct higher-level algorithms, and hide many details of the parallelism from the application developer. The block-cyclic data distribution is described, and adopted as a good way of distributing block-partitioned matrices. Block-partitioned versions of the Cholesky and LU factorizations are presented, and optimization issues associated with the implementation of the LU factorization algorithm on distributed memory concurrent computers are discussed, together with its performance on the Intel Delta system. Finally, approaches to the design of library interfaces are reviewed.
Flanders, Harley
1975-01-01
Algebra presents the essentials of algebra with some applications. The emphasis is on practical skills, problem solving, and computational techniques. Topics covered range from equations and inequalities to functions and graphs, polynomial and rational functions, and exponentials and logarithms. Trigonometric functions and complex numbers are also considered, together with exponentials and logarithms.Comprised of eight chapters, this book begins with a discussion on the fundamentals of algebra, each topic explained, illustrated, and accompanied by an ample set of exercises. The proper use of a
Quantum Q systems: from cluster algebras to quantum current algebras
Di Francesco, Philippe; Kedem, Rinat
2017-02-01
This paper gives a new algebraic interpretation for the algebra generated by the quantum cluster variables of the A_r quantum Q-system (Di Francesco and Kedem in Int Math Res Not IMRN 10:2593-2642, 2014). We show that the algebra can be described as a quotient of the localization of the quantum algebra U_{√{q}}({n}[u,u^{-1}])subset U_{√{q}}(widehat{{sl}}_2), in the Drinfeld presentation. The generating current is made up of a subset of the cluster variables which satisfy the Q-system, which we call fundamental. The other cluster variables are given by a quantum determinant-type formula, and are polynomials in the fundamental generators. The conserved quantities of the discrete evolution (Di Francesco and Kedem in Adv Math 228(1):97-152, 2011) described by quantum Q-system generate the Cartan currents at level 0, in a non-standard polarization. The rest of the quantum affine algebra is also described in terms of cluster variables.
Quantum Q systems: from cluster algebras to quantum current algebras
Di Francesco, Philippe; Kedem, Rinat
2016-11-01
This paper gives a new algebraic interpretation for the algebra generated by the quantum cluster variables of the A_r quantum Q-system (Di Francesco and Kedem in Int Math Res Not IMRN 10:2593-2642, 2014). We show that the algebra can be described as a quotient of the localization of the quantum algebra U_{√{q}}({{n}}[u,u^{-1}])subset U_{√{q}}(widehat{{{sl}}}_2) , in the Drinfeld presentation. The generating current is made up of a subset of the cluster variables which satisfy the Q-system, which we call fundamental. The other cluster variables are given by a quantum determinant-type formula, and are polynomials in the fundamental generators. The conserved quantities of the discrete evolution (Di Francesco and Kedem in Adv Math 228(1):97-152, 2011) described by quantum Q-system generate the Cartan currents at level 0, in a non-standard polarization. The rest of the quantum affine algebra is also described in terms of cluster variables.
Discrete event systems in dioid algebra and conventional algebra
Declerck, Philippe
2013-01-01
This book concerns the use of dioid algebra as (max, +) algebra to treat the synchronization of tasks expressed by the maximum of the ends of the tasks conditioning the beginning of another task - a criterion of linear programming. A classical example is the departure time of a train which should wait for the arrival of other trains in order to allow for the changeover of passengers.The content focuses on the modeling of a class of dynamic systems usually called "discrete event systems" where the timing of the events is crucial. Events are viewed as sudden changes in a process which i
Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge
DEFF Research Database (Denmark)
Lauritzen, Niels
2005-01-01
We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.......We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge....
Computations with reachable elements in simple Lie algebras
de Graaf, Willem
2010-01-01
We report on some computations with reachable elements in simple Lie algebras of exceptional type within the SLA package of GAP4. These computations confirm the classification of such elements by Elashvili and Grelaud. Secondly they answer a question from Panyushev. Thirdly they show in what way a recent result of Yakimova for the Lie algebras of classical type extends to the exceptional types.
Thomas Decomposition of Algebraic and Differential Systems
Bächler, Thomas; Lange-Hegermann, Markus; Robertz, Daniel
2010-01-01
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new algorithm. For algebraic systems simplicity means triangularity, squarefreeness and non-vanishing initials. For differential systems the algorithm provides not only algebraic simplicity but also involutivity. The algorithm has been implemented in Maple.
Computational algebraic topology-based video restoration
Rochel, Alban; Ziou, Djemel; Auclair-Fortier, Marie-Flavie
2005-03-01
This paper presents a scheme for video denoising by diffusion of gray levels, based on the Computational Algebraic Topology (CAT) image model. The diffusion approach is similar to the one used to denoise static images. Rather than using the heat transfer partial differential equation, discretizing it and solving it by a purely mathematical process, the CAT approach considers the global expression of the heat transfer and decomposes it into elementary physical laws. Some of these laws describe conservative relations, leading to error-free expressions, whereas others depend on metric quantities and require approximation. This scheme allows for a physical interpretation for each step of the resolution process. We propose a nonlinear and an anisotropic diffusion algorithms based on the extension to video of an existing 2D algorithm thanks to the flexibility of the topological support. Finally it is validated with experimental results.
A Course in Algebra and Trigonometry with Computer Programming.
Beavers, Mildred; And Others
This textbook was developed by the Colorado Schools Computing Science (CSCS) Curriculum Development Project. It can be used with high school or college students in an integrated presentation of second-year algebra, trigonometry, and beginning computer programing. (MK)
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…
Optical Linear Algebra for Computational Light Transport
O'Toole, Matthew
Active illumination refers to optical techniques that use controllable lights and cameras to analyze the way light propagates through the world. These techniques confer many unique imaging capabilities (e.g. high-precision 3D scanning, image-based relighting, imaging through scattering media), but at a significant cost; they often require long acquisition and processing times, rely on predictive models for light transport, and cease to function when exposed to bright ambient sunlight. We develop a mathematical framework for describing and analyzing such imaging techniques. This framework is deeply rooted in numerical linear algebra, and models the transfer of radiant energy through an unknown environment with the so-called light transport matrix. Performing active illumination on a scene equates to applying a numerical operator on this unknown matrix. The brute-force approach to active illumination follows a two-step procedure: (1) optically measure the light transport matrix and (2) evaluate the matrix operator numerically. This approach is infeasible in general, because the light transport matrix is often much too large to measure, store, and analyze directly. Using principles from optical linear algebra, we evaluate these matrix operators in the optical domain, without ever measuring the light transport matrix in the first place. Specifically, we explore numerical algorithms that can be implemented partially or fully with programmable optics. These optical algorithms provide solutions to many longstanding problems in computer vision and graphics, including the ability to (1) photo-realistically change the illumination conditions of a given photo with only a handful of measurements, (2) accurately capture the 3D shape of objects in the presence of complex transport properties and strong ambient illumination, and (3) overcome the multipath interference problem associated with time-of-flight cameras. Most importantly, we introduce an all-new imaging regime
Global computational algebraic topology approach for diffusion
Auclair-Fortier, Marie-Flavie; Ziou, Djemel; Allili, Madjid
2004-05-01
One physical process involved in many computer vision problems is the heat diffusion process. Such Partial differential equations are continuous and have to be discretized by some techniques, mostly mathematical processes like finite differences or finite elements. The continuous domain is subdivided into sub-domains in which there is only one value. The diffusion equation comes from the energy conservation then it is valid on a whole domain. We use the global equation instead of discretize the PDE obtained by a limit process on this global equation. To encode these physical global values over pixels of different dimensions, we use a computational algebraic topology (CAT)-based image model. This model has been proposed by Ziou and Allili and used for the deformation of curves and optical flow. It introduces the image support as a decomposition in terms of points, edges, surfaces, volumes, etc. Images of any dimensions can then be handled. After decomposing the physical principles of the heat transfer into basic laws, we recall the CAT-based image model and use it to encode the basic laws. We then present experimental results for nonlinear graylevel diffusion for denoising, ensuring thin features preservation.
Clifford algebras, noncommutative tori and universal quantum computers
Vlasov, A Yu
2001-01-01
Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary base. The non-binary case is related with application of some extension of idea of Clifford algebras. It is noncommutative torus defined by polynomial algebraic relations of order l. For l=2 it coincides with definition of Clifford algebra. Here is presented the joint consideration and comparison of both cases together with some discussion on possible physical consequences.
Computational commutative and non-commutative algebraic geometry
Cojocaru, S; Ufnarovski, V
2005-01-01
This publication gives a good insight in the interplay between commutative and non-commutative algebraic geometry. The theoretical and computational aspects are the central theme in this study. The topic is looked at from different perspectives in over 20 lecture reports. It emphasizes the current trends in commutative and non-commutative algebraic geometry and algebra. The contributors to this publication present the most recent and state-of-the-art progresses which reflect the topic discussed in this publication. Both researchers and graduate students will find this book a good source of information on commutative and non-commutative algebraic geometry.
Introduction to applied algebraic systems
Reilly, Norman R
2009-01-01
This upper-level undergraduate textbook provides a modern view of algebra with an eye to new applications that have arisen in recent years. A rigorous introduction to basic number theory, rings, fields, polynomial theory, groups, algebraic geometry and elliptic curves prepares students for exploring their practical applications related to storing, securing, retrieving and communicating information in the electronic world. It will serve as a textbook for an undergraduate course in algebra with a strong emphasis on applications. The book offers a brief introduction to elementary number theory as
CRPC research into linear algebra software for high performance computers
Energy Technology Data Exchange (ETDEWEB)
Choi, J.; Walker, D.W. [Oak Ridge National Lab., TN (United States). Mathematical Sciences Section; Dongarra, J.J. [Univ. of Tennessee, Knoxville, TN (United States). Dept. of Computer Science]|[Oak Ridge National Lab., TN (United States). Mathematical Sciences Section; Pozo, R. [Univ. of Tennessee, Knoxville, TN (United States). Dept. of Computer Science; Sorensen, D.C. [Rice Univ., Houston, TX (United States). Dept. of Computational and Applied Mathematics
1994-12-31
In this paper the authors look at a number of approaches being investigated in the Center for Research on Parallel Computation (CRPC) to develop linear algebra software for high-performance computers. These approaches are exemplified by the LAPACK, templates, and ARPACK projects. LAPACK is a software library for performing dense and banded linear algebra computations, and was designed to run efficiently on high-performance computers. The authors focus on the design of the distributed-memory version of LAPACK, and on an object-oriented interface to LAPACK.
Involutive characteristic sets of algebraic partial differential equation systems
Institute of Scientific and Technical Information of China (English)
陈玉福; 高小山
2003-01-01
This paper presents an algorithm to reduce a nonlinear algebraic partial differential equation system into the involutive characteristic set with respect to an abstract involutive prolongation direction, which covers the existing algorithms based on Riquier method, Thomas method, and Pommaret method. It also provides new algorithms for computing involutive characteristic sets due to the existence of new involutive directions. Experiments show that these new algorithms may be used to significantly reduce the computational steps in Wu-Ritt's characteristic set method for algebraic partial differential equations.
Computer-Aided College Algebra: Learning Components that Students Find Beneficial
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…
Pfister, Gerhard; Schulze, Mathias
2017-01-01
This book arose from a conference on “Singularities and Computer Algebra” which was held at the Pfalz-Akademie Lambrecht in June 2015 in honor of Gert-Martin Greuel’s 70th birthday. This unique volume presents a collection of recent original research by some of the leading figures in singularity theory on a broad range of topics including topological and algebraic aspects, classification problems, deformation theory and resolution of singularities. At the same time, the articles highlight a variety of techniques, ranging from theoretical methods to practical tools from computer algebra. Greuel himself made major contributions to the development of both singularity theory and computer algebra. With Gerhard Pfister and Hans Schönemann, he developed the computer algebra system SINGULAR, which has since become the computational tool of choice for many singularity theorists. The book addresses researchers whose work involves singularity theory and computer algebra from the PhD to expert level.
On Algebraic Approach in Quadratic Systems
Directory of Open Access Journals (Sweden)
Matej Mencinger
2011-01-01
Full Text Available When considering friction or resistance, many physical processes are mathematically simulated by quadratic systems of ODEs or discrete quadratic dynamical systems. Probably the most important problem when such systems are applied in engineering is the stability of critical points and (nonchaotic dynamics. In this paper we consider homogeneous quadratic systems via the so-called Markus approach. We use the one-to-one correspondence between homogeneous quadratic dynamical systems and algebra which was originally introduced by Markus in (1960. We resume some connections between the dynamics of the quadratic systems and (algebraic properties of the corresponding algebras. We consider some general connections and the influence of power-associativity in the corresponding quadratic system.
Algebraic Systems Biology: A Case Study for the Wnt Pathway.
Gross, Elizabeth; Harrington, Heather A; Rosen, Zvi; Sturmfels, Bernd
2016-01-01
Steady-state analysis of dynamical systems for biological networks gives rise to algebraic varieties in high-dimensional spaces whose study is of interest in their own right. We demonstrate this for the shuttle model of the Wnt signaling pathway. Here, the variety is described by a polynomial system in 19 unknowns and 36 parameters. It has degree 9 over the parameter space. This case study explores multistationarity, model comparison, dynamics within regions of the state space, identifiability, and parameter estimation, from a geometric point of view. We employ current methods from computational algebraic geometry, polyhedral geometry, and combinatorics.
Proton computed tomography images with algebraic reconstruction
Bruzzi, M.; Civinini, C.; Scaringella, M.; Bonanno, D.; Brianzi, M.; Carpinelli, M.; Cirrone, G. A. P.; Cuttone, G.; Presti, D. Lo; Maccioni, G.; Pallotta, S.; Randazzo, N.; Romano, F.; Sipala, V.; Talamonti, C.; Vanzi, E.
2017-02-01
A prototype of proton Computed Tomography (pCT) system for hadron-therapy has been manufactured and tested in a 175 MeV proton beam with a non-homogeneous phantom designed to simulate high-contrast material. BI-SART reconstruction algorithms have been implemented with GPU parallelism, taking into account of most likely paths of protons in matter. Reconstructed tomography images with density resolutions r.m.s. down to 1% and spatial resolutions CT in hadron-therapy.
Algebraic analysis of kinematics of multibody systems
Directory of Open Access Journals (Sweden)
S. Piipponen
2013-02-01
Full Text Available The constructive commutative algebra is very useful in the kinematical analysis of the mechanisms because a large class of systems can be described using polynomial equations. We show that one can analyze quite complicated systems using a sort of divide and conquer strategy to decompose the system, and hence the configuration space, into simpler parts. The key observation is that it seems that typically systems indeed have a lot of distinct components, but usually only one of them is physically relevant. Hence if one finds the equations describing the component of interest the analysis of this system can be surprisingly simple compared to the original system. In particular typically the possible singularities of the original system disappear when one restricts the attention to the relevant component. On the technical side we show that some basic constraints used to define joints in 3 dimensional mechanisms can be decomposed to simpler parts. This has significant practical consequences because using these fundamental decompositions when writing the equations for complicated mechanisms decreases dramatically the complexity of the required computations.
A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy (II)
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…
Constraint algebra for interacting quantum systems
Fubini, S.; Roncadelli, M.
1988-04-01
We consider relativistic constrained systems interacting with external fields. We provide physical arguments to support the idea that the quantum constraint algebra should be the same as in the free quantum case. For systems with ordering ambiguities this principle is essential to obtain a unique quantization. This is shown explicitly in the case of a relativistic spinning particle, where our assumption about the constraint algebra plus invariance under general coordinate transformations leads to a unique S-matrix. On leave from Dipartimento di Fisica Nucleare e Teorica, Università di Pavia and INFN, I-27100 Pavia, Italy.
Strategies and Computer Projects for Teaching Linear Algebra.
Pecuch-Herrero, Marta
2000-01-01
Adopts several strategies for successful teaching and learning of linear algebra, which consist of a set of computer projects allowing students to explore new concepts, make conjectures, apply theorems, and work on applied projects of their choice. The resulting improvement in student learning has been remarkable. (Contains 12 references.)…
Solving Tensor Structured Problems with Computational Tensor Algebra
Morozov, Oleksii
2010-01-01
Since its introduction by Gauss, Matrix Algebra has facilitated understanding of scientific problems, hiding distracting details and finding more elegant and efficient ways of computational solving. Today's largest problems, which often originate from multidimensional data, might profit from even higher levels of abstraction. We developed a framework for solving tensor structured problems with tensor algebra that unifies concepts from tensor analysis, multilinear algebra and multidimensional signal processing. In contrast to the conventional matrix approach, it allows the formulation of multidimensional problems, in a multidimensional way, preserving structure and data coherence; and the implementation of automated optimizations of solving algorithms, based on the commutativity of all tensor operations. Its ability to handle large scientific tasks is showcased by a real-world, 4D medical imaging problem, with more than 30 million unknown parameters solved on a current, inexpensive hardware. This significantly...
Continuous analog of multiplicative algebraic reconstruction technique for computed tomography
Tateishi, Kiyoko; Yamaguchi, Yusaku; Abou Al-Ola, Omar M.; Kojima, Takeshi; Yoshinaga, Tetsuya
2016-03-01
We propose a hybrid dynamical system as a continuous analog to the block-iterative multiplicative algebraic reconstruction technique (BI-MART), which is a well-known iterative image reconstruction algorithm for computed tomography. The hybrid system is described by a switched nonlinear system with a piecewise smooth vector field or differential equation and, for consistent inverse problems, the convergence of non-negatively constrained solutions to a globally stable equilibrium is guaranteed by the Lyapunov theorem. Namely, we can prove theoretically that a weighted Kullback-Leibler divergence measure can be a common Lyapunov function for the switched system. We show that discretizing the differential equation by using the first-order approximation (Euler's method) based on the geometric multiplicative calculus leads to the same iterative formula of the BI-MART with the scaling parameter as a time-step of numerical discretization. The present paper is the first to reveal that a kind of iterative image reconstruction algorithm is constructed by the discretization of a continuous-time dynamical system for solving tomographic inverse problems. Iterative algorithms with not only the Euler method but also the Runge-Kutta methods of lower-orders applied for discretizing the continuous-time system can be used for image reconstruction. A numerical example showing the characteristics of the discretized iterative methods is presented.
Algebraic structure and Poisson method for a weakly nonholonomic system
Institute of Scientific and Technical Information of China (English)
无
2011-01-01
The algebraic structure and the Poisson method for a weakly nonholonomic system are studied.The differential equations of motion of the system can be written in a contravariant algebra form and its algebraic structure is discussed.The Poisson theory for the systems which possess Lie algebra structure is generalized to the weakly nonholonomic system.An example is given to illustrate the application of the result.
PyCox: Computing with (finite) Coxeter groups and Iwahori-Hecke algebras
Geck, Meinolf
2012-01-01
We introduce the computer algebra package {\\sf PyCox}, written entirely in the {\\sf Python} language. It implements a set of algorithms - in a spirit similar to the older {\\sf CHEVIE} system - for working with Coxeter groups and Hecke algebras. This includes a new variation of the traditional algorithm for computing Kazhdan-Lusztig cells and $W$-graphs, which works efficiently for all groups of rank $\\leq 8$ (except $E_8$). Our experiments suggest a re-definition of Lusztig's "special" representations which, conjecturally, should also apply to the unequal parameter case.
Classical spectrum generating algebra of the Kepler–Coulomb system and action-angle variables
Energy Technology Data Exchange (ETDEWEB)
Kuru, Ş., E-mail: kuru@science.ankara.edu.tr [Department of Physics, Faculty of Science, Ankara University, 06100 Ankara (Turkey); Negro, J., E-mail: jnegro@fta.uva.es [Departamento de Física Teórica, Atómica y Óptica, Universidad de Valladolid, 47071 Valladolid (Spain)
2012-01-09
The classical spectrum generating algebra for the one-dimensional Kepler–Coulomb system is computed and a set of two corresponding constants of motion depending explicitly on time is obtained. Such constants supply the solution to the motion in an algebraic way. The connection of the spectrum generating algebra and the action-angle variables of the system is also shown. -- Highlights: ► The spectrum generating algebra for classical (and quantum) 1D Kepler–Coulomb problem is constructed. ► It allows to find constants of motion depending explicitly on time. ► It leads to an algebraic solution of the motion. ► This algebra is related to the action-angle variables of the classical system.
The Effect of an Intelligent Tutoring System (ITS) on Student Achievement in Algebraic Expression
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…
A Geometric Algebra Perspective On Quantum Computational Gates And Universality In Quantum Computing
Cafaro, Carlo
2010-01-01
We investigate the utility of geometric (Clifford) algebras (GA) methods in two specific applications to quantum information science. First, using the multiparticle spacetime algebra (MSTA, the geometric algebra of a relativistic configuration space), we present an explicit algebraic description of one and two-qubit quantum states together with a MSTA characterization of one and two-qubit quantum computational gates. Second, using the above mentioned characterization and the GA description of the Lie algebras SO(3) and SU(2) based on the rotor group Spin+(3, 0) formalism, we reexamine Boykin's proof of universality of quantum gates. We conclude that the MSTA approach does lead to a useful conceptual unification where the complex qubit space and the complex space of unitary operators acting on them become united, with both being made just by multivectors in real space. Finally, the GA approach to rotations based on the rotor group does bring conceptual and computational advantages compared to standard vectoria...
Revisiting Newtonian and Non-Newtonian Fluid Mechanics Using Computer Algebra
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,…
Revisiting Newtonian and Non-Newtonian Fluid Mechanics Using Computer Algebra
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,…
INPUT-OUTPUT STRUCTURE OF LINEAR-DIFFERENTIAL ALGEBRAIC SYSTEMS
KUIJPER, M; SCHUMACHER, JM
1993-01-01
Systems of linear differential and algebraic equations occur in various ways, for instance, as a result of automated modeling procedures and in problems involving algebraic constraints, such as zero dynamics and exact model matching. Differential/algebraic systems may represent an input-output relat
Symmetric linear systems - An application of algebraic systems theory
Hazewinkel, M.; Martin, C.
1983-01-01
Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.
Symmetric linear systems - An application of algebraic systems theory
Hazewinkel, M.; Martin, C.
1983-01-01
Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.
Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers
Energy Technology Data Exchange (ETDEWEB)
Nataf, J.M.; Winkelmann, F.
1992-09-01
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 these methods to solving the partial differential equations for two-dimensional heat flow is illustrated.
Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers
Energy Technology Data Exchange (ETDEWEB)
Nataf, J.M.; Winkelmann, F.
1992-09-01
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 these methods to solving the partial differential equations for two-dimensional heat flow is illustrated.
Linear algebra and probability for computer science applications
Davis, Ernest
2012-01-01
MATLABDesk calculator operations Booleans Nonstandard numbers Loops and conditionals Script file Functions Variable scope and parameter passingI: Linear Algebra Vectors Definition of vectors Applications of vectorsBasic operations on vectorsDot productVectors in MATLAB: Basic operationsPlotting vectors in MATLABVectors in other programming languagesMatrices Definition of matrices Applications of matrices Simple operations on matrices Multiplying a matrix times a vector Linear transformation Systems of linear equations Matrix multiplication Vectors as matrices Algebraic properties of matrix mul
Case Study on Algebraic Software Methodologies for Scientific Computing
Directory of Open Access Journals (Sweden)
Magne Haveraaen
2000-01-01
Full Text Available The use of domain specific languages and appropriate software architectures are currently seen as the way to enhance reusability and improve software productivity. Here we outline a use of algebraic software methodologies and advanced program constructors to improve the abstraction level of software for scientific computing. This leads us to the language of coordinate free numerics as an alternative to the traditional coordinate dependent array notation. This provides the backdrop for the three accompanying papers: Coordinate Free Programming of Computational Fluid Dynamics Problems, centered around an example of using coordinate free numerics, Machine and Collection Abstractions for User-Implemented Data-Parallel Programming, exploiting the higher abstraction level when parallelising code, and An Algebraic Programming Style for Numerical Software and its Optimization, looking at high-level transformations enabled by the domain specific programming style.
Application of Computer Algebra in Solving Chaffee Infante Equation
Xie, Fu-Ding; Liu, Xiao-Dan; Sun, Xiao-Peng; Tang, Di
2008-04-01
In this paper, a series of two line-soliton solutions and double periodic solutions of Chaffee Infante equation have been obtained by using a new transformation. Unlike the existing methods which are used to find multiple soliton solutions of nonlinear partial differential equations, this approach is constructive and pure algebraic. The results found here are tested on computer and therefore their validity is ensured.
Prime factorization using quantum annealing and computational algebraic geometry
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.
Prime factorization using quantum annealing and computational algebraic geometry
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
Tabak, John
2004-01-01
Looking closely at algebra, its historical development, and its many useful applications, Algebra examines in detail the question of why this type of math is so important that it arose in different cultures at different times. The book also discusses the relationship between algebra and geometry, shows the progress of thought throughout the centuries, and offers biographical data on the key figures. Concise and comprehensive text accompanied by many illustrations presents the ideas and historical development of algebra, showcasing the relevance and evolution of this branch of mathematics.
Multilinear Computing and Multilinear Algebraic Geometry
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...Multi-Valued Data, Springer-Verlag, Berlin Heidel- berg, 2014. [14] C. J. Hillar and L.-H. Lim, “Most tensor problems are NP-hard,” J. ACM , 60 (2013...Data, Springer-Verlag, Berlin Heidelberg, 2014. C.J. Hillar and L.-H. Lim, "Most tensor problems are NP-hard," Journal of the ACM , 60 (2013), no. 6, Art
Polynomial algebra of discrete models in systems biology.
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.
Logic and algebraic structures in quantum computing
Eskandarian, Ali; Harizanov, Valentina S
2016-01-01
Arising from a special session held at the 2010 North American Annual Meeting of the Association for Symbolic Logic, this volume is an international cross-disciplinary collaboration with contributions from leading experts exploring connections across their respective fields. Themes range from philosophical examination of the foundations of physics and quantum logic, to exploitations of the methods and structures of operator theory, category theory, and knot theory in an effort to gain insight into the fundamental questions in quantum theory and logic. The book will appeal to researchers and students working in related fields, including logicians, mathematicians, computer scientists, and physicists. A brief introduction provides essential background on quantum mechanics and category theory, which, together with a thematic selection of articles, may also serve as the basic material for a graduate course or seminar.
Using computer algebra and SMT-solvers to analyze a mathematical model of cholera propagation
Trujillo Arredondo, Mariana
2014-06-01
We analyze a mathematical model for the transmission of cholera. The model is already defined and involves variables such as the pathogen agent, which in this case is the bacterium Vibrio cholera, and the human population. The human population is divided into three classes: susceptible, infectious and removed. Using Computer Algebra, specifically Maple we obtain two equilibrium states: the disease free state and the endemic state. Using Maple it is possible to prove that the disease free state is locally asymptotically stable if and only if R0 1. Using the package Red-Log of the Computer algebra system Reduce and the SMT-Solver Z3Py it is possible to obtain numerical conditions for the model. The formula for the basic reproductive number makes a synthesis with all epidemic parameters in the model. Also it is possible to make numerical simulations which are very illustrative about the epidemic patters that are expected to be observed in real situations. We claim that these kinds of software are very useful in the analysis of epidemic models given that the symbolic computation provides algebraic formulas for the basic reproductive number and such algebraic formulas are very useful to derive control measures. For other side, computer algebra software is a powerful tool to make the stability analysis for epidemic models given that the all steps in the stability analysis can be made automatically: finding the equilibrium points, computing the jacobian, computing the characteristic polynomial for the jacobian, and applying the Routh-Hurwitz theorem to the characteristic polynomial. Finally, using SMT-Solvers is possible to make automatically checks of satisfiability, validity and quantifiers elimination being these computations very useful to analyse complicated epidemic models.
Institute of Scientific and Technical Information of China (English)
无
2004-01-01
Through most of Greek history, mathematicians concentrated on geometry, although Euclid considered the theory of numbers. The Greek mathematician Diophantus (3rd century),however, presented problems that had to be solved by what we would today call algebra. His book is thus the first algebra text.
The Cuntz algebra Q_N and C*-algebras of product systems
DEFF Research Database (Denmark)
Hong, Jeong Hee; Larsen, Nadia S.; Szymanski, Wojciech
2011-01-01
We consider a product system over the multiplicative group semigroup N^x of Hilbert bimodules which is implicit in work of S. Yamashita and of the second named author. We prove directly, using universal properties, that the associated Nica-Toeplitz algebra is an extension of the C*-algebra Q...
Developing ontological model of computational linear algebra - preliminary considerations
Wasielewska, K.; Ganzha, M.; Paprzycki, M.; Lirkov, I.
2013-10-01
The aim of this paper is to propose a method for application of ontologically represented domain knowledge to support Grid users. The work is presented in the context provided by the Agents in Grid system, which aims at development of an agent-semantic infrastructure for efficient resource management in the Grid. Decision support within the system should provide functionality beyond the existing Grid middleware, specifically, help the user to choose optimal algorithm and/or resource to solve a problem from a given domain. The system assists the user in at least two situations. First, for users without in-depth knowledge about the domain, it should help them to select the method and the resource that (together) would best fit the problem to be solved (and match the available resources). Second, if the user explicitly indicates the method and the resource configuration, it should "verify" if her choice is consistent with the expert recommendations (encapsulated in the knowledge base). Furthermore, one of the goals is to simplify the use of the selected resource to execute the job; i.e., provide a user-friendly method of submitting jobs, without required technical knowledge about the Grid middleware. To achieve the mentioned goals, an adaptable method of expert knowledge representation for the decision support system has to be implemented. The selected approach is to utilize ontologies and semantic data processing, supported by multicriterial decision making. As a starting point, an area of computational linear algebra was selected to be modeled, however, the paper presents a general approach that shall be easily extendable to other domains.
The Virasoro vertex algebra and factorization algebras on Riemann surfaces
Williams, Brian
2017-08-01
This paper focuses on the connection of holomorphic two-dimensional factorization algebras and vertex algebras which has been made precise in the forthcoming book of Costello-Gwilliam. We provide a construction of the Virasoro vertex algebra starting from a local Lie algebra on the complex plane. Moreover, we discuss an extension of this factorization algebra to a factorization algebra on the category of Riemann surfaces. The factorization homology of this factorization algebra is computed as the correlation functions. We provide an example of how the Virasoro factorization algebra implements conformal symmetry of the beta-gamma system using the method of effective BV quantization.
Construction of the elliptic Gaudin system based on Lie algebra
Institute of Scientific and Technical Information of China (English)
CAO Li-ke; LIANG Hong; PENG Dan-tao; YANG Tao; YUE Rui-hong
2007-01-01
Gaudin model is a very important integrable model in both quantum field theory and condensed matter physics.The integrability of Gaudin models is related to classical r-matrices of simple Lie algebras and semi-simple Lie algebra.Since most of the constructions of Gaudin models works concerned mainly on rational and trigonometric Gaudin algebras or just in a particular Lie algebra as an alternative to the matrix entry calculations often presented, in this paper we give our calculations in terms of a basis of the typical Lie algebra, An, Bn, Cn, Dn, and we calculate a classical r-matrix for the elliptic Gaudin system with spin.
Algebraic structure and Poisson's theory of mechanico-electrical systems
Institute of Scientific and Technical Information of China (English)
Liu Hong-Ji; Tang Yi-Fa; Fu Jing-Li
2006-01-01
The algebraic structure and Poisson's integral theory of mechanico-electrical systems are studied.The Hamilton canonical equations and generalized Hamilton canonical equations and their the contravariant algebraic forms for mechanico-electrical systems are obtained.The Lie algebraic structure and the Poisson's integral theory of Lagrange mechanico-electrical systems are derived.The Lie algebraic structure admitted and Poisson's integral theory of the Lagrange-Maxwell mechanico-electrical systems are presented.Two examples are presented to illustrate these results.
Geometric algebra and information geometry for quantum computational software
Cafaro, Carlo
2017-03-01
The art of quantum algorithm design is highly nontrivial. Grover's search algorithm constitutes a masterpiece of quantum computational software. In this article, we use methods of geometric algebra (GA) and information geometry (IG) to enhance the algebraic efficiency and the geometrical significance of the digital and analog representations of Grover's algorithm, respectively. Specifically, GA is used to describe the Grover iterate and the discretized iterative procedure that exploits quantum interference to amplify the probability amplitude of the target-state before measuring the query register. The transition from digital to analog descriptions occurs via Stone's theorem which relates the (unitary) Grover iterate to a suitable (Hermitian) Hamiltonian that controls Schrodinger's quantum mechanical evolution of a quantum state towards the target state. Once the discrete-to-continuos transition is completed, IG is used to interpret Grover's iterative procedure as a geodesic path on the manifold of the parametric density operators of pure quantum states constructed from the continuous approximation of the parametric quantum output state in Grover's algorithm. Finally, we discuss the dissipationless nature of quantum computing, recover the quadratic speedup relation, and identify the superfluity of the Walsh-Hadamard operation from an IG perspective with emphasis on statistical mechanical considerations.
Wang, Dongming
2012-10-01
This article provides algebraic settings of the stability criteria of Nyquist and Popov and the circle criterion for closed-loop linear control systems with linear or nonlinear feedback whose transfer functions are rational ones with integer coefficients. The proposed settings make use of algebraic methods of parametric curve implicitisation, real root isolation, symbolic integration and quantifier elimination and allow one to derive exact stability conditions for feedback control systems with symbolic computation. An example is presented to illustrate the algebraic approach and its effectiveness. Some numerical stability results obtained previously are confirmed.
Sepanski, Mark R
2010-01-01
Mark Sepanski's Algebra is a readable introduction to the delightful world of modern algebra. Beginning with concrete examples from the study of integers and modular arithmetic, the text steadily familiarizes the reader with greater levels of abstraction as it moves through the study of groups, rings, and fields. The book is equipped with over 750 exercises suitable for many levels of student ability. There are standard problems, as well as challenging exercises, that introduce students to topics not normally covered in a first course. Difficult problems are broken into manageable subproblems
Norén, Patrik
2013-01-01
Algebraic statistics brings together ideas from algebraic geometry, commutative algebra, and combinatorics to address problems in statistics and its applications. Computer algebra provides powerful tools for the study of algorithms and software. However, these tools are rarely prepared to address statistical challenges and therefore new algebraic results need often be developed. This way of interplay between algebra and statistics fertilizes both disciplines. Algebraic statistics is a relativ...
Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations
Koutschan, Christoph; Schoeberl, Joachim
2011-01-01
We consider the numerical discretization of the time-domain Maxwell's equations with an energy-conserving discontinuous Galerkin finite element formulation. This particular formulation allows for higher order approximations of the electric and magnetic field. Special emphasis is placed on an efficient implementation which is achieved by taking advantage of recurrence properties and the tensor-product structure of the chosen shape functions. These recurrences have been derived symbolically with computer algebra methods reminiscent of the holonomic systems approach.
Assessing Elementary Algebra with STACK
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…
Computer Algebra Algorithms for Special Functions in Particle Physics
Ablinger, Jakob
2013-01-01
This work deals with special nested objects arising in massive higher order perturbative calculations in renormalizable quantum field theories. On the one hand we work with nested sums such as harmonic sums and their generalizations (S-sums, cyclotomic harmonic sums, cyclotomic S-sums) and on the other hand we treat iterated integrals of the Poincar\\'e and Chen-type, such as harmonic polylogarithms and their generalizations (multiple polylogarithms, cyclotomic harmonic polylogarithms). The iterated integrals are connected to the nested sums via (generalizations of) the Mellin-transformation and we show how this transformation can be computed. We derive algebraic and structural relations between the nested sums as well as relations between the values of the sums at infinity and connected to it the values of the iterated integrals evaluated at special constants. In addition we state algorithms to compute asymptotic expansions of these nested objects and we state an algorithm which rewrites certain types of nest...
Evolving MultiAlgebras unify all usual sequential computation models
Grigorieff, Serge
2010-01-01
It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some type do not constitute a natural class among all ASMs. We modify Gurevich's notion of ASM to that of EMA ("Evolving MultiAlgebra") by replacing the program (which is a syntactic object) by a semantic object: a functional which has to be very simply definable over the static part of the ASM. We prove that very natural classes of EMAs correspond via "literal identifications" to slight extensions of the usual machine models and also to grammar models. Though we modify these models, we keep their computation approach: only some contingencies are modified. Thus, EMAs appear as the mathematical model unifying all kinds of sequential computation paradigms.
On Split Lie Algebras with Symmetric Root Systems
Indian Academy of Sciences (India)
Antonio J Calderón Martín
2008-08-01
We develop techniques of connections of roots for split Lie algebras with symmetric root systems. We show that any of such algebras is of the form $L=\\mathcal{U}+\\sum_j I_j$ with $\\mathcal{U}$ a subspace of the abelian Lie algebra and any $I_j$ a well described ideal of , satisfying $[I_j,I_k]=0$ if $j≠ k$. Under certain conditions, the simplicity of is characterized and it is shown that is the direct sum of the family of its minimal ideals, each one being a simple split Lie algebra with a symmetric root system and having all its nonzero roots connected.
Institute of Scientific and Technical Information of China (English)
2008-01-01
Using functional derivative technique in quantum field theory, the algebraic dy-namics approach for solution of ordinary differential evolution equations was gen-eralized to treat partial differential evolution equations. The partial differential evo-lution equations were lifted to the corresponding functional partial differential equations in functional space by introducing the time translation operator. The functional partial differential evolution equations were solved by algebraic dynam-ics. The algebraic dynamics solutions are analytical in Taylor series in terms of both initial functions and time. Based on the exact analytical solutions, a new nu-merical algorithm—algebraic dynamics algorithm was proposed for partial differ-ential evolution equations. The difficulty of and the way out for the algorithm were discussed. The application of the approach to and computer numerical experi-ments on the nonlinear Burgers equation and meteorological advection equation indicate that the algebraic dynamics approach and algebraic dynamics algorithm are effective to the solution of nonlinear partial differential evolution equations both analytically and numerically.
Institute of Scientific and Technical Information of China (English)
WANG Shundin; ZHANG Hua
2008-01-01
Using functional derivative technique In quantum field theory,the algebraic dy-namics approach for solution of ordinary differential evolution equations was gen-eralized to treat partial differential evolution equations.The partial differential evo-lution equations were lifted to the corresponding functional partial differential equations in functional space by Introducing the time translation operator.The functional partial differential evolution equations were solved by algebraic dynam-ics.The algebraic dynamics solutions are analytical In Taylor series In terms of both initial functions and time.Based on the exact analytical solutions,a new nu-merical algorithm-algebraic dynamics algorithm was proposed for partial differ-ential evolution equations.The difficulty of and the way out for the algorithm were discussed.The application of the approach to and computer numerical experi-ments on the nonlinear Burgers equation and meteorological advection equation indicate that the algebraic dynamics approach and algebraic dynamics algorithm are effective to the solution of nonlinear partial differential evolution equations both analytically and numerically.
Integrable systems in the realm of algebraic geometry
Vanhaecke, Pol
2001-01-01
This book treats the general theory of Poisson structures and integrable systems on affine varieties in a systematic way. Special attention is drawn to algebraic completely integrable systems. Several integrable systems are constructed and studied in detail and a few applications of integrable systems to algebraic geometry are worked out. In the second edition some of the concepts in Poisson geometry are clarified by introducting Poisson cohomology; the Mumford systems are constructed from the algebra of pseudo-differential operators, which clarifies their origin; a new explanation of the multi Hamiltonian structure of the Mumford systems is given by using the loop algebra of sl(2); and finally Goedesic flow on SO(4) is added to illustrate the linearizatin algorith and to give another application of integrable systems to algebraic geometry.
Prospectus for the development of a linear algebra library for high-performance computers
Energy Technology Data Exchange (ETDEWEB)
Demmell, J.; Dongarra, J.J.; Du Croz, J.; Greenbaum, A.; Hammarling, S.; Sorensen, D.
1987-09-01
We propose to design and implement a transportable linear algebra library in Fortran 77 for efficient use on high-performance computers. The library is intended to provide a uniform set of subroutines to solve the most common linear algebra problems and to run efficiently on a wide range of architectures. This library, which will be freely accessible via computer network, not only will ease code development, make codes more portable among machines of different architectures, and increase efficiency, but also will provide tools for evaluating computer performance. The library will be based on the well-known and widely used LINPACK and EISPACK packages for linear equation solving, eigenvalue problems, and linear least squares. LINPACK and EISPACK have provided an important infrastructure for scientific computing on serial machines, but they were not designed to exploit the profusion of parallel and vector architectures not becoming available. We propose to restructure the algorithms in terms of calls to a small number of extended Basic Linear algebra Subroutines each of which implements a basic operation such as matrix multiplication, rank-k matrix updates, and the solution of triangular systems. These operations can be optimized for each architecture, but the underlying numerical algorithms will be the same for all machines. 11 refs.
Integrability of dynamical systems algebra and analysis
Zhang, Xiang
2017-01-01
This is the first book to systematically state the fundamental theory of integrability and its development of ordinary differential equations with emphasis on the Darboux theory of integrability and local integrability together with their applications. It summarizes the classical results of Darboux integrability and its modern development together with their related Darboux polynomials and their applications in the reduction of Liouville and elementary integrabilty and in the center—focus problem, the weakened Hilbert 16th problem on algebraic limit cycles and the global dynamical analysis of some realistic models in fields such as physics, mechanics and biology. Although it can be used as a textbook for graduate students in dynamical systems, it is intended as supplementary reading for graduate students from mathematics, physics, mechanics and engineering in courses related to the qualitative theory, bifurcation theory and the theory of integrability of dynamical systems.
On a class of invariant algebraic curves for Kukles systems
Directory of Open Access Journals (Sweden)
Osvaldo Osuna
2016-08-01
Full Text Available In this paper we give a new upper bound for the degree of a class of transversal to infinity invariant algebraic curves for polynomial Kukles systems of arbitrary degree. Moreover, we prove that a quadratic Kukles system having at least one transversal to infinity invariant algebraic curve is integrable.
Application of Computer Graphics to Graphing in Algebra and Trigonometry. Final Report.
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…
Symbolic Solution for Generalized Quantum Cylindrical Wells using Computer Algebra
Villegas, Edward Yesid
2012-01-01
This paper present how to solve the problem of cylindrical quantum wells with potential energy different from zero and with singularity of the energy on the axis of the cylinder. The solution to the problem was obtained using methods of computer algebra. The results depend of Bessel and Kummer functions. This paper present energy levels and wave functions in some of the cases with an exactly form and in other cases with an approximated form, this form depended on the possibility of integrating the special functions and calculating the zeros of these functions. Here we can see the power of the method in the applications concerning complex problems of quantum mechanics, and the possibility of being able to apply this method in order to solve other problems in science and also in engineering.
Algebraic and computational aspects of real tensor ranks
Sakata, Toshio; Miyazaki, Mitsuhiro
2016-01-01
This book provides comprehensive summaries of theoretical (algebraic) and computational aspects of tensor ranks, maximal ranks, and typical ranks, over the real number field. Although tensor ranks have been often argued in the complex number field, it should be emphasized that this book treats real tensor ranks, which have direct applications in statistics. The book provides several interesting ideas, including determinant polynomials, determinantal ideals, absolutely nonsingular tensors, absolutely full column rank tensors, and their connection to bilinear maps and Hurwitz-Radon numbers. In addition to reviews of methods to determine real tensor ranks in details, global theories such as the Jacobian method are also reviewed in details. The book includes as well an accessible and comprehensive introduction of mathematical backgrounds, with basics of positive polynomials and calculations by using the Groebner basis. Furthermore, this book provides insights into numerical methods of finding tensor ranks through...
FUZZY ALGEBRA IN TRIANGULAR NORM SYSTEM
Institute of Scientific and Technical Information of China (English)
宋晓秋; 潘志
1994-01-01
Triangular norm is a powerful tool in the theory research and application development of fuzzy sets. In this paper, using the triangular norm, we introduce some concepts such as fuzzy algebra, fuzzy o algebra and fuzzy monotone class, and discuss the relations among them, obtaining the following main conclusions.
Lie symmetry algebra of one-dimensional nonconservative dynamical systems
Institute of Scientific and Technical Information of China (English)
Liu Cui-Mei; Wu Run-Heng; Fu Jing-Li
2007-01-01
Lie symmetry algebra of linear nonconservative dynamical systems is studied in this paper. By using 1-1 mapping,the Lie point and Lie contact symmetry algebras are obtained from two independent solutions of the one-dimensional linear equations of motion.
Robust algebraic image enhancement for intelligent control systems
Lerner, Bao-Ting; Morrelli, Michael
1993-01-01
Robust vision capability for intelligent control systems has been an elusive goal in image processing. The computationally intensive techniques a necessary for conventional image processing make real-time applications, such as object tracking and collision avoidance difficult. In order to endow an intelligent control system with the needed vision robustness, an adequate image enhancement subsystem capable of compensating for the wide variety of real-world degradations, must exist between the image capturing and the object recognition subsystems. This enhancement stage must be adaptive and must operate with consistency in the presence of both statistical and shape-based noise. To deal with this problem, we have developed an innovative algebraic approach which provides a sound mathematical framework for image representation and manipulation. Our image model provides a natural platform from which to pursue dynamic scene analysis, and its incorporation into a vision system would serve as the front-end to an intelligent control system. We have developed a unique polynomial representation of gray level imagery and applied this representation to develop polynomial operators on complex gray level scenes. This approach is highly advantageous since polynomials can be manipulated very easily, and are readily understood, thus providing a very convenient environment for image processing. Our model presents a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets.
The Acoi Algebra: a Query Algebra for Image Retrieval Systems
Nes, N.J.; Kersten, M.L.
1998-01-01
Content-based image retrieval systems rely on a query-by-example technique often using a limited set of global image features. This leads to a rather coarse-grain approach to locate images. The next step is to concentrate on queries over spatial relations amongst objects within the images. This call
Global identifiability of linear compartmental models--a computer algebra algorithm.
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.
Algebraic polynomial system solving and applications
Bleylevens, I.W.M.
2010-01-01
The problem of computing the solutions of a system of multivariate polynomial equations can be approached by the Stetter-Möller matrix method which casts the problem into a large eigenvalue problem. This Stetter-Möller matrix method forms the starting point for the development of computational
Algebraic polynomial system solving and applications
Bleylevens, I.W.M.
2010-01-01
The problem of computing the solutions of a system of multivariate polynomial equations can be approached by the Stetter-Möller matrix method which casts the problem into a large eigenvalue problem. This Stetter-Möller matrix method forms the starting point for the development of computational proce
On W1+∞ 3-algebra and integrable system
Directory of Open Access Journals (Sweden)
Min-Ru Chen
2015-02-01
Full Text Available We construct the W1+∞ 3-algebra and investigate its connection with the integrable systems. Since the W1+∞ 3-algebra with a fixed generator W00 in the operator Nambu 3-bracket recovers the W1+∞ algebra, it is intrinsically related to the KP hierarchy. For the general case of the W1+∞ 3-algebra, we directly derive the KP and KdV equations from the Nambu–Poisson evolution equation with the different Hamiltonian pairs of the KP hierarchy. Due to the Nambu–Poisson evolution equation involves two Hamiltonians, the deep relationship between the Hamiltonian pairs of KP hierarchy is revealed. Furthermore we give a realization of the W1+∞ 3-algebra in terms of a complex bosonic field. Based on the Nambu 3-brackets of the complex bosonic field, we derive the (generalized nonlinear Schrödinger equation and give an application in optical soliton.
Computing spacetime curvature via differential-algebraic equations
Energy Technology Data Exchange (ETDEWEB)
Ashby, S.F. [Lawrence Livermore National Lab., CA (United States); Lee, S.L. [Oak Ridge National Lab., TN (United States); Petzold, L.R. [Minnesota Univ., Minneapolis, MN (United States). Dept. of Computer Science; Saylor, P.E.; Seidel, E. [Illinois Univ., Urbana, IL (United States)
1996-01-01
The equations that govern the behavior of physical systems can often solved numerically using a method of lines approach and differential-algebraic equation (DAE) solvers. For example, such an approach can be used to solve the Einstein field equations of general relativity, and thereby simulate significant astrophysical events. In this paper, we describe some preliminary work in which two model problems in general relativity are formulated, spatially discretized, and then numerically solved as a DAE. In particular, we seek to reproduce the solution to the spherically symmetric Schwarzschild spacetime. This is an important testbed calculation in numerical relativity since the solution is the steady-state for the collision of two (or more) non-rotating black holes. Moreover, analytic late-time properties of the Schwarzschild spacetime are well known and can be used the accuracy of the simulation.
Positive Stabilization of Linear Differential Algebraic Equation System
Directory of Open Access Journals (Sweden)
Muhafzan
2016-01-01
Full Text Available We study in this paper the existence of a feedback for linear differential algebraic equation system such that the closed-loop system is positive and stable. A necessary and sufficient condition for such existence has been established. This result can be used to detect the existence of a state feedback law that makes the linear differential algebraic equation system in closed loop positive and stable.
Changes in Pre-Service Teachers' Algebraic Misconceptions by Using Computer-Assisted Instruction
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…
A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry
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…
A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry
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…
Principles of linear algebra with Mathematica
Shiskowski, Kenneth M
2013-01-01
A hands-on introduction to the theoretical and computational aspects of linear algebra using Mathematica® Many topics in linear algebra are simple, yet computationally intensive, and computer algebra systems such as Mathematica® are essential not only for learning to apply the concepts to computationally challenging problems, but also for visualizing many of the geometric aspects within this field of study. Principles of Linear Algebra with Mathematica uniquely bridges the gap between beginning linear algebra and computational linear algebra that is often encountered in applied settings,
Closed nominal rewriting and efficiently computable nominal algebra equality
Fernández, Maribel; 10.4204/EPTCS.34.5
2010-01-01
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of the lambda-calculus and first-order logic.
Closed nominal rewriting and efficiently computable nominal algebra equality
Directory of Open Access Journals (Sweden)
Maribel Fernández
2010-09-01
Full Text Available We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of the lambda-calculus and first-order logic.
Gravity, torsion, Dirac field and computer algebra using MAPLE and REDUCE
Vulcanov, D N
2002-01-01
The article presents computer algebra procedures and routines applied to the study of the Dirac field on curved spacetimes. The main part of the procedures is devoted to the construction of Pauli and Dirac matrices algebra on an anholonomic orthonormal reference frame. Then these procedures are used to compute the Dirac equation on curved spacetimes in a sequence of special dedicated routines. A comparative review of such procedures obtained for two computer algebra platforms (REDUCE + EXCALC and MAPLE + GRTensorII) is carried out. Applications for the calculus of Dirac equation on specific examples of spacetimes with or without torsion are pointed out.
Rosen's (M,R) system in process algebra.
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.
Rosen’s (M,R) system in process algebra
2013-01-01
Background 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. Results 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. Conclusions We argue that the behaviour of (M,R) in Bio-PEPA shows life-like properties. PMID:24237684
Discrete integrable systems and deformations of associative algebras
Energy Technology Data Exchange (ETDEWEB)
Konopelchenko, B G [Dipartimento di Fisica, Universita del Salento and INFN, Sezione di Lecce, 73100 Lecce (Italy)], E-mail: konopel@le.infn.it
2009-10-30
Interrelations between discrete deformations of the structure constants for associative algebras and discrete integrable systems are reviewed. Theory of deformations for associative algebras is presented. Closed left ideal generated by the elements representing the multiplication table plays a central role in this theory. Deformations of the structure constants are generated by the deformation driving algebra and governed by the central system of equations. It is demonstrated that many discrete equations such as discrete Boussinesq equation, discrete WDVV equation, discrete Schwarzian KP and BKP equations, discrete Hirota-Miwa equations for KP and BKP hierarchies are particular realizations of the central system. An interaction between the theories of discrete integrable systems and discrete deformations of associative algebras is reciprocal and fruitful. An interpretation of the Menelaus relation (discrete Schwarzian KP equation), discrete Hirota-Miwa equation for KP hierarchy, consistency around the cube as the associativity conditions and the concept of gauge equivalence, for instance, between the Menelaus and KP configurations are particular examples.
Algebraic characterization of RNA operations for DNA-based computation
Institute of Scientific and Technical Information of China (English)
LI Shuchao
2004-01-01
Any RNA strand can be presented by a word in the language X*, where X={A,C,G,U}. By encoding A as 010, C as 000, G as 111, and U as 101, the RNA operations can be considered as the performance of concatenation, union, reverse, complement, in terms of the algebraic characterization. The concatenation and union play the roles of multiplication and addition over some algebraic structures, respectively. The rest of the operations turn out to be the homomorphisms or anti-homomorphisms of these algebraic structures. Using this technique, we find the relationship among these RNA operations.
Linear algebra programs for use on a vector computer with a secondary solid state storage device
Energy Technology Data Exchange (ETDEWEB)
Bucher, I.Y.; Jordan, T.L.
1984-01-01
A portable set of linear algebra subprograms for use on a vector computer with an attached fast secondary storage device has been developed. The set currently contains routines for matrix multiplication and for the solution of block tridiagonal, symmetric and positive definite, and general systems of linear equations. Main matrices are stored on the external device in blocked form, and block matrix techniques are used throughout. Performance data are presented which demonstrate that the speed of the routines approaches that of routines with all data in main memory and is close to the maximum speed of the processor.
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.
2nd EACA International School on Computer Algebra and its Applications
Gimenez, Philippe; Sáenz-de-Cabezón, Eduardo
2017-01-01
Featuring up-to-date coverage of three topics lying at the intersection of combinatorics and commutative algebra, namely Koszul algebras, primary decompositions and subdivision operations in simplicial complexes, this book has its focus on computations. "Computations and combinatorics in commutative algebra" has been written by experts in both theoretical and computational aspects of these three subjects and is aimed at a broad audience, from experienced researchers who want to have an easy but deep review of the topics covered to postgraduate students who need a quick introduction to the techniques. The computational treatment of the material, including plenty of examples and code, will be useful for a wide range of professionals interested in the connections between commutative algebra and combinatorics.
Grothaus, Martin
2012-01-01
In this paper a length-conserving numerical scheme for a nonlinear fourth order system of partial differential algebraic equations arising in technical textile industry is studied. Applying a semidiscretization in time, the resulting sequence of nonlinear elliptic systems with algebraic constraint is reformulated as constrained optimization problems in a Hilbert space setting that admit a solution at each time level. Stability and convergence of the scheme are proved. The numerical realization is performed by projected gradient methods on finite element spaces which determine the computational effort and approximation quality of the algorithm. Simulation results are presented and discussed in view of the application of an elastic inextensible fiber motion.
Dynamical algebra of observables in dissipative quantum systems
Alipour, Sahar; Chruściński, Dariusz; Facchi, Paolo; Marmo, Giuseppe; Pascazio, Saverio; Rezakhani, Ali T.
2017-02-01
Dynamics and features of quantum systems can be drastically different from classical systems. Dissipation is understood as a general mechanism through which quantum systems may lose part or all of their quantum aspects. Here we discuss a method to analyze behaviors of dissipative quantum systems in an algebraic sense. This method employs a time-dependent product between system’s observables which is induced by the underlying dissipative dynamics. We argue that the long-time limit of the algebra of observables defined with this product yields a contractive algebra which reflects the loss of some quantum features of the dissipative system, and it bears relevant information about irreversibility. We illustrate this result through several examples of dissipation in various Markovian and non-Markovian systems.
Olsen, Lola
1992-01-01
In addition to the discussions, Ocean Climate Data Workshop hosts gave participants an opportunity to hear about, see, and test for themselves some of the latest computer tools now available for those studying climate change and the oceans. Six speakers described computer systems and their functions. The introductory talks were followed by demonstrations to small groups of participants and some opportunities for participants to get hands-on experience. After this familiarization period, attendees were invited to return during the course of the Workshop and have one-on-one discussions and further hands-on experience with these systems. Brief summaries or abstracts of introductory presentations are addressed.
Identification of control targets in Boolean molecular network models via computational algebra.
Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard
2016-09-23
Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.
Deformed oscillator algebras for two dimensional quantum superintegrable systems
Bonatsos, Dennis; Kokkotas, K D; Bonatsos, Dennis
1994-01-01
Quantum superintegrable systems in two dimensions are obtained from their classical counterparts, the quantum integrals of motion being obtained from the corresponding classical integrals by a symmetrization procedure. For each quantum superintegrable systema deformed oscillator algebra, characterized by a structure function specific for each system, is constructed, the generators of the algebra being functions of the quantum integrals of motion. The energy eigenvalues corresponding to a state with finite dimensional degeneracy can then be obtained in an economical way from solving a system of two equations satisfied by the structure function, the results being in agreement to the ones obtained from the solution of the relevant Schrodinger equation. The method shows how quantum algebraic techniques can simplify the study of quantum superintegrable systems, especially in two dimensions.
KMS states on Nica-Toeplitz algebras of product systems
DEFF Research Database (Denmark)
Hong, Jeong Hee; Larsen, Nadia S.; Szymanski, Wojciech
2012-01-01
system of finite type is introduced. If (G, P) is a lattice ordered group and X is a product system of finite type over P satisfying certain coherence properties, we construct KMS_beta states of NT(X) associated to a scalar dynamics from traces on the coefficient algebra of the product system. Our...
2013-01-01
The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology, including persistent homology.
Building a symbolic computer algebra toolbox to compute 2D Fourier transforms in polar coordinates.
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.
Formal Protection Architecture for Cloud Computing System
Institute of Scientific and Technical Information of China (English)
Yasha Chen; Jianpeng Zhao; Junmao Zhu; Fei Yan
2014-01-01
Cloud computing systems play a vital role in national securi-ty. This paper describes a conceptual framework called dual-system architecture for protecting computing environments. While attempting to be logical and rigorous, formalism meth-od is avoided and this paper chooses algebra Communication Sequential Process.
Ablinger, J.; Behring, A.; Blümlein, J.; De Freitas, A.; von Manteuffel, A.; Schneider, C.
2016-05-01
Three loop ladder and V-topology diagrams contributing to the massive operator matrix element AQg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.
Computing the topology of an arrangement of implicitly defined real algebraic plane curves
Institute of Scientific and Technical Information of China (English)
Jorge CARAVANTES; Laureano GONZALEZ-VEGA
2008-01-01
We introduce a new algebraic approach dealing with the problem of computing the topology of an arrangement of a finite set of real algebraic plane curves presented implicitly. The main achievement of the presented method is a complete avoidance of irrational numbers that appear when using the sweeping method in the classical way for solving the problem at hand. Therefore,it is worth mentioning that the efficiency of the proposed method is only assured for low-degree curves.
Character algebras of decorated SL_2(C)-local systems
Muller, Greg
2011-01-01
Let S be a path-connected, locally-compact CW-complex, and let M be a subcomplex with finitely-many components. A `decorated SL_2(C)-local system' is an SL_2(C)-local system on S, together with a choice of `decoration' at each component of M (a section of the stalk of an associated vector bundle). We study the (decorated SL_2(C)-)character algebra of (S,M), those functions on the space of decorated SL_2(C)-local systems on (S,M) which are regular with respect to the monodromy. The character algebra is presented explicitly. The character algebra is then shown to correspond to the algebra spanned by collections of oriented curves in S modulo simple graphical rules. As an intermediate step, we obtain an invariant-theory result of independent interest: a presentation of the algebra of SL_2(C)-invariant functions on End(V)^m + V^n, where V is the tautological representation of SL_2(C).
Algorithmic Thomas Decomposition of Algebraic and Differential Systems
Bächler, Thomas; Lange-Hegermann, Markus; Robertz, Daniel
2011-01-01
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems, simplicity means triangularity, square-freeness and non-vanishing initials. Differential simplicity extends algebraic simplicity with involutivity. We build upon the constructive ideas of J. M. Thomas and develop them into a new algorithm for disjoint decomposition. The given paper is a revised version of a previous paper and includes the proofs of correctness and termination of our decomposition algorithm. In addition, we illustrate the algorithm with further instructive examples and describe its Maple implementation together with an experimental comparison to some other triangular decomposition algorithms.
Ablinger, J; Blümlein, J; De Freitas, A; von Manteuffel, A; Schneider, C
2015-01-01
Three loop ladder and $V$-topology diagrams contributing to the massive operator matrix element $A_{Qg}$ are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable $N$ and the dimensional parameter $\\varepsilon$. Given these representations, the desired Laurent series expansions in $\\varepsilon$ can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural ...
Entanglement in algebraic quantum mechanics: Majorana fermion systems
Benatti, F.; Floreanini, R.
2016-07-01
Many-body entanglement is studied within the algebraic approach to quantum physics in systems made of Majorana fermions. In this framework, the notion of separability stems from partitions of the algebra of observables and properties of the associated correlation functions, rather than on particle tensor products. This allows a complete characterization of non-separable Majorana fermion states to be obtained. These results may have direct application in quantum metrology: using Majorana systems, sub-shot-noise accuracy in parameter estimations can be achieved without preliminary resource-consuming, state entanglement operations.
Entanglement in Algebraic Quantum Mechanics: Majorana fermion systems
Benatti, F
2016-01-01
Many-body entanglement is studied within the algebraic approach to quantum physics in systems made of Majorana fermions. In this framework, the notion of separability stems from partitions of the algebra of observables and properties of the associated correlation functions, rather than on particle tensor products. This allows obtaining a complete characterization of non-separable Majorana fermion states. These results may find direct applications in quantum metrology: using Majorana systems, sub-shot noise accuracy in parameter estimations can be achieved without preliminary, resource consuming, state entanglement operations.
Skew category algebras associated with partially defined dynamical systems
DEFF Research Database (Denmark)
Lundström, Patrik; Öinert, Per Johan
2012-01-01
We introduce partially defined dynamical systems defined on a topological space. To each such system we associate a functor s from a category G to Topop and show that it defines what we call a skew category algebra A ⋊σ G. We study the connection between topological freeness of s and, on the one...
Impact of hierarchical memory systems on linear algebra algorithm design
Energy Technology Data Exchange (ETDEWEB)
Gallivan, K.; Jalby, W.; Meier, U.; Sameh, A.H.
1988-01-01
Linear algebra algorithms based on the BLAS or extended BLAS do not achieve high performance on multivector processors with a hierarchical memory system because of a lack of data locality. For such machines, block linear algebra algorithms must be implemented in terms of matrix-matrix primitives (BLAS3). Designing efficient linear algebra algorithms for these architectures requires analysis of the behavior of the matrix-matrix primitives and the resulting block algorithms as a function of certain system parameters. The analysis must identify the limits of performance improvement possible via blocking and any contradictory trends that require trade-off consideration. The authors propose a methodology that facilitates such an analysis and use it to analyze the performance of the BLAS3 primitives used in block methods. A similar analysis of the block size-performance relationship is also performed at the algorithm level for block versions of the LU decomposition and the Gram-Schmidt orthogonalization procedures.
A Second Course in Algebra and Trigonometry With Computer Programming, Revised Edition.
Beavers, Mildred; And Others
This text is an integrated presentation of a second year course in algebra and trigonometry and digital computer modeling techniques using the programming language BASIC. Computer concepts are used directly with the mathematics throughout the text. No attempt is made to develop especially proficient programmers, but rather to present computer…
On the economical solution method for a system of linear algebraic equations
Directory of Open Access Journals (Sweden)
Jan Awrejcewicz
2004-01-01
Full Text Available The present work proposes a novel optimal and exact method of solving large systems of linear algebraic equations. In the approach under consideration, the solution of a system of algebraic linear equations is found as a point of intersection of hyperplanes, which needs a minimal amount of computer operating storage. Two examples are given. In the first example, the boundary value problem for a three-dimensional stationary heat transfer equation in a parallelepiped in ℝ3 is considered, where boundary value problems of first, second, or third order, or their combinations, are taken into account. The governing differential equations are reduced to algebraic ones with the help of the finite element and boundary element methods for different meshes applied. The obtained results are compared with known analytical solutions. The second example concerns computation of a nonhomogeneous shallow physically and geometrically nonlinear shell subject to transversal uniformly distributed load. The partial differential equations are reduced to a system of nonlinear algebraic equations with the error of O(hx12+hx22. The linearization process is realized through either Newton method or differentiation with respect to a parameter. In consequence, the relations of the boundary condition variations along the shell side and the conditions for the solution matching are reported.
On the economical solution method for a system of linear algebraic equations
Directory of Open Access Journals (Sweden)
Awrejcewicz Jan
2004-01-01
Full Text Available The present work proposes a novel optimal and exact method of solving large systems of linear algebraic equations. In the approach under consideration, the solution of a system of algebraic linear equations is found as a point of intersection of hyperplanes, which needs a minimal amount of computer operating storage. Two examples are given. In the first example, the boundary value problem for a three-dimensional stationary heat transfer equation in a parallelepiped in ℝ 3 is considered, where boundary value problems of first, second, or third order, or their combinations, are taken into account. The governing differential equations are reduced to algebraic ones with the help of the finite element and boundary element methods for different meshes applied. The obtained results are compared with known analytical solutions. The second example concerns computation of a nonhomogeneous shallow physically and geometrically nonlinear shell subject to transversal uniformly distributed load. The partial differential equations are reduced to a system of nonlinear algebraic equations with the error of O( h x 1 2 + h x 2 2 . The linearization process is realized through either Newton method or differentiation with respect to a parameter. In consequence, the relations of the boundary condition variations along the shell side and the conditions for the solution matching are reported.
Multidimensional analysis algebras and systems for science and engineering
Hart, George W
1995-01-01
This book deals with the mathematical properties of dimensioned quantities, such as length, mass, voltage, and viscosity. Beginning with a careful examination of how one expresses the numerical results of a measurement and uses these results in subsequent manipulations, the author rigorously constructs the notion of dimensioned numbers and discusses their algebraic structure. The result is a unification of linear algebra and traditional dimensional analysis that can be extended from the scalars to which the traditional analysis is perforce restricted to multidimensional vectors of the sort frequently encountered in engineering, systems theory, economics, and other applications.
Studying Personal Response Systems in a College Algebra Course
Butler, Melanie; Pyzdrowksi, Laura; Walker, Vennessa; Yoho, Stephanie
2010-01-01
This paper gives results of a study on a Personal Response System (PRS). Three sections of college algebra are compared; one section used PRS and PowerPoint, one used PowerPoint, and one was considered a control. Students were given a pretest and posttest with a retired version of a mathematics ACT test, and all students gained an average of one…
The IBM RISC System/6000 and linear algebra operations
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J. (Tennessee Univ., Knoxville, TN (USA). Dept. of Computer Science Oak Ridge National Lab., TN (USA)); Mays, P. (Numerical Algorithms Group Ltd., Oxford (UK)); Radicati di Brozolo, G. (IBM European Center for Scientific and Engineering Computing, Rome (Italy))
1991-01-01
This paper discusses the IBM RISC System/6000 workstation and a set of experiments with blocked algorithms commonly used in solving problems in numerical linear algebra. We describe the performance of these algorithms and discuss the techniques used in achieving high performance on such an architecture. 10 refs., 11 figs., 6 tabs.
Algebraic structure and Poisson integrals of a rotational relativistic Birkhoff system
Institute of Scientific and Technical Information of China (English)
罗绍凯; 陈向炜; 郭永新
2002-01-01
We have studied the algebraic structure of the dynamical equations of a rotational relativistic Birkhoff system. It is proven that autonomous and semi-autonomous rotational relativistic Birkhoff equations possess consistent algebraic structure and Lie algebraic structure. In general, non-autonomous rotational relativistic Birkhoff equations possess no algebraic structure, but a type of special non-autonomous rotational relativistic Birkhoff equation possesses consistent algebraic structure and consistent Lie algebraic structure. Then, we obtain the Poisson integrals of the dynamical equations of the rotational relativistic Birkhoff system. Finally, we give an example to illustrate the application of the results.
Relational Algebra in Spatial Decision Support Systems Ontologies.
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.
Lukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems
Directory of Open Access Journals (Sweden)
James F. Glazebrook
2010-06-01
Full Text Available The fundamentals of Lukasiewicz-Moisil logic algebras and their applications to complex genetic network dynamics and highly complex systems are presented in the context of a categorical ontology theory of levels, Medical Bioinformatics and self-organizing, highly complex systems. Quantum Automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces [1]. Their next-state functions operate through transitions between quantum states defined by the quantum equations of motions in the SchrÄodinger representation, with both initial and boundary conditions in space-time. A new theorem is proven which states that the category of quantum automata and automata-homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of Generalized (M,R-Systems which are open, dynamic biosystem networks [4] with de¯ned biological relations that represent physiological functions of primordial(s, single cells and the simpler organisms. A new category of quantum computers is also defined in terms of reversible quantum automata with quantum state spaces represented by topological groupoids that admit a local characterization through unique, quantum Lie algebroids. On the other hand, the category of n-Lukasiewicz algebras has a subcategory of centered n-Lukasiewicz algebras (as proven in ref. [2] which can be employed to design and construct subcategories of quantum automata based on n-Lukasiewicz diagrams of existing VLSI. Furthermore, as shown in ref. [2] the category of centered n-Lukasiewicz algebras and the category of Boolean algebras are naturally equivalent. A `no-go' conjecture is also proposed which states that Generalized (M,R-Systems
Exact computation of emergy based on a mathematical reinterpretation of the rules of emergy algebra
2012-01-01
cited By (since 1996)5; International audience; The emergy algebra is based on four rules, the use of which is sometimes confusing or reserved only to the experts of the domain. The emergy computation does not obey conservation logic (i.e. emergy computation does not obey Kirchoff-like circuit law). In this paper the authors propose to reformulate the emergy rules into three axioms which provide (i) a rigourous mathematical framework for emergy computation and (ii) an exact recursive algorith...
ScaLAPACK: A linear algebra library for message-passing computers
Energy Technology Data Exchange (ETDEWEB)
Blackford, L.S., Cleary, A., Petitet, A., Whaley, R.C., Dongarra, J. [Dept. of Computer Science, Tennessee Univ., Knoxville, TN (United States); Choi, J., [Soongsil University (Korea); D`Azevedo, E. [Mathematical Science Section, Oak Ridge National Lab., TN (United States); Demmel, J., Dhillon, I., Stanley, K. [California Univ., Berkeley, CA (United States). Computer Science Div.; Hammarling, S. [Nag Ltd., (England); Henry, G., Walker, D. [Itel SSPD, Beaverton, OR (United States)
1997-01-06
This article outlines the content and performance of some of the ScaLAPACK software. ScaLAPACK is a collection of mathematical software for linear algebra computations on distributed-memory computers. The importance of developing standards for computational and message-passing interfaces is discussed. We present the different components and building blocks of ScaLAPACK and provide initial performance results for selected PBLAS routines and a subset of ScaLAPACK driver routines.
Templates for Linear Algebra Problems
Bai, Z.; Day, D.; Demmel, J.; Dongarra, J.; Gu, M.; Ruhe, A.; Vorst, H.A. van der
2001-01-01
The increasing availability of advanced-architecture computers is having a very signicant eect on all spheres of scientic computation, including algorithm research and software development in numerical linear algebra. Linear algebra {in particular, the solution of linear systems of equations and eig
Understanding geometric algebra Hamilton, Grassmann, and Clifford for computer vision and graphics
Kanatani, Kenichi
2015-01-01
Introduction PURPOSE OF THIS BOOK ORGANIZATION OF THIS BOOK OTHER FEATURES 3D Euclidean Geometry VECTORS BASIS AND COMPONENTS INNER PRODUCT AND NORM VECTOR PRODUCTS SCALAR TRIPLE PRODUCT PROJECTION, REJECTION, AND REFLECTION ROTATION PLANES LINES PLANES AND LINES Oblique Coordinate Systems RECIPROCAL BASIS RECIPROCAL COMPONENTS INNER, VECTOR, AND SCALAR TRIPLE PRODUCTS METRIC TENSOR RECIPROCITY OF EXPRESSIONS COORDINATE TRANSFORMATIONSHamilton's Quaternion Algebra QUATERNIONS ALGEBRA OF QUATERNIONS CONJUGATE, NORM, AND INVERSE REPRESENTATION OF ROTATION BY QUATERNION Grassmann's Outer Product
Parameterization and algebraic structure of 3-band orthogonal wavelet systems
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
In this paper, a complete parameterization for the 3-band compact wavelet systems is presented. Using the parametric result, a program of the filterbank design is completed, which can give not only the filterbanks but also the graphs of all possible scaling functions and their corresponding wavelets. Especially some symmetric wavelets with small supports are given. Finally an algebraic structure for this kind of wavelet systems is characterized.
Advanced computer algebra algorithms for the expansion of Feynman integrals
Energy Technology Data Exchange (ETDEWEB)
Ablinger, Jakob; Round, Mark; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation; Bluemlein, Johannes [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)
2012-10-15
Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in 4+{epsilon}-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter n. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist-Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in n. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all n solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.
Advanced Computer Algebra Algorithms for the Expansion of Feynman Integrals
Ablinger, J; Round, M; Schneider, C
2012-01-01
Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in $4+\\ep$-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter $n$. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist--Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in $n$. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all $n$ solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.
Energy Technology Data Exchange (ETDEWEB)
Ablinger, J.; Schneider, C. [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation; Behring, A.; Bluemlein, J.; Freitas, A. de [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Manteuffel, A. von [Mainz Univ. (Germany). Inst. fuer Physik
2015-09-15
Three loop ladder and V-topology diagrams contributing to the massive operator matrix element A{sub Qg} are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.
Learning physics with a computer algebra system
Savelsbergh, E.R.; Jong, de T.; Ferguson-Hessler, M.G.M.
2000-01-01
To become proficient problem-solvers, physics students need to form a coherent and flexible understanding of problem situations with which they are confronted. Still, many students have only a limited representation of the problems on which they are working. Therefore, an instructional approach was
Generalized Lotka—Volterra systems connected with simple Lie algebras
Charalambides, Stelios A.; Damianou, Pantelis A.; Evripidou, Charalambos A.
2015-06-01
We devise a new method for producing Hamiltonian systems by constructing the corresponding Lax pairs. This is achieved by considering a larger subset of the positive roots than the simple roots of the root system of a simple Lie algebra. We classify all subsets of the positive roots of the root system of type An for which the corresponding Hamiltonian systems are transformed, via a simple change of variables, to Lotka-Volterra systems. For some special cases of subsets of the positive roots of the root system of type An, we produce new integrable Hamiltonian systems.
Communication efficient basic linear algebra computations on hypercube architectures
Energy Technology Data Exchange (ETDEWEB)
Johnsson, S.L.
1987-04-01
This paper presents a few algorithms for embedding loops and multidimensional arrays in hypercubes with emphasis on proximity preserving embeddings. A proximity preserving embedding minimizes the need for communication bandwidth in computations requiring nearest neighbor communication. Two storage schemes for ''large'' problems on ''small'' machines are suggested and analyzed, and algorithms for matrix transpose, multiplying matrices, factoring matrices, and solving triangular linear systems are presented. A few complete binary tree embeddings are described and analyzed. The data movement in the matrix algorithms is analyzed and it is shown that in the majority of cases the directed routing paths intersect only at nodes of the hypercube allowing for a maximum degree of pipelining.
Reflections on John Monaghan's "Computer Algebra, Instrumentation, and the Anthropological Approach"
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;…
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.)
Model checking process algebra of communicating resources for real-time systems
DEFF Research Database (Denmark)
Boudjadar, Jalil; Kim, Jin Hyun; Larsen, Kim Guldstrand
2014-01-01
This paper presents a new process algebra, called PACoR, for real-time systems which deals with resource- constrained timed behavior as an improved version of the ACSR algebra. We define PACoR as a Process Algebra of Communicating Resources which allows to explicitly express preemptiveness...
Model Checking Process Algebra of Communicating Resources for Real-time Systems
DEFF Research Database (Denmark)
Boudjadar, Jalil; Kim, Jin Hyun; Larsen, Kim Guldstrand
2014-01-01
This paper presents a new process algebra, called PACOR, for real-time systems which deals with resource constrained timed behavior as an improved version of the ACSR algebra. We define PACOR as a Process Algebra of Communicating Resources which allows to express preemptiveness, urgent ness...
Dissipative systems synthesis : A linear algebraic approach
Belur, Madhu N.; Pillai, Harish K.; Trentelman, H.L.
2007-01-01
In this paper we consider the problem of synthesis of dissipative systems for the case that first and higher order derivatives of the concerned variables also appear in the weighting function. The problem is formulated and solved using the behavioral approach to systems and control. We relate the pr
Dissipative systems synthesis : A linear algebraic approach
Belur, Madhu N.; Pillai, Harish K.; Trentelman, H.L.
2007-01-01
In this paper we consider the problem of synthesis of dissipative systems for the case that first and higher order derivatives of the concerned variables also appear in the weighting function. The problem is formulated and solved using the behavioral approach to systems and control. We relate the pr
Dissipative Systems Synthesis : a Linear Algebraic Approach
Belur, Madhu N.; Pillai, Harish K.; Trentelman, H.L.
2005-01-01
In this paper we consider the problem of synthesis of dissipative systems for the case that first and higher order derivatives of the concerned variables also appear in the weighting function. The problem is formulated and solved using the behavioral approach to systems and control. It turns out tha
Obstructions to Clifford System Extensions of Algebras
Indian Academy of Sciences (India)
Antonio M Cegarra; Antonio R Garzón
2001-05-01
In this paper we do phrase the obstruction for realization of a generalized group character, and then we give a classification of Clifford systems in terms of suitable low-dimensional cohomology groups.
Computer programming and computer systems
Hassitt, Anthony
1966-01-01
Computer Programming and Computer Systems imparts a "reading knowledge? of computer systems.This book describes the aspects of machine-language programming, monitor systems, computer hardware, and advanced programming that every thorough programmer should be acquainted with. This text discusses the automatic electronic digital computers, symbolic language, Reverse Polish Notation, and Fortran into assembly language. The routine for reading blocked tapes, dimension statements in subroutines, general-purpose input routine, and efficient use of memory are also elaborated.This publication is inten
Energy Technology Data Exchange (ETDEWEB)
Buchmayr, B.
1996-12-31
The mechanical behaviour of welded joints is marked by different phenomena from metallurgy, which can be described by fundamental thermo-physical, kinetic or semi-empirical equations. In this way, the multifarious aspects of suitability for welding can be modelled and welding parameters can be optimised. The necessary programs of calculation were mostly developed with conventional program languages. The amount of programming is, however, considerably reduced by the computer algebra system, ie: Only the formulation of the describing equations and stating the solution route is now necessary; the coding of numerical algorithms or diverse graphical evaluation becomes unnecessary. In this article, using the CAL system Math Cad, some cases from the field of welding technology are introduced. (orig.) [Deutsch] Das mechanische Verhalten von Schweissverbindungen wird gepraegt durch unterschiedliche metallkundliche Phaenomene, die mit fundamentalen thermophysikalischen, kinetischen bzw. semi-empirischen Gleichungen beschrieben werden koennen. Damit lassen sich die vielfaeltigen Aspekte der Schweisseignung modellieren und Schweissparameter optimieren. Die dafuer notwendigen Berechnungsprogramme wurden meist mit konventionellen Programmiersprachen entwickelt. Durch die Computeralgebra-Systeme reduziert sich aber der Programmieraufwand erheblich, d.h. es ist eigentlich nur die Formulierung der beschreibenden Gleichungen und die Vorgabe des Loesungsweges notwendig, die Codierung numerischer Algorithmen bzw. diverser graphischer Auswertungen entfaellt. Im Artikel werden unter Verwendung des CAL-Systems MathCad einige Fallstudien aus dem Bereich Schweisstechnik vorgestellt. (orig.)
An Algebra-Based Introductory Computational Neuroscience Course with Lab.
Fink, Christian G
2017-01-01
A course in computational neuroscience has been developed at Ohio Wesleyan University which requires no previous experience with calculus or computer programming, and which exposes students to theoretical models of neural information processing and techniques for analyzing neural data. The exploration of theoretical models of neural processes is conducted in the classroom portion of the course, while data analysis techniques are covered in lab. Students learn to program in MATLAB and are offered the opportunity to conclude the course with a final project in which they explore a topic of their choice within computational neuroscience. Results from a questionnaire administered at the beginning and end of the course indicate significant gains in student facility with core concepts in computational neuroscience, as well as with analysis techniques applied to neural data.
Wigner distributions for finite dimensional quantum systems: An algebraic approach
Indian Academy of Sciences (India)
S Chaturvedi; E Ercolessi; G Marmo; G Morandi; N Mukunbda; R Simon
2005-12-01
We discuss questions pertaining to the definition of `momentum', `momentum space', `phase space' and `Wigner distributions'; for finite dimensional quantum systems. For such systems, where traditional concepts of `momenta' established for continuum situations offer little help, we propose a physically reasonable and mathematically tangible definition and use it for the purpose of setting up Wigner distributions in a purely algebraic manner. It is found that the point of view adopted here is limited to odd dimensional systems only. The mathematical reasons which force this situation are examined in detail.
Polynomial system solving for decoding linear codes and algebraic cryptanalysis
2009-01-01
This thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The paradigm we employ here is as follows. We reformulate the initial problem in terms of systems of polynomial equations over a finite field. The solution(s) of such systems should yield a way to solve the initial problem. Our main tools for handling polynomials and polynomial systems in such a paradigm is the technique of Gröbner bases and normal form reductions. The ...
Saldarriaga Vargas, Clarita
When there are diseases affecting large populations where the social, economic and cultural diversity is significant within the same region, the biological parameters that determine the behavior of the dispersion disease analysis are affected by the selection of different individuals. Therefore and because of the variety and magnitude of the communities at risk of contracting dengue disease around all over the world, suggest defining differentiated populations with individual contributions in the results of the dispersion dengue disease analysis. In this paper those conditions were taken in account when several epidemiologic models were analyzed. Initially a stability analysis was done for a SEIR mathematical model of Dengue disease without differential susceptibility. Both free disease and endemic equilibrium states were found in terms of the basic reproduction number and were defined in the Theorem (3.1). Then a DSEIR model was solved when a new susceptible group was introduced to consider the effects of important biological parameters of non-homogeneous populations in the spreading analysis. The results were compiled in the Theorem (3.2). Finally Theorems (3.3) and (3.4) resumed the basic reproduction numbers for three and n different susceptible groups respectively, giving an idea of how differential susceptibility affects the equilibrium states. The computations were done using an algorithmic method implemented in Maple 11, a general-purpose computer algebra system.
Lloris Ruiz, Antonio; Parrilla Roure, Luis; García Ríos, Antonio
2014-01-01
This book presents a complete and accurate study of algebraic circuits, digital circuits whose performance can be associated with any algebraic structure. The authors distinguish between basic algebraic circuits, such as Linear Feedback Shift Registers (LFSRs) and cellular automata, and algebraic circuits, such as finite fields or Galois fields. The book includes a comprehensive review of representation systems, of arithmetic circuits implementing basic and more complex operations, and of the residue number systems (RNS). It presents a study of basic algebraic circuits such as LFSRs and cellular automata as well as a study of circuits related to Galois fields, including two real cryptographic applications of Galois fields.
Drijvers, P.H.M.
2003-01-01
It is well known that algebra is a difficult topic in the school mathematics curriculum, and is often experienced as a stumbling-block. One of the directions in which solutions to the problems with the learning of algebra can be sought is the integration of information technology (IT) into mathemati
Computer-Aided Instruction: College Algebra Students' Perceptions
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…
Yang-Baxter Systems, Algebra Factorizations and Braided Categories
Directory of Open Access Journals (Sweden)
Florin F. Nichita
2013-09-01
Full Text Available The Yang-Baxter equation first appeared in a paper by the Nobel laureate, C.N. Yang, and in R.J. Baxter’s work. Later, Vladimir Drinfeld, Vaughan F. R. Jones and Edward Witten were awarded Fields Medals for their work related to the Yang-Baxter equation. After a short review on this equation and the Yang-Baxter systems, we consider the problem of constructing algebra factorizations from Yang-Baxter systems. Our sketch of proof uses braided categories. Other problems are also proposed.
Yang-Baxter Systems, Algebra Factorizations and Braided Categories
2013-01-01
The Yang-Baxter equation first appeared in a paper by the Nobel laureate, C.N. Yang, and in R.J. Baxter’s work. Later, Vladimir Drinfeld, Vaughan F. R. Jones and Edward Witten were awarded Fields Medals for their work related to the Yang-Baxter equation. After a short review on this equation and the Yang-Baxter systems, we consider the problem of constructing algebra factorizations from Yang-Baxter systems. Our sketch of proof uses braided categories. Other problems are also proposed.
Linear $r$-matrix algebra for classical separable systems
Eilbeck, J C; Kuznetsov, V B; Tsiganov, A V; Kuznetsov, Vadim B.
1994-01-01
We consider a hierarchy of the natural type Hamiltonian systems of $n$ degrees of freedom with polynomial potentials separable in general ellipsoidal and general paraboloidal coordinates. We give a Lax representation in terms of $2\\times 2$ matrices for the whole hierarchy and construct the associated linear $r$-matrix algebra with the $r$-matrix dependent on the dynamical variables. A Yang-Baxter equation of dynamical type is proposed. Using the method of variable separation we provide the integration of the systems in classical mechanics conctructing the separation equations and, hence, the explicit form of action variables. The quantisation problem is discussed with the help of the separation variables.
On the effect of linear algebra implementations in real-time multibody system dynamics
González, Manuel; González, Francisco; Dopico, Daniel; Luaces, Alberto
2008-03-01
This paper compares the efficiency of multibody system (MBS) dynamic simulation codes that rely on different implementations of linear algebra operations. The dynamics of an N-loop four-bar mechanism has been solved with an index-3 augmented Lagrangian formulation combined with the trapezoidal rule as numerical integrator. Different implementations for this method, both dense and sparse, have been developed, using a number of linear algebra software libraries (including sparse linear equation solvers) and optimized sparse matrix computation strategies. Numerical experiments have been performed in order to measure their performance, as a function of problem size and matrix filling. Results show that optimal implementations can increase the simulation efficiency in a factor of 2 3, compared with our starting classical implementations, and in some topics they disagree with widespread beliefs in MBS dynamics. Finally, advices are provided to select the implementation which delivers the best performance for a certain MBS dynamic simulation.
Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer
2012-03-01
between the truth table form of the function and its algebraic normal form. The first known Verilog implementation of a reduced transeunt triangle was... Verilog , Algebraic Attack 15. NUMBER OF PAGES 172 16. PRICE CODE 17. SECURITY CLASSIFICATION OF REPORT Unclassified 18. SECURITY...The first known Verilog implementation of a reduced transeunt triangle was developed for this conversion. This reduced form requires many fewer
A hyperpower iterative method for computing the generalized Drazin inverse of Banach algebra element
Indian Academy of Sciences (India)
SHWETABH SRIVASTAVA; DHARMENDRA K GUPTA; PREDRAG STANIMIROVIC; SUKHJIT SINGH; FALGUNI ROY
2017-05-01
A quadratically convergent Newton-type iterative scheme is proposed for approximating the generalized Drazin inverse bd of the Banach algebra element b. Further, its extension into the form of the hyperpower iterative method of arbitrary order p$\\leq$2 is presented. Convergence criteria along with the estimation of error bounds in the computation of bd are discussed. Convergence results confirms the high order convergence rate of the proposed iterative scheme.
The package HarmonicSums: Computer Algebra and Analytic aspects of Nested Sums
Ablinger, Jakob
2014-01-01
This paper summarizes the essential functionality of the computer algebra package HarmonicSums. On the one hand HarmonicSums can work with nested sums such as harmonic sums and their generalizations and on the other hand it can treat iterated integrals of the Poincare and Chen-type, such as harmonic polylogarithms and their generalizations. The interplay of these representations and the analytic aspects are illustrated by concrete examples.
Geometric invariants for initial data sets: analysis, exact solutions, computer algebra, numerics
Energy Technology Data Exchange (ETDEWEB)
Valiente Kroon, Juan A, E-mail: j.a.valiente-kroon@qmul.ac.uk [School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London, E1 4NS (United Kingdom)
2011-09-22
A personal perspective on the interaction of analytical, numerical and computer algebra methods in classical Relativity is given. This discussion is inspired by the problem of the construction of invariants that characterise key solutions to the Einstein field equations. It is claimed that this kind of ideas will be or importance in the analysis of dynamical black hole spacetimes by either analytical or numerical methods.
Q-system Cluster Algebras, Paths and Total Positivity
Directory of Open Access Journals (Sweden)
Philippe Di Francesco
2010-02-01
Full Text Available In the first part of this paper, we provide a concise review of our method of solution of the A_r Q-systems in terms of the partition function of paths on a weighted graph. In the second part, we show that it is possible to modify the graphs and transfer matrices so as to provide an explicit connection to the theory of planar networks introduced in the context of totally positive matrices by Fomin and Zelevinsky. As an illustration of the further generality of our method, we apply it to give a simple solution for the rank 2 affine cluster algebras studied by Caldero and Zelevinsky.
Simplicity of 2-graph algebras associated to Dynamical Systems
Lewin, Peter
2009-01-01
We give a combinatorial description of a family of 2-graphs which subsumes those described by Pask, Raeburn and Weaver. Each 2-graph $\\Lambda$ has an associated $C^*$-algebra, denoted $C^*(\\Lambda)$, which is simple and purely infinite when $\\Lambda$ is aperiodic. We give new, straightforward conditions which ensure that $\\Lambda$ is aperiodic. These conditions are highly tractable as we only need to consider the finite set of vertices of $\\Lambda$ in order to identify aperiodicity. In addition, the path space of each 2-graph can be realised as a two-dimensional dynamical system which we show must have zero entropy.
The noncommutative Choquet boundary III: Operator systems in matrix algebras
Arveson, William
2008-01-01
We classify operator systems $S\\subseteq \\mathcal B(H)$ that act on finite dimensional Hilbert spaces by making use of the noncommutative Choquet boundary. S is said to be {\\em reduced} when its boundary ideal is 0. In the category of operator systems, that property functions as semisimplicity does in the category of complex Banach algebras. We construct explicit examples of reduced operator systems using sequences of "parameterizing maps" $\\Gamma_k: \\mathbb C^r\\to \\mathcal B(H_k)$, $k=1,..., N$. We show that every reduced operator system is isomorphic to one of these, and that two sequences give rise to isomorphic operator systems if and only if they are "unitarily equivalent" parameterizing sequences. Finally, we construct nonreduced operator systems $S$ that have a given boundary ideal $K$ and a given reduced image in $C^*(S)/K$, and show that these constructed examples exhaust the possibilities.
Geometric and algebraic properties of minimal bases of singular systems
Karcanias, Nicos
2013-11-01
For a general singular system ? with an associated pencil T(S), a complete classification of the right polynomial vector pairs ?, connected with the ? rational vector space, is given according to the proper-nonproper property, characterising the relationship of the degrees of those two vectors. An integral part of the classification of right pairs is the development of the notions of canonical and normal minimal bases for ? and ? rational vector spaces, where R(s) is the state restriction pencil of ?. It is shown that the notions of canonical and normal minimal bases are equivalent; the first notion characterises the pure algebraic aspect of the classification, whereas the second is intimately connected to the real geometry properties and the underlying generation mechanism of the proper and nonproper state vectors ?. The results describe the algebraic and geometric dimensions of the invariant partitioning of the set of reachability indices of singular systems. The classification of all proper and nonproper polynomial vectors ? induces a corresponding classification for the reachability spaces to proper-nonproper and results related to the possible dimensions feedback-spectra assignment properties of them are also given. The classification of minimal bases introduces new feedback invariants for singular systems, based on the real geometry of polynomial minimal bases, and provides an extension of the standard theory for proper systems (Warren, M.E., & Eckenberg, A.E. (1975).
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
An algebraic structure of discrete zero curvature equations is established for integrable coupling systems associated with semi-direct sums of Lie algebras. As an application example of this algebraic structure, a τ-symmetry algebra for the Volterra lattice integrable couplings is engendered from this theory.
A common algebraic description for probabilistic and quantum computations
Beaudry, M; Holzer, M; Beaudry, Martin; Fernandez, Jose M.; Holzer, Markus
2002-01-01
We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column vectors of L2-norm 1 and norm-preserving square matrices, and that the output matrix is a column vector, decide whether the k-partial trace of $F\\dagg{F}$ is superior to 1/2. The k-partial trace of a matrix is the sum of its lowermost k diagonal elements. We also consider the promise version of this problem, where the 1/2 threshold is an isolated cutpoint. We show how to encode a quantum or reversible gate array into a tensor formula which satisfies the above conditions, and vice-versa; we use this to show that the promise version of SFT is complete for the class BPP for formulas over the semiring (Q^+,+,.) of the positive rational numbers, for BQP in the case of formulas defined over the field (Q,+,.), and for P in the case of formulas defined over the Boolean semiring, a...
Recent Developments in Complex Analysis and Computer Algebra
Kajiwara, Joji; Xu, Yongzhi
1999-01-01
This volume consists of papers presented in the special sessions on "Complex and Numerical Analysis", "Value Distribution Theory and Complex Domains", and "Use of Symbolic Computation in Mathematics Education" of the ISAAC'97 Congress held at the University of Delaware, during June 2-7, 1997. The ISAAC Congress coincided with a U.S.-Japan Seminar also held at the University of Delaware. The latter was supported by the National Science Foundation through Grant INT-9603029 and the Japan Society for the Promotion of Science through Grant MTCS-134. It was natural that the participants of both meetings should interact and consequently several persons attending the Congress also presented papers in the Seminar. The success of the ISAAC Congress and the U.S.-Japan Seminar has led to the ISAAC'99 Congress being held in Fukuoka, Japan during August 1999. Many of the same participants will return to this Seminar. Indeed, it appears that the spirit of the U.S.-Japan Seminar will be continued every second year as part of...
Lie algebraic similarity transformed Hamiltonians for lattice model systems
Wahlen-Strothman, Jacob M.; Jiménez-Hoyos, Carlos A.; Henderson, Thomas M.; Scuseria, Gustavo E.
2015-01-01
We present a class of Lie algebraic similarity transformations generated by exponentials of two-body on-site Hermitian operators whose Hausdorff series can be summed exactly without truncation. The correlators are defined over the entire lattice and include the Gutzwiller factor ni ↑ni ↓ , and two-site products of density (ni ↑+ni ↓) and spin (ni ↑-ni ↓) operators. The resulting non-Hermitian many-body Hamiltonian can be solved in a biorthogonal mean-field approach with polynomial computational cost. The proposed similarity transformation generates locally weighted orbital transformations of the reference determinant. Although the energy of the model is unbound, projective equations in the spirit of coupled cluster theory lead to well-defined solutions. The theory is tested on the one- and two-dimensional repulsive Hubbard model where it yields accurate results for small and medium sized interaction strengths.
Energy Technology Data Exchange (ETDEWEB)
Jordan, T.L.
1979-10-01
Performance data of parallel computers on several of the problems of linear algebra using direct methods are provided. The computers considered include software pipeline, hardware pipeline, single-instruction multiple-data, and multiple-instruction multiple-data. Special features of each architecture are considered. Factors such as start-up time, scalar-vector break-even points, consistency in operation count, parallel steps required, and speed-up and efficiency of the hardware are discussed. A reasonably broad comparison is given for LU factorization without pivoting. A less extensive comparison is given for LU factorization with pivoting. Also various intracomputer comparisons are presented to show the performance of different implementations of a particcular algorithm as well as the performance of different algorithms for solving the same problem. Data were collected for the linear algebraic problems of matrix multiplication, regular sparse systems (including tridiagonal systems and dissection techniques), and random sparse systems. The eigenvalue problem is not addressed. 15 figures, 7 tables.
Computer algebra in quantum field theory integration, summation and special functions
Schneider, Carsten
2013-01-01
The book focuses on advanced computer algebra methods and special functions that have striking applications in the context of quantum field theory. It presents the state of the art and new methods for (infinite) multiple sums, multiple integrals, in particular Feynman integrals, difference and differential equations in the format of survey articles. The presented techniques emerge from interdisciplinary fields: mathematics, computer science and theoretical physics; the articles are written by mathematicians and physicists with the goal that both groups can learn from the other field, including
Temperley-Lieb Algebra: From Knot Theory to Logic and Computation via Quantum Mechanics
Abramsky, Samson
2009-01-01
Our aim in this paper is to trace some of the surprising and beautiful connections which are beginning to emerge between a number of apparently disparate topics: Knot Theory, Categorical Quantum Mechanics, and Logic and Computation. We shall focus in particular on the following two topics: - The Temperley-Lieb algebra has always hitherto been presented as a quotient of some sort: either algebraically by generators and relations as in Jones' original presentation, or as a diagram algebra modulo planar isotopy as in Kauffman's presentation. We shall use tools from Geometry of Interaction, a dynamical interpretation of proofs under Cut Elimination developed as an off-shoot of Linear Logic, to give a direct description of the Temperley-Lieb category -- a "fully abstract presentation", in Computer Science terminology. This also brings something new to the Geometry of Interaction, since we are led to develop a planar version of it, and to verify that the interpretation of Cut-Elimination (the "Execution Formula", o...
Programming methodology and performance issues for advanced computer architectures. [Linear algebra
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.; Sorensen, D.C.; Connolly, K.; Patterson, J.
1987-01-01
This paper will describe some recent attempts to construct transportable numerical software for high performance computers. Restructuring algorithms in terms of simple linear algebra modules is reviewed. This technique has proved very successful in obtaining a high level of transportability without severe loss of performance on a wide variety of both vector and parallel computers. The use of modules to encapsulate parallelism and reduce the ratio of data movement to floating point operations has been demonstrably effective for regular problems such as those found in dense linear algebra. In other situations it may be necessary to express explicitly parallel algorithms. We also present a programming methodology that is useful for constructing new parallel algorithms which require sophisticated synchronization at a large grain level. We describe the SCHEDULE package which provides an environment for developing and analyzing explicitly parallel programs in Fortran which aare portable. This package now includes a preprocessor to achieve complete portability of user level code and also a graphics post processor for performance analysis and debugging. We discuss details of porting both the SCHEDULE package and user code. Examples from linear algebra, and partial differential equations are used to illustrate the utility of this approach.
A project for developing a linear algebra library for high-performance computers
Energy Technology Data Exchange (ETDEWEB)
Demmel, J.; Dongarra, J.; DuCroz, J.; Greenbaum, A.; Hammarling, S.; Sorensen, D.
1988-01-01
Argonne National Laboratory, the Courant Institute for Mathematical Sciences, and the Numerical Algorithms Group, Ltd., are developing a transportable linear algebra library in Fortran 77. The library is intended to provide a uniform set of subroutines to solve the most common linear algebra problems and to run efficiently on a wide range of high-performance computers. To be effective, the new library must satisfy several criteria. First, it must be highly efficient, or at least ''tunable'' to high efficiency, on each machine. Second, the user interface must be uniform across machines. Otherwise much of the convenience of portability will be lost. Third, the program must be widely available. NETLIB has demonstrated how useful and important it is for these codes to be available easily, and preferably on line. We intend to distribute the new library in a similar way, for no cost or a nominal cost only. In addition, the programs must be well documented.
The development of an algebraic multigrid algorithm for symmetric positive definite linear systems
Energy Technology Data Exchange (ETDEWEB)
Vanek, P.; Mandel, J.; Brezina, M. [Univ. of Colorado, Denver, CO (United States)
1996-12-31
An algebraic multigrid algorithm for symmetric, positive definite linear systems is developed based on the concept of prolongation by smoothed aggregation. Coarse levels are generated automatically. We present a set of requirements motivated heuristically by a convergence theory. The algorithm then attempts to satisfy the requirements. Input to the method are the coefficient matrix and zero energy modes, which are determined from nodal coordinates and knowledge of the differential equation. Efficiency of the resulting algorithm is demonstrated by computational results on real world problems from solid elasticity, plate blending, and shells.
Nonmonotonic logics and algebras
Institute of Scientific and Technical Information of China (English)
CHAKRABORTY Mihir Kr; GHOSH Sujata
2008-01-01
Several nonmonotonie logic systems together with their algebraic semantics are discussed. NM-algebra is defined.An elegant construction of an NM-algebra starting from a Boolean algebra is described which gives rise to a few interesting algebraic issues.
Computer Simulation and Computabiblity of Biological Systems
Baianu, I C
2004-01-01
The ability to simulate a biological organism by employing a computer is related to the ability of the computer to calculate the behavior of such a dynamical system, or the "computability" of the system. However, the two questions of computability and simulation are not equivalent. Since the question of computability can be given a precise answer in terms of recursive functions, automata theory and dynamical systems, it will be appropriate to consider it first. The more elusive question of adequate simulation of biological systems by a computer will be then addressed and a possible connection between the two answers given will be considered as follows. A symbolic, algebraic-topological "quantum computer" (as introduced in Baianu, 1971b) is here suggested to provide one such potential means for adequate biological simulations based on QMV Quantum Logic and meta-Categorical Modeling as for example in a QMV-based, Quantum-Topos (Baianu and Glazebrook,2004.
2014-01-01
Background A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. Results This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. Conclusions The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate
Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard
2014-06-26
A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for
Energy Technology Data Exchange (ETDEWEB)
Abedi-Fardad, J., E-mail: j.abedifardad@bonabu.ac.ir [Department of Mathematics, Bonab University, Tabriz (Iran, Islamic Republic of); Rezaei-Aghdam, A., E-mail: rezaei-a@azaruniv.edu [Department of Physics, Azarbaijan Shahid Madani University, 53714-161 Tabriz (Iran, Islamic Republic of); Haghighatdoost, Gh., E-mail: gorbanali@azaruniv.edu [Department of Mathematics, Bonab University, Tabriz (Iran, Islamic Republic of); Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz (Iran, Islamic Republic of)
2014-05-15
We construct integrable and superintegrable Hamiltonian systems using the realizations of four dimensional real Lie algebras as a symmetry of the system with the phase space R{sup 4} and R{sup 6}. Furthermore, we construct some integrable and superintegrable Hamiltonian systems for which the symmetry Lie group is also the phase space of the system.
A Higher Dimensional Loop Algebra and Integrable Couplings System of Evolution Equations Hierarchy
Institute of Scientific and Technical Information of China (English)
夏铁成; 于发军; 陈登远
2005-01-01
An extension of the Lie algebra An-1 has been proposed [ Phys. Lett. A, 2003, 310 : 19-24 ]. In this paper, the new Lie algebra was used to construct a new higher dimensional loop algebra G～. Based on the loop algebra G～, the integrable couplings system of the NLS-MKdV equations hierarchy was obtained. As its reduction case, generalized nonlinear NLS-MKdV equations were obtained. The method proposed in this letter can be applied to other hierarchies of evolution equations.
Synchronization and anti-synchronization of chaotic systems: A differential and algebraic approach
Energy Technology Data Exchange (ETDEWEB)
Martinez-Guerra, Rafael [Departamento de Control Automatico, Cinvestav-IPN A. P. 14-740, Av. IPN 2508, 07360 Mexico, D.F. (Mexico)], E-mail: rguerra@ctrl.cinvestav.mx; Pasaye, Jose Juan Rincon [Departamento de Control Automatico, Cinvestav-IPN A. P. 14-740, Av. IPN 2508, 07360 Mexico, D.F. (Mexico)], E-mail: jrincon@ctrl.cinvestav.mx
2009-10-30
Chaotic systems synchronization and anti-synchronization problems are tackled by means of differential and algebraic techniques for nonlinear systems. An algebraic observer is proposed for systems satisfying an algebraic observability condition. This observer can be used as a slave system whose states are synchronized with the master (chaotic) system. This approach has the advantages of being independent of the chaotic nature of the master system, it uses a reduced set of measurable signal from the master system and it also solves the anti-synchronization problem as a straightforward extension of the synchronization one. A Colpitts oscillator is given to illustrate the effectiveness of the suggested approach.
Thermodiffusion in Multicomponent Mixtures Thermodynamic, Algebraic, and Neuro-Computing Models
Srinivasan, Seshasai
2013-01-01
Thermodiffusion in Multicomponent Mixtures presents the computational approaches that are employed in the study of thermodiffusion in various types of mixtures, namely, hydrocarbons, polymers, water-alcohol, molten metals, and so forth. We present a detailed formalism of these methods that are based on non-equilibrium thermodynamics or algebraic correlations or principles of the artificial neural network. The book will serve as single complete reference to understand the theoretical derivations of thermodiffusion models and its application to different types of multi-component mixtures. An exhaustive discussion of these is used to give a complete perspective of the principles and the key factors that govern the thermodiffusion process.
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Additional equations were found based on experiments for an algebraic turbulence model to improve the prediction of the behavior of three dimensional turbulent boundary layers by taking account of the effects of pressure gradient and the historical variation of eddy viscosity, so the model is with memory. Numerical calculation by solving boundary layer equations was carried out for the five pressure driven three dimensional turbulent boundary layers developed on flat plates, swept-wing, and prolate spheroid in symmetrical plane. Comparing the computational results with the experimental data, it is obvious that the prediction will be more accurate if the proposed closure equations are used, especially for the turbulent shear stresses.
Improved Linear Algebra Methods for Redshift Computation from Limited Spectrum Data - II
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.
Workshop on Commutative Algebra
Simis, Aron
1990-01-01
The central theme of this volume is commutative algebra, with emphasis on special graded algebras, which are increasingly of interest in problems of algebraic geometry, combinatorics and computer algebra. Most of the papers have partly survey character, but are research-oriented, aiming at classification and structural results.
Institute of Scientific and Technical Information of China (English)
张玉峰
2003-01-01
A subalgebra of loop algebra A2 is established. Therefore, a new isospectral problem is designed. By making use of Tu's scheme, a new integrable system is obtained, which possesses bi-Hamiltonian structure. As its reductions,a formalism similar to the well-known Ablowitz-Kaup-Newell-Segur (AKNS) hierarchy and a generalized standard form of the Schrodinger equation are presented. In addition, in order for a kind of expanding integrable system to be obtained, a proper algebraic transformation is supplied to change loop algebra A2 into loop algebra A1. Furthermore,a high-dimensional loop algebra is constructed, which is different from any previous one. An integrable coupling of the system obtained is given. Finally, the Hamiltonian form of a binary symmetric constrained flow of the system obtained is presented.
Mastering algebra retrains the visual system to perceive hierarchical structure in equations.
Marghetis, Tyler; Landy, David; Goldstone, Robert L
2016-01-01
Formal mathematics is a paragon of abstractness. It thus seems natural to assume that the mathematical expert should rely more on symbolic or conceptual processes, and less on perception and action. We argue instead that mathematical proficiency relies on perceptual systems that have been retrained to implement mathematical skills. Specifically, we investigated whether the visual system-in particular, object-based attention-is retrained so that parsing algebraic expressions and evaluating algebraic validity are accomplished by visual processing. Object-based attention occurs when the visual system organizes the world into discrete objects, which then guide the deployment of attention. One classic signature of object-based attention is better perceptual discrimination within, rather than between, visual objects. The current study reports that object-based attention occurs not only for simple shapes but also for symbolic mathematical elements within algebraic expressions-but only among individuals who have mastered the hierarchical syntax of algebra. Moreover, among these individuals, increased object-based attention within algebraic expressions is associated with a better ability to evaluate algebraic validity. These results suggest that, in mastering the rules of algebra, people retrain their visual system to represent and evaluate abstract mathematical structure. We thus argue that algebraic expertise involves the regimentation and reuse of evolutionarily ancient perceptual processes. Our findings implicate the visual system as central to learning and reasoning in mathematics, leading us to favor educational approaches to mathematics and related STEM fields that encourage students to adapt, not abandon, their use of perception.
Energy Technology Data Exchange (ETDEWEB)
Odesskii, A V [L.D. Landau Institute for Theoretical Physics, Russian Academy of Sciences, Moscow (Russian Federation)
2002-12-31
This survey is devoted to associative Z{sub {>=}}{sub 0}-graded algebras presented by n generators and n(n-1)/2 quadratic relations and satisfying the so-called Poincare-Birkhoff-Witt condition (PBW-algebras). Examples are considered of such algebras, depending on two continuous parameters (namely, on an elliptic curve and a point on it), that are flat deformations of the polynomial ring in n variables. Diverse properties of these algebras are described, together with their relations to integrable systems, deformation quantization, moduli spaces, and other directions of modern investigations.
Simple skew category algebras associated with minimal partially defined dynamical systems
DEFF Research Database (Denmark)
Nystedt, Patrik; Öinert, Per Johan
2013-01-01
In this article, we continue our study of category dynamical systems, that is functors s from a category G to Topop, and their corresponding skew category algebras. Suppose that the spaces s(e), for e∈ob(G), are compact Hausdorff. We show that if (i) the skew category algebra is simple, then (ii) G...
Exposition on affine and elliptic root systems and elliptic Lie algebras
Azam, Saeid; Yousofzadeh, Malihe
2009-01-01
This is an exposition in order to give an explicit way to understand (1) a non-topological proof for an existence of a base of an affine root system, (2) a Serre-type definition of an elliptic Lie algebra with rank =>2, and (3) the isotropic root multiplicities of those elliptic Lie algebras.
Fu, Jian; Hu, Xinhua; Velroyen, Astrid; Bech, Martin; Jiang, Ming; Pfeiffer, Franz
2015-01-01
Due to the potential of compact imaging systems with magnified spatial resolution and contrast, cone-beam x-ray differential phase-contrast computed tomography (DPC-CT) has attracted significant interest. The current proposed FDK reconstruction algorithm with the Hilbert imaginary filter will induce severe cone-beam artifacts when the cone-beam angle becomes large. In this paper, we propose an algebraic iterative reconstruction (AIR) method for cone-beam DPC-CT and report its experiment results. This approach considers the reconstruction process as the optimization of a discrete representation of the object function to satisfy a system of equations that describes the cone-beam DPC-CT imaging modality. Unlike the conventional iterative algorithms for absorption-based CT, it involves the derivative operation to the forward projections of the reconstructed intermediate image to take into account the differential nature of the DPC projections. This method is based on the algebraic reconstruction technique, reconstructs the image ray by ray, and is expected to provide better derivative estimates in iterations. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured with a three-grating interferometer and a mini-focus x-ray tube source. It is shown that the proposed method can reduce the cone-beam artifacts and performs better than FDK under large cone-beam angles. This algorithm is of interest for future cone-beam DPC-CT applications.
Cavanagh, Sean
2009-01-01
As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…
Cavanagh, Sean
2009-01-01
As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…
DARBOUX POLYNOMIALS AND NON-ALGEBRAIC INTEGRABILITY OF THE L SYSTEM
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
In this paper, we characterize all of the Darboux polynomials of the L system and prove that the system is not algebraically integrable, using the weight homogeneous polynomials and the method of characteristic curves for solving linear partial differential equations.
Quadratic algebra for superintegrable monopole system in a Taub-NUT space
Hoque, Md Fazlul; Marquette, Ian; Zhang, Yao-Zhong
2016-09-01
We introduce a Hartmann system in the generalized Taub-NUT space with Abelian monopole interaction. This quantum system includes well known Kaluza-Klein monopole and MIC-Zwanziger monopole as special cases. It is shown that the corresponding Schrödinger equation of the Hamiltonian is separable in both spherical and parabolic coordinates. We obtain the integrals of motion of this superintegrable model and construct the quadratic algebra and Casimir operator. This algebra can be realized in terms of a deformed oscillator algebra and has finite dimensional unitary representations (unirreps) which provide energy spectra of the system. This result coincides with the physical spectra obtained from the separation of variables.
Computer system identification
Lesjak, Borut
2008-01-01
The concept of computer system identity in computer science bears just as much importance as does the identity of an individual in a human society. Nevertheless, the identity of a computer system is incomparably harder to determine, because there is no standard system of identification we could use and, moreover, a computer system during its life-time is quite indefinite, since all of its regular and necessary hardware and software upgrades soon make it almost unrecognizable: after a number o...
Cellular modelling using P systems and process algebra
Institute of Scientific and Technical Information of China (English)
Francisco J.Romero-Campero; Marian Gheorghe; Gabriel Ciobanu; John M. Auld; Mario J. Pérez-Jiménez
2007-01-01
In this paper various molecular chemical interactions are modelled under different computational paradigms. P systems and π-calculus are used to describe intra-cellular reactions like protein-protein interactions and gene regulation control.
Computer algebra for x-ray spectral reconstruction between 6 and 25 MV.
Stampanoni, M; Fix, M; Francois, P; Rüegsegger, P
2001-03-01
A previously presented algorithm for the reconstruction of bremsstrahlung spectra from transmission data has been implemented into MATHEMATICA. Spectra vectorial algebra has been used to solve the matrix system A * F = T. The new implementation has been tested by reconstructing photon spectra from transmission data acquired in narrow beam conditions, for nominal energies of 6, 15, and 25 MV. The results were in excellent agreement with the original calculations. Our implementation has the advantage to be based on a well-tested mathematical kernel. Furthermore it offers a comfortable user interface.
Clifford Algebra with Mathematica
Aragon-Camarasa, G; Aragon, J L; Rodriguez-Andrade, M A
2008-01-01
The Clifford algebra of a n-dimensional Euclidean vector space provides a general language comprising vectors, complex numbers, quaternions, Grassman algebra, Pauli and Dirac matrices. In this work, a package for Clifford algebra calculations for the computer algebra program Mathematica is introduced through a presentation of the main ideas of Clifford algebras and illustrative examples. This package can be a useful computational tool since allows the manipulation of all these mathematical objects. It also includes the possibility of visualize elements of a Clifford algebra in the 3-dimensional space.
Lectures on algebraic system theory: Linear systems over rings
Kamen, E. W.
1978-01-01
The presentation centers on four classes of systems that can be treated as linear systems over a ring. These are: (1) discrete-time systems over a ring of scalars such as the integers; (2) continuous-time systems containing time delays; (3) large-scale discrete-time systems; and (4) time-varying discrete-time systems.
Structure of classical affine and classical affine fractional W-algebras
Energy Technology Data Exchange (ETDEWEB)
Suh, Uhi Rinn, E-mail: uhrisu1@math.snu.ac.kr [Department of Mathematical Sciences, Seoul National University, GwanAkRo 1, Gwanak-Gu, Seoul 151-747 (Korea, Republic of)
2015-01-15
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 of 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.
Dunlap, Mike; And Others
The two sections found in this publication, "Integrating Computer Literacy With Existing Classes" and "Guide to Computer Augmented Trigonometry," were written by participants in two summer courses at the University of Oregon. The first section addresses the general topic of teaching computer literacy through existing classes,…
Distributed computer control systems
Energy Technology Data Exchange (ETDEWEB)
Suski, G.J.
1986-01-01
This book focuses on recent advances in the theory, applications and techniques for distributed computer control systems. Contents (partial): Real-time distributed computer control in a flexible manufacturing system. Semantics and implementation problems of channels in a DCCS specification. Broadcast protocols in distributed computer control systems. Design considerations of distributed control architecture for a thermal power plant. The conic toolset for building distributed systems. Network management issues in distributed control systems. Interprocessor communication system architecture in a distributed control system environment. Uni-level homogenous distributed computer control system and optimal system design. A-nets for DCCS design. A methodology for the specification and design of fault tolerant real time systems. An integrated computer control system - architecture design, engineering methodology and practical experience.
Xin, Yan Ping; Si, Luo; Hord, Casey; Zhang, Dake; Cetinas, Suleyman; Park, Joo Young
2012-01-01
The study explored the effects of a computer-assisted COnceptual Model-based Problem-Solving (COMPS) program on multiplicative word-problem-solving performance of students with learning disabilities or difficulties. The COMPS program emphasizes mathematical modeling with algebraic expressions of relations. Participants were eight fourth and fifth…
Borzykh, A. N.
2017-01-01
The Seidel method for solving a system of linear algebraic equations and an estimate of its convergence rate are considered. It is proposed to change the order of equations. It is shown that the method described in Faddeevs' book Computational Methods of Linear Algebra can deteriorate the convergence rate estimate rather than improve it. An algorithm for establishing the optimal order of equations is proposed, and its validity is proved. It is shown that the computational complexity of the reordering is 2 n 2 additions and (12) n 2 divisions. Numerical results for random matrices of order 100 are presented that confirm the proposed improvement.
Recurrence approach and higher rank cubic algebras for the N-dimensional superintegrable systems
Fazlul Hoque, Md; Marquette, Ian; Zhang, Yao-Zhong
2016-03-01
By applying the recurrence approach and coupling constant metamorphosis, we construct higher order integrals of motion for the Stackel equivalents of the N-dimensional superintegrable Kepler-Coulomb model with non-central terms and the double singular oscillators of type (n,N-n). We show how the integrals of motion generate higher rank cubic algebra C(3)\\oplus {L}1\\oplus {L}2 with structure constants involving Casimir operators of the Lie algebras L 1 and L 2. The realizations of the cubic algebras in terms of deformed oscillators enable us to construct finite dimensional unitary representations and derive the degenerate energy spectra of the corresponding superintegrable systems.
Spontaneous PT-Symmetry Breaking for Systems of Noncommutative Euclidean Lie Algebraic Type
Dey, Sanjib; Fring, Andreas; Mathanaranjan, Thilagarajah
2015-11-01
We propose a noncommutative version of the Euclidean Lie algebra E 2. Several types of non-Hermitian Hamiltonian systems expressed in terms of generic combinations of the generators of this algebra are investigated. Using the breakdown of the explicitly constructed Dyson maps as a criterium, we identify the domains in the parameter space in which the Hamiltonians have real energy spectra and determine the exceptional points signifying the crossover into the different types of spontaneously broken PT-symmetric regions with pairs of complex conjugate eigenvalues. We find exceptional points which remain invariant under the deformation as well as exceptional points becoming dependent on the deformation parameter of the algebra.
Chisolm, Eric
2012-01-01
This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1. In addition to scalars and vectors, it defines new objects representing subspaces of any dimension. 2. It defines a product that's strongly motivated by geometry and can be taken between any two objects. For example, the product of two vectors taken in a certain way represents their common plane. This system was invented by William Clifford and is more commonly known as Clifford algebra. It's actually older than the vector algebra that we use today (due to Gibbs) and includes it as a subset. Over the years, various parts of Clifford algebra have been reinvented independently by many people who found they needed it, often not realizing that all those parts belonged in one system. This suggests that Clifford had the right idea, and that geometric algebra, not the reduced version we use today, deserves to be the standard "vector algebra." My goal in these notes is to describe geometric al...
McKeague, Charles P
1981-01-01
Elementary Algebra 2e, Second Edition focuses on the basic principles, operations, and approaches involved in elementary algebra. The book first tackles the basics, linear equations and inequalities, and graphing and linear systems. Discussions focus on the substitution method, solving linear systems by graphing, solutions to linear equations in two variables, multiplication property of equality, word problems, addition property of equality, and subtraction, addition, multiplication, and division of real numbers. The manuscript then examines exponents and polynomials, factoring, and rational e
McKeague, Charles P
1986-01-01
Elementary Algebra, Third Edition focuses on the basic principles, operations, and approaches involved in elementary algebra. The book first ponders on the basics, linear equations and inequalities, and graphing and linear systems. Discussions focus on the elimination method, solving linear systems by graphing, word problems, addition property of equality, solving linear equations, linear inequalities, addition and subtraction of real numbers, and properties of real numbers. The text then takes a look at exponents and polynomials, factoring, and rational expressions. Topics include reducing ra
Directory of Open Access Journals (Sweden)
Wendl Michael C
2007-04-01
Full Text Available Abstract Background The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known to systematically over-predict match probabilities by various orders of magnitude, depending upon project-specific parameters. Although the exact probability distribution is also available for the comparison problem, it is rather difficult to compute and cannot be used directly in most cases. A methodology providing both improved accuracy and computational economy is required. Results We propose a straightforward algebraic correction procedure, which takes the Sulston score as a provisional value and applies a power-law equation to obtain an improved result. Numerical comparisons indicate dramatically increased accuracy over the range of parameters typical of traditional agarose fingerprint mapping. Issues with extrapolating the method into parameter ranges characteristic of newer capillary electrophoresis-based projects are also discussed. Conclusion Although only marginally more expensive to compute than the raw Sulston score, the correction provides a vastly improved probabilistic description of hypothesized clone overlaps. This will clearly be important in overlap assessment and perhaps for other tasks as well, for example in using the ranking of overlap probabilities to assist in clone ordering.
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
A new robust on-line fault diagnosis method based on least squares estimate for nonlinear difference-algebraic systems (DAS) with uncertainties is proposed. Based on the known nominal model of the DAS, this method firstly constructs an auxiliary system consisting of a difference equation and an algebraic equation, then, based on the relationship between the state deviation and the faults in the difference equation and the relationship between the algebraic variable deviation and the faults in algebraic equation, it identifies the faults on-line through least squares estimate. This method can not only detect, isolate and identify faults for DAS, but also give the upper bound of the error of fault identification. The simulation results indicate that it can give satisfactory diagnostic results for both abrupt and incipient faults.
Two dissimilar approaches to dynamical systems on hyper MV -algebras and their information entropy
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.
Directory of Open Access Journals (Sweden)
Lanmei Cong
2015-01-01
Full Text Available A multiobject holographic feedback (MOHF control method for studying the nonlinear differential algebraic (NDA system is proposed. In this method, the nonlinear control law is designed in a homeomorphous linear space by means of constructing the multiobject equations (MOEq which is in accord with Brunovsky normal form. The objective functions of MOEq are considered to be the errors between the output functions and their references. The relative degree for algebraic system is defined that is key to connecting the nonlinear and the linear control laws. Pole assignment method is addressed for the stability domain of this MOHF control. Since there is no any approximation, the MOHF control is effective in governing the dynamic performance stably both to the small and major disturbance. The application in single machine infinite system (SMIS shows that this approach is effective in the improvement of stable and transient stability for power system on the disturbance of active power or three-phase short circuit fault.
Kolman, Bernard
1985-01-01
College Algebra, Second Edition is a comprehensive presentation of the fundamental concepts and techniques of algebra. The book incorporates some improvements from the previous edition to provide a better learning experience. It provides sufficient materials for use in the study of college algebra. It contains chapters that are devoted to various mathematical concepts, such as the real number system, the theory of polynomial equations, exponential and logarithmic functions, and the geometric definition of each conic section. Progress checks, warnings, and features are inserted. Every chapter c
Upper Triangular Matrix of Lie Algebra and a New Discrete Integrable Coupling System
Institute of Scientific and Technical Information of China (English)
YU Fa-Jun; ZHANG Hong-Qing
2007-01-01
The upper triangular matrix of Lie algebra is used to construct integrable couplings of discrete solition equations.Correspondingly,a feasible way to construct integrable couplings is presented.A nonlinear lattice soliton equation spectral problem is obtained and leads to a novel hierarchy of the nonlinear lattice equation hierarchy.It indicates that the study of integrable couplings using upper triangular matrix of Lie algebra is an important step towards constructing integrable systems.
Evolution algebras and their applications
Tian, Jianjun Paul
2008-01-01
Behind genetics and Markov chains, there is an intrinsic algebraic structure. It is defined as a type of new algebra: as evolution algebra. This concept lies between algebras and dynamical systems. Algebraically, evolution algebras are non-associative Banach algebras; dynamically, they represent discrete dynamical systems. Evolution algebras have many connections with other mathematical fields including graph theory, group theory, stochastic processes, dynamical systems, knot theory, 3-manifolds, and the study of the Ihara-Selberg zeta function. In this volume the foundation of evolution algebra theory and applications in non-Mendelian genetics and Markov chains is developed, with pointers to some further research topics.
Acceleration of multiple solution of a boundary value problem involving a linear algebraic system
Gazizov, Talgat R.; Kuksenko, Sergey P.; Surovtsev, Roman S.
2016-06-01
Multiple solution of a boundary value problem that involves a linear algebraic system is considered. New approach to acceleration of the solution is proposed. The approach uses the structure of the linear system matrix. Particularly, location of entries in the right columns and low rows of the matrix, which undergo variation due to the computing in the range of parameters, is used to apply block LU decomposition. Application of the approach is considered on the example of multiple computing of the capacitance matrix by method of moments used in numerical electromagnetics. Expressions for analytic estimation of the acceleration are presented. Results of the numerical experiments for solution of 100 linear systems with matrix orders of 1000, 2000, 3000 and different relations of variated and constant entries of the matrix show that block LU decomposition can be effective for multiple solution of linear systems. The speed up compared to pointwise LU factorization increases (up to 15) for larger number and order of considered systems with lower number of variated entries.
Reliable iterative methods for solving ill-conditioned algebraic systems
Padiy, Alexander
2000-01-01
The finite element method is one of the most popular techniques for numerical solution of partial differential equations. The rapid performance increase of modern computer systems makes it possible to tackle increasingly more difficult finite-element models arising in engineering practice. However,
Directory of Open Access Journals (Sweden)
Agus Maman Abadi
2016-04-01
Full Text Available The increasing need in techniques of storing big data presents a new challenge. One way to address this challenge is the use of distributed storage systems. One strategy that implemented in distributed data storage systems is the use of Erasure Code which applied to network coding. The code used in this technique is based on the algebraic structure which is called as vector space. Some studies have also been carried out to create code that is based on other algebraic structures such as module. In this study, we are going to try to set up a code based on the algebraic structure which is a generalization of the module that is semimodule by utilizing the max operations and sum operations at max plus algebra. The results of this study indicate that the max operation and the addition operation on max plus algebra cannot be used to establish a semimodule code, but by modifying the operation "+" as "min", we get a code based on semimodule. Keywords: code, distributed storage systems, network coding, semimodule, max plus algebra
Algebraic cobordism theory attached to algebraic equivalence
Krishna, Amalendu
2012-01-01
After the algebraic cobordism theory of Levine-Morel, we develop a theory of algebraic cobordism modulo algebraic equivalence. We prove that this theory can reproduce Chow groups modulo algebraic equivalence and the zero-th semi-topological K-groups. We also show that with finite coefficients, this theory agrees with the algebraic cobordism theory. We compute our cobordism theory for some low dimensional or special types of varieties. The results on infinite generation of some Griffiths groups by Clemens and on smash-nilpotence by Voevodsky and Voisin are also lifted and reinterpreted in terms of this cobordism theory.
Boicescu, V; Georgescu, G; Rudeanu, S
1991-01-01
The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz. The theory of LM-algebras has developed to a considerable extent both as an algebraic theory of intrinsic interest and in view of its applications to logic and switching theory.This book gives an overview of the theory, comprising both classical results and recent contributions, including those of the authors. N-valued and &THgr;-valued algebras are presented, as well as &THgr;-algebras with negation.Mathematicians interested in lattice theory or symbolic logic, and computer scientists, will find in this monograph stimulating material for further research.
Construction of the Model of the Lambda Calculus System with Algebraic Operators
Institute of Scientific and Technical Information of China (English)
陆汝占; 张政; 等
1991-01-01
A lambda system with algebraic operators,Lambda-plus system,is introduced.After giving the definitions of the system,we present a sufficient condition for formulating a model of the system.Finally,a model of such system is constructed.
Blyth, T S
2002-01-01
Basic Linear Algebra is a text for first year students leading from concrete examples to abstract theorems, via tutorial-type exercises. More exercises (of the kind a student may expect in examination papers) are grouped at the end of each section. The book covers the most important basics of any first course on linear algebra, explaining the algebra of matrices with applications to analytic geometry, systems of linear equations, difference equations and complex numbers. Linear equations are treated via Hermite normal forms which provides a successful and concrete explanation of the notion of linear independence. Another important highlight is the connection between linear mappings and matrices leading to the change of basis theorem which opens the door to the notion of similarity. This new and revised edition features additional exercises and coverage of Cramer's rule (omitted from the first edition). However, it is the new, extra chapter on computer assistance that will be of particular interest to readers:...
ALMA correlator computer systems
Pisano, Jim; Amestica, Rodrigo; Perez, Jesus
2004-09-01
We present a design for the computer systems which control, configure, and monitor the Atacama Large Millimeter Array (ALMA) correlator and process its output. Two distinct computer systems implement this functionality: a rack- mounted PC controls and monitors the correlator, and a cluster of 17 PCs process the correlator output into raw spectral results. The correlator computer systems interface to other ALMA computers via gigabit Ethernet networks utilizing CORBA and raw socket connections. ALMA Common Software provides the software infrastructure for this distributed computer environment. The control computer interfaces to the correlator via multiple CAN busses and the data processing computer cluster interfaces to the correlator via sixteen dedicated high speed data ports. An independent array-wide hardware timing bus connects to the computer systems and the correlator hardware ensuring synchronous behavior and imposing hard deadlines on the control and data processor computers. An aggregate correlator output of 1 gigabyte per second with 16 millisecond periods and computational data rates of approximately 1 billion floating point operations per second define other hard deadlines for the data processing computer cluster.
Linear algebra meets Lie algebra: the Kostant-Wallach theory
Shomron, Noam; Parlett, Beresford N.
2008-01-01
In two languages, Linear Algebra and Lie Algebra, we describe the results of Kostant and Wallach on the fibre of matrices with prescribed eigenvalues of all leading principal submatrices. In addition, we present a brief introduction to basic notions in Algebraic Geometry, Integrable Systems, and Lie Algebra aimed at specialists in Linear Algebra.
Linear algebra meets Lie algebra: the Kostant-Wallach theory
Shomron, Noam; Parlett, Beresford N.
2008-01-01
In two languages, Linear Algebra and Lie Algebra, we describe the results of Kostant and Wallach on the fibre of matrices with prescribed eigenvalues of all leading principal submatrices. In addition, we present a brief introduction to basic notions in Algebraic Geometry, Integrable Systems, and Lie Algebra aimed at specialists in Linear Algebra.
Geary, David C.; Hoard, Mary K.; Nugent, Lara; Rouder, Jeffrey N.
2015-01-01
The relation between performance on measures of algebraic cognition and acuity of the approximate number system (ANS) and memory for addition facts was assessed for 171 (92 girls) 9th graders, controlling parental education, sex, reading achievement, speed of numeral processing, fluency of symbolic number processing, intelligence, and the central executive component of working memory. The algebraic tasks assessed accuracy in placing x,y pairs in the coordinate plane, speed and accuracy of expression evaluation, and schema memory for algebra equations. ANS acuity was related to accuracy of placements in the coordinate plane and expression evaluation, but not schema memory. Frequency of fact-retrieval errors was related to schema memory but not coordinate plane or expression evaluation accuracy. The results suggest the ANS may contribute to or is influenced by spatial-numerical and numerical only quantity judgments in algebraic contexts, whereas difficulties in committing addition facts to long-term memory may presage slow formation of memories for the basic structure of algebra equations. More generally, the results suggest different brain and cognitive systems are engaged during the learning of different components of algebraic competence, controlling demographic and domain general abilities. PMID:26255604
Edwards, Harold M
1995-01-01
In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject
Equivariant Algebraic Cobordism
Heller, Jeremiah
2010-01-01
We define equivariant algebraic cobordism for a connected linear algebraic group $G$ over a field of characteristic zero. The construction is based on Totaro's idea of using algebraic approximations for $BG$. We establish the analogous of the properties of an oriented cohomology theory, prove some of the expected properties from an equivariant theory, and make a few computations.
Fault tolerant computing systems
Randell, B
1981-01-01
Fault tolerance involves the provision of strategies for error detection, damage assessment, fault treatment and error recovery. A survey is given of the different sorts of strategies used in highly reliable computing systems, together with an outline of recent research on the problems of providing fault tolerance in parallel and distributed computing systems. (15 refs).
Computer controlled antenna system
Raumann, N. A.
1972-01-01
The application of small computers using digital techniques for operating the servo and control system of large antennas is discussed. The advantages of the system are described. The techniques were evaluated with a forty foot antenna and the Sigma V computer. Programs have been completed which drive the antenna directly without the need for a servo amplifier, antenna position programmer or a scan generator.
Dynamics of number systems computation with arbitrary precision
Kurka, Petr
2016-01-01
This book is a source of valuable and useful information on the topics of dynamics of number systems and scientific computation with arbitrary precision. It is addressed to scholars, scientists and engineers, and graduate students. The treatment is elementary and self-contained with relevance both for theory and applications. The basic prerequisite of the book is linear algebra and matrix calculus. .
Investigating modularity in the analysis of process algebra models of biochemical systems
Ciocchetta, Federica; Hillston, Jane; 10.4204/EPTCS.19.4
2010-01-01
Compositionality is a key feature of process algebras which is often cited as one of their advantages as a modelling technique. It is certainly true that in biochemical systems, as in many other systems, model construction is made easier in a formalism which allows the problem to be tackled compositionally. In this paper we consider the extent to which the compositional structure which is inherent in process algebra models of biochemical systems can be exploited during model solution. In essence this means using the compositional structure to guide decomposed solution and analysis. Unfortunately the dynamic behaviour of biochemical systems exhibits strong interdependencies between the components of the model making decomposed solution a difficult task. Nevertheless we believe that if such decomposition based on process algebras could be established it would demonstrate substantial benefits for systems biology modelling. In this paper we present our preliminary investigations based on a case study of the phero...
Introduction to relation algebras relation algebras
Givant, Steven
2017-01-01
The first volume of a pair that charts relation algebras from novice to expert level, this text offers a comprehensive grounding for readers new to the topic. Upon completing this introduction, mathematics students may delve into areas of active research by progressing to the second volume, Advanced Topics in Relation Algebras; computer scientists, philosophers, and beyond will be equipped to apply these tools in their own field. The careful presentation establishes first the arithmetic of relation algebras, providing ample motivation and examples, then proceeds primarily on the basis of algebraic constructions: subalgebras, homomorphisms, quotient algebras, and direct products. Each chapter ends with a historical section and a substantial number of exercises. The only formal prerequisite is a background in abstract algebra and some mathematical maturity, though the reader will also benefit from familiarity with Boolean algebra and naïve set theory. The measured pace and outstanding clarity are particularly ...
Matsumoto, Kengo
2007-01-01
We have introduced a notion of $C^*$-symbolic dynamical system in [K. Matsumoto: Actions of symbolic dynamical systems on $C^*$-algebras, to appear in J. Reine Angew. Math.], that is a finite family of endomorphisms of a $C^*$-algebra with some conditions. The endomorphisms are indexed by symbols and yield both a subshift and a $C^*$-algebra of a Hilbert $C^*$-bimodule. The associated $C^*$-algebra with the $C^*$-symbolic dynamical system is regarded as a crossed product by the subshift. We will study a simplicity condition of the $C^*$-algebras of the $C^*$-symbolic dynamical systems. Some examples such as irrational rotation Cuntz-Krieger algebras will be studied.
Linear delay-differential systems with commensurate delays an algebraic approach
Gluesing-Luerssen, Heide
2002-01-01
The book deals with linear time-invariant delay-differential equations with commensurated point delays in a control-theoretic context. The aim is to show that with a suitable algebraic setting a behavioral theory for dynamical systems described by such equations can be developed. The central object is an operator algebra which turns out to be an elementary divisor domain and thus provides the main tool for investigating the corresponding matrix equations. The book also reports the results obtained so far for delay-differential systems with noncommensurate delays. Moreover, whenever possible it points out similarities and differences to the behavioral theory of multidimensional systems, which is based on a great deal of algebraic structure itself. The presentation is introductory and self-contained. It should also be accessible to readers with no background in delay-differential equations or behavioral systems theory. The text should interest researchers and graduate students.
Directory of Open Access Journals (Sweden)
Dejan V. Vuletić
2012-01-01
Full Text Available Computer systems are a critical component of the human society in the 21st century. Economic sector, defense, security, energy, telecommunications, industrial production, finance and other vital infrastructure depend on computer systems that operate at local, national or global scales. A particular problem is that, due to the rapid development of ICT and the unstoppable growth of its application in all spheres of the human society, their vulnerability and exposure to very serious potential dangers increase. This paper analyzes some typical attacks on computer systems.
THE STRUCTURE OF THE COMPUTATIONAL SIGNAL ALGEBRA AND ITS APPLICATION IN DIGITAL IMAGE PROCESSING
Directory of Open Access Journals (Sweden)
MARLIO PAREDES
2011-01-01
Full Text Available Este trabajo se inicia a partir del conocimiento de la estructura matemática del espacio de señales usado en el procesamiento de señales y provee el desarrollo de un marco teórico computacional de álgebra de señales para el modelamiento y procesamiento de aplicaciones usando imágenes digitales. Las estructuras matemáticas fueron implementadas sobre estructuras computacionales usando el lenguaje de programación Java como una herramienta para la codifi cación de los algoritmos. La herramienta implementada fue llamada JCID (Java Computational Image Developer, la cual permite implementar varios de los operadores del algebra de señales para señales de dimensión uno y dimensión dos, y la creación de nuevas entradas a través de la composición de los operadores básicos.
Energy Technology Data Exchange (ETDEWEB)
Nigro, Alessandro, E-mail: Alessandro.Nigro@mi.infn.it [Dipartimento di Fisica and INFN – Sezione di Milano, Università degli Studi di Milano I, Via Celoria 16, I-20133 Milano (Italy)
2013-06-21
We introduce a free field realization of the central extension of the Lie algebra D{sub q} of difference operators on the circle in terms of the fermionic η–ξ system. This realization admits a nontrivial Jordan block structure. We also review the free field realization of W{sub 1+∞} algebra, and point out some relations between its generators of weight zero and the local integrals of motion of Bazhanov, Lukyanov and Zamolodchikov. Finally we compute the finitized characters, and the continuum characters of the Local Integrals of Motion, and find out and interesting analogy with the generating functions for the counting of branched covers of elliptic curves.
Institute of Scientific and Technical Information of China (English)
Shuang-suo Zhao; Zhang-hua Luo; Guo-feng Zhang
2000-01-01
This paper presents optimum an one-parameter iteration (OOPI) method and a multi-parameter iteration direct (MPID) method for efficiently solving linear algebraic systems with low order matrix A and high order matrix B: Y = (A B)Y +Ф. On parallel computers (also on serial computer) the former will be efficient, even very efficient under certain conditions, the latter will be universally very efficient.
The Perlick system type I: From the algebra of symmetries to the geometry of the trajectories
Kuru, Ş.; Negro, J.; Ragnisco, O.
2017-10-01
In this paper, we investigate the main algebraic properties of the maximally superintegrable system known as "Perlick system type I". All possible values of the relevant parameters, K and β, are considered. In particular, depending on the sign of the parameter K entering in the metrics, the motion will take place on compact or non compact Riemannian manifolds. To perform our analysis we follow a classical variant of the so called factorization method. Accordingly, we derive the full set of constants of motion and construct their Poisson algebra. As it is expected for maximally superintegrable systems, the algebraic structure will actually shed light also on the geometric features of the trajectories, that will be depicted for different values of the initial data and of the parameters. Especially, the crucial role played by the rational parameter β will be seen "in action".
Liesen, Jörg
2015-01-01
This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...
Resilient computer system design
Castano, Victor
2015-01-01
This book presents a paradigm for designing new generation resilient and evolving computer systems, including their key concepts, elements of supportive theory, methods of analysis and synthesis of ICT with new properties of evolving functioning, as well as implementation schemes and their prototyping. The book explains why new ICT applications require a complete redesign of computer systems to address challenges of extreme reliability, high performance, and power efficiency. The authors present a comprehensive treatment for designing the next generation of computers, especially addressing safety-critical, autonomous, real time, military, banking, and wearable health care systems. § Describes design solutions for new computer system - evolving reconfigurable architecture (ERA) that is free from drawbacks inherent in current ICT and related engineering models § Pursues simplicity, reliability, scalability principles of design implemented through redundancy and re-configurability; targeted for energy-,...
Shafarevich, I
1994-01-01
This book, the first printing of which was published as volume 38 of the Encyclopaedia of Mathematical Sciences, presents a modern approach to homological algebra, based on the systematic use of the terminology and ideas of derived categories and derived functors. The book contains applications of homological algebra to the theory of sheaves on topological spaces, to Hodge theory, and to the theory of modules over rings of algebraic differential operators (algebraic D-modules). The authors Gelfand and Manin explain all the main ideas of the theory of derived categories. Both authors are well-known researchers and the second, Manin, is famous for his work in algebraic geometry and mathematical physics. The book is an excellent reference for graduate students and researchers in mathematics and also for physicists who use methods from algebraic geometry and algebraic topology.
SYMBOLIC ALGEBRAIC MANIPULATION BY DIGITAL COMPUTER IN PROBLEMS OF CONTROL THEORY.
shown, using a FORMAC program. The advantages over the conventional root locus method are discussed. Areas of possible future use of FORMAC in algebraic problems of control theory are discussed. (Author)
On Development of a Problem Based Learning System for Linear Algebra with Simple Input Method
Yokota, Hisashi
2011-08-01
Learning how to express a matrix using a keyboard inputs requires a lot of time for most of college students. Therefore, for a problem based learning system for linear algebra to be accessible for college students, it is inevitable to develop a simple method for expressing matrices. Studying the two most widely used input methods for expressing matrices, a simpler input method for expressing matrices is obtained. Furthermore, using this input method and educator's knowledge structure as a concept map, a problem based learning system for linear algebra which is capable of assessing students' knowledge structure and skill is developed.
Iftime, OV; Zwart, HJ; Curtain, RF
2005-01-01
We obtain a representation of all self-adjoint solutions of the control algebraic Riccati equation associated to the infinite-dimensional state linear system Sigma(A, B, C) under the following assumptions: A generates a C-0-group, the system is output stabilizable, strongly detectable and the dual R
The numerical solution of differential-algebraic systems by Runge-Kutta methods
Hairer, Ernst; Lubich, Christian
1989-01-01
The term differential-algebraic equation was coined to comprise differential equations with constraints (differential equations on manifolds) and singular implicit differential equations. Such problems arise in a variety of applications, e.g. constrained mechanical systems, fluid dynamics, chemical reaction kinetics, simulation of electrical networks, and control engineering. From a more theoretical viewpoint, the study of differential-algebraic problems gives insight into the behaviour of numerical methods for stiff ordinary differential equations. These lecture notes provide a self-contained and comprehensive treatment of the numerical solution of differential-algebraic systems using Runge-Kutta methods, and also extrapolation methods. Readers are expected to have a background in the numerical treatment of ordinary differential equations. The subject is treated in its various aspects ranging from the theory through the analysis to implementation and applications.
De Sole, Alberto; Kac, Victor G.; Valeri, Daniele
2013-10-01
We describe of the generalized Drinfeld-Sokolov Hamiltonian reduction for the construction of classical -algebras within the framework of Poisson vertex algebras. In this context, the gauge group action on the phase space is translated in terms of (the exponential of) a Lie conformal algebra action on the space of functions. Following the ideas of Drinfeld and Sokolov, we then establish under certain sufficient conditions the applicability of the Lenard-Magri scheme of integrability and the existence of the corresponding integrable hierarchy of bi-Hamiltonian equations.
Lectures on algebraic statistics
Drton, Mathias; Sullivant, Seth
2009-01-01
How does an algebraic geometer studying secant varieties further the understanding of hypothesis tests in statistics? Why would a statistician working on factor analysis raise open problems about determinantal varieties? Connections of this type are at the heart of the new field of "algebraic statistics". In this field, mathematicians and statisticians come together to solve statistical inference problems using concepts from algebraic geometry as well as related computational and combinatorial techniques. The goal of these lectures is to introduce newcomers from the different camps to algebraic statistics. The introduction will be centered around the following three observations: many important statistical models correspond to algebraic or semi-algebraic sets of parameters; the geometry of these parameter spaces determines the behaviour of widely used statistical inference procedures; computational algebraic geometry can be used to study parameter spaces and other features of statistical models.
Second-Order Systems of ODEs Admitting Three-Dimensional Lie Algebras and Integrability
Directory of Open Access Journals (Sweden)
Muhammad Ayub
2013-01-01
the case of k≥3. We discuss the singular invariant representations of canonical forms for systems of two second-order ODEs admitting three-dimensional Lie algebras. Furthermore, we give an integration procedure for canonical forms for systems of two second-order ODEs admitting three-dimensional Lie algebras which comprises of two approaches, namely, division into four types I, II, III, and IV and that of integrability of the invariant representations. We prove that if a system of two second-order ODEs has a three-dimensional solvable Lie algebra, then, its general solution can be obtained from a partially linear, partially coupled or reduced invariantly represented system of equations. A natural extension of this result is provided for a system of two kth-order (k≥3 ODEs. We present illustrative examples of familiar integrable physical systems which admit three-dimensional Lie algebras such as the classical Kepler problem and the generalized Ermakov systems that give rise to closed trajectories.
Equations of motion for a time-dependent open system: An algebraic approach
Energy Technology Data Exchange (ETDEWEB)
Nasertayoob, Payam [Department of Chemistry, Amirkabir University of Technology (Polytechnic), Tehran (Iran, Islamic Republic of); Department of Mathematics, Amirkabir University of Technology (Polytechnic), Tehran (Iran, Islamic Republic of); Sabbaghan, Masoud, E-mail: sabbagh@khayam.ut.ac.ir [Department of Mathematics, I.A.U. Lahijan Branch, Lahijan (Iran, Islamic Republic of)
2013-02-01
Highlights: ► Based on the concept of quantum densities an algebraic equation is introduced. ► Heisenberg equation and hypervirial theorem are derived based on the algebraic equation. ► Quantum Navier–Stokes equation is derived based on the algebraic equation. ► Differential form of the force law and local virial theorem are extracted. ► Central equations in QTAIM are extracted without referring to quantum stationary action. - Abstract: An algebraic approach based on the concept of local densities is introduced in order to provide an alternative derivation of several equations central to the hydrodynamical formulation of quantum mechanics. The origin of this work lays in an algebraic equation which is built based on the concept of quantum densities. This enables us to derive the regional and local forms of several significant quantum laws and equations, namely Heisenberg equation of motion, hypervirial theory and quantum Navier–Stokes equation. In particular, atomic force law and local virial theorem for a time-dependent open system are extracted without referring to rigorous Schwinger’s principle of stationary action.
Algorithms in Algebraic Geometry
Dickenstein, Alicia; Sommese, Andrew J
2008-01-01
In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its
Discrete Integrable Systems and Poisson Algebras From Cluster Maps
Fordy, Allan P.; Hone, Andrew
2014-01-01
We consider nonlinear recurrences generated from cluster mutations applied to quivers that have the property of being cluster mutation-periodic with period 1. Such quivers were completely classified by Fordy and Marsh, who characterised them in terms of the skew-symmetric matrix that defines the quiver. The associated nonlinear recurrences are equivalent to birational maps, and we explain how these maps can be endowed with an invariant Poisson bracket and/or presymplectic structure. Upon applying the algebraic entropy test, we are led to a series of conjectures which imply that the entropy of the cluster maps can be determined from their tropical analogues, which leads to a sharp classification result. Only four special families of these maps should have zero entropy. These families are examined in detail, with many explicit examples given, and we show how they lead to discrete dynamics that is integrable in the Liouville-Arnold sense.
Energy Technology Data Exchange (ETDEWEB)
Richgels, M A; Biffle, J H
1980-09-01
ALGEBRA is a program that allows the user to process output data from finite-element analysis codes before they are sent to plotting routines. These data take the form of variable values (stress, strain, and velocity components, etc.) on a tape that is both the output tape from the analyses code and the input tape to ALGEBRA. The ALGEBRA code evaluates functions of these data and writes the function values on an output tape that can be used as input to plotting routines. Convenient input format and error detection capabilities aid the user in providing ALGEBRA with the functions to be evaluated. 1 figure.
Left Artinian Algebraic Algebras
Institute of Scientific and Technical Information of China (English)
S. Akbari; M. Arian-Nejad
2001-01-01
Let R be a left artinian central F-algebra, T(R) = J(R) + [R, R],and U(R) the group of units of R. As one of our results, we show that, if R is algebraic and char F = 0, then the number of simple components of -R = R/J(R)is greater than or equal to dimF R/T(R). We show that, when char F = 0 or F is uncountable, R is algebraic over F if and only if [R, R] is algebraic over F. As another approach, we prove that R is algebraic over F if and only if the derived subgroup of U(R) is algebraic over F. Also, we present an elementary proof for a special case of an old question due to Jacobson.
GPU TECHNOLOGIES EMBODIED IN PARALLEL SOLVERS OF LINEAR ALGEBRAIC EQUATION SYSTEMS
Directory of Open Access Journals (Sweden)
Sidorov Alexander Vladimirovich
2012-10-01
Full Text Available The author reviews existing shareware solvers that are operated by graphical computer devices. The purpose of this review is to explore the opportunities and limitations of the above parallel solvers applicable for resolution of linear algebraic problems that arise at Research and Educational Centre of Computer Modeling at MSUCE, and Research and Engineering Centre STADYO. The author has explored new applications of the GPU in the PETSc suite and compared them with the results generated absent of the GPU. The research is performed within the CUSP library developed to resolve the problems of linear algebra through the application of GPU. The author has also reviewed the new MAGMA project which is analogous to LAPACK for the GPU.
Algebraic partial Boolean algebras
Energy Technology Data Exchange (ETDEWEB)
Smith, Derek [Math Department, Lafayette College, Easton, PA 18042 (United States)
2003-04-04
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A{sub 5} sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E{sub 8}.
Computer network defense system
Urias, Vincent; Stout, William M. S.; Loverro, Caleb
2017-08-22
A method and apparatus for protecting virtual machines. A computer system creates a copy of a group of the virtual machines in an operating network in a deception network to form a group of cloned virtual machines in the deception network when the group of the virtual machines is accessed by an adversary. The computer system creates an emulation of components from the operating network in the deception network. The components are accessible by the group of the cloned virtual machines as if the group of the cloned virtual machines was in the operating network. The computer system moves network connections for the group of the virtual machines in the operating network used by the adversary from the group of the virtual machines in the operating network to the group of the cloned virtual machines, enabling protecting the group of the virtual machines from actions performed by the adversary.
On a modification of minimal iteration methods for solving systems of linear algebraic equations
Yukhno, L. F.
2010-04-01
Modifications of certain minimal iteration methods for solving systems of linear algebraic equations are proposed and examined. The modified methods are shown to be superior to the original versions with respect to the round-off error accumulation, which makes them applicable to solving ill-conditioned problems. Numerical results demonstrating the efficiency of the proposed modifications are given.
Hrubik-Vulanovic, Tatjana
2013-01-01
The purpose of this study was to investigate how intelligent tutoring system ALEKS, which was implemented in remedial Basic Algebra courses, affected students' success in subsequent lecture courses and how former ALEKS students and instructors in lecture courses perceived ALEKS learning environment. ALEKS courses were delivered in emporium style:…
Hrubik-Vulanovic, Tatjana
2013-01-01
The purpose of this study was to investigate how intelligent tutoring system ALEKS, which was implemented in remedial Basic Algebra courses, affected students' success in subsequent lecture courses and how former ALEKS students and instructors in lecture courses perceived ALEKS learning environment. ALEKS courses were delivered in emporium style:…
STABILITY RADIUS OF NON-SMOOTH PRITCHARD-SALAMON SYSTEMS AND THE ALGEBRAIC RICCATI EQUATION
Institute of Scientific and Technical Information of China (English)
Weisheng JIANG; Falun HUANG; Tingyu ZHU
2009-01-01
The authors discuss the stability radius of the non-smooth Pritchard-Salamon systems under structured perturbations. A formula for the stability radius in terms of the norm of a certain input-output operator is obtained. Furthermore, the relationship between stability radius and the solvability of some type of algebraic Riccati equations is given.
Algebraic Treatment of the MIC-Kepler System in Spherical Coordinates
Institute of Scientific and Technical Information of China (English)
M. T. Chefrour
2007-01-01
@@ The MIC-Kepler system is studied via the Milshtein-Strakhovenko variant of the so(2,1) Lie algebra. Green's function is constructed in spherical coordinates, with the help of the Kustaanheimo-Stiefel variables and the generators of the SO(2,1) group. The energy spectrum and the normalized wavefunctions of the bound states are obtained.
Energy Technology Data Exchange (ETDEWEB)
Lee, Young Jae; Lee, Hae Cho; Lee, Ho Yeun; Kim, Young Taek; Lee, Sung Kyu; Park, Jeong Suk; Nam, Ji Wha; Kim, Soon Kon; Yang, Sung Un; Sohn, Jae Min; Moon, Soon Sung; Park, Bong Sik; Lee, Byung Heon; Park, Sun Hee; Kim, Jin Hee; Hwang, Hyeoi Sun; Lee, Hee Ja; Hwang, In A. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1993-12-01
The report described the operation and the trouble shooting of main computer and KAERINet. The results of the project are as follows; 1. The operation and trouble shooting of the main computer system. (Cyber 170-875, Cyber 960-31, VAX 6320, VAX 11/780). 2. The operation and trouble shooting of the KAERINet. (PC to host connection, host to host connection, file transfer, electronic-mail, X.25, CATV etc.). 3. The development of applications -Electronic Document Approval and Delivery System, Installation the ORACLE Utility Program. 22 tabs., 12 figs. (Author) .new.
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.
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.
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…
Directory of Open Access Journals (Sweden)
V. Yu. Kleshnin
2016-01-01
Full Text Available The article describes the matrix algebra libraries based on the modern technologies of parallel programming for the Spectrum software, which can use a spectral method (in the spectral form of mathematical description to analyse, synthesise and identify deterministic and stochastic dynamical systems. The developed matrix algebra libraries use the following technologies for the GPUs: OmniThreadLibrary, OpenMP, Intel Threading Building Blocks, Intel Cilk Plus for CPUs nVidia CUDA, OpenCL, and Microsoft Accelerated Massive Parallelism.The developed libraries support matrices with real elements (single and double precision. The matrix dimensions are limited by 32-bit or 64-bit memory model and computer configuration. These libraries are general-purpose and can be used not only for the Spectrum software. They can also find application in the other projects where there is a need to perform operations with large matrices.The article provides a comparative analysis of the libraries developed for various matrix operations (addition, subtraction, scalar multiplication, multiplication, powers of matrices, tensor multiplication, transpose, inverse matrix, finding a solution of the system of linear equations through the numerical experiments using different CPU and GPU. The article contains sample programs and performance test results for matrix multiplication, which requires most of all computational resources in regard to the other operations.
On the cohomology of Leibniz conformal algebras
Zhang, Jiao
2015-04-01
We construct a new cohomology complex of Leibniz conformal algebras with coefficients in a representation instead of a module. The low-dimensional cohomology groups of this complex are computed. Meanwhile, we construct a Leibniz algebra from a Leibniz conformal algebra and prove that the category of Leibniz conformal algebras is equivalent to the category of equivalence classes of formal distribution Leibniz algebras.
Family of N-dimensional superintegrable systems and quadratic algebra structures
Fazlul Hoque, Md; Marquette, Ian; Zhang, Yao-Zhong
2016-01-01
Classical and quantum superintegrable systems have a long history and they possess more integrals of motion than degrees of freedom. They have many attractive properties, wide applications in modern physics and connection to many domains in pure and applied mathematics. We overview two new families of superintegrable Kepler-Coulomb systems with non-central terms and superintegrable Hamiltonians with double singular oscillators of type (n, N — n) in N-dimensional Euclidean space. We present their quadratic and polynomial algebras involving Casimir operators of so(N + 1) Lie algebras that exhibit very interesting decompositions Q(3) ⊕ so(N — 1), Q(3) ⊕ so(n) ⊕ so(N — n) and the cubic Casimir operators. The realization of these algebras in terms of deformed oscillator enables the determination of a finite dimensional unitary representation. We present algebraic derivations of the degenerate energy spectra of these systems and relate them with the physical spectra obtained from the separation of variables.
Gunasekaran, Sundaram
Food quality is of paramount consideration for all consumers, and its importance is perhaps only second to food safety. By some definition, food safety is also incorporated into the broad categorization of food quality. Hence, the need for careful and accurate evaluation of food quality is at the forefront of research and development both in the academia and industry. Among the many available methods for food quality evaluation, computer vision has proven to be the most powerful, especially for nondestructively extracting and quantifying many features that have direct relevance to food quality assessment and control. Furthermore, computer vision systems serve to rapidly evaluate the most readily observable foods quality attributes - the external characteristics such as color, shape, size, surface texture etc. In addition, it is now possible, using advanced computer vision technologies, to “see” inside a food product and/or package to examine important quality attributes ordinarily unavailable to human evaluators. With rapid advances in electronic hardware and other associated imaging technologies, the cost-effectiveness and speed of computer vision systems have greatly improved and many practical systems are already in place in the food industry.
Directory of Open Access Journals (Sweden)
Qiang Zang
2013-01-01
Full Text Available For nonlinear differential-algebraic-equation subsystems, whose index is one and interconnection input is locally measurable, the problem of invertibility is discussed and the results are applied to the power systems component decentralized control. The inverse systems’ definitions for such a class of differential-algebraic-equation subsystems are put forward. A recursive algorithm is proposed to judge whether the controlled systems are invertible. Then physically feasible α-order integral right inverse systems are constructed, with which the composite systems are linearizaed and decoupled. Finally, decentralized excitation and valve coordinative control for one synchronous generator within multimachine power systems are studied and the simulation results based on MATLAB demonstrate the effectiveness of the control scheme proposed in this paper.
Transforming an Introductory Linear Algebra Course with a TI-92 Hand-Held Computer.
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…
Transforming an Introductory Linear Algebra Course with a TI-92 Hand-Held Computer.
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…
Control of discrete event systems : research at the interface of control theory and computer science
Overkamp, A.A.F.; Schuppen, J.H. van
1995-01-01
This expository paper is directed to a general audience of engineers, mathematicians, and computer scientists. A discrete event system is a mathematical model (in the form of an automaton, Petri nets, or process algebra) of, for example, a computer controlled engineering system such as a communicat
Computational systems chemical biology.
Oprea, Tudor I; May, Elebeoba E; Leitão, Andrei; Tropsha, Alexander
2011-01-01
There is a critical need for improving the level of chemistry awareness in systems biology. The data and information related to modulation of genes and proteins by small molecules continue to accumulate at the same time as simulation tools in systems biology and whole body physiologically based pharmacokinetics (PBPK) continue to evolve. We called this emerging area at the interface between chemical biology and systems biology systems chemical biology (SCB) (Nat Chem Biol 3: 447-450, 2007).The overarching goal of computational SCB is to develop tools for integrated chemical-biological data acquisition, filtering and processing, by taking into account relevant information related to interactions between proteins and small molecules, possible metabolic transformations of small molecules, as well as associated information related to genes, networks, small molecules, and, where applicable, mutants and variants of those proteins. There is yet an unmet need to develop an integrated in silico pharmacology/systems biology continuum that embeds drug-target-clinical outcome (DTCO) triplets, a capability that is vital to the future of chemical biology, pharmacology, and systems biology. Through the development of the SCB approach, scientists will be able to start addressing, in an integrated simulation environment, questions that make the best use of our ever-growing chemical and biological data repositories at the system-wide level. This chapter reviews some of the major research concepts and describes key components that constitute the emerging area of computational systems chemical biology.
Developable algebraic surfaces
Institute of Scientific and Technical Information of China (English)
CHEN Dongren; WANG Guojin
2004-01-01
An algebraic surface can be defined by an implicit polynomial equation F(x,y,z)=0. In this paper, general characterizations of developable algebraic surfaces of arbitrary degree are presented. Using the shift operators of the subscripts of Bézier ordinates, the uniform apparent discriminants of developable algebraic surfaces to their Bézier ordinates are given directly. To degree 2 algebraic surfaces, which are widely used in computer aided geometric design and graphics, all possible developable surface types are obtained. For more conveniently applying algebraic surfaces of high degree to computer aided geometric design, the notion of ε-quasi-developable surfaces is introduced, and an example of using a quasi-developable algebraic surface of degree 3 to interpolate three curves of degree 2 is given.
SLAPP: A systolic linear algebra parallel processor
Energy Technology Data Exchange (ETDEWEB)
Drake, B.L.; Luk, F.T.; Speiser, J.M.; Symanski, J.J. (Naval Ocean Systems Center and Cornell Univ.)
1987-07-01
Systolic array computer architectures provide a means for fast computation of the linear algebra algorithms that form the building blocks of many signal-processing algorithms, facilitating their real-time computation. For applications to signal processing, the systolic array operates on matrices, an inherently parallel view of the data, using numerical linear algebra algorithms that have been suitably parallelized to efficiently utilize the available hardware. This article describes work currently underway at the Naval Ocean Systems Center, San Diego, California, to build a two-dimensional systolic array, SLAPP, demonstrating efficient and modular parallelization of key matric computations for real-time signal- and image-processing problems.
Control of Linear Systems Over Commutative Normed Algebras with Applications.
1987-02-01
Identify by block number) System Theory, Linear Systems, Control, Systems with Time Delays, Time - Varying Systems, State- Space Models, Pole...modes for the class of linear time -varying systems. These concepts are defined in terms of a noncommutative factorization of opera- tor polynomials...classes of complex linear systems, including systems with time delays, systems with unknown parameters and time -varying systems. In the work on
On the Use of an Algebraic Signature Analyzer for Mixed-Signal Systems Testing
Directory of Open Access Journals (Sweden)
Vadim Geurkov
2014-01-01
Full Text Available We propose an approach to design of an algebraic signature analyzer that can be used for mixed-signal systems testing. The analyzer does not contain carry propagating circuitry, which improves its performance as well as fault tolerance. The common design technique of a signature analyzer for mixed-signal systems is based on the rules of an arithmetic finite field. The application of this technique to the systems with an arbitrary radix is a challenging task and the devices designed possess high hardware complexity. The proposed technique is simple and applicable to systems of any size and radix. The hardware complexity is low. The technique can also be used in arithmetic/algebraic coding and cryptography.
Institute of Scientific and Technical Information of China (English)
张卫华; 吴重光; 王春利
2011-01-01
Qualitative algebraic equations are the basis of qualitative simulation, which are used to express the dynamic behavior of steady-state continuous processes. When the vaiues and operation of qualitative variables are redefined, qualitative algebraic equations can be transformed into signed direct graphs, which are frequently used to predict the trend of dynamic changes. However, it is difficult to use traditional qualitative algebra methods based on artificial trial and error to solve a complex problem for dynamic trends. An important aspect of modern qualitative algebra is to model and characterize complex systems with the corresponding computer-aided automatic reasoning.In this study, a qualitative affection equation based on multiple conditions is proposed, which enables the signed direct graphs to describe complex systems better and improves the fault diagnosis resolution. The application to an industrial case shows that the method performs well.
Directory of Open Access Journals (Sweden)
Kody M. Powell
2016-03-01
Full Text Available This work presents a methodology to represent logical decisions in differential algebraic equation simulation and constrained optimization problems using a set of continuous algebraic equations. The formulations may be used when state variables trigger a change in process dynamics, and introduces a pseudo-binary decision variable, which is continuous, but should only have valid solutions at values of either zero or one within a finite time horizon. This formulation enables dynamic optimization problems with logical disjunctions to be solved by simultaneous solution methods without using methods such as mixed integer programming. Several case studies are given to illustrate the value of this methodology including nonlinear model predictive control of a chemical reactor using a surge tank with overflow to buffer disturbances in feed flow rate. Although this work contains novel methodologies for solving dynamic algebraic equation (DAE constrained problems where the system may experience an abrupt change in dynamics that may otherwise require a conditional statement, there remain substantial limitations to this methodology, including a limited domain where problems may converge and the possibility for ill-conditioning. Although the problems presented use only continuous algebraic equations, the formulation has inherent non-smoothness. Hence, these problems must be solved with care and only in select circumstances, such as in simulation or situations when the solution is expected to be near the solver’s initial point.
Dynamical scaling and crossover from algebraic to logarithmic growth in dilute systems
DEFF Research Database (Denmark)
Mouritsen, Ole G.; Shah, Peter Jivan
1989-01-01
The ordering dynamics of the two-dimensional Ising antiferromagnet with mobile vacancies and nonconserved order parameter is studied by Monte Carlo temperature-quenching experiments. The domain-size distribution function is shown to obey dynamical scaling. A crossover is found from an algebraic g...... growth law for the pure system to effectively logarithmic growth behavior in the dilute system, in accordance with recent experiments on ordering kinetics in impure chemisorbed overlayers and off-stoichiometric alloys....
Won, Chang-Hee; Michel, Anthony N
2008-01-01
This volume - dedicated to Michael K. Sain on the occasion of his seventieth birthday - is a collection of chapters covering recent advances in stochastic optimal control theory and algebraic systems theory. Written by experts in their respective fields, the chapters are thematically organized into four parts: Part I focuses on statistical control theory, where the cost function is viewed as a random variable and performance is shaped through cost cumulants. In this respect, statistical control generalizes linear-quadratic-Gaussian and H-infinity control. Part II addresses algebraic systems th
Solving Quantum-Nonautonomous System with Non-Hermitian Hamiltonians by Algebraic Method
Institute of Scientific and Technical Information of China (English)
WEI Lian-Fu; WANG Shun-Jin
2001-01-01
A convenient method to exactly solve the quantum-nonautonomous systems with non-Hermitian Hamiltonians is proposed. It is shown that a nonadiabatic complete biorthonormal set can be easily obtained by the gauge transformation method in which the algebraic structure of systems has been used. The nonunitary evolution operator is also found by choosing a special gauge function. All auxiliary parameters introduced in the present approach are only determined by some algebraic equations. The dynamics of two quantum-nonautonomous systems ruled by non-Hermitian Hamiltonians, including a two-photon ionization process involving two-state only and a mesoscopic RLC circuit with a source, are treated as the demonstration of our general approach.``
A computer code for calculations in the algebraic collective model of the atomic nucleus
Welsh, T A
2016-01-01
A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1,1) x SO(5) dynamical group. This, in particular, obviates the use of coefficients of fractional parentage. This paper reviews the mathematical formulation of the ACM, and serves as a manual for the code. The code makes use of expressions for matrix elements derived elsewhere and newly derived matrix elements of the operators [pi x q x pi]_0 and [pi x pi]_{LM}, where q_M are the model's quadrupole moments, and pi_N are corresponding conjugate momenta (-2>=M,N<=2). The code also provides ready access to SO(3)-reduced SO(5) Clebsch-Gordan coefficients through data files provided with the code.
Algebraic and structural automata theory
Mikolajczak, B
1991-01-01
Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering. It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.
Lefschetz, Solomon
2005-01-01
An introduction to algebraic geometry and a bridge between its analytical-topological and algebraical aspects, this text for advanced undergraduate students is particularly relevant to those more familiar with analysis than algebra. 1953 edition.
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
2016-01-01
International audience; Sakata generalized the Berlekamp -- Massey algorithm to $n$ dimensions in~1988. The Berlekamp -- Massey -- Sakata (BMS)algorithm can be used for finding a Gröbner basis of a $0$-dimensionalideal of relations verified by a table. We investigate this problem usinglinear algebra techniques, with motivations such as accelerating change ofbasis algorithms (FGLM) or improving their complexity.We first define and characterize multidimensional linear recursive sequencesfor $0$...
Algorithms of estimation for nonlinear systems a differential and algebraic viewpoint
Martínez-Guerra, Rafael
2017-01-01
This book acquaints readers with recent developments in dynamical systems theory and its applications, with a strong focus on the control and estimation of nonlinear systems. Several algorithms are proposed and worked out for a set of model systems, in particular so-called input-affine or bilinear systems, which can serve to approximate a wide class of nonlinear control systems. These can either take the form of state space models or be represented by an input-output equation. The approach taken here further highlights the role of modern mathematical and conceptual tools, including differential algebraic theory, observer design for nonlinear systems and generalized canonical forms.
Numerical linear algebra theory and applications
Beilina, Larisa; Karchevskii, Mikhail
2017-01-01
This book combines a solid theoretical background in linear algebra with practical algorithms for numerical solution of linear algebra problems. Developed from a number of courses taught repeatedly by the authors, the material covers topics like matrix algebra, theory for linear systems of equations, spectral theory, vector and matrix norms combined with main direct and iterative numerical methods, least squares problems, and eigen problems. Numerical algorithms illustrated by computer programs written in MATLAB® are also provided as supplementary material on SpringerLink to give the reader a better understanding of professional numerical software for the solution of real-life problems. Perfect for a one- or two-semester course on numerical linear algebra, matrix computation, and large sparse matrices, this text will interest students at the advanced undergraduate or graduate level.
The Design of a Language for Algebraic Computation Systems
1983-08-01
lO 3.1. In traduction ...is a very common operation, so an underlying machine addressing mode that ignores the type field would be bandy. Target machines which have only...simple addressing modes will require frequent use of masking or shifting instructions. Encoding of types by association of storage blocks The Big Bag
Heidergott, Bernd; van der Woude, Jacob
2014-01-01
Trains pull into a railroad station and must wait for each other before leaving again in order to let passengers change trains. How do mathematicians then calculate a railroad timetable that accurately reflects their comings and goings? One approach is to use max-plus algebra, a framework used to model Discrete Event Systems, which are well suited to describe the ordering and timing of events. This is the first textbook on max-plus algebra, providing a concise and self-contained introduction to the topic. Applications of max-plus algebra abound in the world around us. Traffic systems, compu
Graefe, Eva-Maria; Korsch, Hans Jürgen; Rush, Alexander
2016-04-01
Bosonic quantum conversion systems can be modeled by many-particle single-mode Hamiltonians describing a conversion of m molecules of type A into n molecules of type B and vice versa. These Hamiltonians are analyzed in terms of generators of a polynomially deformed su(2) algebra. In the mean-field limit of large particle numbers, these systems become classical and their Hamiltonian dynamics can again be described by polynomial deformations of a Lie algebra, where quantum commutators are replaced by Poisson brackets. The Casimir operator restricts the motion to Kummer shapes, deformed Bloch spheres with cusp singularities depending on m and n . It is demonstrated that the many-particle eigenvalues can be recovered from the mean-field dynamics using a WKB-type quantization condition. The many-particle state densities can be semiclassically approximated by the time periods of periodic orbits, which show characteristic steps and singularities related to the fixed points, whose bifurcation properties are analyzed.
Fault detection and diagnosis in nonlinear systems a differential and algebraic viewpoint
Martinez-Guerra, Rafael
2014-01-01
The high reliability required in industrial processes has created the necessity of detecting abnormal conditions, called faults, while processes are operating. The term fault generically refers to any type of process degradation, or degradation in equipment performance because of changes in the process's physical characteristics, process inputs or environmental conditions. This book is about the fundamentals of fault detection and diagnosis in a variety of nonlinear systems which are represented by ordinary differential equations. The fault detection problem is approached from a differential algebraic viewpoint, using residual generators based upon high-gain nonlinear auxiliary systems (‘observers’). A prominent role is played by the type of mathematical tools that will be used, requiring knowledge of differential algebra and differential equations. Specific theorems tailored to the needs of the problem-solving procedures are developed and proved. Applications to real-world problems, both with constant an...
Fang, Hao; Wei, Yue; Chen, Jie; Xin, Bin
2017-04-01
The problem of flocking of second-order multiagent systems with connectivity preservation is investigated in this paper. First, for estimating the algebraic connectivity as well as the corresponding eigenvector, a new decentralized inverse power iteration scheme is formulated. Then, based on the estimation of the algebraic connectivity, a set of distributed gradient-based flocking control protocols is built with a new class of generalized hybrid potential fields which could guarantee collision avoidance, desired distance stabilization, and the connectivity of the underlying communication network simultaneously. What is important is that the proposed control scheme allows the existing edges to be broken without violation of connectivity constraints, and thus yields more flexibility of motions and reduces the communication cost for the multiagent system. In the end, nontrivial comparative simulations and experimental results are performed to demonstrate the effectiveness of the theoretical results and highlight the advantages of the proposed estimation scheme and control algorithm.
Beilinson, Alexander
2004-01-01
Chiral algebras form the primary algebraic structure of modern conformal field theory. Each chiral algebra lives on an algebraic curve, and in the special case where this curve is the affine line, chiral algebras invariant under translations are the same as well-known and widely used vertex algebras. The exposition of this book covers the following topics: the "classical" counterpart of the theory, which is an algebraic theory of non-linear differential equations and their symmetries; the local aspects of the theory of chiral algebras, including the study of some basic examples, such as the ch
Directory of Open Access Journals (Sweden)
Frank Roumen
2017-01-01
Full Text Available We will define two ways to assign cohomology groups to effect algebras, which occur in the algebraic study of quantum logic. The first way is based on Connes' cyclic cohomology. The resulting cohomology groups are related to the state space of the effect algebra, and can be computed using variations on the Kunneth and Mayer-Vietoris sequences. The second way involves a chain complex of ordered abelian groups, and gives rise to a cohomological characterization of state extensions on effect algebras. This has applications to no-go theorems in quantum foundations, such as Bell's theorem.
Solving differential–algebraic equation systems by means of index reduction methodology
DEFF Research Database (Denmark)
Sørensen, Kim; Houbak, Niels; Condra, Thomas
2006-01-01
of a number of differential equations and algebraic equations — a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of ordinary differential equations — ODEs....
A Geometric Index Reduction Method for Implicit Systems of Differential Algebraic Equations
D'Alfonso, Lisi; Ollivier, François; Sedoglavic, Alexandre; Solernó, Pablo
2010-01-01
This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely algebraic (polynomial) equation plus an under-determined ODE (that is, a semi-explicit DAE system of differentiation index 1) in as many variables as the order of the input system. This can be done by means of a Kronecker-type algorithm with bounded complexity.
Wang, Hongzhu; Yu, Tianqiu; Xiao, Jinmei
2016-08-01
From the perspective of strong transitivity, a controller design method is provided to simultaneously stabilise a collection of time-varying linear systems within the framework of nest algebras. In particular, all simultaneously stabilising controllers for a class of linear plants are characterised based on the doubly coprime factorisations. These results hold as well in the time-invariant case. An illustrative example is given to demonstrate the validity of the method.
PRECONDITIONING HIGHER ORDER FINITE ELEMENT SYSTEMS BY ALGEBRAIC MULTIGRID METHOD OF LINEAR ELEMENTS
Institute of Scientific and Technical Information of China (English)
Yun-qing Huang; Shi Shu; Xi-jun Yu
2006-01-01
We present and analyze a robust preconditioned conjugate gradient method for the higher order Lagrangian finite element systems of a class of elliptic problems. An auxiliary linear element stiffness matrix is chosen to be the preconditioner for higher order finite elements. Then an algebraic multigrid method of linear finite element is applied for solving the preconditioner. The optimal condition number which is independent of the mesh size is obtained. Numerical experiments confirm the efficiency of the algorithm.
On the topology of real algebraic plane curves
DEFF Research Database (Denmark)
Cheng, Jinsan; Lazard, Sylvain; Peñaranda, Luis
2010-01-01
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of singular and critical points, is also relevant. A challenge is to compute efficiently this information for the given...... coordinate system even if the curve is not in generic position. Previous methods based on the cylindrical algebraic decomposition use sub-resultant sequences and computations with polynomials with algebraic coefficients. A novelty of our approach is to replace these tools by Gröbner basis computations...... and isolation with rational univariate representations. This has the advantage of avoiding computations with polynomials with algebraic coefficients, even in non-generic positions. Our algorithm isolates critical points in boxes and computes a decomposition of the plane by rectangular boxes. This decomposition...
Topics in quaternion linear algebra
Rodman, Leiba
2014-01-01
Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses...
Third SIAM conference on applied linear algebra and short course on linear algebra in statistics
Energy Technology Data Exchange (ETDEWEB)
1988-01-01
This report contains abstracts on the following themes: Large Scale Computing and Numerical Methods; Inverse Eigenvalue Problems; Qualitative and Combinatorial Analysis of Matrices; Linear Systems and Control; Parallel Matrix Computations; Signal Processing; Optimization; Multivariate Statistics; Core Linear Algebra; and Iterative Methods for Solving Linear Systems. (LSP)
Exact linear modeling using Ore algebras
Schindelar, Kristina; Zerz, Eva
2010-01-01
Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely as possible. The case of operators with constant coefficients is well studied and known in the systems theoretic literature, whereas the operators with varying coefficients were addressed only recently. This question can be tackled either using Gr\\"obner bases for modules over Ore algebras or by following the ideas from differential algebra and computing in commutative rings. In this paper, we present algorithmic methods to compute "most powerful unfalsified models" (MPUM) and their counterparts with variable coefficients (VMPUM) for polynomial and polynomial-exponential signals. We also study the structural properties of the resulting models, discuss computer algebraic techniques behind algorithms and provide several examples.
Algebraic structure of the anti-causal system
Rachmaputri, Gantina
2017-09-01
This paper presents a behavioral framework, as developed by J.C. Willems, of a discrete time anticausal pure predictor system. This study is deduced by identifying that the generalized state space of the system has a natural polynomial module structure over the formal series ring.
Conservation laws for multidimensional systems and related linear algebra problems
Energy Technology Data Exchange (ETDEWEB)
Igonin, Sergei
2002-12-13
We consider multidimensional systems of PDEs of generalized evolution form with t-derivatives of arbitrary order on the left-hand side and with the right-hand side dependent on lower order t-derivatives and arbitrary space derivatives. For such systems we find an explicit necessary condition for the existence of higher conservation laws in terms of the system's symbol. For systems that violate this condition we give an effective upper bound on the order of conservation laws. Using this result, we completely describe conservation laws for viscous transonic equations, for the Brusselator model and the Belousov-Zhabotinskii system. To achieve this, we solve over an arbitrary field the matrix equations SA=A{sup t}S and SA=-A{sup t}S for a quadratic matrix A and its transpose A{sup t}, which may be of independent interest.
Perturbation semigroup of matrix algebras
Neumann, N.; Suijlekom, W.D. van
2016-01-01
In this article we analyze the structure of the semigroup of inner perturbations in noncommutative geometry. This perturbation semigroup is associated to a unital associative *-algebra and extends the group of unitary elements of this *-algebra. We compute the perturbation semigroup for all matrix algebras.
Denotational semantics for thread algebra
Vu, T.D.
2008-01-01
This paper gives a denotational semantics for thread algebra (TA), an algebraic framework for the description and analysis of recent programming languages such as C# and Java [J.A. Bergstra, C.A. Middelburg, Thread algebra for strategic interleaving, Formal Aspects of Computing, in press.
García-Jacas, César R; Marrero-Ponce, Yovani; Acevedo-Martínez, Liesner; Barigye, Stephen J; Valdés-Martiní, José R; Contreras-Torres, Ernesto
2014-07-05
The present report introduces the QuBiLS-MIDAS software belonging to the ToMoCoMD-CARDD suite for the calculation of three-dimensional molecular descriptors (MDs) based on the two-linear (bilinear), three-linear, and four-linear (multilinear or N-linear) algebraic forms. Thus, it is unique software that computes these tensor-based indices. These descriptors, establish relations for two, three, and four atoms by using several (dis-)similarity metrics or multimetrics, matrix transformations, cutoffs, local calculations and aggregation operators. The theoretical background of these N-linear indices is also presented. The QuBiLS-MIDAS software was developed in the Java programming language and employs the Chemical Development Kit library for the manipulation of the chemical structures and the calculation of the atomic properties. This software is composed by a desktop user-friendly interface and an Abstract Programming Interface library. The former was created to simplify the configuration of the different options of the MDs, whereas the library was designed to allow its easy integration to other software for chemoinformatics applications. This program provides functionalities for data cleaning tasks and for batch processing of the molecular indices. In addition, it offers parallel calculation of the MDs through the use of all available processors in current computers. The studies of complexity of the main algorithms demonstrate that these were efficiently implemented with respect to their trivial implementation. Lastly, the performance tests reveal that this software has a suitable behavior when the amount of processors is increased. Therefore, the QuBiLS-MIDAS software constitutes a useful application for the computation of the molecular indices based on N-linear algebraic maps and it can be used freely to perform chemoinformatics studies.
A computer code for calculations in the algebraic collective model of the atomic nucleus
Welsh, T. A.; Rowe, D. J.
2016-03-01
A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1 , 1) × SO(5) dynamical group. This paper reviews the mathematical formulation of the ACM, and serves as a manual for the code. The code enables a wide range of model Hamiltonians to be analysed. This range includes essentially all Hamiltonians that are rational functions of the model's quadrupole moments qˆM and are at most quadratic in the corresponding conjugate momenta πˆN (- 2 ≤ M , N ≤ 2). The code makes use of expressions for matrix elements derived elsewhere and newly derived matrix elements of the operators [ π ˆ ⊗ q ˆ ⊗ π ˆ ] 0 and [ π ˆ ⊗ π ˆ ] LM. The code is made efficient by use of an analytical expression for the needed SO(5)-reduced matrix elements, and use of SO(5) ⊃ SO(3) Clebsch-Gordan coefficients obtained from precomputed data files provided with the code.
Variable coefficient Davey-Stewartson system with a Kac-Moody-Virasoro symmetry algebra
Güngör, F.; Özemir, C.
2016-06-01
We study the symmetry group properties of the variable coefficient Davey-Stewartson (vcDS) system. The Lie point symmetry algebra with a Kac-Moody-Virasoro (KMV) structure is shown to be isomorphic to that of the usual (constant coefficient) DS system if and only if the coefficients satisfy some conditions. These conditions turn out to coincide with those for the vcDS system to be transformable to the DS system by a point transformation. The equivalence group of the vcDS system is applied to pick out the integrable subsystems from a class of non-integrable ones. Additionally, the full symmetry group of the DS system is derived explicitly without exponentiating its symmetry algebra. Lump solutions (rationally localized in all directions in ℝ2) introduced by Ozawa for the DS system are shown to hold even for the vcDS system precisely when the system belongs to the integrable class, i.e., equivalent to the DS system. These solutions can be used for establishing exact blow-up solutions in finite time in the space L2(ℝ2) in the focusing case.
An algebraic approach to systems with dynamical constraints
Hanckowiak, Jerzy
2012-01-01
Constraints imposed directly on accelerations of the system leading to the relation of constants of motion with appropriate local projectors occurring in the derived equations are considered. In this way a generalization of the Noether's theorem is obtained and constraints are also considered in the phase space.
On Lie algebra weight systems for 3-graphs
Schrijver, A.
2015-01-01
A 3-graph is a connected cubic graph such that each vertex is equipped with a cyclic order of the edges incident with it. A weight system is a function f on the collection of 3-graphs which is antisymmetric: f (H) = -f(G) if H arises from G by reversing the orientation at one of its vertices, and sa
(m,n-Semirings and a Generalized Fault-Tolerance Algebra of Systems
Directory of Open Access Journals (Sweden)
Syed Eqbal Alam
2013-01-01
Full Text Available We propose a new class of mathematical structures called (m,n-semirings (which generalize the usual semirings and describe their basic properties. We define partial ordering and generalize the concepts of congruence, homomorphism, and so forth, for (m,n-semirings. Following earlier work by Rao (2008, we consider systems made up of several components whose failures may cause them to fail and represent the set of such systems algebraically as an (m,n-semiring. Based on the characteristics of these components, we present a formalism to compare the fault-tolerance behavior of two systems using our framework of a partially ordered (m,n-semiring.
Algebraic Verification Method for SEREs Properties via Groebner Bases Approaches
Directory of Open Access Journals (Sweden)
Ning Zhou
2013-01-01
Full Text Available This work presents an efficient solution using computer algebra system to perform linear temporal properties verification for synchronous digital systems. The method is essentially based on both Groebner bases approaches and symbolic simulation. A mechanism for constructing canonical polynomial set based symbolic representations for both circuit descriptions and assertions is studied. We then present a complete checking algorithm framework based on these algebraic representations by using Groebner bases. The computational experience result in this work shows that the algebraic approach is a quite competitive checking method and will be a useful supplement to the existent verification methods based on simulation.
The Computational Sensorimotor Systems Laboratory
Federal Laboratory Consortium — The Computational Sensorimotor Systems Lab focuses on the exploration, analysis, modeling and implementation of biological sensorimotor systems for both scientific...
Díaz, Felipe
2015-09-01
Magnetic resonance (MR) data reconstruction can be computationally a challenging task. The signal-to-noise ratio might also present complications, especially with high-resolution images. In this sense, data compression can be useful not only for reducing the complexity and memory requirements, but also to reduce noise, even to allow eliminate spurious components.This article proposes the use of a system based on singular value decomposition of low order for noise reconstruction and reduction in MR imaging system. The proposed method is evaluated using in vivo MRI data. Rebuilt images with less than 20 of the original data and with similar quality in terms of visual inspection are presented. Also a quantitative evaluation of the method is presented.
Energy Technology Data Exchange (ETDEWEB)
Marquette, Ian, E-mail: i.marquette@uq.edu.au [School of Mathematics and Physics, The University of Queensland, Brisbane QLD 4072 (Australia); Quesne, Christiane, E-mail: cquesne@ulb.ac.be [Physique Nucléaire Théorique et Physique Mathématique, Université Libre de Bruxelles, Campus de la Plaine CP229, Boulevard du Triomphe, B-1050 Brussels (Belgium)
2015-06-15
We extend the construction of 2D superintegrable Hamiltonians with separation of variables in spherical coordinates using combinations of shift, ladder, and supercharge operators to models involving rational extensions of the two-parameter Lissajous systems on the sphere. These new families of superintegrable systems with integrals of arbitrary order are connected with Jacobi exceptional orthogonal polynomials of type I (or II) and supersymmetric quantum mechanics. Moreover, we present an algebraic derivation of the degenerate energy spectrum for the one- and two-parameter Lissajous systems and the rationally extended models. These results are based on finitely generated polynomial algebras, Casimir operators, realizations as deformed oscillator algebras, and finite-dimensional unitary representations. Such results have only been established so far for 2D superintegrable systems separable in Cartesian coordinates, which are related to a class of polynomial algebras that display a simpler structure. We also point out how the structure function of these deformed oscillator algebras is directly related with the generalized Heisenberg algebras spanned by the nonpolynomial integrals.
Genetic coding and united-hypercomplex systems in the models of algebraic biology.
Petoukhov, Sergey V
2017-08-01
Structured alphabets of DNA and RNA in their matrix form of representations are connected with Walsh functions and a new type of systems of multidimensional numbers. This type generalizes systems of complex numbers and hypercomplex numbers, which serve as the basis of mathematical natural sciences and many technologies. The new systems of multi-dimensional numbers have interesting mathematical properties and are called in a general case as "systems of united-hypercomplex numbers" (or briefly "U-hypercomplex numbers"). They can be widely used in models of multi-parametrical systems in the field of algebraic biology, artificial life, devices of biological inspired artificial intelligence, etc. In particular, an application of U-hypercomplex numbers reveals hidden properties of genetic alphabets under cyclic permutations in their doublets and triplets. A special attention is devoted to the author's hypothesis about a multi-linguistic in DNA-sequences in a relation with an ensemble of U-numerical sub-alphabets. Genetic multi-linguistic is considered as an important factor to provide noise-immunity properties of the multi-channel genetic coding. Our results attest to the conformity of the algebraic properties of the U-numerical systems with phenomenological properties of the DNA-alphabets and with the complementary device of the double DNA-helix. It seems that in the modeling field of algebraic biology the genetic-informational organization of living bodies can be considered as a set of united-hypercomplex numbers in some association with the famous slogan of Pythagoras "the numbers rule the world". Copyright © 2017 Elsevier B.V. All rights reserved.
Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems
Directory of Open Access Journals (Sweden)
Catuscia Palamidessi
2012-07-01
Full Text Available Differential privacy is a modern approach in privacy-preserving data analysis to control the amount of information that can be inferred about an individual by querying a database. The most common techniques are based on the introduction of probabilistic noise, often defined as a Laplacian parametric on the sensitivity of the query. In order to maximize the utility of the query, it is crucial to estimate the sensitivity as precisely as possible. In this paper we consider relational algebra, the classical language for queries in relational databases, and we propose a method for computing a bound on the sensitivity of queries in an intuitive and compositional way. We use constraint-based techniques to accumulate the information on the possible values for attributes provided by the various components of the query, thus making it possible to compute tight bounds on the sensitivity.
A Type System for the Vectorial Aspect of the Linear-Algebraic Lambda-Calculus
Directory of Open Access Journals (Sweden)
Pablo Arrighi
2012-07-01
Full Text Available We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms resulting from the reduction of programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We show that the resulting typed lambda-calculus is strongly normalizing and features a weak subject-reduction.
Bellman's GAP : a 2nd generation language and system for algebraic dynamic programming
Sauthoff, Georg
2010-01-01
The dissertation describes the new Bellmans GAP which is a programming system for writing dynamic programming algorithms over sequential data. It is the second generation implementation of the algebraic dynamic programming framework (ADP). The system includes the multi-paradigm language (GAP-L), its compiler (GAP-C), functional modules (GAP-M) and a web site (GAP Pages) to experiment with GAP-L programs. GAP-L includes declarative constructs, e.g. tree grammars to model the search space, and...
Secure computing on reconfigurable systems
Fernandes Chaves, R.J.
2007-01-01
This thesis proposes a Secure Computing Module (SCM) for reconfigurable computing systems. SC provides a protected and reliable computational environment, where data security and protection against malicious attacks to the system is assured. SC is strongly based on encryption algorithms and on the
Secure computing on reconfigurable systems
Fernandes Chaves, R.J.
2007-01-01
This thesis proposes a Secure Computing Module (SCM) for reconfigurable computing systems. SC provides a protected and reliable computational environment, where data security and protection against malicious attacks to the system is assured. SC is strongly based on encryption algorithms and on the a
Omar, Mohamed A
2014-01-01
Initial transient oscillations inhibited in the dynamic simulations responses of multibody systems can lead to inaccurate results, unrealistic load prediction, or simulation failure. These transients could result from incompatible initial conditions, initial constraints violation, and inadequate kinematic assembly. Performing static equilibrium analysis before the dynamic simulation can eliminate these transients and lead to stable simulation. Most exiting multibody formulations determine the static equilibrium position by minimizing the system potential energy. This paper presents a new general purpose approach for solving the static equilibrium in large-scale articulated multibody. The proposed approach introduces an energy drainage mechanism based on Baumgarte constraint stabilization approach to determine the static equilibrium position. The spatial algebra operator is used to express the kinematic and dynamic equations of the closed-loop multibody system. The proposed multibody system formulation utilizes the joint coordinates and modal elastic coordinates as the system generalized coordinates. The recursive nonlinear equations of motion are formulated using the Cartesian coordinates and the joint coordinates to form an augmented set of differential algebraic equations. Then system connectivity matrix is derived from the system topological relations and used to project the Cartesian quantities into the joint subspace leading to minimum set of differential equations.
Andrilli, Stephen
2010-01-01
Elementary Linear Algebra develops and explains in careful detail the computational techniques and fundamental theoretical results central to a first course in linear algebra. This highly acclaimed text focuses on developing the abstract thinking essential for further mathematical study. The authors give early, intensive attention to the skills necessary to make students comfortable with mathematical proofs. The text builds a gradual and smooth transition from computational results to general theory of abstract vector spaces. It also provides flexbile coverage of practical applications, expl
Multicore Performance of Block Algebraic Iterative Reconstruction Methods
DEFF Research Database (Denmark)
Sørensen, Hans Henrik B.; Hansen, Per Christian
2014-01-01
Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely...... a fixed relaxation parameter in each method, namely, the one that leads to the fastest semiconvergence. Computational results show that for multicore computers, the sequential approach is preferable....
Stability of Linear Equations--Algebraic Approach
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…
Stability of Linear Equations--Algebraic Approach
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…
Computer systems a programmer's perspective
Bryant, Randal E
2016-01-01
Computer systems: A Programmer’s Perspective explains the underlying elements common among all computer systems and how they affect general application performance. Written from the programmer’s perspective, this book strives to teach readers how understanding basic elements of computer systems and executing real practice can lead them to create better programs. Spanning across computer science themes such as hardware architecture, the operating system, and systems software, the Third Edition serves as a comprehensive introduction to programming. This book strives to create programmers who understand all elements of computer systems and will be able to engage in any application of the field--from fixing faulty software, to writing more capable programs, to avoiding common flaws. It lays the groundwork for readers to delve into more intensive topics such as computer architecture, embedded systems, and cybersecurity. This book focuses on systems that execute an x86-64 machine code, and recommends th...
Using geometric algebra to understand pattern rotations in multiple mirror optical systems
Energy Technology Data Exchange (ETDEWEB)
Hanlon, J.; Ziock, H.
1997-05-01
Geometric Algebra (GA) is a new formulation of Clifford Algebra that includes vector analysis without notation changes. Most applications of Ga have been in theoretical physics, but GA is also a very good analysis tool for engineering. As an example, the authors use GA to study pattern rotation in optical systems with multiple mirror reflections. The common ways to analyze pattern rotations are to use rotation matrices or optical ray trace codes, but these are often inconvenient. The authors use GA to develop a simple expression for pattern rotation that is useful for designing or tolerancing pattern rotations in a multiple mirror optical system by inspection. Pattern rotation is used in many optical engineering systems, but it is not normally covered in optical system engineering texts. Pattern rotation is important in optical systems such as: (1) the 192 beam National ignition Facility (NIF), which uses square laser beams in close packed arrays to cut costs; (2) visual optical systems, which use pattern rotation to present the image to the observer in the appropriate orientation, and (3) the UR90 unstable ring resonator, which uses pattern rotation to fill a rectangular laser gain region and provide a filled-in laser output beam.
Topological ∗-algebras with *-enveloping Algebras II
Indian Academy of Sciences (India)
S J Bhatt
2001-02-01
Universal *-algebras *() exist for certain topological ∗-algebras called algebras with a *-enveloping algebra. A Frechet ∗-algebra has a *-enveloping algebra if and only if every operator representation of maps into bounded operators. This is proved by showing that every unbounded operator representation , continuous in the uniform topology, of a topological ∗-algebra , which is an inverse limit of Banach ∗-algebras, is a direct sum of bounded operator representations, thereby factoring through the enveloping pro-* algebra () of . Given a *-dynamical system (, , ), any topological ∗-algebra containing (, ) as a dense ∗-subalgebra and contained in the crossed product *-algebra *(, , ) satisfies ()=*(, , ). If $G = \\mathbb{R}$, if is an -invariant dense Frechet ∗-subalgebra of such that () = , and if the action on is -tempered, smooth and by continuous ∗-automorphisms: then the smooth Schwartz crossed product $S(\\mathbb{R}, B, )$ satisfies $E(S(\\mathbb{R}, B, )) = C^*(\\mathbb{R}, A, )$. When is a Lie group, the ∞-elements ∞(), the analytic elements () as well as the entire analytic elements () carry natural topologies making them algebras with a *-enveloping algebra. Given a non-unital *-algebra , an inductive system of ideals is constructed satisfying $A = C^*-\\mathrm{ind} \\lim I_$; and the locally convex inductive limit $\\mathrm{ind}\\lim I_$ is an -convex algebra with the *-enveloping algebra and containing the Pedersen ideal of . Given generators with weakly Banach admissible relations , we construct universal topological ∗-algebra (, ) and show that it has a *-enveloping algebra if and only if (, ) is *-admissible.
Iachello, Francesco
2015-01-01
This course-based primer provides an introduction to Lie algebras and some of their applications to the spectroscopy of molecules, atoms, nuclei and hadrons. In the first part, it concisely presents the basic concepts of Lie algebras, their representations and their invariants. The second part includes a description of how Lie algebras are used in practice in the treatment of bosonic and fermionic systems. Physical applications considered include rotations and vibrations of molecules (vibron model), collective modes in nuclei (interacting boson model), the atomic shell model, the nuclear shell model, and the quark model of hadrons. One of the key concepts in the application of Lie algebraic methods in physics, that of spectrum generating algebras and their associated dynamic symmetries, is also discussed. The book highlights a number of examples that help to illustrate the abstract algebraic definitions and includes a summary of many formulas of practical interest, such as the eigenvalues of Casimir operators...
Rationality problem for algebraic tori
Hoshi, Akinari
2017-01-01
The authors give the complete stably rational classification of algebraic tori of dimensions 4 and 5 over a field k. In particular, the stably rational classification of norm one tori whose Chevalley modules are of rank 4 and 5 is given. The authors show that there exist exactly 487 (resp. 7, resp. 216) stably rational (resp. not stably but retract rational, resp. not retract rational) algebraic tori of dimension 4, and there exist exactly 3051 (resp. 25, resp. 3003) stably rational (resp. not stably but retract rational, resp. not retract rational) algebraic tori of dimension 5. The authors make a procedure to compute a flabby resolution of a G-lattice effectively by using the computer algebra system GAP. Some algorithms may determine whether the flabby class of a G-lattice is invertible (resp. zero) or not. Using the algorithms, the suthors determine all the flabby and coflabby G-lattices of rank up to 6 and verify that they are stably permutation. The authors also show that the Krull-Schmidt theorem for G-...
Central nervous system and computation.
Guidolin, Diego; Albertin, Giovanna; Guescini, Michele; Fuxe, Kjell; Agnati, Luigi F
2011-12-01
Computational systems are useful in neuroscience in many ways. For instance, they may be used to construct maps of brain structure and activation, or to describe brain processes mathematically. Furthermore, they inspired a powerful theory of brain function, in which the brain is viewed as a system characterized by intrinsic computational activities or as a "computational information processor. "Although many neuroscientists believe that neural systems really perform computations, some are more cautious about computationalism or reject it. Thus, does the brain really compute? Answering this question requires getting clear on a definition of computation that is able to draw a line between physical systems that compute and systems that do not, so that we can discern on which side of the line the brain (or parts of it) could fall. In order to shed some light on the role of computational processes in brain function, available neurobiological data will be summarized from the standpoint of a recently proposed taxonomy of notions of computation, with the aim of identifying which brain processes can be considered computational. The emerging picture shows the brain as a very peculiar system, in which genuine computational features act in concert with noncomputational dynamical processes, leading to continuous self-organization and remodeling under the action of external stimuli from the environment and from the rest of the organism.
Directory of Open Access Journals (Sweden)
N. A. Vunder
2016-03-01
Full Text Available Subject of Research.The paper deals with the problem of required placement of state matrix modes in the system being designed.Methods.The problem has been solved with the use of vector matrix formalism of state space method with the dominant attention at the algebraic properties of the object control matrix. Main Results. Algebraic conditions have been obtained imposed on the matrix components of control plant and system models, which has helped to create the algorithms for solving the tasks without necessarily resorting to matrix Sylvester equation and Ackermann's formula. Practical Relevance. User’s base of algorithms for synthesis procedures of control systems with specified quality indices has been extended.
McConnell, Sean; Fritzsche, Stephan; Surzhykov, Andrey
2010-03-01
During recent years, the DIRAC package has proved to be an efficient tool for studying the structural properties and dynamic behavior of hydrogen-like ions. Originally designed as a set of MAPLE procedures, this package provides interactive access to the wave and Green's functions in the non-relativistic and relativistic frameworks and supports analytical evaluation of a large number of radial integrals that are required for the construction of transition amplitudes and interaction cross sections. We provide here a new version of the DIRAC program which is developed within the framework of MATHEMATICA (version 6.0). This new version aims to cater to a wider community of researchers that use the MATHEMATICA platform and to take advantage of the generally faster processing times therein. Moreover, the addition of new procedures, a more convenient and detailed help system, as well as source code revisions to overcome identified shortcomings should ensure expanded use of the new DIRAC program over its predecessor. New version program summaryProgram title: DIRAC Catalogue identifier: ADUQ_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADUQ_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC license, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 45 073 No. of bytes in distributed program, including test data, etc.: 285 828 Distribution format: tar.gz Programming language: Mathematica 6.0 or higher Computer: All computers with a license for the computer algebra package Mathematica (version 6.0 or higher) Operating system: Mathematica is O/S independent Classification: 2.1 Catalogue identifier of previous version: ADUQ_v1_0 Journal reference of previous version: Comput. Phys. Comm. 165 (2005) 139 Does the new version supersede the previous version?: Yes Nature of problem: Since the early days of quantum mechanics, the
DEFF Research Database (Denmark)
Bardram, Jakob Eyvind; Friday, Adrian
2009-01-01
First introduced two decades ago, the term ubiquitous computing is now part of the common vernacular. Ubicomp, as it is commonly called, has grown not just quickly but broadly so as to encompass a wealth of concepts and technology that serves any number of purposes across all of human endeavor......, an original ubicomp pioneer, Ubiquitous Computing Fundamentals brings together eleven ubiquitous computing trailblazers who each report on his or her area of expertise. Starting with a historical introduction, the book moves on to summarize a number of self-contained topics. Taking a decidedly human...... perspective, the book includes discussion on how to observe people in their natural environments and evaluate the critical points where ubiquitous computing technologies can improve their lives. Among a range of topics this book examines: How to build an infrastructure that supports ubiquitous computing...
Differential and differential-algebraic systems for the chemical engineer solving numerical problems
Buzzi-Ferraris, Guido
2014-01-01
This fourth in a suite of four practical guides is an engineer''s companion to using numerical methods for the solution of complex mathematical problems. It explains the theory behind current numerical methods and shows in a step-by-step fashion how to use them.The volume focuses on differential and differential-algebraic systems, providing numerous real-life industrial case studies to illustrate this complex topic. It describes the methods, innovative techniques and strategies that are all implemented in a freely available toolbox called BzzMath, which is developed and maintained by the autho
Feedback control of nonlinear differential algebraic systems using Hamiltonian function method
Institute of Scientific and Technical Information of China (English)
LIU Yanhong; LI Chunwen; WU Rebing
2006-01-01
The stabilization and H∞ control of nonlinear differential algebraic systems (NDAS) are investigated using the Hamiltonian function method. Firstly, we put forward a novel dissipative Hamiltonian realization (DHR) structure and give the condition to complete the Hamiltonian realization. Then, based on the DHR, we present a criterion for the stability analysis of NDAS and construct a stabilization controller for NDAS in absence of disturbances. Finally, for NDAS in presence of disturbances, the L2 gain is analyzed via generalized Hamilton-Jacobi inequality and an H∞ control strategy is constructed. The proposed stabilization and robust controller can effectively take advantage of the structural characteristics of NDAS and is simple in form.
Directory of Open Access Journals (Sweden)
D. Fox Harrell
2008-01-01
Full Text Available Cultural practices and values are implicitly built into all computational systems. However, it is not common to develop systems with explicit critical engagement with, and foundations in, cultural practices and values aside from those traditionally privileged in discourse surrounding computing practices. I assert that engaging commonly excluded cultural values and practices can potentially spur computational innovation, and can invigorate expressive computational production. In particular, diverse ways of representing and manipulating semantic content and distinctive relationships between humans and our (digital artifacts can form the basis for new technical and expressive computing practices. This idea is developed using the example of the GRIOT system. GRIOT is a platform for implementing interactive and generative computational narratives. Its underlying theoretical bases are in algebraic semantics from computer science, cognitive linguistics, and semiotics. Initial systems built in GRIOT enable generation of poetry in response to user input. GRIOT is deeply informed by African diasporic traditions of orature and socio-cultural engagement.
Dynamical systems of type (m,n) and their C*-algebras
Ara, Pere; Katsura, Takeshi
2011-01-01
Given positive integers n and m, we consider dynamical systems in which n copies of a topological space is homeomorphic to m copies of that same space. The universal such system is shown to arise naturally from the study of a C*-algebra we denote by O_{mn}, which in turn is obtained as a quotient of the well known Leavitt C*-algebra L_{mn}, a process meant to transform the generating set of partial isometries of L{mn} into a tame set. Describing O_{mn} as the crossed-product of the universal (m,n)-dynamical system by a partial action of the free group F_{m+n}, we show that O_{mn} is not exact when n and m are both greater than or equal to 2, but the corresponding reduced crossed-product, denoted O_{mn}^r, is shown to be exact and non-nuclear. Still under the assumption that m,n>=2, we prove that the partial action of F_{m+n} is topologically free and that O_{mn}^r satisfies property (SP) (small projections). We also show that O_{mn}^r admits no finite dimensional representations. The techniques developed to t...
Warner, Seth
1990-01-01
Standard text provides an exceptionally comprehensive treatment of every aspect of modern algebra. Explores algebraic structures, rings and fields, vector spaces, polynomials, linear operators, much more. Over 1,300 exercises. 1965 edition.
Goodstein, R L
2007-01-01
This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.
Capability-based computer systems
Levy, Henry M
2014-01-01
Capability-Based Computer Systems focuses on computer programs and their capabilities. The text first elaborates capability- and object-based system concepts, including capability-based systems, object-based approach, and summary. The book then describes early descriptor architectures and explains the Burroughs B5000, Rice University Computer, and Basic Language Machine. The text also focuses on early capability architectures. Dennis and Van Horn's Supervisor; CAL-TSS System; MIT PDP-1 Timesharing System; and Chicago Magic Number Machine are discussed. The book then describes Plessey System 25
Providing Feedback on Computer-Based Algebra Homework in Middle-School Classrooms
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.…
Levy, Alissa Beth
2012-01-01
The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this dissertation,…
Levy, Alissa Beth
2012-01-01
The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this dissertation,…
Levy, Alissa Beth
2012-01-01
The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this…
New computing systems and their impact on computational mechanics
Noor, Ahmed K.
1989-01-01
Recent advances in computer technology that are likely to impact computational mechanics are reviewed. The technical needs for computational mechanics technology are outlined. The major features of new and projected computing systems, including supersystems, parallel processing machines, special-purpose computing hardware, and small systems are described. Advances in programming environments, numerical algorithms, and computational strategies for new computing systems are reviewed, and a novel partitioning strategy is outlined for maximizing the degree of parallelism on multiprocessor computers with a shared memory.
Grätzer, George
1979-01-01
Universal Algebra, heralded as ". . . the standard reference in a field notorious for the lack of standardization . . .," has become the most authoritative, consistently relied on text in a field with applications in other branches of algebra and other fields such as combinatorics, geometry, and computer science. Each chapter is followed by an extensive list of exercises and problems. The "state of the art" account also includes new appendices (with contributions from B. Jónsson, R. Quackenbush, W. Taylor, and G. Wenzel) and a well-selected additional bibliography of over 1250 papers and books which makes this a fine work for students, instructors, and researchers in the field. "This book will certainly be, in the years to come, the basic reference to the subject." --- The American Mathematical Monthly (First Edition) "In this reviewer's opinion [the author] has more than succeeded in his aim. The problems at the end of each chapter are well-chosen; there are more than 650 of them. The book is especially sui...
Modelling and temporal performances evaluation of networked control systems using (max, +) algebra
Ammour, R.; Amari, S.
2015-01-01
In this paper, we address the problem of temporal performances evaluation of producer/consumer networked control systems. The aim is to develop a formal method for evaluating the response time of this type of control systems. Our approach consists on modelling, using Petri nets classes, the behaviour of the whole architecture including the switches that support multicast communications used by this protocol. (max, +) algebra formalism is then exploited to obtain analytical formulas of the response time and the maximal and minimal bounds. The main novelty is that our approach takes into account all delays experienced at the different stages of networked automation systems. Finally, we show how to apply the obtained results through an example of networked control system.
Sulis, William H
2017-10-01
Walter Freeman III pioneered the application of nonlinear dynamical systems theories and methodologies in his work on mesoscopic brain dynamics.Sadly, mainstream psychology and psychiatry still cling to linear correlation based data analysis techniques, which threaten to subvert the process of experimentation and theory building. In order to progress, it is necessary to develop tools capable of managing the stochastic complexity of complex biopsychosocial systems, which includes multilevel feedback relationships, nonlinear interactions, chaotic dynamics and adaptability. In addition, however, these systems exhibit intrinsic randomness, non-Gaussian probability distributions, non-stationarity, contextuality, and non-Kolmogorov probabilities, as well as the absence of mean and/or variance and conditional probabilities. These properties and their implications for statistical analysis are discussed. An alternative approach, the Process Algebra approach, is described. It is a generative model, capable of generating non-Kolmogorov probabilities. It has proven useful in addressing fundamental problems in quantum mechanics and in the modeling of developing psychosocial systems.
Symplectic algebraic dynamics algorithm
Institute of Scientific and Technical Information of China (English)
2007-01-01
Based on the algebraic dynamics solution of ordinary differential equations andintegration of ,the symplectic algebraic dynamics algorithm sn is designed,which preserves the local symplectic geometric structure of a Hamiltonian systemand possesses the same precision of the na ve algebraic dynamics algorithm n.Computer experiments for the 4th order algorithms are made for five test modelsand the numerical results are compared with the conventional symplectic geometric algorithm,indicating that sn has higher precision,the algorithm-inducedphase shift of the conventional symplectic geometric algorithm can be reduced,and the dynamical fidelity can be improved by one order of magnitude.
Fundamentals of algebraic graph transformation
Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele
2006-01-01
Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...
Computer Security Systems Enable Access.
Riggen, Gary
1989-01-01
A good security system enables access and protects information from damage or tampering, but the most important aspects of a security system aren't technical. A security procedures manual addresses the human element of computer security. (MLW)
Commutative algebra with a view toward algebraic geometry
Eisenbud, David
1995-01-01
Commutative Algebra is best understood with knowledge of the geometric ideas that have played a great role in its formation, in short, with a view towards algebraic geometry. The author presents a comprehensive view of commutative algebra, from basics, such as localization and primary decomposition, through dimension theory, differentials, homological methods, free resolutions and duality, emphasizing the origins of the ideas and their connections with other parts of mathematics. Many exercises illustrate and sharpen the theory and extended exercises give the reader an active part in complementing the material presented in the text. One novel feature is a chapter devoted to a quick but thorough treatment of Grobner basis theory and the constructive methods in commutative algebra and algebraic geometry that flow from it. Applications of the theory and even suggestions for computer algebra projects are included. This book will appeal to readers from beginners to advanced students of commutative algebra or algeb...
Using Determinants and Computers to Recognize Dependent and Inconsistent Linear Systems.
Conklin, Kenneth R.
1981-01-01
A computer program that uses determinants to solve simultaneous systems of equations is presented. The purpose is to show teachers how to use topics from algebra, geometry, and programing to lead pupils to appreciate the beauty and unity of mathematics. (MP)
Directory of Open Access Journals (Sweden)
Xiaohui Mo
2017-01-01
Full Text Available In this paper, finite-time stabilization problem for a class of nonlinear differential-algebraic systems (NDASs subject to external disturbance is investigated via a composite control manner. A composite finite-time controller (CFTC is proposed with a three-stage design procedure. Firstly, based on the adding a power integrator technique, a finite-time control (FTC law is explicitly designed for the nominal NDAS by only using differential variables. Then, by using homogeneous system theory, a continuous finite-time disturbance observer (CFTDO is constructed to estimate the disturbance generated by an exogenous system. Finally, a composite controller which consists of a feedforward compensation part based on CFTDO and the obtained FTC law is proposed. Rigorous analysis demonstrates that not only the proposed composite controller can stabilize the NDAS in finite time, but also the proposed control scheme exhibits nominal performance recovery property. Simulation examples are provided to illustrate the effectiveness of the proposed control approach.
Akbarzadeh, Rasoul
2016-01-01
In 2001, A. V. Borisov, I. S. Mamaev, and V. V. Sokolov discovered a new integrable case on the Lie algebra so(4). This is a Hamiltonian system with two degrees of freedom, where both the Hamiltonian and the additional integral are homogenous polynomials of degrees 2 and 4, respectively. In this paper, the topology of isoenergy surfaces for the integrable case under consideration on the Lie algebra so(4) and the critical points of the Hamiltonian under consideration for different values of parameters are described and the bifurcation values of the Hamiltonian are constructed. Also, a description of bifurcation complexes and typical forms of the bifurcation diagram of the system are presented.
Energy efficient distributed computing systems
Lee, Young-Choon
2012-01-01
The energy consumption issue in distributed computing systems raises various monetary, environmental and system performance concerns. Electricity consumption in the US doubled from 2000 to 2005. From a financial and environmental standpoint, reducing the consumption of electricity is important, yet these reforms must not lead to performance degradation of the computing systems. These contradicting constraints create a suite of complex problems that need to be resolved in order to lead to 'greener' distributed computing systems. This book brings together a group of outsta
Solving a System of Nonlinear Algebraic Equations You Only Get Error Messages--What to Do Next?
Shacham, Mordechai; Brauner, Neima
2017-01-01
Chemical engineering problems often involve the solution of systems of nonlinear algebraic equations (NLE). There are several software packages that can be used for solving NLE systems, but they may occasionally fail, especially in cases where the mathematical model contains discontinuities and/or regions where some of the functions are undefined.…
Dynamical Systems Some Computational Problems
Guckenheimer, J; Guckenheimer, John; Worfolk, Patrick
1993-01-01
We present several topics involving the computation of dynamical systems. The emphasis is on work in progress and the presentation is informal -- there are many technical details which are not fully discussed. The topics are chosen to demonstrate the various interactions between numerical computation and mathematical theory in the area of dynamical systems. We present an algorithm for the computation of stable manifolds of equilibrium points, describe the computation of Hopf bifurcations for equilibria in parametrized families of vector fields, survey the results of studies of codimension two global bifurcations, discuss a numerical analysis of the Hodgkin and Huxley equations, and describe some of the effects of symmetry on local bifurcation.
Abstract algebra structure and application
Finston, David R
2014-01-01
This text seeks to generate interest in abstract algebra by introducing each new structure and topic via a real-world application. The down-to-earth presentation is accessible to a readership with no prior knowledge of abstract algebra. Students are led to algebraic concepts and questions in a natural way through their everyday experiences. Applications include: Identification numbers and modular arithmetic (linear) error-correcting codes, including cyclic codes ruler and compass constructions cryptography symmetry of patterns in the real plane Abstract Algebra: Structure and Application is suitable as a text for a first course on abstract algebra whose main purpose is to generate interest in the subject, or as a supplementary text for more advanced courses. The material paves the way to subsequent courses that further develop the theory of abstract algebra and will appeal to students of mathematics, mathematics education, computer science, and engineering interested in applications of algebraic concepts.
Hopf algebras in noncommutative geometry
Varilly, J C
2001-01-01
We give an introductory survey to the use of Hopf algebras in several problems of noncommutative geometry. The main example, the Hopf algebra of rooted trees, is a graded, connected Hopf algebra arising from a universal construction. We show its relation to the algebra of transverse differential operators introduced by Connes and Moscovici in order to compute a local index formula in cyclic cohomology, and to the several Hopf algebras defined by Connes and Kreimer to simplify the combinatorics of perturbative renormalization. We explain how characteristic classes for a Hopf module algebra can be obtained from the cyclic cohomology of the Hopf algebra which acts on it. Finally, we discuss the theory of noncommutative spherical manifolds and show how they arise as homogeneous spaces of certain compact quantum groups.
A Note on Solvable Polynomial Algebras
Directory of Open Access Journals (Sweden)
Huishi Li
2014-03-01
Full Text Available In terms of their defining relations, solvable polynomial algebras introduced by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990] are characterized by employing Gr\\"obner bases of ideals in free algebras, thereby solvable polynomial algebras are completely determinable and constructible in a computational way.
Computational Systems Chemical Biology
Oprea, Tudor I.; Elebeoba E. May; Leitão, Andrei; Tropsha, Alexander
2011-01-01
There is a critical need for improving the level of chemistry awareness in systems biology. The data and information related to modulation of genes and proteins by small molecules continue to accumulate at the same time as simulation tools in systems biology and whole body physiologically-based pharmacokinetics (PBPK) continue to evolve. We called this emerging area at the interface between chemical biology and systems biology systems chemical biology, SCB (Oprea et al., 2007).
Kendricks, Kimberly D.
2011-01-01
Significant research in K-12 education has shown that computer based learning in mathematics positively impacts students' attitudes toward mathematics and greatly increases academic performance. Little research has shown, however, how this success can be replicated in a postsecondary classroom for minority students. This paper is a case study that…
Hybridity in Embedded Computing Systems
Institute of Scientific and Technical Information of China (English)
虞慧群; 孙永强
1996-01-01
An embedded system is a system that computer is used as a component in a larger device.In this paper,we study hybridity in embedded systems and present an interval based temporal logic to express and reason about hybrid properties of such kind of systems.
Bollhöfer, Matthias; Kressner, Daniel; Mehl, Christian; Stykel, Tatjana
2015-01-01
This edited volume highlights the scientific contributions of Volker Mehrmann, a leading expert in the area of numerical (linear) algebra, matrix theory, differential-algebraic equations and control theory. These mathematical research areas are strongly related and often occur in the same real-world applications. The main areas where such applications emerge are computational engineering and sciences, but increasingly also social sciences and economics. This book also reflects some of Volker Mehrmann's major career stages. Starting out working in the areas of numerical linear algebra (his first full professorship at TU Chemnitz was in "Numerical Algebra," hence the title of the book) and matrix theory, Volker Mehrmann has made significant contributions to these areas ever since. The highlights of these are discussed in Parts I and II of the present book. Often the development of new algorithms in numerical linear algebra is motivated by problems in system and control theory. These and his later major work on ...
Vértesi, T; Vibók, A; Halász, G J; Baer, M
2004-05-08
In this Communication it is suggested that various elements of the nonadiabatic coupling matrix, tau(jk)(s) are created by the singular nonadiabatic coupling terms of the system. Moreover, given the spatial distribution of these coupling terms in the close vicinity of their singularity points yields, according to this approach, the integrated intensity of the field at every point in the region of interest. To support these statements we consider the conical intersections of the three lower states of the H+H(2) system: From an ab initio treatment we obtain the nonadiabatic coupling terms around each conical intersection separately (at its close vicinity) and having those, create the field at every desired point employing vector-algebra. This approach is also used to calculate the intensity of the Curl of those matrix elements that lack their own sources [tau(13)(s) in the present case]. The final results are compared with relevant ab initio calculations.
Linear-algebraic bath transformation for simulating complex open quantum systems
Huh, Joonsuk; Fujita, Takatoshi; Yung, Man-Hong; Aspuru-Guzik, Alán
2014-01-01
In studying open quantum systems, the environment is often approximated as a collection of non-interacting harmonic oscillators, a configuration also known as the star-bath model. It is also well known that the star-bath can be transformed into a nearest-neighbor interacting chain of oscillators. The chain-bath model has been widely used in renormalization group approaches. The transformation can be obtained by recursion relations or orthogonal polynomials. Based on a simple linear algebraic approach, we propose a bath partition strategy to reduce the system-bath coupling strength. As a result, the non-interacting star-bath is transformed into a set of weakly-coupled multiple parallel chains. The transformed bath model allows complex problems to be practically implemented on quantum simulators, and it can also be employed in various numerical simulations of open quantum dynamics.
Reduced Properties and Applications of Y(sl(2)) Algebra for a Two-Spin System
Institute of Scientific and Technical Information of China (English)
TIAN Li-Jun; YANG Guo-Hong; ZHANG Hong-Biao; HOU Jing-Min
2006-01-01
@@ By taking a special constraint for a general realization of Y(sl(2)), two sets of sl(2) algebras are presented, in which a u(1) algebra is hidden. With the help of this constraint, the block-diagonal form can be written to the generator J of Yangian algebras, and especially it is a rotational transformation of a spin in the elementary quantum mechanics. This sheds new light on the physical meaning of Y(sl(2)).
Cell method a purely algebraic computational method in physics and engineering
Ferretti, Elena
2014-01-01
The Cell Method (CM) is a computational tool that maintains criticalmultidimensional attributes of physical phenomena in analysis. Thisinformation is neglected in the differential formulations of the classicalapproaches of finite element, boundary element, finite volume,and finite difference analysis, often leading to numerical instabilitiesand spurious results.This book highlights the central theoretical concepts of the CM thatpreserve a more accurate and precise representation of the geometricand topological features of variables for practical problem solving.Important applications occur in
Institute of Scientific and Technical Information of China (English)
张鸿庆; 谢福鼎; 陆斌
2002-01-01
A symbolic computation method to decide whether the solutions to the system of linear partial differential equation is complete via using differential algebra and characteristic set is presented.This is a mechanization method, and it can be carried out on the computer in the Maple environment.
Institute of Scientific and Technical Information of China (English)
谢腊兵; 江福汝
2003-01-01
The method of boundary layer with multiple scales and computer algebra were applied to study the asymptotic behavior of solution of boundary value problems for a class of system of nonlinear differential equations. The asymptotic expansions of solution were constructed. The remainders were estimated. And an example was analysed. It provides a new foreground for the application of the method of boundary layer with multiple scales.
Students "Hacking" School Computer Systems
Stover, Del
2005-01-01
This article deals with students hacking school computer systems. School districts are getting tough with students "hacking" into school computers to change grades, poke through files, or just pit their high-tech skills against district security. Dozens of students have been prosecuted recently under state laws on identity theft and unauthorized…
Students "Hacking" School Computer Systems
Stover, Del
2005-01-01
This article deals with students hacking school computer systems. School districts are getting tough with students "hacking" into school computers to change grades, poke through files, or just pit their high-tech skills against district security. Dozens of students have been prosecuted recently under state laws on identity theft and unauthorized…
Intermediate algebra & analytic geometry
Gondin, William R
1967-01-01
Intermediate Algebra & Analytic Geometry Made Simple focuses on the principles, processes, calculations, and methodologies involved in intermediate algebra and analytic geometry. The publication first offers information on linear equations in two unknowns and variables, functions, and graphs. Discussions focus on graphic interpretations, explicit and implicit functions, first quadrant graphs, variables and functions, determinate and indeterminate systems, independent and dependent equations, and defective and redundant systems. The text then examines quadratic equations in one variable, system
Applications of algebraic method to exactly solve some nonlinear partial differential equations
Energy Technology Data Exchange (ETDEWEB)
Darwish, A.A. [Department of Mathematics, Faculty of Science, Helwan University (Egypt)]. E-mail: profdarwish@yahoo.com; Ramady, A. [Department of Mathematics, Faculty of Science, Beni-Suef University (Egypt)]. E-mail: aramady@yahoo.com
2007-08-15
A direct and unified algebraic method for constructing multiple travelling wave solutions of nonlinear evolution equations is used and implemented in a computer algebraic system. New solutions for some nonlinear partial differential equations (NLPDE's) are obtained. Graphs of the solutions are displayed.
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…
An Example of Competence-Based Learning: Use of Maxima in Linear Algebra for Engineers
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…
Located Actions in Process Algebra with Timing
Bergstra, J.A.; Middelburg, C.A.
2004-01-01
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a kn
Classifying Two-dimensional Hyporeductive Triple Algebras
Issa, A Nourou
2010-01-01
Two-dimensional real hyporeductive triple algebras (h.t.a.) are investigated. A classification of such algebras is presented. As a consequence, a classification of two-dimensional real Lie triple algebras (i.e. generalized Lie triple systems) and two-dimensional real Bol algebras is given.
Institute of Scientific and Technical Information of China (English)
崔秋珍
2012-01-01
文章阐述利用MATLAB软件，依据线性代数课程的教学内容和要求，设计和实现线性代数实验课程图形用户界面(GUI)平台的过程和方法。借助于该平台的应用使学生加深对线性代数课程知识的理解和掌握，同时锻炼学生利用计算机以及MATLAB软件处理线性代数问题的能力，为线性代数的实践教学提供一个有效的辅助工具。% This paper studies the linear algebra experimental system design and realization of graphical user interface(GUI) on matlab,According the theory of linear algebra course content and requirements for the design of experiments.With the help of the platform,the students can understand the theory and knowledge of the linear algebra course.And training the students to use the computer and matlab to deal with the problems of the linear algebra,And provide a tool for linear algebra teaching and practive.
Integration-by-parts reductions from the viewpoint of computational algebraic geometry
Larsen, Kasper J
2016-01-01
Integration-by-parts reductions play a central role in perturbative QFT calculations. They allow the set of Feynman integrals contributing to a given observable to be reduced to a small set of basis integrals, and they moreover facilitate the computation of those basis integrals. We introduce an efficient new method for generating integration-by-parts reductions. This method simplifies the task by making use of generalized-unitarity cuts and turns the problem of finding the needed total derivatives into one of solving certain polynomial (so-called syzygy) equations.
ScaLAPACK: A scalable linear algebra library for distributed memory concurrent computers
Energy Technology Data Exchange (ETDEWEB)
Choi, Jaeyoung; Walker, D.W. (Oak Ridge National Lab., TN (United States)); Dongarra, J.J. (Oak Ridge National Lab., TN (United States) Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science); Pozo, R. (Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science)
1992-01-01
This paper describes ScaLAPACK, a distributed memory version of the LAPACK software package for dense and banded matrix computations. Key resign features are the use of distributed versions of the Level 3 BLAS as building blocks, and an object-based interface to the library routines. The square block scattered decomposition is described. The implementation of a distributed memory version of the right-looking LU factorization algorithm on the Intel Delta multicomputer is discussed, and performance results are presented that demonstrate the scalability of the algorithm.
ScaLAPACK: A scalable linear algebra library for distributed memory concurrent computers
Energy Technology Data Exchange (ETDEWEB)
Choi, Jaeyoung; Walker, D.W. [Oak Ridge National Lab., TN (United States); Dongarra, J.J. [Oak Ridge National Lab., TN (United States)]|[Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science; Pozo, R. [Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science
1992-09-01
This paper describes ScaLAPACK, a distributed memory version of the LAPACK software package for dense and banded matrix computations. Key resign features are the use of distributed versions of the Level 3 BLAS as building blocks, and an object-based interface to the library routines. The square block scattered decomposition is described. The implementation of a distributed memory version of the right-looking LU factorization algorithm on the Intel Delta multicomputer is discussed, and performance results are presented that demonstrate the scalability of the algorithm.
Flexibility of Bricard's linkages and other structures via resultants and computer algebra.
Lewis, Robert H; Coutsias, Evangelos A
2016-07-01
Flexibility of structures is extremely important for chemistry and robotics. Following our earlier work, we study flexibility using polynomial equations, resultants, and a symbolic algorithm of our creation that analyzes the resultant. We show that the software solves a classic arrangement of quadrilaterals in the plane due to Bricard. We fill in several gaps in Bricard's work and discover new flexible arrangements that he was apparently unaware of. This provides strong evidence for the maturity of the software, and is a wonderful example of mathematical discovery via computer assisted experiment.
Energy Technology Data Exchange (ETDEWEB)
Morgansen, K.A.; Pin, F.G.
1995-03-01
This paper describes an enhanced version of the code for the Full Space Parameterization (FSP) method that has recently been presented for determining optimized (and possibly constrained) solutions, x, to underspecified system`s of algebraic equations b = Ax. The enhanced code uses the conditions necessary for linear independence of the m {minus} n + 1 vectors forming the solution as a basis for an efficient search pattern to quickly find the full set of solution vectors. A discussion is made of the complications which may be present due to the particular combination of the matrix A and the vector b. The first part of the code implements the various methods needed to handle these particular cases before the solution vectors are calculated so that computation time may be decreased. The second portion of the code implements methods which can be used to calculate the necessary solution vectors. The respective expressions of the full solution space, S, for the cases of the matrix A being full rank and rank deficient are given. Finally, examples of the resolution of particular cases are provided, and a sample application to the joint motion of a mobile manipulator for a given end-effector trajectory is presented.
Applications of algebraic grid generation
Eiseman, Peter R.; Smith, Robert E.
1990-01-01
Techniques and applications of algebraic grid generation are described. The techniques are univariate interpolations and transfinite assemblies of univariate interpolations. Because algebraic grid generation is computationally efficient, the use of interactive graphics in conjunction with the techniques is advocated. A flexible approach, which works extremely well in an interactive environment, called the control point form of algebraic grid generation is described. The applications discussed are three-dimensional grids constructed about airplane and submarine configurations.