#### Sample records for iterative linear algebra

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

Science.gov (United States)

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.

2. Leapfrog variants of iterative methods for linear algebra equations

Science.gov (United States)

Saylor, Paul E.

1988-01-01

Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterates are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

3. Iterated Leavitt Path Algebras

International Nuclear Information System (INIS)

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)

4. Linear algebra

CERN Document Server

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

5. Linear algebra

CERN Document Server

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

6. Linear algebra

CERN Document Server

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

7. Linear Algebra and Smarandache Linear Algebra

OpenAIRE

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

8. Linear algebra

CERN Document Server

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

9. Linear algebra

CERN Document Server

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.

10. Linear algebra

CERN Document Server

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.

11. Linearizing W-algebras

International Nuclear Information System (INIS)

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

12. Linear-Algebra Programs

Science.gov (United States)

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.

13. Matrices and linear algebra

CERN Document Server

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

14. Linear algebra done right

CERN Document Server

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

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

Czech Academy of Sciences Publication Activity Database

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

16. Basic linear algebra

CERN Document Server

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

17. Linear algebraic groups

CERN Document Server

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

18. Applied linear algebra

CERN Document Server

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

19. Handbook of linear algebra

CERN Document Server

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

20. Linear Algebra Thoroughly Explained

CERN Document Server

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.

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

OpenAIRE

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

2. Multicore Performance of Block Algebraic Iterative Reconstruction Methods

DEFF Research Database (Denmark)

Sørensen, Hans Henrik B.; Hansen, Per Christian

2014-01-01

Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely on semiconv......Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely...... on semiconvergence. Block versions of these methods, based on a partitioning of the linear system, are able to combine the fast semiconvergence of ART with the better multicore properties of SIRT. These block methods separate into two classes: those that, in each iteration, access the blocks in a sequential manner...... a fixed relaxation parameter in each method, namely, the one that leads to the fastest semiconvergence. Computational results show that for multicore computers, the sequential approach is preferable....

3. Further linear algebra

CERN Document Server

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

4. Computer Program For Linear Algebra

Science.gov (United States)

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.

5. Dynamical systems and linear algebra

OpenAIRE

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)

6. Fundamentals of linear algebra

CERN Document Server

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.

7. Matlab linear algebra

CERN Document Server

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

8. Numerical linear algebra theory and applications

CERN Document Server

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.

9. Templates for Linear Algebra Problems

NARCIS (Netherlands)

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

10. Linear Algebra and Image Processing

Science.gov (United States)

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

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

OpenAIRE

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.

Science.gov (United States)

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.

13. On Associative Conformal Algebras of Linear Growth

OpenAIRE

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

14. Computational linear and commutative algebra

CERN Document Server

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

15. Linear operators in Clifford algebras

International Nuclear Information System (INIS)

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

16. Topics in quaternion linear algebra

CERN Document Server

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

17. Introduction to computational linear algebra

CERN Document Server

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

18. Variational linear algebraic equations method

International Nuclear Information System (INIS)

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)

19. Data Compression with Linear Algebra

OpenAIRE

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.

20. Principles of linear algebra with Mathematica

CERN Document Server

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,

1. BLAS- BASIC LINEAR ALGEBRA SUBPROGRAMS

Science.gov (United States)

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.

2. Matrix algebra for linear models

CERN Document Server

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

3. Meromorphic functions and linear algebra

CERN Document Server

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

4. An Application of Linear Algebra over Lattices

Directory of Open Access Journals (Sweden)

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

5. An Application of Linear Algebra over Lattices

OpenAIRE

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

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

Science.gov (United States)

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)

7. AIR Tools - A MATLAB Package of Algebraic Iterative Reconstruction Techniques

DEFF Research Database (Denmark)

Hansen, Per Christian; Saxild-Hansen, Maria

This collection of MATLAB software contains implementations of several Algebraic Iterative Reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods...... are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...

8. An Inquiry-Based Linear Algebra Class

Science.gov (United States)

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…

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

Science.gov (United States)

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)

10. Advanced linear algebra for engineers with Matlab

CERN Document Server

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

11. Numerical linear algebra with applications using Matlab

CERN Document Server

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

12. Applied linear algebra and matrix analysis

CERN Document Server

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

13. AIR Tools II: algebraic iterative reconstruction methods, improved implementation

DEFF Research Database (Denmark)

Hansen, Per Christian; Jørgensen, Jakob Sauer

2017-01-01

with algebraic iterative methods and their convergence properties. The present software is a much expanded and improved version of the package AIR Tools from 2012, based on a new modular design. In addition to improved performance and memory use, we provide more flexible iterative methods, a column-action method...

14. A linear iterative unfolding method

International Nuclear Information System (INIS)

László, András

2012-01-01

A frequently faced task in experimental physics is to measure the probability distribution of some quantity. Often this quantity to be measured is smeared by a non-ideal detector response or by some physical process. The procedure of removing this smearing effect from the measured distribution is called unfolding, and is a delicate problem in signal processing, due to the well-known numerical ill behavior of this task. Various methods were invented which, given some assumptions on the initial probability distribution, try to regularize the unfolding problem. Most of these methods definitely introduce bias into the estimate of the initial probability distribution. We propose a linear iterative method (motivated by the Neumann series / Landweber iteration known in functional analysis), which has the advantage that no assumptions on the initial probability distribution is needed, and the only regularization parameter is the stopping order of the iteration, which can be used to choose the best compromise between the introduced bias and the propagated statistical and systematic errors. The method is consistent: 'binwise' convergence to the initial probability distribution is proved in absence of measurement errors under a quite general condition on the response function. This condition holds for practical applications such as convolutions, calorimeter response functions, momentum reconstruction response functions based on tracking in magnetic field etc. In presence of measurement errors, explicit formulae for the propagation of the three important error terms is provided: bias error (distance from the unknown to-be-reconstructed initial distribution at a finite iteration order), statistical error, and systematic error. A trade-off between these three error terms can be used to define an optimal iteration stopping criterion, and the errors can be estimated there. We provide a numerical C library for the implementation of the method, which incorporates automatic

15. Linearized dynamical approach to current algebra

International Nuclear Information System (INIS)

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

16. Modeling digital switching circuits with linear algebra

CERN Document Server

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

17. AIR Tools - A MATLAB package of algebraic iterative reconstruction methods

DEFF Research Database (Denmark)

Hansen, Per Christian; Saxild-Hansen, Maria

2012-01-01

We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods are impleme......We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods...... are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...

18. Stability of Linear Equations--Algebraic Approach

Science.gov (United States)

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…

19. Linear algebra a first course with applications

CERN Document Server

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

20. Linear Algebraic Method for Non-Linear Map Analysis

International Nuclear Information System (INIS)

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.

1. Finite-dimensional linear algebra

CERN Document Server

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

2. Gauss Elimination: Workhorse of Linear Algebra.

Science.gov (United States)

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

3. Hamiltonian structure of linearly extended Virasoro algebra

International Nuclear Information System (INIS)

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

4. Lie algebras and linear differential equations.

Science.gov (United States)

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.

5. Generalization of the linear algebraic method to three dimensions

International Nuclear Information System (INIS)

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

6. Linear algebra and group theory for physicists

CERN Document Server

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

7. An introduction to linear algebra

CERN Document Server

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.

8. Constructive Learning in Undergraduate Linear Algebra

Science.gov (United States)

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.

9. Noise limitations in optical linear algebra processors.

Science.gov (United States)

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.

10. Modules as Learning Tools in Linear Algebra

Science.gov (United States)

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…

11. High performance linear algebra algorithms: An introduction

DEFF Research Database (Denmark)

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

12. A Linear Algebra Measure of Cluster Quality.

Science.gov (United States)

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)

13. Journal Writing: Enlivening Elementary Linear Algebra.

Science.gov (United States)

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

14. Accelerating Dense Linear Algebra on the GPU

DEFF Research Database (Denmark)

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

15. More on the linearization of W-algebras

International Nuclear Information System (INIS)

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

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

International Nuclear Information System (INIS)

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.

17. A linear algebraic approach to electron-molecule collisions

International Nuclear Information System (INIS)

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

18. On Algebraic Structure of Improved Gauss-Seidel Iteration

OpenAIRE

O. M. Bamigbola; A. A. Ibrahim

2014-01-01

Analysis of real life problems often results in linear systems of equations for which solutions are sought. The method to employ depends, to some extent, on the properties of the coefficient matrix. It is not always feasible to solve linear systems of equations by direct methods, as such the need to use an iterative method becomes imperative. Before an iterative method can be employed to solve a linear system of equations there must be a guaranty that the process of solut...

19. Schwarz maps of algebraic linear ordinary differential equations

Science.gov (United States)

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.

20. ITMETH, Iterative Routines for Linear System

International Nuclear Information System (INIS)

Greenbaum, A.

1989-01-01

1 - Description of program or function: ITMETH is a collection of iterative routines for solving large, sparse linear systems. 2 - Method of solution: ITMETH solves general linear systems of the form AX=B using a variety of methods: Jacobi iteration; Gauss-Seidel iteration; incomplete LU decomposition or matrix splitting with iterative refinement; diagonal scaling, matrix splitting, or incomplete LU decomposition with the conjugate gradient method for the problem AA'Y=B, X=A'Y; bi-conjugate gradient method with diagonal scaling, matrix splitting, or incomplete LU decomposition; and ortho-min method with diagonal scaling, matrix splitting, or incomplete LU decomposition. ITMETH also solves symmetric positive definite linear systems AX=B using the conjugate gradient method with diagonal scaling or matrix splitting, or the incomplete Cholesky conjugate gradient method

1. Optical linear algebra processors - Architectures and algorithms

Science.gov (United States)

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.

2. Parallel algorithms for numerical linear algebra

CERN Document Server

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

3. Basic linear algebra subprograms for FORTRAN usage

Science.gov (United States)

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.

4. Mathematical methods linear algebra normed spaces distributions integration

CERN Document Server

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

5. Relation of deformed nonlinear algebras with linear ones

International Nuclear Information System (INIS)

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)

6. Linear ideal MHD stability calculations for ITER

International Nuclear Information System (INIS)

Hogan, J.T.

1988-01-01

A survey of MHD stability limits has been made to address issues arising from the MHD--poloidal field design task of the US ITER project. This is a summary report on the results obtained to date. The study evaluates the dependence of ballooning, Mercier and low-n ideal linear MHD stability on key system parameters to estimate overall MHD constraints for ITER. 17 refs., 27 figs

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

Science.gov (United States)

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…

8. Algebraic Theory of Linear Viscoelastic Nematodynamics

International Nuclear Information System (INIS)

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

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

NARCIS (Netherlands)

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

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

CERN Document Server

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.

11. Inhomogeneous linear equation in Rota-Baxter algebra

OpenAIRE

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.

12. PC-BLAS, PC Linear Algebra Subroutines

International Nuclear Information System (INIS)

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

13. Linear algebra applications using Matlab software

Directory of Open Access Journals (Sweden)

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.

14. Numerical stability in problems of linear algebra.

Science.gov (United States)

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.

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

Science.gov (United States)

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

16. Iterative solution of large linear systems

CERN Document Server

Young, David Matheson

1971-01-01

This self-contained treatment offers a systematic development of the theory of iterative methods. Its focal point resides in an analysis of the convergence properties of the successive overrelaxation (SOR) method, as applied to a linear system with a consistently ordered matrix. The text explores the convergence properties of the SOR method and related techniques in terms of the spectral radii of the associated matrices as well as in terms of certain matrix norms. Contents include a review of matrix theory and general properties of iterative methods; SOR method and stationary modified SOR meth

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

19. Emphasizing Language and Visualization in Teaching Linear Algebra

Science.gov (United States)

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…

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

Science.gov (United States)

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…

1. A Posteriori Error Estimates Including Algebraic Error and Stopping Criteria for Iterative Solvers

Czech Academy of Sciences Publication Activity Database

Jiránek, P.; Strakoš, Zdeněk; Vohralík, M.

2010-01-01

Roč. 32, č. 3 (2010), s. 1567-1590 ISSN 1064-8275 R&D Projects: GA AV ČR IAA100300802 Grant - others:GA ČR(CZ) GP201/09/P464 Institutional research plan: CEZ:AV0Z10300504 Keywords : second-order elliptic partial differential equation * finite volume method * a posteriori error estimates * iterative methods for linear algebraic systems * conjugate gradient method * stopping criteria Subject RIV: BA - General Mathematics Impact factor: 3.016, year: 2010

2. Accuracy Limitations in Optical Linear Algebra Processors

