WorldWideScience

Sample records for linearly reductive algebraic

  1. Linear algebra

    Liesen, Jörg

    2015-01-01

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

  2. Linear algebra

    Stoll, R R

    1968-01-01

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

  3. Linear algebra

    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

  4. Linear Algebra and Smarandache Linear Algebra

    Vasantha, Kandasamy

    2003-01-01

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

  5. Linear algebra

    Said-Houari, Belkacem

    2017-01-01

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

  6. Linear algebra

    Shilov, Georgi E

    1977-01-01

    Covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, Euclidean spaces, unitary spaces, quadratic forms in Euclidean and unitary spaces, finite-dimensional space. Problems with hints and answers.

  7. Linear algebra

    Berberian, Sterling K

    2014-01-01

    Introductory treatment covers basic theory of vector spaces and linear maps - dimension, determinants, eigenvalues, and eigenvectors - plus more advanced topics such as the study of canonical forms for matrices. 1992 edition.

  8. Linearizing W-algebras

    Krivonos, S.O.; Sorin, A.S.

    1994-06-01

    We show that the Zamolodchikov's and Polyakov-Bershadsky nonlinear algebras W 3 and W (2) 3 can be embedded as subalgebras into some linear algebras with finite set of currents. Using these linear algebras we find new field realizations of W (2) 3 and W 3 which could be a starting point for constructing new versions of W-string theories. We also reveal a number of hidden relationships between W 3 and W (2) 3 . We conjecture that similar linear algebras can exist for other W-algebra as well. (author). 10 refs

  9. Linear-Algebra Programs

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

    1982-01-01

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

  10. Matrices and linear algebra

    Schneider, Hans

    1989-01-01

    Linear algebra is one of the central disciplines in mathematics. A student of pure mathematics must know linear algebra if he is to continue with modern algebra or functional analysis. Much of the mathematics now taught to engineers and physicists requires it.This well-known and highly regarded text makes the subject accessible to undergraduates with little mathematical experience. Written mainly for students in physics, engineering, economics, and other fields outside mathematics, the book gives the theory of matrices and applications to systems of linear equations, as well as many related t

  11. Linear algebra done right

    Axler, Sheldon

    2015-01-01

    This best-selling textbook for a second course in linear algebra is aimed at undergrad math majors and graduate students. The novel approach taken here banishes determinants to the end of the book. The text focuses on the central goal of linear algebra: understanding the structure of linear operators on finite-dimensional vector spaces. The author has taken unusual care to motivate concepts and to simplify proofs. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra. The third edition contains major improvements and revisions throughout the book. More than 300 new exercises have been added since the previous edition. Many new examples have been added to illustrate the key ideas of linear algebra. New topics covered in the book include product spaces, quotient spaces, and dual spaces. Beautiful new formatting creates pages with an unusually pleasant appearance in both print and electronic versions. No prerequisites are assumed other than the ...

  12. Kac-Moody algebras derived from linearization systems using Zsub(N) reduction and extended to supersymmetry

    Bohr, H.; Roy Chowdhury, A.

    1984-10-01

    The hidden symmetries in various integrable models are derived by applying a newly developed method that uses the Riemann-Hilbert transform in a Zsub(N)-reduction of the linearization systems. The method is extended to linearization systems with higher algebras and with supersymmetry. (author)

  13. Basic linear algebra

    Blyth, T S

    2002-01-01

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

  14. Linear algebraic groups

    Springer, T A

    1998-01-01

    "[The first] ten chapters...are an efficient, accessible, and self-contained introduction to affine algebraic groups over an algebraically closed field. The author includes exercises and the book is certainly usable by graduate students as a text or for self-study...the author [has a] student-friendly style… [The following] seven chapters... would also be a good introduction to rationality issues for algebraic groups. A number of results from the literature…appear for the first time in a text." –Mathematical Reviews (Review of the Second Edition) "This book is a completely new version of the first edition. The aim of the old book was to present the theory of linear algebraic groups over an algebraically closed field. Reading that book, many people entered the research field of linear algebraic groups. The present book has a wider scope. Its aim is to treat the theory of linear algebraic groups over arbitrary fields. Again, the author keeps the treatment of prerequisites self-contained. The material of t...

  15. Applied linear algebra

    Olver, Peter J

    2018-01-01

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

  16. Handbook of linear algebra

    Hogben, Leslie

    2013-01-01

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

  17. Linear Algebra Thoroughly Explained

    Vujičić, Milan

    2008-01-01

    Linear Algebra Thoroughly Explained provides a comprehensive introduction to the subject suitable for adoption as a self-contained text for courses at undergraduate and postgraduate level. The clear and comprehensive presentation of the basic theory is illustrated throughout with an abundance of worked examples. The book is written for teachers and students of linear algebra at all levels and across mathematics and the applied sciences, particularly physics and engineering. It will also be an invaluable addition to research libraries as a comprehensive resource book for the subject.

  18. Special set linear algebra and special set fuzzy linear algebra

    Kandasamy, W. B. Vasantha; Smarandache, Florentin; Ilanthenral, K.

    2009-01-01

    The authors in this book introduce the notion of special set linear algebra and special set fuzzy Linear algebra, which is an extension of the notion set linear algebra and set fuzzy linear algebra. These concepts are best suited in the application of multi expert models and cryptology. This book has five chapters. In chapter one the basic concepts about set linear algebra is given in order to make this book a self contained one. The notion of special set linear algebra and their fuzzy analog...

  19. Further linear algebra

    Blyth, T S

    2002-01-01

    Most of the introductory courses on linear algebra develop the basic theory of finite­ dimensional vector spaces, and in so doing relate the notion of a linear mapping to that of a matrix. Generally speaking, such courses culminate in the diagonalisation of certain matrices and the application of this process to various situations. Such is the case, for example, in our previous SUMS volume Basic Linear Algebra. The present text is a continuation of that volume, and has the objective of introducing the reader to more advanced properties of vector spaces and linear mappings, and consequently of matrices. For readers who are not familiar with the contents of Basic Linear Algebra we provide an introductory chapter that consists of a compact summary of the prerequisites for the present volume. In order to consolidate the student's understanding we have included a large num­ ber of illustrative and worked examples, as well as many exercises that are strategi­ cally placed throughout the text. Solutions to the ex...

  20. Computer Program For Linear Algebra

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

    1987-01-01

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

  1. Dynamical systems and linear algebra

    Colonius, Fritz (Prof.)

    2007-01-01

    Dynamical systems and linear algebra / F. Colonius, W. Kliemann. - In: Handbook of linear algebra / ed. by Leslie Hogben. - Boca Raton : Chapman & Hall/CRC, 2007. - S. 56,1-56,22. - (Discrete mathematics and its applications)

  2. Fundamentals of linear algebra

    Dash, Rajani Ballav

    2008-01-01

    FUNDAMENTALS OF LINEAR ALGEBRA is a comprehensive Text Book, which can be used by students and teachers of All Indian Universities. The Text has easy, understandable form and covers all topics of UGC Curriculum. There are lots of worked out examples which helps the students in solving the problems without anybody's help. The Problem sets have been designed keeping in view of the questions asked in different examinations.

  3. Matlab linear algebra

    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

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

    Campoamor-Stursberg, R.

    2018-03-01

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

  5. Templates for Linear Algebra Problems

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

    1995-01-01

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

  6. Linear Algebra and Image Processing

    Allali, Mohamed

    2010-01-01

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

  7. Linear algebra meets Lie algebra: the Kostant-Wallach theory

    Shomron, Noam; Parlett, Beresford N.

    2008-01-01

    In two languages, Linear Algebra and Lie Algebra, we describe the results of Kostant and Wallach on the fibre of matrices with prescribed eigenvalues of all leading principal submatrices. In addition, we present a brief introduction to basic notions in Algebraic Geometry, Integrable Systems, and Lie Algebra aimed at specialists in Linear Algebra.

  8. Ada Linear-Algebra Program

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

    1988-01-01

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

  9. On Associative Conformal Algebras of Linear Growth

    Retakh, Alexander

    2000-01-01

    Lie conformal algebras appear in the theory of vertex algebras. Their relation is similar to that of Lie algebras and their universal enveloping algebras. Associative conformal algebras play a role in conformal representation theory. We introduce the notions of conformal identity and unital associative conformal algebras and classify finitely generated simple unital associative conformal algebras of linear growth. These are precisely the complete algebras of conformal endomorphisms of finite ...

  10. Computational linear and commutative algebra

    Kreuzer, Martin

    2016-01-01

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

  11. Linear operators in Clifford algebras

    Laoues, M.

    1991-01-01

    We consider the real vector space structure of the algebra of linear endomorphisms of a finite-dimensional real Clifford algebra (2, 4, 5, 6, 7, 8). A basis of that space is constructed in terms of the operators M eI,eJ defined by x→e I .x.e J , where the e I are the generators of the Clifford algebra and I is a multi-index (3, 7). In particular, it is shown that the family (M eI,eJ ) is exactly a basis in the even case. (orig.)

  12. Topics in quaternion linear algebra

    Rodman, Leiba

    2014-01-01

    Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses...

  13. Introduction to computational linear algebra

    Nassif, Nabil; Erhel, Jocelyne

    2015-01-01

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

  14. Variational linear algebraic equations method

    Moiseiwitsch, B.L.

    1982-01-01

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

  15. Data Compression with Linear Algebra

    Etler, David

    2015-01-01

    A presentation on the applications of linear algebra to image compression. Covers entropy, the discrete cosine transform, thresholding, quantization, and examples of images compressed with DCT. Given in Spring 2015 at Ocean County College as part of the honors program.

  16. Relation of deformed nonlinear algebras with linear ones

    Nowicki, A; Tkachuk, V M

    2014-01-01

    The relation between nonlinear algebras and linear ones is established. For a one-dimensional nonlinear deformed Heisenberg algebra with two operators we find the function of deformation for which this nonlinear algebra can be transformed to a linear one with three operators. We also establish the relation between the Lie algebra of total angular momentum and corresponding nonlinear one. This relation gives a possibility to simplify and to solve the eigenvalue problem for the Hamiltonian in a nonlinear case using the reduction of this problem to the case of linear algebra. It is demonstrated in an example of a harmonic oscillator. (paper)

  17. Principles of linear algebra with Mathematica

    Shiskowski, Kenneth M

    2013-01-01

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

  18. BLAS- BASIC LINEAR ALGEBRA SUBPROGRAMS

    Krogh, F. T.

    1994-01-01

    The Basic Linear Algebra Subprogram (BLAS) library is a collection of FORTRAN callable routines for employing standard techniques in performing the basic operations of numerical linear algebra. The BLAS library was developed to provide a portable and efficient source of basic operations for designers of programs involving linear algebraic computations. The subprograms available in the library cover the operations of dot product, multiplication of a scalar and a vector, vector plus a scalar times a vector, Givens transformation, modified Givens transformation, copy, swap, Euclidean norm, sum of magnitudes, and location of the largest magnitude element. Since these subprograms are to be used in an ANSI FORTRAN context, the cases of single precision, double precision, and complex data are provided for. All of the subprograms have been thoroughly tested and produce consistent results even when transported from machine to machine. BLAS contains Assembler versions and FORTRAN test code for any of the following compilers: Lahey F77L, Microsoft FORTRAN, or IBM Professional FORTRAN. It requires the Microsoft Macro Assembler and a math co-processor. The PC implementation allows individual arrays of over 64K. The BLAS library was developed in 1979. The PC version was made available in 1986 and updated in 1988.

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

  20. Meromorphic functions and linear algebra

    Nevanlinna, Olavi

    2003-01-01

    This volume describes for the first time in monograph form important applications in numerical methods of linear algebra. The author presents new material and extended results from recent papers in a very readable style. The main goal of the book is to study the behavior of the resolvent of a matrix under the perturbation by low rank matrices. Whereas the eigenvalues (the poles of the resolvent) and the pseudospectra (the sets where the resolvent takes large values) can move dramatically under such perturbations, the growth of the resolvent as a matrix-valued meromorphic function remains essen

  1. Application of laser speckle to randomized numerical linear algebra

    Valley, George C.; Shaw, Thomas J.; Stapleton, Andrew D.; Scofield, Adam C.; Sefler, George A.; Johannson, Leif

    2018-02-01

    We propose and simulate integrated optical devices for accelerating numerical linear algebra (NLA) calculations. Data is modulated on chirped optical pulses and these propagate through a multimode waveguide where speckle provides the random projections needed for NLA dimensionality reduction.

  2. An Application of Linear Algebra over Lattices

    M. Hosseinyazdi

    2008-03-01

    Full Text Available In this paper, first we consider L n as a semimodule over a complete bounded distributive lattice L. Then we define the basic concepts of module theory for L n. After that, we proved many similar theorems in linear algebra for the space L n. An application of linear algebra over lattices for solving linear systems, was given

  3. An Application of Linear Algebra over Lattices

    M. Hosseinyazdi

    2008-01-01

    In this paper, first we consider L n as a semimodule over a complete bounded distributive lattice L. Then we define the basic concepts of module theory for L n. After that, we proved many similar theorems in linear algebra for the space L n. An application of linear algebra over lattices for solving linear systems, was given

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

    Gonzalez-Vega, Laureano

    1999-01-01

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

  5. An Inquiry-Based Linear Algebra Class

    Wang, Haohao; Posey, Lisa

    2011-01-01

    Linear algebra is a standard undergraduate mathematics course. This paper presents an overview of the design and implementation of an inquiry-based teaching material for the linear algebra course which emphasizes discovery learning, analytical thinking and individual creativity. The inquiry-based teaching material is designed to fit the needs of a…

  6. The Growing Importance of Linear Algebra in Undergraduate Mathematics.

    Tucker, Alan

    1993-01-01

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

  7. Advanced linear algebra for engineers with Matlab

    Dianat, Sohail A

    2009-01-01

    Matrices, Matrix Algebra, and Elementary Matrix OperationsBasic Concepts and NotationMatrix AlgebraElementary Row OperationsSolution of System of Linear EquationsMatrix PartitionsBlock MultiplicationInner, Outer, and Kronecker ProductsDeterminants, Matrix Inversion and Solutions to Systems of Linear EquationsDeterminant of a MatrixMatrix InversionSolution of Simultaneous Linear EquationsApplications: Circuit AnalysisHomogeneous Coordinates SystemRank, Nu

  8. Numerical linear algebra with applications using Matlab

    Ford, William

    2014-01-01

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

  9. Applied linear algebra and matrix analysis

    Shores, Thomas S

    2018-01-01

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

  10. Linearized dynamical approach to current algebra

    Scadron, M.D.

    1995-07-01

    We study the original motivations searching for a nonlinear chiral Lagrangian to replace the linear sigma model while manifesting all the successful properties of current algebra and partial conservation of axial currents (PCAC). (author). 26 refs

  11. Numerical linear algebra theory and applications

    Beilina, Larisa; Karchevskii, Mikhail

    2017-01-01

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

  12. Modeling digital switching circuits with linear algebra

    Thornton, Mitchell A

    2014-01-01

    Modeling Digital Switching Circuits with Linear Algebra describes an approach for modeling digital information and circuitry that is an alternative to Boolean algebra. While the Boolean algebraic model has been wildly successful and is responsible for many advances in modern information technology, the approach described in this book offers new insight and different ways of solving problems. Modeling the bit as a vector instead of a scalar value in the set {0, 1} allows digital circuits to be characterized with transfer functions in the form of a linear transformation matrix. The use of transf

  13. Stability of Linear Equations--Algebraic Approach

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

    2012-01-01

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

  14. Linear algebra a first course with applications

    Knop, Larry E

    2008-01-01

    Linear Algebra: A First Course with Applications explores the fundamental ideas of linear algebra, including vector spaces, subspaces, basis, span, linear independence, linear transformation, eigenvalues, and eigenvectors, as well as a variety of applications, from inventories to graphics to Google's PageRank. Unlike other texts on the subject, this classroom-tested book gives students enough time to absorb the material by focusing on vector spaces early on and using computational sections as numerical interludes. It offers introductions to Maple™, MATLAB®, and TI-83 Plus for calculating matri

  15. Linear Algebraic Method for Non-Linear Map Analysis

    Yu, L.; Nash, B.

    2009-01-01

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

  16. Finite-dimensional linear algebra

    Gockenbach, Mark S

    2010-01-01

    Some Problems Posed on Vector SpacesLinear equationsBest approximationDiagonalizationSummaryFields and Vector SpacesFields Vector spaces Subspaces Linear combinations and spanning sets Linear independence Basis and dimension Properties of bases Polynomial interpolation and the Lagrange basis Continuous piecewise polynomial functionsLinear OperatorsLinear operatorsMore properties of linear operatorsIsomorphic vector spaces Linear operator equations Existence and uniqueness of solutions The fundamental theorem; inverse operatorsGaussian elimination Newton's method Linear ordinary differential eq

  17. Gauss Elimination: Workhorse of Linear Algebra.

    1995-08-05

    linear algebra computation for solving systems, computing determinants and determining the rank of matrix. All of these are discussed in varying contexts. These include different arithmetic or algebraic setting such as integer arithmetic or polynomial rings as well as conventional real (floating-point) arithmetic. These have effects on both accuracy and complexity analyses of the algorithm. These, too, are covered here. The impact of modern parallel computer architecture on GE is also

  18. Hamiltonian structure of linearly extended Virasoro algebra

    Arakelyan, T.A.; Savvidi, G.K.

    1991-01-01

    The Hamiltonian structure of linearly extended Virasoro algebra which admits free bosonic field representation is described. An example of a non-trivial extension is found. The hierarchy of integrable non-linear equations corresponding to this Hamiltonian structure is constructed. This hierarchy admits the Lax representation by matrix Lax operator of second order

  19. Lie algebras and linear differential equations.

    Brockett, R. W.; Rahimi, A.

    1972-01-01

    Certain symmetry properties possessed by the solutions of linear differential equations are examined. For this purpose, some basic ideas from the theory of finite dimensional linear systems are used together with the work of Wei and Norman on the use of Lie algebraic methods in differential equation theory.

  20. Linear algebra and group theory for physicists

    Rao, K N Srinivasa

    2006-01-01

    Professor Srinivasa Rao's text on Linear Algebra and Group Theory is directed to undergraduate and graduate students who wish to acquire a solid theoretical foundation in these mathematical topics which find extensive use in physics. Based on courses delivered during Professor Srinivasa Rao's long career at the University of Mysore, this text is remarkable for its clear exposition of the subject. Advanced students will find a range of topics such as the Representation theory of Linear Associative Algebras, a complete analysis of Dirac and Kemmer algebras, Representations of the Symmetric group via Young Tableaux, a systematic derivation of the Crystallographic point groups, a comprehensive and unified discussion of the Rotation and Lorentz groups and their representations, and an introduction to Dynkin diagrams in the classification of Lie groups. In addition, the first few chapters on Elementary Group Theory and Vector Spaces also provide useful instructional material even at an introductory level. An author...

  1. An introduction to linear algebra

    Mirsky, L

    2003-01-01

    Rigorous, self-contained coverage of determinants, vectors, matrices and linear equations, quadratic forms, more. Elementary, easily readable account with numerous examples and problems at the end of each chapter.

  2. Constructive Learning in Undergraduate Linear Algebra

    Chandler, Farrah Jackson; Taylor, Dewey T.

    2008-01-01

    In this article we describe a project that we used in our undergraduate linear algebra courses to help our students successfully master fundamental concepts and definitions and generate interest in the course. We describe our philosophy and discuss the projects overall success.

  3. Noise limitations in optical linear algebra processors.

    Batsell, S G; Jong, T L; Walkup, J F; Krile, T F

    1990-05-10

    A general statistical noise model is presented for optical linear algebra processors. A statistical analysis which includes device noise, the multiplication process, and the addition operation is undertaken. We focus on those processes which are architecturally independent. Finally, experimental results which verify the analytical predictions are also presented.

  4. Modules as Learning Tools in Linear Algebra

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

    2014-01-01

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

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

  6. A Linear Algebra Measure of Cluster Quality.

    Mather, Laura A.

    2000-01-01

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

  7. Journal Writing: Enlivening Elementary Linear Algebra.

    Meel, David E.

    1999-01-01

    Examines the various issues surrounding the implementation of journal writing in an undergraduate linear algebra course. Identifies the benefits of incorporating journal writing into an undergraduate mathematics course, which are supported with students' comments from their journals and their reflections on the process. Contains 14 references.…

  8. Accelerating Dense Linear Algebra on the GPU

    Sørensen, Hans Henrik Brandenborg

    and matrix-vector operations on GPUs. Such operations form the backbone of level 1 and level 2 routines in the Basic Linear Algebra Subroutines (BLAS) library and are therefore of great importance in many scientific applications. The target hardware is the most recent NVIDIA Tesla 20-series (Fermi...

  9. More on the linearization of W-algebras

    Krivonos, S.; Sorin, A.

    1995-01-01

    We show that a wide class of W-(super)algebras, including W N (N-1) , U(N)-superconformal as well as W N nonlinear algebras, can be linearized by embedding them as subalgebras into some linear (super)conformal algebras with finite sets of currents. The general construction is illustrated by the example of W 4 algebra. 16 refs

  10. A linear algebraic approach to electron-molecule collisions

    Collins, L.A.; Schnieder, B.I.

    1982-01-01

    The linear algebraic approach to electron-molecule collisions is examined by firstly deriving the general set of coupled integrodifferential equations that describe electron collisional processes and then describing the linear algebraic approach for obtaining a solution to the coupled equations. Application of the linear algebraic method to static-exchange, separable exchange and effective optical potential, is examined. (U.K.)

  11. Schwarz maps of algebraic linear ordinary differential equations

    Sanabria Malagón, Camilo

    2017-12-01

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

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

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

  14. Basic linear algebra subprograms for FORTRAN usage

    Lawson, C. L.; Hanson, R. J.; Kincaid, D. R.; Krogh, F. T.

    1977-01-01

    A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented. The package is intended to be used with FORTRAN. The operations in the package are dot products, elementary vector operations, Givens transformations, vector copy and swap, vector norms, vector scaling, and the indices of components of largest magnitude. The subprograms and a test driver are available in portable FORTRAN. Versions of the subprograms are also provided in assembly language for the IBM 360/67, the CDC 6600 and CDC 7600, and the Univac 1108.

  15. Mathematical methods linear algebra normed spaces distributions integration

    Korevaar, Jacob

    1968-01-01

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

  16. The Linear Algebra Curriculum Study Group Recommendations for the First Course in Linear Algebra.

    Carlson, David; And Others

    1993-01-01

    Presents five recommendations of the Linear Algebra Curriculum Study Group: (1) The syllabus must respond to the client disciplines; (2) The first course should be matrix oriented; (3) Faculty should consider the needs and interests of students; (4) Faculty should use technology; and (5) At least one follow-up course should be required. Provides a…

  17. Algebraic Theory of Linear Viscoelastic Nematodynamics

    Leonov, Arkady I.

    2008-01-01

    This paper consists of two parts. The first one develops algebraic theory of linear anisotropic nematic 'N-operators' build up on the additive group of traceless second rank 3D tensors. These operators have been implicitly used in continual theories of nematic liquid crystals and weakly elastic nematic elastomers. It is shown that there exists a non-commutative, multiplicative group N 6 of N-operators build up on a manifold in 6D space of parameters. Positive N-operators, which in physical applications hold thermodynamic stability constraints, do not generally form a subgroup of group N 6 . A three-parametric, commutative transversal-isotropic subgroup S 3 subset of N 6 of positive symmetric nematic operators is also briefly discussed. The special case of singular, non-negative symmetric N-operators reveals the algebraic structure of nematic soft deformation modes. The second part of the paper develops a theory of linear viscoelastic nematodynamics applicable to liquid crystalline polymer. The viscous and elastic nematic components in theory are described by using the Leslie-Ericksen-Parodi (LEP) approach for viscous nematics and de Gennes free energy for weakly elastic nematic elastomers. The case of applied external magnetic field exemplifies the occurrence of non-symmetric stresses. In spite of multi-(10) parametric character of the theory, the use of nematic operators presents it in a transparent form. When the magnetic field is absent, the theory is simplified for symmetric case with six parameters, and takes an extremely simple, two-parametric form for viscoelastic nematodynamics with possible soft deformation modes. It is shown that the linear nematodynamics is always reducible to the LEP-like equations where the coefficients are changed for linear memory functionals whose parameters are calculated from original viscosities and moduli

  18. INPUT-OUTPUT STRUCTURE OF LINEAR-DIFFERENTIAL ALGEBRAIC SYSTEMS

    KUIJPER, M; SCHUMACHER, JM

    Systems of linear differential and algebraic equations occur in various ways, for instance, as a result of automated modeling procedures and in problems involving algebraic constraints, such as zero dynamics and exact model matching. Differential/algebraic systems may represent an input-output

  19. Linear algebra a first course with applications to differential equations

    Apostol, Tom M

    2014-01-01

    Developed from the author's successful two-volume Calculus text this book presents Linear Algebra without emphasis on abstraction or formalization. To accommodate a variety of backgrounds, the text begins with a review of prerequisites divided into precalculus and calculus prerequisites. It continues to cover vector algebra, analytic geometry, linear spaces, determinants, linear differential equations and more.

  20. Inhomogeneous linear equation in Rota-Baxter algebra

    Pietrzkowski, Gabriel

    2014-01-01

    We consider a complete filtered Rota-Baxter algebra of weight $\\lambda$ over a commutative ring. Finding the unique solution of a non-homogeneous linear algebraic equation in this algebra, we generalize Spitzer's identity in both commutative and non-commutative cases. As an application, considering the Rota-Baxter algebra of power series in one variable with q-integral as the Rota-Baxter operator, we show certain Eulerian identities.

  1. PC-BLAS, PC Linear Algebra Subroutines

    Hanson, R.J.

    1989-01-01

    1 - Description of program or function: PC-BLAS is a highly optimized version of the Basic Linear Algebra Subprograms (BLAS), a standardized set of 38 routines that perform low-level operations on vectors of numbers in single- and double-precision real and complex arithmetic. Routines are included to find the index of the largest component of a vector, apply a Givens or modified Givens rotation, multiply a vector by a constant, determine the Euclidean length, perform a dot product, swap and copy vectors, and find the norm of a vector. 2 - Restrictions on the complexity of the problem: The number of components in any vector and the spacing or stride between their entries must not exceed 32,767 (2 15 -1). PC-BLAS will not work with an 80286 CPU operating in 'protected' mode

  2. Linear algebra applications using Matlab software

    Cornelia Victoria Anghel

    2005-10-01

    Full Text Available The paper presents two ways of special matrix generating using some functions included in the MatLab software package. The MatLab software package contains a set of functions that generate special matrixes used in the linear algebra applications and the signal processing from different activity fields. The paper presents two tipes of special matrixes that can be generated using written sintaxes in the dialog window of the MatLab software and for the command validity we need to press the Enter task. The applications presented in the paper represent eamples of numerical calculus using the MatLab software and belong to the scientific field „Computer Assisted Mathematics” thus creating the symbiosis between mathematics and informatics.

  3. Numerical stability in problems of linear algebra.

    Babuska, I.

    1972-01-01

    Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.

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

    Çelik, Derya

    2015-01-01

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

  5. Teaching Linear Algebra: Must the Fog Always Roll In?

    Carlson, David

    1993-01-01

    Proposes methods to teach the more difficult concepts of linear algebra. Examines features of the Linear Algebra Curriculum Study Group Core Syllabus, and presents problems from the core syllabus that utilize the mathematical process skills of making conjectures, proving the results, and communicating the results to colleagues. Presents five…

  6. Linear Algebra Revisited: An Attempt to Understand Students' Conceptual Difficulties

    Britton, Sandra; Henderson, Jenny

    2009-01-01

    This article looks at some of the conceptual difficulties that students have in a linear algebra course. An overview of previous research in this area is given, and the various theories that have been espoused regarding the reasons that students find linear algebra so difficult are discussed. Student responses to two questions testing the ability…

  7. Emphasizing Language and Visualization in Teaching Linear Algebra

    Hannah, John; Stewart, Sepideh; Thomas, Mike

    2013-01-01

    Linear algebra with its rich theoretical nature is a first step towards advanced mathematical thinking for many undergraduate students. In this paper, we consider the teaching approach of an experienced mathematician as he attempts to engage his students with the key ideas embedded in a second-year course in linear algebra. We describe his…

  8. Resources for Teaching Linear Algebra. MAA Notes Volume 42.

    Carlson, David, Ed.; And Others

    This book takes the position that the teaching of elementary linear algebra can be made more effective by emphasizing applications, exposition, and pedagogy. It includes the recommendations of the Linear Algebra Curriculum Study Group with their core syllabus for the first course, and the thoughts of mathematics faculty who have taught linear…

  9. Hamiltonian reduction of Kac-Moody algebras

    Kimura, Kazuhiro

    1991-01-01

    Feigin-Fucks construction provides us methods to treat rational conformal theories in terms of free fields. This formulation enables us to describe partition functions and correlation functions in the Fock space of free fields. There are several attempt extending to supersymmetric theories. In this report authors present an explicit calculation of the Hamiltonian reduction based on the free field realization. In spite of the results being well-known, the relations can be clearly understood in the language of bosons. Authors perform the hamiltonian reduction by imposing a constraint with appropriate gauge transformations which preserve the constraint. This approaches enables us to gives the geometric interpretation of super Virasoro algebras and relations of the super gravity. In addition, author discuss the properties of quantum groups by using the explicit form of the group element. It is also interesting to extend to super Kac-Moody algebras. (M.N.)

  10. Accuracy Limitations in Optical Linear Algebra Processors

    Batsell, Stephen Gordon

    1990-01-01

    One of the limiting factors in applying optical linear algebra processors (OLAPs) to real-world problems has been the poor achievable accuracy of these processors. Little previous research has been done on determining noise sources from a systems perspective which would include noise generated in the multiplication and addition operations, noise from spatial variations across arrays, and from crosstalk. In this dissertation, we propose a second-order statistical model for an OLAP which incorporates all these system noise sources. We now apply this knowledge to determining upper and lower bounds on the achievable accuracy. This is accomplished by first translating the standard definition of accuracy used in electronic digital processors to analog optical processors. We then employ our second-order statistical model. Having determined a general accuracy equation, we consider limiting cases such as for ideal and noisy components. From the ideal case, we find the fundamental limitations on improving analog processor accuracy. From the noisy case, we determine the practical limitations based on both device and system noise sources. These bounds allow system trade-offs to be made both in the choice of architecture and in individual components in such a way as to maximize the accuracy of the processor. Finally, by determining the fundamental limitations, we show the system engineer when the accuracy desired can be achieved from hardware or architecture improvements and when it must come from signal pre-processing and/or post-processing techniques.

  11. The linear algebra survival guide illustrated with Mathematica

    Szabo, Fred

    2015-01-01

    The Linear Algebra Survival Guide is a reference book with a free downloadable Mathematica notebook containing all of interactive code to make the content of the book playable in Mathematica and the Mathematica Player. It offers a concise introduction to the core topics of linear algebra which includes numerous exercises that will accompany a first or second course in linear algebra. This book will guide you through the powerful graphic displays and visualization of Mathematica that make the most abstract theories seem simple-- allowing you to tackle realistic problems using simple mathematic

  12. Current algebra of classical non-linear sigma models

    Forger, M.; Laartz, J.; Schaeper, U.

    1992-01-01

    The current algebra of classical non-linear sigma models on arbitrary Riemannian manifolds is analyzed. It is found that introducing, in addition to the Noether current j μ associated with the global symmetry of the theory, a composite scalar field j, the algebra closes under Poisson brackets. (orig.)

  13. On Graph C*-Algebras with a Linear Ideal Lattice

    Eilers, Søren; Restorff, Gunnar; Ruiz, Efren

    2010-01-01

    At the cost of restricting the nature of the involved K-groups, we prove a classication result for a hitherto unexplored class of graph C-algebras, allowing us to classify all graph C-algebras on nitely many vertices with a nite linear ideal lattice if all pair of vertices are connected by innitely...

  14. Linear algebraic approach to electron-molecule collisions

    Schneider, B.I.; Collins, L.A.

    1983-01-01

    The various levels of sophistication of the linear algebraic method are discussed and its application to electron-molecule collisions of H 2 , N 2 LiH, LiF and HCl is described. 13 references, 2 tables

  15. Essential linear algebra with applications a problem-solving approach

    Andreescu, Titu

    2014-01-01

    This textbook provides a rigorous introduction to linear algebra in addition to material suitable for a more advanced course while emphasizing the subject’s interactions with other topics in mathematics such as calculus and geometry. A problem-based approach is used to develop the theoretical foundations of vector spaces, linear equations, matrix algebra, eigenvectors, and orthogonality. Key features include: • a thorough presentation of the main results in linear algebra along with numerous examples to illustrate the theory;  • over 500 problems (half with complete solutions) carefully selected for their elegance and theoretical significance; • an interleaved discussion of geometry and linear algebra, giving readers a solid understanding of both topics and the relationship between them.   Numerous exercises and well-chosen examples make this text suitable for advanced courses at the junior or senior levels. It can also serve as a source of supplementary problems for a sophomore-level course.    ...

  16. IDEALS GENERATED BY LINEAR FORMS AND SYMMETRIC ALGEBRAS

    Gaetana Restuccia

    2016-01-01

    Full Text Available We consider ideals generated by linear forms in the variables X1 : : : ;Xn in the polynomial ring R[X1; : : : ;Xn], being R a commutative, Noetherian ring with identity. We investigate when a sequence a1; a2; : : : ; am of linear forms is an ssequence, in order to compute algebraic invariants of the symmetric algebra of the ideal I = (a1; a2; : : : ; am.

  17. Formalized Linear Algebra over Elementary Divisor Rings in Coq

    Cano , Guillaume; Cohen , Cyril; Dénès , Maxime; Mörtberg , Anders; Siles , Vincent

    2016-01-01

    International audience; This paper presents a Coq formalization of linear algebra over elementary divisor rings, that is, rings where every matrix is equivalent to a matrix in Smith normal form. The main results are the formalization that these rings support essential operations of linear algebra, the classification theorem of finitely pre-sented modules over such rings and the uniqueness of the Smith normal form up to multiplication by units. We present formally verified algorithms comput-in...

  18. Quasi-superconformal algebras in two dimensions and hamiltonian reduction

    Romans, L.J.

    1991-01-01

    In the standard quantum hamiltonian reduction, constraining the SL(3, R) WZNW model leads to a model of Zamolodchikov's W 3 -symmetry. In recent work, Polyakov and Bershadsky have considered an alternative reduction which leads to a new algebra, W 3 2 , a nonlinear extension of the Virasoro algebra by a spin-1 current and two bosonic spin-3/2 currents. Motivated by this result, we display two new infinite series of nonlinear extended conformal algebras, containing 2N bosonic spin-3/2 currents and spin-1 Kac-Moody currents for either U(N) or Sp(2 N); the W 3 2 algebra appears as the N = 1 member of the U(N) series. We discuss the relationship between these algebras and the Knizhnik-Bershadsky superconformal algebras, and provide realisations in terms of free fields coupled to Kac-Moody currents. We propose a specific procedure for obtaining the algebras for general N through hamiltonian reduction. (orig.)

  19. Linear {GLP}-algebras and their elementary theories

    Pakhomov, F. N.

    2016-12-01

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

  20. Symmetric linear systems - An application of algebraic systems theory

    Hazewinkel, M.; Martin, C.

    1983-01-01

    Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.

  1. The Linear Span of Projections in AH Algebras and for Inclusions of C*-Algebras

    Dinh Trung Hoa

    2013-01-01

    Full Text Available In the first part of this paper, we show that an AH algebra A=lim→(Ai,ϕi has the LP property if and only if every element of the centre of Ai belongs to the closure of the linear span of projections in A. As a consequence, a diagonal AH-algebra has the LP property if it has small eigenvalue variation in the sense of Bratteli and Elliott. The second contribution of this paper is that for an inclusion of unital C*-algebras P⊂A with a finite Watatani index, if a faithful conditional expectation E:A→P has the Rokhlin property in the sense of Kodaka et al., then P has the LP property under the condition thatA has the LP property. As an application, let A be a simple unital C*-algebra with the LP property, α an action of a finite group G onto Aut(A. If α has the Rokhlin property in the sense of Izumi, then the fixed point algebra AG and the crossed product algebra A ⋊α G have the LP property. We also point out that there is a symmetry on the CAR algebra such that its fixed point algebra does not have the LP property.

  2. Embodied, Symbolic and Formal Thinking in Linear Algebra

    Stewart, Sepideh; Thomas, Michael O. J.

    2007-01-01

    Students often find their first university linear algebra experience very challenging. While coping with procedural aspects of the subject, solving linear systems and manipulating matrices, they may struggle with crucial conceptual ideas underpinning them, making it very difficult to progress in more advanced courses. This research has sought to…

  3. An introduction to linear algebra and tensors

    Akivis, M A; Silverman, Richard A

    1978-01-01

    Eminently readable, completely elementary treatment begins with linear spaces and ends with analytic geometry, covering multilinear forms, tensors, linear transformation, and more. 250 problems, most with hints and answers. 1972 edition.

  4. Numerical linear algebra a concise introduction with Matlab and Julia

    Bornemann, Folkmar

    2018-01-01

    This book offers an introduction to the algorithmic-numerical thinking using basic problems of linear algebra. By focusing on linear algebra, it ensures a stronger thematic coherence than is otherwise found in introductory lectures on numerics. The book highlights the usefulness of matrix partitioning compared to a component view, leading not only to a clearer notation and shorter algorithms, but also to significant runtime gains in modern computer architectures. The algorithms and accompanying numerical examples are given in the programming environment MATLAB, and additionally – in an appendix – in the future-oriented, freely accessible programming language Julia. This book is suitable for a two-hour lecture on numerical linear algebra from the second semester of a bachelor's degree in mathematics.

  5. Hardware Tailored Linear Algebra for Implicit Integrators in Embedded NMPC

    Frison, Gianluca; Quirynen, Rien; Zanelli, Andrea

    2017-01-01

    . In the case of stiff or implicitly defined dynamics, implicit integration schemes are typically preferred. This paper proposes a tailored implementation of the necessary linear algebra routines (LU factorization and triangular solutions), in order to allow for a considerable computational speedup...... of such integrators. In particular, the open-source BLASFEO framework is presented as a library of efficient linear algebra routines for small to medium-scale embedded optimization applications. Its performance is illustrated on the nonlinear optimal control example of a chain of masses. The proposed library allows...

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

    Crooks, S M; Xing, L

    2001-10-01

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

  7. Non-linear realization of the Virasoro-Kac-Moody algebra and the anomalies

    Aoyama, S.

    1988-01-01

    The non-linear realization of the Virasoro algebra x Kac-Moody algebra will be studied. We will calculate the Ricci tensor of the relevant Kaehler manifold to show a new vacuum structure for this coupled algebra. (orig.)

  8. A Type System for the Vectorial Aspect of the Linear-Algebraic Lambda-Calculus

    Pablo Arrighi

    2012-07-01

    Full Text Available We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms resulting from the reduction of programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We show that the resulting typed lambda-calculus is strongly normalizing and features a weak subject-reduction.

  9. Partially Flipped Linear Algebra: A Team-Based Approach

    Carney, Debra; Ormes, Nicholas; Swanson, Rebecca

    2015-01-01

    In this article we describe a partially flipped Introductory Linear Algebra course developed by three faculty members at two different universities. We give motivation for our partially flipped design and describe our implementation in detail. Two main features of our course design are team-developed preview videos and related in-class activities.…

  10. Using Cognitive Tutor Software in Learning Linear Algebra Word Concept

    Yang, Kai-Ju

    2015-01-01

    This paper reports on a study of twelve 10th grade students using Cognitive Tutor, a math software program, to learn linear algebra word concept. The study's purpose was to examine whether students' mathematics performance as it is related to using Cognitive Tutor provided evidence to support Koedlinger's (2002) four instructional principles used…

  11. Creating Discussions with Classroom Voting in Linear Algebra

    Cline, Kelly; Zullo, Holly; Duncan, Jonathan; Stewart, Ann; Snipes, Marie

    2013-01-01

    We present a study of classroom voting in linear algebra, in which the instructors posed multiple-choice questions to the class and then allowed a few minutes for consideration and small-group discussion. After each student in the class voted on the correct answer using a classroom response system, a set of clickers, the instructor then guided a…

  12. A linear algebra course with PC-MATLAB : some experiences

    Smits, J.G.M.M.; Rijpkema, J.J.M.

    1992-01-01

    The authors present their views on the impact that the use of computers and software packages should have on the contents of a first service course on linear algebra. Furthermore they report on their experiences using the software package PC-MATLAB in such a course.

  13. Inverse Modelling Problems in Linear Algebra Undergraduate Courses

    Martinez-Luaces, Victor E.

    2013-01-01

    This paper will offer an analysis from a theoretical point of view of mathematical modelling, applications and inverse problems of both causation and specification types. Inverse modelling problems give the opportunity to establish connections between theory and practice and to show this fact, a simple linear algebra example in two different…

  14. Linear Algebra and the Experiences of a "Flipper"

    Wright, Sarah E.

    2015-01-01

    This paper describes the linear algebra class I taught during Spring 2014 semester at Adelphi University. I discuss the details of how I flipped the class and incorporated elements of inquiry-based learning as well as the reasoning behind specific decisions I made. I give feedback from the students on the success of the course and provide my own…

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

  16. Undergraduate Mathematics Students' Emotional Experiences in Linear Algebra Courses

    Martínez-Sierra, Gustavo; García-González, María del Socorro

    2016-01-01

    Little is known about students' emotions in the field of Mathematics Education that go beyond students' emotions in problem solving. To start filling this gap this qualitative research has the aim to identify emotional experiences of undergraduate mathematics students in Linear Algebra courses. In order to obtain data, retrospective focus group…

  17. Definitions Are Important: The Case of Linear Algebra

    Berman, Abraham; Shvartsman, Ludmila

    2016-01-01

    In this paper we describe an experiment in a linear algebra course. The aim of the experiment was to promote the students' understanding of the studied concepts focusing on their definitions. It seems to be a given that students should understand concepts' definitions before working substantially with them. Unfortunately, in many cases they do…

  18. Optical linear algebra processors: noise and error-source modeling.

    Casasent, D; Ghosh, A

    1985-06-01

    The modeling of system and component noise and error sources in optical linear algebra processors (OLAP's) 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.

  19. A Framework for Mathematical Thinking: The Case of Linear Algebra

    Stewart, Sepideh; Thomas, Michael O. J.

    2009-01-01

    Linear algebra is one of the unavoidable advanced courses that many mathematics students encounter at university level. The research reported here was part of the first author's recent PhD study, where she created and applied a theoretical framework combining the strengths of two major mathematics education theories in order to investigate the…

  20. Reading between the Lines: Teaching Linear Algebra

    Lewis, Jennifer M.; Blunk, Merrie L.

    2012-01-01

    This paper compares lessons on linear equations from the same curriculum materials taught by two teachers of different levels of mathematical knowledge for teaching (MKT). The analysis indicates that the mathematical quality of instruction in these two classrooms appears to be a function of differences in MKT. Although the two teachers were…

  1. GPU Linear algebra extensions for GNU/Octave

    Bosi, L B; Mariotti, M; Santocchia, A

    2012-01-01

    Octave is one of the most widely used open source tools for numerical analysis and liner algebra. Our project aims to improve Octave by introducing support for GPU computing in order to speed up some linear algebra operations. The core of our work is a C library that executes some BLAS operations concerning vector- vector, vector matrix and matrix-matrix functions on the GPU. OpenCL functions are used to program GPU kernels, which are bound within the GNU/octave framework. We report the project implementation design and some preliminary results about performance.

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

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

    1977-01-01

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

  3. Quasi-Linear Algebras and Integrability (the Heisenberg Picture

    Alexei Zhedanov

    2008-02-01

    Full Text Available We study Poisson and operator algebras with the ''quasi-linear property'' from the Heisenberg picture point of view. This means that there exists a set of one-parameter groups yielding an explicit expression of dynamical variables (operators as functions of ''time'' t. We show that many algebras with nonlinear commutation relations such as the Askey-Wilson, q-Dolan-Grady and others satisfy this property. This provides one more (explicit Heisenberg evolution interpretation of the corresponding integrable systems.

  4. Projection of angular momentum via linear algebra

    Johnson, Calvin W.; O'Mara, Kevin D.

    2017-12-01

    Projection of many-body states with good angular momentum from an initial state is usually accomplished by a three-dimensional integral. We show how projection can instead be done by solving a straightforward system of linear equations. We demonstrate the method and give sample applications to 48Cr and 60Fe in the p f shell. This new projection scheme, which is competitive against the standard numerical quadrature, should also be applicable to other quantum numbers such as isospin and particle number.

  5. Avoiding Communication in Dense Linear Algebra

    2013-08-16

    22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply...from ParLab affiliates National Instruments, Nokia , NVIDIA, Oracle and Samsung, as well as MathWorks. Research is also supported by DOE grants DE...see why , take A = ( X 0 Y T 0 ) , and then A ·AT = ( ∗ XY ∗ ∗ ) . CHAPTER 3. COMMUNICATION LOWER BOUNDS VIA REDUCTIONS 25 ± 1∗ 0∗ y 1∗ 1∗ 1∗ 1∗ 0∗ 1∗ 0

  6. A linear process-algebraic format for probabilistic systems with data (extended version)

    Katoen, Joost P.; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette; Timmer, Mark

    2010-01-01

    This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar

  7. A linear process-algebraic format for probabilistic systems with data

    Katoen, Joost P.; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette; Timmer, Mark; Gomes, L.; Khomenko, V.; Fernandes, J.M.

    This paper presents a novel linear process algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar

  8. Linear algebra and matrices topics for a second course

    Shapiro, Helene

    2015-01-01

    Linear algebra and matrix theory are fundamental tools for almost every area of mathematics, both pure and applied. This book combines coverage of core topics with an introduction to some areas in which linear algebra plays a key role, for example, block designs, directed graphs, error correcting codes, and linear dynamical systems. Notable features include a discussion of the Weyr characteristic and Weyr canonical forms, and their relationship to the better-known Jordan canonical form; the use of block cyclic matrices and directed graphs to prove Frobenius's theorem on the structure of the eigenvalues of a nonnegative, irreducible matrix; and the inclusion of such combinatorial topics as BIBDs, Hadamard matrices, and strongly regular graphs. Also included are McCoy's theorem about matrices with property P, the Bruck-Ryser-Chowla theorem on the existence of block designs, and an introduction to Markov chains. This book is intended for those who are familiar with the linear algebra covered in a typical first c...

  9. A modified linear algebraic approach to electron scattering using cubic splines

    Kinney, R.A.

    1986-01-01

    A modified linear algebraic approach to the solution of the Schrodiner equation for low-energy electron scattering is presented. The method uses a piecewise cubic-spline approximation of the wavefunction. Results in the static-potential and the static-exchange approximations for e - +H s-wave scattering are compared with unmodified linear algebraic and variational linear algebraic methods. (author)

  10. [Relations between biomedical variables: mathematical analysis or linear algebra?].

    Hucher, M; Berlie, J; Brunet, M

    1977-01-01

    The authors, after a short reminder of one pattern's structure, stress on the possible double approach of relations uniting the variables of this pattern: use of fonctions, what is within the mathematical analysis sphere, use of linear algebra profiting by matricial calculation's development and automatiosation. They precise the respective interests on these methods, their bounds and the imperatives for utilization, according to the kind of variables, of data, and the objective for work, understanding phenomenons or helping towards decision.

  11. Communication Avoiding and Overlapping for Numerical Linear Algebra

    2012-05-08

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

  12. On Numerical Stability in Large Scale Linear Algebraic Computations

    Strakoš, Zdeněk; Liesen, J.

    2005-01-01

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

  13. Lie Algebraic Treatment of Linear and Nonlinear Beam Dynamics

    Alex J. Dragt; Filippo Neri; Govindan Rangarajan; David Douglas; Liam M. Healy; Robert D. Ryne

    1988-12-01

    The purpose of this paper is to present a summary of new methods, employing Lie algebraic tools, for characterizing beam dynamics in charged-particle optical systems. These methods are applicable to accelerator design, charged-particle beam transport, electron microscopes, and also light optics. The new methods represent the action of each separate element of a compound optical system, including all departures from paraxial optics, by a certain operator. The operators for the various elements can then be concatenated, following well-defined rules, to obtain a resultant operator that characterizes the entire system. This paper deals mostly with accelerator design and charged-particle beam transport. The application of Lie algebraic methods to light optics and electron microscopes is described elsewhere (1, see also 44). To keep its scope within reasonable bounds, they restrict their treatment of accelerator design and charged-particle beam transport primarily to the use of Lie algebraic methods for the description of particle orbits in terms of transfer maps. There are other Lie algebraic or related approaches to accelerator problems that the reader may find of interest (2). For a general discussion of linear and nonlinear problems in accelerator physics see (3).

  14. Generalization of the linear algebraic method to three dimensions

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

    1991-01-01

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

  15. Reduction of Linear Programming to Linear Approximation

    Vaserstein, Leonid N.

    2006-01-01

    It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.

  16. Linear algebra and analytic geometry for physical sciences

    Landi, Giovanni

    2018-01-01

    A self-contained introduction to finite dimensional vector spaces, matrices, systems of linear equations, spectral analysis on euclidean and hermitian spaces, affine euclidean geometry, quadratic forms and conic sections. The mathematical formalism is motivated and introduced by problems from physics, notably mechanics (including celestial) and electro-magnetism, with more than two hundreds examples and solved exercises. Topics include: The group of orthogonal transformations on euclidean spaces, in particular rotations, with Euler angles and angular velocity. The rigid body with its inertia matrix. The unitary group. Lie algebras and exponential map. The Dirac’s bra-ket formalism. Spectral theory for self-adjoint endomorphisms on euclidean and hermitian spaces. The Minkowski spacetime from special relativity and the Maxwell equations. Conic sections with the use of eccentricity and Keplerian motions. An appendix collects basic algebraic notions like group, ring and field; and complex numbers and integers m...

  17. Linear operator pencils on Lie algebras and Laurent biorthogonal polynomials

    Gruenbaum, F A; Vinet, Luc; Zhedanov, Alexei

    2004-01-01

    We study operator pencils on generators of the Lie algebras sl 2 and the oscillator algebra. These pencils are linear in a spectral parameter λ. The corresponding generalized eigenvalue problem gives rise to some sets of orthogonal polynomials and Laurent biorthogonal polynomials (LBP) expressed in terms of the Gauss 2 F 1 and degenerate 1 F 1 hypergeometric functions. For special choices of the parameters of the pencils, we identify the resulting polynomials with the Hendriksen-van Rossum LBP which are widely believed to be the biorthogonal analogues of the classical orthogonal polynomials. This places these examples under the umbrella of the generalized bispectral problem which is considered here. Other (non-bispectral) cases give rise to some 'nonclassical' orthogonal polynomials including Tricomi-Carlitz and random-walk polynomials. An application to solutions of relativistic Toda chain is considered

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

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

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

    2010-01-01

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

  20. Relating Reasoning Methodologies in Linear Logic and Process Algebra

    Yuxin Deng

    2012-11-01

    Full Text Available We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The argument makes use of other standard notions in process algebra, namely a labeled transition system and a coinductively defined simulation relation. This result establishes a connection between an approach to reason about process specifications and a method to reason about logic specifications.

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

    Ghosh, A; Paparao, P

    1987-07-15

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

  2. Negative base encoding in optical linear algebra processors

    Perlee, C.; Casasent, D.

    1986-01-01

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

  3. First order linear ordinary differential equations in associative algebras

    Gordon Erlebacher

    2004-01-01

    Full Text Available In this paper, we study the linear differential equation $$ frac{dx}{dt}=sum_{i=1}^n a_i(t x b_i(t + f(t $$ in an associative but non-commutative algebra $mathcal{A}$, where the $b_i(t$ form a set of commuting $mathcal{A}$-valued functions expressed in a time-independent spectral basis consisting of mutually annihilating idempotents and nilpotents. Explicit new closed solutions are derived, and examples are presented to illustrate the theory.

  4. LAPACKrc: Fast linear algebra kernels/solvers for FPGA accelerators

    Gonzalez, Juan; Nunez, Rafael C

    2009-01-01

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

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

    Ndogmo, J. C.

    2017-06-01

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

  6. Using Example Generation to Explore Students' Understanding of the Concepts of Linear Dependence/Independence in Linear Algebra

    Aydin, Sinan

    2014-01-01

    Linear algebra is a basic mathematical subject taught in mathematics and science depar-tments of universities. The teaching and learning of this course has always been difficult. This study aims to contribute to the research in linear algebra education, focusing on linear dependence and independence concepts. This was done by introducing…

  7. Student Learning of Basis, Span and Linear Independence in Linear Algebra

    Stewart, Sepideh; Thomas, Michael O. J.

    2010-01-01

    One of the earlier, more challenging concepts in linear algebra at university is that of basis. Students are often taught procedurally how to find a basis for a subspace using matrix manipulation, but may struggle with understanding the construct of basis, making further progress harder. We believe one reason for this is because students have…

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

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

    2015-01-01

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

  9. The algebra of non-local charges in non-linear sigma models

    Abdalla, E.; Abdalla, M.C.B.; Brunelli, J.C.; Zadra, A.

    1994-01-01

    It is derived the complete Dirac algebra satisfied by non-local charges conserved in non-linear sigma models. Some examples of calculation are given for the O(N) symmetry group. The resulting algebra corresponds to a saturated cubic deformation (with only maximum order terms) of the Kac-Moody algebra. The results are generalized for when a Wess-Zumino term be present. In that case the algebra contains a minor order correction (sub-saturation). (author). 1 ref

  10. Linear response theory an analytic-algebraic approach

    De Nittis, Giuseppe

    2017-01-01

    This book presents a modern and systematic approach to Linear Response Theory (LRT) by combining analytic and algebraic ideas. LRT is a tool to study systems that are driven out of equilibrium by external perturbations. In particular the reader is provided with a new and robust tool to implement LRT for a wide array of systems. The proposed formalism in fact applies to periodic and random systems in the discrete and the continuum. After a short introduction describing the structure of the book, its aim and motivation, the basic elements of the theory are presented in chapter 2. The mathematical framework of the theory is outlined in chapters 3–5: the relevant von Neumann algebras, noncommutative $L^p$- and Sobolev spaces are introduced; their construction is then made explicit for common physical systems; the notion of isopectral perturbations and the associated dynamics are studied. Chapter 6 is dedicated to the main results, proofs of the Kubo and Kubo-Streda formulas. The book closes with a chapter about...

  11. Acoustooptic linear algebra processors - Architectures, algorithms, and applications

    Casasent, D.

    1984-01-01

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

  12. Using linear algebra for protein structural comparison and classification.

    Gomide, Janaína; Melo-Minardi, Raquel; Dos Santos, Marcos Augusto; Neshich, Goran; Meira, Wagner; Lopes, Júlio César; Santoro, Marcelo

    2009-07-01

    In this article, we describe a novel methodology to extract semantic characteristics from protein structures using linear algebra in order to compose structural signature vectors which may be used efficiently to compare and classify protein structures into fold families. These signatures are built from the pattern of hydrophobic intrachain interactions using Singular Value Decomposition (SVD) and Latent Semantic Indexing (LSI) techniques. Considering proteins as documents and contacts as terms, we have built a retrieval system which is able to find conserved contacts in samples of myoglobin fold family and to retrieve these proteins among proteins of varied folds with precision of up to 80%. The classifier is a web tool available at our laboratory website. Users can search for similar chains from a specific PDB, view and compare their contact maps and browse their structures using a JMol plug-in.

  13. Using linear algebra for protein structural comparison and classification

    Janaína Gomide

    2009-01-01

    Full Text Available In this article, we describe a novel methodology to extract semantic characteristics from protein structures using linear algebra in order to compose structural signature vectors which may be used efficiently to compare and classify protein structures into fold families. These signatures are built from the pattern of hydrophobic intrachain interactions using Singular Value Decomposition (SVD and Latent Semantic Indexing (LSI techniques. Considering proteins as documents and contacts as terms, we have built a retrieval system which is able to find conserved contacts in samples of myoglobin fold family and to retrieve these proteins among proteins of varied folds with precision of up to 80%. The classifier is a web tool available at our laboratory website. Users can search for similar chains from a specific PDB, view and compare their contact maps and browse their structures using a JMol plug-in.

  14. Linear algebra for dense matrices on a hypercube

    Sears, M.P.

    1990-01-01

    A set of routines has been written for dense matrix operations optimized for the NCUBE/6400 parallel processor. This paper was motivated by a Sandia effort to parallelize certain electronic structure calculations. Routines are included for matrix transpose, multiply, Cholesky decomposition, triangular inversion, and Householder tridiagonalization. The library is written in C and is callable from Fortran. Matrices up to order 1600 can be handled on 128 processors. For each operation, the algorithm used is presented along with typical timings and estimates of performance. Performance for order 1600 on 128 processors varies from 42 MFLOPs (House-holder tridiagonalization, triangular inverse) up to 126 MFLOPs (matrix multiply). The authors also present performance results for communications and basic linear algebra operations (saxpy and dot products)

  15. su(1,2) Algebraic Structure of XYZ Antiferromagnetic Model in Linear Spin-Wave Frame

    Jin Shuo; Xie Binghao; Yu Zhaoxian; Hou Jingmin

    2008-01-01

    The XYZ antiferromagnetic model in linear spin-wave frame is shown explicitly to have an su(1,2) algebraic structure: the Hamiltonian can be written as a linear function of the su(1,2) algebra generators. Based on it, the energy eigenvalues are obtained by making use of the similar transformations, and the algebraic diagonalization method is investigated. Some numerical solutions are given, and the results indicate that only one group solution could be accepted in physics

  16. Advanced Mathematics Online: Assessing Particularities in the Online Delivery of a Second Linear Algebra Course

    Montiel, Mariana; Bhatti, Uzma

    2010-01-01

    This article presents an overview of some issues that were confronted when delivering an online second Linear Algebra course (assuming a previous Introductory Linear Algebra course) to graduate students enrolled in a Secondary Mathematics Education program. The focus is on performance in one particular aspect of the course: "change of basis" and…

  17. Supporting Students' Understanding of Linear Equations with One Variable Using Algebra Tiles

    Saraswati, Sari; Putri, Ratu Ilma Indra; Somakim

    2016-01-01

    This research aimed to describe how algebra tiles can support students' understanding of linear equations with one variable. This article is a part of a larger research on learning design of linear equations with one variable using algebra tiles combined with balancing method. Therefore, it will merely discuss one activity focused on how students…

  18. The Role of Proof in Comprehending and Teaching Elementary Linear Algebra.

    Uhlig, Frank

    2002-01-01

    Describes how elementary linear algebra can be taught successfully while introducing students to the concept and practice of mathematical proof. Suggests exploring the concept of solvability of linear systems first via the row echelon form (REF). (Author/KHR)

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

    NONE

    1997-12-31

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

  20. On MV-algebras of non-linear functions

    Antonio Di Nola

    2017-01-01

    Full Text Available In this paper, the main results are:a study of the finitely generated MV-algebras of continuous functions from the n-th power of the unit real interval I to I;a study of Hopfian MV-algebras; anda category-theoretic study of the map sending an MV-algebra as above to the range of its generators (up to a suitable form of homeomorphism.

  1. On MV-algebras of non-linear functions

    Antonio Di Nola

    2017-01-01

    Full Text Available In this paper, the main results are: a study of the finitely generated MV-algebras of continuous functions from the n-th power of the unit real interval I to I; a study of Hopfian MV-algebras; and a category-theoretic study of the map sending an MV-algebra as above to the range of its generators (up to a suitable form of homeomorphism.

  2. Study on infrared multiphoton excitation of the linear triatomic molecule by the Lie-algebra approach

    Feng, H.; Zheng, Y.; Ding, S.

    2007-01-01

    Infrared multiphoton vibrational excitation of the linear triatomic molecule has been studied using the quadratic anharmonic Lie-algebra model, unitary transformations, and Magnus approximation. An explicit Lie-algebra expression for the vibrational transition probability is obtained by using a Lie-algebra approach. This explicit Lie-algebra expressions for time-evolution operator and vibrational transition probabilities make the computation clearer and easier. The infrared multiphoton vibrational excitation of the DCN linear tri-atomic molecule is discussed as an example

  3. Probing the Locality of Excited States with Linear Algebra.

    Etienne, Thibaud

    2015-04-14

    This article reports a novel theoretical approach related to the analysis of molecular excited states. The strategy introduced here involves gathering two pieces of physical information, coming from Hilbert and direct space operations, into a general, unique quantum mechanical descriptor of electronic transitions' locality. Moreover, the projection of Hilbert and direct space-derived indices in an Argand plane delivers a straightforward way to visually probe the ability of a dye to undergo a long- or short-range charge-transfer. This information can be applied, for instance, to the analysis of the electronic response of families of dyes to light absorption by unveiling the trend of a given push-pull chromophore to increase the electronic cloud polarization magnitude of its main transition with respect to the size extension of its conjugated spacer. We finally demonstrate that all the quantities reported in this article can be reliably approximated by a linear algebraic derivation, based on the contraction of detachment/attachment density matrices from canonical to atomic space. This alternative derivation has the remarkable advantage of a very low computational cost with respect to the previously used numerical integrations, making fast and accurate characterization of large molecular systems' excited states easily affordable.

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

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

    2011-01-01

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

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

    Yildiz Ulus, Aysegul

    2013-01-01

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

  6. A generalized variational algebra and conserved densities for linear evolution equations

    Abellanas, L.; Galindo, A.

    1978-01-01

    The symbolic algebra of Gel'fand and Dikii is generalized to the case of n variables. Using this algebraic approach a rigorous characterization of the polynomial kernel of the variational derivative is given. This is applied to classify all the conservation laws for linear polynomial evolution equations of arbitrary order. (Auth.)

  7. Decomposition Theory in the Teaching of Elementary Linear Algebra.

    London, R. R.; Rogosinski, H. P.

    1990-01-01

    Described is a decomposition theory from which the Cayley-Hamilton theorem, the diagonalizability of complex square matrices, and functional calculus can be developed. The theory and its applications are based on elementary polynomial algebra. (KR)

  8. Study of the 'non-Abelian' current algebra of a non-linear σ-model

    Ghosh, Subir

    2006-01-01

    A particular form of non-linear σ-model, having a global gauge invariance, is studied. The detailed discussion on current algebra structures reveals the non-Abelian nature of the invariance, with field dependent structure functions. Reduction of the field theory to a point particle framework yields a non-linear harmonic oscillator, which is a special case of similar models studied before in [J.F. Carinena et al., Nonlinearity 17 (2004) 1941, math-ph/0406002; J.F. Carinena et al., in: Proceedings of 10th International Conference in Modern Group Analysis, Larnaca, Cyprus, 2004, p. 39, math-ph/0505028; J.F. Carinena et al., Rep. Math. Phys. 54 (2004) 285, hep-th/0501106]. The connection with non-commutative geometry is also established

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

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

    2013-10-01

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

  10. Minimal deformation of the commutative algebra and the linear group GL(n)

    Zupnik, B.M.

    1993-01-01

    We consider the relations of generalized commutativity in the algebra of formal series M q (x i ), which conserve a tensor I q -graduation and depend on parameters q(i,k). We choose the I q -invariant version of differential calculus on M q . A new construction of the symmetrized tensor product for M q -type algebras and the corresponding definition of minimally deformed linear group QGL(n) and Lie algebra qgl(n) are proposed. We study the connection of QGL(n) and qgl(n) with the special matrix algebra Mat(n, Q) containing matrices with noncommutative elements. A definition of the deformed determinant in the algebra Mat(n, Q) is given. The exponential parametrization in the algebra Mat(n, Q) is considered on the basis of Campbell-Hausdorf formula

  11. On the completeness of the set of classical W-algebras obtained from DS reductions

    Feher, L.; Ruelle, P.; Tsutsui, I.

    1993-04-01

    We clarify the notions of the DS-generalized Drinfeld-Sokolov-reduction approach to classical W-algebras and collect evidence supporting the conjecture that the canonical W-algebras (called W S G -algebras), defined by the highest weights of the sl(2) embeddings S contains or equal to G into the simple Lie algebras, essentially exhaust the set of W-algebras that may be obtained by reducing the affine Kac-Moody (KM) Poisson bracket algebras in this approach. We first prove that an sl(2) embedding S contains or equal to G can be associated to every DS reduction and then derive restrictions on the possible cases belonging to the same sl(2) embedding. We find examples of noncanonical DS reductions, but in all those examples the resultant noncanonical W-algebra decouples into the direct product of the corresponding W S G -algebra and a system of 'free fields' with conformal weights Δ element of {0, 1/2, 1}. We also show that if the conformal weights of the generators of a W-algebra obtained from DS reduction are nonnegative Δ ≥ 0 (which is the case for all DS reductions known to date), then the Δ ≥ 3/2 subsectors of the weights are necessarily the same as in the corresponding W S G -algebra. The paper is concluded by a list of open problems concerning DS reductions and more general Hamiltonian KM reductions. (orig.)

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

    McWilliams, J C

    2000-01-01

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

  13. The algebra of non-local charges in non-linear sigma models

    Abdalla, E.; Abdalla, M.C.B.; Brunelli, J.C.; Zadra, A.

    1993-07-01

    We obtain the exact Dirac algebra obeyed by the conserved non-local charges in bosonic non-linear sigma models. Part of the computation is specialized for a symmetry group O(N). As it turns out the algebra corresponds to a cubic deformation of the Kac-Moody algebra. The non-linear terms are computed in closed form. In each Dirac bracket we only find highest order terms (as explained in the paper), defining a saturated algebra. We generalize the results for the presence of a Wess-Zumino term. The algebra is very similar to the previous one, containing now a calculable correction of order one unit lower. (author). 22 refs, 5 figs

  14. A Simple and Practical Linear Algebra Library Interface with Static Size Checking

    Akinori Abe

    2015-12-01

    Full Text Available Linear algebra is a major field of numerical computation and is widely applied. Most linear algebra libraries (in most programming languages do not statically guarantee consistency of the dimensions of vectors and matrices, causing runtime errors. While advanced type systems—specifically, dependent types on natural numbers—can ensure consistency among the sizes of collections such as lists and arrays, such type systems generally require non-trivial changes to existing languages and application programs, or tricky type-level programming. We have developed a linear algebra library interface that verifies the consistency (with respect to dimensions of matrix operations by means of generative phantom types, implemented via fairly standard ML types and module system. To evaluate its usability, we ported to it a practical machine learning library from a traditional linear algebra library. We found that most of the changes required for the porting could be made mechanically, and changes that needed human thought are minor.

  15. Efficient linear algebra routines for symmetric matrices stored in packed form.

    Ahlrichs, Reinhart; Tsereteli, Kakha

    2002-01-30

    Quantum chemistry methods require various linear algebra routines for symmetric matrices, for example, diagonalization or Cholesky decomposition for positive matrices. We present a small set of these basic routines that are efficient and minimize memory requirements.

  16. SUPPORTING STUDENTS’ UNDERSTANDING OF LINEAR EQUATIONS WITH ONE VARIABLE USING ALGEBRA TILES

    Sari Saraswati

    2016-01-01

    Full Text Available This research aimed to describe how algebra tiles can support students’ understanding of linear equations with one variable. This article is a part of a larger research on learning design of linear equations with one variable using algebra tiles combined with balancing method. Therefore, it will merely discuss one activity focused on how students use the algebra tiles to find a method to solve linear equations with one variable. Design research was used as an approach in this study. It consists of three phases, namely preliminary design, teaching experiment and retrospective analysis. Video registrations, students’ written works, pre-test, post-test, field notes, and interview are technic to collect data. The data were analyzed by comparing the hypothetical learning trajectory (HLT and the actual learning process. The result shows that algebra tiles could supports students’ understanding to find the formal solution of linear equation with one variable.

  17. Answers to selected problems in multivariable calculus with linear algebra and series

    Trench, William F

    1972-01-01

    Answers to Selected Problems in Multivariable Calculus with Linear Algebra and Series contains the answers to selected problems in linear algebra, the calculus of several variables, and series. Topics covered range from vectors and vector spaces to linear matrices and analytic geometry, as well as differential calculus of real-valued functions. Theorems and definitions are included, most of which are followed by worked-out illustrative examples.The problems and corresponding solutions deal with linear equations and matrices, including determinants; vector spaces and linear transformations; eig

  18. Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects

    Agullo, Emmanuel; Demmel, Jim; Dongarra, Jack; Hadri, Bilel; Kurzak, Jakub; Langou, Julien; Ltaief, Hatem; Luszczek, Piotr; Tomov, Stanimire

    2009-01-01

    The emergence and continuing use of multi-core architectures and graphics processing units require changes in the existing software and sometimes even a redesign of the established algorithms in order to take advantage of now prevailing parallelism. Parallel Linear Algebra for Scalable Multi-core Architectures (PLASMA) and Matrix Algebra on GPU and Multics Architectures (MAGMA) are two projects that aims to achieve high performance and portability across a wide range of multi-core architectures and hybrid systems respectively. We present in this document a comparative study of PLASMA's performance against established linear algebra packages and some preliminary results of MAGMA on hybrid multi-core and GPU systems.

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

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

    2002-08-01

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

  20. Borel reductibility and classification of von neumann algebras

    Sasyk, R.; Törnquist, Asger Dag

    2009-01-01

    We announce some new results regarding the classification problem for separable von Neumann algebras. Our results are obtained by applying the notion of Borel reducibility and Hjorth's theory of turbulence to the isomorphism relation for separable von Neumann algebras....

  1. Generalized Heisenberg algebra and (non linear) pseudo-bosons

    Bagarello, F.; Curado, E. M. F.; Gazeau, J. P.

    2018-04-01

    We propose a deformed version of the generalized Heisenberg algebra by using techniques borrowed from the theory of pseudo-bosons. In particular, this analysis is relevant when non self-adjoint Hamiltonians are needed to describe a given physical system. We also discuss relations with nonlinear pseudo-bosons. Several examples are discussed.

  2. Finding the radical of an algebra of linear transformations

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

    1997-01-01

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

  3. Non-linear realizations of superconformal and W-algebras as embeddings of strings

    Bellucci, S.

    1998-01-01

    We propose a simple method for constructing representations of (super)conformal and non-linear W-type algebras in terms of their subalgebras and corresponding Nambu-Goldstone fields. We apply it to N=2 and N=1 superconformal algebras and describe in this way various embeddings of strings and superstrings for which these algebras and their subalgebras define world-sheet symmetries. Besides reproducing the known examples, we present some new ones, in particular an embedding of the bosonic string with additional U(1) affine symmetry into N=2 superstring. We also apply our method to the non-linear W 3 (2) algebra and demonstrate that the linearization procedure worked out for it some time ago gets a natural interpretation as a kind of string embedding. All these embeddings include the critical ones as particular cases. (orig.)

  4. Reductive Lie-admissible algebras applied to H-spaces and connections

    Sagle, A.A.

    1982-01-01

    An algebra A with multiplication xy is Lie-admissible if the vector space A with new multiplication [x,y] = xy-yx is a Lie algebra; we denote this Lie algebra by A - . Thus, an associative algebra is Lie-admissible but a Cayley algebra is not Lie-admissible. In this paper we show how Lie-admissible algebras arise from Lie groups and their application to differential geometry on Lie groups via the following theorem. Let A be an n-dimensional Lie-admissible algebra over the reals. Let G be a Lie group with multiplication function μ and with Lie algebra g which is isomorphic to A - . Then there exiss a corrdinate system at the identify e in G which represents μ by a function F:gxg→g defined locally at the origin, such that the second derivative, F 2 , at the origin defines on the vector space g the structure of a nonassociative algebra (g, F 2 ). Furthermore this algebra is isomorphic to A and (g, F 2 ) - is isomorphic to A - . Thus roughly, any Lie-admissible algebra is isomorphic to an algebra obtained from a Lie algebra via a change of coordinates in the Lie group. Lie algebras arise by using canonical coordinates and the Campbell-Hausdorff formula. Applications of this show that any G-invariant psuedo-Riemannian connection on G is completely determined by a suitable Lie-admissible algebra. These results extend to H-spaces, reductive Lie-admissible algebras and connections on homogeneous H-spaces. Thus, alternative and other non-Lie-admissible algebras can be utilized

  5. Linear algebra and linear operators in engineering with applications in Mathematica

    Davis, H Ted

    2000-01-01

    Designed for advanced engineering, physical science, and applied mathematics students, this innovative textbook is an introduction to both the theory and practical application of linear algebra and functional analysis. The book is self-contained, beginning with elementary principles, basic concepts, and definitions. The important theorems of the subject are covered and effective application tools are developed, working up to a thorough treatment of eigenanalysis and the spectral resolution theorem. Building on a fundamental understanding of finite vector spaces, infinite dimensional Hilbert spaces are introduced from analogy. Wherever possible, theorems and definitions from matrix theory are called upon to drive the analogy home. The result is a clear and intuitive segue to functional analysis, culminating in a practical introduction to the functional theory of integral and differential operators. Numerous examples, problems, and illustrations highlight applications from all over engineering and the physical ...

  6. New results for algebraic tensor reduction of Feynman integrals

    Fleischer, Jochem [Bielefeld Univ. (Germany). Fakultaet fuer Physik; Riemann, Tord [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Yundin, Valery [Copenhagen Univ. (Denmark). Niels Bohr International Academy and Discovery Center

    2012-02-15

    We report on some recent developments in algebraic tensor reduction of one-loop Feynman integrals. For 5-point functions, an efficient tensor reduction was worked out recently and is now available as numerical C++ package, PJFry, covering tensor ranks until five. It is free of inverse 5- point Gram determinants and inverse small 4-point Gram determinants are treated by expansions in higher-dimensional 3-point functions. By exploiting sums over signed minors, weighted with scalar products of chords (or, equivalently, external momenta), extremely efficient expressions for tensor integrals contracted with external momenta were derived. The evaluation of 7-point functions is discussed. In the present approach one needs for the reductions a (d +2)-dimensional scalar 5-point function in addition to the usual scalar basis of 1- to 4-point functions in the generic dimension d=4-2{epsilon}. When exploiting the four-dimensionality of the kinematics, this basis is sufficient. We indicate how the (d+2)-dimensional 5-point function can be evaluated. (orig.)

  7. New results for algebraic tensor reduction of Feynman integrals

    Fleischer, Jochem; Yundin, Valery

    2012-02-01

    We report on some recent developments in algebraic tensor reduction of one-loop Feynman integrals. For 5-point functions, an efficient tensor reduction was worked out recently and is now available as numerical C++ package, PJFry, covering tensor ranks until five. It is free of inverse 5- point Gram determinants and inverse small 4-point Gram determinants are treated by expansions in higher-dimensional 3-point functions. By exploiting sums over signed minors, weighted with scalar products of chords (or, equivalently, external momenta), extremely efficient expressions for tensor integrals contracted with external momenta were derived. The evaluation of 7-point functions is discussed. In the present approach one needs for the reductions a (d +2)-dimensional scalar 5-point function in addition to the usual scalar basis of 1- to 4-point functions in the generic dimension d=4-2ε. When exploiting the four-dimensionality of the kinematics, this basis is sufficient. We indicate how the (d+2)-dimensional 5-point function can be evaluated. (orig.)

  8. Algebra

    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.

  9. Groups, matrices, and vector spaces a group theoretic approach to linear algebra

    Carrell, James B

    2017-01-01

    This unique text provides a geometric approach to group theory and linear algebra, bringing to light the interesting ways in which these subjects interact. Requiring few prerequisites beyond understanding the notion of a proof, the text aims to give students a strong foundation in both geometry and algebra. Starting with preliminaries (relations, elementary combinatorics, and induction), the book then proceeds to the core topics: the elements of the theory of groups and fields (Lagrange's Theorem, cosets, the complex numbers and the prime fields), matrix theory and matrix groups, determinants, vector spaces, linear mappings, eigentheory and diagonalization, Jordan decomposition and normal form, normal matrices, and quadratic forms. The final two chapters consist of a more intensive look at group theory, emphasizing orbit stabilizer methods, and an introduction to linear algebraic groups, which enriches the notion of a matrix group. Applications involving symm etry groups, determinants, linear coding theory ...

  10. The Hilbert polynomial and linear forms in the logarithms of algebraic numbers

    Aleksentsev, Yu M

    2008-01-01

    We prove a new estimate for homogeneous linear forms with integer coefficients in the logarithms of algebraic numbers. We obtain a qualitative improvement of the estimate depending on the coefficients of the linear form and the best value of the constant in the estimate in the case when the number of logarithms is not too large

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

    Man, Yiu-Kwong

    2010-01-01

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

  12. SUPPORTING STUDENTS’ UNDERSTANDING OF LINEAR EQUATIONS WITH ONE VARIABLE USING ALGEBRA TILES

    Sari Saraswati

    2016-01-01

    Full Text Available This research aimed to describe how algebra tiles can support students’ understanding of linear equations with one variable. This article is a part of a larger research on learning design of linear equations with one variable using algebra tiles combined with balancing method. Therefore, it will merely discuss one activity focused on how students use the algebra tiles to find a method to solve linear equations with one variable. Design research was used as an approach in this study. It consists of three phases, namely preliminary design, teaching experiment and retrospective analysis. Video registrations, students’ written works, pre-test, post-test, field notes, and interview are technic to collect data. The data were analyzed by comparing the hypothetical learning trajectory (HLT and the actual learning process. The result shows that algebra tiles could supports students’ understanding to find the formal solution of linear equation with one variable.Keywords: linear equation with one variable, algebra tiles, design research, balancing method, HLT DOI: http://dx.doi.org/10.22342/jme.7.1.2814.19-30

  13. Algebra

    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

  14. Matrix Operations for Engineers and Scientists An Essential Guide in Linear Algebra

    Jeffrey, Alan

    2010-01-01

    Engineers and scientists need to have an introduction to the basics of linear algebra in a context they understand. Computer algebra systems make the manipulation of matrices and the determination of their properties a simple matter, and in practical applications such software is often essential. However, using this tool when learning about matrices, without first gaining a proper understanding of the underlying theory, limits the ability to use matrices and to apply them to new problems. This book explains matrices in the detail required by engineering or science students, and it discusses linear systems of ordinary differential equations. These students require a straightforward introduction to linear algebra illustrated by applications to which they can relate. It caters of the needs of undergraduate engineers in all disciplines, and provides considerable detail where it is likely to be helpful. According to the author the best way to understand the theory of matrices is by working simple exercises designe...

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

  16. Chiropractic biophysics technique: a linear algebra approach to posture in chiropractic.

    Harrison, D D; Janik, T J; Harrison, G R; Troyanovich, S; Harrison, D E; Harrison, S O

    1996-10-01

    This paper discusses linear algebra as applied to human posture in chiropractic, specifically chiropractic biophysics technique (CBP). Rotations, reflections and translations are geometric functions studied in vector spaces in linear algebra. These mathematical functions are termed rigid body transformations and are applied to segmental spinal movement in the literature. Review of the literature indicates that these linear algebra concepts have been used to describe vertebral motion. However, these rigid body movers are presented here as applying to the global postural movements of the head, thoracic cage and pelvis. The unique inverse functions of rotations, reflections and translations provide a theoretical basis for making postural corrections in neutral static resting posture. Chiropractic biophysics technique (CBP) uses these concepts in examination procedures, manual spinal manipulation, instrument assisted spinal manipulation, postural exercises, extension traction and clinical outcome measures.

  17. On the completeness of the canonical reductions from Kac-Moody to W-algebras

    McGlinn, W.

    1997-01-01

    We study the question as to whether the canonical reductions of Kac-Moody (KM) algebras to W-algebras are exhaustive. We first review and consolidate previous results. In particular we show that, apart from the two lowest grades, the canonical reductions are the only ones that respect the physically reasonable requirement that the W-algebra have no negative conformal weights. We then break new ground by formulating a condition that the W-algebra be differential polynomial. We apply the condition that the W-algebra be polynomial (in a particular gauge) and primary to the groups SL(N,R) with integral SL(2,R) embeddings. We find that, subject to some reasonable technical assumptions, the canonical reductions are exhaustive (except possibly at grade one). The derivation suggests that similar results hold for the other classes of simple groups. (orig.)

  18. Advanced topics in linear algebra weaving matrix problems through the Weyr form

    O'Meara, Kevin; Vinsonhaler, Charles

    2011-01-01

    The Weyr matrix canonical form is a largely unknown cousin of the Jordan canonical form. Discovered by Eduard Weyr in 1885, the Weyr form outperforms the Jordan form in a number of mathematical situations, yet it remains somewhat of a mystery, even to many who are skilled in linear algebra. Written in an engaging style, this book presents various advanced topics in linear algebra linked through the Weyr form. Kevin O'Meara, John Clark, and Charles Vinsonhaler develop the Weyr form from scratch and include an algorithm for computing it. A fascinating duality exists between the Weyr form and the

  19. Direct estimation of elements of quantum states algebra and entanglement detection via linear contractions

    Horodecki, Pawel

    2003-01-01

    Possibility of some nonlinear-like operations in quantum mechanics are studied. Some general formula for real linear maps are derived. With the results we show how to perform physically separability tests based on any linear contraction (on product states) that either is real or Hermitian. We also show how to estimate either product or linear combinations of quantum states without knowledge about the states themselves. This can be viewed as a sort of quantum computing on quantum states algebra

  20. Algebraic reduction of the 't Hooft-Polyakov monopole to the Dirac monopole

    Landi, G.; Marmo, G.

    1988-01-01

    In the context of the algebraic description of gauge fields by means of extensions of Lie algebras considered in previous articles by the authors, we define the notion of reduction of an extension of Lie algebras. Given a connection we define the holonomy algebra and the holonomy sequence of the connection and we prove that it is always possible to reduce the extension we start with to the holonomy sequence of the connection. As an example we construct a 't Hooft-Polyakov-like extension of algebras and reduce it to the extension which describes the Dirac monopole as discussed in a previous paper by the authors. The supersymmetric version of all results is obtained by replacing ordinary Lie algebras with Lie superalgebras. (orig.)

  1. On symmetry reduction and exact solutions of the linear one-dimensional Schroedinger equation

    Barannik, L.L.

    1996-01-01

    Symmetry reduction of the Schroedinger equation with potential is carried out on subalgebras of the Lie algebra which is the direct sum of the special Galilei algebra and one-dimensional algebra. Some new exact solutions are obtained

  2. Energy footprint of advanced dense numerical linear algebra using tile algorithms on multicore architectures

    Dongarra, Jack; Ltaief, Hatem; Luszczek, Piotr R.; Weaver, Vincent M.

    2012-01-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.

  3. Energy footprint of advanced dense numerical linear algebra using tile algorithms on multicore architectures

    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.

  4. Causal structure and algebraic classification of non-dissipative linear optical media

    Schuller, Frederic P.; Witte, Christof; Wohlfarth, Mattias N.R.

    2010-01-01

    In crystal optics and quantum electrodynamics in gravitational vacua, the propagation of light is not described by a metric, but an area metric geometry. In this article, this prompts us to study conditions for linear electrodynamics on area metric manifolds to be well-posed. This includes an identification of the timelike future cones and their duals associated to an area metric geometry, and thus paves the ground for a discussion of the related local and global causal structures in standard fashion. In order to provide simple algebraic criteria for an area metric manifold to present a consistent spacetime structure, we develop a complete algebraic classification of area metric tensors up to general transformations of frame. This classification, valuable in its own right, is then employed to prove a theorem excluding the majority of algebraic classes of area metrics as viable spacetimes. Physically, these results classify and drastically restrict the viable constitutive tensors of non-dissipative linear optical media.

  5. Real forms of non-linear superconformal and quasi-superconformal algebras and their unified realization

    Bina, B.; Guenaydin, M.

    1997-01-01

    We give a complete classification of the real forms of simple non-linear superconformal algebras (SCA) and quasi-superconformal algebras (QSCA) and present a unified realization of these algebras with simple symmetry groups. This classification is achieved by establishing a correspondence between simple non-linear QSCA's and SCA's and quaternionic and super-quaternionic symmetric spaces of simple Lie groups and Lie supergroups, respectively. The unified realization we present involves a dimension zero scalar field (dilaton), dimension-1 symmetry currents, and dimension-1/2 free bosons for QSCA's and dimension-1/2 free fermions for SCA's. The free bosons and fermions are associated with the quaternionic and super-quaternionic symmetric spaces of corresponding Lie groups and Lie supergroups, respectively. We conclude with a discussion of possible applications of our results. (orig.)

  6. The Analysis of the Grade of the Students' Understanding in "Linear Algebra" in National College of Technology

    中沢, 喜昌

    1989-01-01

    We gave linear algebra lessons to the fifth grade students as an elective subject and analyzed that to what extent students understood the linear algebra, judging from the result of questionaires and tests. It showed that they are good at the problems accompanied by calculations such as inverse matrix, simultaneous linear equation, and proper value problem and that, on the contrary, it is difficult to understand the abstract notion like linear space and linear map.

  7. Algebra

    Sepanski, Mark R

    2010-01-01

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

  8. 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…

  9. Teaching Linear Algebra: Proceeding More Efficiently by Staying Comfortably within Z

    Beaver, Scott

    2015-01-01

    For efficiency in a linear algebra course the instructor may wish to avoid the undue arithmetical distractions of rational arithmetic. In this paper we explore how to write fraction-free problems of various types including elimination, matrix inverses, orthogonality, and the (non-normalizing) Gram-Schmidt process.

  10. Using Technology to Facilitate Reasoning: Lifting the Fog from Linear Algebra

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

    2008-01-01

    This article discusses student difficulties in grasping concepts from linear algebra. Using an example from an interview with a student, we propose changes that might positively impact student understanding of concepts within a problem-solving context. In particular, we illustrate barriers to student understanding and suggest technological…

  11. Student Reactions to Learning Theory Based Curriculum Materials in Linear Algebra--A Survey Analysis

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

    2016-01-01

    In this report we examine students' perceptions of the implementation of carefully designed curriculum materials (called modules) in linear algebra courses at three different universities. The curricular materials were produced collaboratively by STEM and mathematics education faculty as members of a professional learning community (PLC) over…

  12. An Example of Inquiry in Linear Algebra: The Roles of Symbolizing and Brokering

    Zandieh, Michelle; Wawro, Megan; Rasmussen, Chris

    2017-01-01

    In this paper we address practical questions such as: How do symbols appear and evolve in an inquiry-oriented classroom? How can an instructor connect students with traditional notation and vocabulary without undermining their sense of ownership of the material? We tender an example from linear algebra that highlights the roles of the instructor…

  13. A Modified Approach to Team-Based Learning in Linear Algebra Courses

    Nanes, Kalman M.

    2014-01-01

    This paper documents the author's adaptation of team-based learning (TBL), an active learning pedagogy developed by Larry Michaelsen and others, in the linear algebra classroom. The paper discusses the standard components of TBL and the necessary changes to those components for the needs of the course in question. There is also an empirically…

  14. Developing Conceptual Understanding and Definitional Clarity in Linear Algebra through the Three Worlds of Mathematical Thinking

    Hannah, John; Stewart, Sepideh; Thomas, Michael

    2016-01-01

    Linear algebra is one of the first abstract mathematics courses that students encounter at university. Research shows that many students find the dense presentation of definitions, theorems and proofs difficult to comprehend. Using a case study approach, we report on a teaching intervention based on Tall's three worlds (embodied, symbolic and…

  15. A Practical Approach to Inquiry-Based Learning in Linear Algebra

    Chang, J.-M.

    2011-01-01

    Linear algebra has become one of the most useful fields of mathematics since last decade, yet students still have trouble seeing the connection between some of the abstract concepts and real-world applications. In this article, we propose the use of thought-provoking questions in lesson designs to allow two-way communications between instructors…

  16. Mathematical Modelling in Engineering: A Proposal to Introduce Linear Algebra Concepts

    Cárcamo Bahamonde, Andrea; Gómez Urgelles, Joan; Fortuny Aymemí, Josep

    2016-01-01

    The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasise the development of mathematical abilities primarily associated with modelling and interpreting, which are not exclusively calculus abilities. Considering this, an instructional design was created based on mathematical modelling and…

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

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

    2017-01-01

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

  18. Advanced Linear Algebra: A Call for the Early Introduction of Complex Numbers

    Garcia, Stephan Ramon

    2017-01-01

    A second course in linear algebra that goes beyond the traditional lower-level curriculum is increasingly important for students of the mathematical sciences. Although many applications involve only real numbers, a solid understanding of complex arithmetic often sheds significant light. Many instructors are unaware of the opportunities afforded by…

  19. Mat-Rix-Toe: Improving Writing through a Game-Based Project in Linear Algebra

    Graham-Squire, Adam; Farnell, Elin; Stockton, Julianna Connelly

    2014-01-01

    The Mat-Rix-Toe project utilizes a matrix-based game to deepen students' understanding of linear algebra concepts and strengthen students' ability to express themselves mathematically. The project was administered in three classes using slightly different approaches, each of which included some editing component to encourage the…

  20. Principal Component Analysis: Resources for an Essential Application of Linear Algebra

    Pankavich, Stephen; Swanson, Rebecca

    2015-01-01

    Principal Component Analysis (PCA) is a highly useful topic within an introductory Linear Algebra course, especially since it can be used to incorporate a number of applied projects. This method represents an essential application and extension of the Spectral Theorem and is commonly used within a variety of fields, including statistics,…

  1. Non-commutative linear algebra and plurisubharmonic functions of quaternionic variables

    Alesker, Semyon

    2003-01-01

    We recall known and establish new properties of the Dieudonn\\'e and Moore determinants of quaternionic matrices.Using these linear algebraic results we develop a basic theory of plurisubharmonic functions of quaternionic variables. Then we introduce and briefly discuss quaternionic Monge-Amp\\'ere equations.

  2. Visual, Algebraic and Mixed Strategies in Visually Presented Linear Programming Problems.

    Shama, Gilli; Dreyfus, Tommy

    1994-01-01

    Identified and classified solution strategies of (n=49) 10th-grade students who were presented with linear programming problems in a predominantly visual setting in the form of a computerized game. Visual strategies were developed more frequently than either algebraic or mixed strategies. Appendix includes questionnaires. (Contains 11 references.)…

  3. Subspace in Linear Algebra: Investigating Students' Concept Images and Interactions with the Formal Definition

    Wawro, Megan; Sweeney, George F.; Rabin, Jeffrey M.

    2011-01-01

    This paper reports on a study investigating students' ways of conceptualizing key ideas in linear algebra, with the particular results presented here focusing on student interactions with the notion of subspace. In interviews conducted with eight undergraduates, we found students' initial descriptions of subspace often varied substantially from…

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

    Gasyna, Zbigniew L.

    2008-01-01

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

  5. Space and frequency-multiplexed optical linear algebra processor - Fabrication and initial tests

    Casasent, D.; Jackson, J.

    1986-01-01

    A new optical linear algebra processor architecture is described. Space and frequency-multiplexing are used to accommodate bipolar and complex-valued data. A fabricated laboratory version of this processor is described, the electronic support system used is discussed, and initial test data obtained on it are presented.

  6. Student Connections of Linear Algebra Concepts: An Analysis of Concept Maps

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

    2010-01-01

    This article examines the connections of linear algebra concepts in a first course at the undergraduate level. The theoretical underpinnings of this study are grounded in the constructivist perspective (including social constructivism), Vernaud's theory of conceptual fields and Pirie and Kieren's model for the growth of mathematical understanding.…

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

    Quesada, Antonio R.

    2003-01-01

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

  8. Thirty-three miniatures mathematical and algorithmic applications of linear algebra

    Matousek, Jiří

    2010-01-01

    This volume contains a collection of clever mathematical applications of linear algebra, mainly in combinatorics, geometry, and algorithms. Each chapter covers a single main result with motivation and full proof in at most ten pages and can be read independently of all other chapters (with minor exceptions), assuming only a modest background in linear algebra. The topics include a number of well-known mathematical gems, such as Hamming codes, the matrix-tree theorem, the Lov�sz bound on the Shannon capacity, and a counterexample to Borsuk's conjecture, as well as other, perhaps less popular but similarly beautiful results, e.g., fast associativity testing, a lemma of Steinitz on ordering vectors, a monotonicity result for integer partitions, or a bound for set pairs via exterior products. The simpler results in the first part of the book provide ample material to liven up an undergraduate course of linear algebra. The more advanced parts can be used for a graduate course of linear-algebraic methods or for s...

  9. Profiling high performance dense linear algebra algorithms on multicore architectures for power and energy efficiency

    Ltaief, Hatem; Luszczek, Piotr R.; Dongarra, Jack

    2011-01-01

    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

  10. Regular Riemann-Hilbert transforms, Baecklund transformations and hidden symmetry algebra for some linearization systems

    Chau Ling-Lie; Ge Mo-Lin; Teh, Rosy.

    1984-09-01

    The Baecklund Transformations and the hidden symmetry algebra for Self-Dual Yang-Mills Equations, Landau-Lifshitz equations and the Extended Super Yang-Mills fields (N>2) are discussed on the base of the Regular Riemann-Hilbert Transform and the linearization equations. (author)

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

  12. Individual and Collective Analyses of the Genesis of Student Reasoning Regarding the Invertible Matrix Theorem in Linear Algebra

    Wawro, Megan Jean

    2011-01-01

    In this study, I considered the development of mathematical meaning related to the Invertible Matrix Theorem (IMT) for both a classroom community and an individual student over time. In this particular linear algebra course, the IMT was a core theorem in that it connected many concepts fundamental to linear algebra through the notion of…

  13. Lectures on algebraic system theory: Linear systems over rings

    Kamen, E. W.

    1978-01-01

    The presentation centers on four classes of systems that can be treated as linear systems over a ring. These are: (1) discrete-time systems over a ring of scalars such as the integers; (2) continuous-time systems containing time delays; (3) large-scale discrete-time systems; and (4) time-varying discrete-time systems.

  14. Non-linear singular problems in p-adic analysis: associative algebras of p-adic distributions

    Albeverio, S; Khrennikov, A Yu; Shelkovich, V M

    2005-01-01

    We propose an algebraic theory which can be used for solving both linear and non-linear singular problems of p-adic analysis related to p-adic distributions (generalized functions). We construct the p-adic Colombeau-Egorov algebra of generalized functions, in which Vladimirov's pseudo-differential operator plays the role of differentiation. This algebra is closed under Fourier transformation and associative convolution. Pointvalues of generalized functions are defined, and it turns out that any generalized function is uniquely determined by its pointvalues. We also construct an associative algebra of asymptotic distributions, which is generated by the linear span of the set of associated homogeneous p-adic distributions. This algebra is embedded in the Colombeau-Egorov algebra as a subalgebra. In addition, a new technique for constructing weak asymptotics is developed

  15. The Effect of Using Concept Maps in Elementary Linear Algebra Course on Students’ Learning

    Syarifuddin, H.

    2018-04-01

    This paper presents the results of a classroom action research that was done in Elementary Linear Algebra course at Universitas Negeri Padang. The focus of the research want to see the effect of using concept maps in the course on students’ learning. Data in this study were collected through classroom observation, students’ reflective journal and concept maps that were created by students. The result of the study was the using of concept maps in Elementary Linera Algebra course gave positive effect on students’ learning.

  16. Exploring linear algebra labs and projects with Mathematica

    Arangala, Crista

    2014-01-01

    Matrix Operations Lab 0: An Introduction to Mathematica Lab 1: Matrix Basics and Operations Lab 2: A Matrix Representation of Linear Systems Lab 3: Powers, Inverses, and Special Matrices Lab 4: Graph Theory and Adjacency Matrices Lab 5: Permutations and Determinants Lab 6: 4 x 4 Determinants and Beyond Project Set 1 Invertibility Lab 7: Singular or Nonsingular? Why Singularity Matters Lab 8: Mod It Out, Matrices with Entries in ZpLab 9: It's a Complex World Lab 10: Declaring Independence: Is It Linear? Project Set 2 Vector Spaces Lab 11: Vector Spaces and SubspacesLab 12: Basing It All on Just a Few Vectors Lab 13: Linear Transformations Lab 14: Eigenvalues and Eigenspaces Lab 15: Markov Chains, An Application of Eigenvalues Project Set 3 Orthogonality Lab 16: Inner Product Spaces Lab 17: The Geometry of Vector and Inner Product SpacesLab 18: Orthogonal Matrices, QR Decomposition, and Least Squares Regression Lab 19: Symmetric Matrices and Quadratic Forms Project Set 4 Matrix Decomposition with Applications L...

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

    Jan Awrejcewicz

    2004-01-01

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

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

    Caglayan, Günhan

    2018-05-01

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

  19. Ghost field realizations of the spinor $W_{2,s}$ strings based on the linear W(1,2,s) algebras

    Liu, Yu-Xiao; Zhang, Li-Jie; Ren, Ji-Rong

    2005-01-01

    It has been shown that certain W algebras can be linearized by the inclusion of a spin-1 current. This Provides a way of obtaining new realizations of the W algebras. In this paper, we investigate the new ghost field realizations of the W(2,s)(s=3,4) algebras, making use of the fact that these two algebras can be linearized. We then construct the nilpotent BRST charges of the spinor non-critical W(2,s) strings with these new realizations.

  20. Ghost field realizations of the spinor W2,s strings based on the linear W1,2,s algebras

    Liu Yuxiao; Ren Jirong; Zhang Lijie

    2005-01-01

    It has been shown that certain W algebras can be linearized by the inclusion of a spin-1 current. This provides a way of obtaining new realizations of the W algebras. In this paper, we investigate the new ghost field realizations of the W 2,s (s=3,4) algebras, making use of the fact that these two algebras can be linearized. We then construct the nilpotent BRST charges of the spinor non-critical W 2,s strings with these new realizations. (author)

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

    Ghosh, A

    1988-08-01

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

  2. Algebraic Properties of First Integrals for Scalar Linear Third-Order ODEs of Maximal Symmetry

    K. S. Mahomed

    2013-01-01

    Full Text Available By use of the Lie symmetry group methods we analyze the relationship between the first integrals of the simplest linear third-order ordinary differential equations (ODEs and their point symmetries. It is well known that there are three classes of linear third-order ODEs for maximal cases of point symmetries which are 4, 5, and 7. The simplest scalar linear third-order equation has seven-point symmetries. We obtain the classifying relation between the symmetry and the first integral for the simplest equation. It is shown that the maximal Lie algebra of a first integral for the simplest equation y′′′=0 is unique and four-dimensional. Moreover, we show that the Lie algebra of the simplest linear third-order equation is generated by the symmetries of the two basic integrals. We also obtain counting theorems of the symmetry properties of the first integrals for such linear third-order ODEs. Furthermore, we provide insights into the manner in which one can generate the full Lie algebra of higher-order ODEs of maximal symmetry from two of their basic integrals.

  3. Sensitivity theory for general non-linear algebraic equations with constraints

    Oblow, E.M.

    1977-04-01

    Sensitivity theory has been developed to a high state of sophistication for applications involving solutions of the linear Boltzmann equation or approximations to it. The success of this theory in the field of radiation transport has prompted study of possible extensions of the method to more general systems of non-linear equations. Initial work in the U.S. and in Europe on the reactor fuel cycle shows that the sensitivity methodology works equally well for those non-linear problems studied to date. The general non-linear theory for algebraic equations is summarized and applied to a class of problems whose solutions are characterized by constrained extrema. Such equations form the basis of much work on energy systems modelling and the econometrics of power production and distribution. It is valuable to have a sensitivity theory available for these problem areas since it is difficult to repeatedly solve complex non-linear equations to find out the effects of alternative input assumptions or the uncertainties associated with predictions of system behavior. The sensitivity theory for a linear system of algebraic equations with constraints which can be solved using linear programming techniques is discussed. The role of the constraints in simplifying the problem so that sensitivity methodology can be applied is highlighted. The general non-linear method is summarized and applied to a non-linear programming problem in particular. Conclusions are drawn in about the applicability of the method for practical problems

  4. On the linearization of nonlinear supersymmetry based on the commutator algebra

    Tsuda, Motomu, E-mail: tsuda@sit.ac.jp

    2017-01-10

    We discuss a linearization procedure of nonlinear supersymmetry (NLSUSY) based on the closure of the commutator algebra for variations of functionals of Nambu–Goldstone fermions and their derivative terms under NLSUSY transformations in Volkov–Akulov NLSUSY theory. In the case of a set of bosonic and fermionic functionals, which leads to (massless) vector linear supermultiplets, we explicitly show that general linear SUSY transformations of basic components defined from those functionals are uniquely determined by examining the commutation relation in the NLSUSY theory.

  5. Batched Triangular Dense Linear Algebra Kernels for Very Small Matrix Sizes on GPUs

    Charara, Ali; Keyes, David E.; Ltaief, Hatem

    2017-01-01

    Batched dense linear algebra kernels are becoming ubiquitous in scientific applications, ranging from tensor contractions in deep learning to data compression in hierarchical low-rank matrix approximation. Within a single API call, these kernels are capable of simultaneously launching up to thousands of similar matrix computations, removing the expensive overhead of multiple API calls while increasing the occupancy of the underlying hardware. A challenge is that for the existing hardware landscape (x86, GPUs, etc.), only a subset of the required batched operations is implemented by the vendors, with limited support for very small problem sizes. We describe the design and performance of a new class of batched triangular dense linear algebra kernels on very small data sizes using single and multiple GPUs. By deploying two-sided recursive formulations, stressing the register usage, maintaining data locality, reducing threads synchronization and fusing successive kernel calls, the new batched kernels outperform existing state-of-the-art implementations.

  6. Near-infrared reflectance analysis by Gauss-Jordan linear algebra

    Honigs, D.E.; Freelin, J.M.; Hieftje, G.M.; Hirschfeld, T.B.

    1983-01-01

    Near-infrared reflectance analysis is an analytical technique that uses the near-infrared diffuse reflectance of a sample at several discrete wavelengths to predict the concentration of one or more of the chemical species in that sample. However, because near-infrared bands from solid samples are both abundant and broad, the reflectance at a given wavelength usually contains contributions from several sample components, requiring extensive calculations on overlapped bands. In the present study, these calculations have been performed using an approach similar to that employed in multi-component spectrophotometry, but with Gauss-Jordan linear algebra serving as the computational vehicle. Using this approach, correlations for percent protein in wheat flour and percent benzene in hydrocarbons have been obtained and are evaluated. The advantages of a linear-algebra approach over the common one employing stepwise regression are explored

  7. Linear-algebraic approach to electron-molecule collisions: General formulation

    Collins, L.A.; Schneider, B.I.

    1981-01-01

    We present a linear-algebraic approach to electron-molecule collisions based on an integral equations form with either logarithmic or asymptotic boundary conditions. The introduction of exchange effects does not alter the basic form or order of the linear-algebraic equations for a local potential. In addition to the standard procedure of directly evaluating the exchange integrals by numerical quadrature, we also incorporate exchange effects through a separable-potential approximation. Efficient schemes are developed for reducing the number of points and channels that must be included. The method is applied at the static-exchange level to a number of molecular systems including H 2 , N 2 , LiH, and CO 2

  8. Batched Triangular Dense Linear Algebra Kernels for Very Small Matrix Sizes on GPUs

    Charara, Ali

    2017-03-06

    Batched dense linear algebra kernels are becoming ubiquitous in scientific applications, ranging from tensor contractions in deep learning to data compression in hierarchical low-rank matrix approximation. Within a single API call, these kernels are capable of simultaneously launching up to thousands of similar matrix computations, removing the expensive overhead of multiple API calls while increasing the occupancy of the underlying hardware. A challenge is that for the existing hardware landscape (x86, GPUs, etc.), only a subset of the required batched operations is implemented by the vendors, with limited support for very small problem sizes. We describe the design and performance of a new class of batched triangular dense linear algebra kernels on very small data sizes using single and multiple GPUs. By deploying two-sided recursive formulations, stressing the register usage, maintaining data locality, reducing threads synchronization and fusing successive kernel calls, the new batched kernels outperform existing state-of-the-art implementations.

  9. The algebraic-hyperbolic approach to the linearized gravitational constraints on a Minkowski background

    Winicour, Jeffrey

    2017-01-01

    An algebraic-hyperbolic method for solving the Hamiltonian and momentum constraints has recently been shown to be well posed for general nonlinear perturbations of the initial data for a Schwarzschild black hole. This is a new approach to solving the constraints of Einstein’s equations which does not involve elliptic equations and has potential importance for the construction of binary black hole data. In order to shed light on the underpinnings of this approach, we consider its application to obtain solutions of the constraints for linearized perturbations of Minkowski space. In that case, we find the surprising result that there are no suitable Cauchy hypersurfaces in Minkowski space for which the linearized algebraic-hyperbolic constraint problem is well posed. (note)

  10. GPU TECHNOLOGIES EMBODIED IN PARALLEL SOLVERS OF LINEAR ALGEBRAIC EQUATION SYSTEMS

    Sidorov Alexander Vladimirovich

    2012-10-01

    Full Text Available The author reviews existing shareware solvers that are operated by graphical computer devices. The purpose of this review is to explore the opportunities and limitations of the above parallel solvers applicable for resolution of linear algebraic problems that arise at Research and Educational Centre of Computer Modeling at MSUCE, and Research and Engineering Centre STADYO. The author has explored new applications of the GPU in the PETSc suite and compared them with the results generated absent of the GPU. The research is performed within the CUSP library developed to resolve the problems of linear algebra through the application of GPU. The author has also reviewed the new MAGMA project which is analogous to LAPACK for the GPU.

  11. The universal C*-algebra of the electromagnetic field II. Topological charges and spacelike linear fields

    Buchholz, Detlev; Ciolli, Fabio; Ruzzi, Giuseppe; Vasselli, Ezio

    2017-02-01

    Conditions for the appearance of topological charges are studied in the framework of the universal C*-algebra of the electromagnetic field, which is represented in any theory describing electromagnetism. It is shown that non-trivial topological charges, described by pairs of fields localised in certain topologically non-trivial spacelike separated regions, can appear in regular representations of the algebra only if the fields depend non-linearly on the mollifying test functions. On the other hand, examples of regular vacuum representations with non-trivial topological charges are constructed, where the underlying field still satisfies a weakened form of "spacelike linearity". Such representations also appear in the presence of electric currents. The status of topological charges in theories with several types of electromagnetic fields, which appear in the short distance (scaling) limit of asymptotically free non-abelian gauge theories, is also briefly discussed.

  12. Multi-Threaded Dense Linear Algebra Libraries for Low-Power Asymmetric Multicore Processors

    Catalán, Sandra; Herrero, José R.; Igual, Francisco D.; Rodríguez-Sánchez, Rafael; Quintana-Ortí, Enrique S.

    2015-01-01

    Dense linear algebra libraries, such as BLAS and LAPACK, provide a relevant collection of numerical tools for many scientific and engineering applications. While there exist high performance implementations of the BLAS (and LAPACK) functionality for many current multi-threaded architectures,the adaption of these libraries for asymmetric multicore processors (AMPs)is still pending. In this paper we address this challenge by developing an asymmetry-aware implementation of the BLAS, based on the...

  13. Many-core graph analytics using accelerated sparse linear algebra routines

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

    2016-05-01

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

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

    Sequi, W. T.

    1973-01-01

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

  15. The Effects of Formalism on Teacher Trainees' Algebraic and Geometric Interpretation of the Notions of Linear Dependency/Independency

    Ertekin, E.; Solak, S.; Yazici, E.

    2010-01-01

    The aim of this study is to identify the effects of formalism in teaching on primary and secondary school mathematics teacher trainees' algebraic and geometric interpretations of the notions of linear dependency/independency. Quantitative research methods are drawn in order to determine differences in success levels between algebraic and geometric…

  16. On the reduction of the degree of linear differential operators

    Bobieński, Marcin; Gavrilov, Lubomir

    2011-01-01

    Let L be a linear differential operator with coefficients in some differential field k of characteristic zero with algebraically closed field of constants. Let k a be the algebraic closure of k. For a solution y 0 , Ly 0 = 0, we determine the linear differential operator of minimal degree L-tilde and coefficients in k a , such that L-tilde y 0 =0. This result is then applied to some Picard–Fuchs equations which appear in the study of perturbations of plane polynomial vector fields of Lotka–Volterra type

  17. GPU Linear Algebra Libraries and GPGPU Programming for Accelerating MOPAC Semiempirical Quantum Chemistry Calculations.

    Maia, Julio Daniel Carvalho; Urquiza Carvalho, Gabriel Aires; Mangueira, Carlos Peixoto; Santana, Sidney Ramos; Cabral, Lucidio Anjos Formiga; Rocha, Gerd B

    2012-09-11

    In this study, we present some modifications in the semiempirical quantum chemistry MOPAC2009 code that accelerate single-point energy calculations (1SCF) of medium-size (up to 2500 atoms) molecular systems using GPU coprocessors and multithreaded shared-memory CPUs. Our modifications consisted of using a combination of highly optimized linear algebra libraries for both CPU (LAPACK and BLAS from Intel MKL) and GPU (MAGMA and CUBLAS) to hasten time-consuming parts of MOPAC such as the pseudodiagonalization, full diagonalization, and density matrix assembling. We have shown that it is possible to obtain large speedups just by using CPU serial linear algebra libraries in the MOPAC code. As a special case, we show a speedup of up to 14 times for a methanol simulation box containing 2400 atoms and 4800 basis functions, with even greater gains in performance when using multithreaded CPUs (2.1 times in relation to the single-threaded CPU code using linear algebra libraries) and GPUs (3.8 times). This degree of acceleration opens new perspectives for modeling larger structures which appear in inorganic chemistry (such as zeolites and MOFs), biochemistry (such as polysaccharides, small proteins, and DNA fragments), and materials science (such as nanotubes and fullerenes). In addition, we believe that this parallel (GPU-GPU) MOPAC code will make it feasible to use semiempirical methods in lengthy molecular simulations using both hybrid QM/MM and QM/QM potentials.

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

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

    2015-07-01

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

  19. Hopf-algebraic renormalization of QED in the linear covariant gauge

    Kißler, Henry, E-mail: kissler@physik.hu-berlin.de

    2016-09-15

    In the context of massless quantum electrodynamics (QED) with a linear covariant gauge fixing, the connection between the counterterm and the Hopf-algebraic approach to renormalization is examined. The coproduct formula of Green’s functions contains two invariant charges, which give rise to different renormalization group functions. All formulas are tested by explicit computations to third loop order. The possibility of a finite electron self-energy by fixing a generalized linear covariant gauge is discussed. An analysis of subdivergences leads to the conclusion that such a gauge only exists in quenched QED.

  20. A novel algebraic procedure for solving non-linear evolution equations of higher order

    Huber, Alfred

    2007-01-01

    We report here a systematic approach that can easily be used for solving non-linear partial differential equations (nPDE), especially of higher order. We restrict the analysis to the so called evolution equations describing any wave propagation. The proposed new algebraic approach leads us to traveling wave solutions and moreover, new class of solution can be obtained. The crucial step of our method is the basic assumption that the solutions satisfy an ordinary differential equation (ODE) of first order that can be easily integrated. The validity and reliability of the method is tested by its application to some non-linear evolution equations. The important aspect of this paper however is the fact that we are able to calculate distinctive class of solutions which cannot be found in the current literature. In other words, using this new algebraic method the solution manifold is augmented to new class of solution functions. Simultaneously we would like to stress the necessity of such sophisticated methods since a general theory of nPDE does not exist. Otherwise, for practical use the algebraic construction of new class of solutions is of fundamental interest

  1. MODELING IN MAPLE AS THE RESEARCHING MEANS OF FUNDAMENTAL CONCEPTS AND PROCEDURES IN LINEAR ALGEBRA

    Vasil Kushnir

    2016-05-01

    Full Text Available The article is devoted to binary technology and "fundamental training technology." Binary training refers to the simultaneous teaching of mathematics and computer science, for example differential equations and Maple, linear algebra and Maple. Moreover the system of traditional course of Maple is not performed. The use of the opportunities of Maple-technology in teaching mathematics is based on the following fundamental concepts of computer science as an algorithm, program, a linear program, cycle, branching, relative operators, etc. That’s why only a certain system of command operators in Maple is considered. They are necessary for fundamental concepts of linear algebra and differential equations studying in Maple-environment. Relative name - "the technology of fundamental training" reflects the study of fundamental mathematical concepts and procedures that express the properties of these concepts in Maple-environment. This article deals with the study of complex fundamental concepts of linear algebra (determinant of the matrix and algorithm of its calculation, the characteristic polynomial of the matrix and the eigenvalues of matrix, canonical form of characteristic matrix, eigenvectors of matrix, elementary divisors of the characteristic matrix, etc., which are discussed in the appropriate courses briefly enough, and sometimes are not considered at all, but they are important in linear systems of differential equations, asymptotic methods for solving differential equations, systems of linear equations. Herewith complex and voluminous procedures of finding of these linear algebra concepts embedded in Maple can be performed as a result of a simple command-operator. Especially important issue is building matrix to canonical form. In fact matrix functions are effectively reduced to the functions of the diagonal matrix or matrix in Jordan canonical form. These matrices are used to rise a square matrix to a power, to extract the roots of the n

  2. State Space Reduction of Linear Processes using Control Flow Reconstruction

    van de Pol, Jan Cornelis; Timmer, Mark

    2009-01-01

    We present a new method for fighting the state space explosion of process algebraic specifications, by performing static analysis on an intermediate format: linear process equations (LPEs). Our method consists of two steps: (1) we reconstruct the LPE's control flow, detecting control flow parameters

  3. State Space Reduction of Linear Processes Using Control Flow Reconstruction

    van de Pol, Jan Cornelis; Timmer, Mark; Liu, Zhiming; Ravn, Anders P.

    2009-01-01

    We present a new method for fighting the state space explosion of process algebraic specifications, by performing static analysis on an intermediate format: linear process equations (LPEs). Our method consists of two steps: (1) we reconstruct the LPE's control flow, detecting control flow parameters

  4. An algebraic fractional order differentiator for a class of signals satisfying a linear differential equation

    Liu, Da-Yan; Tian, Yang; Boutat, Driss; Laleg-Kirati, Taous-Meriem

    2015-01-01

    This paper aims at designing a digital fractional order differentiator for a class of signals satisfying a linear differential equation to estimate fractional derivatives with an arbitrary order in noisy case, where the input can be unknown or known with noises. Firstly, an integer order differentiator for the input is constructed using a truncated Jacobi orthogonal series expansion. Then, a new algebraic formula for the Riemann-Liouville derivative is derived, which is enlightened by the algebraic parametric method. Secondly, a digital fractional order differentiator is proposed using a numerical integration method in discrete noisy case. Then, the noise error contribution is analyzed, where an error bound useful for the selection of the design parameter is provided. Finally, numerical examples illustrate the accuracy and the robustness of the proposed fractional order differentiator.

  5. An algebraic fractional order differentiator for a class of signals satisfying a linear differential equation

    Liu, Da-Yan

    2015-04-30

    This paper aims at designing a digital fractional order differentiator for a class of signals satisfying a linear differential equation to estimate fractional derivatives with an arbitrary order in noisy case, where the input can be unknown or known with noises. Firstly, an integer order differentiator for the input is constructed using a truncated Jacobi orthogonal series expansion. Then, a new algebraic formula for the Riemann-Liouville derivative is derived, which is enlightened by the algebraic parametric method. Secondly, a digital fractional order differentiator is proposed using a numerical integration method in discrete noisy case. Then, the noise error contribution is analyzed, where an error bound useful for the selection of the design parameter is provided. Finally, numerical examples illustrate the accuracy and the robustness of the proposed fractional order differentiator.

  6. Discrete Fourier and wavelet transforms an introduction through linear algebra with applications to signal processing

    Goodman, Roe W

    2016-01-01

    This textbook for undergraduate mathematics, science, and engineering students introduces the theory and applications of discrete Fourier and wavelet transforms using elementary linear algebra, without assuming prior knowledge of signal processing or advanced analysis.It explains how to use the Fourier matrix to extract frequency information from a digital signal and how to use circulant matrices to emphasize selected frequency ranges. It introduces discrete wavelet transforms for digital signals through the lifting method and illustrates through examples and computer explorations how these transforms are used in signal and image processing. Then the general theory of discrete wavelet transforms is developed via the matrix algebra of two-channel filter banks. Finally, wavelet transforms for analog signals are constructed based on filter bank results already presented, and the mathematical framework of multiresolution analysis is examined.

  7. Fiber-wise linear Poisson structures related to W∗-algebras

    Odzijewicz, Anatol; Jakimowicz, Grzegorz; Sliżewska, Aneta

    2018-01-01

    In the framework of Banach differential geometry we investigate the fiber-wise linear Poisson structures as well as the Lie groupoid and Lie algebroid structures which are defined in the canonical way by the structure of a W∗-algebra (von Neumann algebra) M. The main role in this theory is played by the complex Banach-Lie groupoid G(M) ⇉ L(M) of partially invertible elements of M over the lattice L(M) of orthogonal projections of M. The Atiyah sequence and the predual Atiyah sequence corresponding to this groupoid are investigated from the point of view of Banach Poisson geometry. In particular we show that the predual Atiyah sequence fits in a short exact sequence of complex Banach sub-Poisson V B-groupoids with G(M) ⇉ L(M) as the side groupoid.

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

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

    1998-01-01

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

  9. Linear representation of algebras with non-associative operations which are satisfy in the balanced functional equations

    Ehsani, Amir

    2015-01-01

    Algebras with a pair of non-associative binary operations (f, g) which are satisfy in the balanced quadratic functional equations with four object variables considered. First, we obtain a linear representation for the operations, of this kind of binary algebras (A,f,g), over an abelian group (A, +) and then we generalize the linear representation of operations, to an algebra (A,F) with non-associative binary operations which are satisfy in the balanced quadratic functional equations with four object variables. (paper)

  10. An algebraic method for system reduction of stationary Gaussian systems

    D. Jibetean; J.H. van Schuppen (Jan)

    2003-01-01

    textabstractSystem identification for a particular approach reduces to system reduction, determining for a system with a high state-space dimension a system of low state-space dimension. For Gaussian systems the problem of system reduction is considered with the divergence rate criterion. The

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

    Whiteley, Richard V., Jr.

    2015-01-01

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

  12. Monomial algebras

    Villarreal, Rafael

    2015-01-01

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

  13. Linear-algebraic approach to electronic excitation of atoms and molecules by electron impact

    Collins, L.A.; Schneider, B.I.

    1983-01-01

    A linear-algebraic method, based on an integral equations formulation, is applied to the excitation of atoms and molecules by electron impact. Various schemes are devised for treating the one-electron terms that sometimes cause instabilities when directly incorporated into the solution matrix. These include introducing Lagrange undetermined multipliers and correlation terms. Good agreement between the method and other computational techniques is obtained for electron scattering for hydrogenic and Li-like atomic ions and for H 2 + in two- to five-state close-coupling calculations

  14. Electronic excitation of atoms and molecules by electron impact in a linear algebraic, separable potential approach

    Collins, L.A.; Schneider, B.I.

    1984-01-01

    The linear algebraic, separable potential approach is applied to the electronic excitation of atoms and molecules by electron impact. By representing the exchange and off-diagonal direct terms on a basis, the standard set of coupled inelastic equations is reduced to a set of elastic inhomogeneous equations. The procedure greatly simplifies the formulation by allowing a large portion of the problem to be handled by standard bound-state techniques and by greatly reducing the order of the scattering equations that must be solved. Application is made to the excitation of atomic hydrogen in the three-state close-coupling (1s, 2s, 2p) approximation. (author)

  15. Fast and Elegant Numerical Linear Algebra Using the RcppEigen Package

    Douglas Bates

    2013-01-01

    Full Text Available The RcppEigen package provides access from R (R Core Team 2012a to the Eigen (Guennebaud, Jacob, and others 2012 C++ template library for numerical linear algebra. Rcpp (Eddelbuettel and François 2011, 2012 classes and specializations of the C++ templated functions as and wrap from Rcpp provide the "glue" for passing objects from R to C++ and back. Several introductory examples are presented. This is followed by an in-depth discussion of various available approaches for solving least-squares problems, including rank-revealing methods, concluding with an empirical run-time comparison. Last but not least, sparse matrix methods are discussed.

  16. JTpack90: A parallel, object-based, Fortran 90 linear algebra package

    Turner, J.A.; Kothe, D.B. [Los Alamos National Lab., NM (United States); Ferrell, R.C. [Cambridge Power Computing Associates, Ltd., Brookline, MA (United States)

    1997-03-01

    The authors have developed an object-based linear algebra package, currently with emphasis on sparse Krylov methods, driven primarily by needs of the Los Alamos National Laboratory parallel unstructured-mesh casting simulation tool Telluride. Support for a number of sparse storage formats, methods, and preconditioners have been implemented, driven primarily by application needs. They describe the object-based Fortran 90 approach, which enhances maintainability, performance, and extensibility, the parallelization approach using a new portable gather/scatter library (PGSLib), current capabilities and future plans, and present preliminary performance results on a variety of platforms.

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

    Klumpp, Allan R.; Lawson, Charles L.

    1990-01-01

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

  18. "Real-Time Optical Laboratory Linear Algebra Solution Of Partial Differential Equations"

    Casasent, David; Jackson, James

    1986-03-01

    A Space Integrating (SI) Optical Linear Algebra Processor (OLAP) employing space and frequency-multiplexing, new partitioning and data flow, and achieving high accuracy performance with a non base-2 number system is described. Laboratory data on the performance of this system and the solution of parabolic Partial Differential Equations (PDEs) is provided. A multi-processor OLAP system is also described for the first time. It use in the solution of multiple banded matrices that frequently arise is then discussed. The utility and flexibility of this processor compared to digital systolic architectures should be apparent.

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

    Downie, John D.; Goodman, Joseph W.

    1989-10-01

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

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

  1. Linear algebra as an alternative approach to the synthesis of digital devices of automation and control systems

    Nikolay Chernov

    2018-01-01

    Full Text Available The article considers linear algebra as an alternative mathematical tool of logic synthesis of digital structures to Boolean algebra and synthesis methods of digital electronic component base (ECB on its ground. The methods of solving the applied problems of logic synthesis are shown, including the expansion of an arbitrary logic function by means of monotonic functions. The proposed mathematical apparatus actually provides the creation of digital structures on the principles of analog circuitry. It can find application in the design of multivalued digital ECB, specialized system-on-chip and analog-digital sensors with current output. The examples of synthesis of the combinational and sequential two-valued and multivalued digital devices are given. In conclusion, the advantages of linear algebra in comparison with Boolean algebra are formulated.

  2. Clifford Algebras and Spinorial Representation of Linear Canonical Transformations in Quantum Theory

    Raoelina Andriambololona; Ranaivoson, R.T.R.; Rakotoson, H.

    2017-11-01

    This work is a continuation of previous works that we have done concerning linear canonical transformations and a phase space representation of quantum theory. It is mainly focused on the description of an approach which permits to establish spinorial representation of linear canonical transformations. It begins with an introduction section in which the reason and context of the content are discussed. The introduction section is followed by a brief recall about Clifford algebra and spin group. The description of the approach is started with the presentation of an adequate parameterization of linear canonical transformations which permits to represent them with special pseudo-orthogonal transformations in an operators space. The establishment of the spinorial representation is deduced using relation between special pseudo-orthogonal groups and spin groups. The cases of one dimension quantum mechanics and general multidimensional theory are both studied. The case of linear canonical transformation related to Minkowski space is particularly studied and it is shown that Lorentz transformation may be considered as particular case of linear canonical transformation. Some results from the spinorial representation are also exploited to define operators which may be used to establish equations for fields if one considers the possibility of envisaging a field theory which admits as main symmetry group the group constituted by linear canonical transformations.

  3. Design and Implementation of Numerical Linear Algebra Algorithms on Fixed Point DSPs

    Gene Frantz

    2007-01-01

    Full Text Available Numerical linear algebra algorithms use the inherent elegance of matrix formulations and are usually implemented using C/C++ floating point representation. The system implementation is faced with practical constraints because these algorithms usually need to run in real time on fixed point digital signal processors (DSPs to reduce total hardware costs. Converting the simulation model to fixed point arithmetic and then porting it to a target DSP device is a difficult and time-consuming process. In this paper, we analyze the conversion process. We transformed selected linear algebra algorithms from floating point to fixed point arithmetic, and compared real-time requirements and performance between the fixed point DSP and floating point DSP algorithm implementations. We also introduce an advanced code optimization and an implementation by DSP-specific, fixed point C code generation. By using the techniques described in the paper, speed can be increased by a factor of up to 10 compared to floating point emulation on fixed point hardware.

  4. Bounds on achievable accuracy in analog optical linear-algebra processors

    Batsell, Stephen G.; Walkup, John F.; Krile, Thomas F.

    1990-07-01

    Upper arid lower bounds on the number of bits of accuracy achievable are determined by applying a seconth-ortler statistical model to the linear algebra processor. The use of bounds was found necessary due to the strong signal-dependence of the noise at the output of the optical linear algebra processor (OLAP). 1 1. ACCURACY BOUNDS One of the limiting factors in applying OLAPs to real world problems has been the poor achievable accuracy of these processors. Little previous research has been done on determining noise sources from a systems perspective which would include noise generated in the multiplication ard addition operations spatial variations across arrays and crosstalk. We have previously examined these noise sources and determined a general model for the output noise mean and variance. The model demonstrates a strony signaldependency in the noise at the output of the processor which has been confirmed by our experiments. 1 We define accuracy similar to its definition for an analog signal input to an analog-to-digital (ND) converter. The number of bits of accuracy achievable is related to the log (base 2) of the number of separable levels at the P/D converter output. The number of separable levels is fouri by dividing the dynamic range by m times the standard deviation of the signal a. 2 Here m determines the error rate in the P/D conversion. The dynamic range can be expressed as the

  5. Tissue characterization using electrical impedance spectroscopy data: a linear algebra approach.

    Laufer, Shlomi; Solomon, Stephen B; Rubinsky, Boris

    2012-06-01

    In this study, we use a new linear algebra manipulation on electrical impedance spectroscopy measurements to provide real-time information regarding the nature of the tissue surrounding the needle in minimal invasive procedures. Using a Comsol Multiphysics three-dimensional model, a phantom based on ex vivo animal tissue and in vivo animal data, we demonstrate how tissue inhomogeneity can be characterized without any previous knowledge of the electrical properties of the different tissues, except that they should not be linearly dependent on a certain frequency range. This method may have applications in needle biopsies, radiation seeds, or minimally invasive surgery and can reduce the number of computer tomography or magnetic resonance imaging images. We conclude by demonstrating how this mathematical approach can be useful in other applications.

  6. Linear algebraic analyses of structures with one predominant type of anomalous scatterer

    Karle, J.

    1989-01-01

    Further studies have been made of the information content of the exact linear equations for analyzing anomalous dispersion data in one-wavelength experiments. The case of interest concerns structures containing atoms that essentially do not scatter anomalously and one type of anomalously scattering atoms. For this case, there are three alternative ways of writing the equations. The alternative sets of equations and the transformations for transforming one set into the other are given explicitly. Comparison calculations were made with different sets of equations. Isomorphous replacement information is readily introduced into the calculations and the advantage of doing so is clearly illustrated by the results. Another aspect of the potential of the exact linear algebraic theory is its application to multiple-wavelength experiments. Successful applications of the latter have been made by several collaborative groups of investigators. (orig.)

  7. Tissue characterization using electrical impedance spectroscopy data: a linear algebra approach

    Laufer, Shlomi; Solomon, Stephen B; Rubinsky, Boris

    2012-01-01

    In this study, we use a new linear algebra manipulation on electrical impedance spectroscopy measurements to provide real-time information regarding the nature of the tissue surrounding the needle in minimal invasive procedures. Using a Comsol Multiphysics three-dimensional model, a phantom based on ex vivo animal tissue and in vivo animal data, we demonstrate how tissue inhomogeneity can be characterized without any previous knowledge of the electrical properties of the different tissues, except that they should not be linearly dependent on a certain frequency range. This method may have applications in needle biopsies, radiation seeds, or minimally invasive surgery and can reduce the number of computer tomography or magnetic resonance imaging images. We conclude by demonstrating how this mathematical approach can be useful in other applications. (paper)

  8. Characterization of the order relation on the set of completely n-positive linear maps between C*-algebras

    Maria Joita

    2007-12-01

    Full Text Available In this paper we characterize the order relation on the set of all nondegenerate completely n-positive linear maps between C*-algebras in terms of a self-dual Hilbert module induced by each completely n-positive linear map.

  9. Complete algebraic reduction of one-loop tensor Feynman integrals

    Fleischer, J.; Riemann, T.

    2011-01-01

    We set up a new, flexible approach for the tensor reduction of one-loop Feynman integrals. The 5-point tensor integrals up to rank R=5 are expressed by 4-point tensor integrals of rank R-1, such that the appearance of the inverse 5-point Gram determinant is avoided. The 4-point tensor coefficients are represented in terms of 4-point integrals, defined in d dimensions, 4-2ε≤d≤4-2ε+2(R-1), with higher powers of the propagators. They can be further reduced to expressions which stay free of the inverse 4-point Gram determinants but contain higher-dimensional 4-point integrals with only the first power of scalar propagators, plus 3-point tensor coefficients. A direct evaluation of the higher-dimensional 4-point functions would avoid the appearance of inverse powers of the Gram determinants completely. The simplest approach, however, is to apply here dimensional recurrence relations in order to reduce them to the familiar 2- to 4-point functions in generic dimension d=4-2ε, introducing thereby coefficients with inverse 4-point Gram determinants up to power R for tensors of rank R. For small or vanishing Gram determinants--where this reduction is not applicable--we use analytic expansions in positive powers of the Gram determinants. Improving the convergence of the expansions substantially with Pade approximants we close up to the evaluation of the 4-point tensor coefficients for larger Gram determinants. Finally, some relations are discussed which may be useful for analytic simplifications of Feynman diagrams.

  10. The algebra of the energy-momentum tensor and the Noether currents in classical non-linear sigma models

    Forger, M.; Mannheim Univ.; Laartz, J.; Schaeper, U.

    1994-01-01

    The recently derived current algrbra of classical non-linear sigma models on arbitrary Riemannian manifolds is extended to include the energy-momentum tensor. It is found that in two dimensions the energy-momentum tensor θ μv , the Noether current j μ associated with the global symmetry of the theory and the composite field j appearing as the coefficient of the Schwinger term in the current algebra, together with the derivatives of j μ and j, generte a closed algebra. The subalgebra generated by the light-cone components of the energy-momentum tensor consists of two commuting copies of the Virasoro algebra, with central charge c=0, reflecting the classical conformal invariance of the theory, but the current algebra part and the semidirect product structure are quite different from the usual Kac-Moody/Sugawara type contruction. (orig.)

  11. Quadratic algebras

    Polishchuk, Alexander

    2005-01-01

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

  12. Linear-algebraic bath transformation for simulating complex open quantum systems

    Huh, Joonsuk; Mostame, Sarah; Fujita, Takatoshi; Aspuru-Guzik, Alán; Yung, Man-Hong

    2014-01-01

    In studying open quantum systems, the environment is often approximated as a collection of non-interacting harmonic oscillators, a configuration also known as the star-bath model. It is also well known that the star-bath can be transformed into a nearest-neighbor interacting chain of oscillators. The chain-bath model has been widely used in renormalization group approaches. The transformation can be obtained by recursion relations or orthogonal polynomials. Based on a simple linear algebraic approach, we propose a bath partition strategy to reduce the system-bath coupling strength. As a result, the non-interacting star-bath is transformed into a set of weakly coupled multiple parallel chains. The transformed bath model allows complex problems to be practically implemented on quantum simulators, and it can also be employed in various numerical simulations of open quantum dynamics. (paper)

  13. Profiling high performance dense linear algebra algorithms on multicore architectures for power and energy efficiency

    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.

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

    Aniello, Paolo; Cagli, Ruben Coen

    2005-01-01

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

  15. A Linear Algebra Framework for Static High Performance Fortran Code Distribution

    Corinne Ancourt

    1997-01-01

    Full Text Available High Performance Fortran (HPF was developed to support data parallel programming for single-instruction multiple-data (SIMD and multiple-instruction multiple-data (MIMD machines with distributed memory. The programmer is provided a familiar uniform logical address space and specifies the data distribution by directives. The compiler then exploits these directives to allocate arrays in the local memories, to assign computations to elementary processors, and to migrate data between processors when required. We show here that linear algebra is a powerful framework to encode HPF directives and to synthesize distributed code with space-efficient array allocation, tight loop bounds, and vectorized communications for INDEPENDENT loops. The generated code includes traditional optimizations such as guard elimination, message vectorization and aggregation, and overlap analysis. The systematic use of an affine framework makes it possible to prove the compilation scheme correct.

  16. A high-accuracy optical linear algebra processor for finite element applications

    Casasent, D.; Taylor, B. K.

    1984-01-01

    Optical linear processors are computationally efficient computers for solving matrix-matrix and matrix-vector oriented problems. Optical system errors limit their dynamic range to 30-40 dB, which limits their accuray to 9-12 bits. Large problems, such as the finite element problem in structural mechanics (with tens or hundreds of thousands of variables) which can exploit the speed of optical processors, require the 32 bit accuracy obtainable from digital machines. To obtain this required 32 bit accuracy with an optical processor, the data can be digitally encoded, thereby reducing the dynamic range requirements of the optical system (i.e., decreasing the effect of optical errors on the data) while providing increased accuracy. This report describes a new digitally encoded optical linear algebra processor architecture for solving finite element and banded matrix-vector problems. A linear static plate bending case study is described which quantities the processor requirements. Multiplication by digital convolution is explained, and the digitally encoded optical processor architecture is advanced.

  17. Solving differential–algebraic equation systems by means of index reduction methodology

    Sørensen, Kim; Houbak, Niels; Condra, Thomas

    2006-01-01

    of a number of differential equations and algebraic equations — a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODEs and index 1 DAEs by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of ordinary differential equations — ODEs....

  18. Solving differential-algebraic equation systems by means of index reduction methodology

    Sørensen, Kim; Houbak, Niels; Condra, Thomas Joseph

    2006-01-01

    of a number of differential equations and algebraic equations - a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODE’s and index 1 DAE’s by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of Ordinary- Differential-Equations - ODE’s....

  19. Visualizing the Inner Product Space R[superscript m x n] in a MATLAB-Assisted Linear Algebra Classroom

    Caglayan, Günhan

    2018-01-01

    This linear algebra note offers teaching and learning ideas in the treatment of the inner product space R[superscript m x n] in a technology-supported learning environment. Classroom activities proposed in this note demonstrate creative ways of integrating MATLAB technology into various properties of Frobenius inner product as visualization tools…

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

    Grenier-Boley, Nicolas

    2014-01-01

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

  1. Killing scalar of non-linear σ-model on G/H realizing the classical exchange algebra

    Aoyama, Shogo

    2014-01-01

    The Poisson brackets for non-linear σ-models on G/H are set up on the light-like plane. A quantity which transforms irreducibly by the Killing vectors, called Killing scalar, is constructed in an arbitrary representation of G. It is shown to satisfy the classical exchange algebra

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

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

    2018-01-01

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

  3. High-Order Automatic Differentiation of Unmodified Linear Algebra Routines via Nilpotent Matrices

    Dunham, Benjamin Z.

    This work presents a new automatic differentiation method, Nilpotent Matrix Differentiation (NMD), capable of propagating any order of mixed or univariate derivative through common linear algebra functions--most notably third-party sparse solvers and decomposition routines, in addition to basic matrix arithmetic operations and power series--without changing data-type or modifying code line by line; this allows differentiation across sequences of arbitrarily many such functions with minimal implementation effort. NMD works by enlarging the matrices and vectors passed to the routines, replacing each original scalar with a matrix block augmented by derivative data; these blocks are constructed with special sparsity structures, termed "stencils," each designed to be isomorphic to a particular multidimensional hypercomplex algebra. The algebras are in turn designed such that Taylor expansions of hypercomplex function evaluations are finite in length and thus exactly track derivatives without approximation error. Although this use of the method in the "forward mode" is unique in its own right, it is also possible to apply it to existing implementations of the (first-order) discrete adjoint method to find high-order derivatives with lowered cost complexity; for example, for a problem with N inputs and an adjoint solver whose cost is independent of N--i.e., O(1)--the N x N Hessian can be found in O(N) time, which is comparable to existing second-order adjoint methods that require far more problem-specific implementation effort. Higher derivatives are likewise less expensive--e.g., a N x N x N rank-three tensor can be found in O(N2). Alternatively, a Hessian-vector product can be found in O(1) time, which may open up many matrix-based simulations to a range of existing optimization or surrogate modeling approaches. As a final corollary in parallel to the NMD-adjoint hybrid method, the existing complex-step differentiation (CD) technique is also shown to be capable of

  4. Spectral theory of linear operators and spectral systems in Banach algebras

    Müller, Vladimir

    2003-01-01

    This book is dedicated to the spectral theory of linear operators on Banach spaces and of elements in Banach algebras. It presents a survey of results concerning various types of spectra, both of single and n-tuples of elements. Typical examples are the one-sided spectra, the approximate point, essential, local and Taylor spectrum, and their variants. The theory is presented in a unified, axiomatic and elementary way. Many results appear here for the first time in a monograph. The material is self-contained. Only a basic knowledge of functional analysis, topology, and complex analysis is assumed. The monograph should appeal both to students who would like to learn about spectral theory and to experts in the field. It can also serve as a reference book. The present second edition contains a number of new results, in particular, concerning orbits and their relations to the invariant subspace problem. This book is dedicated to the spectral theory of linear operators on Banach spaces and of elements in Banach alg...

  5. Generalized NLS hierarchies from rational W algebras

    Toppan, F.

    1993-11-01

    Finite rational W algebras are very natural structures appearing in coset constructions when a Kac-Moody subalgebra is factored out. The problem of relating these algebras to integrable hierarchies of equations is studied by showing how to associate to a rational W algebra its corresponding hierarchy. Two examples are worked out, the sl(2)/U(1) coset, leading to the Non-Linear Schroedinger hierarchy, and the U(1) coset of the Polyakov-Bershadsky W algebra, leading to a 3-field representation of the KP hierarchy already encountered in the literature. In such examples a rational algebra appears as algebra of constraints when reducing a KP hierarchy to a finite field representation. This fact arises the natural question whether rational algebras are always associated to such reductions and whether a classification of rational algebras can lead to a classification of the integrable hierarchies. (author). 19 refs

  6. Prediction of turbulent heat transfer with surface blowing using a non-linear algebraic heat flux model

    Bataille, F.; Younis, B.A.; Bellettre, J.; Lallemand, A.

    2003-01-01

    The paper reports on the prediction of the effects of blowing on the evolution of the thermal and velocity fields in a flat-plate turbulent boundary layer developing over a porous surface. Closure of the time-averaged equations governing the transport of momentum and thermal energy is achieved using a complete Reynolds-stress transport model for the turbulent stresses and a non-linear, algebraic and explicit model for the turbulent heat fluxes. The latter model accounts explicitly for the dependence of the turbulent heat fluxes on the gradients of mean velocity. Results are reported for the case of a heated boundary layer which is first developed into equilibrium over a smooth impervious wall before encountering a porous section through which cooler fluid is continuously injected. Comparisons are made with LDA measurements for an injection rate of 1%. The reduction of the wall shear stress with increase in injection rate is obtained in the calculations, and the computed rates of heat transfer between the hot flow and the wall are found to agree well with the published data

  7. On W∞ algebras, gauge equivalence of K P hierarchies, two-bosons realizations and their KdV reductions

    Aratyn, H.; Ferreira, L.A.; Gomes, J.F.; Zimerman, A.H.

    1994-01-01

    The gauge equivalence between basic KP hierarchies is discussed. The first two Hamiltonian structures for KP hierarchies leading to the linear and non-linear W ∞ algebras are derived. The realization of the corresponding generators in terms of two boson currents is presented and it is shown to be related to many integrable models which are bi-Hamiltonian. We can also realize those generators by adding extra currents, coupled in a particular way allowing for instance a description of multi-layered Benney equations or multi- component non-linear Schroedinger equation. In this case we can have a second Hamiltonian bracket structure which violates Jacobi identity. We consider the reduction to one-boson systems leading to KdV and mKdV hierarchies. A Miura transformation relating these two hierarchies is obtained by restricting gauge transformation between corresponding two-boson hierarchies. Connection to Drinfeld-Sokolov approach is also discussed in the SL (2, IR) gauge theory. (author)

  8. Student performance and attitudes in a collaborative and flipped linear algebra course

    Murphy, Julia; Chang, Jen-Mei; Suaray, Kagba

    2016-07-01

    Flipped learning is gaining traction in K-12 for enhancing students' problem-solving skills at an early age; however, there is relatively little large-scale research showing its effectiveness in promoting better learning outcomes in higher education, especially in mathematics classes. In this study, we examined the data compiled from both quantitative and qualitative measures such as item scores on a common final and attitude survey results between a flipped and a traditional Introductory Linear Algebra class taught by two individual instructors at a state university in California in Fall 2013. Students in the flipped class were asked to watch short video lectures made by the instructor and complete a short online quiz prior to each class attendance. The class time was completely devoted to problem solving in group settings where students were prompted to communicate their reasoning with proper mathematical terms and structured sentences verbally and in writing. Examination of the quality and depth of student responses from the common final exam showed that students in the flipped class produced more comprehensive and well-explained responses to the questions that required reasoning, creating examples, and more complex use of mathematical objects. Furthermore, students in the flipped class performed superiorly in the overall comprehension of the content with a 21% increase in the median final exam score. Overall, students felt more confident about their ability to learn mathematics independently, showed better retention of materials over time, and enjoyed the flipped experience.

  9. High Productivity Programming of Dense Linear Algebra on Heterogeneous NUMA Architectures

    Alomairy, Rabab M.

    2013-07-01

    High-end multicore systems with GPU-based accelerators are now ubiquitous in the hardware landscape. Besides dealing with the nontrivial heterogeneous environ- ment, end users should often take into consideration the underlying memory architec- ture to decrease the overhead of data motion, especially when running on non-uniform memory access (NUMA) platforms. We propose the OmpSs parallel programming model approach using its Nanos++ dynamic runtime system to solve the two challeng- ing problems aforementioned, through 1) an innovative NUMA node-aware scheduling policy to reduce data movement between NUMA nodes and 2) a nested parallelism feature to concurrently exploit the resources available from the GPU devices as well as the CPU host, without compromising the overall performance. Our approach fea- tures separation of concerns by abstracting the complexity of the hardware from the end users so that high productivity can be achieved. The Cholesky factorization is used as a benchmark representative of dense numerical linear algebra algorithms. Superior performance is also demonstrated on the symmetric matrix inversion based on Cholesky factorization, commonly used in co-variance computations in statistics. Performance on a NUMA system with Kepler-based GPUs exceeds that of existing implementations, while the OmpSs-enabled code remains very similar to its original sequential version.

  10. The use of e-portfolio in a linear algebra course

    María Isabel García-Planas

    2016-03-01

    Full Text Available The use of e-portfolio becomes more common learning and student assessment; and this is due to the need for teachers to enhance students’ autonomy. The use of e-portfolio helps students to reflect on their own learning process. Lectures to large groups should not be limited only to classes, but must foster active learning, and in this regard, the introduction of the e-portfolio is a good tool because it stimulates collaborative and cooperative work among students and in turn encourages feedback with the teacher. To apply active methodologies during 2014-15 has been introduced in the course of the preparation of Linear Algebra comprehensive e-portfolio. To prepare the work of the e-portfolio the teacher had to clearly define the objectives that must be achieved by the students, and has had to plan in an understandable manner the tasks that the students can work independently outside the classroom. For the realization of the e-portfolio have been used different platforms. Each third of the students worked with a different platform, through AteneaLabs that it has provided templates in order that each student make their own e-portfolio, as well as it provide all necessary manuals. The platforms used were: Mahara, Exabis, WordPress and Google Sites. Formative assessment of the e-portfolio has been made from different rubrics defined in in the course syllabus and known by students since the beginning of the course.

  11. Choosing processor array configuration by performance modeling for a highly parallel linear algebra algorithm

    Littlefield, R.J.; Maschhoff, K.J.

    1991-04-01

    Many linear algebra algorithms utilize an array of processors across which matrices are distributed. Given a particular matrix size and a maximum number of processors, what configuration of processors, i.e., what size and shape array, will execute the fastest? The answer to this question depends on tradeoffs between load balancing, communication startup and transfer costs, and computational overhead. In this paper we analyze in detail one algorithm: the blocked factored Jacobi method for solving dense eigensystems. A performance model is developed to predict execution time as a function of the processor array and matrix sizes, plus the basic computation and communication speeds of the underlying computer system. In experiments on a large hypercube (up to 512 processors), this model has been found to be highly accurate (mean error ∼ 2%) over a wide range of matrix sizes (10 x 10 through 200 x 200) and processor counts (1 to 512). The model reveals, and direct experiment confirms, that the tradeoffs mentioned above can be surprisingly complex and counterintuitive. We propose decision procedures based directly on the performance model to choose configurations for fastest execution. The model-based decision procedures are compared to a heuristic strategy and shown to be significantly better. 7 refs., 8 figs., 1 tab

  12. Adjamagbo Determinant and Serre conjecture for linear groups over Weyl algebras

    Adjamagbo, Kossivi

    2008-01-01

    Thanks to the theory of determinants over an Ore domain, also called Adjamagbo determinant by the Russian school of non commutative algebra, we extend to any Weyl algebra over a field of characteristic zero Suslin theorem solving what Suslin himself called the $K_1$-analogue of the well-known Serre Conjecture and asserting that for any integer $n$ greater than 2, any $n$ by $n$ matrix with coefficients in any algebra of polynomials over a field and with determinant one is the product of eleme...

  13. Population Projection. Applications of Linear Algebra to Population Studies. Modules and Monographs in Undergraduate Mathematics and Its Applications. UMAP Module 345.

    Keller, Edward L.

    This unit, which looks at applications of linear algebra to population studies, is designed to help pupils: (1) understand an application of matrix algebra to the study of populations; (2) see how knowledge of eigen values and eigen vectors is useful in studying powers of matrices; and (3) be briefly exposed to some difficult but interesting…

  14. Developing CORE model-based worksheet with recitation task to facilitate students’ mathematical communication skills in linear algebra course

    Risnawati; Khairinnisa, S.; Darwis, A. H.

    2018-01-01

    The purpose of this study was to develop a CORE model-based worksheet with recitation task that were valid and practical and could facilitate students’ communication skills in Linear Algebra course. This study was conducted in mathematics education department of one public university in Riau, Indonesia. Participants of the study were media and subject matter experts as validators as well as students from mathematics education department. The objects of this study are students’ worksheet and students’ mathematical communication skills. The results of study showed that: (1) based on validation of the experts, the developed students’ worksheet was valid and could be applied for students in Linear Algebra courses; (2) based on the group trial, the practicality percentage was 92.14% in small group and 90.19% in large group, so the worksheet was very practical and could attract students to learn; and (3) based on the post test, the average percentage of ideals was 87.83%. In addition, the results showed that the students’ worksheet was able to facilitate students’ mathematical communication skills in linear algebra course.

  15. Hom-Novikov algebras

    Yau, Donald

    2011-01-01

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

  16. Reduction of Linear Functional Systems using Fuhrmann's Equivalence

    Mohamed S. Boudellioua

    2016-11-01

    Full Text Available Functional systems arise in the treatment of systems of partial differential equations, delay-differential equations, multidimensional equations, etc. The problem of reducing a linear functional system to a system containing fewer equations and unknowns was first studied by Serre. Finding an equivalent presentation of a linear functional system containing fewer equations and fewer unknowns can generally simplify both the study of the structural properties of the linear functional system and of different numerical analysis issues, and it can sometimes help in solving the linear functional system. In this paper, Fuhrmann's equivalence is used to present a constructive result on the reduction of under-determined linear functional systems to a single equation involving a single unknown. This equivalence transformation has been studied by a number of authors and has been shown to play an important role in the theory of linear functional systems.

  17. H∞ /H2 model reduction through dilated linear matrix inequalities

    Adegas, Fabiano Daher; Stoustrup, Jakob

    2012-01-01

    This paper presents sufficient dilated linear matrix inequalities (LMI) conditions to the $H_{infty}$ and $H_{2}$ model reduction problem. A special structure of the auxiliary (slack) variables allows the original model of order $n$ to be reduced to an order $r=n/s$ where $n,r,s in field{N}$. Arb......This paper presents sufficient dilated linear matrix inequalities (LMI) conditions to the $H_{infty}$ and $H_{2}$ model reduction problem. A special structure of the auxiliary (slack) variables allows the original model of order $n$ to be reduced to an order $r=n/s$ where $n,r,s in field...

  18. Accelerating Scientific Applications using High Performance Dense and Sparse Linear Algebra Kernels on GPUs

    Abdelfattah, Ahmad

    2015-01-15

    High performance computing (HPC) platforms are evolving to more heterogeneous configurations to support the workloads of various applications. The current hardware landscape is composed of traditional multicore CPUs equipped with hardware accelerators that can handle high levels of parallelism. Graphical Processing Units (GPUs) are popular high performance hardware accelerators in modern supercomputers. GPU programming has a different model than that for CPUs, which means that many numerical kernels have to be redesigned and optimized specifically for this architecture. GPUs usually outperform multicore CPUs in some compute intensive and massively parallel applications that have regular processing patterns. However, most scientific applications rely on crucial memory-bound kernels and may witness bottlenecks due to the overhead of the memory bus latency. They can still take advantage of the GPU compute power capabilities, provided that an efficient architecture-aware design is achieved. This dissertation presents a uniform design strategy for optimizing critical memory-bound kernels on GPUs. Based on hierarchical register blocking, double buffering and latency hiding techniques, this strategy leverages the performance of a wide range of standard numerical kernels found in dense and sparse linear algebra libraries. The work presented here focuses on matrix-vector multiplication kernels (MVM) as repre- sentative and most important memory-bound operations in this context. Each kernel inherits the benefits of the proposed strategies. By exposing a proper set of tuning parameters, the strategy is flexible enough to suit different types of matrices, ranging from large dense matrices, to sparse matrices with dense block structures, while high performance is maintained. Furthermore, the tuning parameters are used to maintain the relative performance across different GPU architectures. Multi-GPU acceleration is proposed to scale the performance on several devices. The

  19. Lie Algebras and Integrable Systems

    Zhang Yufeng; Mei Jianqin

    2012-01-01

    A 3 × 3 matrix Lie algebra is first introduced, its subalgebras and the generated Lie algebras are obtained, respectively. Applications of a few Lie subalgebras give rise to two integrable nonlinear hierarchies of evolution equations from their reductions we obtain the nonlinear Schrödinger equations, the mKdV equations, the Broer-Kaup (BK) equation and its generalized equation, etc. The linear and nonlinear integrable couplings of one integrable hierarchy presented in the paper are worked out by casting a 3 × 3 Lie subalgebra into a 2 × 2 matrix Lie algebra. Finally, we discuss the elliptic variable solutions of a generalized BK equation. (general)

  20. A Corresponding Lie Algebra of a Reductive homogeneous Group and Its Applications

    Zhang Yu-Feng; Rui Wen-Juan; Wu Li-Xin

    2015-01-01

    With the help of a Lie algebra of a reductive homogeneous space G/K, where G is a Lie group and K is a resulting isotropy group, we introduce a Lax pair for which an expanding (2+1)-dimensional integrable hierarchy is obtained by applying the binormial-residue representation (BRR) method, whose Hamiltonian structure is derived from the trace identity for deducing (2+1)-dimensional integrable hierarchies, which was proposed by Tu, et al. We further consider some reductions of the expanding integrable hierarchy obtained in the paper. The first reduction is just right the (2+1)-dimensional AKNS hierarchy, the second-type reduction reveals an integrable coupling of the (2+1)-dimensional AKNS equation (also called the Davey-Stewartson hierarchy), a kind of (2+1)-dimensional Schrödinger equation, which was once reobtained by Tu, Feng and Zhang. It is interesting that a new (2+1)-dimensional integrable nonlinear coupled equation is generated from the reduction of the part of the (2+1)-dimensional integrable coupling, which is further reduced to the standard (2+1)-dimensional diffusion equation along with a parameter. In addition, the well-known (1+1)-dimensional AKNS hierarchy, the (1+1)-dimensional nonlinear Schrödinger equation are all special cases of the (2+1)-dimensional expanding integrable hierarchy. Finally, we discuss a few discrete difference equations of the diffusion equation whose stabilities are analyzed by making use of the von Neumann condition and the Fourier method. Some numerical solutions of a special stationary initial value problem of the (2+1)-dimensional diffusion equation are obtained and the resulting convergence and estimation formula are investigated. (paper)

  1. On the paper: Numerical radius preserving linear maps on Banach algebras

    El Azhari , Mohammed

    2017-01-01

    International audience; We give an example of a unital commutative complex Banach algebra having a normalized state which is not a spectral state and admitting an extreme normalized state which is not multiplicative. This disproves two results by Golfarshchi and Khalilzadeh.

  2. K-Bessel functions associated to a 3-rank Jordan algebra

    Hacen Dib

    2005-01-01

    Full Text Available Using the Bessel-Muirhead system, we can express the K-Bessel function defined on a Jordan algebra as a linear combination of the J-solutions. We determine explicitly the coefficients when the rank of this Jordan algebra is three after a reduction to the rank two. The main tools are some algebraic identities developed for this occasion.

  3. One-loop dimensional reduction of the linear σ model

    Malbouisson, A.P.C.; Silva-Neto, M.B.; Svaiter, N.F.

    1997-05-01

    We perform the dimensional reduction of the linear σ model at one-loop level. The effective of the reduced theory obtained from the integration over the nonzero Matsubara frequencies is exhibited. Thermal mass and coupling constant renormalization constants are given, as well as the thermal renormalization group which controls the dependence of the counterterms on the temperature. We also recover, for the reduced theory, the vacuum instability of the model for large N. (author)

  4. Noise Reduction with Optimal Variable Span Linear Filters

    Jensen, Jesper Rindom; Benesty, Jacob; Christensen, Mads Græsbøll

    2016-01-01

    In this paper, the problem of noise reduction is addressed as a linear filtering problem in a novel way by using concepts from subspace-based enhancement methods, resulting in variable span linear filters. This is done by forming the filter coefficients as linear combinations of a number...... included in forming the filter. Using these concepts, a number of different filter designs are considered, like minimum distortion, Wiener, maximum SNR, and tradeoff filters. Interestingly, all these can be expressed as special cases of variable span filters. We also derive expressions for the speech...... demonstrate the advantages and properties of the variable span filter designs, and their potential performance gain compared to widely used speech enhancement methods....

  5. Abstract algebra

    Garrett, Paul B

    2007-01-01

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

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

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

    2008-01-01

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

  7. Supervised linear dimensionality reduction with robust margins for object recognition

    Dornaika, F.; Assoum, A.

    2013-01-01

    Linear Dimensionality Reduction (LDR) techniques have been increasingly important in computer vision and pattern recognition since they permit a relatively simple mapping of data onto a lower dimensional subspace, leading to simple and computationally efficient classification strategies. Recently, many linear discriminant methods have been developed in order to reduce the dimensionality of visual data and to enhance the discrimination between different groups or classes. Many existing linear embedding techniques relied on the use of local margins in order to get a good discrimination performance. However, dealing with outliers and within-class diversity has not been addressed by margin-based embedding method. In this paper, we explored the use of different margin-based linear embedding methods. More precisely, we propose to use the concepts of Median miss and Median hit for building robust margin-based criteria. Based on such margins, we seek the projection directions (linear embedding) such that the sum of local margins is maximized. Our proposed approach has been applied to the problem of appearance-based face recognition. Experiments performed on four public face databases show that the proposed approach can give better generalization performance than the classic Average Neighborhood Margin Maximization (ANMM). Moreover, thanks to the use of robust margins, the proposed method down-grades gracefully when label outliers contaminate the training data set. In particular, we show that the concept of Median hit was crucial in order to get robust performance in the presence of outliers.

  8. Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems

    Chávez, Gustavo

    2017-12-15

    We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has O(kNlogN(logN+k2)) arithmetic complexity and O(k Nlog N) memory footprint, where N is the number of degrees of freedom and k is the rank of a block in the hierarchical approximation, and which exhibits substantial concurrency. We provide a baseline for performance and applicability by comparing with the multifrontal method with and without hierarchical semi-separable matrices, with algebraic multigrid and with the classic cyclic reduction method. Over a set of large-scale elliptic systems with features of nonsymmetry and indefiniteness, the robustness of the direct solvers extends beyond that of the multigrid solver, and relative to the multifrontal approach ACR has lower or comparable execution time and size of the factors, with substantially lower numerical ranks. ACR exhibits good strong and weak scaling in a distributed context and, as with any direct solver, is advantageous for problems that require the solution of multiple right-hand sides. Numerical experiments show that the rank k patterns are of O(1) for the Poisson equation and of O(n) for the indefinite Helmholtz equation. The solver is ideal in situations where low-accuracy solutions are sufficient, or otherwise as a preconditioner within an iterative method.

  9. Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems

    Chá vez, Gustavo; Turkiyyah, George; Zampini, Stefano; Ltaief, Hatem; Keyes, David E.

    2017-01-01

    We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has O(kNlogN(logN+k2)) arithmetic complexity and O(k Nlog N) memory footprint, where N is the number of degrees of freedom and k is the rank of a block in the hierarchical approximation, and which exhibits substantial concurrency. We provide a baseline for performance and applicability by comparing with the multifrontal method with and without hierarchical semi-separable matrices, with algebraic multigrid and with the classic cyclic reduction method. Over a set of large-scale elliptic systems with features of nonsymmetry and indefiniteness, the robustness of the direct solvers extends beyond that of the multigrid solver, and relative to the multifrontal approach ACR has lower or comparable execution time and size of the factors, with substantially lower numerical ranks. ACR exhibits good strong and weak scaling in a distributed context and, as with any direct solver, is advantageous for problems that require the solution of multiple right-hand sides. Numerical experiments show that the rank k patterns are of O(1) for the Poisson equation and of O(n) for the indefinite Helmholtz equation. The solver is ideal in situations where low-accuracy solutions are sufficient, or otherwise as a preconditioner within an iterative method.

  10. Wavelets and quantum algebras

    Ludu, A.; Greiner, M.

    1995-09-01

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

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

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

    2014-06-26

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

  12. Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

    Salvador Lucas

    2015-12-01

    Full Text Available Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis of declarative programs. We use convex domains to give domains to the different sorts of an order-sorted signature; we interpret the ranked symbols of sorted signatures by means of appropriately adapted convex matrix interpretations. Such numerical interpretations permit the use of existing algorithms and tools from linear algebra and arithmetic constraint solving to synthesize the models.

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

    Rahmouni, Adib N.

    2004-01-01

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

  14. Novel Supercomputing Approaches for High Performance Linear Algebra Using FPGAs, Phase I

    National Aeronautics and Space Administration — We propose to develop novel FPGA-based algorithmic technology that will enable unprecedented computational power for the solution of large sparse linear equation...

  15. A type of loop algebra and the associated loop algebras

    Tam Honwah; Zhang Yufeng

    2008-01-01

    A higher-dimensional twisted loop algebra is constructed. As its application, a new Lax pair is presented, whose compatibility gives rise to a Liouville integrable hierarchy of evolution equations by making use of Tu scheme. One of the reduction cases of the hierarchy is an analogous of the well-known AKNS system. Next, the twisted loop algebra, furthermore, is extended to another higher dimensional loop algebra, from which a hierarchy of evolution equations with 11-potential component functions is obtained, whose reduction is just standard AKNS system. Especially, we prove that an arbitrary linear combination of the four Hamiltonian operators directly obtained from the recurrence relations is still a Hamiltonian operator. Therefore, the hierarchy with 11-potential functions possesses 4-Hamiltonian structures. Finally, an integrable coupling of the hierarchy is worked out

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

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

    2014-01-01

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

  17. New approaches to teaching of the course of linear algebra in teacher training university in the conditions of information of education

    Евгений Сергеевич Сарыков

    2011-09-01

    Full Text Available In article possibilities of perfection of the maintenance of subject preparation of the mathematics teacher in teacher training university in the conditions of information of education are considered, receptions of enrichment of an information component of mathematical problems on an example of a course of linear algebra are shown.

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

    M. A.P. PURCARU

    2017-12-01

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

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

    Shi, Yixun

    2009-01-01

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

  20. The nature of the S-linear algebra: For an S-propagator

    Strati, Francesco

    2012-01-01

    This paper is intended to analyse an S-linear algebra’s application so as to build an S-propagator's concept. In particular we shall study a semi -deterministic propagator via superposition (it is intended the Carfì ́s notion of superposition).

  1. Asymptotic aspect of derivations in Banach algebras

    Jaiok Roh

    2017-02-01

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

  2. Non-linear partial differential equations an algebraic view of generalized solutions

    Rosinger, Elemer E

    1990-01-01

    A massive transition of interest from solving linear partial differential equations to solving nonlinear ones has taken place during the last two or three decades. The availability of better computers has often made numerical experimentations progress faster than the theoretical understanding of nonlinear partial differential equations. The three most important nonlinear phenomena observed so far both experimentally and numerically, and studied theoretically in connection with such equations have been the solitons, shock waves and turbulence or chaotical processes. In many ways, these phenomen

  3. A comparison of iterative methods to solve complex valued linear algebraic systems

    Axelsson, Owe; Neytcheva, M.; Ahmad, B.

    2013-01-01

    Roč. 66, č. 4 (2013), s. 811-841 ISSN 1017-1398 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : linear systems * complex symmetric * real valued form * preconditioning Subject RIV: BA - General Mathematics Impact factor: 1.005, year: 2013 http://www.it.uu.se/research/publications/reports/2013-005/2013-005-nc.pdf

  4. On unitary representations of the exceptional non-linear N=7 and N=8 superconformal algebras in terms of free fields

    Ketov, S.V.

    1996-01-01

    The simplest free-field realizations of the exceptional non-linear (quadratically generated, or W-type) N=8 and N=7 superconformal algebras with Spin(7) and G 2 affine currents, respectively, are investigated. Both the N=8 and N=7 algebras are found to admit unitary and highest-weight irreducible representations in terms of a single free boson and free fermions in 8 of Spin(7) or 7 of G 2 , respectively, at level k=1 and the corresponding central charges c 8 =26/5 and c 7 =5. (orig.)

  5. Basic algebra

    Jacobson, Nathan

    2009-01-01

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

  6. Student Logical Implications and Connections between Symbolic Representations of a Linear System within the Context of an Introductory Linear Algebra Course Employing Inquiry-Oriented Teaching and Traditional Lecture

    Payton, Spencer D.

    2017-01-01

    This study aimed to explore how inquiry-oriented teaching could be implemented in an introductory linear algebra course that, due to various constraints, may not lend itself to inquiry-oriented teaching. In particular, the course in question has a traditionally large class size, limited amount of class time, and is often coordinated with other…

  7. Dose reduction using a dynamic, piecewise-linear attenuator

    Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Fleischmann, Dominik [Department of Radiology, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)

    2014-02-15

    Purpose: The authors recently proposed a dynamic, prepatient x-ray attenuator capable of producing a piecewise-linear attenuation profile customized to each patient and viewing angle. This attenuator was intended to reduce scatter-to-primary ratio (SPR), dynamic range, and dose by redistributing flux. In this work the authors tested the ability of the attenuator to reduce dose and SPR in simulations. Methods: The authors selected four clinical applications, including routine full field-of-view scans of the thorax and abdomen, and targeted reconstruction tasks for an abdominal aortic aneurysm and the pancreas. Raw data were estimated by forward projection of the image volume datasets. The dynamic attenuator was controlled to reduce dose while maintaining peak variance by solving a convex optimization problem, assuminga priori knowledge of the patient anatomy. In targeted reconstruction tasks, the noise in specific regions was given increased weighting. A system with a standard attenuator (or “bowtie filter”) was used as a reference, and used either convex optimized tube current modulation (TCM) or a standard TCM heuristic. The noise of the scan was determined analytically while the dose was estimated using Monte Carlo simulations. Scatter was also estimated using Monte Carlo simulations. The sensitivity of the dynamic attenuator to patient centering was also examined by shifting the abdomen in 2 cm intervals. Results: Compared to a reference system with optimized TCM, use of the dynamic attenuator reduced dose by about 30% in routine scans and 50% in targeted scans. Compared to the TCM heuristics which are typically used withouta priori knowledge, the dose reduction is about 50% for routine scans. The dynamic attenuator gives the ability to redistribute noise and variance and produces more uniform noise profiles than systems with a conventional bowtie filter. The SPR was also modestly reduced by 10% in the thorax and 24% in the abdomen. Imaging with the dynamic

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

    Provencher, Stephen W.

    1982-09-01

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

  9. On the PR-algebras

    Lebedenko, V.M.

    1978-01-01

    The PR-algebras, i.e. the Lie algebras with commutation relations of [Hsub(i),Hsub(j)]=rsub(ij)Hsub(i)(i< j) type are investigated. On the basis of former results a criterion for the membership of 2-solvable Lie algebras to the PR-algebra class is given. The conditions imposed by the criterion are formulated in the linear algebra language

  10. Obtainment of internal labelling operators as broken Casimir operators by means of contractions related to reduction chains in semisimple Lie algebras

    Campoamor-Stursberg, R

    2008-01-01

    We show that the Inoenue-Wigner contraction naturally associated to a reduction chain s implies s' of semisimple Lie algebras induces a decomposition of the Casimir operators into homogeneous polynomials, the terms of which can be used to obtain additional mutually commuting missing label operators for this reduction. The adjunction of these scalars that are no more invariants of the contraction allow to solve the missing label problem for those reductions where the contraction provides an insufficient number of labelling operators.

  11. Simultaneous Balancing and Model Reduction of Switched Linear Systems

    Monshizadeh, Nima; Trentelman, Hendrikus; Camlibel, M.K.

    2011-01-01

    In this paper, first, balanced truncation of linear systems is revisited. Then, simultaneous balancing of multiple linear systems is investigated. Necessary and sufficient conditions are introduced to identify the case where simultaneous balancing is possible. The validity of these conditions is not

  12. Algebraic partial Boolean algebras

    Smith, Derek

    2003-01-01

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

  13. Algebra for Gifted Third Graders.

    Borenson, Henry

    1987-01-01

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

  14. Simultaneous Balancing and Model Reduction of Switched Linear Systems

    Monshizadeh, Nima; Trentelman, Hendrikus; Camlibel, M.K.

    2011-01-01

    In this paper, first, balanced truncation of linear systems is revisited. Then, simultaneous balancing of multiple linear systems is investigated. Necessary and sufficient conditions are introduced to identify the case where simultaneous balancing is possible. The validity of these conditions is not limited to a certain type of balancing, and they are applicable for different types of balancing corresponding to different equations, like Lyapunov or Riccati equations. The results obtained are ...

  15. Continuum analogues of contragredient Lie algebras

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

    1989-03-01

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

  16. Noise Reduction of Measurement Data using Linear Digital Filters

    Hitzmann B.

    2007-12-01

    Full Text Available In this paper Butterworth, Chebyshev (Type I and II and Elliptic digital filters are designed for signal noise reduction. On-line data measurements of substrate concentration from E. coli fed-batch cultivation process are used. Application of the designed filters leads to a successful noise reduction of on-line glucose measurements. The digital filters presented here are simple, easy to implement and effective - the used filters allow for a smart compromise between signal information and noise corruption.

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

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

    2010-09-21

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

  18. Graphical reduction of reaction networks by linear elimination of species

    Saez Cornellana, Meritxell; Wiuf, Carsten; Feliu, Elisenda

    2017-01-01

    We give a graphically based procedure to reduce a reaction network to a smaller reaction network with fewer species after linear elimination of a set of noninteracting species. We give a description of the reduced reaction network, its kinetics and conservations laws, and explore properties...

  19. Graded associative conformal algebras of finite type

    Kolesnikov, Pavel

    2011-01-01

    In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative conformal algebra which is graded by a finite group $\\Gamma $ is a pseudo-algebra over the coordinate Hopf algebra of a linear algebraic group $G$ such that the identity component $G^0$ is the affine line and $G/G^0\\simeq \\Gamma $. A classification of simple...

  20. Optimal angle reduction - a behavioral approach to linear system appromixation

    Roorda, B.; Weiland, S.

    2001-01-01

    We investigate the problem of optimal state reduction under minimization of the angle between system behaviors. The angle is defined in a worst-case sense, as the largest angle that can occur between a system trajectory and its optimal approximation in the reduced-order model. This problem is

  1. Algebraic geometry

    Lefschetz, Solomon

    2005-01-01

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

  2. Grassmann algebras

    Garcia, R.L.

    1983-11-01

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

  3. Bicovariant quantum algebras and quantum Lie algebras

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

    1993-01-01

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

  4. Representations of fundamental groups of algebraic varieties

    Zuo, Kang

    1999-01-01

    Using harmonic maps, non-linear PDE and techniques from algebraic geometry this book enables the reader to study the relation between fundamental groups and algebraic geometry invariants of algebraic varieties. The reader should have a basic knowledge of algebraic geometry and non-linear analysis. This book can form the basis for graduate level seminars in the area of topology of algebraic varieties. It also contains present new techniques for researchers working in this area.

  5. Hecke algebras with unequal parameters

    Lusztig, G

    2003-01-01

    Hecke algebras arise in representation theory as endomorphism algebras of induced representations. One of the most important classes of Hecke algebras is related to representations of reductive algebraic groups over p-adic or finite fields. In 1979, in the simplest (equal parameter) case of such Hecke algebras, Kazhdan and Lusztig discovered a particular basis (the KL-basis) in a Hecke algebra, which is very important in studying relations between representation theory and geometry of the corresponding flag varieties. It turned out that the elements of the KL-basis also possess very interesting combinatorial properties. In the present book, the author extends the theory of the KL-basis to a more general class of Hecke algebras, the so-called algebras with unequal parameters. In particular, he formulates conjectures describing the properties of Hecke algebras with unequal parameters and presents examples verifying these conjectures in particular cases. Written in the author's precise style, the book gives rese...

  6. A complete algebraic reduction of one-loop tensor Feynman integrals

    Fleischer, J. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Bielefeld Univ. (Germany). Fakultaet fuer Physik; Riemann, T. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)

    2010-09-15

    Guided by the need to eliminate inverse Gram determinants (){sub 5} from tensorial 5-point functions and sub-Gram determinants (){sub 4} from tensorial 4-point functions, we set up a new and very efficient approach for the tensor reduction of Feynman integrals. We eliminate all Gram determinants for one-loop 5-point integrals up to tensors of rank R=5 by reducing their tensor coefficients to higherdimensional 4-point tensor coefficients. These in turn are reduced to expressions which are free of inverse powers of (){sub 4}, but depend on higher-dimensional integrals I{sub 4}{sup (d)} with d{<=}2R. Their expression in terms of scalar integrals defined in the generic dimension, I{sub 4}; I{sub 3}; I{sub 2}; I{sub 1}, however, introduces coefficients [1=(){sub 4}]{sup R} for tensors of rank R. For small or vanishing (){sub 4}, an efficient expansion is found so that a stable numerical evaluation of massive and massless Feynman integrals at arbitrary values of the Gram determinants is made possible. Finally, some relations are mentioned which may be useful for analytic simplifications of the original Feynman diagrams. (orig.)

  7. Polynomials in algebraic analysis

    Multarzyński, Piotr

    2012-01-01

    The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \\cite{DPR}. One of the elegant results corresponding with that notion is a purely algebraic version of the Taylor formula, being a generalization of its usual counterpart, well known for functions of one variable. In quantum calculus there are some specific discrete derivations analyzed, which are right invertible linear ...

  8. Vertex algebras and algebraic curves

    Frenkel, Edward

    2004-01-01

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

  9. Implicative Algebras

    Tadesse

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

  10. Topics in computational linear optimization

    Hultberg, Tim Helge

    2000-01-01

    Linear optimization has been an active area of research ever since the pioneering work of G. Dantzig more than 50 years ago. This research has produced a long sequence of practical as well as theoretical improvements of the solution techniques avilable for solving linear optimization problems...... of high quality solvers and the use of algebraic modelling systems to handle the communication between the modeller and the solver. This dissertation features four topics in computational linear optimization: A) automatic reformulation of mixed 0/1 linear programs, B) direct solution of sparse unsymmetric...... systems of linear equations, C) reduction of linear programs and D) integration of algebraic modelling of linear optimization problems in C++. Each of these topics is treated in a separate paper included in this dissertation. The efficiency of solving mixed 0-1 linear programs by linear programming based...

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

    M. Legua

    2008-01-01

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

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

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

    2012-04-01

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

  13. Differential Equation over Banach Algebra

    Kleyn, Aleks

    2018-01-01

    In the book, I considered differential equations of order $1$ over Banach $D$-algebra: differential equation solved with respect to the derivative; exact differential equation; linear homogeneous equation. In noncommutative Banach algebra, initial value problem for linear homogeneous equation has infinitely many solutions.

  14. Automorphic Lie algebras with dihedral symmetry

    Knibbeler, V; Lombardo, S; A Sanders, J

    2014-01-01

    The concept of automorphic Lie algebras arises in the context of reduction groups introduced in the early 1980s in the field of integrable systems. automorphic Lie algebras are obtained by imposing a discrete group symmetry on a current algebra of Krichever–Novikov type. Past work shows remarkable uniformity between algebras associated to different reduction groups. For example, if the base Lie algebra is sl 2 (C) and the poles of the automorphic Lie algebra are restricted to an exceptional orbit of the symmetry group, changing the reduction group does not affect the Lie algebra structure. In this research we fix the reduction group to be the dihedral group and vary the orbit of poles as well as the group action on the base Lie algebra. We find a uniform description of automorphic Lie algebras with dihedral symmetry, valid for poles at exceptional and generic orbits. (paper)

  15. Electronic excitation of the b 3Σ+sub(u) state of H2 by electron impact in the linear algebraic approach

    Schneider, B.I.; Collins, L.A.

    1985-01-01

    Two-state close-coupling calculations have been performed on the X 1 Σsub(g) to b 3 Σsub(u) transition for e-H 2 scattering within the linear algebraic, effective optical potential approach. The strong orthogonality constraint between bound and continuum orbitals is relaxed by including correlation-type configurations. These correlation terms prove to be very important in the 2 Σsub(g) and 2 Σsub(u) symmetries and lead to an increase in the total cross section of a factor of two over earlier approaches, which neglected these terms. Good agreement is obtained with recent R-matrix and Schwinger variational calculations. (author)

  16. Ab initio optical potentials applied to low-energy e-H2 and e-N2 collisions in the linear-algebraic approach

    Schneider, B.I.; Collins, L.A.

    1983-01-01

    We propose a method for constructing an effective optical potential through which correlation effects can be introduced into the electron-molecule scattering formulation. The optical potential is based on a nonperturbative, Feshbach projection-operator procedure and is evaluated on an L 2 basis. The optical potential is incorporated into the scattering equations by means of a separable expansion, and the resulting scattering equations are solved by a linear-algebraic method based on the integral-equation formulation. We report the results of scattering calculations, which include polarization effects, for low-energy e-H 2 and e-N 2 collisions. The agreement with other theoretical and with experimental results is quite good

  17. Simultaneous quantification of protein phosphorylation sites using liquid chromatography-tandem mass spectrometry-based targeted proteomics: a linear algebra approach for isobaric phosphopeptides.

    Xu, Feifei; Yang, Ting; Sheng, Yuan; Zhong, Ting; Yang, Mi; Chen, Yun

    2014-12-05

    As one of the most studied post-translational modifications (PTM), protein phosphorylation plays an essential role in almost all cellular processes. Current methods are able to predict and determine thousands of phosphorylation sites, whereas stoichiometric quantification of these sites is still challenging. Liquid chromatography coupled with tandem mass spectrometry (LC-MS/MS)-based targeted proteomics is emerging as a promising technique for site-specific quantification of protein phosphorylation using proteolytic peptides as surrogates of proteins. However, several issues may limit its application, one of which relates to the phosphopeptides with different phosphorylation sites and the same mass (i.e., isobaric phosphopeptides). While employment of site-specific product ions allows for these isobaric phosphopeptides to be distinguished and quantified, site-specific product ions are often absent or weak in tandem mass spectra. In this study, linear algebra algorithms were employed as an add-on to targeted proteomics to retrieve information on individual phosphopeptides from their common spectra. To achieve this simultaneous quantification, a LC-MS/MS-based targeted proteomics assay was first developed and validated for each phosphopeptide. Given the slope and intercept of calibration curves of phosphopeptides in each transition, linear algebraic equations were developed. Using a series of mock mixtures prepared with varying concentrations of each phosphopeptide, the reliability of the approach to quantify isobaric phosphopeptides containing multiple phosphorylation sites (≥ 2) was discussed. Finally, we applied this approach to determine the phosphorylation stoichiometry of heat shock protein 27 (HSP27) at Ser78 and Ser82 in breast cancer cells and tissue samples.

  18. Intermediate algebra & analytic geometry

    Gondin, William R

    1967-01-01

    Intermediate Algebra & Analytic Geometry Made Simple focuses on the principles, processes, calculations, and methodologies involved in intermediate algebra and analytic geometry. The publication first offers information on linear equations in two unknowns and variables, functions, and graphs. Discussions focus on graphic interpretations, explicit and implicit functions, first quadrant graphs, variables and functions, determinate and indeterminate systems, independent and dependent equations, and defective and redundant systems. The text then examines quadratic equations in one variable, system

  19. Boolean algebra

    Goodstein, R L

    2007-01-01

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

  20. The relation between quantum W algebras and Lie algebras

    Boer, J. de; Tjin, T.

    1994-01-01

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

  1. Explicit field realizations of W algebras

    Wei, Shao-Wen; Liu, Yu-Xiao; Zhang, Li-Jie; Ren, Ji-Rong

    2009-01-01

    The fact that certain non-linear $W_{2,s}$ algebras can be linearized by the inclusion of a spin-1 current can provide a simple way to realize $W_{2,s}$ algebras from linear $W_{1,2,s}$ algebras. In this paper, we first construct the explicit field realizations of linear $W_{1,2,s}$ algebras with double-scalar and double-spinor, respectively. Then, after a change of basis, the realizations of $W_{2,s}$ algebras are presented. The results show that all these realizations are Romans-type realiz...

  2. Computer Algebra Systems in Undergraduate Instruction.

    Small, Don; And Others

    1986-01-01

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

  3. Applied matrix algebra in the statistical sciences

    Basilevsky, Alexander

    2005-01-01

    This comprehensive text offers teachings relevant to both applied and theoretical branches of matrix algebra and provides a bridge between linear algebra and statistical models. Appropriate for advanced undergraduate and graduate students. 1983 edition.

  4. El desempeño del docente en el proceso de desarrollo de habilidades de trabajo con algoritmos en la disciplina Álgebra Lineal / Teachers' performance and the process of developing skills to work with algorithms in Linear Algebra

    Ivonne Burguet Lago

    2018-05-01

    Full Text Available ABSTRACT The paper describes a proposal of professional pedagogical performance tests to assess teachers’ role in the process of developing the skill of working with algorithms in Linear Algebra. It aims at devising a testing tool to assess teachers’ performance in the skill-developing process. This tool is a finding of Cuba theory of Advanced Education, systematically used in recent years. The findings include the test design and the illustration of its use in a sample of 22 Linear Algebra teachers during the first term of the 2017-2018 academic year at Informatics Sciences Engineering major. Keywords: ABSTRACT The paper describes a proposal of professional pedagogical performance tests to assess teachers’ role in the process of developing the skill of working with algorithms in Linear Algebra. It aims at devising a testing tool to assess teachers’ performance in the skill-developing process. This tool is a finding of Cuba theory of Advanced Education, systematically used in recent years. The findings include the test design and the illustration of its use in a sample of 22 Linear Algebra teachers during the first term of the 2017-2018 academic year at Informatics Sciences Engineering major.

  5. Jordan algebras versus C*- algebras

    Stormer, E.

    1976-01-01

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

  6. Lectures on W algebras and W gravity

    Pope, C.N.

    1992-01-01

    We give a review of the extended conformal algebras, known as W algebras, which contain currents of spins higher than 2 in addition to the energy-momentum tensor. These include the non-linear W N algebras; the linear W ∞ and W 1+∞ algebras; and their super-extensions. We discuss their applications to the construction of W-gravity and W-string theories. (author). 46 refs

  7. The large N=4 superconformal W∞ algebra

    Beccaria, Matteo; Candu, Constantin; Gaberdiel, Matthias R.

    2014-01-01

    The most general large N=4 superconformal W ∞ algebra, containing in addition to the superconformal algebra one supermultiplet for each integer spin, is analysed in detail. It is found that the W ∞ algebra is uniquely determined by the levels of the two su(2) algebras, a conclusion that holds both for the linear and the non-linear case. We also perform various cross-checks of our analysis, and exhibit two different types of truncations in some detail.

  8. Algebraic monoids, group embeddings, and algebraic combinatorics

    Li, Zhenheng; Steinberg, Benjamin; Wang, Qiang

    2014-01-01

    This book contains a collection of fifteen articles and is dedicated to the sixtieth birthdays of Lex Renner and Mohan Putcha, the pioneers of the field of algebraic monoids.   Topics presented include:   v  structure and representation theory of reductive algebraic monoids v  monoid schemes and applications of monoids v  monoids related to Lie theory v  equivariant embeddings of algebraic groups v  constructions and properties of monoids from algebraic combinatorics v  endomorphism monoids induced from vector bundles v  Hodge–Newton decompositions of reductive monoids   A portion of these articles are designed to serve as a self-contained introduction to these topics, while the remaining contributions are research articles containing previously unpublished results, which are sure to become very influential for future work. Among these, for example, the important recent work of Michel Brion and Lex Renner showing that the algebraic semigroups are strongly π-regular.   Graduate students as well a...

  9. Explicit field realizations of W algebras

    Wei Shaowen; Liu Yuxiao; Ren Jirong; Zhang Lijie

    2009-01-01

    The fact that certain nonlinear W 2,s algebras can be linearized by the inclusion of a spin-1 current can provide a simple way to realize W 2,s algebras from linear W 1,2,s algebras. In this paper, we first construct the explicit field realizations of linear W 1,2,s algebras with double scalar and double spinor, respectively. Then, after a change of basis, the realizations of W 2,s algebras are presented. The results show that all these realizations are Romans-type realizations.

  10. Galois Theory of Differential Equations, Algebraic Groups and Lie Algebras

    Put, Marius van der

    1999-01-01

    The Galois theory of linear differential equations is presented, including full proofs. The connection with algebraic groups and their Lie algebras is given. As an application the inverse problem of differential Galois theory is discussed. There are many exercises in the text.

  11. Algebra & trigonometry super review

    2012-01-01

    Get all you need to know with Super Reviews! Each Super Review is packed with in-depth, student-friendly topic reviews that fully explain everything about the subject. The Algebra and Trigonometry Super Review includes sets and set operations, number systems and fundamental algebraic laws and operations, exponents and radicals, polynomials and rational expressions, equations, linear equations and systems of linear equations, inequalities, relations and functions, quadratic equations, equations of higher order, ratios, proportions, and variations. Take the Super Review quizzes to see how much y

  12. ADART: an adaptive algebraic reconstruction algorithm for discrete tomography.

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

    2011-08-01

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

  13. Non-local matrix generalizations of W-algebras

    Bilal, A.

    1995-01-01

    There is a standard way to define two symplectic (hamiltonian) structures, the first and second Gelfand-Dikii brackets, on the space of ordinary m th -order linear differential operators L=-d m +U 1 d m-1 +U 2 d m-2 +..+U m . In this paper, I consider in detail the case where the U k are nxn-matrix-valued functions, with particular emphasis on the (more interesting) second Gelfand-Dikii bracket. Of particular interest is the reduction to the symplectic submanifold U 1 =0. This reduction gives rise to matrix generalizations of (the classical version of) the non-linear W m -algebras, called V n,m -algebras. The non-commutativity of the matrices leads to non-local terms in these V n,m -algebras. I show that these algebras contain a conformal Virasoro subalgebra and that combinations W k of the U k can be formed that are nxn-matrices of conformally primary fields of spin k, in analogy with the scalar case n=1. In general however, the V m,n -algebras have a much richer structure than the W m -algebras as can be seen on the examples of the non-linear and non-local Poisson brackets {(U 2 ) ab (σ),(U 2 ) cd (σ')}, {(U 2 ) ab (σ),(W 3 ) cd (σ')} and {(W 3 ) ab (σ),(W 3 ) cd (σ')} which I work out explicitly for all m and n. A matrix Miura transformation is derived, mapping these complicated (second Gelfand-Dikii) brackets of the U k to a set of much simpler Poisson brackets, providing the analogue of the free-field representation of the W m -algebras. (orig.)

  14. Separable algebras

    Ford, Timothy J

    2017-01-01

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

  15. Generalized randomly amplified linear system driven by Gaussian noises: Extreme heavy tail and algebraic correlation decay in plasma turbulence

    Steinbrecher, Gyoergy; Weyssow, B.

    2004-01-01

    The extreme heavy tail and the power-law decay of the turbulent flux correlation observed in hot magnetically confined plasmas are modeled by a system of coupled Langevin equations describing a continuous time linear randomly amplified stochastic process where the amplification factor is driven by a superposition of colored noises which, in a suitable limit, generate a fractional Brownian motion. An exact analytical formula for the power-law tail exponent β is derived. The extremely small value of the heavy tail exponent and the power-law distribution of laminar times also found experimentally are obtained, in a robust manner, for a wide range of input values, as a consequence of the (asymptotic) self-similarity property of the noise spectrum. As a by-product, a new representation of the persistent fractional Brownian motion is obtained

  16. Problems in abstract algebra

    Wadsworth, A R

    2017-01-01

    This is a book of problems in abstract algebra for strong undergraduates or beginning graduate students. It can be used as a supplement to a course or for self-study. The book provides more variety and more challenging problems than are found in most algebra textbooks. It is intended for students wanting to enrich their learning of mathematics by tackling problems that take some thought and effort to solve. The book contains problems on groups (including the Sylow Theorems, solvable groups, presentation of groups by generators and relations, and structure and duality for finite abelian groups); rings (including basic ideal theory and factorization in integral domains and Gauss's Theorem); linear algebra (emphasizing linear transformations, including canonical forms); and fields (including Galois theory). Hints to many problems are also included.

  17. Anyons, deformed oscillator algebras and projectors

    Engquist, Johan

    2009-01-01

    We initiate an algebraic approach to the many-anyon problem based on deformed oscillator algebras. The formalism utilizes a generalization of the deformed Heisenberg algebras underlying the operator solution of the Calogero problem. We define a many-body Hamiltonian and an angular momentum operator which are relevant for a linearized analysis in the statistical parameter ν. There exists a unique ground state and, in spite of the presence of defect lines, the anyonic weight lattices are completely connected by the application of the oscillators of the algebra. This is achieved by supplementing the oscillator algebra with a certain projector algebra.

  18. UCSMP Algebra. What Works Clearinghouse Intervention Report

    What Works Clearinghouse, 2007

    2007-01-01

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

  19. A HYBRID TECHNIQUE FOR PAPR REDUCTION OF OFDM USING DHT PRECODING WITH PIECEWISE LINEAR COMPANDING

    Thammana Ajay

    2016-06-01

    Full Text Available Orthogonal Frequency Division Multiplexing (OFDM is a fascinating approach for wireless communication applications which require huge amount of data rates. However, OFDM signal suffers from its large Peak-to-Average Power Ratio (PAPR, which results in significant distortion while passing through a nonlinear device, such as a transmitter high power amplifier (HPA. Due to this high PAPR, the complexity of HPA as well as DAC also increases. For the reduction of PAPR in OFDM many techniques are available. Among them companding is an attractive low complexity technique for the OFDM signal’s PAPR reduction. Recently, a piecewise linear companding technique is recommended aiming at minimizing companding distortion. In this paper, a collective piecewise linear companding approach with Discrete Hartley Transform (DHT method is expected to reduce peak-to-average of OFDM to a great extent. Simulation results shows that this new proposed method obtains significant PAPR reduction while maintaining improved performance in the Bit Error Rate (BER and Power Spectral Density (PSD compared to piecewise linear companding method.

  20. Natural differential operations on manifolds: an algebraic approach

    Katsylo, P I; Timashev, D A

    2008-01-01

    Natural algebraic differential operations on geometric quantities on smooth manifolds are considered. A method for the investigation and classification of such operations is described, the method of IT-reduction. With it the investigation of natural operations reduces to the analysis of rational maps between k-jet spaces, which are equivariant with respect to certain algebraic groups. On the basis of the method of IT-reduction a finite generation theorem is proved: for tensor bundles V,W→M all the natural differential operations D:Γ(V)→Γ(W) of degree at most d can be algebraically constructed from some finite set of such operations. Conceptual proofs of known results on the classification of natural linear operations on arbitrary and symplectic manifolds are presented. A non-existence theorem is proved for natural deformation quantizations on Poisson manifolds and symplectic manifolds. Bibliography: 21 titles.

  1. Reduction of Under-Determined Linear Systems by Sparce Block Matrix Technique

    Tarp-Johansen, Niels Jacob; Poulsen, Peter Noe; Damkilde, Lars

    1996-01-01

    numerical stability of the aforementioned reduction. Moreover the coefficient matrix for the equilibrium equations is typically very sparse. The objective is to deal efficiently with the full pivoting reduction of sparse rectangular matrices using a dynamic storage scheme based on the block matrix concept.......Under-determined linear equation systems occur in different engineering applications. In structural engineering they typically appear when applying the force method. As an example one could mention limit load analysis based on The Lower Bound Theorem. In this application there is a set of under......-determined equilibrium equation restrictions in an LP-problem. A significant reduction of computer time spent on solving the LP-problem is achieved if the equilib rium equations are reduced before going into the optimization procedure. Experience has shown that for some structures one must apply full pivoting to ensure...

  2. On the classification of quantum W-algebras

    Bowcock, P.; Watts, G.T.M.

    1992-01-01

    In this paper we consider the structure of general quantum W-algebras. We introduce the notions of deformability, positive-definiteness, and reductivity of a W-algebra. We show that one can associate a reductive finite Lie algebra to each reductive W-algebra. The finite Lie algebra is also endowed with a preferred sl(2) subalgebra, which gives the conformal weights of the W-algebra. We extend this to cover W-algebras containing both bosonic and fermionic fields, and illustrate our ideas with the Poisson bracket algebras of generalised Drinfeld-Sokolov hamiltonian systems. We then discuss the possibilities of classifying deformable W-algebras which fall outside this class in the context of automorphisms of Lie algebras. In conclusion we list the cases in which the W-algebra has no weight-one fields, and further, those in which it has only one weight-two field. (orig.)

  3. Thinking Visually about Algebra

    Baroudi, Ziad

    2015-01-01

    Many introductions to algebra in high school begin with teaching students to generalise linear numerical patterns. This article argues that this approach needs to be changed so that students encounter variables in the context of modelling visual patterns so that the variables have a meaning. The article presents sample classroom activities,…

  4. College Algebra I.

    Benjamin, Carl; And Others

    Presented are student performance objectives, a student progress chart, and assignment sheets with objective and diagnostic measures for the stated performance objectives in College Algebra I. Topics covered include: sets; vocabulary; linear equations; inequalities; real numbers; operations; factoring; fractions; formulas; ratio, proportion, and…

  5. Waterloo Workshop on Computer Algebra

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

    2018-01-01

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

  6. Simple Lie algebras and Dynkin diagrams

    Buccella, F.

    1983-01-01

    The following theorem is studied: in a simple Lie algebra of rank p there are p positive roots such that all the other n-3p/2 positive roots are linear combinations of them with integer non negative coefficients. Dykin diagrams are built by representing the simple roots with circles and drawing a junction between the roots. Five exceptional algebras are studied, focusing on triple junction algebra, angular momentum algebra, weights of the representation, antisymmetric tensors, and subalgebras

  7. Size reduction of high- and low-moisture corn stalks by linear knife grid system

    Igathinathane, C. [Agricultural and Biological Engineering Department, 130 Creelman Street, Mississippi State University, Mississippi State, Mississippi 39762 (United States); Womac, A.R. [Department of Biosystems Engineering and Soil Science, 2506 E. J. Chapman Drive, The University of Tennessee, Knoxville, Tennessee 37996 (United States); Sokhansanj, S. [Oak Ridge National Laboratory, Environmental Sciences Division, Oak Ridge, P. O. Box 2008, Tennessee 37831 (United States); Narayan, S. [First American Scientific Company, 100 Park Royal South West Vancouver, British Columbia, V7T 1A2 (Canada)

    2009-04-15

    High- and low-moisture corn stalks were tested using a linear knife grid size reduction device developed for first-stage size reduction. The device was used in conjunction with a universal test machine that quantified shearing stress and energy characteristics for forcing a bed of corn stalks through a grid of sharp knives. No published engineering performance data for corn stover with similar devices are available to optimize performance; however, commercial knife grid systems exist for forage size reduction. From the force-displacement data, mean and maximum ultimate shear stresses, cumulative and peak mass-based cutting energies for corn stalks, and mean new surface area-based cutting energies were determined from 4-5 refill runs at two moisture contents (78.8% and 11.3% wet basis), three knife grid spacings (25.4, 50.8, and 101.6 mm), and three bed depths (50.8, 101.6, and 152.4 mm). In general, the results indicated that peak failure load, ultimate shear stress, and cutting energy values varied directly with bed depth and inversely with knife grid spacing. Mean separation analysis established that high- and low-moisture conditions and bed depths {>=} 101.6 mm did not differ significantly (P < 0.05) for ultimate stress and cutting energy values, but knife grid spacing were significantly different. Linear knife grid cutting energy requirements for both moisture conditions of corn stalks were much smaller than reported cutting energy requirements. Ultimate shear stress and cutting energy results of this research should aid the engineering design of commercial scale linear knife gird size reduction equipment for various biomass feedstocks. (author)

  8. Handbook of algebra Vol. 1

    1996-01-01

    Handbook of Algebra defines algebra as consisting of many different ideas, concepts and results. Even the nonspecialist is likely to encounter most of these, either somewhere in the literature, disguised as a definition or a theorem or to hear about them and feel the need for more information. Each chapter of the book combines some of the features of both a graduate-level textbook and a research-level survey. This book is divided into eight sections. Section 1A focuses on linear algebra and discusses such concepts as matrix functions and equations and random matrices. Section 1B cover linear d

  9. PAPR reduction in FBMC using an ACE-based linear programming optimization

    van der Neut, Nuan; Maharaj, Bodhaswar TJ; de Lange, Frederick; González, Gustavo J.; Gregorio, Fernando; Cousseau, Juan

    2014-12-01

    This paper presents four novel techniques for peak-to-average power ratio (PAPR) reduction in filter bank multicarrier (FBMC) modulation systems. The approach extends on current PAPR reduction active constellation extension (ACE) methods, as used in orthogonal frequency division multiplexing (OFDM), to an FBMC implementation as the main contribution. The four techniques introduced can be split up into two: linear programming optimization ACE-based techniques and smart gradient-project (SGP) ACE techniques. The linear programming (LP)-based techniques compensate for the symbol overlaps by utilizing a frame-based approach and provide a theoretical upper bound on achievable performance for the overlapping ACE techniques. The overlapping ACE techniques on the other hand can handle symbol by symbol processing. Furthermore, as a result of FBMC properties, the proposed techniques do not require side information transmission. The PAPR performance of the techniques is shown to match, or in some cases improve, on current PAPR techniques for FBMC. Initial analysis of the computational complexity of the SGP techniques indicates that the complexity issues with PAPR reduction in FBMC implementations can be addressed. The out-of-band interference introduced by the techniques is investigated. As a result, it is shown that the interference can be compensated for, whilst still maintaining decent PAPR performance. Additional results are also provided by means of a study of the PAPR reduction of the proposed techniques at a fixed clipping probability. The bit error rate (BER) degradation is investigated to ensure that the trade-off in terms of BER degradation is not too severe. As illustrated by exhaustive simulations, the SGP ACE-based technique proposed are ideal candidates for practical implementation in systems employing the low-complexity polyphase implementation of FBMC modulators. The methods are shown to offer significant PAPR reduction and increase the feasibility of FBMC as

  10. Elementary matrix algebra

    Hohn, Franz E

    2012-01-01

    This complete and coherent exposition, complemented by numerous illustrative examples, offers readers a text that can teach by itself. Fully rigorous in its treatment, it offers a mathematically sound sequencing of topics. The work starts with the most basic laws of matrix algebra and progresses to the sweep-out process for obtaining the complete solution of any given system of linear equations - homogeneous or nonhomogeneous - and the role of matrix algebra in the presentation of useful geometric ideas, techniques, and terminology.Other subjects include the complete treatment of the structur

  11. College algebra

    Kolman, Bernard

    1985-01-01

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

  12. Linear Models

    Searle, Shayle R

    2012-01-01

    This 1971 classic on linear models is once again available--as a Wiley Classics Library Edition. It features material that can be understood by any statistician who understands matrix algebra and basic statistical methods.

  13. Reduction of a symplectic-like Lie algebroid with momentum map and its application to fiberwise linear Poisson structures

    Marrero, Juan Carlos; Padrón, Edith; Rodríguez-Olmos, Miguel

    2012-01-01

    This paper addresses the problem of developing an extension of the Marsden–Weinstein reduction process to symplectic-like Lie algebroids, and in particular to the case of the canonical cover of a fiberwise linear Poisson structure, whose reduction process is the analog to cotangent bundle reduction in the context of Lie algebroids. Dedicated to the memory of Jerrold E Marsden (paper)

  14. The Water-Induced Linear Reduction Gas Diffusivity Model Extended to Three Pore Regions

    Chamindu, T. K. K. Deepagoda; de Jonge, Lis Wollesen; Kawamoto, Ken

    2015-01-01

    . Characterization of soil functional pore structure is an essential prerequisite to understand key gas transport processes in variably saturated soils in relation to soil ecosystems, climate, and environmental services. In this study, the water-induced linear reduction (WLR) soil gas diffusivity model originally...... gas diffusivity from moist to dry conditions across differently structured porous media, including narrow soil size fractions, perforated plastic blocks, fractured limestone, peaty soils, aggregated volcanic ash soils, and particulate substrates for Earth- or space-based applications. The new Cip...

  15. Inverting the Linear Algebra Classroom

    Talbert, Robert

    2014-01-01

    The inverted classroom is a course design model in which students' initial contact with new information takes place outside of class meetings, and students spend class time on high-level sense-making activities. The inverted classroom model is so called because it inverts or "flips" the usual classroom design where typically class…

  16. Approximate Implicitization Using Linear Algebra

    Oliver J. D. Barrowclough

    2012-01-01

    Full Text Available We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design (CAGD systems. We unify the approaches under the names of commonly known polynomial basis functions and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.

  17. Linear Algebra and Analysis Masterclasses

    ematical physics, computer science, numerical analysis, and statistics. ... search and has been used in mathematical physics, computer science, ... concrete examples of the spaces, enabling application of the theory to a variety of problems.

  18. Linear algebra and group theory

    Smirnov, VI

    2011-01-01

    This accessible text by a Soviet mathematician features material not otherwise available to English-language readers. Its three-part treatment covers determinants and systems of equations, matrix theory, and group theory. 1961 edition.

  19. Complex Algebraic Varieties

    Peternell, Thomas; Schneider, Michael; Schreyer, Frank-Olaf

    1992-01-01

    The Bayreuth meeting on "Complex Algebraic Varieties" focussed on the classification of algebraic varieties and topics such as vector bundles, Hodge theory and hermitian differential geometry. Most of the articles in this volume are closely related to talks given at the conference: all are original, fully refereed research articles. CONTENTS: A. Beauville: Annulation du H(1) pour les fibres en droites plats.- M. Beltrametti, A.J. Sommese, J.A. Wisniewski: Results on varieties with many lines and their applications to adjunction theory.- G. Bohnhorst, H. Spindler: The stability of certain vector bundles on P(n) .- F. Catanese, F. Tovena: Vector bundles, linear systems and extensions of (1).- O. Debarre: Vers uns stratification de l'espace des modules des varietes abeliennes principalement polarisees.- J.P. Demailly: Singular hermitian metrics on positive line bundles.- T. Fujita: On adjoint bundles of ample vector bundles.- Y. Kawamata: Moderate degenerations of algebraic surfaces.- U. Persson: Genus two fibra...

  20. Algebraic topology a primer

    Deo, Satya

    2018-01-01

    This book presents the first concepts of the topics in algebraic topology such as the general simplicial complexes, simplicial homology theory, fundamental groups, covering spaces and singular homology theory in greater detail. Originally published in 2003, this book has become one of the seminal books. Now, in the completely revised and enlarged edition, the book discusses the rapidly developing field of algebraic topology. Targeted to undergraduate and graduate students of mathematics, the prerequisite for this book is minimal knowledge of linear algebra, group theory and topological spaces. The book discusses about the relevant concepts and ideas in a very lucid manner, providing suitable motivations and illustrations. All relevant topics are covered, including the classical theorems like the Brouwer’s fixed point theorem, Lefschetz fixed point theorem, Borsuk-Ulam theorem, Brouwer’s separation theorem and the theorem on invariance of the domain. Most of the exercises are elementary, but sometimes chal...

  1. Biderivations of W-algebra $W(2,2)$ and Virasoro algebra without skewsymmetric condition and their applications

    Tang, Xiaomin

    2016-01-01

    In this paper, we characterize the biderivations of W-algebra $W(2,2)$ and Virasoro algebra $Vir$ without skewsymmetric condition. We get two classes of non-inner biderivations. As applications, we also get the forms of linear commuting maps on W-algebra $W(2,2)$ and Virasoro algebra $Vir$.

  2. Equivalency of two-dimensional algebras

    Santos, Gildemar Carneiro dos; Pomponet Filho, Balbino Jose S.

    2011-01-01

    Full text: Let us consider a vector z = xi + yj over the field of real numbers, whose basis (i,j) satisfy a given algebra. Any property of this algebra will be reflected in any function of z, so we can state that the knowledge of the properties of an algebra leads to more general conclusions than the knowledge of the properties of a function. However structural properties of an algebra do not change when this algebra suffers a linear transformation, though the structural constants defining this algebra do change. We say that two algebras are equivalent to each other whenever they are related by a linear transformation. In this case, we have found that some relations between the structural constants are sufficient to recognize whether or not an algebra is equivalent to another. In spite that the basis transform linearly, the structural constants change like a third order tensor, but some combinations of these tensors result in a linear transformation, allowing to write the entries of the transformation matrix as function of the structural constants. Eventually, a systematic way to find the transformation matrix between these equivalent algebras is obtained. In this sense, we have performed the thorough classification of associative commutative two-dimensional algebras, and find that even non-division algebra may be helpful in solving non-linear dynamic systems. The Mandelbrot set was used to have a pictorial view of each algebra, since equivalent algebras result in the same pattern. Presently we have succeeded in classifying some non-associative two-dimensional algebras, a task more difficult than for associative one. (author)

  3. N=2 current algebra and coset models

    Hull, C.M.; Spence, B.

    1990-01-01

    The N=2 supersymmetric extension of the Kac-Moody algebra and the corresponding Sugawara construction of the N=2 superconformal algebra are discussed both in components and in N=1 superspace. A formulation of the Kac-Moody algebra and Sugawara construction is given in N=2 superspace in terms of supercurrents satisfying a non-linear chiral constraint. The operator product of two supercurrents includes terms that are non-linear in the supercurrents. The N=2 generalization of the GKO coset construction is then given and the conditions found by Kazama and Suzuki are seen to arise from the non-linearity of the algebra. (orig.)

  4. Comments on N=4 superconformal algebras

    Rasmussen, J.

    2001-01-01

    We present a new and asymmetric N=4 superconformal algebra for arbitrary central charge, thus completing our recent work on its classical analogue with vanishing central charge. Besides the Virasoro generator and 4 supercurrents, the algebra consists of an internal SU(2)xU(1) Kac-Moody algebra in addition to two spin 1/2 fermions and a bosonic scalar. The algebra is shown to be invariant under a linear twist of the generators, except for a unique value of the continuous twist parameter. At this value, the invariance is broken and the algebra collapses to the small N=4 superconformal algebra. The asymmetric N=4 superconformal algebra may be seen as induced by an affine SL(2 vertical bar 2) current superalgebra. Replacing SL(2 vertical bar 2) with the coset SL(2 vertical bar 2)/U(1), results directly in the small N=4 superconformal algebra

  5. Clifford algebras and the minimal representations of the 1D N-extended supersymmetry algebra

    Toppan, Francesco

    2008-01-01

    The Atiyah-Bott-Shapiro classification of the irreducible Clifford algebra is used to derive general properties of the minimal representations of the 1D N-Extended Supersymmetry algebra (the Z 2 -graded symmetry algebra of the Supersymmetric Quantum Mechanics) linearly realized on a finite number of fields depending on a real parameter t, the time. (author)

  6. Linear modeling of turbulent skin-friction reduction due to spanwise wall motion

    Duque-Daza, Carlos; Baig, Mirza; Lockerby, Duncan; Chernyshenko, Sergei; Davies, Christopher; University of Warwick Team; Imperial College Team; Cardiff University Team

    2012-11-01

    We present a study on the effect of streamwise-travelling waves of spanwise wall velocity on the growth of near-wall turbulent streaks using a linearized formulation of the Navier-Stokes equations. The changes in streak amplification due to the travelling waves induced by the wall velocity are compared to published results of direct numerical simulation (DNS) predictions of the turbulent skin-friction reduction over a range of parameters; a clear correlation between these two sets of results is observed. Additional linearized simulations but at a much higher Reynolds numbers, more relevant to aerospace applications, produce results that show no marked differences to those obtained at low Reynolds number. It is also observed that a close correlation exists between DNS data of drag reduction and a very simple characteristic of the ``generalized'' Stokes layer generated by the streamwise-travelling waves. Carlos.Duque-Daza@warwick.ac.uk - School of Engineering, University of Warwick, Coventry CV4 7AL, UK caduqued@unal.edu.co - Department of Mechanical and Mechatronics Engineering, Universidad Nacional de Colombia.

  7. Biderivations of finite dimensional complex simple Lie algebras

    Tang, Xiaomin

    2016-01-01

    In this paper, we prove that a biderivation of a finite dimensional complex simple Lie algebra without the restriction of skewsymmetric is inner. As an application, the biderivation of a general linear Lie algebra is presented. In particular, we find a class of a non-inner and non-skewsymmetric biderivations. Furthermore, we also get the forms of linear commuting maps on the finite dimensional complex simple Lie algebra or general linear Lie algebra.

  8. Boundary Lax pairs from non-ultra-local Poisson algebras

    Avan, Jean; Doikou, Anastasia

    2009-01-01

    We consider non-ultra-local linear Poisson algebras on a continuous line. Suitable combinations of representations of these algebras yield representations of novel generalized linear Poisson algebras or 'boundary' extensions. They are parametrized by a boundary scalar matrix and depend, in addition, on the choice of an antiautomorphism. The new algebras are the classical-linear counterparts of the known quadratic quantum boundary algebras. For any choice of parameters, the non-ultra-local contribution of the original Poisson algebra disappears. We also systematically construct the associated classical Lax pair. The classical boundary principal chiral model is examined as a physical example.

  9. Elements of algebraic coding systems

    Cardoso da Rocha, Jr, Valdemar

    2014-01-01

    Elements of Algebraic Coding Systems is an introductory text to algebraic coding theory. In the first chapter, you'll gain inside knowledge of coding fundamentals, which is essential for a deeper understanding of state-of-the-art coding systems. This book is a quick reference for those who are unfamiliar with this topic, as well as for use with specific applications such as cryptography and communication. Linear error-correcting block codes through elementary principles span eleven chapters of the text. Cyclic codes, some finite field algebra, Goppa codes, algebraic decoding algorithms, and applications in public-key cryptography and secret-key cryptography are discussed, including problems and solutions at the end of each chapter. Three appendices cover the Gilbert bound and some related derivations, a derivation of the Mac- Williams' identities based on the probability of undetected error, and two important tools for algebraic decoding-namely, the finite field Fourier transform and the Euclidean algorithm f...

  10. Algebraic entropy for algebraic maps

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

    2016-01-01

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

  11. A q-deformed Lorentz algebra

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

    1991-01-01

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

  12. Algebraic and stochastic coding theory

    Kythe, Dave K

    2012-01-01

    Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.

  13. Algebraic computing

    MacCallum, M.A.H.

    1990-01-01

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

  14. Revisiting the O(3) non-linear sigma model and its Pohlmeyer reduction

    Pastras, Georgios [NCSR ' ' Demokritos' ' , Institute of Nuclear and Particle Physics, Attiki (Greece)

    2018-01-15

    It is well known that sigma models in symmetric spaces accept equivalent descriptions in terms of integrable systems, such as the sine-Gordon equation, through Pohlmeyer reduction. In this paper, we study the mapping between known solutions of the Euclidean O(3) non-linear sigma model, such as instantons, merons and elliptic solutions that interpolate between the latter, and solutions of the Pohlmeyer reduced theory, namely the sinh-Gordon equation. It turns out that instantons do not have a counterpart, merons correspond to the ground state, while the class of elliptic solutions is characterized by a two to one correspondence between solutions in the two descriptions. (copyright 2017 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  15. Non linear optical investigations of silver nanoparticles synthesised by curcumin reduction

    Dhanya, N. P.

    2017-11-01

    Metal nanoparticles have considerable applications in assorted fields like medicine, biology, photonics, metallurgy etc. Optical applications of Silver nanoparticles are of significant interest among researchers nowadays. In this paper, we report a single step chemical reduction of silver nanoparticles with Curcumin both as a reducing and stabilising agent at room temperature. Structural, plasmonic and non linear optical properties of the prepared nanoparticles are explored using Scanning Electron Microscope, Transmission Electron Microscope, UV absorption spectrometry, Spectroflurometry and Z scan. UV-Vis absorption studies affirm the Surface Plasmon Resonance (SPR) absorption and spectroflurometric studies announce the emission spectrum of the prepared silvernanoparticles at 520 nm. SEM and TEM images uphold the existence of uniform sized, spherical silvernanoparticles. Nonlinear optical studies are accomplished with the open aperture z scan technique in the nanosecond regime. The nonlinearity is in virtue of saturable absorption, two-photon absorption and excited state absorption. The marked nonlinearity and optical limiting of the Curcumin reduced silvernanoparticles enhances its photonic applications.

  16. Torque ripple reduction of brushless DC motor based on adaptive input-output feedback linearization.

    Shirvani Boroujeni, M; Markadeh, G R Arab; Soltani, J

    2017-09-01

    Torque ripple reduction of Brushless DC Motors (BLDCs) is an interesting subject in variable speed AC drives. In this paper at first, a mathematical expression for torque ripple harmonics is obtained. Then for a non-ideal BLDC motor with known harmonic contents of back-EMF, calculation of desired reference current amplitudes, which are required to eliminate some selected harmonics of torque ripple, are reviewed. In order to inject the reference harmonic currents to the motor windings, an Adaptive Input-Output Feedback Linearization (AIOFBL) control is proposed, which generates the reference voltages for three phases voltage source inverter in stationary reference frame. Experimental results are presented to show the capability and validity of the proposed control method and are compared with the vector control in Multi-Reference Frame (MRF) and Pseudo-Vector Control (P-VC) method results. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  17. Lie algebras

    Jacobson, Nathan

    1979-01-01

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

  18. Observable algebras for the rational and trigonometric Euler-Calogero-Moser Models

    Avan, J.; Billey, E.

    1995-01-01

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

  19. A blood pressure monitor with robust noise reduction system under linear cuff inflation and deflation.

    Usuda, Takashi; Kobayashi, Naoki; Takeda, Sunao; Kotake, Yoshifumi

    2010-01-01

    We have developed the non-invasive blood pressure monitor which can measure the blood pressure quickly and robustly. This monitor combines two measurement mode: the linear inflation and the linear deflation. On the inflation mode, we realized a faster measurement with rapid inflation rate. On the deflation mode, we realized a robust noise reduction. When there is neither noise nor arrhythmia, the inflation mode incorporated on this monitor provides precise, quick and comfortable measurement. Once the inflation mode fails to calculate appropriate blood pressure due to body movement or arrhythmia, then the monitor switches automatically to the deflation mode and measure blood pressure by using digital signal processing as wavelet analysis, filter bank, filter combined with FFT and Inverse FFT. The inflation mode succeeded 2440 measurements out of 3099 measurements (79%) in an operating room and a rehabilitation room. The new designed blood pressure monitor provides the fastest measurement for patient with normal circulation and robust measurement for patients with body movement or severe arrhythmia. Also this fast measurement method provides comfortableness for patients.

  20. A new subalgebra of the Lie algebra A2 and two types of integrable Hamiltonian hierarchies, expanding integrable models

    Yan Qingyou; Zhang Yufeng; Wei Xiaopeng

    2004-01-01

    A new subalgebra G of the Lie algebra A 2 is first constructed. Then two loop algebra G-bar 1 , G-bar 2 are presented in terms of different definitions of gradations. Using G-bar 1 , G-bar 2 designs two isospectral problems, respectively. Again utilizing Tu-pattern obtains two types of various integrable Hamiltonian hierarchies of evolution equations. As reduction cases, the well-known Schroedinger equation and MKdV equation are obtained. At last, we turn the subalgebras G-bar 1 , G-bar 2 of the loop algebra A-bar 2 into equivalent subalgebras of the loop algebra A-bar 1 by making a suitable linear transformation so that the two types of 5-dimensional loop algebras are constructed. Two kinds of integrable couplings of the obtained hierarchies are showed. Specially, the integrable couplings of Schroedinger equation and MKdV equation are obtained, respectively

  1. Drag reduction of a car model by linear genetic programming control

    Li, Ruiying; Noack, Bernd R.; Cordier, Laurent; Borée, Jacques; Harambat, Fabien

    2017-08-01

    We investigate open- and closed-loop active control for aerodynamic drag reduction of a car model. Turbulent flow around a blunt-edged Ahmed body is examined at ReH≈ 3× 105 based on body height. The actuation is performed with pulsed jets at all trailing edges (multiple inputs) combined with a Coanda deflection surface. The flow is monitored with 16 pressure sensors distributed at the rear side (multiple outputs). We apply a recently developed model-free control strategy building on genetic programming in Dracopoulos and Kent (Neural Comput Appl 6:214-228, 1997) and Gautier et al. (J Fluid Mech 770:424-441, 2015). The optimized control laws comprise periodic forcing, multi-frequency forcing and sensor-based feedback including also time-history information feedback and combinations thereof. Key enabler is linear genetic programming (LGP) as powerful regression technique for optimizing the multiple-input multiple-output control laws. The proposed LGP control can select the best open- or closed-loop control in an unsupervised manner. Approximately 33% base pressure recovery associated with 22% drag reduction is achieved in all considered classes of control laws. Intriguingly, the feedback actuation emulates periodic high-frequency forcing. In addition, the control identified automatically the only sensor which listens to high-frequency flow components with good signal to noise ratio. Our control strategy is, in principle, applicable to all multiple actuators and sensors experiments.

  2. Error-Detecting Identification Codes for Algebra Students.

    Sutherland, David C.

    1990-01-01

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

  3. g Algebra and two-dimensional quasiexactly solvable Hamiltonian ...

    Keywords. g2 algebra; quasiexactly solvable Hamiltonian; hidden algebra; Poschl–Teller potential. ... space of the polynomials, restricting to a linear transformation on this space, the associ- .... The operators L6 and L7 are the positive root.

  4. Underlying theory based on quaternions for Alder's algebraic chromodynamics

    Horwitz, L.P.; Biedenharn, L.C.

    1981-01-01

    It is shown that the complex-linear tensor product for quantum quaternionic Hilbert (module) spaces provides an algebraic structure for the non-local gauge field in Adler's algebraic chromodynamics for U

  5. ALGEBRAIC TOPOLOGY

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

  6. Algebraic stacks

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

  7. Prime alternative algebras that are nearly commutative

    Pchelintsev, S V

    2004-01-01

    We prove that by deforming the multiplication in a prime commutative alternative algebra using a C-operation we obtain a prime non-commutative alternative algebra. Under certain restrictions on non-commutative algebras this relation between algebras is reversible. Isotopes are special cases of deformations. We introduce and study a linear space generated by the Bruck C-operations. We prove that the Bruck space is generated by operations of rank 1 and 2 and that 'general' Bruck operations of rank 2 are independent in the following sense: a sum of n operations of rank 2 cannot be written as a linear combination of (n-1) operations of rank 2 and an arbitrary operation of rank 1. We describe infinite series of non-isomorphic prime non-commutative algebras of bounded degree that are deformations of a concrete prime commutative algebra

  8. Algebraic characterizations of measure algebras

    Jech, Thomas

    2008-01-01

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

  9. Quantum W-algebras and elliptic algebras

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

    1996-01-01

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

  10. On 2-Banach algebras

    Mohammad, N.; Siddiqui, A.H.

    1987-11-01

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

  11. Quantum algebra of N superspace

    Hatcher, Nicolas; Restuccia, A.; Stephany, J.

    2007-01-01

    We identify the quantum algebra of position and momentum operators for a quantum system bearing an irreducible representation of the super Poincare algebra in the N>1 and D=4 superspace, both in the case where there are no central charges in the algebra, and when they are present. This algebra is noncommutative for the position operators. We use the properties of superprojectors acting on the superfields to construct explicit position and momentum operators satisfying the algebra. They act on the projected wave functions associated to the various supermultiplets with defined superspin present in the representation. We show that the quantum algebra associated to the massive superparticle appears in our construction and is described by a supermultiplet of superspin 0. This result generalizes the construction for D=4, N=1 reported recently. For the case N=2 with central charges, we present the equivalent results when the central charge and the mass are different. For the κ-symmetric case when these quantities are equal, we discuss the reduction to the physical degrees of freedom of the corresponding superparticle and the construction of the associated quantum algebra

  12. Lie-Algebras. Pt. 1

    Baeuerle, G.G.A.; Kerf, E.A. de

    1990-01-01

    The structure of the laws in physics is largely based on symmetries. This book is on Lie algebras, the mathematics of symmetry. It gives a thorough mathematical treatment of finite dimensional Lie algebras and Kac-Moody algebras. Concepts such as Cartan matrix, root system, Serre's construction are carefully introduced. Although the book can be read by an undergraduate with only an elementary knowledge of linear algebra, the book will also be of use to the experienced researcher. Experience has shown that students who followed the lectures are well-prepared to take on research in the realms of string-theory, conformal field-theory and integrable systems. 48 refs.; 66 figs.; 3 tabs

  13. A Linear Programming Approach to the Development of Contrail Reduction Strategies Satisfying Operationally Feasible Constraints

    Wei, Peng; Sridhar, Banavar; Chen, Neil Yi-Nan; Sun, Dengfent

    2012-01-01

    A class of strategies has been proposed to reduce contrail formation in the United States airspace. A 3D grid based on weather data and the cruising altitude level of aircraft is adjusted to avoid the persistent contrail potential area with the consideration to fuel-efficiency. In this paper, the authors introduce a contrail avoidance strategy on 3D grid by considering additional operationally feasible constraints from an air traffic controller's aspect. First, shifting too many aircraft to the same cruising level will make the miles-in-trail at this level smaller than the safety separation threshold. Furthermore, the high density of aircraft at one cruising level may exceed the workload for the traffic controller. Therefore, in our new model we restrict the number of total aircraft at each level. Second, the aircraft count variation for successive intervals cannot be too drastic since the workload to manage climbing/descending aircraft is much larger than managing cruising aircraft. The contrail reduction is formulated as an integer-programming problem and the problem is shown to have the property of total unimodularity. Solving the corresponding relaxed linear programming with the simplex method provides an optimal and integral solution to the problem. Simulation results are provided to illustrate the methodology.

  14. Color Algebras

    Mulligan, Jeffrey B.

    2017-01-01

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

  15. Multilinear Computing and Multilinear Algebraic Geometry

    2016-08-10

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

  16. Current algebra

    Jacob, M.

    1967-01-01

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

  17. Invariants of generalized Lie algebras

    Agrawala, V.K.

    1981-01-01

    Invariants and invariant multilinear forms are defined for generalized Lie algebras with arbitrary grading and commutation factor. Explicit constructions of invariants and vector operators are given by contracting invariant forms with basic elements of the generalized Lie algebra. The use of the matrix of a linear map between graded vector spaces is emphasized. With the help of this matrix, the concept of graded trace of a linear operator is introduced, which is a rich source of multilinear forms of degree zero. To illustrate the use of invariants, a characteristic identity similar to that of Green is derived and a few Racah coefficients are evaluated in terms of invariants

  18. Quantization and representation theory of finite W algebras

    Boer, J. de; Tjin, T.

    1993-01-01

    In this paper we study the finitely generated algebras underlying W algebras. These so called 'finite W algebras' are constructed as Poisson reductions of Kirillov Poisson structures on simple Lie algebras. The inequivalent reductions are labeled by the inequivalent embeddings of sl 2 into the simple Lie algebra in question. For arbitrary embeddings a coordinate free formula for the reduced Poisson structure is derived. We also prove that any finite W algebra can be embedded into the Kirillov Poisson algebra of a (semi)simple Lie algebra (generalized Miura map). Furthermore it is shown that generalized finite Toda systems are reductions of a system describing a free particle moving on a group manifold and that they have finite W symmetry. In the second part we BRST quantize the finite W algebras. The BRST cohomoloy is calculated using a spectral sequence (which is different from the one used by Feigin and Frenkel). This allows us to quantize all finite W algebras in one stroke. Examples are given. In the last part of the paper we study the representation theory of finite W algebras. It is shown, using a quantum inversion of the generalized Miura transformation, that the representations of finite W algebras can be constructed from the representations of a certain Lie subalgebra of the original simple Lie algebra. As a byproduct of this we are able to construct the Fock realizations of arbitrary finite W algebras. (orig.)

  19. Fibered F-Algebra

    Kleyn, Aleks

    2007-01-01

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

  20. A Novel Four-Dimensional Energy-Saving and Emission-Reduction System and Its Linear Feedback Control

    Minggang Wang

    2012-01-01

    Full Text Available This paper reports a new four-dimensional energy-saving and emission-reduction chaotic system. The system is obtained in accordance with the complicated relationship between energy saving and emission reduction, carbon emission, economic growth, and new energy development. The dynamics behavior of the system will be analyzed by means of Lyapunov exponents and equilibrium points. Linear feedback control methods are used to suppress chaos to unstable equilibrium. Numerical simulations are presented to show these results.

  1. Ant colony method to control variance reduction techniques in the Monte Carlo simulation of clinical electron linear accelerators

    Garcia-Pareja, S. [Servicio de Radiofisica Hospitalaria, Hospital Regional Universitario ' Carlos Haya' , Avda. Carlos Haya, s/n, E-29010 Malaga (Spain)], E-mail: garciapareja@gmail.com; Vilches, M. [Servicio de Fisica y Proteccion Radiologica, Hospital Regional Universitario ' Virgen de las Nieves' , Avda. de las Fuerzas Armadas, 2, E-18014 Granada (Spain); Lallena, A.M. [Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, E-18071 Granada (Spain)

    2007-09-21

    The ant colony method is used to control the application of variance reduction techniques to the simulation of clinical electron linear accelerators of use in cancer therapy. In particular, splitting and Russian roulette, two standard variance reduction methods, are considered. The approach can be applied to any accelerator in a straightforward way and permits, in addition, to investigate the 'hot' regions of the accelerator, an information which is basic to develop a source model for this therapy tool.

  2. Ant colony method to control variance reduction techniques in the Monte Carlo simulation of clinical electron linear accelerators

    Garcia-Pareja, S.; Vilches, M.; Lallena, A.M.

    2007-01-01

    The ant colony method is used to control the application of variance reduction techniques to the simulation of clinical electron linear accelerators of use in cancer therapy. In particular, splitting and Russian roulette, two standard variance reduction methods, are considered. The approach can be applied to any accelerator in a straightforward way and permits, in addition, to investigate the 'hot' regions of the accelerator, an information which is basic to develop a source model for this therapy tool

  3. An algebraic approach to the scattering equations

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

    2015-12-10

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

  4. Deriving the Regression Line with Algebra

    Quintanilla, John A.

    2017-01-01

    Exploration with spreadsheets and reliance on previous skills can lead students to determine the line of best fit. To perform linear regression on a set of data, students in Algebra 2 (or, in principle, Algebra 1) do not have to settle for using the mysterious "black box" of their graphing calculators (or other classroom technologies).…

  5. Robust Algebraic Multilevel Methods and Algorithms

    Kraus, Johannes

    2009-01-01

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

  6. An algebraic approach to the scattering equations

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

    2015-01-01

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

  7. Coherent states for polynomial su(2) algebra

    Sadiq, Muhammad; Inomata, Akira

    2007-01-01

    A class of generalized coherent states is constructed for a polynomial su(2) algebra in a group-free manner. As a special case, the coherent states for the cubic su(2) algebra are discussed. The states so constructed reduce to the usual SU(2) coherent states in the linear limit

  8. Some Applications of Algebraic System Solving

    Roanes-Lozano, Eugenio

    2011-01-01

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

  9. Non-linear quantization error reduction for the temperature measurement subsystem on-board LISA Pathfinder

    Sanjuan, J.; Nofrarias, M.

    2018-04-01

    Laser Interferometer Space Antenna (LISA) Pathfinder is a mission to test the technology enabling gravitational wave detection in space and to demonstrate that sub-femto-g free fall levels are possible. To do so, the distance between two free falling test masses is measured to unprecedented sensitivity by means of laser interferometry. Temperature fluctuations are one of the noise sources limiting the free fall accuracy and the interferometer performance and need to be known at the ˜10 μK Hz-1/2 level in the sub-millihertz frequency range in order to validate the noise models for the future space-based gravitational wave detector LISA. The temperature measurement subsystem on LISA Pathfinder is in charge of monitoring the thermal environment at key locations with noise levels of 7.5 μK Hz-1/2 at the sub-millihertz. However, its performance worsens by one to two orders of magnitude when slowly changing temperatures are measured due to errors introduced by analog-to-digital converter non-linearities. In this paper, we present a method to reduce this effect by data post-processing. The method is applied to experimental data available from on-ground validation tests to demonstrate its performance and the potential benefit for in-flight data. The analog-to-digital converter effects are reduced by a factor between three and six in the frequencies where the errors play an important role. An average 2.7 fold noise reduction is demonstrated in the 0.3 mHz-2 mHz band.

  10. Quasi exactly solvable operators and abstract associative algebras

    Brihaye, Y.; Kosinski, P.

    1998-01-01

    We consider the vector spaces consisting of direct sums of polynomials of given degrees and we show how to classify the linear differential operators preserving these spaces. The families of operators so obtained are identified as the envelopping algebras of particular abstract associative algebras. Some of these operators can be transformed into quasi exactly solvable Schroedinger operators which, having a hidden algebra, can be partially solved algebraically; we exhibit however a series of Schoedinger equations which, while completely solvable algebraically, do not possess a hidden algebra

  11. Generalized symmetry algebras

    Dragon, N.

    1979-01-01

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

  12. Algebraic functions

    Bliss, Gilbert Ames

    1933-01-01

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

  13. GLq(N)-covariant quantum algebras and covariant differential calculus

    Isaev, A.P.; Pyatov, P.N.

    1993-01-01

    We consider GL q (N)-covariant quantum algebras with generators satisfying quadratic polynomial relations. We show that, up to some inessential arbitrariness, there are only two kinds of such quantum algebras, namely, the algebras with q-deformed commutation and q-deformed anticommutation relations. The connection with the bicovariant differential calculus on the linear quantum groups is discussed. (orig.)

  14. Algebra II textbook for students of mathematics

    Gorodentsev, Alexey L

    2017-01-01

    This book is the second volume of an intensive “Russian-style” two-year undergraduate course in abstract algebra, and introduces readers to the basic algebraic structures – fields, rings, modules, algebras, groups, and categories – and explains the main principles of and methods for working with them. The course covers substantial areas of advanced combinatorics, geometry, linear and multilinear algebra, representation theory, category theory, commutative algebra, Galois theory, and algebraic geometry – topics that are often overlooked in standard undergraduate courses. This textbook is based on courses the author has conducted at the Independent University of Moscow and at the Faculty of Mathematics in the Higher School of Economics. The main content is complemented by a wealth of exercises for class discussion, some of which include comments and hints, as well as problems for independent study.

  15. Algebra I textbook for students of mathematics

    Gorodentsev, Alexey L

    2016-01-01

    This book is the first volume of an intensive “Russian-style” two-year undergraduate course in abstract algebra, and introduces readers to the basic algebraic structures – fields, rings, modules, algebras, groups, and categories – and explains the main principles of and methods for working with them. The course covers substantial areas of advanced combinatorics, geometry, linear and multilinear algebra, representation theory, category theory, commutative algebra, Galois theory, and algebraic geometry – topics that are often overlooked in standard undergraduate courses. This textbook is based on courses the author has conducted at the Independent University of Moscow and at the Faculty of Mathematics in the Higher School of Economics. The main content is complemented by a wealth of exercises for class discussion, some of which include comments and hints, as well as problems for independent study.

  16. A linear programming manual

    Tuey, R. C.

    1972-01-01

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

  17. Iterated Leavitt Path Algebras

    Hazrat, R.

    2009-11-01

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

  18. Role of associativity in Ramsey algebras

    Andrew Rajah

    2017-11-02

    Nov 2, 2017 ... Z2 → Z is defined by −(x, y) = y − x, is not a Ramsey algebra .... A function μ : V → G will be known as an assignment on V to abstract the idea of μ ... The concept of a reduction is central to the notion of a Ramsey algebra.

  19. Current algebra for parafields

    Palev, Ch.D.

    1976-01-01

    Within the framework of the Lagrangean QFT a generalization of canonical commutation and anticommutation relations in terms of three-linear commutation relations, corresponding to the parastatistics, s discussed. A detailed derivation of these three-linear relations for a set of parafermi fields is presented. Then for a Lagrangean, depending of a family of parabose fields and a family of paraferm fields, is shown that the fundamental hypothesis of current algebra is valid. In other words, the currents corresponding to the linear gauge transformations are found to meet the commutation relation: [Jsub(f)sup(0)(x), Jsub(g)sup(0)]sub(x 0 =y 0 ) = -idelta(x vector - y vector)Jsub([f,g])sup(0) (x), where Jsub(f)sup(0) is a time component of the current, corresponding to transformation f. (S.P.)

  20. Universal algebra

    Grätzer, George

    1979-01-01

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

  1. A non-linear dimension reduction methodology for generating data-driven stochastic input models

    Ganapathysubramanian, Baskar; Zabaras, Nicholas

    2008-06-01

    Stochastic analysis of random heterogeneous media (polycrystalline materials, porous media, functionally graded materials) provides information of significance only if realistic input models of the topology and property variations are used. This paper proposes a framework to construct such input stochastic models for the topology and thermal diffusivity variations in heterogeneous media using a data-driven strategy. Given a set of microstructure realizations (input samples) generated from given statistical information about the medium topology, the framework constructs a reduced-order stochastic representation of the thermal diffusivity. This problem of constructing a low-dimensional stochastic representation of property variations is analogous to the problem of manifold learning and parametric fitting of hyper-surfaces encountered in image processing and psychology. Denote by M the set of microstructures that satisfy the given experimental statistics. A non-linear dimension reduction strategy is utilized to map M to a low-dimensional region, A. We first show that M is a compact manifold embedded in a high-dimensional input space Rn. An isometric mapping F from M to a low-dimensional, compact, connected set A⊂Rd(d≪n) is constructed. Given only a finite set of samples of the data, the methodology uses arguments from graph theory and differential geometry to construct the isometric transformation F:M→A. Asymptotic convergence of the representation of M by A is shown. This mapping F serves as an accurate, low-dimensional, data-driven representation of the property variations. The reduced-order model of the material topology and thermal diffusivity variations is subsequently used as an input in the solution of stochastic partial differential equations that describe the evolution of dependant variables. A sparse grid collocation strategy (Smolyak algorithm) is utilized to solve these stochastic equations efficiently. We showcase the methodology by constructing low

  2. A non-linear dimension reduction methodology for generating data-driven stochastic input models

    Ganapathysubramanian, Baskar; Zabaras, Nicholas

    2008-01-01

    Stochastic analysis of random heterogeneous media (polycrystalline materials, porous media, functionally graded materials) provides information of significance only if realistic input models of the topology and property variations are used. This paper proposes a framework to construct such input stochastic models for the topology and thermal diffusivity variations in heterogeneous media using a data-driven strategy. Given a set of microstructure realizations (input samples) generated from given statistical information about the medium topology, the framework constructs a reduced-order stochastic representation of the thermal diffusivity. This problem of constructing a low-dimensional stochastic representation of property variations is analogous to the problem of manifold learning and parametric fitting of hyper-surfaces encountered in image processing and psychology. Denote by M the set of microstructures that satisfy the given experimental statistics. A non-linear dimension reduction strategy is utilized to map M to a low-dimensional region, A. We first show that M is a compact manifold embedded in a high-dimensional input space R n . An isometric mapping F from M to a low-dimensional, compact, connected set A is contained in R d (d<< n) is constructed. Given only a finite set of samples of the data, the methodology uses arguments from graph theory and differential geometry to construct the isometric transformation F:M→A. Asymptotic convergence of the representation of M by A is shown. This mapping F serves as an accurate, low-dimensional, data-driven representation of the property variations. The reduced-order model of the material topology and thermal diffusivity variations is subsequently used as an input in the solution of stochastic partial differential equations that describe the evolution of dependant variables. A sparse grid collocation strategy (Smolyak algorithm) is utilized to solve these stochastic equations efficiently. We showcase the methodology

  3. Circle Maps and C*-algebras

    Schmidt, Thomas Lundsgaard

    such a map, generalising the transformation groupoid of a local homeomorphism first introduced by Renault in \\cite{re}. We conduct a detailed study of the relationship between the dynamics of $\\phi$, the properties of these groupoids, the structure of their corresponding reduced groupoid $C^*$-algebras, and......, for certain classes of maps, the K-theory of these algebras. When the map $\\phi$ is transitive, we show that the algebras $C^*_r(\\Gamma_\\phi)$ and $C^*_r(\\Gamma_\\phi^+)$ are purely infinite and satisfy the Universal Coefficient Theorem. Furthermore, we find necessary and sufficient conditions for simplicity...... of these algebras in terms of dynamical properties of $\\phi$. We proceed to consider the situation when the algebras are non-simple, and describe the primitive ideal spectrum in this case. We prove that any irreducible representation factors through the $C^*$-algebra of the reduction of the groupoid to the orbit...

  4. Enveloping algebras of Lie groups with descrete series

    Nguyen huu Anh; Vuong manh Son

    1990-09-01

    In this article we shall prove that the enveloping algebra of the Lie algebra of some unimodular Lie group having discrete series, when localized at some element of the center, is isomorphic to the tensor product of a Weyl algebra over the ring of Laurent polynomials of one variable and the enveloping algebra of some reductive Lie algebra. In particular, it will be proved that the Lie algebra of a unimodular solvable Lie group having discrete series satisfies the Gelfand-Kirillov conjecture. (author). 6 refs

  5. Algebraic groups and their birational invariants

    Voskresenskiĭ, V E

    2011-01-01

    Since the late 1960s, methods of birational geometry have been used successfully in the theory of linear algebraic groups, especially in arithmetic problems. This book--which can be viewed as a significant revision of the author's book, Algebraic Tori (Nauka, Moscow, 1977)--studies birational properties of linear algebraic groups focusing on arithmetic applications. The main topics are forms and Galois cohomology, the Picard group and the Brauer group, birational geometry of algebraic tori, arithmetic of algebraic groups, Tamagawa numbers, R-equivalence, projective toric varieties, invariants of finite transformation groups, and index-formulas. Results and applications are recent. There is an extensive bibliography with additional comments that can serve as a guide for further reading.

  6. Electronic nose with a new feature reduction method and a multi-linear classifier for Chinese liquor classification

    Jing, Yaqi; Meng, Qinghao, E-mail: qh-meng@tju.edu.cn; Qi, Peifeng; Zeng, Ming; Li, Wei; Ma, Shugen [Tianjin Key Laboratory of Process Measurement and Control, Institute of Robotics and Autonomous Systems, School of Electrical Engineering and Automation, Tianjin University, Tianjin 300072 (China)

    2014-05-15

    An electronic nose (e-nose) was designed to classify Chinese liquors of the same aroma style. A new method of feature reduction which combined feature selection with feature extraction was proposed. Feature selection method used 8 feature-selection algorithms based on information theory and reduced the dimension of the feature space to 41. Kernel entropy component analysis was introduced into the e-nose system as a feature extraction method and the dimension of feature space was reduced to 12. Classification of Chinese liquors was performed by using back propagation artificial neural network (BP-ANN), linear discrimination analysis (LDA), and a multi-linear classifier. The classification rate of the multi-linear classifier was 97.22%, which was higher than LDA and BP-ANN. Finally the classification of Chinese liquors according to their raw materials and geographical origins was performed using the proposed multi-linear classifier and classification rate was 98.75% and 100%, respectively.

  7. Electronic nose with a new feature reduction method and a multi-linear classifier for Chinese liquor classification

    Jing, Yaqi; Meng, Qinghao; Qi, Peifeng; Zeng, Ming; Li, Wei; Ma, Shugen

    2014-01-01

    An electronic nose (e-nose) was designed to classify Chinese liquors of the same aroma style. A new method of feature reduction which combined feature selection with feature extraction was proposed. Feature selection method used 8 feature-selection algorithms based on information theory and reduced the dimension of the feature space to 41. Kernel entropy component analysis was introduced into the e-nose system as a feature extraction method and the dimension of feature space was reduced to 12. Classification of Chinese liquors was performed by using back propagation artificial neural network (BP-ANN), linear discrimination analysis (LDA), and a multi-linear classifier. The classification rate of the multi-linear classifier was 97.22%, which was higher than LDA and BP-ANN. Finally the classification of Chinese liquors according to their raw materials and geographical origins was performed using the proposed multi-linear classifier and classification rate was 98.75% and 100%, respectively

  8. Algebraic complexities and algebraic curves over finite fields.

    Chudnovsky, D V; Chudnovsky, G V

    1987-04-01

    We consider the problem of minimal (multiplicative) complexity of polynomial multiplication and multiplication in finite extensions of fields. For infinite fields minimal complexities are known [Winograd, S. (1977) Math. Syst. Theory 10, 169-180]. We prove lower and upper bounds on minimal complexities over finite fields, both linear in the number of inputs, using the relationship with linear coding theory and algebraic curves over finite fields.

  9. Yoneda algebras of almost Koszul algebras

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

  10. Open algebraic surfaces

    Miyanishi, Masayoshi

    2000-01-01

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

  11. Discrete event systems in dioid algebra and conventional algebra

    Declerck, Philippe

    2013-01-01

    This book concerns the use of dioid algebra as (max, +) algebra to treat the synchronization of tasks expressed by the maximum of the ends of the tasks conditioning the beginning of another task - a criterion of linear programming. A classical example is the departure time of a train which should wait for the arrival of other trains in order to allow for the changeover of passengers.The content focuses on the modeling of a class of dynamic systems usually called "discrete event systems" where the timing of the events is crucial. Events are viewed as sudden changes in a process which i

  12. Toward robust scalable algebraic multigrid solvers

    Waisman, Haim; Schroder, Jacob; Olson, Luke; Hiriyur, Badri; Gaidamour, Jeremie; Siefert, Christopher; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen

    2010-01-01

    This talk highlights some multigrid challenges that arise from several application areas including structural dynamics, fluid flow, and electromagnetics. A general framework is presented to help introduce and understand algebraic multigrid methods based on energy minimization concepts. Connections between algebraic multigrid prolongators and finite element basis functions are made to explored. It is shown how the general algebraic multigrid framework allows one to adapt multigrid ideas to a number of different situations. Examples are given corresponding to linear elasticity and specifically in the solution of linear systems associated with extended finite elements for fracture problems.

  13. The Yoneda algebra of a K2 algebra need not be another K2 algebra

    Cassidy, T.; Phan, C.; Shelton, B.

    2010-01-01

    The Yoneda algebra of a Koszul algebra or a D-Koszul algebra is Koszul. K2 algebras are a natural generalization of Koszul algebras, and one would hope that the Yoneda algebra of a K2 algebra would be another K2 algebra. We show that this is not necessarily the case by constructing a monomial K2 algebra for which the corresponding Yoneda algebra is not K2.

  14. Novikov-Jordan algebras

    Dzhumadil'daev, A. S.

    2002-01-01

    Algebras with identity $(a\\star b)\\star (c\\star d) -(a\\star d)\\star(c\\star b)$ $=(a,b,c)\\star d-(a,d,c)\\star b$ are studied. Novikov algebras under Jordan multiplication and Leibniz dual algebras satisfy this identity. If algebra with such identity has unit, then it is associative and commutative.

  15. Introduction to relation algebras relation algebras

    Givant, Steven

    2017-01-01

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

  16. Banach Synaptic Algebras

    Foulis, David J.; Pulmannov, Sylvia

    2018-04-01

    Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

  17. Quantum ergodicity and a quantum measure algebra

    Stechel, E.B.

    1985-01-01

    A quantum ergodic theory for finite systems (such as isolated molecules) is developed by introducing the concept of a quantum measure algebra. The basic concept in classical ergodic theory is that of a measure space. A measure space is a set M, together with a specified sigma algebra of subsets in M and a measure defined on that algebra. A sigma algebra is closed under the formation of intersections and symmetric differences. A measure is a nonnegative and countably additive set function. For this to be further classified as a dynamical system, a measurable transformation is introduced. A measurable transformation is a mapping from a measure space into a measure space, such that the inverse image of every measurable set is measurable. In conservative dynamical systems, a measurable transformation is measure preserving, which is to say that the inverse image of every measurable set has the same measure as the original set. Once the measure space and the measurable transformation are defined, ergodic theory can be investigated on three levels: describable as analytic, geometric and algebraic. The analytic level studies linear operators induced by a transformation. The geometric level is concerned directly with transformations on a measure space and the algebraic treatments substitute a measure algebra for the measure space and basically equate sets that differ only by sets of measure zero. It is this latter approach that is most directly paralleled here. A measure algebra for a quantum dynamical system is defined within which stochastic concepts in quantum mechanics can be investigated. The quantum measure algebra differs from a normal measure algebra only in that multiplication is noncommutative and addition is nonassociative. Nonetheless, the quantum measure algebra preserves the essence of a normal measure algebra

  18. Surface defects and chiral algebras

    Córdova, Clay [School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, NJ 08540 (United States); Gaiotto, Davide [Perimeter Institute for Theoretical Physics,31 Caroline St N, Waterloo, ON N2L 2Y5 (Canada); Shao, Shu-Heng [School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, NJ 08540 (United States)

    2017-05-26

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

  19. Quantum cluster algebras and quantum nilpotent algebras

    Goodearl, Kenneth R.; Yakimov, Milen T.

    2014-01-01

    A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197

  20. Representations of Lie algebras and partial differential equations

    Xu, Xiaoping

    2017-01-01

    This book provides explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic codes, combinatorics and algebraic varieties, summarizing the author’s works and his joint works with his former students.  Further, it presents various oscillator generalizations of the classical representation theorem on harmonic polynomials, and highlights new functors from the representation category of a simple Lie algebra to that of another simple Lie algebra. Partial differential equations play a key role in solving certain representation problems. The weight matrices of the minimal and adjoint representations over the simple Lie algebras of types E and F are proved to generate ternary orthogonal linear codes with large minimal distances. New multi-variable hypergeometric functions related to the root systems of simple Lie algebras are introduced in connection with quantum many-body systems in one dimension. In addition, the book identifies certai...