Performance modeling and prediction for linear algebra algorithms
Iakymchuk, Roman
2012-01-01
This dissertation incorporates two research projects: performance modeling and prediction for dense linear algebra algorithms, and high-performance computing on clouds. The first project is focused on dense matrix computations, which are often used as computational kernels for numerous scientific applications. To solve a particular mathematical operation, linear algebra libraries provide a variety of algorithms. The algorithm of choice depends, obviously, on its performance. Performance of su...
Symplectic algebraic dynamics algorithm
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.
Algebraic dynamics solution and algebraic dynamics algorithm of Burgers equations
2008-01-01
Algebraic dynamics solution and algebraic dynamics algorithm of nonlinear partial differential evolution equations in the functional space are applied to Burgers equation. The results indicate that the approach is effective for analytical solutions to Burgers equation, and the algorithm for numerical solutions of Burgers equation is more stable, with higher precision than other existing finite difference algo-rithms.
2007-01-01
Based on the exact analytical solution of ordinary differential equations, a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm. A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models. The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision, and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
WANG ShunJin; ZHANG Hua
2007-01-01
Based on the exact analytical solution of ordinary differential equations,a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm.A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models.The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision,and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
Parallel algorithms for numerical linear algebra
van der Vorst, H
1990-01-01
This is the first in a new series of books presenting research results and developments concerning the theory and applications of parallel computers, including vector, pipeline, array, fifth/future generation computers, and neural computers.All aspects of high-speed computing fall within the scope of the series, e.g. algorithm design, applications, software engineering, networking, taxonomy, models and architectural trends, performance, peripheral devices.Papers in Volume One cover the main streams of parallel linear algebra: systolic array algorithms, message-passing systems, algorithms for p
Optimal Algorithm for Algebraic Factoring
支丽红
1997-01-01
This paper presents on optimized method for factoring multivariate polynomials over algebraic extension fields defined by an irreducible ascending set. The basic idea is to convert multivariate polynomials to univariate polynomials and algebraic extension fields to algebraic number fields by suitable integer substituteions.Then factorize the univariate polynomials over the algebraic number fields.Finally,construct mulativariate factors of the original polynomial by Hensel lemma and TRUEFACTOR test.Some examples with timing are included.
Linear algebra algorithms for divisors on an algebraic curve
Khuri-Makdisi, Kamal
2001-01-01
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and matrices of size $O(g^2)\\times O(g)$. When the base field $k$ is finite, or if $C$ has a rational point over $k$, these give algorithms for working on the Jacobian of $C$ that require $O(g^4)$ field operations, arising from the Gaussian elimination. Our point o...
Algebraic Reconstruction Algorithm of Vapor Tomography
HE Lin
2015-01-01
Full Text Available While applying algebraic reconstruction algorithm in vapor tomography, problems have to be solved with respect to constructing the constraint condition, selecting the initial value, calculating optimal relaxation factor and deciding the iteration termination condition. Golden section search method and NCP termination rule are given to solve the latter two problems, respectively. Eight algebraic reconstruction algorithms, including Kaczmarz, Randkaczmarz, Symkaczmarz, SART, Landweber, Cimmino, CAV and DROP algorithm, are comparatively analyzed and tested by the data from SatRef station in Hong Kong. The results show that all the eight algorithms can satisfy the requirements of vapor tomography and the iteration termination condition is more important than the relaxation condition. While the golden section method and NCP method are used, the CAV algorithm performs best, and then the Cimmino algorithm.
Ritter, Patricia [Centro de Estudios Científicos (CECs),Avenida Arturo Prat 514, Valdivia (Chile); Sämann, Christian [Maxwell Institute for Mathematical Sciences,Department of Mathematics, Heriot-Watt University,Colin Maclaurin Building, Riccarton, Edinburgh EH14 4AS (United Kingdom)
2014-04-09
In this paper, we begin the study of zero-dimensional field theories with fields taking values in a semistrict Lie 2-algebra. These theories contain the IKKT matrix model and various M-brane related models as special cases. They feature solutions that can be interpreted as quantized 2-plectic manifolds. In particular, we find solutions corresponding to quantizations of ℝ{sup 3}, S{sup 3} and a five-dimensional Hpp-wave. Moreover, by expanding a certain class of Lie 2-algebra models around the solution corresponding to quantized ℝ{sup 3}, we obtain higher BF-theory on this quantized space.
In this paper, we begin the study of zero-dimensional field theories with fields taking values in a semistrict Lie 2-algebra. These theories contain the IKKT matrix model and various M-brane related models as special cases. They feature solutions that can be interpreted as quantized 2-plectic manifolds. In particular, we find solutions corresponding to quantizations of ℝ3, S3 and a five-dimensional Hpp-wave. Moreover, by expanding a certain class of Lie 2-algebra models around the solution corresponding to quantized ℝ3, we obtain higher BF-theory on this quantized space
An Algebraic Hardware/Software Partitioning Algorithm
秦胜潮; 何积丰; 裘宗燕; 张乃孝
2002-01-01
Hardware and software co-design is a design technique which delivers computer systems comprising hardware and software components. A critical phase of the co-design process is to decompose a program into hardware and software. This paper proposes an algebraic partitioning algorithm whose correctness is verified in program algebra. The authors introduce a program analysis phase before program partitioning and develop a collection of syntax-based splitting rules. The former provides the information for moving operations from software to hardware and reducing the interaction between components, and the latter supports a compositional approach to program partitioning.
Detwiler, Russell L; Mehl, Steffen; Rajaram, Harihar; Cheung, Wendy W
2002-01-01
Numerical solution of large-scale ground water flow and transport problems is often constrained by the convergence behavior of the iterative solvers used to solve the resulting systems of equations. We demonstrate the ability of an algebraic multigrid algorithm (AMG) to efficiently solve the large, sparse systems of equations that result from computational models of ground water flow and transport in large and complex domains. Unlike geometric multigrid methods, this algorithm is applicable to problems in complex flow geometries, such as those encountered in pore-scale modeling of two-phase flow and transport. We integrated AMG into MODFLOW 2000 to compare two- and three-dimensional flow simulations using AMG to simulations using PCG2, a preconditioned conjugate gradient solver that uses the modified incomplete Cholesky preconditioner and is included with MODFLOW 2000. CPU times required for convergence with AMG were up to 140 times faster than those for PCG2. The cost of this increased speed was up to a nine-fold increase in required random access memory (RAM) for the three-dimensional problems and up to a four-fold increase in required RAM for the two-dimensional problems. We also compared two-dimensional numerical simulations of steady-state transport using AMG and the generalized minimum residual method with an incomplete LU-decomposition preconditioner. For these transport simulations, AMG yielded increased speeds of up to 17 times with only a 20% increase in required RAM. The ability of AMG to solve flow and transport problems in large, complex flow systems and its ready availability make it an ideal solver for use in both field-scale and pore-scale modeling. PMID:12019641
Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge
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....
Algebraic dynamics solution to and algebraic dynamics algorithm for nonlinear advection equation
2008-01-01
Algebraic dynamics approach and algebraic dynamics algorithm for the solution of nonlinear partial differential equations are applied to the nonlinear advection equa-tion. The results show that the approach is effective for the exact analytical solu-tion and the algorithm has higher precision than other existing algorithms in nu-merical computation for the nonlinear advection equation.
Optical linear algebra processors - Architectures and algorithms
Casasent, David
1986-01-01
Attention is given to the component design and optical configuration features of a generic optical linear algebra processor (OLAP) architecture, as well as the large number of OLAP architectures, number representations, algorithms and applications encountered in current literature. Number-representation issues associated with bipolar and complex-valued data representations, high-accuracy (including floating point) performance, and the base or radix to be employed, are discussed, together with case studies on a space-integrating frequency-multiplexed architecture and a hybrid space-integrating and time-integrating multichannel architecture.
Observable Algebra in Field Algebra of G-spin Models
蒋立宁
2003-01-01
Field algebra of G-spin models can provide the simplest examples of lattice field theory exhibiting quantum symmetry. Let D(G) be the double algebra of a finite group G and D(H), a sub-algebra of D(G) determined by subgroup H of G. This paper gives concrete generators and the structure of the observable algebra AH, which is a D(H)-invariant sub-algebra in the field algebra of G-spin models F, and shows that AH is a C*-algebra. The correspondence between H and AH is strictly monotonic. Finally, a duality between D(H) and AH is given via an irreducible vacuum C*-representation of F.
Solving stochastic epidemiological models using computer algebra
Hincapie, Doracelly; Ospina, Juan
2011-06-01
Mathematical modeling in Epidemiology is an important tool to understand the ways under which the diseases are transmitted and controlled. The mathematical modeling can be implemented via deterministic or stochastic models. Deterministic models are based on short systems of non-linear ordinary differential equations and the stochastic models are based on very large systems of linear differential equations. Deterministic models admit complete, rigorous and automatic analysis of stability both local and global from which is possible to derive the algebraic expressions for the basic reproductive number and the corresponding epidemic thresholds using computer algebra software. Stochastic models are more difficult to treat and the analysis of their properties requires complicated considerations in statistical mathematics. In this work we propose to use computer algebra software with the aim to solve epidemic stochastic models such as the SIR model and the carrier-borne model. Specifically we use Maple to solve these stochastic models in the case of small groups and we obtain results that do not appear in standard textbooks or in the books updated on stochastic models in epidemiology. From our results we derive expressions which coincide with those obtained in the classical texts using advanced procedures in mathematical statistics. Our algorithms can be extended for other stochastic models in epidemiology and this shows the power of computer algebra software not only for analysis of deterministic models but also for the analysis of stochastic models. We also perform numerical simulations with our algebraic results and we made estimations for the basic parameters as the basic reproductive rate and the stochastic threshold theorem. We claim that our algorithms and results are important tools to control the diseases in a globalized world.
FOUNDATION OF NUCLEAR ALGEBRAIC MODELS
周孝谦
1990-01-01
Based upon Tomonoga-Rowe's many body theory, we find that the algebraic models, including IBM and FDSM are simplest extension of Rowe-Rosensteel's sp(3R).Dynkin-Gruber's subalgebra embedding method is applied to find an appropriate algebra and it's reduction chains conforming to physical requirement. The separated cases sp(6) and so(8) now appear as two branches stemming from the same root D6-O(12). Transitional ease between sp(6) and so(8) is inherently include.
WANG; Shunjin; ZHANG; Hua
2006-01-01
The problem of preserving fidelity in numerical computation of nonlinear ordinary differential equations is studied in terms of preserving local differential structure and approximating global integration structure of the dynamical system.The ordinary differential equations are lifted to the corresponding partial differential equations in the framework of algebraic dynamics,and a new algorithm-algebraic dynamics algorithm is proposed based on the exact analytical solutions of the ordinary differential equations by the algebraic dynamics method.In the new algorithm,the time evolution of the ordinary differential system is described locally by the time translation operator and globally by the time evolution operator.The exact analytical piece-like solution of the ordinary differential equations is expressd in terms of Taylor series with a local convergent radius,and its finite order truncation leads to the new numerical algorithm with a controllable precision better than Runge Kutta Algorithm and Symplectic Geometric Algorithm.
Efficient computer algebra algorithms for polynomial matrices in control design
Baras, J. S.; Macenany, D. C.; Munach, R.
1989-01-01
The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.
Impact of hierarchical memory systems on linear algebra algorithm design
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.
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.
A spatial operator algebra for manipulator modeling and control
Rodriguez, G.; Jain, A.; Kreutz-Delgado, K.
1991-01-01
A recently developed spatial operator algebra for manipulator modeling, control, and trajectory design is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and for control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics.
Specific optimization of genetic algorithm on special algebras
Habiballa, Hashim; Novak, Vilem; Dyba, Martin; Schenk, Jiri
2016-06-01
Searching for complex finite algebras can be succesfully done by the means of genetic algorithm as we showed in former works. This genetic algorithm needs specific optimization of crossover and mutation. We present details about these optimizations which are already implemented in software application for this task - EQCreator.
Applied algebra codes, ciphers and discrete algorithms
Hardy, Darel W; Walker, Carol L
2009-01-01
This book attempts to show the power of algebra in a relatively simple setting.-Mathematical Reviews, 2010… The book supports learning by doing. In each section we can find many examples which clarify the mathematics introduced in the section and each section is followed by a series of exercises of which approximately half are solved in the end of the book. Additional the book comes with a CD-ROM containing an interactive version of the book powered by the computer algebra system Scientific Notebook. … the mathematics in the book are developed as needed and the focus of the book lies clearly o
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.
High performance linear algebra algorithms: An introduction
Gustavson, F.G.; Wasniewski, Jerzy
2006-01-01
his Mini-Symposium consisted of two back to back sessions, each consisting of five presentations, held on the afternoon of Monday, June 21, 2004. A major theme of both sessions was novel data structures for the matrices of dense linear algebra, DLA. Talks one to four of session one all centered...
An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications
Daniel J. Dougherty
2010-03-01
Full Text Available Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transformation.
An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications
Dougherty, Daniel J.
2010-01-01
Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transforma...
An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications
Dougherty, Daniel J
2010-01-01
Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transformation.
Computing Small 1-Homological Models for Commutative Differential Graded Algebras
Alvarez, Victor; Armario, Jose Andres; Frau, Maria Dolores; Gonzalez-Diaz, Rocio; Jimenez, Maria Jose; Real, Pedro; Silva, Beatriz
2001-01-01
We use homological perturbation machinery specific for the algebra category [P. Real. Homological Perturbation Theory and Associativity. Homology, Homotopy and Applications vol. 2, n. 5 (2000) 51-88] to give an algorithm for computing the differential structure of a small 1--homological model for commutative differential graded algebras (briefly, CDGAs). The complexity of the procedure is studied and a computer package in Mathematica is described for determining such models.
Overview of parallel algorithms in numerical linear algebra
Sameh, A.
1983-01-01
The author gives a brief survey of the development of multiprocessor algorithms for: (i) the direct solution of linear systems, (ii) the algebraic eigenvalue problem, and (iii) the direct and iterative methods for solving the finite-difference or finite-element linear systems of equations arising from the discretization of linear partial differential equations. 66 references.
An Algorithm for the Decomposition of Semisimple Lie Algebras
Graaf, W.A. de
2001-01-01
We consider the problem of decomposing a semisimple Lie algebra dened over a eld of characteristic zero as a direct sum of its simple ideals The method is based on the decomposition of the action of a Cartan subalgebra An implementation of the algorithm in the system ELIAS is discussed at the end of
HDL IMPLEMENTATION OF ALGEBRAIC SOFT DECISION ALGORITHM FOR RS CODES
M. Revathy; Saravanan, R.
2013-01-01
Reed Solomon (RS) codes are widely used to detect and correct data errors in transmission andstorage systems. Hence it is used in many digital communication and storage devices. In existing systemReformulated inversion less Burst error correcting (RiBC) algorithm is used. But it lacks in speed,throughput & area. To overcome this Algebraic Soft Decision (ASD) algorithm is proposed. This Proposedalgorithm is based on Unified VLSI architecture for correcting burst errors as well as random errors...
Algorithmic Algebraic Combinatorics and Gröbner Bases
Klin, Mikhail; Jurisic, Aleksandar
2009-01-01
This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Grobner bases. Topics covered include coherent configurations, association schemes, permutation groups, Latin squares, the Jacobian conjecture, mathematical chemistry, extremal combinatorics, coding theory, designs, etc. Special attention is paid to the description of innovative practical algorithms and their implementation in software packages such as GAP and MAGM
MODEL IDENTIFICATION AND COMPUTER ALGEBRA.
Bollen, Kenneth A; Bauldry, Shawn
2010-10-01
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. PMID:21769158
Optimizing algebraic petri net model checking by slicing
Khan, Yasir Imtiaz; Risoldi, Matteo
2013-01-01
High-level Petri nets make models more concise and read- able as compared to low-level Petri nets. However, usual verification techniques such as state space analysis remain an open challenge for both because of state space explosion. The contribution of this paper is to propose an approach for property based reduction of the state space of Algebraic Petri nets (a variant of high-level Petri nets). To achieve the objective, we propose a slicing algorithm for Algebraic Petri ...
Matrix algebra for linear models
Gruber, Marvin H J
2013-01-01
Matrix methods have evolved from a tool for expressing statistical problems to an indispensable part of the development, understanding, and use of various types of complex statistical analyses. This evolution has made matrix methods a vital part of statistical education. Traditionally, matrix methods are taught in courses on everything from regression analysis to stochastic processes, thus creating a fractured view of the topic. Matrix Algebra for Linear Models offers readers a unique, unified view of matrix analysis theory (where and when necessary), methods, and their applications. Written f
Bethe algebra of Gaudin model, Calogero-Moser space and Cherednik algebra
Mukhin, E.; Tarasov, V.; Varchenko, A.
2009-01-01
We identify the Bethe algebra of the Gaudin model associated to gl(N) acting on a suitable representation with the center of the rational Cherednik algebra and with the algebra of regular functions on the Calogero-Moser space.
A Review of Algebraic Link Analysis Algorithms
Mini Singh Ahuja
2012-08-01
Full Text Available The World Wide Web is a system of interlinked hypertext documents accessed via the Internet. With a web browser, one can view web pages that may contain text, images, videos, and other multimedia and navigate between them by using hyperlinks. Navigation is the process through which the users can achieve their purposes in using Web site, such as to find the information that they need or to complete the transactions that they want to do. Web mining is the application of data mining techniques to extract knowledge from Web data, where at least one of structure (hyperlink or usage (Web log data is used in the mining process (with or without other types of Web data. In this paper we have briefly discussed the web mining technique with major stress to the link analysis algorithms.
Algorithm for solving polynomial algebraic Riccati equations and its application
Augusta, Petr; Augustová, Petra
2012-01-01
Roč. 1, č. 4 (2012), s. 237-242. ISSN 2223-7038 R&D Projects: GA ČR GPP103/12/P494 Institutional support: RVO:67985556 Keywords : Numerical algorithms * algebraic Riccati equation * spatially distributed systems * optimal control Subject RIV: BC - Control Systems Theory http://lib.physcon.ru/doc?id=8b4876d6a57d
Effective Algorithms for Parametrizing Linear Control Systems over Ore Algebras
Chyzak, Frédéric; Quadrat, Alban; Robertz, Daniel
2004-01-01
In this paper, we study linear control systems over Ore algebras. Within this mathematical framework, we can simultaneously deal with different classes of linear control systems such as time-varying systems of ordinary differential equations (ODEs), differential time-delay systems, underdetermined systems of partial differential equations (PDEs), multidimensional discrete systems, multidimensional convolutional codes etc. We give effective algorithms which check whether or not a linear contro...
ALGEBRA: ALgorithm for the heterogeneous dosimetry based on GEANT4 for BRAchytherapy
Afsharpour, H.; Landry, G.; D'Amours, M.; Enger, S.; Reniers, B.; Poon, E.; Carrier, J.-F.; Verhaegen, F.; Beaulieu, L.
2012-06-01
Task group 43 (TG43)-based dosimetry algorithms are efficient for brachytherapy dose calculation in water. However, human tissues have chemical compositions and densities different than water. Moreover, the mutual shielding effect of seeds on each other (interseed attenuation) is neglected in the TG43-based dosimetry platforms. The scientific community has expressed the need for an accurate dosimetry platform in brachytherapy. The purpose of this paper is to present ALGEBRA, a Monte Carlo platform for dosimetry in brachytherapy which is sufficiently fast and accurate for clinical and research purposes. ALGEBRA is based on the GEANT4 Monte Carlo code and is capable of handling the DICOM RT standard to recreate a virtual model of the treated site. Here, the performance of ALGEBRA is presented for the special case of LDR brachytherapy in permanent prostate and breast seed implants. However, the algorithm is also capable of handling other treatments such as HDR brachytherapy.
An explicit algebraic reduced order algorithm for lithium ion cell voltage prediction
Senthil Kumar, V.; Gambhire, Priya; Hariharan, Krishnan S.; Khandelwal, Ashish; Kolake, Subramanya Mayya; Oh, Dukjin; Doo, Seokgwang
2014-02-01
The detailed isothermal electrochemical model for a lithium ion cell has ten coupled partial differential equations to describe the cell behavior. In an earlier publication [Journal of Power Sources, 222, 426 (2013)], a reduced order model (ROM) was developed by reducing the detailed model to a set of five linear ordinary differential equations and nonlinear algebraic expressions, using uniform reaction rate, volume averaging and profile based approximations. An arbitrary current profile, involving charge, rest and discharge, is broken down into constant current and linearly varying current periods. The linearly varying current period results are generic, since it includes the constant current period results as well. Hence, the linear ordinary differential equations in ROM are solved for a linearly varying current period and an explicit algebraic algorithm is developed for lithium ion cell voltage prediction. While the existing battery management system (BMS) algorithms are equivalent circuit based and ordinary differential equations, the proposed algorithm is an explicit algebraic algorithm. These results are useful to develop a BMS algorithm for on-board applications in electric or hybrid vehicles, smart phones etc. This algorithm is simple enough for a spread-sheet implementation and is useful for rapid analysis of laboratory data.
ALGEBRAIC GENERALIZATION OF THE CASH FLOW STATEMENT: REFLECTIONS BY MEANS OF AN ALGEBRAIC ALGORITHM
José Roberto Kassai
2012-09-01
Full Text Available Starting on January 1, 2008 it became mandatory for all Brazilian public companies and private companies with net worth greater than two million reais (about one million dollars as of this writing to publish a cash flow statement (CFS as part of their financial statements, making this statement another important source of information for investors. This article proposes an algebraic generalization for the CFS. Working papers can help fill in a gap in teaching about cash flow statements and produce an indirect method and a direct method, side by side with their equivalence highlighted, in a single matrix by means of algebraic algorithms. This study is normative in nature and stresses the transversal relationship between accounting and mathematics, showing that accounting reports and their structures can be seen as matrices and be subjected to algebraic deductions about the events recorded by double entries. As a result, we demonstrate a mathematical algorithm with matrices and submatrices and a script in the format of working papers, compatible with the normative orientations of the Federal Accounting Council (CFS and Brazilian legislation, permitting formulation of clear, reliable and effective cash flow statements.
An algebraic model of software evolution
Keller, Benjamin J.d
1990-01-01
A model of the software evolution process, called the Abstraction Refinement Model, is described which builds on the algebraic influence of the Laws of Programming and the transformational Draco Paradigm. The result is an algebraic structure consisting of the states of the software product (system descriptions) ordered by a relation of relative correctness with transformations defined between the system descriptions. This structure is interpreted as the software evolution space, ...
An Algorithm to Solve algebraic Riccati Equations with Polynomials
Augusta, Petr
Szczecin: West Pomeranian University of Technology, 2012, s. 409-414. ISBN 978-1-4673-2123-5. [The 17th International Conference on Methods and Models in Automation and Robotics . Międzyzdroje (PL), 27.08.2012-30.08.2012] R&D Projects: GA ČR GPP103/12/P494 Institutional support: RVO:67985556 Keywords : algebraic Riccati equations * spatially distributed systems * Fourier transforms Subject RIV: BC - Control Systems Theory
New Algebraic Soft Decision Decoding Algorithm for Reed-Solomon Code
Zhu, Yuan; Tang, Siyun
2014-01-01
In this paper, a new algebraic soft-decision decoding algorithm for Reed-Solomon code is presented. It is based on rational interpolation and the interpolation points are constructed by Berlekamp-Messay algorithm. Unlike the traditional K{\\"o}tter-Vardy algorithm, new algorithm needs interpolation for two smaller multiplicity matrixes, due to the corresponding factorization algorithm for re-constructing codewords.
Advanced computer algebra algorithms for the expansion of Feynman integrals
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.
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...
Tomino, Dan
2010-01-01
1-loop vacuum energies of (fuzzy) spacetimes from a supersymmetric reduced model with Filippov 3-algebra are discussed. A_{2,2} algebra, Nambu-Poisson algebra in flat spacetime, and a Lorentzian 3-algebra are examined as 3-algebras.
A process algebra model of QED
Sulis, William
2016-03-01
The process algebra approach to quantum mechanics posits a finite, discrete, determinate ontology of primitive events which are generated by processes (in the sense of Whitehead). In this ontology, primitive events serve as elements of an emergent space-time and of emergent fundamental particles and fields. Each process generates a set of primitive elements, using only local information, causally propagated as a discrete wave, forming a causal space termed a causal tapestry. Each causal tapestry forms a discrete and finite sampling of an emergent causal manifold (space-time) M and emergent wave function. Interactions between processes are described by a process algebra which possesses 8 commutative operations (sums and products) together with a non-commutative concatenation operator (transitions). The process algebra possesses a representation via nondeterministic combinatorial games. The process algebra connects to quantum mechanics through the set valued process and configuration space covering maps, which associate each causal tapestry with sets of wave functions over M. Probabilities emerge from interactions between processes. The process algebra model has been shown to reproduce many features of the theory of non-relativistic scalar particles to a high degree of accuracy, without paradox or divergences. This paper extends the approach to a semi-classical form of quantum electrodynamics.
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...
AR quivers,exceptional sequences and algorithms in derived Hall algebras
无
2010-01-01
Consider the canonical isomorphism between the positive part U+ of the quantum group Uq(g) and the Hall algebra H(Λ),where the semisimple Lie algebra g and the finite-dimensional hereditary algebra Λ share a Dynkin diagram.Chen and Xiao have given two algorithms to decompose the root vectors into linear combinations of monomials of Chevalley generators of U+,respectively induced by the braid group action on the exceptional sequences of Λ-modules and the structure of the Auslander-Reiten quiver of Λ.In this paper,we obtain the corresponding algorithms for the derived Hall algebra DH(Λ),which was introduced by Toen.We show that both algorithms are applicable to the lattice algebra and Heisenberg double in the sense of Kapranov.All the new recursive formulae have the same flavor with the quantum Serre relations.
Sigma-models and Homotopy Algebras
Zeitlin, Anton M
2015-01-01
We review the relation between homotopy algebras of conformal field theory and geometric structures arising in sigma models. In particular we formulate conformal invariance conditions, which in the quasi-classical limit are Einstein equations with extra fields, as generalized Maurer-Cartan equations.
Fusion algebras of logarithmic minimal models
Rasmussen, Joergen; Pearce, Paul A [Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria 3010 (Australia)
2007-11-09
We present explicit conjectures for the chiral fusion algebras of the logarithmic minimal models LM(p,p') considering Virasoro representations with no enlarged or extended symmetry algebra. The generators of fusion are countably infinite in number but the ensuing fusion rules are quasi-rational in the sense that the fusion of a finite number of representations decomposes into a finite direct sum of representations. The fusion rules are commutative, associative and exhibit an sl(2) structure but require so-called Kac representations which are typically reducible yet indecomposable representations of rank 1. In particular, the identity of the fundamental fusion algebra p {ne} 1 is a reducible yet indecomposable Kac representation of rank 1. We make detailed comparisons of our fusion rules with the results of Gaberdiel and Kausch for p = 1 and with Eberle and Flohr for (p, p') = (2, 5) corresponding to the logarithmic Yang-Lee model. In the latter case, we confirm the appearance of indecomposable representations of rank 3. We also find that closure of a fundamental fusion algebra is achieved without the introduction of indecomposable representations of rank higher than 3. The conjectured fusion rules are supported, within our lattice approach, by extensive numerical studies of the associated integrable lattice models. Details of our lattice findings and numerical results will be presented elsewhere. The agreement of our fusion rules with the previous fusion rules lends considerable support for the identification of the logarithmic minimal models LM(p,p') with the augmented c{sub p,p'} (minimal) models defined algebraically.
An algebraic approach to the Hubbard model
de Leeuw, Marius
2015-01-01
We study the algebraic structure of an integrable Hubbard-Shastry type lattice model associated with the centrally extended su(2|2) superalgebra. This superalgebra underlies Beisert's AdS/CFT worldsheet R-matrix and Shastry's R-matrix. The considered model specializes to the one-dimensional Hubbard model in a certain limit. We demonstrate that Yangian symmetries of the R-matrix specialize to the Yangian symmetry of the Hubbard model found by Korepin and Uglov. Moreover, we show that the Hubbard model Hamiltonian has an algebraic interpretation as the so-called secret symmetry. We also discuss Yangian symmetries of the A and B models introduced by Frolov and Quinn.
Phase transitions in algebraic cluster models
We study the phase transitions of two algebraic cluster models, which have similar interactions, but differ from each other in their model spaces. The semimicroscopical model incorporates the Pauli exclusion principle, while the phenomenological one does not. The appearance of the quasidynamical SU(3) symmetry is also investigated in the presence of an explicitly symmetry-breaking interaction. Examples of binary cluster configurations with two, one, or zero closed-shell clusters are studied
Boundary algebras and Kac modules for logarithmic minimal models
Morin-Duchesne, Alexi; Rasmussen, Jørgen; Ridout, David
2015-10-01
Virasoro Kac modules were originally introduced indirectly as representations whose characters arise in the continuum scaling limits of certain transfer matrices in logarithmic minimal models, described using Temperley-Lieb algebras. The lattice transfer operators include seams on the boundary that use Wenzl-Jones projectors. If the projectors are singular, the original prescription is to select a subspace of the Temperley-Lieb modules on which the action of the transfer operators is non-singular. However, this prescription does not, in general, yield representations of the Temperley-Lieb algebras and the Virasoro Kac modules have remained largely unidentified. Here, we introduce the appropriate algebraic framework for the lattice analysis as a quotient of the one-boundary Temperley-Lieb algebra. The corresponding standard modules are introduced and examined using invariant bilinear forms and their Gram determinants. The structures of the Virasoro Kac modules are inferred from these results and are found to be given by finitely generated submodules of Feigin-Fuchs modules. Additional evidence for this identification is obtained by comparing the formalism of lattice fusion with the fusion rules of the Virasoro Kac modules. These are obtained, at the character level, in complete generality by applying a Verlinde-like formula and, at the module level, in many explicit examples by applying the Nahm-Gaberdiel-Kausch fusion algorithm.
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.
Clifford algebra-based spatio-temporal modelling and analysis for complex geo-simulation data
Luo, Wen; Yu, Zhaoyuan; Hu, Yong; Yuan, Linwang
2013-10-01
The spatio-temporal data simulating Ice-Land-Ocean interaction of Antarctic are used to demonstrate the Clifford algebra-based data model construction, spatio-temporal query and data analysis. The results suggest that Clifford algebra provides a powerful mathematical tool for the whole modelling and analysis chains for complex geo-simulation data. It can also help implement spatio-temporal analysis algorithms more clearly and simply.
The impact of hierarchical memory systems on linear algebra algorithm design
Gallivan, K.; Jalby, W.; Meier, U.; Sameh, A.
1987-09-14
Performing an extremely detailed performance optimization analysis is counterproductive when the concern is performance behavior on a class of architecture, since general trends are obscured by the overwhelming number of machine-specific considerations required. Instead, in this paper, a methodology is used which identifies the effects of a hierarchical memory system on the performance of linear algebra algorithms on multivector processors; provides a means of producing a set of algorithm parameters, i.e., blocksizes, as functions of system parameters which yield near-optimal performance; and provides guidelines for algorithm designers which reduce the influence of the hierarchical memory system on algorithm performance to negligible levels and thereby allow them to concentrate on machine-specific optimizations. The remainder of this paper comprises five major discussions. First, the methodology and the attendant architectural model are discussed. Next, an analysis of the basic BLAS3 matrix-matrix primitive is presented. This is followed by a discussion of three block algorithms: a block LU decomposition, a block LDL/sup T/ decomposition and a block Gram-Schmidt algorithm. 22 refs., 9 figs.
MODEL IDENTIFICATION AND COMPUTER ALGEBRA
Bollen, Kenneth A.; Bauldry, Shawn
2010-01-01
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 a...
Algebraic analysis of a model of two-dimensional gravity
Frolov, A M; Kuzmin, S V
2009-01-01
An algebraic analysis of the Hamiltonian formulation of the model two-dimensional gravity is performed. The crucial fact is an exact coincidence of the Poisson brackets algebra of the secondary constraints of this Hamiltonian formulation with the SO(2,1)-algebra. The eigenvectors of the canonical Hamiltonian $H_{c}$ are obtained and explicitly written in closed form.
Graph model of the Heisenberg-Weyl algebra
Blasiak, P.; Horzela, A.; Duchamp, G. H. E.; Penson, K. A.; Solomon, A. I.
2007-01-01
We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple interpretation involving, for example, the natural composition of graphs. This provides a deeper insight into the algebraic structure of Quantum Theory and sheds light on the intrinsic combinatorial underpinning of its abstract formalism.
Graph model of the Heisenberg-Weyl algebra
We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple interpretation involving, for example, the natural composition of graphs. This provides a deeper insight into the algebraic structure of Quantum Theory and sheds light on the intrinsic combinatorial underpinning of its abstract formalism.
Phase transitions in algebraic cluster models
Complete text of publication follows. There has been much interest recently in phase transitions in various nuclear systems. The phases are defined as (local) minima of the potential energy surface (PES) defined in terms of parameters characterizing the nuclear system. Phase transitions occur when some relevant parameter is changed gradually and the system moves from one phase to another one. In the analysis of such systems the key questions are the number of phases and the order of phase transition between them. Algebraic nuclear structure models are especially interesting from the phase transition point of view, because the different phases may be characterized by different symmetries of the system. Much work has been done recently on models based on the interacting boson approximation (IBA). In these studies the potential energy surface is constructed from the algebraic Hamiltonian by its geometric mapping using the coherent state formalism. Inspired by these studies we performed a similar analysis of a family of algebraic cluster models based on the semimicroscopic algebraic cluster model (SACM). This model has two dynamical symmetries: the SU(3) and SO(4) limits are believed to correspond to vibration around a spherical equilibrium shape and static dipole deformation, respectively. The semimicroscopic nature of this model is reflected by the fact that a fully antisymmetrized microscopic model space is combined with a phenomenologic Hamiltonian that describes excitations of the (typically) two-cluster system. The microscopic model space is necessary to take into account the Pauli exclusion principle acting between the nucleons of the closely interacting clusters. In practice this means that the number of excitation quanta in the relative motion of the clusters has to exceed a certain number n0 characterizing the system. This is clearly a novelty with respect to other algebraic models, and it complicates the formalism considerably. We thus introduced as a
无
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.
Walter, S. F.; Lehmann, L
2010-01-01
We derive algorithms for higher order derivative computation of the rectangular $QR$ and eigenvalue decomposition of symmetric matrices with distinct eigenvalues in the forward and reverse mode of algorithmic differentiation (AD) using univariate Taylor propagation of matrices (UTPM). Linear algebra functions are regarded as elementary functions and not as algorithms. The presented algorithms are implemented in the BSD licensed AD tool \\texttt{ALGOPY}. Numerical tests show that the UTPM algor...
Quantum spin models and extended conformal algebras
Honecker, A
1995-01-01
First, an algebraic criterion for integrability is discussed -the so-called `superintegrability'- and some results on the classification of superintegrable quantum spin Hamiltonians based on sl(2) are obtained. Next, the massive phases of the Z_n-chiral Potts quantum spin chain (a model that violates parity) are studied in detail. It is shown that the excitation spectrum of the massive high-temperature phase can be explained in terms of n-1 fundamental quasiparticles. We compute correlation functions from a perturbative and numerical evaluation of the groundstate for the Z_3-chain. In addition to an exponential decay we observe an oscillating contribution. The oscillation length seems to be related to the asymmetry of the dispersion relations. We show that this relation is exact at special values of the parameters for general Z_n using a form factor expansion. Finally, we discuss several aspects of extended conformal algebras (W-algebras). We observe an analogy between boundary conditions for Z_n-spin chains ...
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
Algebraic model theory for languages without equality
Elgueta Montó, Raimon
1994-01-01
In our opinion, it is fair to distinguish two separate branches in the origins of model theory. The first one, the model theory of first-order logic, can be traced back to the pioneering work of L. Lowenheim, T. Skolem, K. Gödel, A. Tarski and A.I. MaI 'cev, published before the mid 30's. This branch was put forward during the 40s' and 50s’ by several authors, including A. Tarski, L. Henkin, A. Robinson, J. Los. Their contribution, however, was rather influenced by modern algebra, a disciplin...
A Groebner-bases algorithm for the computation of the cohomology of Lie (super) algebras
-Alizadeh, Benyamin M.; Merker, Joel; Sabzevari, Masoud
2011-01-01
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of the quotient space Z^k/B^k of cocycles Z^k modulo coboundaries B^k, we apply Groebner bases techniques (in the appropriate linear setting) and take advantage of their strength. Moreover, when the considered Lie (super) algebras enjoy a grading -- a case which...
Kimura, Yusuke
2015-07-01
It has been understood that correlation functions of multi-trace operators in SYM can be neatly computed using the group algebra of symmetric groups or walled Brauer algebras. On the other hand, such algebras have been known to construct 2D topological field theories (TFTs). After reviewing the construction of 2D TFTs based on symmetric groups, we construct 2D TFTs based on walled Brauer algebras. In the construction, the introduction of a dual basis manifests a similarity between the two theories. We next construct a class of 2D field theories whose physical operators have the same symmetry as multi-trace operators constructed from some matrices. Such field theories correspond to non-commutative Frobenius algebras. A matrix structure arises as a consequence of the noncommutativity. Correlation functions of the Gaussian complex multi-matrix models can be translated into correlation functions of the two-dimensional field theories.
Matrix Algebra for Quantum Search Algorithm: Non Unitary Symmetries and Entanglement
Ellinas, Demosthenes; Konstandakis, Christos
2011-10-01
An algebraic reformulation of the quantum search algorithm associated to a k-valued oracle function, is introduced in terms of the so called oracle matrix algebra, by means of which a Bloch sphere like description of search is obtained. A parametric family of symmetric completely positive trace preserving (CPTP) maps, that formalize the presence of quantum noise but preserves the complexity of the algorithm, is determined. Dimensional reduction of representations of oracle Lie algebra is introduced in order to determine the reduced density matrix of subsets of qubits in database. The L1 vector-induced norm of reduced density matrix is employed to define an index function for the quantum entanglement between database qubits, in the presence of non invariant noise CPTP maps. Analytic investigations provide a causal relation between entanglement and fidelity of the algorithm, which is controlled by quantum noise parameter.
Dongarra, Jack
2012-11-01
We propose to study the impact on the energy footprint of two advanced algorithmic strategies in the context of high performance dense linear algebra libraries: (1) mixed precision algorithms with iterative refinement allow to run at the peak performance of single precision floating-point arithmetic while achieving double precision accuracy and (2) tree reduction technique exposes more parallelism when factorizing tall and skinny matrices for solving over determined systems of linear equations or calculating the singular value decomposition. Integrated within the PLASMA library using tile algorithms, which will eventually supersede the block algorithms from LAPACK, both strategies further excel in performance in the presence of a dynamic task scheduler while targeting multicore architecture. Energy consumption measurements are reported along with parallel performance numbers on a dual-socket quad-core Intel Xeon as well as a quad-socket quad-core Intel Sandy Bridge chip, both providing component-based energy monitoring at all levels of the system, through the Power Pack framework and the Running Average Power Limit model, respectively. © 2012 IEEE.
Applications Of Algebraic Image Operators To Model-Based Vision
Lerner, Bao-Ting; Morelli, Michael V.; Thomas, Hans J.
1989-03-01
This paper extends our previous research on a highly structured and compact algebraic representation of grey-level images. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, we have devised an innovative, efficient edge detection scheme.We have developed a robust method for linear feature extraction by combining the techniques of a Hough transform and a line follower with this new edge detection scheme. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The feature extractor and model matcher are being incorporated into a distributed robot control system. Model matching is accomplished using both top-down and bottom-up processing: a priori sensor and world model information are used to constrain the search of the image space for features, while extracted image information is used to update the model.
A new algorithm for differential-algebraic equations based on HIDM
A new algorithm is proposed to solve differential-algebraic equations. The algorithm is an extension of the algorithm of general purpose HIDM (higher order implicit difference method). A computer program named HDMTDV and based on the new algorithm is constructed and its high performance is proved numerically through several numerical computations, including index-2 problem of differential-algebraic equations and connected rigid pendulum equations. The new algorithm is also secular error free when applied to dissipationless dynamical systems. This nature is demonstrated numerically by computation of the Kepler motion. The new code can solve the initial value problem O = L { φ(x), [dφ(x)]/dx, [d2φ(x)]/dx2, x }, where L and φ are vectors of length N. The values of first or second derivatives of φ(x) are not always necessary in the equations. (author)
Isovectorial pairing in solvable and algebraic models
Schematic interactions are useful to gain some insight in the behavior of very complicated systems such as the atomic nuclei. Prototypical examples are, in this context, the pairing interaction and the quadrupole interaction of the Elliot model. In this contribution the interplay between isovectorial pairing, spin-orbit, and quadrupole terms in a harmonic oscillator shell (the so-called pairing-plus-quadrupole model) is studied by algebraic methods. The ability of this model to provide a realistic description of N = Z even-even nuclei in the fp-shell is illustrated with 44Ti. Our calculations which derive from schematic and simple terms confirm earlier conclusions obtained by using realistic interactions: the SU(3) symmetry of the quadrupole term is broken mainly by the spin-orbit term, but the energies depends strongly on pairing.
Symmetries of faces models and the double triangle algebra
Trinchero, R
2005-01-01
Symmetries of trigonometric integrable two dimensional statistical face models are considered. The corresponding symmetry operators on the Hilbert space of states of the quantum version of these models define a weak *-Hopf algebra isomorphic to the Ocneanu double triangle algebra(DTA).
Preparing Secondary Mathematics Teachers: A Focus on Modeling in Algebra
Jung, Hyunyi; Mintos, Alexia; Newton, Jill
2015-01-01
This study addressed the opportunities to learn (OTL) modeling in algebra provided to secondary mathematics pre-service teachers (PSTs). To investigate these OTL, we interviewed five instructors of required mathematics and mathematics education courses that had the potential to include opportunities for PSTs to learn algebra at three universities.…
Jain, A.; Man, G. K.
1993-01-01
This paper describes the Dynamics Algorithms for Real-Time Simulation (DARTS) real-time hardware-in-the-loop dynamics simulator for the National Aeronautics and Space Administration's Cassini spacecraft. The spacecraft model consists of a central flexible body with a number of articulated rigid-body appendages. The demanding performance requirements from the spacecraft control system require the use of a high fidelity simulator for control system design and testing. The DARTS algorithm provides a new algorithmic and hardware approach to the solution of this hardware-in-the-loop simulation problem. It is based upon the efficient spatial algebra dynamics for flexible multibody systems. A parallel and vectorized version of this algorithm is implemented on a low-cost, multiprocessor computer to meet the simulation timing requirements.
An efficient algorithm for the contig ordering problem under algebraic rearrangement distance.
Lu, Chin Lung
2015-11-01
Assembling a genome from short reads currently obtained by next-generation sequencing techniques often results in a collection of contigs, whose relative position and orientation along the genome being sequenced are unknown. Given two sets of contigs, the contig ordering problem is to order and orient the contigs in each set such that the genome rearrangement distance between the resulting sets of ordered and oriented contigs is minimized. In this article, we utilize the permutation groups in algebra to propose a near-linear time algorithm for solving the contig ordering problem under algebraic rearrangement distance, where the algebraic rearrangement distance between two sets of ordered and oriented contigs is the minimum weight of applicable rearrangement operations required to transform one set into the other. PMID:26247343
Action Algebras and Model Algebras in Denotational Semantics
Guedes, Luiz Carlos Castro; Haeusler, Edward Hermann
This article describes some results concerning the conceptual separation of model dependent and language inherent aspects in a denotational semantics of a programming language. Before going into the technical explanation, the authors wish to relate a story that illustrates how correctly and precisely posed questions can influence the direction of research. By means of his questions, Professor Mosses aided the PhD research of one of the authors of this article and taught the other, who at the time was a novice supervisor, the real meaning of careful PhD supervision. The student’s research had been partially developed towards the implementation of programming languages through denotational semantics specification, and the student had developed a prototype [12] that compared relatively well to some industrial compilers of the PASCAL language. During a visit to the BRICS lab in Aarhus, the student’s supervisor gave Professor Mosses a draft of an article describing the prototype and its implementation experiments. The next day, Professor Mosses asked the supervisor, “Why is the generated code so efficient when compared to that generated by an industrial compiler?” and “You claim that the efficiency is simply a consequence of the Object- Orientation mechanisms used by the prototype programming language (C++); this should be better investigated. Pay more attention to the class of programs that might have this good comparison profile.” As a result of these aptly chosen questions and comments, the student and supervisor made great strides in the subsequent research; the advice provided by Professor Mosses made them perceive that the code generated for certain semantic domains was efficient because it mapped to the “right aspect” of the language semantics. (Certain functional types, used to represent mappings such as Stores and Environments, were pushed to the level of the object language (as in gcc). This had the side-effect of generating code for arrays in
The development of an algebraic multigrid algorithm for symmetric positive definite linear systems
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.
Fermi resonance-algebraic model for molecular vibrational spectra
侯喜文; 董世海; 谢汨; 马中骐
1999-01-01
A Fermi resonance-algebraic model is proposed for molecular vibrations, where a U(2) algebra is used for describing the vibrations of each bond, and Fermi resonances between stretching and bending modes are taken into account. The model for a bent molecule XY2 and a molecule XY3 is successfully applied to fitting the recently observed vibrational spectrum of the water molecule and arsine (AsH3), respectively, and the results are compared with those of other models. Calculations show that algebraic approaches can be used as an effective method to describe molecular vibrations with small standard deviations.
Modelling Software Evolution using Algebraic Graph Rewriting
Ciraci, Selim; Broek, van den, PR Peter; Avgeriou, P.; Zdun, U.; Borne, I
2006-01-01
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the relations in UML interaction diagrams. Then, we provide a set of algebraic graph rewrite rules that formalizes the changes that may be caused by an evolution request, using the pushout construction ...
W-algebras and superalgebras from constrained WZW models
A classification of W algebras and superalgebras arising in Abelian as well as non Abelian Toda theories is presented. Each model, obtained from a constrained WZW action, is related with an Sl(2) subalgebra (resp. OSp(1/2) superalgebra) of a simple Lie algebra (resp. superalgebra) G. However, the determination of an U(1)Y factor, commuting with Sl(2) (resp. OSp(1/2)), appears, when it exists, particularly useful to characterize the corresponding W algebra. The (super) conformal spin contents of each W (super)algebra is performed. The class of all the superconformal algebras (i.e. with conformal spins s≤2) is easily obtained as a byproduct of our general results. (author) 26 refs.; 21 tabs
Algebra model and security analysis for cryptographic protocols
HUAI Jinpeng; LI Xianxian
2004-01-01
More and more cryptographic protocols have been used to achieve various security requirements of distributed systems in the open network environment. However cryptographic protocols are very difficult to design and analyze due to the complexity of the cryptographic protocol execution, and a large number of problems are unsolved that range from the theory framework to the concrete analysis technique. In this paper, we build a new algebra called cryptographic protocol algebra (CPA) for describing the message operations with many cryptographic primitives, and proposed a new algebra model for cryptographic protocols based on the CPA. In the model, expanding processes of the participant's knowledge on the protocol runs are characterized with some algebraic notions such as subalgebra, free generator and polynomial algebra, and attack processes are modeled with a new notion similar to that of the exact sequence used in homological algebra. Then we develope a mathematical approach to the cryptographic protocol security analysis. By using algebraic techniques, we have shown that for those cryptographic protocols with some symmetric properties, the execution space generated by an arbitrary number of participants may boil down to a smaller space generated by several honest participants and attackers. Furthermore we discuss the composability problem of cryptographic protocols and give a sufficient condition under which the protocol composed of two correct cryptographic protocols is still correct, and we finally offer a counterexample to show that the statement may not be true when the condition is not met.
A note on probabilistic models over strings: the linear algebra approach.
Bouchard-Côté, Alexandre
2013-12-01
Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems. PMID:24135792
Hyper-lattice algebraic model for data warehousing
Sen, Soumya; Chaki, Nabendu
2016-01-01
This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternative to lattice. The authors analyze some of the shortcomings of conventional lattice structure and propose a novel algebraic structure in the form of Hyper-lattice to overcome problems with lattice. They establish how Hyper-lattice supports dynamic insertion of elements in a partial order set with a partial hierarchy between the set members. The authors present the characteristics and the different properties, showing how propositions and lemmas formalize Hyper-lattice as a new algebraic structure.
Quantum matrix algebra for the SU(n) WZNW model
Furlan, Paolo; Isaev, A P; Ogievetsky, O V; Pyatov, P N; Todorov, I T
2003-01-01
The zero modes of the chiral SU(n) WZNW model give rise to an intertwining quantum matrix algebra A generated by an n x n matrix a=(a^i_\\alpha) (with noncommuting entries) and by rational functions of n commuting elements q^{p_i}. We study a generalization of the Fock space (F) representation of A for generic q (q not a root of unity) and demonstrate that it gives rise to a model of the quantum universal enveloping algebra U_q(sl_n), each irreducible representation entering F with multiplicity 1. For an integer level k the complex parameter q is an even root of unity, q^h=-1 (h=k+n) and the algebra A has an ideal I_h such that the factor algebra A_h = A/I_h is finite dimensional.
Category-theoretic models of algebraic computer systems
Kovalyov, S. P.
2016-01-01
A computer system is said to be algebraic if it contains nodes that implement unconventional computation paradigms based on universal algebra. A category-based approach to modeling such systems that provides a theoretical basis for mapping tasks to these systems' architecture is proposed. The construction of algebraic models of general-purpose computations involving conditional statements and overflow control is formally described by a reflector in an appropriate category of algebras. It is proved that this reflector takes the modulo ring whose operations are implemented in the conventional arithmetic processors to the Łukasiewicz logic matrix. Enrichments of the set of ring operations that form bases in the Łukasiewicz logic matrix are found.
Observable algebras for the rational and trigonometric Euler-Calogero-Moser Models
We construct polynomial Poisson algebras of observables for the classical Euler-Calogero-Moser (ECM) models. Their structure connects them to flavour-indexed non-linear W∞ algebras, albeit with qualitative differences. The conserved Hamiltonians and symmetry algebras derived in a previous work are subsets of these algebra. We define their linear, N →∞ limits, realizing W∞ type algebras coupled to current algebras. ((orig.))
Model Checking Processes Specified In Join-Calculus Algebra
Sławomir Piotr Maludziński
2014-01-01
Full Text Available This article presents a model checking tool used to verify concurrent systems specified in join-calculus algebra. The temporal properties of systems under verification are expressed in CTL logic. Join-calculus algebra with its operational semantics defined by the chemical abstract machine serves as the basic method for the specification of concurrent systems and their synchronization mechanisms, and allows the examination of more complex systems.
Model Checking Processes Specified In Join-Calculus Algebra
Sławomir Piotr Maludziński; Grzegorz Dobrowolski
2014-01-01
This article presents a model checking tool used to verify concurrent systems specified in join-calculus algebra. The temporal properties of systems under verification are expressed in CTL logic. Join-calculus algebra with its operational semantics defined by the chemical abstract machine serves as the basic method for the specification of concurrent systems and their synchronization mechanisms, and allows the examination of more complex systems.
A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures
Buttari, Alfredo; Kurzak, Jakub; Dongarra, Jack
2007-01-01
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be re- formulated or new algorithms have to be developed in order to take ad- vantage of the architectural features on these new processors. Fine grain parallelism becomes a major requirement and introduces the necessity of loose synchronization in the parallel execution of an operation. This paper presents an algorithm for the Cholesky, LU and QR factorization where the operations can be represented as a sequence of small tasks that operate on square blocks of data. These tasks can be dynamically scheduled for execution based on the dependencies among them and on the availability of computational resources. This may result in an out of order execution of the tasks which will completely hide the presence of intrinsically sequential tasks in the factorization. Performance com- parisons are presented with the LAPACK algorithms where parallelism can only be exploited at the level of the BLAS op...
Boundary algebras and Kac modules for logarithmic minimal models
Morin-Duchesne, Alexi; Ridout, David
2015-01-01
Virasoro Kac modules were initially introduced indirectly as representations whose characters arise in the continuum scaling limits of certain transfer matrices in logarithmic minimal models, described using Temperley-Lieb algebras. The lattice transfer operators include seams on the boundary that use Wenzl-Jones projectors. If the projectors are singular, the original prescription is to select a subspace of the Temperley-Lieb modules on which the action of the transfer operators is non-singular. However, this prescription does not, in general, yield representations of the Temperley-Lieb algebras and the Virasoro Kac modules have remained largely unidentified. Here, we introduce the appropriate algebraic framework for the lattice analysis as a quotient of the one-boundary Temperley-Lieb algebra. The corresponding standard modules are introduced and examined using invariant bilinear forms and their Gram determinants. The structures of the Virasoro Kac modules are inferred from these results and are found to be...
A comparison between algebraic models of molecular spectroscopy
Bijker, R; Lemus, R; Arias, J M; Pérez-Bernal, F
1998-01-01
We discuss a symmetry-adapted algebraic (or vibron) model for molecular spectroscopy. The model is formulated in terms of tensor operators under the molecular point group. In this way, we have identified interactions that are absent in previous versions of the vibron model, in which the Hamiltonian is expressed in terms of Casimir operators and their products. The inclusion of these new interactions leads to reliable spectroscopic predictions. As an example we study the vibrational excitations of the methane molecule, and compare our results with those obtained in other algebraic models.
Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields
Groff, Matt
2011-01-01
The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving the problem using a computer algorithm. It is presented in a fashion that will hopefully allow for easy understanding for many people and scientists from many diverse fields. In technical terms, a novel method for solving k-SAT is explained. This method is primarily based on linear algebra and finite fields. Evidence is given that this method may require only O(n^7) time and space for deterministic models. It's concluded that signi?cant evidence exists that P=NP. There is a forum devoted to this paper at http://482527.ForumRomanum.com. All are in- vited to correspond here and help with the anal- ysis of the algorithm.
Massierer, Maike
2014-01-01
The function field sieve, a subexponential algorithm of complexity L(1/3) that computes discrete logarithms in finite fields, has recently been improved to an algorithm of complexity L(1/4) and subsequently to a quasi-polynomial time algorithm. We investigate whether the new ideas also apply to index calculus algorithms for computing discrete logarithms in Jacobians of algebraic curves. While we do not give a final answer to the question, we discuss a number of ideas, experiments, and possibl...
Sandryhaila, Aliaksei; Pueschel, Markus
2010-01-01
A polynomial transform is the multiplication of an input vector $x\\in\\C^n$ by a matrix $\\PT_{b,\\alpha}\\in\\C^{n\\times n},$ whose $(k,\\ell)$-th element is defined as $p_\\ell(\\alpha_k)$ for polynomials $p_\\ell(x)\\in\\C[x]$ from a list $b=\\{p_0(x),\\dots,p_{n-1}(x)\\}$ and sample points $\\alpha_k\\in\\C$ from a list $\\alpha=\\{\\alpha_0,\\dots,\\alpha_{n-1}\\}$. Such transforms find applications in the areas of signal processing, data compression, and function interpolation. Important examples include the discrete Fourier and cosine transforms. In this paper we introduce a novel technique to derive fast algorithms for polynomial transforms. The technique uses the relationship between polynomial transforms and the representation theory of polynomial algebras. Specifically, we derive algorithms by decomposing the regular modules of these algebras as a stepwise induction. As an application, we derive novel $O(n\\log{n})$ general-radix algorithms for the discrete Fourier transform and the discrete cosine transform of type 4.
Wen Debao; Liu Sanzhi
2010-08-01
For the limitation of the conventional multiplicative algebraic reconstruction technique (MART), a constrained MART (CMART) is proposed in this paper. In the new tomographic algorithm, a popular two-dimensional multi-point finite difference approximation of the second order Laplacian operator is used to smooth the electron density field. The feasibility and superiority of the new method are demonstrated by using the numerical simulation experiment. Finally, the CMART is used to reconstruct the regional electron density field by using the actual GNSS data under geomagnetic quiet and disturbed days. The available ionosonde data from Beijing station further validates the superiority of the new method.
Laser modeling a numerical approach with algebra and calculus
Csele, Mark Steven
2014-01-01
Offering a fresh take on laser engineering, Laser Modeling: A Numerical Approach with Algebra and Calculus presents algebraic models and traditional calculus-based methods in tandem to make concepts easier to digest and apply in the real world. Each technique is introduced alongside a practical, solved example based on a commercial laser. Assuming some knowledge of the nature of light, emission of radiation, and basic atomic physics, the text:Explains how to formulate an accurate gain threshold equation as well as determine small-signal gainDiscusses gain saturation and introduces a novel pass
Optical linear algebra processors - Noise and error-source modeling
Casasent, D.; Ghosh, A.
1985-01-01
The modeling of system and component noise and error sources in optical linear algebra processors (OLAPs) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.
Logarithmic sℓ-hat (2) CFT models from Nichols algebras: I
We construct chiral algebras that centralize rank-2 Nichols algebras with at least one fermionic generator. This gives ‘logarithmic’ W-algebra extensions of a fractional-level sℓ-hat (2) algebra. We discuss crucial aspects of the emerging general relation between Nichols algebras and logarithmic conformal field theory (CFT) models: (i) the extra input, beyond the Nichols algebra proper, needed to uniquely specify a conformal model; (ii) a relation between the CFT counterparts of Nichols algebras connected by Weyl groupoid maps; and (iii) the common double bosonization U(X) of such Nichols algebras. For an extended chiral algebra, candidates for its simple modules that are counterparts of the U(X) simple modules are proposed, as a first step toward a functorial relation between U(X) and W-algebra representation categories. (paper)
An algebraic approach to modeling in software engineering
Our work couples the formalism of universal algebras with the engineering techniques of mathematical modeling to develop a new approach to the software engineering process. Our purpose in using this combination is twofold. First, abstract data types and their specification using universal algebras can be considered a common point between the practical requirements of software engineering and the formal specification of software systems. Second, mathematical modeling principles provide us with a means for effectively analyzing real-world systems. We first use modeling techniques to analyze a system and then represent the analysis using universal algebras. The rest of the software engineering process exploits properties of universal algebras that preserve the structure of our original model. This paper describes our software engineering process and our experience using it on both research and commercial systems. We need a new approach because current software engineering practices often deliver software that is difficult to develop and maintain. Formal software engineering approaches use universal algebras to describe ''computer science'' objects like abstract data types, but in practice software errors are often caused because ''real-world'' objects are improperly modeled. There is a large semantic gap between the customer's objects and abstract data types. In contrast, mathematical modeling uses engineering techniques to construct valid models for real-world systems, but these models are often implemented in an ad hoc manner. A combination of the best features of both approaches would enable software engineering to formally specify and develop software systems that better model real systems. Software engineering, like mathematical modeling, should concern itself first and foremost with understanding a real system and its behavior under given circumstances, and then with expressing this knowledge in an executable form
Fully Analyzing an Algebraic Polya Urn Model
Morcrette, Basile
2012-01-01
This paper introduces and analyzes a particular class of Polya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color compositions varies (the urns are said to be balanced). These properties make this class of urns ideally suited for analysis from an "analytic combinatorics" point-of-view, following in the footsteps of Flajolet-Dumas-Puyhaubert, 2006. Through an algebraic generating function to which we apply a multiple coalescing saddle-point method, we are able to give precise asymptotic results for the probability distribution of the composition of the urn, as well as local limit law and large deviation bounds.
Ltaief, Hatem
2011-08-31
This paper presents the power profile of two high performance dense linear algebra libraries i.e., LAPACK and PLASMA. The former is based on block algorithms that use the fork-join paradigm to achieve parallel performance. The latter uses fine-grained task parallelism that recasts the computation to operate on submatrices called tiles. In this way tile algorithms are formed. We show results from the power profiling of the most common routines, which permits us to clearly identify the different phases of the computations. This allows us to isolate the bottlenecks in terms of energy efficiency. Our results show that PLASMA surpasses LAPACK not only in terms of performance but also in terms of energy efficiency. © 2011 Springer-Verlag.
An algorithm for identifying symmetric variables in the canonical OR-coincidence algebra system
Xiao-hua LI; Ji-zhong SHEN
2014-01-01
To simplify the process for identifying 12 types of symmetric variables in the canonical OR-coincidence (COC) algebra system, we propose a new symmetry detection algorithm based on OR-NXOR expansion. By analyzing the relationships between the coefficient matrices of sub-functions and the order coefficient subset matrices based on OR-NXOR expansion around two arbitrary logical variables, the constraint conditions of the order coefficient subset matrices are revealed for 12 types of symmetric variables. Based on the proposed constraints, the algorithm is realized by judging the order characteristic square value matrices. The proposed method avoids the transformation process from OR-NXOR expansion to AND-OR-NOT expansion, or to AND-XOR expansion, and solves the problem of completeness in the dj-map method. The application results show that, compared with traditional methods, the new algorithm is an optimal detection method in terms of applicability of the number of logical variables, detection type, and complexity of the identification process. The algorithm has been implemented in C language and tested on MCNC91 benchmarks. Experimental results show that the proposed algorithm is convenient and efficient.
ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
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
Weak quasitriangular Quasi-Hopf algebra structure of minimal models
Teschner, J. A.
1995-01-01
The chiral vertex operators for the minimal models are constructed and used to define a fusion product of representations. The existence of commutativity and associativity operations is proved. The matrix elements of the associativity operations are shown to be given in terms of the 6-j symbols of the weak quasitriangular quasi-Hopf algebra obtained by truncating $\\usl$ at roots of unity.
Supersymmetry and DLCQ Limit of Lie 3-algebra Model of M-theory
Sato, Matsuo
2011-01-01
In arXiv:1003.4694, we proposed two models of M-theory, Hermitian 3-algebra model and Lie 3-algebra model. In this paper, we study the Lie 3-algebra model with a Lorentzian Lie 3-algebra. This model is ghost-free despite the Lorentzian 3-algebra. We show that our model satisfies two criteria as a model of M-theory. First, we show that the model possesses N=1 supersymmetry in eleven dimensions. Second, we show the model reduces to BFSS matrix theory with finite size matrices in a DLCQ limit.
How algebraic Bethe ansatz works for integrable model
Fadeev, L
1996-01-01
I study the technique of Algebraic Bethe Ansatz for solving integrable models and show how it works in detail on the simplest example of spin 1/2 XXX magnetic chain. Several other models are treated more superficially, only the specific details are given. Several parameters, appearing in these generalizations: spin s, anisotropy parameter \\ga, shift \\om in the alternating chain, allow to include in our treatment most known examples of soliton theory, including relativistic model of Quantum Field Theory.
Generalization of Richardson-Gaudin models to rank-2 algebras
Errea, B; Lerma, S; Dukelsky, J; Dimitrova, S S; Pittel, S; Van Isacker, P; Gueorguiev, V G
2006-07-20
A generalization of Richardson-Gaudin models to the rank-2 SO(5) and SO(3,2) algebras is used to describe systems of two kinds of fermions or bosons interacting through a pairing force. They are applied to the proton-neutron neutron isovector pairing model and to the Interacting Boson Model 2, in the transition from vibration to gamma-soft nuclei, respectively. In both cases, the integrals of motion and their eigenvalues are obtained.
Modelling and Analysis of Network Security - an Algebraic Approach
Qian ZHANG; Jiang, Ying; Wu, Peng
2015-01-01
Game theory has been applied to investigate network security. But different security scenarios were often modeled via different types of games and analyzed in an ad-hoc manner. In this paper, we propose an algebraic approach for modeling and analyzing uniformly several types of network security games. This approach is based on a probabilistic extension of the value-passing Calculus of Communicating Systems (CCS) which is regarded as a Generative model for Probabilistic Value-passing CCS (PVCC...
Algebraic turbulence modeling for unstructured and adaptive meshes
Mavriplis, Dimitri J.
1990-01-01
An algebraic turbulence model based on the Baldwin-Lomax model, has been implemented for use on unstructured grids. The implementation is based on the use of local background structured turbulence meshes. At each time-step, flow variables are interpolated from the unstructured mesh onto the background structured meshes, the turbulence model is executed on these meshes, and the resulting eddy viscosity values are interpolated back to the unstructured mesh. Modifications to the algebraic model were required to enable the treatment of more complicated flows, such as confluent boundary layers and wakes. The model is used in conjuction with an efficient unstructured multigrid finite-element Navier-Stokes solver in order to compute compressible turbulent flows on fully unstructured meshes. Solutions about single and multiple element airfoils are obtained and compared with experimental data.
The BC1 quantum elliptic model: algebraic forms, hidden algebra sl(2), polynomial eigenfunctions
The potential of the BC1 quantum elliptic model is a superposition of two Weierstrass functions with a doubling of both periods (two coupling constants). The BC1 elliptic model degenerates to an A1 elliptic model characterized by the Lamé Hamiltonian. It is shown that in the space of the BC1 elliptic invariant, the potential becomes a rational function, while the flat space metric becomes a polynomial. The model possesses the hidden sl(2) algebra for arbitrary coupling constants: it is equivalent to the sl(2) quantum top in three different magnetic fields. It is shown that three one-parametric families of coupling constants exist, for which a finite number of polynomial eigenfunctions (up to a factor) occur. (paper)
The Hidden Quantum Group of the 8-vertex Free Fermion Model: q-Clifford Algebras
Cuerno, Rodolfo; Gómez, César; López Manzanares, Esperanza; Sierra, Germán
1993-01-01
We prove in this paper that the elliptic $R$--matrix of the eight vertex free fermion model is the intertwiner $R$--matrix of a quantum deformed Clifford--Hopf algebra. This algebra is constructed by affinization of a quantum Hopf deformation of the Clifford algebra.
Integrability in three dimensions: Algebraic Bethe ansatz for anyonic models
Khachatryan, Sh.; Ferraz, A.; Klümper, A.; Sedrakyan, A.
2015-10-01
We extend basic properties of two dimensional integrable models within the Algebraic Bethe Ansatz approach to 2 + 1 dimensions and formulate the sufficient conditions for the commutativity of transfer matrices of different spectral parameters, in analogy with Yang-Baxter or tetrahedron equations. The basic ingredient of our models is the R-matrix, which describes the scattering of a pair of particles over another pair of particles, the quark-anti-quark (meson) scattering on another quark-anti-quark state. We show that the Kitaev model belongs to this class of models and its R-matrix fulfills well-defined equations for integrability.
Integrability in three dimensions: Algebraic Bethe ansatz for anyonic models
Sh. Khachatryan
2015-10-01
Full Text Available We extend basic properties of two dimensional integrable models within the Algebraic Bethe Ansatz approach to 2+1 dimensions and formulate the sufficient conditions for the commutativity of transfer matrices of different spectral parameters, in analogy with Yang–Baxter or tetrahedron equations. The basic ingredient of our models is the R-matrix, which describes the scattering of a pair of particles over another pair of particles, the quark-anti-quark (meson scattering on another quark-anti-quark state. We show that the Kitaev model belongs to this class of models and its R-matrix fulfills well-defined equations for integrability.
Karassiov, V. P.; A. A. Gusev; Vinitsky, S. I.
2001-01-01
We compare exact and SU(2)-cluster approximate calculation schemes to determine dynamics of the second-harmonic generation model using its reformulation in terms of a polynomial Lie algebra $su_{pd}(2)$ and related spectral representations of the model evolution operator realized in algorithmic forms. It enabled us to implement computer experiments exhibiting a satisfactory accuracy of the cluster approximations in a large range of characteristic model parameters.
Algebraic fermion models and nuclear structure physics
Recent experimental and theoretical developments are generating renewed interest in the nuclear SU(3) shell model, and this extends to the symplectic model, with its Sp(6,R) symmetry, which is a natural multi-(ℎ/2π)ω extension of the SU(3) theory. First and foremost, an understanding of how the dynamics of a quantum rotor is embedded in the shell model has established it as the model of choice for describing strongly deformed systems. Second, the symplectic model extension of the 0-(ℎ/2π)ω theory can be used to probe additional degrees of freedom, like core polarization and vorticity modes that play a key role in providing a full description of quadrupole collectivity. Third, the discovery and understanding of pseudo-spin has allowed for an extension of the theory from light (A≤40) to heavy (A≥100) nuclei. Fourth, a user-friendly computer code for calculating reduced matrix elements of operators that couple SU(3) representations is now available. And finally, since the theory is designed to cope with deformation in a natural way, microscopic features of deformed systems can be probed; for example, the theory is now being employed to study double beta decay and thereby serves to probe the validity of the standard model of particles and their interactions. A subset of these topics will be considered in this course--examples cited include: a consideration of the origin of pseudo-spin symmetry; a SU(3)-based interpretation of the coupled-rotor model, early results of double beta decay studies; and some recent developments on the pseudo-SU(3) theory. Nothing will be said about other fermion-based theories; students are referred to reviews in the literature for reports on developments in these related areas
Algebraic Turbulence-Chemistry Interaction Model
Norris, Andrew T.
2012-01-01
The results of a series of Perfectly Stirred Reactor (PSR) and Partially Stirred Reactor (PaSR) simulations are compared to each other over a wide range of operating conditions. It is found that the PaSR results can be simulated by a PSR solution with just an adjusted chemical reaction rate. A simple expression has been developed that gives the required change in reaction rate for a PSR solution to simulate the PaSR results. This expression is the basis of a simple turbulence-chemistry interaction model. The interaction model that has been developed is intended for use with simple one-step global reaction mechanisms and for steady-state flow simulations. Due to the simplicity of the model there is very little additional computational cost in adding it to existing CFD codes.
Algebraic spin liquid in an exactly solvable spin model
Yao, Hong; Zhang, Shou-Cheng; Kivelson, Steven A.; /Stanford U., Phys. Dept.
2010-03-25
We have proposed an exactly solvable quantum spin-3/2 model on a square lattice. Its ground state is a quantum spin liquid with a half integer spin per unit cell. The fermionic excitations are gapless with a linear dispersion, while the topological 'vison' excitations are gapped. Moreover, the massless Dirac fermions are stable. Thus, this model is, to the best of our knowledge, the first exactly solvable model of half-integer spins whose ground state is an 'algebraic spin liquid.'
The supersymmetry extended Weyl algebra and Casalbuoni's G4 model
We briefly review the classical version of Casalbuoni's G4 supersymmetric model (i.e. the single particle version of the scalar chiral supermultiplet) with particular emphasis on the role played by the chirality. We show that the off-mass-shell commutators of the quantum model can be derived from the Lie algebra of the Weyl (i.e. Poincare plus dilatations) group extended by supersymmetry. The proper-time wavefunctions of the off-mass-shell states satisfy equations which clarify the role of the auxiliary fields of quantum field theory. (orig.)
A Multiple—Valued Algebra for Modeling MOS VLSI Circuits at Switch—Level
胡谋
1992-01-01
A multiple-valued algebra for modeling MOS VLSI circuits at switch-level is proposed in this paper,Its structure and properties are studied.This algebra can be used to transform a MOS digital circuit to a swith-level algebraic expression so as to generate the truth table for the circuit and to derive a Boolean expression for it.In the paper,methods to construct a switch-level algebraic expression for a circuit and methods to simplify expressions are given.This algebra provides a new tool for MOS VLSI circuit design and analysis.
Clifford algebra and the projective model of Hyperbolic spaces
Sokolov, Andrey
2016-01-01
I apply the algebraic framework developed in [1] to study geometry of hyperbolic spaces in 1, 2, and 3 dimensions. The background material on projectivised Clifford algebras and their application to Cayley-Klein geometries is described in [2].
Software Engineering and Complexity in Effective Algebraic Geometry
Heintz, Joos; Paredes, Andres Rojas
2011-01-01
We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a computation model, adapted to Scientific Computing, which captures all known branching parsimonious symbolic algorithms in effective Algebraic Geometry. We justify this model by arguments from Software Engineering. Finally we exhibit a class of simple elimination problems of effective Algebraic Geometry which require exponential time to be solved by branching parsimonious algorithms of our computation model.
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
Pralet, C; Verfaillie, G; 10.1613/jair.2151
2011-01-01
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can express "simple" decision problems, while others are designed to take into account uncertainties, unfeasible decisions, and utilities. Even in a single formalism, several variants are often proposed to model different types of uncertainty (probability, possibility...) or utility (additive or not). In this article, we introduce an algebraic graphical model that encompasses a large number of such formalisms: (1) we first adapt previous structures from Friedman, Chu and Halpern for representing uncertainty, utility, and expected utility in order to deal with generic forms of sequential decision making; (2) on these structures, we then introduce composite graphical models that express information via variables linked by "local" functions, thanks to conditional independence; (3) on these graphical models, we finally define a simple class ...
Proceedings Second International Workshop on Algebraic Methods in Model-based Software Engineering
Durán, Francisco
2011-01-01
Over the past years there has been quite a lot of activity in the algebraic community about using algebraic methods for providing support to model-driven software engineering. The aim of this workshop is to gather researchers working on the development and application of algebraic methods to provide rigorous support to model-based software engineering. The topics relevant to the workshop are all those related to the use of algebraic methods in software engineering, including but not limited to: formally specifying and verifying model-based software engineering concepts and related ones (MDE, UML, OCL, MOF, DSLs, ...); tool support for the above; integration of formal and informal methods; and theoretical frameworks (algebraic, rewriting-based, category theory-based, ...). The workshop's main goal is to examine, discuss, and relate the existing projects within the algebraic community that address common open-issues in model-driven software engineering.
Topological basis realization for BMW algebra and Heisenberg XXZ spin chain model
Liu, Bo; Xue, Kang; Wang, Gangcheng; Liu, Ying; Sun, Chunfang
2015-04-01
In this paper, we study three-dimensional (3D) reduced Birman-Murakami-Wenzl (BMW) algebra based on topological basis theory. Several examples of BMW algebra representations are reviewed. We also discuss a special solution of BMW algebra, which can be used to construct Heisenberg XXZ model. The theory of topological basis provides a useful method to solve quantum spin chain models. It is also shown that the ground state of XXZ spin chain is superposition state of topological basis.
A U(1) Current Algebra Model Coupled to 2D-Gravity
Stoilov, M.; Zaikov, R.
1993-01-01
We consider a simple model of a scalar field with $U(1)$ current algebra gauge symmetry coupled to $2D$-gravity in order to clarify the origin of Stuckelberg symmetry in the $w_{\\infty}$-gravity theory. An analogous symmetry takes place in our model too. The possible central extension of the complete symmetry algebra and the corresponding critical dimension have been found. The analysis of the Hamiltonian and the constraints shows that the generators of the current algebra, the reparametrizat...
A New Algebraic Modelling Approach to Distributed Problem-Solving in MAS
帅典勋; 邓志东
2002-01-01
This paper is devoted to a new algebraic modelling approach to distributed problem-solving in multi-agent systems (MAS), which is featured by a unified framework for describing and treating social behaviors, social dynamics and social intelligence. A conceptual architecture of algebraic modelling is presented. The algebraic modelling of typical social behaviors, social situation and social dynamics is discussed in the context of distributed problemsolving in MAS. The comparison and simulation on distributed task allocations and resource assignments in MAS show more advantages of the algebraic approach than other conventional methods.
Mahé, Louis; Roy, Marie-Françoise
1992-01-01
Ten years after the first Rennes international meeting on real algebraic geometry, the second one looked at the developments in the subject during the intervening decade - see the 6 survey papers listed below. Further contributions from the participants on recent research covered real algebra and geometry, topology of real algebraic varieties and 16thHilbert problem, classical algebraic geometry, techniques in real algebraic geometry, algorithms in real algebraic geometry, semialgebraic geometry, real analytic geometry. CONTENTS: Survey papers: M. Knebusch: Semialgebraic topology in the last ten years.- R. Parimala: Algebraic and topological invariants of real algebraic varieties.- Polotovskii, G.M.: On the classification of decomposing plane algebraic curves.- Scheiderer, C.: Real algebra and its applications to geometry in the last ten years: some major developments and results.- Shustin, E.L.: Topology of real plane algebraic curves.- Silhol, R.: Moduli problems in real algebraic geometry. Further contribu...
Clifford algebras geometric modelling and chain geometries with application in kinematics
Klawitter, Daniel
2015-01-01
After revising known representations of the group of Euclidean displacements Daniel Klawitter gives a comprehensive introduction into Clifford algebras. The Clifford algebra calculus is used to construct new models that allow descriptions of the group of projective transformations and inversions with respect to hyperquadrics. Afterwards, chain geometries over Clifford algebras and their subchain geometries are examined. The author applies this theory and the developed methods to the homogeneous Clifford algebra model corresponding to Euclidean geometry. Moreover, kinematic mappings for special Cayley-Klein geometries are developed. These mappings allow a description of existing kinematic mappings in a unifying framework. Contents Models and representations of classical groups Clifford algebras, chain geometries over Clifford algebras Kinematic mappings for Pin and Spin groups Cayley-Klein geometries Target Groups Researchers and students in the field of mathematics, physics, and mechanical engineering About...
Algorithms and Methods for High-Performance Model Predictive Control
Frison, Gianluca
The goal of this thesis is to investigate algorithms and methods to reduce the solution time of solvers for Model Predictive Control (MPC). The thesis is accompanied with an open-source toolbox for High-Performance implementation of solvers for MPC (HPMPC), that contains the source code of all...... proposed, aiming at improving the computational performance in case of small matrices. About the algorithms, they are built on top of the proposed linear algebra, and they are tailored to exploit the high-level structure of the MPC problems, with special care on reducing the computational complexity....
Algebraic Traveling Wave Solutions of a Non-local Hydrodynamic-type Model
In this paper we consider the algebraic traveling wave solutions of a non-local hydrodynamic-type model. It is shown that algebraic traveling wave solutions exist if and only if an associated first order ordinary differential system has invariant algebraic curve. The dynamical behavior of the associated ordinary differential system is analyzed. Phase portraits of the associated ordinary differential system is provided under various parameter conditions. Moreover, we classify algebraic traveling wave solutions of the model. Some explicit formulas of smooth solitary wave and cuspon solutions are obtained
Algebraic model for single-particle energies of $\\Lambda$ hypernuclei
Fortunato, L
2016-01-01
A model is proposed for the spectrum of $\\Lambda$ hypernuclei based on the $u(3)\\times u(2)$ Lie algebra, in which the internal degrees of freedom of the spin-1/2 $\\Lambda$ particle are treated in the Fermionic $u(2)$ scheme, while the motion of the hyperon inside a nucleus is described in the Bosonic $u(3)$ harmonic oscillator scheme. Within this model, a simple formula for single-particle energies of the $\\Lambda$ particle is obtained from the natural dynamical symmetry. The formula is applied to the experimental data on the reaction spectroscopy for the $^{89}_\\Lambda$Y and $^{51}_\\Lambda$V hypernuclei, providing a clear theoretical interpretation of the observed structures.
07071 Report on Dagstuhl Seminar -- Web Information Retrieval and Linear Algebra Algorithms
Frommer, Andreas; Mahoney, Michael W.; Szyld, Daniel B.
2007-01-01
A seminar concentrating on the intersection of the fields of information retrieval and other web-related aspects with numerical and applied linear algebra techniques was held with the attendance of scientists from industry and academia.
Algebraic models of deviant modal operators based on de Morgan and Kleene lattices
Cattaneo, G.; Ciucci, DE; Dubois, D.
2011-01-01
An algebraic model of a kind of modal extension of de Morgan logic is described under the name MDS5 algebra. The main properties of this algebra can be summarized as follows: (1) it is based on a de Morgan lattice, rather than a Boolean algebra; (2) a modal necessity operator that satisfies the axioms N, K, T, and 5 (and as a consequence also B and 4) of modal logic is introduced; it allows one to introduce a modal possibility by the usual combination of necessity operation and...
Phases and phase transitions in the algebraic microscopic shell model
Georgieva A. I.
2016-01-01
Full Text Available We explore the dynamical symmetries of the shell model number conserving algebra, which define three types of pairing and quadrupole phases, with the aim to obtain the prevailing phase or phase transition for the real nuclear systems in a single shell. This is achieved by establishing a correspondence between each of the pairing bases with the Elliott’s SU(3 basis that describes collective rotation of nuclear systems. This allows for a complete classification of the basis states of different number of particles in all the limiting cases. The probability distribution of the SU(3 basis states within theirs corresponding pairing states is also obtained. The relative strengths of dynamically symmetric quadrupole-quadrupole interaction in respect to the isoscalar, isovector and total pairing interactions define a control parameter, which estimates the importance of each term of the Hamiltonian in the correct reproduction of the experimental data for the considered nuclei.
Re"modeling" College Algebra: An Active Learning Approach
Pinzon, D.; Pinzon, K.; Stackpole, M.
2016-01-01
In this paper, we discuss active learning in College Algebra at Georgia Gwinnett College. This approach has been used in more than 20 sections of College Algebra taught by the authors in the past four semesters. Students work in small, structured groups on guided inquiry activities after watching 15-20 minutes of videos before class. We discuss a…
Algebraic structures generating reaction-diffusion models: the activator-substrate system
Palese, Marcella
2015-01-01
We shall construct a class of nonlinear reaction-diffusion equations starting from an infinitesimal algebraic skeleton. Our aim is to explore the possibility of an algebraic foundation of integrability properties and of stability of equilibrium states associated with nonlinear models describing patterns formation.
Sigma-model Solutions and Intersecting p-Branes Related to Lie Algebras
Grebeniuk, M. A.; Ivashchuk, V. D.
1998-01-01
A family of Majumdar-Papapetrou type solutions in sigma-model of p-brane origin is obtained for all direct sums of finite-dimensional simple Lie algebras. Several examples of p-brane dyonic configurations in D=10 (IIA) and D=11 supergravities corresponding to the Lie algebra sl(3,C) are considered.
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
Index-aware model order reduction methods applications to differential-algebraic equations
Banagaaya, N; Schilders, W H A
2016-01-01
The main aim of this book is to discuss model order reduction (MOR) methods for differential-algebraic equations (DAEs) with linear coefficients that make use of splitting techniques before applying model order reduction. The splitting produces a system of ordinary differential equations (ODE) and a system of algebraic equations, which are then reduced separately. For the reduction of the ODE system, conventional MOR methods can be used, whereas for the reduction of the algebraic systems new methods are discussed. The discussion focuses on the index-aware model order reduction method (IMOR) and its variations, methods for which the so-called index of the original model is automatically preserved after reduction.
Bracken, Anthony J.; Ge Xiangyu; Gould, Mark D.; Links, Jon; Zhou Huanqiang [Centre for Mathematical Physics, University of Queensland, Brisbane, QLD (Australia)
2001-06-01
Integrable extended Hubbard models arising from symmetric group solutions are examined in the framework of the graded quantum inverse scattering method. The Bethe ansatz equations for all these models are derived by using the algebraic Bethe ansatz method. (author)
Algorithmic Issues in Modeling Motion
Agarwal, P. K; Guibas, L. J; Edelsbrunner, H.;
2003-01-01
This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory...
Analysis of DIRAC's behavior using model checking with process algebra
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple; the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike conventional testing, it allows full control over the parallel processes execution, and supports exhaustive state-space exploration. We used the mCRL2 language and toolset to model the behavior of two related DIRAC subsystems: the workload and storage management system. Based on process algebra, mCRL2 allows defining custom data types as well as functions over these. This makes it suitable for modeling the data manipulations made by DIRAC's agents. By visualizing the state space and replaying scenarios with the toolkit's simulator, we have detected race-conditions and deadlocks in these systems, which, in several cases, were confirmed to occur in the reality. Several properties of interest were formulated and verified with the tool. Our future direction is automating the translation from DIRAC to a formal model.
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Templon, Jeff; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Graciani Diaz, Ricardo; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-12-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple; the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike conventional testing, it allows full control over the parallel processes execution, and supports exhaustive state-space exploration. We used the mCRL2 language and toolset to model the behavior of two related DIRAC subsystems: the workload and storage management system. Based on process algebra, mCRL2 allows defining custom data types as well as functions over these. This makes it suitable for modeling the data manipulations made by DIRAC's agents. By visualizing the state space and replaying scenarios with the toolkit's simulator, we have detected race-conditions and deadlocks in these systems, which, in several cases, were confirmed to occur in the reality. Several properties of interest were formulated and verified with the tool. Our future direction is automating the translation from DIRAC to a formal model.
Y(sl(2)) Algebra Application in Extended Hydrogen Atom and Monopole Models
TIAN Li-Jun; ZHANG Hong-Biao; JIN Shuo; XUE Kang
2004-01-01
We present the extended hydrogen atom and monopole-hydrogen atom theory through generalizing the usual hydrogen atom model and with a monopole model respectively, in which Y (sl(2) ) algebras are realized. We derive the Hamiltonians of the two models based on the Y(sl(2) ) and the generalized Pauli equation. The energy spectra of the systems are also given in terms of Yangian algebra and quantum mechanics.
Model Checking Process Algebra of Communicating Resources for Real-time Systems
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 and...... original semantics of PACOR and enables the verification of PACOR systems using symbolic model checking in UPPAAL and statistical model checking UPPAAL SMC. Finally we provide an example to illustrate system specification in PACOR, translation and verification....
Model checking process algebra of communicating resources for real-time systems
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...... preserves the original semantics of PACoR and enables the verification of PACoR systems using symbolic model checking in Uppaal and statistical model checking UppaalSMC. Finally we provide an example to illustrate system specification in PACoR, translation and verification....
Ahmadi, Amir Ali; Parrilo, Pablo A.
2014-01-01
Exciting recent developments at the interface of optimization and control have shown that several fundamental problems in dynamics and control, such as stability, collision avoidance, robust performance, and controller synthesis can be addressed by a synergy of classical tools from Lyapunov theory and modern computational techniques from algebraic optimization. In this paper, we give a brief overview of our recent research efforts (with various coauthors) to (i) enhance the scalability of the...
A novel hybrid optimization algorithm for diferential-algebraic control problems
F. S. Lobato
2007-09-01
Full Text Available Dynamic optimization problems can be numerically solved by direct, indirect and Hamilton-Jacobi-Bellman methods. In this paper, the differential-algebraic approach is incorporated into a hybrid method, extending the concepts of structural and differential indexes, consistent initialization analysis, index reduction and dynamic degrees of freedom to the optimal control problem. The resultant differential-algebraic optimal control problem is solved in the following steps: transformation of the original problem into a standard nonlinear programming problem that provides control and state variables, switching time estimates and costate variables profiles with the DIRCOL code; definition of the switching function and the automatically generated sequence of index-1 differential-algebraic boundary value problems from Pontryagin’s minimum principle by using the developed Otima code; and finally, application of the COLDAE code with the results of the direct method as an initial guess. The proposed hybrid method is illustrated with a pressure-constrained batch reactor optimization problem associated with the slack variable method.
Currents algebra for an atom-molecule Bose-Einstein condensate model
Filho, Gilberto N. Santos
2016-01-01
I present an interconversion currents algebra for an atom-molecule Bose-Einstein condensate model and use it to get the quantum dynamics of the currents. For different choices of the Hamiltonian parameters I get different currents dynamics.
Tracking Problem Solving by Multivariate Pattern Analysis and Hidden Markov Model Algorithms
Anderson, John R.
2012-01-01
Multivariate pattern analysis can be combined with Hidden Markov Model algorithms to track the second-by-second thinking as people solve complex problems. Two applications of this methodology are illustrated with a data set taken from children as they interacted with an intelligent tutoring system for algebra. The first "mind reading" application…
Marginalization algorithm for compositional models
Jiroušek, Radim; Kratochvíl, Václav
Paris: Editions EDK, 2006 - (Bouchon-Meunier, B.; Yager, R.), s. 2300-2307 ISBN 2-84254-112-X. [IPMU 2006 /11./. Paris (FR), 02.07.2006-07.07.2006] R&D Projects: GA MŠk 1M0572; GA AV ČR IAA2075302 Institutional research plan: CEZ:AV0Z10750506 Keywords : compositional model * multidimensional distribution * Bayesian network * marginalization * algorithm Subject RIV: BA - General Mathematics
Off-critical W∞ and Virasoro algebras as dynamical symmetries of the integrable models
An infinite set of new non commuting conserved charges in a specific class of perturbed CFT's is founded and a criterion for their existence is presented. They appear to be higher momenta of the already known commuting conserved currents. The algebra they close consists of two non commuting W ∞ algebras. Various Virasoro subalgebras of the full symmetry algebra are founded. It is shown on the examples of the perturbed Ising and Potts models that one of them plays an essential role in the computation of the correlation functions of the fields of the theory. (author)
Direct Model Checking Matrix Algorithm
Zhi-Hong Tao; Hans Kleine Büning; Li-Fu Wang
2006-01-01
During the last decade, Model Checking has proven its efficacy and power in circuit design, network protocol analysis and bug hunting. Recent research on automatic verification has shown that no single model-checking technique has the edge over all others in all application areas. So, it is very difficult to determine which technique is the most suitable for a given model. It is thus sensible to apply different techniques to the same model. However, this is a very tedious and time-consuming task, for each algorithm uses its own description language. Applying Model Checking in software design and verification has been proved very difficult. Software architectures (SA) are engineering artifacts that provide high-level and abstract descriptions of complex software systems. In this paper a Direct Model Checking (DMC) method based on Kripke Structure and Matrix Algorithm is provided. Combined and integrated with domain specific software architecture description languages (ADLs), DMC can be used for computing consistency and other critical properties.
Algebraic multigrid preconditioner for the cardiac bidomain model.
Plank, Gernot; Liebmann, Manfred; Weber dos Santos, Rodrigo; Vigmond, Edward J; Haase, Gundolf
2007-04-01
The bidomain equations are considered to be one of the most complete descriptions of the electrical activity in cardiac tissue, but large scale simulations, as resulting from discretization of an entire heart, remain a computational challenge due to the elliptic portion of the problem, the part associated with solving the extracellular potential. In such cases, the use of iterative solvers and parallel computing environments are mandatory to make parameter studies feasible. The preconditioned conjugate gradient (PCG) method is a standard choice for this problem. Although robust, its efficiency greatly depends on the choice of preconditioner. On structured grids, it has been demonstrated that a geometric multigrid preconditioner performs significantly better than an incomplete LU (ILU) preconditioner. However, unstructured grids are often preferred to better represent organ boundaries and allow for coarser discretization in the bath far from cardiac surfaces. Under these circumstances, algebraic multigrid (AMG) methods are advantageous since they compute coarser levels directly from the system matrix itself, thus avoiding the complexity of explicitly generating coarser, geometric grids. In this paper, the performance of an AMG preconditioner (BoomerAMG) is compared with that of the standard ILU preconditioner and a direct solver. BoomerAMG is used in two different ways, as a preconditioner and as a standalone solver. Two 3-D simulation examples modeling the induction of arrhythmias in rabbit ventricles were used to measure performance in both sequential and parallel simulations. It is shown that the AMG preconditioner is very well suited for the solution of the bidomain equation, being clearly superior to ILU preconditioning in all regards, with speedups by factors in the range 5.9-7.7. PMID:17405366
Excel Spreadsheets for Algebra: Improving Mental Modeling for Problem Solving
Engerman, Jason; Rusek, Matthew; Clariana, Roy
2014-01-01
This experiment investigates the effectiveness of Excel spreadsheets in a high school algebra class. Students in the experiment group convincingly outperformed the control group on a post lesson assessment. The student responses, teacher observations involving Excel spreadsheet revealed that it operated as a mindtool, which formed the users'…
无
2010-01-01
We give an equivalent construction of the infinitesimal time translation operator for partial differential evolution equation in the algebraic dynamics algorithm proposed by Shun-Jin Wang and his students. Our construction involves only simple partial differentials and avoids the derivative terms of δ function which appear in the course of computation by means of Wang-Zhang operator. We prove Wang’s equivalent theorem which says that our construction and Wang-Zhang’s are equivalent. We use our construction to deal with several typical equations such as nonlinear advection equation, Burgers equation, nonlinear Schrodinger equation, KdV equation and sine-Gordon equation, and obtain at least second order approximate solutions to them. These equations include the cases of real and complex field variables and the cases of the first and the second order time derivatives.
The reflection equation algebra of Sklyanin is extended to the supersymmetric case. A graded reflection equation algebra is proposed and the corresponding graded (supersymmetric) boundary quantum inverse scattering method (QISM) is formulated. As an application, integrable open-boundary conditions for the doped spin-1 chain of the supersymmetric t-J model are studied in the framework of the boundary QISM. Diagonal boundary K-matrices are found and four classes of integrable boundary terms are determined. (author)
The classical origin of quantum affine algebra in squashed sigma models
Kawaguchi, Io; Matsumoto, Takuya; Yoshida, Kentaroh
2012-01-01
We consider a quantum affine algebra realized in two-dimensional non-linear sigma models with target space three-dimensional squashed sphere. Its affine generators are explicitly constructed and the Poisson brackets are computed. The defining relations of quantum affine algebra in the sense of the Drinfeld first realization are satisfied at classical level. The relation to the Drinfeld second realization is also discussed including higher conserved charges. Finally we comment on a semiclassic...
On Derivations Of Genetic Algebras
A genetic algebra is a (possibly non-associative) algebra used to model inheritance in genetics. In application of genetics this algebra often has a basis corresponding to genetically different gametes, and the structure constant of the algebra encode the probabilities of producing offspring of various types. In this paper, we find the connection between the genetic algebras and evolution algebras. Moreover, we prove the existence of nontrivial derivations of genetic algebras in dimension two
Symmetric structure of field algebra of G-spin models determined by a normal subgroup
Let G be a finite group and H a normal subgroup. D(H; G) is the crossed product of C(H) and CG which is only a subalgebra of D(G), the double algebra of G. One can construct a C*-subalgebra FH of the field algebra F of G-spin models, so that FH is a D(H; G)-module algebra, whereas F is not. Then the observable algebra A(H,G) is obtained as the D(H; G)-invariant subalgebra of FH, and there exists a unique C*-representation of D(H; G) such that D(H; G) and A(H,G) are commutants with each other
An algebraic self-training algorithm for multi-channel system identification
Ding, Z. [Auburn Univ., AL (United States); Kennedy, R.A. [Australian National Univ., Canberra (Australia)
1994-12-31
In this paper we study the problem of identifying single input-multiple output (SIMO) linear systems that are common in digital communication and control systems. We present an adaptive algorithm for the identification of single input-multiple output linear system. The algorithm is based on a mild co-prime condition and can be implemented as a recursive least square algorithm that has shown quick convergence in simulations. This system identification method can find important applications in digital communications, wideband antenna array processing, and noise control systems.
An algebraic stress model analysis of fully developed turbulent flow in a square duct
A numerical experiment has been carried out on a fully developed turbulent flow in a square duct. Special attention is given to clarify the effectiveness of the algebraic stress models treated by Launder-Reece-Rodi (LRR) and Gibson-Launder (GL) in explaining the secondary flow of the second kind. The results favor the LRR model over the GL model in comparison with the experiment. The computational time for an algebraic stress model is not much greater than that of the kε model. (author)
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...
Galois Correspondence in Field Algebra of G-spin Model
蒋立宁; 郭懋正
2003-01-01
@@ A C*-system is a pair (B, G) consisting of a unital C*-algebra B and a continuous group homomorphism α: G → Aut(B) where G is a compact group and Aut(B) the group of automor-phisms of B. If K is a normal subgroup of G and BK = {B∈ B: k(B) = B, k ∈ K}, then BK is a G-invariant C*-subalgebra of B. On the other hand, if A is a G-invariant C*-algebra with BG A B, set G (A) = {g ∈ G: g(A) = A, A ∈ A}, G (A) is a normal subgroup of G. Clearly K G(BK) and we call K Galois closed ifK = G(BK). Similarly, A BG(A) and we call A Galois closed if A = BG(A).
Dual algebraic structures for the two-level pairing model
Duality relations are explicitly established relating the Hamiltonians and basis classification schemes associated with the number-conserving unitary and number-nonconserving quasispin algebras for the two-level system with pairing interactions. These relations are obtained in a unified formulation for both bosonic and fermionic systems, with arbitrary and, in general, unequal degeneracies for the two levels. Illustrative calculations are carried out comparing the bosonic and fermionic quantum phase transitions.
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.
Performance analysis of a decoding algorithm for algebraic-geometry codes
Høholdt, Tom; Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund
1999-01-01
that in the typical case, where the error points are "independent," one can prove that the algorithm always fails, that is gives a wrong or no answer, except for high rates where it does much better than expected. This explains the simulation results presented by O'Sullivan at the 1997 ISIT, We also...
Universal Algebras of Hurwitz Numbers
A. Mironov; Morozov, A; Natanzon, S.
2009-01-01
Infinite-dimensional universal Cardy-Frobenius algebra is constructed, which unifies all particular algebras of closed and open Hurwitz numbers and is closely related to the algebra of differential operators, familiar from the theory of Generalized Kontsevich Model.
AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S
Klumpp, A. R.
1994-01-01
This package extends the Ada programming language to include linear algebra capabilities similar to those of the HAL/S programming language. The package is designed for avionics applications such as Space Station flight software. In addition to the HAL/S built-in functions, the package incorporates the quaternion functions used in the Shuttle and Galileo projects, and routines from LINPAK that solve systems of equations involving general square matrices. Language conventions in this package follow those of HAL/S to the maximum extent practical and minimize the effort required for writing new avionics software and translating existent software into Ada. Valid numeric types in this package include scalar, vector, matrix, and quaternion declarations. (Quaternions are fourcomponent vectors used in representing motion between two coordinate frames). Single precision and double precision floating point arithmetic is available in addition to the standard double precision integer manipulation. Infix operators are used instead of function calls to define dot products, cross products, quaternion products, and mixed scalar-vector, scalar-matrix, and vector-matrix products. The package contains two generic programs: one for floating point, and one for integer. The actual component type is passed as a formal parameter to the generic linear algebra package. The procedures for solving systems of linear equations defined by general matrices include GEFA, GECO, GESL, and GIDI. The HAL/S functions include ABVAL, UNIT, TRACE, DET, INVERSE, TRANSPOSE, GET, PUT, FETCH, PLACE, and IDENTITY. This package is written in Ada (Version 1.2) for batch execution and is machine independent. The linear algebra software depends on nothing outside the Ada language except for a call to a square root function for floating point scalars (such as SQRT in the DEC VAX MATHLIB library). This program was developed in 1989, and is a copyrighted work with all copyright vested in NASA.
Max-plus algebra models of queueing networks
Krivulin, Nikolai K.
2012-01-01
A class of queueing networks which may have an arbitrary topology, and consist of single-server fork-join nodes with both infinite and finite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form determined by a state transition matrix. It is shown how the matrices inherent in particular ne...
The Algebraic Cluster Model: Structure of 16O
Bijker, R
2016-01-01
We discuss an algebraic treatment of four-body clusters which includes both continuous and discrete symmetries. In particular, tetrahedral configurations with T(d) symmetry are analyzed with respect to the energy spectrum, transition form factors and B(EL) values. It is concluded that the low-lying spectrum of 16O can be described by four alpha-particles at the vertices of a regular tetrahedron, not as a rigid structure but rather a more floppy structure with relatively large rotation-vibration interactions and Coriolis forces.
Mathematical modelling in engineering: A proposal to introduce linear algebra concepts
Andrea Dorila Cárcamo
2016-03-01
Full Text Available The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasize the development of mathematical abilities primarily associated with modelling and interpreting, which aren´t limited only to calculus abilities. Considering this, an instructional design was elaborated based on mathematic modelling and emerging heuristic models for the construction of specific linear algebra concepts: span and spanning set. This was applied to first year engineering students. Results suggest that this type of instructional design contributes to the construction of these mathematical concepts and can also favour first year engineering students understanding of key linear algebra concepts and potentiate the development of higher order skills.
Hopf Algebra Structure of a Model Quantum Field Theory
Solomon, A I; Blasiak, P; Horzela, A; Penson, K A
2006-01-01
Recent elegant work on the structure of Perturbative Quantum Field Theory (PQFT) has revealed an astonishing interplay between analysis(Riemann Zeta functions), topology (Knot theory), combinatorial graph theory (Feynman Diagrams) and algebra (Hopf structure). The difficulty inherent in the complexities of a fully-fledged field theory such as PQFT means that the essential beauty of the relationships between these areas can be somewhat obscured. Our intention is to display some, although not all, of these structures in the context of a simple zero-dimensional field theory; i.e. a quantum theory of non-commuting operators which do not depend on spacetime. The combinatorial properties of these boson creation and annihilation operators, which is our chosen example, may be described by graphs, analogous to the Feynman diagrams of PQFT, which we show possess a Hopf algebra structure. Our approach is based on the partition function for a boson gas. In a subsequent note in these Proceedings we sketch the relationship...
On the 2D zero modes' algebra of the SU(n) WZNW model
Hadjiivanov, Ludmil
2014-01-01
A quantum group covariant extension of the chiral parts of the Wess-Zumino-Novikov-Witten model on a compact Lie group G gives rise to two matrix algebras with non-commutative entries. These are generated by "chiral zero modes" which combine in the 2D model into "Q-operators" which encode information about the internal symmetry and the fusion ring. We review earlier results about the SU(n) WZNW Q-algebra and its Fock representation for n=2 and display the first steps towards their generalization to higher n.
U(2) algebraic model applied to stretching vibrational spectra of tetrahedral molecules
Hou, X W; Hou, Xi-Wen; Ma, Zhong-Qi
1998-01-01
The highly excited stretching vibrational energy levels and the intensities of infrared transitions in tetrahedral molecules are studied in a U(2) algebraic model. Its applications to silane and silicon tetrafluoride are presented with smaller standard deviations than those of other models.
The Model Method: Singapore Children's Tool for Representing and Solving Algebraic Word Problems
Ng, Swee Fong; Lee, Kerry
2009-01-01
Solving arithmetic and algebraic word problems is a key component of the Singapore elementary mathematics curriculum. One heuristic taught, the model method, involves drawing a diagram to represent key information in the problem. We describe the model method and a three-phase theoretical framework supporting its use. We conducted 2 studies to…
Construction of the Model of the Lambda Calculus System with Algebraic Operators
陆汝占; 张政; 等
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.
Permutation invariant algebras, a Fock space realization and the Calogero model
We study permutation invariant oscillator algebras and their Fock space representations using three equivalent techniques, i.e. (i) a normally ordered expansion in creation and annihilation operators, (ii) the action of annihilation operators on monomial states in Fock space and (iii) Gram matrices of inner products in Fock space. We separately discuss permutation invariant algebras which possess hermitean number operators and permutation invariant algebras which possess non-hermitean number operators. The results of a general analysis are applied to the SM-extended Heisenberg algebra, underlying the M-body Calogero model. Particular attention is devoted to the analysis of Gram matrices for the Calogero model. We discuss their structure, eigenvalues and eigenstates. We obtain a general condition for positivity of eigenvalues, meaning that all norms of states in Fock space are positive if this condition is satisfied. We find a universal critical point at which the reduction of the physical degrees of freedom occurs. We construct dual operators, leading to the ordinary Heisenberg algebra of free Bose oscillators. From the Fock-space point of view, we briefly discuss the existence of a mapping from the Calogero oscillators to the free Bose oscillators and vice versa. (orig.)
Algebraic formulation of duality
Two dimensional lattice spin (chiral) models over (possibly non-abelian) compact groups are formulated in terms of a generalized Pauli algebra. Such models over cyclic groups are written in terms of the generalized Clifford algebra. An automorphism of this algebra is shown to exist and to lead to the duality transformation
Non-freely generated W-algebras and construction of N=2 super W-algebras
Firstly, we investigate the origin of the bosonic W-algebras W(2, 3, 4, 5), W(2, 4, 6) and W(2, 4, 6) found earlier by direct construction. We present a coset construction for all three examples leading to a new type of finitely, non-freely generated quantum W-algebras, which we call unifying W-algebras. Secondly, we develop a manifest covariant formalism to construct N = 2 super W-algebras explicitly on a computer. Applying this algorithm enables us to construct the first four examples of N = 2 super W-algebras with two generators and the N = 2 super W4 algebra involving three generators. The representation theory of the former ones shows that all examples could be divided into four classes, the largest one containing the N = 2 special type of spectral flow algebras. Besides the W-algebra of the CP(3) Kazama-Suzuki coset model, the latter example with three generators discloses a second solution which could also be explained as a unifying W-algebra for the CP(n) models. (orig.)
Graded Poisson-Sigma models and dilaton-deformed 2D supergravity algebra
Supergravity extensions of generic 2d gravity theories obtained from the graded Poisson-Sigma model (gPSM) approach show a large degree of ambiguity. On the other hand, obstructions may reduce the allowed range of fields as given by the bosonic theory, or even prohibit any extension in certain cases. In our present work we relate the finite W-algebras inherent in the gPSM algebra of constraints to supergravity algebras (Neuveu-Schwarz or Ramond algebras resp.), deformed by the presence of the dilaton field. With very straightforward and natural assumptions on them - like the one linking the anti-commutator of certain fermionic charges to the Hamiltonian constraint without deformation - we are able not only to remove the ambiguities but, at the same time, the singularities referred to above. Thus all especially interesting bosonic models (spherically reduced gravity, the Jackiw-Teitelboim model etc.) under these conditions possess a unique fermionic extension and are free from new singularities. The superspace supergravity model of Howe is found as a special case of this supergravity action. For this class of models the relation between bosonic potential and prepotential does not introduce obstructions as well. (author)
A stochastic extension of the explicit algebraic subgrid-scale models
The explicit algebraic subgrid-scale (SGS) stress model (EASM) of Marstorp et al. [“Explicit algebraic subgrid stress models with application to rotating channel flow,” J. Fluid Mech. 639, 403–432 (2009)] and explicit algebraic SGS scalar flux model (EASFM) of Rasam et al. [“An explicit algebraic model for the subgrid-scale passive scalar flux,” J. Fluid Mech. 721, 541–577 (2013)] are extended with stochastic terms based on the Langevin equation formalism for the subgrid-scales by Marstorp et al. [“A stochastic subgrid model with application to turbulent flow and scalar mixing,” Phys. Fluids 19, 035107 (2007)]. The EASM and EASFM are nonlinear mixed and tensor eddy-diffusivity models, which improve large eddy simulation (LES) predictions of the mean flow, Reynolds stresses, and scalar fluxes of wall-bounded flows compared to isotropic eddy-viscosity and eddy-diffusivity SGS models, especially at coarse resolutions. The purpose of the stochastic extension of the explicit algebraic SGS models is to further improve the characteristics of the kinetic energy and scalar variance SGS dissipation, which are key quantities that govern the small-scale mixing and dispersion dynamics. LES of turbulent channel flow with passive scalar transport shows that the stochastic terms enhance SGS dissipation statistics such as length scale, variance, and probability density functions and introduce a significant amount of backscatter of energy from the subgrid to the resolved scales without causing numerical stability problems. The improvements in the SGS dissipation predictions in turn enhances the predicted resolved statistics such as the mean scalar, scalar fluxes, Reynolds stresses, and correlation lengths. Moreover, the nonalignment between the SGS stress and resolved strain-rate tensors predicted by the EASM with stochastic extension is in much closer agreement with direct numerical simulation data
Application of non-commutative algebra to a soluble fermionic model
We explore the properties of the non-commutative Grassmann algebra to obtain the high-temperature expansion of the grand canonical partition function for self-interacting fermionic systems. As an application, we consider the anharmonic fermionic oscillator, the simplest model in Quantum Mechanics with self-interacting fermions that is exactly soluble. The knowledge of the exact expression for its grand canonical partition function enables us to check the β-expansion obtained using our Grassmann-algebra-based technique. (Copyright (c) 1999 Elsevier Science B.V., Amsterdam. All rights reserved.)
Left Artinian Algebraic Algebras
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.
Algebraic Bethe ansatz for the gl(1|2) generalized model: II. the three gradings
The algebraic Bethe ansatz can be performed rather abstractly for whole classes of models sharing the same R-matrix, the only prerequisite being the existence of an appropriate pseudo vacuum state. Here we perform the algebraic Bethe ansatz for all models with 9 x 9, rational, gl(1|2) invariant R-matrix and all three possibilities of choosing the grading. Our Bethe ansatz solution applies, for instance, to the supersymmetric t-J model, the supersymmetric U model and a number of interesting impurity models. It may be extended to obtain the quantum transfer matrix spectrum for this class of models. The properties of a specific model enter the Bethe ansatz solution (i.e. the expression for the transfer matrix eigenvalue and the Bethe ansatz equations) through the three pseudo vacuum eigenvalues of the diagonal elements of the monodromy matrix which in this context are called the parameters of the model
CSOS models descending from chiral Potts models: degeneracy of the eigenspace and loop algebra
Au-Yang, Helen; Perk, Jacques H. H.
2016-04-01
Monodromy matrices of the {{\\boldsymbol{τ }}}2\\phantom{^{\\prime }} model are known to satisfy a Yang-Baxter equation with a six-vertex R-matrix as the intertwiner. The commutation relations of the elements of the monodromy matrices are completely determined by this R-matrix. We show the reason why in the superintegrable case the eigenspace is degenerate, but not in the general case. We then show that the eigenspaces of special CSOS models descending from the chiral Potts model are also degenerate. The existence of an L({{sl}}2) quantum loop algebra (or subalgebra) in these models is established by showing that the Serre relations hold for the generators. The highest weight polynomial (or the Drinfeld polynomial) of the representation is obtained by using the method of Baxter for the superintegrable case. As a byproduct, the eigenvalues of all such CSOS models are given explicitly.
Construction of linear models: A framework based on commutative Jordan algebras
Covas, R.; Carvalho, F.
2016-06-01
We show how to obtain the necessary structures for statistical analysis of the folllowing orthogonal models Y˜(1 μ +∑i Xiβi ,∑j σj2Mj+σ2I ) . These structures rely on the existence of Jordan algebras, in the sequence of [24], [8], [12], [9], [5] and [10].
Shape Optimization for Navier-Stokes Equations with Algebraic Turbulence Model: Existence Analysis
Bulíček, M.; Haslinger, J.; Málek, J.; Stebel, Jan
2009-01-01
Roč. 60, č. 2 (2009), s. 185-212. ISSN 0095-4616 R&D Projects: GA MŠk LC06052 Institutional research plan: CEZ:AV0Z10190503 Keywords : optimal shape design * paper machine headbox * incompressible non-Newtonian fluid * algebraic turbulence model * outflow boundary condition Subject RIV: BA - General Mathematics Impact factor: 0.757, year: 2009
Algebraic Bethe ansatz for 19-vertex models with upper triangular K-matrices
By means of an algebraic Bethe ansatz approach, we study the Zamolodchikov–Fateev and Izergin–Korepin vertex models with non-diagonal boundaries, characterized by reflection matrices with an upper triangular form. Generalized Bethe vectors are used to diagonalize the associated transfer matrix. The eigenvalues as well as the Bethe equations are presented. (paper)
Algebraic Bethe ansatz for scalar products in SU(3)-invariant integrable models
Belliard, S; Ragoucy, E; Slavnov, N A
2012-01-01
We study SU(3)-invariant integrable models solvable by nested algebraic Bethe ansatz. We obtain a determinant representation for particular case of scalar products of Bethe vectors. This representation can be used for the calculation of form factors and correlation functions of XXX SU(3)-invariant Heisenberg chain.
Algebraic Bethe Ansatz for O(2N) sigma models with integrable diagonal boundaries
Gombor, Tamas
2015-01-01
The finite volume problem of O(2N) sigma models with integrable diagonal boundaries on a finite interval is investigated. The double row transfer matrix is diagonalized by Algebraic Bethe Ansatz. The boundary Bethe Yang equations for the particle rapidities and the accompanying Bethe Ansatz equations are derived.
Mathematical Modelling in Engineering: An Alternative Way to Teach Linear Algebra
Domínguez-García, S.; García-Planas, M. I.; Taberna, J.
2016-01-01
Technological advances require that basic science courses for engineering, including Linear Algebra, emphasize the development of mathematical strengths associated with modelling and interpretation of results, which are not limited only to calculus abilities. Based on this consideration, we have proposed a project-based learning, giving a dynamic…
Cleaveland, Rance; Luettgen, Gerald; Natarajan, V.
1999-01-01
This paper surveys the semantic ramifications of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. These enriched formalisms allow one to model system features such as interrupts, prioritized choice, or real-time behavior. Approaches to priority in process algebras can be classified according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global pre-emption and static priorities and led to formalisms for modeling interrupts and aspects of real-time, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of pre-emption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the efficient encoding of real-time semantics. Technically, this paper studies the different models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local pre- emption. In each case the operational semantics of CCS is modified appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for different process-algebraic settings are discussed.
Forward error correction based on algebraic-geometric theory
A Alzubi, Jafar; M Chen, Thomas
2014-01-01
This book covers the design, construction, and implementation of algebraic-geometric codes from Hermitian curves. Matlab simulations of algebraic-geometric codes and Reed-Solomon codes compare their bit error rate using different modulation schemes over additive white Gaussian noise channel model. Simulation results of Algebraic-geometric codes bit error rate performance using quadrature amplitude modulation (16QAM and 64QAM) are presented for the first time and shown to outperform Reed-Solomon codes at various code rates and channel models. The book proposes algebraic-geometric block turbo codes. It also presents simulation results that show an improved bit error rate performance at the cost of high system complexity due to using algebraic-geometric codes and Chase-Pyndiah’s algorithm simultaneously. The book proposes algebraic-geometric irregular block turbo codes (AG-IBTC) to reduce system complexity. Simulation results for AG-IBTCs are presented for the first time.
Reduced Chern-Simons Quiver Theories and Cohomological 3-Algebra Models
DeBellis, Joshua
2013-01-01
We study the BPS spectrum and vacuum moduli spaces in dimensional reductions of Chern-Simons-matter theories with N>=2 supersymmetry to zero dimensions. Our main example is a matrix model version of the ABJM theory which we relate explicitly to certain reduced 3-algebra models. We find the explicit maps from Chern-Simons quiver matrix models to dual IKKT matrix models. We address the problem of topologically twisting the ABJM matrix model, and along the way construct a new twist of the IKKT model. We construct a cohomological matrix model whose partition function localizes onto a moduli space specified by 3-algebra relations which live in the double of the conifold quiver. It computes an equivariant index enumerating framed BPS states with specified R-charges which can be expressed as a combinatorial sum over certain filtered pyramid partitions.
Kink states in P(φ)2-models. (An algebraic approach)
Several two-dimensional quantum field theory models have more than one vacuum state. Familiar examples are the Sine-Gordon and the φ24-model. It is known that in these models there are also states, called kink states, which interpolate different vacua. A general construction scheme for kink states in the framework of algebraic quantum field theory is developed in a previous paper. However, for the application of this method, the crucial condition is the split property for wedge algebras in the vacuum representations of the considered models. It is believed that the vacuum representations of P(φ)2-models fulfill this condition, but a rigorous proof is only known for the massive free scalar field. Therefore, we investigate in a construction of kink states which can directly be applied to P(φ)2-model, by making use of the properties of the dynamic of a P(φ)2-model. (orig.)
Evaluation of global synchronization for iterative algebra algorithms on many-core
ul Hasan Khan, Ayaz
2015-06-01
© 2015 IEEE. Massively parallel computing is applied extensively in various scientific and engineering domains. With the growing interest in many-core architectures and due to the lack of explicit support for inter-block synchronization specifically in GPUs, synchronization becomes necessary to minimize inter-block communication time. In this paper, we have proposed two new inter-block synchronization techniques: 1) Relaxed Synchronization, and 2) Block-Query Synchronization. These schemes are used in implementing numerical iterative solvers where computation/communication overlapping is one used optimization to enhance application performance. We have evaluated and analyzed the performance of the proposed synchronization techniques using Jacobi Iterative Solver in comparison to the state of the art inter-block lock-free synchronization techniques. We have achieved about 1-8% performance improvement in terms of execution time over lock-free synchronization depending on the problem size and the number of thread blocks. We have also evaluated the proposed algorithm on GPU and MIC architectures and obtained about 8-26% performance improvement over the barrier synchronization available in OpenMP programming environment depending on the problem size and number of cores used.
Modeling and Engineering Algorithms for Mobile Data
Blunck, Henrik; Hinrichs, Klaus; Sondern, Joëlle; Vahrenhold, Jan
In this paper, we present an object-oriented approach to modeling mobile data and algorithms operating on such data. Our model is general enough to capture any kind of continuous motion while at the same time allowing for encompassing algorithms optimized for specific types of motion. Such motion...
We construct a special type of quantum soliton solutions for quantized affine Toda models. The elements of the principal Heisenberg subalgebra in the affinised quantum Lie algebra are found. Their eigenoperators inside the quantized universal enveloping algebra for an affine Lie algebra are constructed to generate quantum soliton solutions
Khovanova, Tanya
2008-01-01
I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss other related sets of graphs. This construction can be used to build models of representations of simply-laced compact Lie groups.
Combinatorics of solvable lattice models, and modular representations of Hecke algebras
Foda, O E; Okado, M; Thibon, J Y; Welsh, Trevor A; Foda, Omar; Leclerc, Bernard; Okado, Masato; Thibon, Jean-Yves; Welsh, Trevor A.
1997-01-01
We review and motivate recently-observed relationships between exactly solvable lattice models and modular representations of Hecke algebras. Firstly, we describe how the set of $n$-regular partitions label both of the following classes of objects: 1. The spectrum of unrestricted solid-on-solid lattice models based on level-1 representations of the affine algebras $\\sl_n$, 2. The irreducible representations of type-A Hecke algebras at roots of unity: $H_m(\\sqrt[n]{1})$. Secondly, we show that a certain subset of the $n$-regular partitions label both of the following classes of objects: 1. The spectrum of restricted solid-on-solid lattice models based on cosets of affine algebras $(sl(n)^_1 \\times sl(n)^_1)/ sl(n)^_2$. 2. Jantzen-Seitz (JS) representations of $H_m(\\sqrt[n]{1})$: irreducible representations that remain irreducible under restriction to $H_{m-1}(\\sqrt[n]{1})$. Using the above relationships, we characterise the JS representations of $H_m(\\sqrt[n]{1})$ and show that the generating series that count...
Deskins, W E
1996-01-01
This excellent textbook provides undergraduates with an accessible introduction to the basic concepts of abstract algebra and to the analysis of abstract algebraic systems. These systems, which consist of sets of elements, operations, and relations among the elements, and prescriptive axioms, are abstractions and generalizations of various models which evolved from efforts to explain or discuss physical phenomena.In Chapter 1, the author discusses the essential ingredients of a mathematical system, and in the next four chapters covers the basic number systems, decompositions of integers, diop
Development of an explicit algebraic turbulence model for buoyant flows – Part 1: DNS analysis
Highlights: • DNS analysis of channel flow for forced, mixed and natural convection regime. • Examination of algebraic turbulenc model main features with buoyancy. • Investigation of the weak equilibrium assumption for buoyant flows. • Assessment of the redistribution term model for EARSM with buoyancy effect. • Assessment of the pressure scrambling term model for EAHFM. -- Abstract: An analysis of DNS databases of vertical plane channel flow for forced, mixed and natural convection is proposed. This analysis aims to assess the main features needed to develop an algebraic model for buoyant flows. First, the weak equilibrium assumption, at the root of algebraic models, is investigated. This hypothesis is shown to fail near the velocity maximum and close to the walls but remains valid otherwise, whatever the convection regime. The models for the redistribution term and the pressure scrambling term are then analyzed on the same configurations. A linear form of the Speziale et al. (1991) model is retained for the redistribution term. No model for the pressure scrambling term is fully satisfactory; nevertheless some models are recommended. The buoyant contributions to the pressure term are investigated. Finally, the generalized gradient diffusion hypothesis, which could be used to model the turbulent heat fluxes in order to avoid the coupling with the Reynolds stresses, is shown to be inaccurate
A new class of Matrix Models arising from the W-infinity Algebra
Herce, Henry D.; Zemba, Guillermo R.
2002-01-01
We present a new class of hermitian one-matrix models originated in the W-infinity algebra: more precisely, the polynomials defining the W-infinity generators in their fermionic bilinear form are shown to expand the orthogonal basis of a class of random hermitian matrix models. The corresponding potentials are given, and the thermodynamic limit interpreted in terms of a simple plasma picture. The new matrix models can be successfully applied to the full bosonization of interesting one-dimensi...
Optical systolic solutions of linear algebraic equations
Neuman, C. P.; Casasent, D.
1984-01-01
The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.
Lopez, Cesar
2014-01-01
MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Linear Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. In addition to giving an introduction to
Position Automata for Kleene Algebra with Tests
A. Silva
2012-01-01
Full Text Available Kleene algebra with tests (KAT is an equational system that combines Kleene and Boolean algebras. One can model basic programming constructs and assertions in KAT, which allowed for its application in compiler optimization, program transformation and dataflow analysis. To provide semantics for KAT expressions, Kozen first introduced emph{automata on guarded strings}, showing that the regular sets of guarded strings plays the same role in KAT as regular languages play in Kleene algebra. Recently, Kozen described an elegant algorithm, based on ``derivatives'', to construct a deterministic automaton that accepts the guarded strings denoted by a KAT expression. This algorithm generalizes Brzozowski's algorithm for regular expressions and inherits its inefficiency arising from the explicit computation of derivatives. In the context of classical regular expressions, many efficient algorithms to compile expressions to automata have been proposed. One of those algorithms was devised by Berry and Sethi in the 80's (we shall refer to it as Berry-Sethi construction/algorithm, but in the literature it is also referred to as position or Glushkov automata algorithm. In this paper, we show how the Berry-Sethi algorithm can be used to compile a $KAT$ expression to an automaton on guarded strings. Moreover, we propose a new automata model for KAT expressions and adapt the construction of Berry and Sethi to this new model.
Algebraic approach to electro-optic modulation of light: Exactly solvable multimode quantum model
Miroshnichenko, George P; Trifanov, Alexander I; Gleim, Artur V
2016-01-01
We theoretically study electro-optic light modulation based on the quantum model where the linear electro-optic effect and the externally applied microwave field result in the interaction between optical cavity modes. The model assumes that the number of interacting modes is finite and effects of the mode overlapping coefficient on the strength of the intermode interaction can be taken into account through dependence of the coupling coefficient on the mode characteristics. We show that, under certain conditions, the model is exactly solvable and, in the semiclassical approximation where the microwave field is treated as a classical mode, can be analyzed using the technique of the Jordan mappings for the su(2) Lie algebra. Analytical results are applied to study effects of light modulation on the frequency dependence of the photon counting rate. We also establish the conditions of validity of the semiclassical approximation by applying the methods of polynomially deformed Lie algebras for analysis of the model...
Kroupa, Tomáš
Providence, Rhode Island : American Mathematical Society, 2012 - (Reich, S.; Zaslavski, A.), s. 139-158 ISBN 978-0-8218-6908-6. - (Contemporary Mathematics. 568) R&D Projects: GA MŠk 1M0572; GA ČR GA201/09/1957; GA ČR GA201/09/1891 Institutional research plan: CEZ:AV0Z10750506 Institutional support: RVO:67985556 Keywords : coalition game * MV-algebra * Moebius transform Subject RIV: BA - General Mathematics http://library.utia.cas.cz/separaty/2012/MTR/kroupa - a generalized moebius transform of game s on mv-algebras and its application to a cimmino-type algorithm for the core.pdf
Composing Scalable Nonlinear Algebraic Solvers
Brune, Peter R.; Knepley, Matthew G.; Smith, Barry F.; Tu, Xuemin
2016-01-01
Most efficient linear solvers use composable algorithmic components, with the most common model being the combination of a Krylov accelerator and one or more preconditioners. A similar set of concepts may be used for nonlinear algebraic systems, where nonlinear composition of different nonlinear solvers may significantly improve the time to solution. We describe the basic concepts of nonlinear composition and preconditioning and present a number of solvers applicable to nonlinear partial diff...
An algebraic stress/flux model for two-phase turbulent flow
An algebraic stress model (ASM) for turbulent Reynolds stress and a flux model for turbulent heat flux are proposed for two-phase bubbly and slug flows. These mathematical models are derived from the two-phase transport equations for Reynolds stress and turbulent heat flux, and provide Cμ, a turbulent constant which defines the level of eddy viscosity, as a function of the interfacial terms. These models also include the effect of heat transfer. When the interfacial drag terms and the interfacial momentum transfer terms are absent, the model reduces to a single-phase model used in the literature
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.
Lefschetz, Solomon
2012-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.
Surfaces immersed in su(N+1) Lie algebras obtained from the CPN sigma models
We study some geometrical aspects of two-dimensional orientable surfaces arising from the study of CPN sigma models. To this aim we employ an identification of RN(N+2) with the Lie algebra su(N+1) by means of which we construct a generalized Weierstrass formula for immersion of such surfaces. The structural elements of the surface like its moving frame, the Gauss-Weingarten and the Gauss-Codazzi-Ricci equations are expressed in terms of the solution of the CPN model defining it. Further, the first and second fundamental forms, the Gaussian curvature, the mean curvature vector, the Willmore functional and the topological charge of surfaces are expressed in terms of this solution. We present detailed implementation of these results for surfaces immersed in su(2) and su(3) Lie algebras
Recent developments and applications of an algebraic version of Bohr's collective model, known as the algebraic collective model (ACM), have shown that fully converged calculations can be performed for a large range of Hamiltonians. Examining the algebraic structure underlying the Bohr model (BM) has also clarified its relationship with the interacting boson model (IBM), with which it has related solvable limits and corresponding dynamical symmetries. In particular, the algebraic structure of the IBM is obtained as a compactification of the BM and conversely the BM is regained in various contraction limits of the IBM. In a previous paper, corresponding contractions were identified and confirmed numerically for axially-symmetric states of relatively small deformation. In this paper, we extend the comparisons to realistic deformations and compare results of the two models in the rotor-vibrator limit. These models describe rotations and vibrations about an axially symmetric prolate or oblate rotor, and rotations and vibrations of a triaxial rotor. It is determined that most of the standard results of the BM can be obtained as contraction limits of the IBM in its U(5)-SO(6) dynamical symmetries.
Haslinger, J.; Stebel, Jan
2011-01-01
Roč. 63, č. 2 (2011), s. 277-308. ISSN 0095-4616 R&D Projects: GA MŠk LC06052 Institutional research plan: CEZ:AV0Z10190503 Keywords : optimal shape design * paper machine headbox * incompressible non-Newtonian fluid * algebraic turbulence model Subject RIV: BA - General Mathematics Impact factor: 0.952, year: 2011 http://link.springer.com/article/10.1007%2Fs00245-010-9121-x
Another algebraic variational principle for the spectral curve of matrix models
Eynard, B
2014-01-01
We propose an alternative variational principle whose critical point is the algebraic plane curve associated to a matrix model (the spectral curve, i.e. the large $N$ limit of the resolvent). More generally, we consider a variational principle that is equivalent to the problem of finding a plane curve with given asymptotics and given cycle integrals. This variational principle is not given by extremization of the energy, but by the extremization of an "entropy".
Mohammad Shahzad
2016-01-01
This study deals with the control of chaotic dynamics of tumor cells, healthy host cells, and effector immune cells in a chaotic Three Dimensional Cancer Model (TDCM) by State Space Exact Linearization (SSEL) technique based on Lie algebra. A non-linear feedback control law is designed which induces a coordinate transformation thereby changing the original chaotic TDCM system into a controlled one linear system. Numerical simulation has been carried using Mathematica that witness the robustne...
RSOS models and Jantzen-Seitz representations of Hecke algebras at roots of unity
Foda, Omar; Leclerc, Bernard; Okado, Masato; Thibon, Jean-Yves; Welsh, Trevor A.
1997-01-01
A special family of partitions occurs in two apparently unrelated contexts: the evaluation of 1-dimensional configuration sums of certain RSOS models, and the modular representation theory of symmetric groups or their Hecke algebras $H_m$. We provide an explanation of this coincidence by showing how the irreducible $H_m$-modules which remain irreducible under restriction to $H_{m-1}$ (Jantzen-Seitz modules) can be determined from the decomposition of a tensor product of representations of aff...
Algebraic and relational models for a system based on a poset of two elements
Iturrioz, Luisa
2014-01-01
The aim of this paper is to present a very simple set of conditions, necessary for the management of knowledge of a poset $T$ of two agents, which are partially ordered by the capabilities available in the system. We build up a formal system and we elaborate suitable semantic models in order to derive information from the poset. The system is related to three-valued Heyting algebras with Boolean operators.
On the algebraic structure of self-dual gauge fields and sigma models
An extensive and detailed analysis of self-dual Gauge Fields, in particular with axial symmetry, is presented, culminating in a purely algebraic procedure to generate solutions. The method which is particularly suited for the construction of multimonopole solutions for a theory with arbitrary G, is also applicable to a wide class of nonlinear sigma models. The relevant symmetries as well as the associated linear problems which underly the exact solubility of the problem, are constructed and discussed in detail. (author)
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...
Svetoslav Markov
2005-01-01
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.
Vibrational spectrum of CF4 isotopes in an algebraic model
Joydeep Choudhury; Srinivasa Rao Karumuri; Nirmal Kumar Sarkar; Ramendu Bhattacharjee
2009-11-01
n this paper the stretching vibrational modes of CF4 isotopes are calculated up to first overtone using the one-dimensional vibron model for the first time. The model Hamiltonian so constructed seems to describe the C–F stretching modes accurately using a relatively small set of well-defined parameters.
Meadow enriched ACP process algebras
J.A. Bergstra; Middelburg, C.A.
2009-01-01
We introduce the notion of an ACP process algebra. The models of the axiom system ACP are the origin of this notion. ACP process algebras have to do with processes in which no data are involved. We also introduce the notion of a meadow enriched ACP process algebra, which is a simple generalization of the notion of an ACP process algebra to processes in which data are involved. In meadow enriched ACP process algebras, the mathematical structure for data is a meadow.
Bus Network Modeling Using Ant Algorithms
Sepideh Eshragh
2010-02-01
Full Text Available Bus transit network modeling is a complex and combinatorial problem. The main purpose of this paper is to apply a contemporary method for designing a bus transit network with the objective of achieving optimum results. The method is called Ant Algorithms, a Meta Heuristic method, which has been applied to optimization problems in transportation with noticeable success. The description of the algorithm, as well as the main methodology and computations, is presented in this paper. Furthermore, a case study using Ant Algorithms applied to the city of Ghazvin, one of the most important suburbs of Tehran, Iran, is presented.
Adaptive Genetic Algorithm Model for Intrusion Detection
K. S. Anil Kumar
2012-09-01
Full Text Available Intrusion detection systems are intelligent systems designed to identify and prevent the misuse of computer networks and systems. Various approaches to Intrusion Detection are currently being used, but they are relatively ineffective. Thus the emerging network security systems need be part of the life system and this ispossible only by embedding knowledge into the network. The Adaptive Genetic Algorithm Model - IDS comprising of K-Means clustering Algorithm, Genetic Algorithm and Neural Network techniques. Thetechnique is tested using multitude of background knowledge sets in DARPA network traffic datasets.
A deformation of quantum affine algebra in squashed Wess-Zumino-Novikov-Witten models
We proceed to study infinite-dimensional symmetries in two-dimensional squashed Wess-Zumino-Novikov-Witten models at the classical level. The target space is given by squashed S3 and the isometry is SU(2)L × U(1)R. It is known that SU(2)L is enhanced to a couple of Yangians. We reveal here that an infinite-dimensional extension of U(1)R is a deformation of quantum affine algebra, where a new deformation parameter is provided with the coefficient of the Wess-Zumino term. Then we consider the relation between the deformed quantum affine algebra and the pair of Yangians from the viewpoint of the left-right duality of monodromy matrices. The integrable structure is also discussed by computing the r/s-matrices that satisfy the extended classical Yang-Baxter equation. Finally, two degenerate limits are discussed
From Clifford Algebra of Nonrelativistic Phase Space to Quarks and Leptons of the Standard Model
Żenczykowski, Piotr
2015-01-01
We review a recently proposed Clifford-algebra approach to elementary particles. We start with: (1) a philosophical background that motivates a maximally symmetric treatment of position and momentum variables, and: (2) an analysis of the minimal conceptual assumptions needed in quark mass extraction procedures. With these points in mind, a variation on Born's reciprocity argument provides us with an unorthodox view on the problem of mass. The idea of space quantization suggests then the linearization of the nonrelativistic quadratic form ${\\bf p}^2 +{\\bf x}^2$ with position and momentum satisfying standard commutation relations. This leads to the 64-dimensional Clifford algebra ${Cl}_{6,0}$ of nonrelativistic phase space within which one identifies the internal quantum numbers of a single Standard Model generation of elementary particles (i.e. weak isospin, hypercharge, and color). The relevant quantum numbers are naturally linked to the symmetries of macroscopic phase space. It is shown that the obtained pha...
Conformal Field Theory, Vertex Operator Algebra and Stochastic Loewner Evolution in Ising Model
Zahabi, Ali
2015-01-01
We review the algebraic and analytic aspects of the conformal field theory (CFT) and its relation to the stochastic Loewner evolution (SLE) in an example of the Ising model. We obtain the scaling limit of the correlation functions of Ising free fermions on an arbitrary simply connected two-dimensional domain $D$. Then, we study the analytic and algebraic aspects of the fermionic CFT on $D$, using the Fock space formalism of fields, and the Clifford vertex operator algebra (VOA). These constructions lead to the conformal field theory of the Fock space fields and the fermionic Fock space of states and their relations in case of the Ising free fermions. Furthermore, we investigate the conformal structure of the fermionic Fock space fields and the Clifford VOA, namely the operator product expansions, correlation functions and differential equations. Finally, by using the Clifford VOA and the fermionic CFT, we investigate a rigorous realization of the CFT/SLE correspondence in the Ising model. First, by studying t...
A new algebraic structure in the standard model of particle physics
Boyle, Latham
2016-01-01
We introduce a new formulation of non-commutative geometry (NCG): we explain its mathematical advantages and its success in capturing the structure of the standard model of particle physics. The idea, in brief, is to represent $A$ (the algebra of differential forms on some possibly-noncommutative space) on $H$ (the Hilbert space of spinors on that space); and to reinterpret this representation as a simple super-algebra $B=A\\oplus H$ with even part $A$ and odd part $H$. $B$ is the fundamental object in our approach: we show that (nearly) all of the basic axioms and assumptions of the traditional ("spectral triple") formulation of NCG are elegantly recovered from the simple requirement that $B$ should be a differential graded $\\ast$-algebra (or "$\\ast$-DGA"). But this requirement also yields other, new, geometrical constraints. When we apply our formalism to the NCG traditionally used to describe the standard model of particle physics, we find that these new constraints are physically meaningful and phenomenolo...
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Diaz, Ricardo Graciani; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-01-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple, the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike con...
Enlarged symmetry algebras of spin chains, loop models, and S-matrices
The symmetry algebras of certain families of quantum spin chains are considered in detail. The simplest examples possess m states per site (m>=2), with nearest-neighbor interactions with U(m) symmetry, under which the sites transform alternately along the chain in the fundamental m and its conjugate representation m-bar. We find that these spin chains, even with arbitrary coefficients of these interactions, have a symmetry algebra Am much larger than U(m), which implies that the energy eigenstates fall into sectors that for open chains (i.e., free boundary conditions) can be labeled by j=0,1,...,L, for the 2L-site chain such that the degeneracies of all eigenvalues in the jth sector are generically the same and increase rapidly with j. For large j, these degeneracies are much larger than those that would be expected from the U(m) symmetry alone. The enlarged symmetry algebra Am(2L) consists of operators that commute in this space of states with the Temperley-Lieb algebra that is generated by the set of nearest-neighbor interaction terms; Am(2L) is not a Yangian. There are similar results for supersymmetric chains with gl(m+n|n) symmetry of nearest-neighbor interactions, and a richer representation structure for closed chains (i.e., periodic boundary conditions). The symmetries also apply to the loop models that can be obtained from the spin chains in a spacetime or transfer matrix picture. In the loop language, the symmetries arise because the loops cannot cross. We further define tensor products of representations (for the open chains) by joining chains end to end. The fusion rules for decomposing the tensor product of representations labeled j1 and j2 take the same form as the Clebsch-Gordan series for SU(2). This and other structures turn the symmetry algebra Am into a ribbon Hopf algebra, and we show that this is 'Morita equivalent' to the quantum group Uq(sl2) for m=q+q-1. The open-chain results are extended to the cases vertical bar m vertical barm or Uq(sl2
Bus Network Modeling Using Ant Algorithms
Sepideh Eshragh; Shahriar Afandizadeh Zargari; Ardeshir Faghri; Earl Rusty Lee
2010-01-01
Bus transit network modeling is a complex and combinatorial problem. The main purpose of this paper is to apply a contemporary method for designing a bus transit network with the objective of achieving optimum results. The method is called Ant Algorithms, a Meta Heuristic method, which has been applied to optimization problems in transportation with noticeable success. The description of the algorithm, as well as the main methodology and computations, is presented in this paper. Furthermore, ...
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
Teaching Algebra and Geometry Concepts by Modeling Telescope Optics
Siegel, Lauren M.; Dickinson, Gail; Hooper, Eric J.; Daniels, Mark
2008-01-01
This article describes preparation and delivery of high school mathematics lessons that integrate mathematics and astronomy through The Geometer's Sketchpad models, traditional proof, and inquiry-based activities. The lessons were created by a University of Texas UTeach preservice teacher as part of a project-based field experience in which high…
Moments, Model Reduction and Nonlinearity in Solving linear Algebraic Problems
Strakoš, Z.; Hnětynková, I.; O'Leary, D.P.; Plešinger, M.; Tichý, Petr
Prague : ICS AS CR, 2012. [Joint French-Czech Workshop on Krylov Methods for Inverse Problem s. 19.07.2012-20.07.2012, Prague] Institutional support: RVO:67985807 Keywords : problem of moments * model reduction * Krylov subspace Subject RIV: BA - General Mathematics
Algebraic nonlinear collective motion
Troupe, J.; Rosensteel, G.
1999-01-01
Finite-dimensional Lie algebras of vector fields determine geometrical collective models in quantum and classical physics. Every set of vector fields on Euclidean space that generates the Lie algebra sl(3, R) and contains the angular momentum algebra so(3) is determined. The subset of divergence-free sl(3, R) vector fields is proven to be indexed by a real number $\\Lambda$. The $\\Lambda=0$ solution is the linear representation that corresponds to the Riemann ellipsoidal model. The nonlinear g...
Lighthouse: A User-Centered Web Service for Linear Algebra Software
Norris, Boyana; Bernstein, Sa-Lin; Nair, Ramya; Jessup, Elizabeth
2014-01-01
Various fields of science and engineering rely on linear algebra for large scale data analysis, modeling and simulation, machine learning, and other applied problems. Linear algebra computations often dominate the execution time of such applications. Meanwhile, experts in these domains typically lack the training or time required to develop efficient, high-performance implementations of linear algebra algorithms. In the Lighthouse project, we enable developers with varied backgrounds to readi...
Model Checking Algorithms for CTMDPs
Buchholz, Peter; Hahn, Ernst Moritz; Hermanns, Holger;
2011-01-01
Continuous Stochastic Logic (CSL) can be interpreted over continuoustime Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategie...
Graphical model construction based on evolutionary algorithms
Youlong YANG; Yan WU; Sanyang LIU
2006-01-01
Using Bayesian networks to model promising solutions from the current population of the evolutionary algorithms can ensure efficiency and intelligence search for the optimum. However, to construct a Bayesian network that fits a given dataset is a NP-hard problem, and it also needs consuming mass computational resources. This paper develops a methodology for constructing a graphical model based on Bayesian Dirichlet metric. Our approach is derived from a set of propositions and theorems by researching the local metric relationship of networks matching dataset. This paper presents the algorithm to construct a tree model from a set of potential solutions using above approach. This method is important not only for evolutionary algorithms based on graphical models, but also for machine learning and data mining.The experimental results show that the exact theoretical results and the approximations match very well.