Science.gov (United States)

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.

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

Science.gov (United States)

Liu, Jianzhou; Wang, Li; Zhang, Juan

2017-11-01

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

4. The linear algebra survival guide illustrated with Mathematica

CERN Document Server

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

5. Current algebra of classical non-linear sigma models

International Nuclear Information System (INIS)

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

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

DEFF Research Database (Denmark)

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

7. Linear algebraic approach to electron-molecule collisions

International Nuclear Information System (INIS)

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

8. Application of laser speckle to randomized numerical linear algebra

Science.gov (United States)

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.

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

CERN Document Server

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

10. IDEALS GENERATED BY LINEAR FORMS AND SYMMETRIC ALGEBRAS

Directory of Open Access Journals (Sweden)

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.

11. Formalized Linear Algebra over Elementary Divisor Rings in Coq

OpenAIRE

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

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.

16. Embodied, Symbolic and Formal Thinking in Linear Algebra

Science.gov (United States)

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…

17. An introduction to linear algebra and tensors

CERN Document Server

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.

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

CERN Document Server

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.

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

DEFF Research Database (Denmark)

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

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

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

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

Science.gov (United States)

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

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

Science.gov (United States)

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…

4. Creating Discussions with Classroom Voting in Linear Algebra

Science.gov (United States)

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…

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

NARCIS (Netherlands)

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.

6. Inverse Modelling Problems in Linear Algebra Undergraduate Courses

Science.gov (United States)

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…

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

Science.gov (United States)

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…

8. Optical linear algebra processors - Noise and error-source modeling

Science.gov (United States)

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.

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

Science.gov (United States)

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…

10. Definitions Are Important: The Case of Linear Algebra

Science.gov (United States)

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…

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

Science.gov (United States)

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.

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

Science.gov (United States)

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…

13. Reading between the Lines: Teaching Linear Algebra

Science.gov (United States)

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…

14. GPU Linear algebra extensions for GNU/Octave

International Nuclear Information System (INIS)

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.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

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.

17. Projection of angular momentum via linear algebra

Science.gov (United States)

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.

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

NARCIS (Netherlands)

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

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

NARCIS (Netherlands)

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

20. Linear algebra and matrices topics for a second course

CERN Document Server

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

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

International Nuclear Information System (INIS)

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)

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

Science.gov (United States)

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.

3. Communication Avoiding and Overlapping for Numerical Linear Algebra

Science.gov (United States)

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

4. On Numerical Stability in Large Scale Linear Algebraic Computations

Czech Academy of Sciences Publication Activity Database

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

5. Lie Algebraic Treatment of Linear and Nonlinear Beam Dynamics

Energy Technology Data Exchange (ETDEWEB)

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

6. Linear algebra and analytic geometry for physical sciences

CERN Document Server

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

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

International Nuclear Information System (INIS)

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

8. AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S

Science.gov (United States)

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.

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

Science.gov (United States)

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…

10. A fast iterative scheme for the linearized Boltzmann equation

Science.gov (United States)

Wu, Lei; Zhang, Jun; Liu, Haihu; Zhang, Yonghao; Reese, Jason M.

2017-06-01

Iterative schemes to find steady-state solutions to the Boltzmann equation are efficient for highly rarefied gas flows, but can be very slow to converge in the near-continuum flow regime. In this paper, a synthetic iterative scheme is developed to speed up the solution of the linearized Boltzmann equation by penalizing the collision operator L into the form L = (L + Nδh) - Nδh, where δ is the gas rarefaction parameter, h is the velocity distribution function, and N is a tuning parameter controlling the convergence rate. The velocity distribution function is first solved by the conventional iterative scheme, then it is corrected such that the macroscopic flow velocity is governed by a diffusion-type equation that is asymptotic-preserving into the Navier-Stokes limit. The efficiency of this new scheme is assessed by calculating the eigenvalue of the iteration, as well as solving for Poiseuille and thermal transpiration flows. We find that the fastest convergence of our synthetic scheme for the linearized Boltzmann equation is achieved when Nδ is close to the average collision frequency. The synthetic iterative scheme is significantly faster than the conventional iterative scheme in both the transition and the near-continuum gas flow regimes. Moreover, due to its asymptotic-preserving properties, the synthetic iterative scheme does not need high spatial resolution in the near-continuum flow regime, which makes it even faster than the conventional iterative scheme. Using this synthetic scheme, with the fast spectral approximation of the linearized Boltzmann collision operator, Poiseuille and thermal transpiration flows between two parallel plates, through channels of circular/rectangular cross sections and various porous media are calculated over the whole range of gas rarefaction. Finally, the flow of a Ne-Ar gas mixture is solved based on the linearized Boltzmann equation with the Lennard-Jones intermolecular potential for the first time, and the difference

11. Relating Reasoning Methodologies in Linear Logic and Process Algebra

Directory of Open Access Journals (Sweden)

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.

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

Science.gov (United States)

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.

13. Negative base encoding in optical linear algebra processors

Science.gov (United States)

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.

14. First order linear ordinary differential equations in associative algebras

Directory of Open Access Journals (Sweden)

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.

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

Fu, Jian; Schleede, Simone; Tan, Renbo; Chen, Liyuan; Bech, Martin; Achterhold, Klaus; Gifford, Martin; Loewen, Rod; Ruth, Ronald; Pfeiffer, Franz

2013-09-01

Iterative reconstruction has a wide spectrum of proven advantages in the field of conventional X-ray absorption-based computed tomography (CT). In this paper, we report on an algebraic iterative reconstruction technique for grating-based differential phase-contrast CT (DPC-CT). Due to the differential nature of DPC-CT projections, a differential operator and a smoothing operator are added to the iterative reconstruction, compared to the one commonly used for absorption-based CT data. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured at a two-grating interferometer setup. Since the algorithm is easy to implement and allows for the extension to various regularization possibilities, we expect a significant impact of the method for improving future medical and industrial DPC-CT applications. Copyright © 2012. Published by Elsevier GmbH.

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

International Nuclear Information System (INIS)

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

19. Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems

Czech Academy of Sciences Publication Activity Database

Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav

2014-01-01

Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014

20. Iterative algorithms for large sparse linear systems on parallel computers

Science.gov (United States)

1982-01-01

Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.

1. Iterative solution of linear equations in ODE codes. [Krylov subspaces

Energy Technology Data Exchange (ETDEWEB)

1981-01-01

Each integration step of a stiff equation involves the solution of a nonlinear equation, usually by a quasi-Newton method that leads to a set of linear problems. Iterative methods for these linear equations are studied. Of particular interest are methods that do not require an explicit Jacobian, but can work directly with differences of function values using J congruent to f(x + delta) - f(x). Some numerical experiments using a modification of LSODE are reported. 1 figure, 2 tables.

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

International Nuclear Information System (INIS)

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

3. Linear response theory an analytic-algebraic approach

CERN Document Server

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

6. Using linear algebra for protein structural comparison and classification

Directory of Open Access Journals (Sweden)

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.

7. Linear algebra for dense matrices on a hypercube

International Nuclear Information System (INIS)

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)

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

International Nuclear Information System (INIS)

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

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

11. Solution of the fully fuzzy linear systems using iterative techniques

International Nuclear Information System (INIS)

Dehghan, Mehdi; Hashemi, Behnam; Ghatee, Mehdi

2007-01-01

This paper mainly intends to discuss the iterative solution of fully fuzzy linear systems which we call FFLS. We employ Dubois and Prade's approximate arithmetic operators on LR fuzzy numbers for finding a positive fuzzy vector x-tilde which satisfies A-tildex-tilde=b, where A-tilde and b-tilde are a fuzzy matrix and a fuzzy vector, respectively. Please note that the positivity assumption is not so restrictive in applied problems. We transform FFLS and propose iterative techniques such as Richardson, Jacobi, Jacobi overrelaxation (JOR), Gauss-Seidel, successive overrelaxation (SOR), accelerated overrelaxation (AOR), symmetric and unsymmetric SOR (SSOR and USSOR) and extrapolated modified Aitken (EMA) for solving FFLS. In addition, the methods of Newton, quasi-Newton and conjugate gradient are proposed from nonlinear programming for solving a fully fuzzy linear system. Various numerical examples are also given to show the efficiency of the proposed schemes

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

Science.gov (United States)

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)

13. Comments on new iterative methods for solving linear systems

Directory of Open Access Journals (Sweden)

Wang Ke

2017-06-01

Full Text Available Some new iterative methods were presented by Du, Zheng and Wang for solving linear systems in [3], where it is shown that the new methods, comparing to the classical Jacobi or Gauss-Seidel method, can be applied to more systems and have faster convergence. This note shows that their methods are suitable for more matrices than positive matrices which the authors suggested through further analysis and numerical examples.

14. Weighted thinned linear array design with the iterative FFT technique

CSIR Research Space (South Africa)

Du Plessis, WP

2011-09-01

Full Text Available techniques utilise simulated annealing [3]?[5], [10], mixed integer linear programming [7], genetic algorithms [9], and a hyrid approach combining a genetic algorithm and a local optimiser [8]. The iterative Fourier technique (IFT) developed by Keizer [2... algorithm being well- suited to obtaining low CTRs. Test problems from the literature are considered, and the results obtained with the IFT considerably exceed those achieved with other algorithms. II. DESCRIPTION OF THE ALGORITHM A flowchart describing...

15. AZTEC: A parallel iterative package for the solving linear systems

Energy Technology Data Exchange (ETDEWEB)

Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S. [Sandia National Labs., Albuquerque, NM (United States)

1996-12-31

We describe a parallel linear system package, AZTEC. The package incorporates a number of parallel iterative methods (e.g. GMRES, biCGSTAB, CGS, TFQMR) and preconditioners (e.g. Jacobi, Gauss-Seidel, polynomial, domain decomposition with LU or ILU within subdomains). Additionally, AZTEC allows for the reuse of previous preconditioning factorizations within Newton schemes for nonlinear methods. Currently, a number of different users are using this package to solve a variety of PDE applications.

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

Energy Technology Data Exchange (ETDEWEB)

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.

17. On MV-algebras of non-linear functions

Directory of Open Access Journals (Sweden)

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.

18. On MV-algebras of non-linear functions

Directory of Open Access Journals (Sweden)

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.

19. Solving large mixed linear models using preconditioned conjugate gradient iteration.

Science.gov (United States)

Strandén, I; Lidauer, M

1999-12-01

Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.

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

International Nuclear Information System (INIS)

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

1. Linear multifrequency-grey acceleration recast for preconditioned Krylov iterations

International Nuclear Information System (INIS)

Morel, Jim E.; Brian Yang, T.-Y.; Warsa, James S.

2007-01-01

The linear multifrequency-grey acceleration (LMFGA) technique is used to accelerate the iterative convergence of multigroup thermal radiation diffusion calculations in high energy density simulations. Although it is effective and efficient in one-dimensional calculations, the LMFGA method has recently been observed to significantly degrade under certain conditions in multidimensional calculations with large discontinuities in material properties. To address this deficiency, we recast the LMFGA method in terms of a preconditioned system that is solved with a Krylov method (LMFGK). Results are presented demonstrating that the new LMFGK method always requires fewer iterations than the original LMFGA method. The reduction in iteration count increases with both the size of the time step and the inhomogeneity of the problem. However, for reasons later explained, the LMFGK method can cost more per iteration than the LMFGA method, resulting in lower but comparable efficiency in problems with small time steps and weak inhomogeneities. In problems with large time steps and strong inhomogeneities, the LMFGK method is significantly more efficient than the LMFGA method

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

Science.gov (United States)

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.

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

International Nuclear Information System (INIS)

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

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

Science.gov (United States)

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)

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

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

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

KAUST Repository

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.

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

KAUST Repository

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.

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

International Nuclear Information System (INIS)

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

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

International Nuclear Information System (INIS)

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

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

Directory of Open Access Journals (Sweden)

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.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

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.

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

CERN Document Server

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

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

International Nuclear Information System (INIS)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

20. Finding the radical of an algebra of linear transformations

NARCIS (Netherlands)

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

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

International Nuclear Information System (INIS)

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

2. An implicit iterative scheme for solving large systems of linear equations

International Nuclear Information System (INIS)

Barry, J.M.; Pollard, J.P.

1986-12-01

An implicit iterative scheme for the solution of large systems of linear equations arising from neutron diffusion studies is presented. The method is applied to three-dimensional reactor studies and its performance is compared with alternative iterative approaches

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

CERN Document Server

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

4. Algebra

CERN Document Server

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.

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

CERN Document Server

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

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

International Nuclear Information System (INIS)

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

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

International Nuclear Information System (INIS)

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)

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

Directory of Open Access Journals (Sweden)

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

9. Local Fractional Laplace Variational Iteration Method for Solving Linear Partial Differential Equations with Local Fractional Derivative

Directory of Open Access Journals (Sweden)

Ai-Min Yang

2014-01-01

Full Text Available The local fractional Laplace variational iteration method was applied to solve the linear local fractional partial differential equations. The local fractional Laplace variational iteration method is coupled by the local fractional variational iteration method and Laplace transform. The nondifferentiable approximate solutions are obtained and their graphs are also shown.

10. Algebra

CERN Document Server

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

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

CERN Document Server

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

12. Mathematical modelling in engineering: A proposal to introduce linear algebra concepts

Directory of Open Access Journals (Sweden)

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.

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

Science.gov (United States)

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.

14. Non-linear iterative strategy for nem refinement and extension

International Nuclear Information System (INIS)

Engrand, P.R.; Maldonado, G.I.; Al-Chalabi, R.; Turinsky, P.J.

1994-10-01

The following work is related to the non-linear iterative strategy developed by K. Smith to solve the Nodal Expansion Method (NEM) representation of the neutron diffusion equations. We show how to improve this strategy and how to adapt it to time dependant problems. This work has been done in the NESTLE code, developed at North Carolina State University. When using Smith's strategy, one ends up with a two-node problem which corresponds to a matrix with a fixed structure and a size of 16 x 16 (for a 2 group representation). We show how to reduce this matrix into 2 equivalent systems which sizes are 4 x 4 and 8 x 8. The whole problem needs many of these 2 node problems solution. Therefore the gain in CPU time reaches 45% in the nodal part of the code. To adapt Smith's strategy to time dependent problems, the idea is to get the same structure of the 2 node problem system as in steady-state calculation. To achieve this, one has to approximate the values of the past time-step and of the previous by a second order polynomial and to treat it as a source term. We show here how to make this approximation consistent and accurate. (authors). 1 tab., 2 refs

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

CERN Document Server

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

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

International Nuclear Information System (INIS)

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

17. Iterative solution of linear systems in the 20­th century

NARCIS (Netherlands)

Saad, Y.; Vorst, H.A. van der

2000-01-01

This paper sketches the main research developments in the area of iterative methods for solving linear systems during the 20th century. Although iterative methods for solving linear systems find their origin in the early nineteenth century (work by Gauss), the field has seen an explosion of

18. A comparison of linear interpolation models for iterative CT reconstruction.

Science.gov (United States)

Hahn, Katharina; Schöndube, Harald; Stierstorfer, Karl; Hornegger, Joachim; Noo, Frédéric

2016-12-01

Recent reports indicate that model-based iterative reconstruction methods may improve image quality in computed tomography (CT). One difficulty with these methods is the number of options available to implement them, including the selection of the forward projection model and the penalty term. Currently, the literature is fairly scarce in terms of guidance regarding this selection step, whereas these options impact image quality. Here, the authors investigate the merits of three forward projection models that rely on linear interpolation: the distance-driven method, Joseph's method, and the bilinear method. The authors' selection is motivated by three factors: (1) in CT, linear interpolation is often seen as a suitable trade-off between discretization errors and computational cost, (2) the first two methods are popular with manufacturers, and (3) the third method enables assessing the importance of a key assumption in the other methods. One approach to evaluate forward projection models is to inspect their effect on discretized images, as well as the effect of their transpose on data sets, but significance of such studies is unclear since the matrix and its transpose are always jointly used in iterative reconstruction. Another approach is to investigate the models in the context they are used, i.e., together with statistical weights and a penalty term. Unfortunately, this approach requires the selection of a preferred objective function and does not provide clear information on features that are intrinsic to the model. The authors adopted the following two-stage methodology. First, the authors analyze images that progressively include components of the singular value decomposition of the model in a reconstructed image without statistical weights and penalty term. Next, the authors examine the impact of weights and penalty on observed differences. Image quality metrics were investigated for 16 different fan-beam imaging scenarios that enabled probing various aspects

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

International Nuclear Information System (INIS)

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.

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

International Nuclear Information System (INIS)

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

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

OpenAIRE

中沢, 喜昌

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.

2. Algebra

CERN Document Server

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

3. Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems

Energy Technology Data Exchange (ETDEWEB)

Benzi, M. [Universita di Bologna (Italy); Tuma, M. [Inst. of Computer Sciences, Prague (Czech Republic)

1996-12-31

A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods.

4. Mathematical Modelling in Engineering: An Alternative Way to Teach Linear Algebra

Science.gov (United States)

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…

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

Science.gov (United States)

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.

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

Science.gov (United States)

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

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

OpenAIRE

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.

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

Science.gov (United States)

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

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

Science.gov (United States)

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…

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

Science.gov (United States)

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

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

Science.gov (United States)

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…

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

CERN Document Server

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

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

KAUST Repository

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

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

International Nuclear Information System (INIS)

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)

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

Science.gov (United States)

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.

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

Science.gov (United States)

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…

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

Science.gov (United States)

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.

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

Science.gov (United States)

Fu, Jian; Hu, Xinhua; Velroyen, Astrid; Bech, Martin; Jiang, Ming; Pfeiffer, Franz

2015-01-01

Due to the potential of compact imaging systems with magnified spatial resolution and contrast, cone-beam x-ray differential phase-contrast computed tomography (DPC-CT) has attracted significant interest. The current proposed FDK reconstruction algorithm with the Hilbert imaginary filter will induce severe cone-beam artifacts when the cone-beam angle becomes large. In this paper, we propose an algebraic iterative reconstruction (AIR) method for cone-beam DPC-CT and report its experiment results. This approach considers the reconstruction process as the optimization of a discrete representation of the object function to satisfy a system of equations that describes the cone-beam DPC-CT imaging modality. Unlike the conventional iterative algorithms for absorption-based CT, it involves the derivative operation to the forward projections of the reconstructed intermediate image to take into account the differential nature of the DPC projections. This method is based on the algebraic reconstruction technique, reconstructs the image ray by ray, and is expected to provide better derivative estimates in iterations. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured with a three-grating interferometer and a mini-focus x-ray tube source. It is shown that the proposed method can reduce the cone-beam artifacts and performs better than FDK under large cone-beam angles. This algorithm is of interest for future cone-beam DPC-CT applications.

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

International Nuclear Information System (INIS)

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

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

Science.gov (United States)

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.

13. Exploring linear algebra labs and projects with Mathematica

CERN Document Server

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

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

Directory of Open Access Journals (Sweden)

Pablo Arrighi

2012-07-01

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

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

Directory of Open Access Journals (Sweden)

Jan Awrejcewicz

2004-01-01

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

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

Science.gov (United States)

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.

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

OpenAIRE

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.

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

International Nuclear Information System (INIS)

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)

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

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.

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

International Nuclear Information System (INIS)

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

2. More on Generalizations and Modifications of Iterative Methods for Solving Large Sparse Indefinite Linear Systems

Directory of Open Access Journals (Sweden)

Jen-Yuan Chen

2014-01-01

Full Text Available Continuing from the works of Li et al. (2014, Li (2007, and Kincaid et al. (2000, we present more generalizations and modifications of iterative methods for solving large sparse symmetric and nonsymmetric indefinite systems of linear equations. We discuss a variety of iterative methods such as GMRES, MGMRES, MINRES, LQ-MINRES, QR MINRES, MMINRES, MGRES, and others.

3. Comparison results on preconditioned SOR-type iterative method for Z-matrices linear systems

Science.gov (United States)

Wang, Xue-Zhong; Huang, Ting-Zhu; Fu, Ying-Ding

2007-09-01

In this paper, we present some comparison theorems on preconditioned iterative method for solving Z-matrices linear systems, Comparison results show that the rate of convergence of the Gauss-Seidel-type method is faster than the rate of convergence of the SOR-type iterative method.

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

Energy Technology Data Exchange (ETDEWEB)

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

KAUST Repository

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

International Nuclear Information System (INIS)

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

International Nuclear Information System (INIS)

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

KAUST Repository

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

International Nuclear Information System (INIS)

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

Directory of Open Access Journals (Sweden)

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

Science.gov (United States)

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

OpenAIRE

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

Science.gov (United States)

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. The Effects of Formalism on Teacher Trainees' Algebraic and Geometric Interpretation of the Notions of Linear Dependency/Independency

Science.gov (United States)

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…

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Energy Technology Data Exchange (ETDEWEB)

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.

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

International Nuclear Information System (INIS)

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

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

Directory of Open Access Journals (Sweden)

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

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

KAUST Repository

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.

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

KAUST Repository

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.

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

CERN Document Server

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

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)

6. A comparative study of iterative solutions to linear systems arising in quantum mechanics

International Nuclear Information System (INIS)

Jing Yanfei; Huang Tingzhu; Duan Yong; Carpentieri, Bruno

2010-01-01

This study is mainly focused on iterative solutions with simple diagonal preconditioning to two complex-valued nonsymmetric systems of linear equations arising from a computational chemistry model problem proposed by Sherry Li of NERSC. Numerical experiments show the feasibility of iterative methods to some extent when applied to the problems and reveal the competitiveness of our recently proposed Lanczos biconjugate A-orthonormalization methods to other classic and popular iterative methods. By the way, experiment results also indicate that application specific preconditioners may be mandatory and required for accelerating convergence.

7. Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems

Directory of Open Access Journals (Sweden)

Oskar Cahueñas

2013-05-01

Full Text Available We address the issue of approximating the pseudoinverse of the coefficient matrix for dynamically building preconditioning strategies for the numerical solution of large dense linear least-squares problems. The new preconditioning strategies are embedded into simple and well-known iterative schemes that avoid the use of the, usually ill-conditioned, normal equations. We analyze a scheme to approximate the pseudoinverse, based on Schulz iterative method, and also different iterative schemes, based on extensions of Richardson's method, and the conjugate gradient method, that are suitable for preconditioning strategies. We present preliminary numerical results to illustrate the advantages of the proposed schemes.

8. Monomial algebras

CERN Document Server

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.

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

International Nuclear Information System (INIS)

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

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

International Nuclear Information System (INIS)

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)

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

Directory of Open Access Journals (Sweden)

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.

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

Energy Technology Data Exchange (ETDEWEB)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

16. The development of an algebraic multigrid algorithm for symmetric positive definite linear systems

Energy Technology Data Exchange (ETDEWEB)

Vanek, P.; Mandel, J.; Brezina, M. [Univ. of Colorado, Denver, CO (United States)

1996-12-31

An algebraic multigrid algorithm for symmetric, positive definite linear systems is developed based on the concept of prolongation by smoothed aggregation. Coarse levels are generated automatically. We present a set of requirements motivated heuristically by a convergence theory. The algorithm then attempts to satisfy the requirements. Input to the method are the coefficient matrix and zero energy modes, which are determined from nodal coordinates and knowledge of the differential equation. Efficiency of the resulting algorithm is demonstrated by computational results on real world problems from solid elasticity, plate blending, and shells.

17. On a new iterative method for solving linear systems and comparison results

Science.gov (United States)

Jing, Yan-Fei; Huang, Ting-Zhu

2008-10-01

In Ujevic [A new iterative method for solving linear systems, Appl. Math. Comput. 179 (2006) 725-730], the author obtained a new iterative method for solving linear systems, which can be considered as a modification of the Gauss-Seidel method. In this paper, we show that this is a special case from a point of view of projection techniques. And a different approach is established, which is both theoretically and numerically proven to be better than (at least the same as) Ujevic's. As the presented numerical examples show, in most cases, the convergence rate is more than one and a half that of Ujevic.

18. Iterated non-linear model predictive control based on tubes and contractive constraints.

Science.gov (United States)

Murillo, M; Sánchez, G; Giovanini, L

2016-05-01

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

Directory of Open Access Journals (Sweden)

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.

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

International Nuclear Information System (INIS)

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.

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

Directory of Open Access Journals (Sweden)

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.

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

Science.gov (United States)

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

3. Linear quadratic Gaussian controller design for plasma current, position and shape control system in ITER

International Nuclear Information System (INIS)

Belyakov, V.; Kavin, A.; Rumyantsev, E.; Kharitonov, V.; Misenov, B.; Ovsyannikov, A.; Ovsyannikov, D.; Veremei, E.; Zhabko, A.; Mitrishkin, Y.

1999-01-01

This paper is focused on the linear quadratic Gaussian (LQG) controller synthesis methodology for the ITER plasma current, position and shape control system as well as power derivative management system. It has been shown that some poloidal field (PF) coils have less influence on reference plasma-wall gaps control during plasma disturbances and hence they have been used to reduce total control power derivative by means of the additional non-linear feedback. The design has been done on the basis of linear models. Simulation was provided for non-linear model and results are presented and discussed. (orig.)

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

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

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

International Nuclear Information System (INIS)

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)

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

International Nuclear Information System (INIS)

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

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

International Nuclear Information System (INIS)

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)

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

Directory of Open Access Journals (Sweden)

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.

10. The Linear Stability Properties of Medium- to High- n TAEs in ITER

Energy Technology Data Exchange (ETDEWEB)

Gorelenkov, N N; Budny, R V; Kessel, C E; Kramer, G J; McCune, D; Manickam, J; Nazikian, R

2008-02-14

This document provides a detailed report on the successful completion of the DOE OFES Theory Milestone for FY2007: Improve the simulation resolution of linear stability properties of Toroidal Alfvén Eigenmodes (TAE) driven by energetic particles and neutral beams in ITER by increasing the numbers of toroidal modes used to 15.

11. A study on linear and nonlinear Schrodinger equations by the variational iteration method

International Nuclear Information System (INIS)

Wazwaz, Abdul-Majid

2008-01-01

In this work, we introduce a framework to obtain exact solutions to linear and nonlinear Schrodinger equations. The He's variational iteration method (VIM) is used for analytic treatment of these equations. Numerical examples are tested to show the pertinent features of this method

12. Discounted semi-Markov decision processes : linear programming and policy iteration

NARCIS (Netherlands)

Wessels, J.; van Nunen, J.A.E.E.

1975-01-01

For semi-Markov decision processes with discounted rewards we derive the well known results regarding the structure of optimal strategies (nonrandomized, stationary Markov strategies) and the standard algorithms (linear programming, policy iteration). Our analysis is completely based on a primal

13. Discounted semi-Markov decision processes : linear programming and policy iteration

NARCIS (Netherlands)

Wessels, J.; van Nunen, J.A.E.E.

1974-01-01

For semi-Markov decision processes with discounted rewards we derive the well known results regarding the structure of optimal strategies (nonrandomized, stationary Markov strategies) and the standard algorithms (linear programming, policy iteration). Our analysis is completely based on a primal

14. Evaluation of global synchronization for iterative algebra algorithms on many-core

KAUST Repository

ul Hasan Khan, Ayaz; Al-Mouhamed, Mayez; Firdaus, Lutfi A.

2015-01-01

© 2015 IEEE. Massively parallel computing is applied extensively in various scientific and engineering domains. With the growing interest in many-core architectures and due to the lack of explicit support for inter-block synchronization specifically in GPUs, synchronization becomes necessary to minimize inter-block communication time. In this paper, we have proposed two new inter-block synchronization techniques: 1) Relaxed Synchronization, and 2) Block-Query Synchronization. These schemes are used in implementing numerical iterative solvers where computation/communication overlapping is one used optimization to enhance application performance. We have evaluated and analyzed the performance of the proposed synchronization techniques using Jacobi Iterative Solver in comparison to the state of the art inter-block lock-free synchronization techniques. We have achieved about 1-8% performance improvement in terms of execution time over lock-free synchronization depending on the problem size and the number of thread blocks. We have also evaluated the proposed algorithm on GPU and MIC architectures and obtained about 8-26% performance improvement over the barrier synchronization available in OpenMP programming environment depending on the problem size and number of cores used.

15. Evaluation of global synchronization for iterative algebra algorithms on many-core

KAUST Repository

ul Hasan Khan, Ayaz

2015-06-01

© 2015 IEEE. Massively parallel computing is applied extensively in various scientific and engineering domains. With the growing interest in many-core architectures and due to the lack of explicit support for inter-block synchronization specifically in GPUs, synchronization becomes necessary to minimize inter-block communication time. In this paper, we have proposed two new inter-block synchronization techniques: 1) Relaxed Synchronization, and 2) Block-Query Synchronization. These schemes are used in implementing numerical iterative solvers where computation/communication overlapping is one used optimization to enhance application performance. We have evaluated and analyzed the performance of the proposed synchronization techniques using Jacobi Iterative Solver in comparison to the state of the art inter-block lock-free synchronization techniques. We have achieved about 1-8% performance improvement in terms of execution time over lock-free synchronization depending on the problem size and the number of thread blocks. We have also evaluated the proposed algorithm on GPU and MIC architectures and obtained about 8-26% performance improvement over the barrier synchronization available in OpenMP programming environment depending on the problem size and number of cores used.

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

International Nuclear Information System (INIS)

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

CERN Document Server

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.

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

International Nuclear Information System (INIS)

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)

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

KAUST Repository

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.

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

International Nuclear Information System (INIS)

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

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

Directory of Open Access Journals (Sweden)

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.

2. Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

Energy Technology Data Exchange (ETDEWEB)

Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)

1996-12-31

The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.

3. Iter

Science.gov (United States)

Iotti, Robert

2015-04-01

ITER is an international experimental facility being built by seven Parties to demonstrate the long term potential of fusion energy. The ITER Joint Implementation Agreement (JIA) defines the structure and governance model of such cooperation. There are a number of necessary conditions for such international projects to be successful: a complete design, strong systems engineering working with an agreed set of requirements, an experienced organization with systems and plans in place to manage the project, a cost estimate backed by industry, and someone in charge. Unfortunately for ITER many of these conditions were not present. The paper discusses the priorities in the JIA which led to setting up the project with a Central Integrating Organization (IO) in Cadarache, France as the ITER HQ, and seven Domestic Agencies (DAs) located in the countries of the Parties, responsible for delivering 90%+ of the project hardware as Contributions-in-Kind and also financial contributions to the IO, as Contributions-in-Cash.'' Theoretically the Director General (DG) is responsible for everything. In practice the DG does not have the power to control the work of the DAs, and there is not an effective management structure enabling the IO and the DAs to arbitrate disputes, so the project is not really managed, but is a loose collaboration of competing interests. Any DA can effectively block a decision reached by the DG. Inefficiencies in completing design while setting up a competent organization from scratch contributed to the delays and cost increases during the initial few years. So did the fact that the original estimate was not developed from industry input. Unforeseen inflation and market demand on certain commodities/materials further exacerbated the cost increases. Since then, improvements are debatable. Does this mean that the governance model of ITER is a wrong model for international scientific cooperation? I do not believe so. Had the necessary conditions for success

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

Science.gov (United States)

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.

5. Implementation of non-linear filters for iterative penalized maximum likelihood image reconstruction

International Nuclear Information System (INIS)

Liang, Z.; Gilland, D.; Jaszczak, R.; Coleman, R.

1990-01-01

In this paper, the authors report on the implementation of six edge-preserving, noise-smoothing, non-linear filters applied in image space for iterative penalized maximum-likelihood (ML) SPECT image reconstruction. The non-linear smoothing filters implemented were the median filter, the E 6 filter, the sigma filter, the edge-line filter, the gradient-inverse filter, and the 3-point edge filter with gradient-inverse filter, and the 3-point edge filter with gradient-inverse weight. A 3 x 3 window was used for all these filters. The best image obtained, by viewing the profiles through the image in terms of noise-smoothing, edge-sharpening, and contrast, was the one smoothed with the 3-point edge filter. The computation time for the smoothing was less than 1% of one iteration, and the memory space for the smoothing was negligible. These images were compared with the results obtained using Bayesian analysis

6. A Unique Technique to get Kaprekar Iteration in Linear Programming Problem

Science.gov (United States)

Sumathi, P.; Preethy, V.

2018-04-01

This paper explores about a frivolous number popularly known as Kaprekar constant and Kaprekar numbers. A large number of courses and the different classroom capacities with difference in study periods make the assignment between classrooms and courses complicated. An approach of getting the minimum value of number of iterations to reach the Kaprekar constant for four digit numbers and maximum value is also obtained through linear programming techniques.

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

Science.gov (United States)

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…

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

Science.gov (United States)

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…

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

International Nuclear Information System (INIS)

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

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

Science.gov (United States)

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…

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

Science.gov (United States)

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

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

CERN Document Server

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

13. A Posteriori Error Estimation for Finite Element Methods and Iterative Linear Solvers

Energy Technology Data Exchange (ETDEWEB)

Melboe, Hallgeir

2001-10-01

This thesis addresses a posteriori error estimation for finite element methods and iterative linear solvers. Adaptive finite element methods have gained a lot of popularity over the last decades due to their ability to produce accurate results with limited computer power. In these methods a posteriori error estimates play an essential role. Not only do they give information about how large the total error is, they also indicate which parts of the computational domain should be given a more sophisticated treatment in order to reduce the error. A posteriori error estimates are traditionally aimed at estimating the global error, but more recently so called goal oriented error estimators have been shown a lot of interest. The name reflects the fact that they estimate the error in user-defined local quantities. In this thesis the main focus is on global error estimators for highly stretched grids and goal oriented error estimators for flow problems on regular grids. Numerical methods for partial differential equations, such as finite element methods and other similar techniques, typically result in a linear system of equations that needs to be solved. Usually such systems are solved using some iterative procedure which due to a finite number of iterations introduces an additional error. Most such algorithms apply the residual in the stopping criterion, whereas the control of the actual error may be rather poor. A secondary focus in this thesis is on estimating the errors that are introduced during this last part of the solution procedure. The thesis contains new theoretical results regarding the behaviour of some well known, and a few new, a posteriori error estimators for finite element methods on anisotropic grids. Further, a goal oriented strategy for the computation of forces in flow problems is devised and investigated. Finally, an approach for estimating the actual errors associated with the iterative solution of linear systems of equations is suggested. (author)

14. Adaptive dynamic programming for discrete-time linear quadratic regulation based on multirate generalised policy iteration

Science.gov (United States)

Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho

2018-06-01

In this paper, we propose two multirate generalised policy iteration (GPI) algorithms applied to discrete-time linear quadratic regulation problems. The proposed algorithms are extensions of the existing GPI algorithm that consists of the approximate policy evaluation and policy improvement steps. The two proposed schemes, named heuristic dynamic programming (HDP) and dual HDP (DHP), based on multirate GPI, use multi-step estimation (M-step Bellman equation) at the approximate policy evaluation step for estimating the value function and its gradient called costate, respectively. Then, we show that these two methods with the same update horizon can be considered equivalent in the iteration domain. Furthermore, monotonically increasing and decreasing convergences, so called value iteration (VI)-mode and policy iteration (PI)-mode convergences, are proved to hold for the proposed multirate GPIs. Further, general convergence properties in terms of eigenvalues are also studied. The data-driven online implementation methods for the proposed HDP and DHP are demonstrated and finally, we present the results of numerical simulations performed to verify the effectiveness of the proposed methods.

15. On convergence rates for iteratively regularized procedures with linear penalty terms

International Nuclear Information System (INIS)

Smirnova, Alexandra

2012-01-01

The impact of this paper is twofold. First, we study convergence rates of the iteratively regularized Gauss–Newton (IRGN) algorithm with a linear penalty term under a generalized source assumption and show how the regularizing properties of new iterations depend on the solution smoothness. Secondly, we introduce an adaptive IRGN procedure, which is investigated under a relaxed smoothness condition. The introduction and analysis of a more general penalty term are of great importance since, apart from bringing stability to the numerical scheme designed for solving a large class of applied inverse problems, it allows us to incorporate various types of a priori information available on the model. Both a priori and a posteriori stopping rules are investigated. For the a priori stopping rule, optimal convergence rates are derived. A numerical example illustrating convergence rates is considered. (paper)

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

Science.gov (United States)

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.

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

KAUST Repository

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.

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

Directory of Open Access Journals (Sweden)

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.

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

International Nuclear Information System (INIS)

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

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

OpenAIRE

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

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

Science.gov (United States)

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…

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

Science.gov (United States)

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.

3. A Quadratically Convergent O(square root of nL-Iteration Algorithm for Linear Programming

National Research Council Canada - National Science Library

Ye, Y; Gueler, O; Tapia, Richard A; Zhang, Y

1991-01-01

...)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap...

4. Comparing performance of standard and iterative linear unmixing methods for hyperspectral signatures

Science.gov (United States)

Gault, Travis R.; Jansen, Melissa E.; DeCoster, Mallory E.; Jansing, E. David; Rodriguez, Benjamin M.

2016-05-01

Linear unmixing is a method of decomposing a mixed signature to determine the component materials that are present in sensor's field of view, along with the abundances at which they occur. Linear unmixing assumes that energy from the materials in the field of view is mixed in a linear fashion across the spectrum of interest. Traditional unmixing methods can take advantage of adjacent pixels in the decomposition algorithm, but is not the case for point sensors. This paper explores several iterative and non-iterative methods for linear unmixing, and examines their effectiveness at identifying the individual signatures that make up simulated single pixel mixed signatures, along with their corresponding abundances. The major hurdle addressed in the proposed method is that no neighboring pixel information is available for the spectral signature of interest. Testing is performed using two collections of spectral signatures from the Johns Hopkins University Applied Physics Laboratory's Signatures Database software (SigDB): a hand-selected small dataset of 25 distinct signatures from a larger dataset of approximately 1600 pure visible/near-infrared/short-wave-infrared (VIS/NIR/SWIR) spectra. Simulated spectra are created with three and four material mixtures randomly drawn from a dataset originating from SigDB, where the abundance of one material is swept in 10% increments from 10% to 90%with the abundances of the other materials equally divided amongst the remainder. For the smaller dataset of 25 signatures, all combinations of three or four materials are used to create simulated spectra, from which the accuracy of materials returned, as well as the correctness of the abundances, is compared to the inputs. The experiment is expanded to include the signatures from the larger dataset of almost 1600 signatures evaluated using a Monte Carlo scheme with 5000 draws of three or four materials to create the simulated mixed signatures. The spectral similarity of the inputs to the

5. Hom-Novikov algebras

International Nuclear Information System (INIS)

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.

6. Iterative linear solvers in a 2D radiation-hydrodynamics code: Methods and performance

International Nuclear Information System (INIS)

Baldwin, C.; Brown, P.N.; Falgout, R.; Graziani, F.; Jones, J.

1999-01-01

7. H-/H∞ structural damage detection filter design using an iterative linear matrix inequality approach

International Nuclear Information System (INIS)

Chen, B; Nagarajaiah, S

2008-01-01

The existence of damage in different members of a structure can be posed as a fault detection problem. It is also necessary to isolate structural members in which damage exists, which can be posed as a fault isolation problem. It is also important to detect the time instants of occurrence of the faults/damage. The structural damage detection filter developed in this paper is a model-based fault detection and isolation (FDI) observer suitable for detecting and isolating structural damage. In systems, possible faults, disturbances and noise are coupled together. When system disturbances and sensor noise cannot be decoupled from faults/damage, the detection filter needs to be designed to be robust to disturbances as well as sensitive to faults/damage. In this paper, a new H - /H ∞ and iterative linear matrix inequality (LMI) technique is developed and a new stabilizing FDI filter is proposed, which bounds the H ∞ norm of the transfer function from disturbances to the output residual and simultaneously does not degrade the component of the output residual due to damage. The reduced-order error dynamic system is adopted to form bilinear matrix inequalities (BMIs), then an iterative LMI algorithm is developed to solve the BMIs. The numerical example and experimental verification demonstrate that the proposed algorithm can successfully detect and isolate structural damage in the presence of measurement noise

8. Towards Automated Binding Affinity Prediction Using an Iterative Linear Interaction Energy Approach

Directory of Open Access Journals (Sweden)

C. Ruben Vosmeer

2014-01-01

Full Text Available Binding affinity prediction of potential drugs to target and off-target proteins is an essential asset in drug development. These predictions require the calculation of binding free energies. In such calculations, it is a major challenge to properly account for both the dynamic nature of the protein and the possible variety of ligand-binding orientations, while keeping computational costs tractable. Recently, an iterative Linear Interaction Energy (LIE approach was introduced, in which results from multiple simulations of a protein-ligand complex are combined into a single binding free energy using a Boltzmann weighting-based scheme. This method was shown to reach experimental accuracy for flexible proteins while retaining the computational efficiency of the general LIE approach. Here, we show that the iterative LIE approach can be used to predict binding affinities in an automated way. A workflow was designed using preselected protein conformations, automated ligand docking and clustering, and a (semi-automated molecular dynamics simulation setup. We show that using this workflow, binding affinities of aryloxypropanolamines to the malleable Cytochrome P450 2D6 enzyme can be predicted without a priori knowledge of dominant protein-ligand conformations. In addition, we provide an outlook for an approach to assess the quality of the LIE predictions, based on simulation outcomes only.

9. Improving the iterative Linear Interaction Energy approach using automated recognition of configurational transitions.

Science.gov (United States)

Vosmeer, C Ruben; Kooi, Derk P; Capoferri, Luigi; Terpstra, Margreet M; Vermeulen, Nico P E; Geerke, Daan P

2016-01-01

Recently an iterative method was proposed to enhance the accuracy and efficiency of ligand-protein binding affinity prediction through linear interaction energy (LIE) theory. For ligand binding to flexible Cytochrome P450s (CYPs), this method was shown to decrease the root-mean-square error and standard deviation of error prediction by combining interaction energies of simulations starting from different conformations. Thereby, different parts of protein-ligand conformational space are sampled in parallel simulations. The iterative LIE framework relies on the assumption that separate simulations explore different local parts of phase space, and do not show transitions to other parts of configurational space that are already covered in parallel simulations. In this work, a method is proposed to (automatically) detect such transitions during the simulations that are performed to construct LIE models and to predict binding affinities. Using noise-canceling techniques and splines to fit time series of the raw data for the interaction energies, transitions during simulation between different parts of phase space are identified. Boolean selection criteria are then applied to determine which parts of the interaction energy trajectories are to be used as input for the LIE calculations. Here we show that this filtering approach benefits the predictive quality of our previous CYP 2D6-aryloxypropanolamine LIE model. In addition, an analysis is performed of the gain in computational efficiency that can be obtained from monitoring simulations using the proposed filtering method and by prematurely terminating simulations accordingly.

10. Iterative solution of general sparse linear systems on clusters of workstations

Energy Technology Data Exchange (ETDEWEB)

Lo, Gen-Ching; Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)

1996-12-31

Solving sparse irregularly structured linear systems on parallel platforms poses several challenges. First, sparsity makes it difficult to exploit data locality, whether in a distributed or shared memory environment. A second, perhaps more serious challenge, is to find efficient ways to precondition the system. Preconditioning techniques which have a large degree of parallelism, such as multicolor SSOR, often have a slower rate of convergence than their sequential counterparts. Finally, a number of other computational kernels such as inner products could ruin any gains gained from parallel speed-ups, and this is especially true on workstation clusters where start-up times may be high. In this paper we discuss these issues and report on our experience with PSPARSLIB, an on-going project for building a library of parallel iterative sparse matrix solvers.

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

KAUST Repository

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

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

OpenAIRE

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.

International Nuclear Information System (INIS)

Lu Wenkai; Yin Fangfang

2004-01-01

Algebraic reconstruction techniques (ART) are iterative procedures for reconstructing objects from their projections. It is proven that ART can be computationally efficient by carefully arranging the order in which the collected data are accessed during the reconstruction procedure and adaptively adjusting the relaxation parameters. In this paper, an adaptive algebraic reconstruction technique (AART), which adopts the same projection access scheme in multilevel scheme algebraic reconstruction technique (MLS-ART), is proposed. By introducing adaptive adjustment of the relaxation parameters during the reconstruction procedure, one-iteration AART can produce reconstructions with better quality, in comparison with one-iteration MLS-ART. Furthermore, AART outperforms MLS-ART with improved computational efficiency

14. Implementation of linear filters for iterative penalized maximum likelihood SPECT reconstruction

International Nuclear Information System (INIS)

Liang, Z.

1991-01-01

This paper reports on six low-pass linear filters applied in frequency space implemented for iterative penalized maximum-likelihood (ML) SPECT image reconstruction. The filters implemented were the Shepp-Logan filter, the Butterworth filer, the Gaussian filter, the Hann filter, the Parzen filer, and the Lagrange filter. The low-pass filtering was applied in frequency space to projection data for the initial estimate and to the difference of projection data and reprojected data for higher order approximations. The projection data were acquired experimentally from a chest phantom consisting of non-uniform attenuating media. All the filters could effectively remove the noise and edge artifacts associated with ML approach if the frequency cutoff was properly chosen. The improved performance of the Parzen and Lagrange filters relative to the others was observed. The best image, by viewing its profiles in terms of noise-smoothing, edge-sharpening, and contrast, was the one obtained with the Parzen filter. However, the Lagrange filter has the potential to consider the characteristics of detector response function

15. Iterative methods for the solution of very large complex symmetric linear systems of equations in electrodynamics

Energy Technology Data Exchange (ETDEWEB)

Clemens, M.; Weiland, T. [Technische Hochschule Darmstadt (Germany)

1996-12-31

In the field of computational electrodynamics the discretization of Maxwells equations using the Finite Integration Theory (FIT) yields very large, sparse, complex symmetric linear systems of equations. For this class of complex non-Hermitian systems a number of conjugate gradient-type algorithms is considered. The complex version of the biconjugate gradient (BiCG) method by Jacobs can be extended to a whole class of methods for complex-symmetric algorithms SCBiCG(T, n), which only require one matrix vector multiplication per iteration step. In this class the well-known conjugate orthogonal conjugate gradient (COCG) method for complex-symmetric systems corresponds to the case n = 0. The case n = 1 yields the BiCGCR method which corresponds to the conjugate residual algorithm for the real-valued case. These methods in combination with a minimal residual smoothing process are applied separately to practical 3D electro-quasistatical and eddy-current problems in electrodynamics. The practical performance of the SCBiCG methods is compared with other methods such as QMR and TFQMR.

16. Abstract algebra

CERN Document Server

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

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

Science.gov (United States)

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.

18. Wavelets and quantum algebras

International Nuclear Information System (INIS)

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

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

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.

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

International Nuclear Information System (INIS)

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

2. A Superlinearly Convergent O(square root of nL)-Iteration Algorithm for Linear Programming

National Research Council Canada - National Science Library

Ye, Y; Tapia, Richard A; Zhang, Y

1991-01-01

.... We demonstrate that the modified algorithm maintains its O(square root of nL)-iteration complexity, while exhibiting superlinear convergence for general problems and quadratic convergence for nondegenerate problems...

3. PCG: A software package for the iterative solution of linear systems on scalar, vector and parallel computers

Energy Technology Data Exchange (ETDEWEB)

Joubert, W. [Los Alamos National Lab., NM (United States); Carey, G.F. [Univ. of Texas, Austin, TX (United States)

1994-12-31

A great need exists for high performance numerical software libraries transportable across parallel machines. This talk concerns the PCG package, which solves systems of linear equations by iterative methods on parallel computers. The features of the package are discussed, as well as techniques used to obtain high performance as well as transportability across architectures. Representative numerical results are presented for several machines including the Connection Machine CM-5, Intel Paragon and Cray T3D parallel computers.

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

Data.gov (United States)

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

5. INTELLIGENT FRACTIONAL ORDER ITERATIVE LEARNING CONTROL USING FEEDBACK LINEARIZATION FOR A SINGLE-LINK ROBOT

Directory of Open Access Journals (Sweden)

Iman Ghasemi

2017-05-01

Full Text Available In this paper, iterative learning control (ILC is combined with an optimal fractional order derivative (BBO-Da-type ILC and optimal fractional and proportional-derivative (BBO-PDa-type ILC. In the update law of Arimoto's derivative iterative learning control, a first order derivative of tracking error signal is used. In the proposed method, fractional order derivative of the error signal is stated in term of 'sa' where  to update iterative learning control law. Two types of fractional order iterative learning control namely PDa-type ILC and Da-type ILC are gained for different value of a. In order to improve the performance of closed-loop control system, coefficients of both  and  learning law i.e. proportional , derivative  and  are optimized using Biogeography-Based optimization algorithm (BBO. Outcome of the simulation results are compared with those of the conventional fractional order iterative learning control to verify effectiveness of BBO-Da-type ILC and BBO-PDa-type ILC

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

Science.gov (United States)

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…

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

Directory of Open Access Journals (Sweden)

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

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.

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

Directory of Open Access Journals (Sweden)

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.

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

Science.gov (United States)

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…

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

OpenAIRE

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

11. Asymptotic aspect of derivations in Banach algebras

Directory of Open Access Journals (Sweden)

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.

12. An iterative method for Tikhonov regularization with a general linear regularization operator

NARCIS (Netherlands)

Hochstenbach, M.E.; Reichel, L.

2010-01-01

Tikhonov regularization is one of the most popular approaches to solve discrete ill-posed problems with error-contaminated data. A regularization operator and a suitable value of a regularization parameter have to be chosen. This paper describes an iterative method, based on Golub-Kahan

13. On the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems

Czech Academy of Sciences Publication Activity Database

Bai, Z.-Z.; Rozložník, Miroslav

2015-01-01

Roč. 53, č. 4 (2015), s. 1716-1737 ISSN 0036-1429 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : matrix splitting * stationary iteration method * backward error * rounding error analysis Subject RIV: BA - General Mathematics Impact factor: 1.899, year: 2015

14. A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

Science.gov (United States)

Heinkenschloss, Matthias

2005-01-01

We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.

15. Stopping test of iterative methods for solving PDE

International Nuclear Information System (INIS)

Wang Bangrong

1991-01-01

In order to assure the accuracy of the numerical solution of the iterative method for solving PDE (partial differential equation), the stopping test is very important. If the coefficient matrix of the system of linear algebraic equations is strictly diagonal dominant or irreducible weakly diagonal dominant, the stopping test formulas of the iterative method for solving PDE is proposed. Several numerical examples are given to illustrate the applications of the stopping test formulas

16. A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

Directory of Open Access Journals (Sweden)

2014-05-01

Full Text Available In this paper‎, ‎we represent an inexact inverse‎ ‎subspace iteration method for computing a few eigenpairs of the‎ ‎generalized eigenvalue problem $Ax = \\lambda Bx$[Q.~Ye and P.~Zhang‎, ‎Inexact inverse subspace iteration for generalized eigenvalue‎ ‎problems‎, ‎Linear Algebra and its Application‎, ‎434 (2011 1697-1715‎‎]‎. ‎In particular‎, ‎the linear convergence property of the inverse‎ ‎subspace iteration is preserved‎.

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

CERN Document Server

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

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

International Nuclear Information System (INIS)

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

19. Basic algebra

CERN Document Server

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

20. Linear MHD stability analysis of post-disruption plasmas in ITER

Energy Technology Data Exchange (ETDEWEB)

Aleynikova, K., E-mail: ksenia.aleynikova@gmail.com [EURATOM Association, Max-Planck-Institut für Plasmaphysik (Germany); Huijsmans, G. T. A. [ITER Organization (France); Aleynikov, P. [EURATOM Association, Max-Planck-Institut für Plasmaphysik (Germany)

2016-05-15

Most of the plasma current can be replaced by a runaway electron (RE) current during plasma disruptions in ITER. In this case the post-disruption plasma current profile is likely to be more peaked than the pre-disruption profile. The MHD activity of such plasma will affect the runaway electron generation and confinement and the dynamics of the plasma position evolution (Vertical Displacement Event), limiting the timeframe for runaway electrons and disruption mitigation. In the present paper, we evaluate the influence of the possible RE seed current parameters on the onset of the MHD instabilities. By varying the RE seed current profile, we search for subsequent plasma evolutions with the highest and the lowest MHD activity. This information can be applied to a development of desirable ITER disruption scenario.

1. Iterative solutions of finite difference diffusion equations

International Nuclear Information System (INIS)

Menon, S.V.G.; Khandekar, D.C.; Trasi, M.S.

1981-01-01

The heterogeneous arrangement of materials and the three-dimensional character of the reactor physics problems encountered in the design and operation of nuclear reactors makes it necessary to use numerical methods for solution of the neutron diffusion equations which are based on the linear Boltzmann equation. The commonly used numerical method for this purpose is the finite difference method. It converts the diffusion equations to a system of algebraic equations. In practice, the size of this resulting algebraic system is so large that the iterative methods have to be used. Most frequently used iterative methods are discussed. They include : (1) basic iterative methods for one-group problems, (2) iterative methods for eigenvalue problems, and (3) iterative methods which use variable acceleration parameters. Application of Chebyshev theorem to iterative methods is discussed. The extension of the above iterative methods to multigroup neutron diffusion equations is also considered. These methods are applicable to elliptic boundary value problems in reactor design studies in particular, and to elliptic partial differential equations in general. Solution of sample problems is included to illustrate their applications. The subject matter is presented in as simple a manner as possible. However, a working knowledge of matrix theory is presupposed. (M.G.B.)

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

Science.gov (United States)

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…

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

International Nuclear Information System (INIS)

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

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

Science.gov (United States)

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.

5. Variational Iteration Method for Volterra Functional Integrodifferential Equations with Vanishing Linear Delays

Directory of Open Access Journals (Sweden)

Ali Konuralp

2014-01-01

Full Text Available Application process of variational iteration method is presented in order to solve the Volterra functional integrodifferential equations which have multi terms and vanishing delays where the delay function θ(t vanishes inside the integral limits such that θ(t=qt for 0

6. Validity of linear measurements of the jaws using ultralow-dose MDCT and the iterative techniques of ASIR and MBIR.

Science.gov (United States)

Al-Ekrish, Asma'a A; Al-Shawaf, Reema; Schullian, Peter; Al-Sadhan, Ra'ed; Hörmann, Romed; Widmann, Gerlig

2016-10-01

To assess the comparability of linear measurements of dental implant sites recorded from multidetector computed tomography (MDCT) images obtained using standard-dose filtered backprojection (FBP) technique with those from various ultralow doses combined with FBP, adaptive statistical iterative reconstruction (ASIR), and model-based iterative reconstruction (MBIR) techniques. The results of the study may contribute to MDCT dose optimization for dental implant site imaging. MDCT scans of two cadavers were acquired using a standard reference protocol and four ultralow-dose test protocols (TP). The volume CT dose index of the different dose protocols ranged from a maximum of 30.48-36.71 mGy to a minimum of 0.44-0.53 mGy. All scans were reconstructed using FBP, ASIR-50, ASIR-100, and MBIR, and either a bone or standard reconstruction kernel. Linear measurements were recorded from standardized images of the jaws by two examiners. Intra- and inter-examiner reliability of the measurements were analyzed using Cronbach's alpha and inter-item correlation. Agreement between the measurements obtained with the reference-dose/FBP protocol and each of the test protocols was determined with Bland-Altman plots and linear regression. Statistical significance was set at a P-value of 0.05. No systematic variation was found between the linear measurements obtained with the reference protocol and the other imaging protocols. The only exceptions were TP3/ASIR-50 (bone kernel) and TP4/ASIR-100 (bone and standard kernels). The mean measurement differences between these three protocols and the reference protocol were within ±0.1 mm, with the 95 % confidence interval limits being within the range of ±1.15 mm. A nearly 97.5 % reduction in dose did not significantly affect the height and width measurements of edentulous jaws regardless of the reconstruction algorithm used.

7. On the PR-algebras

International Nuclear Information System (INIS)

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

8. Algebraic partial Boolean algebras

International Nuclear Information System (INIS)

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

9. Efficient parallel iterative solvers for the solution of large dense linear systems arising from the boundary element method in electromagnetism

Energy Technology Data Exchange (ETDEWEB)

Alleon, G. [EADS-CCR, 31 - Blagnac (France); Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E. [Cerfacs, 31 - Toulouse (France)

2003-07-01

The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)

10. Efficient parallel iterative solvers for the solution of large dense linear systems arising from the boundary element method in electromagnetism

International Nuclear Information System (INIS)

Alleon, G.; Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E.

2003-01-01

The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)

Science.gov (United States)

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)

12. Development of an efficient iterative solver for linear systems in FE structural analysis

International Nuclear Information System (INIS)

Saint-Georges, P.; Warzee, G.; Beauwens, R.; Notay, Y.

1993-01-01

The preconditioned conjugate gradient is a well-known and powerful method to solve sparse symmetric positive definite systems of linear equations. Such systems are generated by the finite element discretization in structural analysis but users of finite element in this context generally still rely on direct methods. It is our purpose in the present paper to highlight the improvement brought forward by some new preconditioning techniques and show that the preconditioned conjugate gradient method is more performant than any direct method. (author)

13. Regularized iterative integration combined with non-linear diffusion filtering for phase-contrast x-ray computed tomography.

Science.gov (United States)

Burger, Karin; Koehler, Thomas; Chabior, Michael; Allner, Sebastian; Marschner, Mathias; Fehringer, Andreas; Willner, Marian; Pfeiffer, Franz; Noël, Peter

2014-12-29

Phase-contrast x-ray computed tomography has a high potential to become clinically implemented because of its complementarity to conventional absorption-contrast.In this study, we investigate noise-reducing but resolution-preserving analytical reconstruction methods to improve differential phase-contrast imaging. We apply the non-linear Perona-Malik filter on phase-contrast data prior or post filtered backprojected reconstruction. Secondly, the Hilbert kernel is replaced by regularized iterative integration followed by ramp filtered backprojection as used for absorption-contrast imaging. Combining the Perona-Malik filter with this integration algorithm allows to successfully reveal relevant sample features, quantitatively confirmed by significantly increased structural similarity indices and contrast-to-noise ratios. With this concept, phase-contrast imaging can be performed at considerably lower dose.

14. Non-LTE line-blanketed model atmospheres of hot stars. 1: Hybrid complete linearization/accelerated lambda iteration method

Science.gov (United States)

Hubeny, I.; Lanz, T.

1995-01-01

A new munerical method for computing non-Local Thermodynamic Equilibrium (non-LTE) model stellar atmospheres is presented. The method, called the hybird complete linearization/accelerated lambda iretation (CL/ALI) method, combines advantages of both its constituents. Its rate of convergence is virtually as high as for the standard CL method, while the computer time per iteration is almost as low as for the standard ALI method. The method is formulated as the standard complete lineariation, the only difference being that the radiation intensity at selected frequency points is not explicity linearized; instead, it is treated by means of the ALI approach. The scheme offers a wide spectrum of options, ranging from the full CL to the full ALI method. We deonstrate that the method works optimally if the majority of frequency points are treated in the ALI mode, while the radiation intensity at a few (typically two to 30) frequency points is explicity linearized. We show how this method can be applied to calculate metal line-blanketed non-LTE model atmospheres, by using the idea of 'superlevels' and 'superlines' introduced originally by Anderson (1989). We calculate several illustrative models taking into accont several tens of thosands of lines of Fe III to Fe IV and show that the hybrid CL/ALI method provides a robust method for calculating non-LTE line-blanketed model atmospheres for a wide range of stellar parameters. The results for individual stellar types will be presented in subsequent papers in this series.

15. Continuum analogues of contragredient Lie algebras

International Nuclear Information System (INIS)

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. Linear-scaling density-functional simulations of charged point defects in Al2O3 using hierarchical sparse matrix algebra.

Science.gov (United States)

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.

17. Graded associative conformal algebras of finite type

OpenAIRE

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

Science.gov (United States)

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.

19. Use Residual Correction Method and Monotone Iterative Technique to Calculate the Upper and Lower Approximate Solutions of Singularly Perturbed Non-linear Boundary Value Problems

Directory of Open Access Journals (Sweden)

Chi-Chang Wang

2013-09-01

Full Text Available This paper seeks to use the proposed residual correction method in coordination with the monotone iterative technique to obtain upper and lower approximate solutions of singularly perturbed non-linear boundary value problems. First, the monotonicity of a non-linear differential equation is reinforced using the monotone iterative technique, then the cubic-spline method is applied to discretize and convert the differential equation into the mathematical programming problems of an inequation, and finally based on the residual correction concept, complex constraint solution problems are transformed into simpler questions of equational iteration. As verified by the four examples given in this paper, the method proposed hereof can be utilized to fast obtain the upper and lower solutions of questions of this kind, and to easily identify the error range between mean approximate solutions and exact solutions.

20. Algebraic geometry

CERN Document Server

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.

1. Grassmann algebras

International Nuclear Information System (INIS)

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

2. Bicovariant quantum algebras and quantum Lie algebras

International Nuclear Information System (INIS)

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

3. New iterative solvers for the NAG Libraries

Energy Technology Data Exchange (ETDEWEB)

Salvini, S.; Shaw, G. [Numerical Algorithms Group Ltd., Oxford (United Kingdom)

1996-12-31

The purpose of this paper is to introduce the work which has been carried out at NAG Ltd to update the iterative solvers for sparse systems of linear equations, both symmetric and unsymmetric, in the NAG Fortran 77 Library. Our current plans to extend this work and include it in our other numerical libraries in our range are also briefly mentioned. We have added to the Library the new Chapter F11, entirely dedicated to sparse linear algebra. At Mark 17, the F11 Chapter includes sparse iterative solvers, preconditioners, utilities and black-box routines for sparse symmetric (both positive-definite and indefinite) linear systems. Mark 18 will add solvers, preconditioners, utilities and black-boxes for sparse unsymmetric systems: the development of these has already been completed.

4. Representations of fundamental groups of algebraic varieties

CERN Document Server

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. Polynomials in algebraic analysis

OpenAIRE

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

6. Vertex algebras and algebraic curves

CERN Document Server

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

7. Implicative Algebras

African Journals Online (AJOL)

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

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

Directory of Open Access Journals (Sweden)

M. Legua

2008-01-01

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

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

Science.gov (United States)

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

10. Copper Mountain conference on iterative methods: Proceedings: Volume 2

Energy Technology Data Exchange (ETDEWEB)

NONE

1996-10-01

This volume (the second of two) contains information presented during the last two days of the Copper Mountain Conference on Iterative Methods held April 9-13, 1996 at Copper Mountain, Colorado. Topics of the sessions held these two days include domain decomposition, Krylov methods, computational fluid dynamics, Markov chains, sparse and parallel basic linear algebra subprograms, multigrid methods, applications of iterative methods, equation systems with multiple right-hand sides, projection methods, and the Helmholtz equation. Selected papers indexed separately for the Energy Science and Technology Database.

11. Differential Equation over Banach Algebra

OpenAIRE

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.

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

International Nuclear Information System (INIS)

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)

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

International Nuclear Information System (INIS)

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

14. Performance of direct and iterative algorithms on an optical systolic processor

Science.gov (United States)

Ghosh, A. K.; Casasent, D.; Neuman, C. P.

1985-11-01

The frequency-multiplexed optical linear algebra processor (OLAP) is treated in detail with attention to its performance in the solution of systems of linear algebraic equations (LAEs). General guidelines suitable for most OLAPs, including digital-optical processors, are advanced concerning system and component error source models, guidelines for appropriate use of direct and iterative algorithms, the dominant error sources, and the effect of multiple simultaneous error sources. Specific results are advanced on the quantitative performance of both direct and iterative algorithms in the solution of systems of LAEs and in the solution of nonlinear matrix equations. Acoustic attenuation is found to dominate iterative algorithms and detector noise to dominate direct algorithms. The effect of multiple spatial errors is found to be additive. A theoretical expression for the amount of acoustic attenuation allowed is advanced and verified. Simulations and experimental data are included.

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

Science.gov (United States)

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.

16. Block iterative restoration of astronomical images with the massively parallel processor

International Nuclear Information System (INIS)

Heap, S.R.; Lindler, D.J.

1987-01-01

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

17. Intermediate algebra & analytic geometry

CERN Document Server

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

18. Boolean algebra

CERN Document Server

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.

19. Explicit field realizations of W algebras

OpenAIRE

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

20. Computer Algebra Systems in Undergraduate Instruction.

Science.gov (United States)

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)

1. Applied matrix algebra in the statistical sciences

CERN Document Server

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.

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

Directory of Open Access Journals (Sweden)

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.

3. Jordan algebras versus C*- algebras

International Nuclear Information System (INIS)

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

4. Lectures on W algebras and W gravity

International Nuclear Information System (INIS)

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

5. The large N=4 superconformal W∞ algebra

International Nuclear Information System (INIS)

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.

6. On the algebraic reconstruction of the Duffing's mechanical system

International Nuclear Information System (INIS)

Aguilar-Ibanez, Carlos; Sanchez H, Jorge; Suarez C, Miguel S.; Martinez C, Juan

2008-01-01

The identification of the unknown parameters of the Duffing's mechanical system, based on an algebraic approach, is presented. This approach is fast, accurate, and simple to numerically implement. Also, the method, combined with a suitable invariant filter, can became robust against high frequency output measurement noises. Our method uses the availability of one measurable output and produces an exact formula for the unknown parameters, which may be realized in terms of iterated convolutions. First, we show that the Duffing's system parameters are linearly identifiable with respect to the position variable, then we obtain a linear system where the unknowns are the unavailable parameters. Suitable algebraic operations on the output differential equations makes the identification schema independent of the unavailable initial conditions of the underlying nonlinear dynamical system

7. Algebraic reconstruction techniques for spectral reconstruction in diffuse optical tomography

International Nuclear Information System (INIS)

Brendel, Bernhard; Ziegler, Ronny; Nielsen, Tim

2008-01-01

Reconstruction in diffuse optical tomography (DOT) necessitates solving the diffusion equation, which is nonlinear with respect to the parameters that have to be reconstructed. Currently applied solving methods are based on the linearization of the equation. For spectral three-dimensional reconstruction, the emerging equation system is too large for direct inversion, but the application of iterative methods is feasible. Computational effort and speed of convergence of these iterative methods are crucial since they determine the computation time of the reconstruction. In this paper, the iterative methods algebraic reconstruction technique (ART) and conjugated gradients (CGs) as well as a new modified ART method are investigated for spectral DOT reconstruction. The aim of the modified ART scheme is to speed up the convergence by considering the specific conditions of spectral reconstruction. As a result, it converges much faster to favorable results than conventional ART and CG methods

8. Explicit field realizations of W algebras

International Nuclear Information System (INIS)

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.

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

NARCIS (Netherlands)

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.

10. Algebra & trigonometry super review

CERN Document Server

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

11. NITSOL: A Newton iterative solver for nonlinear systems

Energy Technology Data Exchange (ETDEWEB)

Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States); Walker, H.F. [Utah State Univ., Logan, UT (United States)

1996-12-31

Newton iterative methods, also known as truncated Newton methods, are implementations of Newtons method in which the linear systems that characterize Newton steps are solved approximately using iterative linear algebra methods. Here, we outline a well-developed Newton iterative algorithm together with a Fortran implementation called NITSOL. The basic algorithm is an inexact Newton method globalized by backtracking, in which each initial trial step is determined by applying an iterative linear solver until an inexact Newton criterion is satisfied. In the implementation, the user can specify inexact Newton criteria in several ways and select an iterative linear solver from among several popular {open_quotes}transpose-free{close_quotes} Krylov subspace methods. Jacobian-vector products used by the Krylov solver can be either evaluated analytically with a user-supplied routine or approximated using finite differences of function values. A flexible interface permits a wide variety of preconditioning strategies and allows the user to define a preconditioner and optionally update it periodically. We give details of these and other features and demonstrate the performance of the implementation on a representative set of test problems.

12. Separable algebras

CERN Document Server

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.

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

International Nuclear Information System (INIS)

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

14. Investigation of linearity of the ITER outer vessel steady-state magnetic field sensors at high temperature.

Czech Academy of Sciences Publication Activity Database

Entler, Slavomír; Ďuran, Ivan; Kocan, M.; Vayakis, G.

2017-01-01

Roč. 12, č. 7 (2017), č. článku C07007. ISSN 1748-0221. [European Conference on Plasma Diagnostics (ECPD2017)/2./. Bordeaux, 18.04.2017-21.04.2017] EU Projects: European Commission(XE) 633053 - EUROfusion Institutional support: RVO:61389021 Keywords : Plasma diagnostics - probes * Detector alignment and calibration methods (lasers, sources, particle-beams) * ITER * Magnetic field Subject RIV: BL - Plasma and Gas Discharge Physics OBOR OECD: 2.11 Other engineering and technologies Impact factor: 1.220, year: 2016 http://iopscience.iop.org/article/10.1088/1748-0221/12/07/C07007/pdf

15. Least median of squares and iteratively re-weighted least squares as robust linear regression methods for fluorimetric determination of α-lipoic acid in capsules in ideal and non-ideal cases of linearity.

Science.gov (United States)

Korany, Mohamed A; Gazy, Azza A; Khamis, Essam F; Ragab, Marwa A A; Kamal, Miranda F

2018-03-26

This study outlines two robust regression approaches, namely least median of squares (LMS) and iteratively re-weighted least squares (IRLS) to investigate their application in instrument analysis of nutraceuticals (that is, fluorescence quenching of merbromin reagent upon lipoic acid addition). These robust regression methods were used to calculate calibration data from the fluorescence quenching reaction (∆F and F-ratio) under ideal or non-ideal linearity conditions. For each condition, data were treated using three regression fittings: Ordinary Least Squares (OLS), LMS and IRLS. Assessment of linearity, limits of detection (LOD) and quantitation (LOQ), accuracy and precision were carefully studied for each condition. LMS and IRLS regression line fittings showed significant improvement in correlation coefficients and all regression parameters for both methods and both conditions. In the ideal linearity condition, the intercept and slope changed insignificantly, but a dramatic change was observed for the non-ideal condition and linearity intercept. Under both linearity conditions, LOD and LOQ values after the robust regression line fitting of data were lower than those obtained before data treatment. The results obtained after statistical treatment indicated that the linearity ranges for drug determination could be expanded to lower limits of quantitation by enhancing the regression equation parameters after data treatment. Analysis results for lipoic acid in capsules, using both fluorimetric methods, treated by parametric OLS and after treatment by robust LMS and IRLS were compared for both linearity conditions. Copyright © 2018 John Wiley & Sons, Ltd.

16. Problems in abstract algebra

CERN Document Server

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. Error-source effects on the performance of direct and iterative algorithms on an optical matrix-vector processor

Science.gov (United States)

Perlee, Caroline J.; Casasent, David P.

1990-09-01

Error sources in an optical matrix-vector processor are analyzed in terms of their effect on the performance of the algorithms used to solve a set of nonlinear and linear algebraic equations. A direct and an iterative algorithm are used to solve a nonlinear time-dependent case-study from computational fluid dynamics. A simulator which emulates the data flow and number representation of the OLAP is used to studs? these error effects. The ability of each algorithm to tolerate or correct the error sources is quantified. These results are extended to the general case of solving nonlinear and linear algebraic equations on the optical system.

18. Anyons, deformed oscillator algebras and projectors

International Nuclear Information System (INIS)

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.

19. UCSMP Algebra. What Works Clearinghouse Intervention Report

Science.gov (United States)

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…

Science.gov (United States)

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

1. College Algebra I.

Science.gov (United States)

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…

2. Waterloo Workshop on Computer Algebra

CERN Document Server

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.

3. Simple Lie algebras and Dynkin diagrams

International Nuclear Information System (INIS)

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

4. Investigation of linearity of the ITER outer vessel steady-state magnetic field sensors at high temperature

Science.gov (United States)

Entler, S.; Duran, I.; Kocan, M.; Vayakis, G.

2017-07-01

Three vacuum vessel sectors in ITER will be instrumented by the outer vessel steady-state magnetic field sensors. Each sensor unit features a pair of metallic Hall sensors with a sensing layer made of bismuth to measure tangential and normal components of the local magnetic field. The influence of temperature and magnetic field on the Hall coefficient was tested for the temperature range from 25 to 250 oC and the magnetic field range from 0 to 0.5 T. A fit of the Hall coefficient normalized temperature function independent of magnetic field was found, and a model of the Hall coefficient functional dependence at a wide range of temperature and magnetic field was built with the purpose to simplify the calibration procedure.

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

Science.gov (United States)

Benhammouda, Brahim

2016-01-01

Since 1980, the Adomian decomposition method (ADM) has been extensively used as a simple powerful tool that applies directly to solve different kinds of nonlinear equations including functional, differential, integro-differential and algebraic equations. However, for differential-algebraic equations (DAEs) the ADM is applied only in four earlier works. There, the DAEs are first pre-processed by some transformations like index reductions before applying the ADM. The drawback of such transformations is that they can involve complex algorithms, can be computationally expensive and may lead to non-physical solutions. The purpose of this paper is to propose a novel technique that applies the ADM directly to solve a class of nonlinear higher-index Hessenberg DAEs systems efficiently. The main advantage of this technique is that; firstly it avoids complex transformations like index reductions and leads to a simple general algorithm. Secondly, it reduces the computational work by solving only linear algebraic systems with a constant coefficient matrix at each iteration, except for the first iteration where the algebraic system is nonlinear (if the DAE is nonlinear with respect to the algebraic variable). To demonstrate the effectiveness of the proposed technique, we apply it to a nonlinear index-three Hessenberg DAEs system with nonlinear algebraic constraints. This technique is straightforward and can be programmed in Maple or Mathematica to simulate real application problems.

6. An {Mathematical expression} iteration bound primal-dual cone affine scaling algorithm for linear programmingiteration bound primal-dual cone affine scaling algorithm for linear programming

NARCIS (Netherlands)

J.F. Sturm; J. Zhang (Shuzhong)

1996-01-01

textabstractIn this paper we introduce a primal-dual affine scaling method. The method uses a search-direction obtained by minimizing the duality gap over a linearly transformed conic section. This direction neither coincides with known primal-dual affine scaling directions (Jansen et al., 1993;

7. ITER...ation

International Nuclear Information System (INIS)

Troyon, F.

1997-01-01

Recurrent attacks against ITER, the new generation of tokamak are a mix of political and scientific arguments. This short article draws a historical review of the European fusion program. This program has allowed to build and manage several installations in the aim of getting experimental results necessary to lead the program forwards. ITER will bring together a fusion reactor core with technologies such as materials, superconductive coils, heating devices and instrumentation in order to validate and delimit the operating range. ITER will be a logical and decisive step towards the use of controlled fusion. (A.C.)

8. Handbook of algebra Vol. 1

CERN Document Server

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. Elementary matrix algebra

CERN Document Server

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

10. Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems.

Science.gov (United States)

Wang, An; Cao, Yang; Shi, Quan

2018-01-01

In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl. 23:629-641, 2016). New convergence conditions are presented when the system matrix is a positive-definite matrix and an [Formula: see text]-matrix, respectively.

11. College algebra

CERN Document Server

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

CERN Document Server

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. Inverting the Linear Algebra Classroom

Science.gov (United States)

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…

14. Approximate Implicitization Using Linear Algebra

Directory of Open Access Journals (Sweden)

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.

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

16. Linear algebra and group theory

CERN Document Server

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.

17. Complex Algebraic Varieties

CERN Document Server

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

18. Algebraic topology a primer

CERN Document Server

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

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

OpenAIRE

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

20. Equivalency of two-dimensional algebras

International Nuclear Information System (INIS)

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)

1. N=2 current algebra and coset models

International Nuclear Information System (INIS)

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

2. Comments on N=4 superconformal algebras

International Nuclear Information System (INIS)

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

3. Generalized NLS hierarchies from rational W algebras

International Nuclear Information System (INIS)

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

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

International Nuclear Information System (INIS)

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)

5. A Warm-Started Homogeneous and Self-Dual Interior-Point Method for Linear Economic Model Predictive Control

DEFF Research Database (Denmark)

Sokoler, Leo Emil; Skajaa, Anders; Frison, Gianluca

2013-01-01

algorithm in MATLAB and its performance is analyzed based on a smart grid power management case study. Closed loop simulations show that 1) our algorithm is significantly faster than state-of-the-art IPMs based on sparse linear algebra routines, and 2) warm-starting reduces the number of iterations...

6. Biderivations of finite dimensional complex simple Lie algebras

OpenAIRE

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.

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

International Nuclear Information System (INIS)

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.

8. Application of an iterative methodology for cross-section and variance/covariance data adjustment to the analysis of fast spectrum systems accounting for non-linearity

International Nuclear Information System (INIS)

Pelloni, Sandro

2014-01-01

Highlights: • Our data adjustment is based on a Generalized Linear Least-Squares approach. • The computed sensitivity coefficients are converged within an iterative procedure. • The corresponding multistep adjustment thus accounts for non-linearity. • It provides a more accurate simulation of fast-spectrum experiments. - Abstract: The data assimilation benchmark launched by the “Subgroup 33” on “Methods and issues for the combined use of integral experiments and covariance data” of the Working Party on Evaluation Cooperation (WPEC) of the OECD Nuclear Energy Agency Nuclear Science Committee is recalculated by means of a multistep adjustment procedure using the deterministic code system ERANOS in conjunction with a dedicated Generalized Linear Least-Squares approach based on the Bayesian parameter estimation method. Nuclear data in terms of multi-group cross-sections as well as their variances and covariances, are adjusted for 11 nuclides, namely 10 B, 16 O, 23 Na, 56 Fe, 52 Cr, 58 Ni, 235 U, 238 U, 239 Pu, 240 Pu and 241 Pu and 6 nuclear reactions which are elastic and inelastic scattering, lumped (n,2n) and (n,3n), capture, fission and ν ¯ . The adjustment is carried out by making use of experimental data for 19 integral parameters obtained in 7 different fast spectrum systems. In the determination of a posteriori values for these integral parameters including effective multiplication factors, spectral indices and void effects, along with their nuclear data uncertainty, the required adjusted data for these nuclides and reactions are generated in conjunction with pre-computed sensitivity coefficients of the analytical integral parameters to the nuclear data to adjust. The suggested multistep scheme aims at accounting for non-linear effects. Correspondingly, the sensitivity coefficients are recalculated within an iterative procedure on the basis of the a posteriori analytical values and adjusted cross-sections. The adjustment is thus repeated

9. Elements of algebraic coding systems

CERN Document Server

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

International Nuclear Information System (INIS)

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. On the use of iterative techniques for feedforward control of transverse angle and position jitter in linear particle beam accelerators

International Nuclear Information System (INIS)

Barr, D.S.

1995-01-01

It is possible to use feedforward predictive control for transverse position and trajectory-angle jitter correction. The control procedure is straightforward, but creation of the predictive filter is not as obvious. The two process tested were the least mean squares (LMS) and Kalman filter methods. The controller parameters calculated offline are downloaded to a real-time analog correction system between macropulses. These techniques worked well for both interpulse (pulse-to-pulse) correction and intrapulse (within a pulse) correction with the Kalman filter method being the clear winner. A simulation based on interpulse data taken at the Stanford Linear Collider showed an improvement factor of almost three in the average rms jitter over standard feedback techniques for the Kalman filter. An improvement factor of over three was found for the Kalman filter on intrapulse data taken at the Los Alamos Meson Physics Facility. The feedforward systems also improved the correction bandwidth. copyright 1995 American Institute of Physics

12. On the use of iterative techniques for feedforward control of transverse angle and position jitter in linear particle beam accelerators

International Nuclear Information System (INIS)

Barr, D.S.

1994-01-01

It is possible to use feedforward predictive control for transverse position and trajectory-angle jitter correction. The control procedure is straightforward, but creation of the predictive filter is not as obvious. The two processes tested were the least mean squares (LMS) and Kalman inter methods. The controller parameters calculated offline are downloaded to a real-time analog correction system between macropulses. These techniques worked well for both interpulse (pulse-to-pulse) correction and intrapulse (within a pulse) correction with the Kalman filter method being the clear winner. A simulation based on interpulse data taken at the Stanford Linear Collider showed an improvement factor of almost three in the average rms jitter over standard feedback techniques for the Kalman filter. An improvement factor of over three was found for the Kalman filter on intrapulse data taken at the Los Alamos Meson Physics Facility. The feedforward systems also improved the correction bandwidth

13. A q-deformed Lorentz algebra

International Nuclear Information System (INIS)

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

14. Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems

Czech Academy of Sciences Publication Activity Database

Duintjer Tebbens, Jurjen; Tůma, Miroslav

2007-01-01

Roč. 29, č. 5 (2007), s. 1918-1941 ISSN 1064-8275 R&D Projects: GA AV ČR 1ET400300415; GA AV ČR KJB100300703 Institutional research plan: CEZ:AV0Z10300504 Keywords : preconditioned iterative methods * sparse matrices * sequences of linear algebraic systems * incomplete factorizations * factorization updates * Gauss–Jordan transformations * minimum spanning tree Subject RIV: BA - General Mathematics Impact factor: 1.784, year: 2007

15. Lie Algebras and Integrable Systems

International Nuclear Information System (INIS)

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)

16. Algebraic and stochastic coding theory

CERN Document Server

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.

17. Algebraic computing

International Nuclear Information System (INIS)

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)

18. Generation and Identification of Ordinary Differential Equations of Maximal Symmetry Algebra

Directory of Open Access Journals (Sweden)

J. C. Ndogmo

2016-01-01

Full Text Available An effective method for generating linear ordinary differential equations of maximal symmetry in their most general form is found, and an explicit expression for the point transformation reducing the equation to its canonical form is obtained. New expressions for the general solution are also found, as well as several identification and other results and a direct proof of the fact that a linear ordinary differential equation is iterative if and only if it is reducible to the canonical form by a point transformation. New classes of solvable equations parameterized by an arbitrary function are also found, together with simple algebraic expressions for the corresponding general solution.

19. Lie algebras

CERN Document Server

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

20. Observable algebras for the rational and trigonometric Euler-Calogero-Moser Models

International Nuclear Information System (INIS)

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

1. An Algorithm for Isolating the Real Solutions of Piecewise Algebraic Curves

Directory of Open Access Journals (Sweden)

Jinming Wu

2011-01-01

to compute the real solutions of two piecewise algebraic curves. It is primarily based on the Krawczyk-Moore iterative algorithm and good initial iterative interval searching algorithm. The proposed algorithm is relatively easy to implement.

2. Error-Detecting Identification Codes for Algebra Students.

Science.gov (United States)

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

International Nuclear Information System (INIS)

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. Cluster algebras in mathematical physics

International Nuclear Information System (INIS)

Francesco, Philippe Di; Gekhtman, Michael; Kuniba, Atsuo; Yamazaki, Masahito

2014-01-01

This special issue of Journal of Physics A: Mathematical and Theoretical contains reviews and original research articles on cluster algebras and their applications to mathematical physics. Cluster algebras were introduced by S Fomin and A Zelevinsky around 2000 as a tool for studying total positivity and dual canonical bases in Lie theory. Since then the theory has found diverse applications in mathematics and mathematical physics. Cluster algebras are axiomatically defined commutative rings equipped with a distinguished set of generators (cluster variables) subdivided into overlapping subsets (clusters) of the same cardinality subject to certain polynomial relations. A cluster algebra of rank n can be viewed as a subring of the field of rational functions in n variables. Rather than being presented, at the outset, by a complete set of generators and relations, it is constructed from the initial seed via an iterative procedure called mutation producing new seeds successively to generate the whole algebra. A seed consists of an n-tuple of rational functions called cluster variables and an exchange matrix controlling the mutation. Relations of cluster algebra type can be observed in many areas of mathematics (Plücker and Ptolemy relations, Stokes curves and wall-crossing phenomena, Feynman integrals, Somos sequences and Hirota equations to name just a few examples). The cluster variables enjoy a remarkable combinatorial pattern; in particular, they exhibit the Laurent phenomenon: they are expressed as Laurent polynomials rather than more general rational functions in terms of the cluster variables in any seed. These characteristic features are often referred to as the cluster algebra structure. In the last decade, it became apparent that cluster structures are ubiquitous in mathematical physics. Examples include supersymmetric gauge theories, Poisson geometry, integrable systems, statistical mechanics, fusion products in infinite dimensional algebras, dilogarithm

8. Prime alternative algebras that are nearly commutative

International Nuclear Information System (INIS)

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

9. An iteratively reweighted least-squares approach to adaptive robust adjustment of parameters in linear regression models with autoregressive and t-distributed deviations

Science.gov (United States)

Kargoll, Boris; Omidalizarandi, Mohammad; Loth, Ina; Paffenholz, Jens-André; Alkhatib, Hamza

2018-03-01

In this paper, we investigate a linear regression time series model of possibly outlier-afflicted observations and autocorrelated random deviations. This colored noise is represented by a covariance-stationary autoregressive (AR) process, in which the independent error components follow a scaled (Student's) t-distribution. This error model allows for the stochastic modeling of multiple outliers and for an adaptive robust maximum likelihood (ML) estimation of the unknown regression and AR coefficients, the scale parameter, and the degree of freedom of the t-distribution. This approach is meant to be an extension of known estimators, which tend to focus only on the regression model, or on the AR error model, or on normally distributed errors. For the purpose of ML estimation, we derive an expectation conditional maximization either algorithm, which leads to an easy-to-implement version of iteratively reweighted least squares. The estimation performance of the algorithm is evaluated via Monte Carlo simulations for a Fourier as well as a spline model in connection with AR colored noise models of different orders and with three different sampling distributions generating the white noise components. We apply the algorithm to a vibration dataset recorded by a high-accuracy, single-axis accelerometer, focusing on the evaluation of the estimated AR colored noise model.

10. Algebraic characterizations of measure algebras

Czech Academy of Sciences Publication Activity Database

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

11. Quantum W-algebras and elliptic algebras

International Nuclear Information System (INIS)

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

12. On 2-Banach algebras

International Nuclear Information System (INIS)

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

13. Lie-Algebras. Pt. 1

International Nuclear Information System (INIS)

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

14. Color Algebras

Science.gov (United States)

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

Science.gov (United States)

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

International Nuclear Information System (INIS)

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

International Nuclear Information System (INIS)

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. Fibered F-Algebra

OpenAIRE

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.

19. An algebraic approach to the scattering equations

Energy Technology Data Exchange (ETDEWEB)

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.

20. Deriving the Regression Line with Algebra

Science.gov (United States)

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