Mapping Computation with No Memory

NASA Astrophysics Data System (ADS)

Burckel, Serge; Gioan, Emeric; Thomé, Emmanuel

We investigate the computation of mappings from a set S n to itself with in situ programs, that is using no extra variables than the input, and performing modifications of one component at a time. We consider several types of mappings and obtain effective computation and decomposition methods, together with upper bounds on the program length (number of assignments). Our technique is combinatorial and algebraic (graph coloration, partition ordering, modular arithmetics).

Linear maps preserving maximal deviation and the Jordan structure of quantum systems

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

Hamhalter, Jan

2012-12-15

In the algebraic approach to quantum theory, a quantum observable is given by an element of a Jordan algebra and a state of the system is modelled by a normalized positive functional on the underlying algebra. Maximal deviation of a quantum observable is the largest statistical deviation one can obtain in a particular state of the system. The main result of the paper shows that each linear bijective transformation between JBW algebras preserving maximal deviations is formed by a Jordan isomorphism or a minus Jordan isomorphism perturbed by a linear functional multiple of an identity. It shows that only onemore » numerical statistical characteristic has the power to determine the Jordan algebraic structure completely. As a consequence, we obtain that only very special maps can preserve the diameter of the spectra of elements. Nonlinear maps preserving the pseudometric given by maximal deviation are also described. The results generalize hitherto known theorems on preservers of maximal deviation in the case of self-adjoint parts of von Neumann algebras proved by Molnar.« less

Temporal mapping and analysis

NASA Technical Reports Server (NTRS)

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

2011-01-01

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

Mapping Conceptual Understanding of Algebraic Concepts: An Exploratory Investigation Involving Grade 8 Chinese Students

ERIC Educational Resources Information Center

Jin, Haiyue; Wong, Khoon Yoong

2015-01-01

Conceptual understanding is a major aim of mathematics education, and concept map has been used in non-mathematics research to uncover the relations among concepts held by students. This article presents the results of using concept map to assess conceptual understanding of basic algebraic concepts held by a group of 48 grade 8 Chinese students.…

Absolute continuity for operator valued completely positive maps on C∗-algebras

NASA Astrophysics Data System (ADS)

Gheondea, Aurelian; Kavruk, Ali Şamil

2009-02-01

Motivated by applicability to quantum operations, quantum information, and quantum probability, we investigate the notion of absolute continuity for operator valued completely positive maps on C∗-algebras, previously introduced by Parthasarathy [in Athens Conference on Applied Probability and Time Series Analysis I (Springer-Verlag, Berlin, 1996), pp. 34-54]. We obtain an intrinsic definition of absolute continuity, we show that the Lebesgue decomposition defined by Parthasarathy is the maximal one among all other Lebesgue-type decompositions and that this maximal Lebesgue decomposition does not depend on the jointly dominating completely positive map, we obtain more flexible formulas for calculating the maximal Lebesgue decomposition, and we point out the nonuniqueness of the Lebesgue decomposition as well as a sufficient condition for uniqueness. In addition, we consider Radon-Nikodym derivatives for absolutely continuous completely positive maps that, in general, are unbounded positive self-adjoint operators affiliated to a certain von Neumann algebra, and we obtain a spectral approximation by bounded Radon-Nikodym derivatives. An application to the existence of the infimum of two completely positive maps is indicated, and formulas in terms of Choi's matrices for the Lebesgue decomposition of completely positive maps in matrix algebras are obtained.

a Triangular Deformation of the Two-Dimensional POINCARÉ Algebra

NASA Astrophysics Data System (ADS)

Khorrami, M.; Shariati, A.; Abolhassani, M. R.; Aghamohammadi, A.

Contracting the h-deformation of SL(2, ℝ), we construct a new deformation of two-dimensional Poincaré's algebra, the algebra of functions on its group and its differential structure. It is seen that these dual Hopf algebras are isomorphic to each other. It is also shown that the Hopf algebra is triangular, and its universal R-matrix is also constructed explicitly. We then find a deformation map for the universal enveloping algebra, and at the end, give the deformed mass shells and Lorentz transformation.

The Existence of the Solution to One Kind of Algebraic Riccati Equation

NASA Astrophysics Data System (ADS)

Liu, Jianming

2018-03-01

The matrix equation ATX + XA + XRX + Q = O is called algebraic Riccati equation, which is very important in the fields of automatic control and other engineering applications. Many researchers have studied the solutions to various algebraic Riccati equations and most of them mainly applied the matrix methods, while few used the functional analysis theories. This paper mainly studies the existence of the solution to the following kind of algebraic Riccati equation from the functional view point: ATX + XA + XRX ‑λX + Q = O Here, X, A, R, Q ∈ n×n , Q is a symmetric matrix, and R is a positive or negative semi-definite matrix, λ is arbitrary constants. This paper uses functional approach such as fixed point theorem and contraction mapping thinking so as to provide two sufficient conditions for the solvability about this kind of Riccati equation and to arrive at some relevant conclusions.

A Geometric Construction of Cyclic Cocycles on Twisted Convolution Algebras

NASA Astrophysics Data System (ADS)

Angel, Eitan

2010-09-01

In this thesis we give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. In his seminal book, Connes constructs a map from the equivariant cohomology of a manifold carrying the action of a discrete group into the periodic cyclic cohomology of the associated convolution algebra. Furthermore, for proper étale groupoids, J.-L. Tu and P. Xu provide a map between the periodic cyclic cohomology of a gerbe twisted convolution algebra and twisted cohomology groups. Our focus will be the convolution algebra with a product defined by a gerbe over a discrete translation groupoid. When the action is not proper, we cannot construct an invariant connection on the gerbe; therefore to study this algebra, we instead develop simplicial notions related to ideas of J. Dupont to construct a simplicial form representing the Dixmier-Douady class of the gerbe. Then by using a JLO formula we define a morphism from a simplicial complex twisted by this simplicial Dixmier-Douady form to the mixed bicomplex of certain matrix algebras. Finally, we define a morphism from this complex to the mixed bicomplex computing the periodic cyclic cohomology of the twisted convolution algebras.

Topics in elementary particle physics

NASA Astrophysics Data System (ADS)

Jin, Xiang

The author of this thesis discusses two topics in elementary particle physics: n-ary algebras and their applications to M-theory (Part I), and functional evolution and Renormalization Group flows (Part II). In part I, Lie algebra is extended to four different n-ary algebraic structure: generalized Lie algebra, Filippov algebra, Nambu algebra and Nambu-Poisson tensor; though there are still many other n-ary algebras. A natural property of Generalized Lie algebras — the Bremner identity, is studied, and proved with a totally different method from its original version. We extend Bremner identity to n-bracket cases, where n is an arbitrary odd integer. Filippov algebras do not focus on associativity, and are defined by the Fundamental identity. We add associativity to Filippov algebras, and give examples of how to construct Filippov algebras from su(2), bosonic oscillator, Virasoro algebra. We try to include fermionic charges into the ternary Virasoro-Witt algebra, but the attempt fails because fermionic charges keep generating new charges that make the algebra not closed. We also study the Bremner identity restriction on Nambu algebras and Nambu-Poisson tensors. So far, the only example 3-algebra being used in physics is the BLG model with 3-algebra A4, describing two M2-branes interactions. Its extension with Nambu algebra, BLG-NB model, is believed to describe infinite M2-branes condensation. Also, there is another propose for M2-brane interactions, the ABJM model, which is constructed by ordinary Lie algebra. We compare the symmetry properties between them, and discuss the possible approaches to include these three models into a grand unification theory. In Part II, we give an approximate solution for Schroeder's equations, based on series and conjugation methods. We use the logistic map as an example, and demonstrate that this approximate solution converges to known analytical solutions around the fixed point, around which the approximate solution is constructed. Although the closed-form solutions for Schroeder's equations can not always be approached analytically, by fitting the approximation solutions, one can still obtain closed-form solutions sometimes. Based on Schroeder's theory, approximate solutions for trajectories, velocities and potentials can also be constructed. The approximate solution is significantly useful to calculate the beta function in renormalization group trajectory. By "wrapping" the series solutions with the conjugations from different inverse functions, we generate different branches of the trajectory, and construct a counterexample for a folk theorem about limited cycles.

Developing Algebra Structure Module and Model of Cooperative Learning Helping Concept Map Media for Improving Proofing Ability

ERIC Educational Resources Information Center

Syafari

2017-01-01

This research was purposed to develop module and learning model and instrument of proofing ability in algebra structure through cooperative learning with helping map concept media for students of mathematic major and mathematics education in State University and Private University in North Sumatra province. The subject of this research was the…

Algebraic models of local period maps and Yukawa algebras

NASA Astrophysics Data System (ADS)

Bandiera, Ruggero; Manetti, Marco

2018-02-01

We describe some L_{∞} model for the local period map of a compact Kähler manifold. Applications include the study of deformations with associated variation of Hodge structure constrained by certain closed strata of the Grassmannian of the de Rham cohomology. As a by-product, we obtain an interpretation in the framework of deformation theory of the Yukawa coupling.

Enveloping algebra-valued gauge transformations for non-abelian gauge groups on non-commutative spaces

NASA Astrophysics Data System (ADS)

Jurco, B.; Schraml, S.; Schupp, P.; Wess, J.

2000-11-01

An enveloping algebra-valued gauge field is constructed, its components are functions of the Lie algebra-valued gauge field and can be constructed with the Seiberg-Witten map. This allows the formulation of a dynamics for a finite number of gauge field components on non-commutative spaces.

Integrating Map Algebra and Statistical Modeling for Spatio- Temporal Analysis of Monthly Mean Daily Incident Photosynthetically Active Radiation (PAR) over a Complex Terrain.

PubMed

Evrendilek, Fatih

2007-12-12

This study aims at quantifying spatio-temporal dynamics of monthly mean dailyincident photosynthetically active radiation (PAR) over a vast and complex terrain such asTurkey. The spatial interpolation method of universal kriging, and the combination ofmultiple linear regression (MLR) models and map algebra techniques were implemented togenerate surface maps of PAR with a grid resolution of 500 x 500 m as a function of fivegeographical and 14 climatic variables. Performance of the geostatistical and MLR modelswas compared using mean prediction error (MPE), root-mean-square prediction error(RMSPE), average standard prediction error (ASE), mean standardized prediction error(MSPE), root-mean-square standardized prediction error (RMSSPE), and adjustedcoefficient of determination (R² adj. ). The best-fit MLR- and universal kriging-generatedmodels of monthly mean daily PAR were validated against an independent 37-year observeddataset of 35 climate stations derived from 160 stations across Turkey by the Jackknifingmethod. The spatial variability patterns of monthly mean daily incident PAR were moreaccurately reflected in the surface maps created by the MLR-based models than in thosecreated by the universal kriging method, in particular, for spring (May) and autumn(November). The MLR-based spatial interpolation algorithms of PAR described in thisstudy indicated the significance of the multifactor approach to understanding and mappingspatio-temporal dynamics of PAR for a complex terrain over meso-scales.

Cuntz-Krieger algebras representations from orbits of interval maps

NASA Astrophysics Data System (ADS)

Correia Ramos, C.; Martins, Nuno; Pinto, Paulo R.; Sousa Ramos, J.

2008-05-01

Let f be an expansive Markov interval map with finite transition matrix Af. Then for every point, we yield an irreducible representation of the Cuntz-Krieger algebra and show that two such representations are unitarily equivalent if and only if the points belong to the same generalized orbit. The restriction of each representation to the gauge part of is decomposed into irreducible representations, according to the decomposition of the orbit.

Elliptic surface grid generation on minimal and parmetrized surfaces

NASA Technical Reports Server (NTRS)

Spekreijse, S. P.; Nijhuis, G. H.; Boerstoel, J. W.

1995-01-01

An elliptic grid generation method is presented which generates excellent boundary conforming grids in domains in 2D physical space. The method is based on the composition of an algebraic and elliptic transformation. The composite mapping obeys the familiar Poisson grid generation system with control functions specified by the algebraic transformation. New expressions are given for the control functions. Grid orthogonality at the boundary is achieved by modification of the algebraic transformation. It is shown that grid generation on a minimal surface in 3D physical space is in fact equivalent to grid generation in a domain in 2D physical space. A second elliptic grid generation method is presented which generates excellent boundary conforming grids on smooth surfaces. It is assumed that the surfaces are parametrized and that the grid only depends on the shape of the surface and is independent of the parametrization. Concerning surface modeling, it is shown that bicubic Hermite interpolation is an excellent method to generate a smooth surface which is passing through a given discrete set of control points. In contrast to bicubic spline interpolation, there is extra freedom to model the tangent and twist vectors such that spurious oscillations are prevented.

Making Sense of Abstract Algebra: Exploring Secondary Teachers' Understandings of Inverse Functions in Relation to Its Group Structure

ERIC Educational Resources Information Center

Wasserman, Nicholas H.

2017-01-01

This article draws on semi-structured, task-based interviews to explore secondary teachers' (N = 7) understandings of inverse functions in relation to abstract algebra. In particular, a concept map task is used to understand the degree to which participants, having recently taken an abstract algebra course, situated inverse functions within its…

A grid spacing control technique for algebraic grid generation methods

NASA Technical Reports Server (NTRS)

Smith, R. E.; Kudlinski, R. A.; Everton, E. L.

1982-01-01

A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

Lattice algebra approach to multispectral analysis of ancient documents.

PubMed

Valdiviezo-N, Juan C; Urcid, Gonzalo

2013-02-01

This paper introduces a lattice algebra procedure that can be used for the multispectral analysis of historical documents and artworks. Assuming the presence of linearly mixed spectral pixels captured in a multispectral scene, the proposed method computes the scaled min- and max-lattice associative memories to determine the purest pixels that best represent the spectra of single pigments. The estimation of fractional proportions of pure spectra at each image pixel is used to build pigment abundance maps that can be used for subsequent restoration of damaged parts. Application examples include multispectral images acquired from the Archimedes Palimpsest and a Mexican pre-Hispanic codex.

Pseudorandom number generation using chaotic true orbits of the Bernoulli map

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

Saito, Asaki, E-mail: saito@fun.ac.jp; Yamaguchi, Akihiro

We devise a pseudorandom number generator that exactly computes chaotic true orbits of the Bernoulli map on quadratic algebraic integers. Moreover, we describe a way to select the initial points (seeds) for generating multiple pseudorandom binary sequences. This selection method distributes the initial points almost uniformly (equidistantly) in the unit interval, and latter parts of the generated sequences are guaranteed not to coincide. We also demonstrate through statistical testing that the generated sequences possess good randomness properties.

Manifolds, Tensors, and Forms

NASA Astrophysics Data System (ADS)

Renteln, Paul

2013-11-01

Preface; 1. Linear algebra; 2. Multilinear algebra; 3. Differentiation on manifolds; 4. Homotopy and de Rham cohomology; 5. Elementary homology theory; 6. Integration on manifolds; 7. Vector bundles; 8. Geometric manifolds; 9. The degree of a smooth map; Appendixes; References; Index.

Lower richness of small wild mammal species and chagas disease risk.

PubMed

Xavier, Samanta Cristina das Chagas; Roque, André Luiz Rodrigues; Lima, Valdirene dos Santos; Monteiro, Kerla Joeline Lima; Otaviano, Joel Carlos Rodrigues; Ferreira da Silva, Luiz Felipe Coutinho; Jansen, Ana Maria

2012-01-01

A new epidemiological scenario involving the oral transmission of Chagas disease, mainly in the Amazon basin, requires innovative control measures. Geospatial analyses of the Trypanosoma cruzi transmission cycle in the wild mammals have been scarce. We applied interpolation and map algebra methods to evaluate mammalian fauna variables related to small wild mammals and the T. cruzi infection pattern in dogs to identify hotspot areas of transmission. We also evaluated the use of dogs as sentinels of epidemiological risk of Chagas disease. Dogs (n = 649) were examined by two parasitological and three distinct serological assays. kDNA amplification was performed in patent infections, although the infection was mainly sub-patent in dogs. The distribution of T. cruzi infection in dogs was not homogeneous, ranging from 11-89% in different localities. The interpolation method and map algebra were employed to test the associations between the lower richness in mammal species and the risk of exposure of dogs to T. cruzi infection. Geospatial analysis indicated that the reduction of the mammal fauna (richness and abundance) was associated with higher parasitemia in small wild mammals and higher exposure of dogs to infection. A Generalized Linear Model (GLM) demonstrated that species richness and positive hemocultures in wild mammals were associated with T. cruzi infection in dogs. Domestic canine infection rates differed significantly between areas with and without Chagas disease outbreaks (Chi-squared test). Geospatial analysis by interpolation and map algebra methods proved to be a powerful tool in the evaluation of areas of T. cruzi transmission. Dog infection was shown to not only be an efficient indicator of reduction of wild mammalian fauna richness but to also act as a signal for the presence of small wild mammals with high parasitemia. The lower richness of small mammal species is discussed as a risk factor for the re-emergence of Chagas disease.

Symmetries of the Space of Linear Symplectic Connections

NASA Astrophysics Data System (ADS)

Fox, Daniel J. F.

2017-01-01

There is constructed a family of Lie algebras that act in a Hamiltonian way on the symplectic affine space of linear symplectic connections on a symplectic manifold. The associated equivariant moment map is a formal sum of the Cahen-Gutt moment map, the Ricci tensor, and a translational term. The critical points of a functional constructed from it interpolate between the equations for preferred symplectic connections and the equations for critical symplectic connections. The commutative algebra of formal sums of symmetric tensors on a symplectic manifold carries a pair of compatible Poisson structures, one induced from the canonical Poisson bracket on the space of functions on the cotangent bundle polynomial in the fibers, and the other induced from the algebraic fiberwise Schouten bracket on the symmetric algebra of each fiber of the cotangent bundle. These structures are shown to be compatible, and the required Lie algebras are constructed as central extensions of their! linear combinations restricted to formal sums of symmetric tensors whose first order term is a multiple of the differential of its zeroth order term.

Infinite Index Subfactors and the GICAR Categories

NASA Astrophysics Data System (ADS)

Jones, Vaughan F. R.; Penneys, David

2015-10-01

Given a II1-subfactor of arbitrary index, we show that the rectangular GICAR category, also called the rectangular planar rook category, faithfully embeds as A - A bimodule maps among the bimodules . As a corollary, we get a lower bound on the dimension of the centralizer algebras for infinite index subfactors, and we also get that is nonabelian for , where is the Jones tower for . We also show that the annular GICAR/planar rook category acts as maps amongst the A-central vectors in , although this action may be degenerate. We prove these results in more generality using bimodules. The embedding of the GICAR category builds on work of Connes and Evans, who originally found GICAR algebras inside Temperley-Lieb algebras with finite modulus.

Map-invariant spectral analysis for the identification of DNA periodicities

PubMed Central

2012-01-01

Many signal processing based methods for finding hidden periodicities in DNA sequences have primarily focused on assigning numerical values to the symbolic DNA sequence and then applying spectral analysis tools such as the short-time discrete Fourier transform (ST-DFT) to locate these repeats. The key results pertaining to this approach are however obtained using a very specific symbolic to numerical map, namely the so-called Voss representation. An important research problem is to therefore quantify the sensitivity of these results to the choice of the symbolic to numerical map. In this article, a novel algebraic approach to the periodicity detection problem is presented and provides a natural framework for studying the role of the symbolic to numerical map in finding these repeats. More specifically, we derive a new matrix-based expression of the DNA spectrum that comprises most of the widely used mappings in the literature as special cases, shows that the DNA spectrum is in fact invariable under all these mappings, and generates a necessary and sufficient condition for the invariance of the DNA spectrum to the symbolic to numerical map. Furthermore, the new algebraic framework decomposes the periodicity detection problem into several fundamental building blocks that are totally independent of each other. Sophisticated digital filters and/or alternate fast data transforms such as the discrete cosine and sine transforms can therefore be always incorporated in the periodicity detection scheme regardless of the choice of the symbolic to numerical map. Although the newly proposed framework is matrix based, identification of these periodicities can be achieved at a low computational cost. PMID:23067324

The canonical quantization of chaotic maps on the torus

NASA Astrophysics Data System (ADS)

Rubin, Ron Shai

In this thesis, a quantization method for classical maps on the torus is presented. The quantum algebra of observables is defined as the quantization of measurable functions on the torus with generators exp (2/pi ix) and exp (2/pi ip). The Hilbert space we use remains the infinite-dimensional L2/ (/IR, dx). The dynamics is given by a unitary quantum propagator such that as /hbar /to 0, the classical dynamics is returned. We construct such a quantization for the Kronecker map, the cat map, the baker's map, the kick map, and the Harper map. For the cat map, we find the same for the propagator on the plane the same integral kernel conjectured in (HB) using semiclassical methods. We also define a quantum 'integral over phase space' as a trace over the quantum algebra. Using this definition, we proceed to define quantum ergodicity and mixing for maps on the torus. We prove that the quantum cat map and Kronecker map are both ergodic, but only the cat map is mixing, true to its classical origins. For Planck's constant satisfying the integrality condition h = 1/N, with N/in doubz+, we construct an explicit isomorphism between L2/ (/IR, dx) and the Hilbert space of sections of an N-dimensional vector bundle over a θ-torus T2 of boundary conditions. The basis functions are distributions in L2/ (/IR, dx), given by an infinite comb of Dirac δ-functions. In Bargmann space these distributions take on the form of Jacobi ϑ-functions. Transformations from position to momentum representation can be implemented via a finite N-dimensional discrete Fourier transform. With the θ-torus, we provide a connection between the finite-dimensional quantum maps given in the physics literature and the canonical quantization presented here and found in the language of pseudo-differential operators elsewhere in mathematics circles. Specifically, at a fixed point of the dynamics on the θ-torus, we return a finite-dimensional matrix propagator. We present this connection explicitly for several examples.

Lunar terrain mapping and relative-roughness analysis

USGS Publications Warehouse

Rowan, Lawrence C.; McCauley, John F.; Holm, Esther A.

1971-01-01

Terrain maps of the equatorial zone (long 70° E.-70° W. and lat 10° N-10° S.) were prepared at scales of 1:2,000,000 and 1:1,000,000 to classify lunar terrain with respect to roughness and to provide a basis for selecting sites for Surveyor and Apollo landings as well as for Ranger and Lunar Orbiter photographs. The techniques that were developed as a result of this effort can be applied to future planetary exploration. By using the best available earth-based observational data and photographs 1:1,000,000-scale and U.S. Geological Survey lunar geologic maps and U.S. Air Force Aeronautical Chart and Information Center LAC charts, lunar terrain was described by qualitative and quantitative methods and divided into four fundamental classes: maria, terrae, craters, and linear features. Some 35 subdivisions were defined and mapped throughout the equatorial zone, and, in addition, most of the map units were illustrated by photographs. The terrain types were analyzed quantitatively to characterize and order their relative-roughness characteristics. Approximately 150,000 east-west slope measurements made by a photometric technique (photoclinometry) in 51 sample areas indicate that algebraic slope-frequency distributions are Gaussian, and so arithmetic means and standard deviations accurately describe the distribution functions. The algebraic slope-component frequency distributions are particularly useful for rapidly determining relative roughness of terrain. The statistical parameters that best describe relative roughness are the absolute arithmetic mean, the algebraic standard deviation, and the percentage of slope reversal. Statistically derived relative-relief parameters are desirable supplementary measures of relative roughness in the terrae. Extrapolation of relative roughness for the maria was demonstrated using Ranger VII slope-component data and regional maria slope data, as well as the data reported here. It appears that, for some morphologically homogeneous mare areas, relative roughness can be extrapolated to the large scales from measurements at small scales.

Hyperelliptic Prym Varieties and Integrable Systems

NASA Astrophysics Data System (ADS)

Fernandes, Rui Loja; Vanhaecke, Pol

We introduce two algebraic completely integrable analogues of the Mumford systems which we call hyperelliptic Prym systems, because every hyperelliptic Prym variety appears as a fiber of their momentum map. As an application we show that the general fiber of the momentum map of the periodic Volterra lattice is an affine part of a hyperelliptic Prym variety, obtained by removing n translates of the theta divisor, and we conclude that this integrable system is algebraic completely integrable.

Quantum theory of the generalised uncertainty principle

NASA Astrophysics Data System (ADS)

Bruneton, Jean-Philippe; Larena, Julien

2017-04-01

We extend significantly previous works on the Hilbert space representations of the generalized uncertainty principle (GUP) in 3 + 1 dimensions of the form [X_i,P_j] = i F_{ij} where F_{ij} = f({{P}}^2) δ _{ij} + g({{P}}^2) P_i P_j for any functions f. However, we restrict our study to the case of commuting X's. We focus in particular on the symmetries of the theory, and the minimal length that emerge in some cases. We first show that, at the algebraic level, there exists an unambiguous mapping between the GUP with a deformed quantum algebra and a quadratic Hamiltonian into a standard, Heisenberg algebra of operators and an aquadratic Hamiltonian, provided the boost sector of the symmetries is modified accordingly. The theory can also be mapped to a completely standard Quantum Mechanics with standard symmetries, but with momentum dependent position operators. Next, we investigate the Hilbert space representations of these algebraically equivalent models, and focus specifically on whether they exhibit a minimal length. We carry the functional analysis of the various operators involved, and show that the appearance of a minimal length critically depends on the relationship between the generators of translations and the physical momenta. In particular, because this relationship is preserved by the algebraic mapping presented in this paper, when a minimal length is present in the standard GUP, it is also present in the corresponding Aquadratic Hamiltonian formulation, despite the perfectly standard algebra of this model. In general, a minimal length requires bounded generators of translations, i.e. a specific kind of quantization of space, and this depends on the precise shape of the function f defined previously. This result provides an elegant and unambiguous classification of which universal quantum gravity corrections lead to the emergence of a minimal length.

C*-algebras associated with reversible extensions of logistic maps

NASA Astrophysics Data System (ADS)

Kwaśniewski, Bartosz K.

2012-10-01

The construction of reversible extensions of dynamical systems presented in a previous paper by the author and A.V. Lebedev is enhanced, so that it applies to arbitrary mappings (not necessarily with open range). It is based on calculating the maximal ideal space of C*-algebras that extends endomorphisms to partial automorphisms via partial isometric representations, and involves a new set of 'parameters' (the role of parameters is played by chosen sets or ideals). As model examples, we give a thorough description of reversible extensions of logistic maps and a classification of systems associated with compression of unitaries generating homeomorphisms of the circle. Bibliography: 34 titles.

Category-theoretic models of algebraic computer systems

NASA Astrophysics Data System (ADS)

Kovalyov, S. P.

2016-01-01

A computer system is said to be algebraic if it contains nodes that implement unconventional computation paradigms based on universal algebra. A category-based approach to modeling such systems that provides a theoretical basis for mapping tasks to these systems' architecture is proposed. The construction of algebraic models of general-purpose computations involving conditional statements and overflow control is formally described by a reflector in an appropriate category of algebras. It is proved that this reflector takes the modulo ring whose operations are implemented in the conventional arithmetic processors to the Łukasiewicz logic matrix. Enrichments of the set of ring operations that form bases in the Łukasiewicz logic matrix are found.

Pre-Algebra Groups. Concepts & Applications.

ERIC Educational Resources Information Center

Montgomery County Public Schools, Rockville, MD.

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

Observations on the method of determining the velocity of airships

NASA Technical Reports Server (NTRS)

Volterra, Vito

1921-01-01

To obtain the absolute velocity of an airship by knowing the speed at which two routes are covered, we have only to determine the geographical direction of the routes which we locate from a map, and the angles of routes as given by the compass, after correcting for the variation (the algebraical sum of the local magnetic declination and the deviation).

Reconstructive correction of aberrations in nuclear particle spectrographs

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

Berz, M.; Joh, K.; Nolen, J.A.

A method is presented that allows the reconstruction of trajectories in particle spectrographs and the reconstructive correction of residual aberrations that otherwise limit the resolution. Using a computed or fitted high order transfer map that describes the uncorrected aberrations of the spectrograph, it is possible to calculate a map via an analytic recursion relation that allows the computation of the corrected data of interest such as reaction energy and scattering angle as well as the reconstructed trajectories in terms of position measurements in two planes near the focal plane. The technique is only limited by the accuracy of the positionmore » measurements, the incoherent spot sizes, and the accuracy of the transfer map. In practice the method can be expressed as an inversion of a nonlinear map and implemented in the differential algebraic framework. The method is applied to correct residual aberrations in the S800 spectrograph which is under construction at the National Superconducting Cyclotron Laboratory at Michigan State University and to two other high resolution spectrographs.« less

Assessing Formal Knowledge of Math Equivalence among Algebra and Pre-Algebra Students

ERIC Educational Resources Information Center

Fyfe, Emily R.; Matthews, Percival G.; Amsel, Eric; McEldoon, Katherine L.; McNeil, Nicole M.

2018-01-01

A central understanding in mathematics is knowledge of "math equivalence," the relation indicating that 2 quantities are equal and interchangeable. Decades of research have documented elementary-school (ages 7 to 11) children's (mis)understanding of math equivalence, and recent work has developed a construct map and comprehensive…

Digital Maps, Matrices and Computer Algebra

ERIC Educational Resources Information Center

Knight, D. G.

2005-01-01

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

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

NASA Astrophysics Data System (ADS)

Rosa, Luigi; Vitale, Patrizia

2012-11-01

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

Quantum Koszul formula on quantum spacetime

NASA Astrophysics Data System (ADS)

Majid, Shahn; Williams, Liam

2018-07-01

Noncommutative or quantum Riemannian geometry has been proposed as an effective theory for aspects of quantum gravity. Here the metric is an invertible bimodule map Ω1⊗AΩ1 → A where A is a possibly noncommutative or 'quantum' spacetime coordinate algebra and (Ω1 , d) is a specified bimodule of 1-forms or 'differential calculus' over it. In this paper we explore the proposal of a 'quantum Koszul formula' in Majid [12] with initial data a degree - 2 bilinear map ⊥ on the full exterior algebra Ω obeying the 4-term relations

Closed, analytic, boson realizations for Sp(4)

NASA Astrophysics Data System (ADS)

Klein, Abraham; Zhang, Qing-Ying

1986-08-01

The problem of determing a boson realization for an arbitrary irrep of the unitary simplectic algebra Sp(2d) [or of the corresponding discrete unitary irreps of the unbounded algebra Sp(2d,R)] has been solved completely in recent papers by Deenen and Quesne [J. Deenen and C. Quesne, J. Math. Phys. 23, 878, 2004 (1982); 25, 1638 (1984); 26, 2705 (1985)] and by Moshinsky and co-workers [O. Castaños, E. Chacón, M. Moshinsky, and C. Quesne, J. Math. Phys. 26, 2107 (1985); M. Moshinsky, ``Boson realization of symplectic algebras,'' to be published]. This solution is not known in closed analytic form except for d=1 and for special classes of irreps for d>1. A different method of obtaining a boson realization that solves the full problem for Sp(4) is described. The method utilizes the chain Sp(2d)⊇SU(2)×SU(2) ×ṡṡṡ×SU(2) (d times), which, for d≥4, does not provide a complete set of quantum numbers. Though a simple solution of the missing label problem can be given, this solution does not help in the construction of a mapping algorithm for general d.

Differential Geometry and Lie Groups for Physicists

NASA Astrophysics Data System (ADS)

Fecko, Marián.

2006-10-01

Introduction; 1. The concept of a manifold; 2. Vector and tensor fields; 3. Mappings of tensors induced by mappings of manifolds; 4. Lie derivative; 5. Exterior algebra; 6. Differential calculus of forms; 7. Integral calculus of forms; 8. Particular cases and applications of Stoke's Theorem; 9. Poincaré Lemma and cohomologies; 10. Lie Groups - basic facts; 11. Differential geometry of Lie Groups; 12. Representations of Lie Groups and Lie Algebras; 13. Actions of Lie Groups and Lie Algebras on manifolds; 14. Hamiltonian mechanics and symplectic manifolds; 15. Parallel transport and linear connection on M; 16. Field theory and the language of forms; 17. Differential geometry on TM and T*M; 18. Hamiltonian and Lagrangian equations; 19. Linear connection and the frame bundle; 20. Connection on a principal G-bundle; 21. Gauge theories and connections; 22. Spinor fields and Dirac operator; Appendices; Bibliography; Index.

Differential Geometry and Lie Groups for Physicists

NASA Astrophysics Data System (ADS)

Fecko, Marián.

2011-03-01

Introduction; 1. The concept of a manifold; 2. Vector and tensor fields; 3. Mappings of tensors induced by mappings of manifolds; 4. Lie derivative; 5. Exterior algebra; 6. Differential calculus of forms; 7. Integral calculus of forms; 8. Particular cases and applications of Stoke's Theorem; 9. Poincaré Lemma and cohomologies; 10. Lie Groups - basic facts; 11. Differential geometry of Lie Groups; 12. Representations of Lie Groups and Lie Algebras; 13. Actions of Lie Groups and Lie Algebras on manifolds; 14. Hamiltonian mechanics and symplectic manifolds; 15. Parallel transport and linear connection on M; 16. Field theory and the language of forms; 17. Differential geometry on TM and T*M; 18. Hamiltonian and Lagrangian equations; 19. Linear connection and the frame bundle; 20. Connection on a principal G-bundle; 21. Gauge theories and connections; 22. Spinor fields and Dirac operator; Appendices; Bibliography; Index.

Generalized Flip-Flop Input Equations Based on a Four-Valued Boolean Algebra

NASA Technical Reports Server (NTRS)

Tucker, Jerry H.; Tapia, Moiez A.

1996-01-01

A procedure is developed for obtaining generalized flip-flop input equations, and a concise method is presented for representing these equations. The procedure is based on solving a four-valued characteristic equation of the flip-flop, and can encompass flip-flops that are too complex to approach intuitively. The technique is presented using Karnaugh maps, but could easily be implemented in software.

On the homotopy equivalence of simple AI-algebras

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

Aristov, O Yu

1999-02-28

Let A and B be simple unital AI-algebras (an AI-algebra is an inductive limit of C*-algebras of the form BigOplus{sub i}{sup k}C([0,1],M{sub N{sub i}}). It is proved that two arbitrary unital homomorphisms from A into B such that the corresponding maps K{sub 0}A{yields}K{sub 0}B coincide are homotopic. Necessary and sufficient conditions on the Elliott invariant for A and B to be homotopy equivalent are indicated. Moreover, two algebras in the above class having the same K-theory but not homotopy equivalent are constructed. A theorem on the homotopy of approximately unitarily equivalent homomorphisms between AI-algebras is used in the proof, whichmore » is deduced in its turn from a generalization to the case of AI-algebras of a theorem of Manuilov stating that a unitary matrix almost commuting with a self-adjoint matrix h can be joined to 1 by a continuous path consisting of unitary matrices almost commuting with h.« less

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

ERIC Educational Resources Information Center

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

Nitrate contamination risk assessment in groundwater at regional scale

NASA Astrophysics Data System (ADS)

Daniela, Ducci

2016-04-01

Nitrate groundwater contamination is widespread in the world, due to the intensive use of fertilizers, to the leaking from the sewage network and to the presence of old septic systems. This research presents a methodology for groundwater contamination risk assessment using thematic maps derived mainly from the land-use map and from statistical data available at the national institutes of statistic (especially demographic and environmental data). The potential nitrate contamination is considered as deriving from three sources: agricultural, urban and periurban. The first one is related to the use of fertilizers. For this reason the land-use map is re-classified on the basis of the crop requirements in terms of fertilizers. The urban source is the possibility of leaks from the sewage network and, consequently, is linked to the anthropogenic pressure, expressed by the population density, weighted on the basis of the mapped urbanized areas of the municipality. The periurban sources include the un-sewered areas, especially present in the periurban context, where illegal sewage connections coexist with on-site sewage disposal (cesspools, septic tanks and pit latrines). The potential nitrate contamination map is produced by overlaying the agricultural, urban and periurban maps. The map combination process is very easy, being an algebraic combination: the output values are the arithmetic average of the input values. The groundwater vulnerability to contamination can be assessed using parametric methods, like DRASTIC or easier, like AVI (that involves a limited numbers of parameters). In most of cases, previous documents produced at regional level can be used. The pollution risk map is obtained by combining the thematic maps of the potential nitrate contamination map and the groundwater contamination vulnerability map. The criterion for the linkages of the different GIS layers is very easy, corresponding to an algebraic combination. The methodology has been successfully applied in a large flat area of southern Italy, with high concentrations in NO3.

Institution Morphisms

NASA Technical Reports Server (NTRS)

Goguen, Joseph; Rosu, Grigore; Norvig, Peter (Technical Monitor)

2001-01-01

Institutions formalize the intuitive notion of logical system, including both syntax and semantics. A surprising number of different notions of morphisim have been suggested for forming categories with institutions as objects, and a surprising variety of names have been proposed for them. One goal of this paper is to suggest a terminology that is both uniform and informative to replace the current rather chaotic nomenclature. Another goal is to investigate the properties and interrelations of these notions. Following brief expositions of indexed categories, twisted relations, and Kan extensions, we demonstrate and then exploit the duality between institution morphisms in the original sense of Goguen and Burstall, and the 'plain maps' of Meseguer, obtaining simple uniform proofs of completeness and cocompleteness for both resulting categories; because of this duality, we prefer the name 'comorphism' over 'plain map.' We next consider 'theoroidal' morphisms and comorphisims, which generalize signatures to theories, finding that the 'maps' of Meseguer are theoroidal comorphisms, while theoroidal morphisms are a new concept. We then introduce 'forward' and 'semi-natural' morphisms, and appendices discuss institutions for hidden algebra, universal algebra, partial equational logic, and a variant of order sorted algebra supporting partiality.

Spontaneous PT-Symmetry Breaking for Systems of Noncommutative Euclidean Lie Algebraic Type

NASA Astrophysics Data System (ADS)

Dey, Sanjib; Fring, Andreas; Mathanaranjan, Thilagarajah

2015-11-01

We propose a noncommutative version of the Euclidean Lie algebra E 2. Several types of non-Hermitian Hamiltonian systems expressed in terms of generic combinations of the generators of this algebra are investigated. Using the breakdown of the explicitly constructed Dyson maps as a criterium, we identify the domains in the parameter space in which the Hamiltonians have real energy spectra and determine the exceptional points signifying the crossover into the different types of spontaneously broken PT-symmetric regions with pairs of complex conjugate eigenvalues. We find exceptional points which remain invariant under the deformation as well as exceptional points becoming dependent on the deformation parameter of the algebra.

Examining the Conceptual Organization of Students in an Integrated Algebra and Physical Science Class.

ERIC Educational Resources Information Center

Westbrook, Susan L.

1998-01-01

Compares the conceptual organization of students in an integrated algebra and physical science class (SAM 9) with that of students in a discipline-specific physical science class (PSO). Analysis of students' concept maps indicates that the SAM9 students used a greater number of procedural linkages to connect mathematics and science concepts than…

Algebraic integrability: a survey.

PubMed

Vanhaecke, Pol

2008-03-28

We give a concise introduction to the notion of algebraic integrability. Our exposition is based on examples and phenomena, rather than on detailed proofs of abstract theorems. We mainly focus on algebraic integrability in the sense of Adler-van Moerbeke, where the fibres of the momentum map are affine parts of Abelian varieties; as it turns out, most examples from classical mechanics are of this form. Two criteria are given for such systems (Kowalevski-Painlevé and Lyapunov) and each is illustrated in one example. We show in the case of a relatively simple example how one proves algebraic integrability, starting from the differential equations for the integrable vector field. For Hamiltonian systems that are algebraically integrable in the generalized sense, two examples are given, which illustrate the non-compact analogues of Abelian varieties which typically appear in such systems.

Holomorphic curves in surfaces of general type.

PubMed Central

Lu, S S; Yau, S T

1990-01-01

This note answers some questions on holomorphic curves and their distribution in an algebraic surface of positive index. More specifically, we exploit the existence of natural negatively curved "pseudo-Finsler" metrics on a surface S of general type whose Chern numbers satisfy c(2)1>2c2 to show that a holomorphic map of a Riemann surface to S whose image is not in any rational or elliptic curve must satisfy a distance decreasing property with respect to these metrics. We show as a consequence that such a map extends over isolated punctures. So assuming that the Riemann surface is obtained from a compact one of genus q by removing a finite number of points, then the map is actually algebraic and defines a compact holomorphic curve in S. Furthermore, the degree of the curve with respect to a fixed polarization is shown to be bounded above by a multiple of q - 1 irrespective of the map. PMID:11607050

CSpace: an integrated workplace for the graphical and algebraic analysis of phase assemblages on 32-bit wintel platforms

NASA Astrophysics Data System (ADS)

Torres-Roldan, Rafael L.; Garcia-Casco, Antonio; Garcia-Sanchez, Pedro A.

2000-08-01

CSpace is a program for the graphical and algebraic analysis of composition relations within chemical systems. The program is particularly suited to the needs of petrologists, but could also prove useful for mineralogists, geochemists and other environmental scientists. A few examples of what can be accomplished with CSpace are the mapping of compositions into some desired set of system/phase components, the estimation of reaction/mixing coefficients and assessment of phase-rule compatibility relations within or between complex mineral assemblages. The program also allows dynamic inspection of compositional relations by means of barycentric plots. CSpace provides an integrated workplace for data management, manipulation and plotting. Data management is done through a built-in spreadsheet-like editor, which also acts as a data repository for the graphical and algebraic procedures. Algebraic capabilities are provided by a mapping engine and a matrix analysis tool, both of which are based on singular-value decomposition. The mapping engine uses a general approach to linear mapping, capable of handling determined, underdetermined and overdetermined problems. The matrix analysis tool is implemented as a task "wizard" that guides the user through a number of steps to perform matrix approximation (finding nearest rank-deficient models of an input composition matrix), and inspection of null-reaction space relationships (i.e. of implicit linear relations among the elements of the composition matrix). Graphical capabilities are provided by a graph engine that directly links with the contents of the data editor. The graph engine can generate sophisticated 2-D ternary (triangular) and 3D quaternary (tetrahedral) barycentric plots and includes features such as interactive re-sizing and rotation, on-the-fly coordinate scaling and support for automated drawing of tie lines.

Classical versus Computer Algebra Methods in Elementary Geometry

ERIC Educational Resources Information Center

Pech, Pavel

2005-01-01

Computer algebra methods based on results of commutative algebra like Groebner bases of ideals and elimination of variables make it possible to solve complex, elementary and non elementary problems of geometry, which are difficult to solve using a classical approach. Computer algebra methods permit the proof of geometric theorems, automatic…

Varieties of Orthocomplemented Lattices Induced by Łukasiewicz-Groupoid-Valued Mappings

NASA Astrophysics Data System (ADS)

Matoušek, Milan; Pták, Pavel

2017-12-01

In the logico-algebraic approach to the foundation of quantum mechanics we sometimes identify the set of events of the quantum experiment with an orthomodular lattice ("quantum logic"). The states are then usually associated with (normalized) finitely additive measures ("states"). The conditions imposed on states then define classes of orthomodular lattices that are sometimes found to be universal-algebraic varieties. In this paper we adopt a conceptually different approach, we relax orthomodular to orthocomplemented and we replace the states with certain subadditive mappings that range in the Łukasiewicz groupoid. We then show that when we require a type of "fulness" of these mappings, we obtain varieties of orthocomplemented lattices. Some of these varieties contain the projection lattice in a Hilbert space so there is a link to quantum logic theories. Besides, on the purely algebraic side, we present a characterization of orthomodular lattices among the orthocomplemented ones. - The intention of our approach is twofold. First, we recover some of the Mayet varieties in a principally different way (indeed, we also obtain many other new varieties). Second, by introducing an interplay of the lattice, measure-theoretic and fuzzy-set notions we intend to add to the concepts of quantum axiomatics.

The phase topology of a special case of Goryachev integrability in rigid body dynamics

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

Ryabov, P. E., E-mail: orelryabov@mail.ru

2014-07-31

The phase topology of a special case of Goryachev integrability in the problem of motion of a rigid body in a fluid is investigated using the method of Boolean functions, which was developed by Kharlamov for algebraically separated systems. The bifurcation diagram of the moment map is found and the Fomenko invariant, which classifies the systems up to rough Liouville equivalence, is specified. Bibliography: 15 titles. (paper)

Algebraic special functions and SO(3,2)

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

Celeghini, E., E-mail: celeghini@fi.infn.it; Olmo, M.A. del, E-mail: olmo@fta.uva.es

2013-06-15

A ladder structure of operators is presented for the associated Legendre polynomials and the sphericas harmonics. In both cases these operators belong to the irreducible representation of the Lie algebra so(3,2) with quadratic Casimir equals to −5/4. As both are also bases of square-integrable functions, the universal enveloping algebra of so(3,2) is thus shown to be homomorphic to the space of linear operators acting on the L{sup 2} functions defined on (−1,1)×Z and on the sphere S{sup 2}, respectively. The presence of a ladder structure is suggested to be the general condition to obtain a Lie algebra representation defining inmore » this way the “algebraic special functions” that are proposed to be the connection between Lie algebras and square-integrable functions so that the space of linear operators on the L{sup 2} functions is homomorphic to the universal enveloping algebra. The passage to the group, by means of the exponential map, shows that the associated Legendre polynomials and the spherical harmonics support the corresponding unitary irreducible representation of the group SO(3,2). -- Highlights: •The algebraic ladder structure is constructed for the associated Legendre polynomials (ALP). •ALP and spherical harmonics support a unitary irreducible SO(3,2)-representation. •A ladder structure is the condition to get a Lie group representation defining “algebraic special functions”. •The “algebraic special functions” connect Lie algebras and L{sup 2} functions.« less

Mapping chemicals in air using an environmental CAT scanning system: evaluation of algorithms

NASA Astrophysics Data System (ADS)

Samanta, A.; Todd, L. A.

A new technique is being developed which creates near real-time maps of chemical concentrations in air for environmental and occupational environmental applications. This technique, we call Environmental CAT Scanning, combines the real-time measuring technique of open-path Fourier transform infrared spectroscopy with the mapping capabilitites of computed tomography to produce two-dimensional concentration maps. With this system, a network of open-path measurements is obtained over an area; measurements are then processed using a tomographic algorithm to reconstruct the concentrations. This research focussed on the process of evaluating and selecting appropriate reconstruction algorithms, for use in the field, by using test concentration data from both computer simultation and laboratory chamber studies. Four algorithms were tested using three types of data: (1) experimental open-path data from studies that used a prototype opne-path Fourier transform/computed tomography system in an exposure chamber; (2) synthetic open-path data generated from maps created by kriging point samples taken in the chamber studies (in 1), and; (3) synthetic open-path data generated using a chemical dispersion model to create time seires maps. The iterative algorithms used to reconstruct the concentration data were: Algebraic Reconstruction Technique without Weights (ART1), Algebraic Reconstruction Technique with Weights (ARTW), Maximum Likelihood with Expectation Maximization (MLEM) and Multiplicative Algebraic Reconstruction Technique (MART). Maps were evaluated quantitatively and qualitatively. In general, MART and MLEM performed best, followed by ARTW and ART1. However, algorithm performance varied under different contaminant scenarios. This study showed the importance of using a variety of maps, particulary those generated using dispersion models. The time series maps provided a more rigorous test of the algorithms and allowed distinctions to be made among the algorithms. A comprehensive evaluation of algorithms, for the environmental application of tomography, requires the use of a battery of test concentration data before field implementation, which models reality and tests the limits of the algorithms.

Optimization techniques for integrating spatial data

USGS Publications Warehouse

Herzfeld, U.C.; Merriam, D.F.

1995-01-01

Two optimization techniques ta predict a spatial variable from any number of related spatial variables are presented. The applicability of the two different methods for petroleum-resource assessment is tested in a mature oil province of the Midcontinent (USA). The information on petroleum productivity, usually not directly accessible, is related indirectly to geological, geophysical, petrographical, and other observable data. This paper presents two approaches based on construction of a multivariate spatial model from the available data to determine a relationship for prediction. In the first approach, the variables are combined into a spatial model by an algebraic map-comparison/integration technique. Optimal weights for the map comparison function are determined by the Nelder-Mead downhill simplex algorithm in multidimensions. Geologic knowledge is necessary to provide a first guess of weights to start the automatization, because the solution is not unique. In the second approach, active set optimization for linear prediction of the target under positivity constraints is applied. Here, the procedure seems to select one variable from each data type (structure, isopachous, and petrophysical) eliminating data redundancy. Automating the determination of optimum combinations of different variables by applying optimization techniques is a valuable extension of the algebraic map-comparison/integration approach to analyzing spatial data. Because of the capability of handling multivariate data sets and partial retention of geographical information, the approaches can be useful in mineral-resource exploration. ?? 1995 International Association for Mathematical Geology.

The Feigin Tetrahedron

NASA Astrophysics Data System (ADS)

Rupel, Dylan

2015-03-01

The first goal of this note is to extend the well-known Feigin homomorphisms taking quantum groups to quantum polynomial algebras. More precisely, we define generalized Feigin homomorphisms from a quantum shuffle algebra to quantum polynomial algebras which extend the classical Feigin homomorphisms along the embedding of the quantum group into said quantum shuffle algebra. In a recent work of Berenstein and the author, analogous extensions of Feigin homomorphisms from the dual Hall-Ringel algebra of a valued quiver to quantum polynomial algebras were defined. To relate these constructions, we establish a homomorphism, dubbed the quantum shuffle character, from the dual Hall-Ringel algebra to the quantum shuffle algebra which relates the generalized Feigin homomorphisms. These constructions can be compactly described by a commuting tetrahedron of maps beginning with the quantum group and terminating in a quantum polynomial algebra. The second goal in this project is to better understand the dual canonical basis conjecture for skew-symmetrizable quantum cluster algebras. In the symmetrizable types it is known that dual canonical basis elements need not have positive multiplicative structure constants, while this is still suspected to hold for skew-symmetrizable quantum cluster algebras. We propose an alternate conjecture for the symmetrizable types: the cluster monomials should correspond to irreducible characters of a KLR algebra. Indeed, the main conjecture of this note would establish this ''KLR conjecture'' for acyclic skew-symmetrizable quantum cluster algebras: that is, we conjecture that the images of rigid representations under the quantum shuffle character give irreducible characters for KLR algebras. We sketch a proof in the symmetric case giving an alternative to the proof of Kimura-Qin that all non-initial cluster variables in an acyclic skew-symmetric quantum cluster algebra are contained in the dual canonical basis. With these results in mind we interpret the cluster mutations directly in terms of the representation theory of the KLR algebra.

Quantization and Superselection Sectors I:. Transformation Group C*-ALGEBRAS

NASA Astrophysics Data System (ADS)

Landsman, N. P.

Quantization is defined as the act of assigning an appropriate C*-algebra { A} to a given configuration space Q, along with a prescription mapping self-adjoint elements of { A} into physically interpretable observables. This procedure is adopted to solve the problem of quantizing a particle moving on a homogeneous locally compact configuration space Q=G/H. Here { A} is chosen to be the transformation group C*-algebra corresponding to the canonical action of G on Q. The structure of these algebras and their representations are examined in some detail. Inequivalent quantizations are identified with inequivalent irreducible representations of the C*-algebra corresponding to the system, hence with its superselection sectors. Introducing the concept of a pre-Hamiltonian, we construct a large class of G-invariant time-evolutions on these algebras, and find the Hamiltonians implementing these time-evolutions in each irreducible representation of { A}. “Topological” terms in the Hamiltonian (or the corresponding action) turn out to be representation-dependent, and are automatically induced by the quantization procedure. Known “topological” charge quantization or periodicity conditions are then identically satisfied as a consequence of the representation theory of { A}.

Optimization and analysis of large chemical kinetic mechanisms using the solution mapping method - Combustion of methane

NASA Technical Reports Server (NTRS)

Frenklach, Michael; Wang, Hai; Rabinowitz, Martin J.

1992-01-01

A method of systematic optimization, solution mapping, as applied to a large-scale dynamic model is presented. The basis of the technique is parameterization of model responses in terms of model parameters by simple algebraic expressions. These expressions are obtained by computer experiments arranged in a factorial design. The developed parameterized responses are then used in a joint multiparameter multidata-set optimization. A brief review of the mathematical background of the technique is given. The concept of active parameters is discussed. The technique is applied to determine an optimum set of parameters for a methane combustion mechanism. Five independent responses - comprising ignition delay times, pre-ignition methyl radical concentration profiles, and laminar premixed flame velocities - were optimized with respect to thirteen reaction rate parameters. The numerical predictions of the optimized model are compared to those computed with several recent literature mechanisms. The utility of the solution mapping technique in situations where the optimum is not unique is also demonstrated.

Grade 11 Students' Interconnected Use of Conceptual Knowledge, Procedural Skills, and Strategic Competence in Algebra: A Mixed Method Study of Error Analysis

ERIC Educational Resources Information Center

Egodawatte, Gunawardena; Stoilescu, Dorian

2015-01-01

The purpose of this mixed-method study was to investigate grade 11 university/college stream mathematics students' difficulties in applying conceptual knowledge, procedural skills, strategic competence, and algebraic thinking in solving routine (instructional) algebraic problems. A standardized algebra test was administered to thirty randomly…

A systematic investigation of the link between rational number processing and algebra ability.

PubMed

Hurst, Michelle; Cordes, Sara

2018-02-01

Recent research suggests that fraction understanding is predictive of algebra ability; however, the relative contributions of various aspects of rational number knowledge are unclear. Furthermore, whether this relationship is notation-dependent or rather relies upon a general understanding of rational numbers (independent of notation) is an open question. In this study, college students completed a rational number magnitude task, procedural arithmetic tasks in fraction and decimal notation, and an algebra assessment. Using these tasks, we measured three different aspects of rational number ability in both fraction and decimal notation: (1) acuity of underlying magnitude representations, (2) fluency with which symbols are mapped to the underlying magnitudes, and (3) fluency with arithmetic procedures. Analyses reveal that when looking at the measures of magnitude understanding, the relationship between adults' rational number magnitude performance and algebra ability is dependent upon notation. However, once performance on arithmetic measures is included in the relationship, individual measures of magnitude understanding are no longer unique predictors of algebra performance. Furthermore, when including all measures simultaneously, results revealed that arithmetic fluency in both fraction and decimal notation each uniquely predicted algebra ability. Findings are the first to demonstrate a relationship between rational number understanding and algebra ability in adults while providing a clearer picture of the nature of this relationship. © 2017 The British Psychological Society.

Algebraic Algorithm Design and Local Search

DTIC Science & Technology

1996-12-01

method for performing algorithm design that is more purely algebraic than that of KIDS. This method is then applied to local search. Local search is a...synthesis. Our approach was to follow KIDS in spirit, but to adopt a pure algebraic formalism, supported by Kestrel’s SPECWARE environment (79), that...design was developed that is more purely algebraic than that of KIDS. This method was then applied to local search. A general theory of local search was

Algebraic grid generation using tensor product B-splines. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Saunders, B. V.

1985-01-01

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

q-Derivatives, quantization methods and q-algebras

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

Twarock, Reidun

1998-12-15

Using the example of Borel quantization on S{sup 1}, we discuss the relation between quantization methods and q-algebras. In particular, it is shown that a q-deformation of the Witt algebra with generators labeled by Z is realized by q-difference operators. This leads to a discrete quantum mechanics. Because of Z, the discretization is equidistant. As an approach to a non-equidistant discretization of quantum mechanics one can change the Witt algebra using not the number field Z as labels but a quadratic extension of Z characterized by an irrational number {tau}. This extension is denoted as quasi-crystal Lie algebra, because thismore » is a relation to one-dimensional quasicrystals. The q-deformation of this quasicrystal Lie algebra is discussed. It is pointed out that quasicrystal Lie algebras can be considered also as a 'deformed' Witt algebra with a 'deformation' of the labeling number field. Their application to the theory is discussed.« less

Gender differences in algebraic thinking ability to solve mathematics problems

NASA Astrophysics Data System (ADS)

Kusumaningsih, W.; Darhim; Herman, T.; Turmudi

2018-05-01

This study aimed to conduct a gender study on students' algebraic thinking ability in solving a mathematics problem, polyhedron concept, for grade VIII. This research used a qualitative method. The data was collected using: test and interview methods. The subjects in this study were eight male and female students with different level of abilities. It was found that the algebraic thinking skills of male students reached high group of five categories. They were superior in terms of reasoning and quick understanding in solving problems. Algebraic thinking ability of high-achieving group of female students also met five categories of algebraic thinking indicators. They were more diligent, tenacious and thorough in solving problems. Algebraic thinking ability of male students in medium category only satisfied three categories of algebraic thinking indicators. They were sufficient in terms of reasoning and understanding in solving problems. Algebraic thinking ability group of female students in medium group also satisfied three categories of algebraic thinking indicators. They were fairly diligent, tenacious and meticulous on working on the problems.

Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

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

Zheng, Jinbin, E-mail: jbzheng518@163.com

2014-10-06

In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.

Towards the map of quantum gravity

NASA Astrophysics Data System (ADS)

Mielczarek, Jakub; Trześniewski, Tomasz

2018-06-01

In this paper we point out some possible links between different approaches to quantum gravity and theories of the Planck scale physics. In particular, connections between loop quantum gravity, causal dynamical triangulations, Hořava-Lifshitz gravity, asymptotic safety scenario, Quantum Graphity, deformations of relativistic symmetries and nonlinear phase space models are discussed. The main focus is on quantum deformations of the Hypersurface Deformations Algebra and Poincaré algebra, nonlinear structure of phase space, the running dimension of spacetime and nontrivial phase diagram of quantum gravity. We present an attempt to arrange the observed relations in the form of a graph, highlighting different aspects of quantum gravity. The analysis is performed in the spirit of a mind map, which represents the architectural approach to the studied theory, being a natural way to describe the properties of a complex system. We hope that the constructed graphs (maps) will turn out to be helpful in uncovering the global picture of quantum gravity as a particular complex system and serve as a useful guide for the researchers.

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

NASA Astrophysics Data System (ADS)

Dias, David P.

2008-08-01

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

Generalizing the bms3 and 2D-conformal algebras by expanding the Virasoro algebra

NASA Astrophysics Data System (ADS)

Caroca, Ricardo; Concha, Patrick; Rodríguez, Evelyn; Salgado-Rebolledo, Patricio

2018-03-01

By means of the Lie algebra expansion method, the centrally extended conformal algebra in two dimensions and the bms3 algebra are obtained from the Virasoro algebra. We extend this result to construct new families of expanded Virasoro algebras that turn out to be infinite-dimensional lifts of the so-called Bk, Ck and Dk algebras recently introduced in the literature in the context of (super)gravity. We also show how some of these new infinite-dimensional symmetries can be obtained from expanded Kač-Moody algebras using modified Sugawara constructions. Applications in the context of three-dimensional gravity are briefly discussed.

Comparison of methods for developing the dynamics of rigid-body systems

NASA Technical Reports Server (NTRS)

Ju, M. S.; Mansour, J. M.

1989-01-01

Several approaches for developing the equations of motion for a three-degree-of-freedom PUMA robot were compared on the basis of computational efficiency (i.e., the number of additions, subtractions, multiplications, and divisions). Of particular interest was the investigation of the use of computer algebra as a tool for developing the equations of motion. Three approaches were implemented algebraically: Lagrange's method, Kane's method, and Wittenburg's method. Each formulation was developed in absolute and relative coordinates. These six cases were compared to each other and to a recursive numerical formulation. The results showed that all of the formulations implemented algebraically required fewer calculations than the recursive numerical algorithm. The algebraic formulations required fewer calculations in absolute coordinates than in relative coordinates. Each of the algebraic formulations could be simplified, using patterns from Kane's method, to yield the same number of calculations in a given coordinate system.

A nonclassical Radau collocation method for solving the Lane-Emden equations of the polytropic index 4.75 ≤ α < 5

NASA Astrophysics Data System (ADS)

Tirani, M. D.; Maleki, M.; Kajani, M. T.

2014-11-01

A numerical method for solving the Lane-Emden equations of the polytropic index α when 4.75 ≤ α ≤ 5 is introduced. The method is based upon nonclassical Gauss-Radau collocation points and Freud type weights. Nonclassical orthogonal polynomials, nonclassical Radau points and weighted interpolation are introduced and are utilized in the interval [0,1]. A smooth, strictly monotonic transformation is used to map the infinite domain x ∈ [0,∞) onto a half-open interval t ∈ [0,1). The resulting problem on the finite interval is then transcribed to a system of nonlinear algebraic equations using collocation. The method is easy to implement and yields very accurate results.

Experimental realization of a highly secure chaos communication under strong channel noise

NASA Astrophysics Data System (ADS)

Ye, Weiping; Dai, Qionglin; Wang, Shihong; Lu, Huaping; Kuang, Jinyu; Zhao, Zhenfeng; Zhu, Xiangqing; Tang, Guoning; Huang, Ronghuai; Hu, Gang

2004-09-01

A one-way coupled spatiotemporally chaotic map lattice is used to construct cryptosystem. With the combinatorial applications of both chaotic computations and conventional algebraic operations, our system has optimal cryptographic properties much better than the separative applications of known chaotic and conventional methods. We have realized experiments to practice duplex voice secure communications in realistic Wired Public Switched Telephone Network by applying our chaotic system and the system of Advanced Encryption Standard (AES), respectively, for cryptography. Our system can work stably against strong channel noise when AES fails to work.

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

NASA Astrophysics Data System (ADS)

Seo, Jae Hong

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

Tensor models, Kronecker coefficients and permutation centralizer algebras

NASA Astrophysics Data System (ADS)

Geloun, Joseph Ben; Ramgoolam, Sanjaye

2017-11-01

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

Serre duality, Abel's theorem, and Jacobi inversion for supercurves over a thick superpoint

NASA Astrophysics Data System (ADS)

Rothstein, Mitchell J.; Rabin, Jeffrey M.

2015-04-01

The principal aim of this paper is to extend Abel's theorem to the setting of complex supermanifolds of dimension 1 | q over a finite-dimensional local supercommutative C-algebra. The theorem is proved by establishing a compatibility of Serre duality for the supercurve with Poincaré duality on the reduced curve. We include an elementary algebraic proof of the requisite form of Serre duality, closely based on the account of the reduced case given by Serre in Algebraic groups and class fields, combined with an invariance result for the topology on the dual of the space of répartitions. Our Abel map, taking Cartier divisors of degree zero to the dual of the space of sections of the Berezinian sheaf, modulo periods, is defined via Penkov's characterization of the Berezinian sheaf as the cohomology of the de Rham complex of the sheaf D of differential operators. We discuss the Jacobi inversion problem for the Abel map and give an example demonstrating that if n is an integer sufficiently large that the generic divisor of degree n is linearly equivalent to an effective divisor, this need not be the case for all divisors of degree n.

Algebraic dynamic multilevel method for compositional flow in heterogeneous porous media

NASA Astrophysics Data System (ADS)

Cusini, Matteo; Fryer, Barnaby; van Kruijsdijk, Cor; Hajibeygi, Hadi

2018-02-01

This paper presents the algebraic dynamic multilevel method (ADM) for compositional flow in three dimensional heterogeneous porous media in presence of capillary and gravitational effects. As a significant advancement compared to the ADM for immiscible flows (Cusini et al., 2016) [33], here, mass conservation equations are solved along with k-value based thermodynamic equilibrium equations using a fully-implicit (FIM) coupling strategy. Two different fine-scale compositional formulations are considered: (1) the natural variables and (2) the overall-compositions formulation. At each Newton's iteration the fine-scale FIM Jacobian system is mapped to a dynamically defined (in space and time) multilevel nested grid. The appropriate grid resolution is chosen based on the contrast of user-defined fluid properties and on the presence of specific features (e.g., well source terms). Consistent mapping between different resolutions is performed by the means of sequences of restriction and prolongation operators. While finite-volume restriction operators are employed to ensure mass conservation at all resolutions, various prolongation operators are considered. In particular, different interpolation strategies can be used for the different primary variables, and multiscale basis functions are chosen as pressure interpolators so that fine scale heterogeneities are accurately accounted for across different resolutions. Several numerical experiments are conducted to analyse the accuracy, efficiency and robustness of the method for both 2D and 3D domains. Results show that ADM provides accurate solutions by employing only a fraction of the number of grid-cells employed in fine-scale simulations. As such, it presents a promising approach for large-scale simulations of multiphase flow in heterogeneous reservoirs with complex non-linear fluid physics.

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

NASA Astrophysics Data System (ADS)

Yagi, Masakazu; Hisakado, Takashi; Okumura, Kohshi

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

Lumped Model Generation and Evaluation: Sensitivity and Lie Algebraic Techniques with Applications to Combustion

DTIC Science & Technology

1989-03-03

address global parameter space mapping issues for first order differential equations. The rigorous criteria for the existence of exact lumping by linear projective transformations was also established.

The classical dynamic symmetry for the U(1) -Kepler problems

NASA Astrophysics Data System (ADS)

Bouarroudj, Sofiane; Meng, Guowu

2018-01-01

For the Jordan algebra of hermitian matrices of order n ≥ 2, we let X be its submanifold consisting of rank-one semi-positive definite elements. The composition of the cotangent bundle map πX: T∗ X → X with the canonical map X → CP n - 1 (i.e., the map that sends a given hermitian matrix to its column space), pulls back the Kähler form of the Fubini-Study metric on CP n - 1 to a real closed differential two-form ωK on T∗ X. Let ωX be the canonical symplectic form on T∗ X and μ a real number. A standard fact says that ωμ ≔ωX + 2 μωK turns T∗ X into a symplectic manifold, hence a Poisson manifold with Poisson bracket {,}μ. In this article we exhibit a Poisson realization of the simple real Lie algebra su(n , n) on the Poisson manifold (T∗ X ,{,}μ) , i.e., a Lie algebra homomorphism from su(n , n) to (C∞(T∗ X , R) ,{,}μ). Consequently one obtains the Laplace-Runge-Lenz vector for the classical U(1) -Kepler problem of level n and magnetic charge μ. Since the McIntosh-Cisneros-Zwanziger-Kepler problems (MICZ-Kepler Problems) are the U(1) -Kepler problems of level 2, the work presented here is a direct generalization of the work by A. Barut and G. Bornzin (1971) on the classical dynamic symmetry for the MICZ-Kepler problems.

A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets

DTIC Science & Technology

2014-11-01

linear hybrid systems by linear algebraic methods. In SAS, volume 6337 of LNCS, pages 373–389. Springer, 2010. [19] E. W. Mayr. Membership in polynomial...383–394, 2009. [31] A. Tarski. A decision method for elementary algebra and geometry. Bull. Amer. Math. Soc., 59, 1951. [32] A. Tiwari. Abstractions...A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets Khalil Ghorbal1 Andrew Sogokon2 André Platzer1 November 2014 CMU

A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry

ERIC Educational Resources Information Center

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

2012-01-01

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

SD-CAS: Spin Dynamics by Computer Algebra System.

PubMed

Filip, Xenia; Filip, Claudiu

2010-11-01

A computer algebra tool for describing the Liouville-space quantum evolution of nuclear 1/2-spins is introduced and implemented within a computational framework named Spin Dynamics by Computer Algebra System (SD-CAS). A distinctive feature compared with numerical and previous computer algebra approaches to solving spin dynamics problems results from the fact that no matrix representation for spin operators is used in SD-CAS, which determines a full symbolic character to the performed computations. Spin correlations are stored in SD-CAS as four-entry nested lists of which size increases linearly with the number of spins into the system and are easily mapped into analytical expressions in terms of spin operator products. For the so defined SD-CAS spin correlations a set of specialized functions and procedures is introduced that are essential for implementing basic spin algebra operations, such as the spin operator products, commutators, and scalar products. They provide results in an abstract algebraic form: specific procedures to quantitatively evaluate such symbolic expressions with respect to the involved spin interaction parameters and experimental conditions are also discussed. Although the main focus in the present work is on laying the foundation for spin dynamics symbolic computation in NMR based on a non-matrix formalism, practical aspects are also considered throughout the theoretical development process. In particular, specific SD-CAS routines have been implemented using the YACAS computer algebra package (http://yacas.sourceforge.net), and their functionality was demonstrated on a few illustrative examples. Copyright © 2010 Elsevier Inc. All rights reserved.

Representations of spacetime diffeomorphisms. I. Canonical parametrized field theories

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

Isham, C.J.; Kuchar, K.V.

The super-Hamiltonian and supermomentum in canonical geometrodynamics or in a parametried field theory on a given Riemannian background have Poisson brackets which obey the Dirac relations. By smearing the supermomentum with vector fields VepsilonL Diff..sigma.. on the space manifold ..sigma.., the Lie algebra L Diff ..sigma.. of the spatial diffeomorphism group Diff ..sigma.. can be mapped antihomomorphically into the Poisson bracket algebra on the phase space of the system. The explicit dependence of the Poisson brackets between two super-Hamiltonians on canonical coordinates (spatial metrics in geometrodynamics and embedding variables in parametrized theories) is usually regarded as an indication that themore » Dirac relations cannot be connected with a representation of the complete Lie algebra L Diff M of spacetime diffeomorphisms.« less

Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

DOE PAGES

Bank, R.; Falgout, R. D.; Jones, T.; ...

2015-10-29

In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods inmore » Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.« less

Computational approach to compact Riemann surfaces

NASA Astrophysics Data System (ADS)

Frauendiener, Jörg; Klein, Christian

2017-01-01

A purely numerical approach to compact Riemann surfaces starting from plane algebraic curves is presented. The critical points of the algebraic curve are computed via a two-dimensional Newton iteration. The starting values for this iteration are obtained from the resultants with respect to both coordinates of the algebraic curve and a suitable pairing of their zeros. A set of generators of the fundamental group for the complement of these critical points in the complex plane is constructed from circles around these points and connecting lines obtained from a minimal spanning tree. The monodromies are computed by solving the defining equation of the algebraic curve on collocation points along these contours and by analytically continuing the roots. The collocation points are chosen to correspond to Chebychev collocation points for an ensuing Clenshaw-Curtis integration of the holomorphic differentials which gives the periods of the Riemann surface with spectral accuracy. At the singularities of the algebraic curve, Puiseux expansions computed by contour integration on the circles around the singularities are used to identify the holomorphic differentials. The Abel map is also computed with the Clenshaw-Curtis algorithm and contour integrals. As an application of the code, solutions to the Kadomtsev-Petviashvili equation are computed on non-hyperelliptic Riemann surfaces.

Finite element method framework for RF-based through-the-wall mapping

NASA Astrophysics Data System (ADS)

Campos, Rafael Saraiva; Lovisolo, Lisandro; de Campos, Marcello Luiz R.

2017-05-01

Radiofrequency (RF) Through-the-Wall Mapping (TWM) employs techniques originally applied in X-Ray Computerized Tomographic Imaging to map obstacles behind walls. It aims to provide valuable information for rescuing efforts in damaged buildings, as well as for military operations in urban scenarios. This work defines a Finite Element Method (FEM) based framework to allow fast and accurate simulations of the reconstruction of floors blueprints, using Ultra High-Frequency (UHF) signals at three different frequencies (500 MHz, 1 GHz and 2 GHz). To the best of our knowledge, this is the first use of FEM in a TWM scenario. This framework allows quick evaluation of different algorithms without the need to assemble a full test setup, which might not be available due to budgetary and time constraints. Using this, the present work evaluates a collection of reconstruction methods (Filtered Backprojection Reconstruction, Direct Fourier Reconstruction, Algebraic Reconstruction and Simultaneous Iterative Reconstruction) under a parallel-beam acquisition geometry for different spatial sampling rates, number of projections, antenna gains and operational frequencies. The use of multiple frequencies assesses the trade-off between higher resolution at shorter wavelengths and lower through-the-wall penetration. Considering all the drawbacks associated with such a complex problem, a robust and reliable computational setup based on a flexible method such as FEM can be very useful.

Diffeomorphic Anatomical Registration Through Exponentiated Lie Algebra provides reduced effect of scanner for cortex volumetry with atlas-based method in healthy subjects.

PubMed

Goto, Masami; Abe, Osamu; Aoki, Shigeki; Hayashi, Naoto; Miyati, Tosiaki; Takao, Hidemasa; Iwatsubo, Takeshi; Yamashita, Fumio; Matsuda, Hiroshi; Mori, Harushi; Kunimatsu, Akira; Ino, Kenji; Yano, Keiichi; Ohtomo, Kuni

2013-07-01

This study aimed to investigate whether the effect of scanner for cortex volumetry with atlas-based method is reduced using Diffeomorphic Anatomical Registration Through Exponentiated Lie Algebra (DARTEL) normalization compared with standard normalization. Three-dimensional T1-weighted magnetic resonance images (3D-T1WIs) of 21 healthy subjects were obtained and evaluated for effect of scanner in cortex volumetry. 3D-T1WIs of the 21 subjects were obtained with five MRI systems. Imaging of each subject was performed on each of five different MRI scanners. We used the Voxel-Based Morphometry 8 tool implemented in Statistical Parametric Mapping 8 and WFU PickAtlas software (Talairach brain atlas theory). The following software default settings were used as bilateral region-of-interest labels: "Frontal Lobe," "Hippocampus," "Occipital Lobe," "Orbital Gyrus," "Parietal Lobe," "Putamen," and "Temporal Lobe." Effect of scanner for cortex volumetry using the atlas-based method was reduced with DARTEL normalization compared with standard normalization in Frontal Lobe, Occipital Lobe, Orbital Gyrus, Putamen, and Temporal Lobe; was the same in Hippocampus and Parietal Lobe; and showed no increase with DARTEL normalization for any region of interest (ROI). DARTEL normalization reduces the effect of scanner, which is a major problem in multicenter studies.

Numerical algebraic geometry: a new perspective on gauge and string theories

NASA Astrophysics Data System (ADS)

Mehta, Dhagash; He, Yang-Hui; Hauensteine, Jonathan D.

2012-07-01

There is a rich interplay between algebraic geometry and string and gauge theories which has been recently aided immensely by advances in computational algebra. However, symbolic (Gröbner) methods are severely limited by algorithmic issues such as exponential space complexity and being highly sequential. In this paper, we introduce a novel paradigm of numerical algebraic geometry which in a plethora of situations overcomes these shortcomings. The so-called `embarrassing parallelizability' allows us to solve many problems and extract physical information which elude symbolic methods. We describe the method and then use it to solve various problems arising from physics which could not be otherwise solved.

Students’ Algebraic Reasonsing In Solving Mathematical Problems With Adversity Quotient

NASA Astrophysics Data System (ADS)

Aryani, F.; Amin, S. M.; Sulaiman, R.

2018-01-01

Algebraic reasoning is a process in which students generalize mathematical ideas from a set of particular instances and express them in increasingly formal and age-appropriate ways. Using problem solving approach to develop algebraic reasoning of mathematics may enhace the long-term learning trajectory of the majority students. The purpose of this research was to describe the algebraic reasoning of quitter, camper, and climber junior high school students in solving mathematical problems. This research used qualitative descriptive method. Subjects were determined by purposive sampling. The technique of collecting data was done by task-based interviews.The results showed that the algebraic reasoning of three students in the process of pattern seeking by identifying the things that are known and asked in a similar way. But three students found the elements of pattern recognition in different ways or method. So, they are generalize the problem of pattern formation with different ways. The study of algebraic reasoning and problem solving can be a learning paradigm in the improve students’ knowledge and skills in algebra work. The goal is to help students’ improve academic competence, develop algebraic reasoning in problem solving.

Chern-Simons expectation values and quantum horizons from loop quantum gravity and the Duflo map.

PubMed

Sahlmann, Hanno; Thiemann, Thomas

2012-03-16

We report on a new approach to the calculation of Chern-Simons theory expectation values, using the mathematical underpinnings of loop quantum gravity, as well as the Duflo map, a quantization map for functions on Lie algebras. These new developments can be used in the quantum theory for certain types of black hole horizons, and they may offer new insights for loop quantum gravity, Chern-Simons theory and the theory of quantum groups.

Flow Mapping Based on the Motion-Integration Errors of Autonomous Underwater Vehicles

NASA Astrophysics Data System (ADS)

Chang, D.; Edwards, C. R.; Zhang, F.

2016-02-01

Knowledge of a flow field is crucial in the navigation of autonomous underwater vehicles (AUVs) since the motion of AUVs is affected by ambient flow. Due to the imperfect knowledge of the flow field, it is typical to observe a difference between the actual and predicted trajectories of an AUV, which is referred to as a motion-integration error (also known as a dead-reckoning error if an AUV navigates via dead-reckoning). The motion-integration error has been essential for an underwater glider to compute its flow estimate from the travel information of the last leg and to improve navigation performance by using the estimate for the next leg. However, the estimate by nature exhibits a phase difference compared to ambient flow experienced by gliders, prohibiting its application in a flow field with strong temporal and spatial gradients. In our study, to mitigate the phase problem, we have developed a local ocean model by combining the flow estimate based on the motion-integration error with flow predictions from a tidal ocean model. Our model has been used to create desired trajectories of gliders for guidance. Our method is validated by Long Bay experiments in 2012 and 2013 in which we deployed multiple gliders on the shelf of South Atlantic Bight and near the edge of Gulf Stream. In our recent study, the application of the motion-integration error is further extended to create a spatial flow map. Considering that the motion-integration errors of AUVs accumulate along their trajectories, the motion-integration error is formulated as a line integral of ambient flow which is then reformulated into algebraic equations. By solving an inverse problem for these algebraic equations, we obtain the knowledge of such flow in near real time, allowing more effective and precise guidance of AUVs in a dynamic environment. This method is referred to as motion tomography. We provide the results of non-parametric and parametric flow mapping from both simulated and experimental data.

Discrimination in a General Algebraic Setting

PubMed Central

Fine, Benjamin; Lipschutz, Seymour; Spellman, Dennis

2015-01-01

Discriminating groups were introduced by G. Baumslag, A. Myasnikov, and V. Remeslennikov as an outgrowth of their theory of algebraic geometry over groups. Algebraic geometry over groups became the main method of attack on the solution of the celebrated Tarski conjectures. In this paper we explore the notion of discrimination in a general universal algebra context. As an application we provide a different proof of a theorem of Malcev on axiomatic classes of Ω-algebras. PMID:26171421

Numerical linear algebra in data mining

NASA Astrophysics Data System (ADS)

Eldén, Lars

Ideas and algorithms from numerical linear algebra are important in several areas of data mining. We give an overview of linear algebra methods in text mining (information retrieval), pattern recognition (classification of handwritten digits), and PageRank computations for web search engines. The emphasis is on rank reduction as a method of extracting information from a data matrix, low-rank approximation of matrices using the singular value decomposition and clustering, and on eigenvalue methods for network analysis.

Without derivatives or limits: from visual and geometrical points of view to algebraic methods for identifying tangent lines

NASA Astrophysics Data System (ADS)

Vivier, L.

2013-07-01

Usually, the tangent line is considered to be a calculus notion. However, it is also a graphical and an algebraic notion. The graphical frame, where our primary conceptions are conceived, could give rise to algebraic methods to obtain the tangent line to a curve. In this pre-calculus perspective, two methods are described and discussed according to their potential for secondary students and teacher training.

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

NASA Astrophysics Data System (ADS)

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.

Quantum coherence generating power, maximally abelian subalgebras, and Grassmannian geometry

NASA Astrophysics Data System (ADS)

Zanardi, Paolo; Campos Venuti, Lorenzo

2018-01-01

We establish a direct connection between the power of a unitary map in d-dimensions (d < ∞) to generate quantum coherence and the geometry of the set Md of maximally abelian subalgebras (of the quantum system full operator algebra). This set can be seen as a topologically non-trivial subset of the Grassmannian over linear operators. The natural distance over the Grassmannian induces a metric structure on Md, which quantifies the lack of commutativity between the pairs of subalgebras. Given a maximally abelian subalgebra, one can define, on physical grounds, an associated measure of quantum coherence. We show that the average quantum coherence generated by a unitary map acting on a uniform ensemble of quantum states in the algebra (the so-called coherence generating power of the map) is proportional to the distance between a pair of maximally abelian subalgebras in Md connected by the unitary transformation itself. By embedding the Grassmannian into a projective space, one can pull-back the standard Fubini-Study metric on Md and define in this way novel geometrical measures of quantum coherence generating power. We also briefly discuss the associated differential metric structures.

Using Homemade Algebra Tiles To Develop Algebra and Prealgebra Concepts.

ERIC Educational Resources Information Center

Leitze, Annette Ricks; Kitt, Nancy A.

2000-01-01

Describes how to use homemade tiles, sketches, and the box method to reach a broader group of students for successful algebra learning. Provides a list of concepts appropriate for such an approach. (KHR)

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

ERIC Educational Resources Information Center

Bull, Prince; McCormick, Carlos

2012-01-01

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

Numerical stability in problems of linear algebra.

NASA Technical Reports Server (NTRS)

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.

O(d,d)-duality in string theory

NASA Astrophysics Data System (ADS)

Rennecke, Felix

2014-10-01

A new method for obtaining dual string theory backgrounds is presented. Preservation of the Hamiltonian density and the energy momentum tensor induced by O( d, d)-transformations leads to a relation between dual sets of coordinate one-forms accompanied by a redefinition of the background fields and a shift of the dilaton. The necessity of isometric directions arises as integrability condition for this map. The isometry algebra is studied in detail using generalised geometry. In particular, non-abelian dualities and β-transformations are contained in this approach. The latter are exemplified by the construction of a new approximate non-geometric background.

Algebraic features of some generalizations of the Lotka-Volterra system

NASA Astrophysics Data System (ADS)

Bibik, Yu. V.; Sarancha, D. A.

2010-10-01

For generalizations of the Lotka-Volterra system, an integration method is proposed based on the nontrivial algebraic structure of these generalizations. The method makes use of an auxiliary first-order differential equation derived from the phase curve equation with the help of this algebraic structure. Based on this equation, a Hamiltonian approach can be developed and canonical variables (moreover, action-angle variables) can be constructed.

Curricula Alignment and Its Impact on End of Course Assessment Scores

ERIC Educational Resources Information Center

Burti, Neil, Jr.

2011-01-01

The purpose of this mixed methods study was to examine the alignment of the written, enacted, and tested Algebra I curricula in the Cherry Hill (NJ) Public School District. Furthermore, this QUAN-QUAL study sought to determine the impact of course selection (Algebra I, Enriched Algebra) on achievement as measured by the Algebra I End of Course…

Assessing non-uniqueness: An algebraic approach

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

Vasco, Don W.

Geophysical inverse problems are endowed with a rich mathematical structure. When discretized, most differential and integral equations of interest are algebraic (polynomial) in form. Techniques from algebraic geometry and computational algebra provide a means to address questions of existence and uniqueness for both linear and non-linear inverse problem. In a sense, the methods extend ideas which have proven fruitful in treating linear inverse problems.

Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students. Educator's Practice Guide. What Works Clearinghouse.™ NCEE 2015-4010

ERIC Educational Resources Information Center

Star, Jon R.; Foegen, Anne; Larson, Matthew R.; McCallum, William G.; Porath, Jane; Zbiek, Rose Mary; Caronongan, Pia; Furgeson, Joshua,; Keating, Betsy; Lyskawa, Julia

2015-01-01

Mastering algebra is important for future math and postsecondary success. Educators will find practical recommendations for how to improve algebra instruction in the What Works Clearinghouse (WWC) practice guide, "Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students". The methods and examples included in…

A Process Algebra Approach to Quantum Electrodynamics

NASA Astrophysics Data System (ADS)

Sulis, William

2017-12-01

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

Linear reduction method for predictive and informative tag SNP selection.

PubMed

He, Jingwu; Westbrooks, Kelly; Zelikovsky, Alexander

2005-01-01

Constructing a complete human haplotype map is helpful when associating complex diseases with their related SNPs. Unfortunately, the number of SNPs is very large and it is costly to sequence many individuals. Therefore, it is desirable to reduce the number of SNPs that should be sequenced to a small number of informative representatives called tag SNPs. In this paper, we propose a new linear algebra-based method for selecting and using tag SNPs. We measure the quality of our tag SNP selection algorithm by comparing actual SNPs with SNPs predicted from selected linearly independent tag SNPs. Our experiments show that for sufficiently long haplotypes, knowing only 0.4% of all SNPs the proposed linear reduction method predicts an unknown haplotype with the error rate below 2% based on 10% of the population.

Quantum channels irreducibly covariant with respect to the finite group generated by the Weyl operators

NASA Astrophysics Data System (ADS)

Siudzińska, Katarzyna; Chruściński, Dariusz

2018-03-01

In matrix algebras, we introduce a class of linear maps that are irreducibly covariant with respect to the finite group generated by the Weyl operators. In particular, we analyze the irreducibly covariant quantum channels, that is, the completely positive and trace-preserving linear maps. Interestingly, imposing additional symmetries leads to the so-called generalized Pauli channels, which were recently considered in the context of the non-Markovian quantum evolution. Finally, we provide examples of irreducibly covariant positive but not necessarily completely positive maps.

An algebraic approach to the analytic bootstrap

DOE PAGES

Alday, Luis F.; Zhiboedov, Alexander

2017-04-27

We develop an algebraic approach to the analytic bootstrap in CFTs. By acting with the Casimir operator on the crossing equation we map the problem of doing large spin sums to any desired order to the problem of solving a set of recursion relations. We compute corrections to the anomalous dimension of large spin operators due to the exchange of a primary and its descendants in the crossed channel and show that this leads to a Borel-summable expansion. Here, we analyse higher order corrections to the microscopic CFT data in the direct channel and its matching to infinite towers ofmore » operators in the crossed channel. We apply this method to the critical O(N ) model. At large N we reproduce the first few terms in the large spin expansion of the known two-loop anomalous dimensions of higher spin currents in the traceless symmetric representation of O(N ) and make further predictions. At small N we present the results for the truncated large spin expansion series of anomalous dimensions of higher spin currents.« less

Quasiparticle Representation of Coherent Nonlinear Optical Signals of Multiexcitons

NASA Astrophysics Data System (ADS)

Fingerhut, Benjamin; Bennet, Kochise; Roslyak, Oleksiy; Mukamel, Shaul

2013-03-01

Elementary excitations of many-Fermion systems can be described within the quasiparticle approach which is widely used in the calculation of transport and optical properties of metals, semiconductors, molecular aggregates and strongly correlated quantum materials. The excitations are then viewed as independent harmonic oscillators where the many-body interactions between the oscillators are mapped into anharmonicities. We present a Green's function approach based on coboson algebra for calculating nonlinear optical signals and apply it onwards the study of two and three exciton states. The method only requires the diagonalization of the single exciton manifold and avoids equations of motion of multi-exciton manifolds. Using coboson algebra many body effects are recast in terms of tetradic exciton-exciton interactions: Coulomb scattering and Pauli exchange. The physical space of Fermions is recovered by singular-value decomposition of the over-complete coboson basis set. The approach is used to calculate third and fifth order quantum coherence optical signals that directly probe correlations in two- and three exciton states and their projections on the two and single exciton manifold.

Algebraic method for parameter identification of circuit models for batteries under non-zero initial condition

NASA Astrophysics Data System (ADS)

Devarakonda, Lalitha; Hu, Tingshu

2014-12-01

This paper presents an algebraic method for parameter identification of Thevenin's equivalent circuit models for batteries under non-zero initial condition. In traditional methods, it was assumed that all capacitor voltages have zero initial conditions at the beginning of each charging/discharging test. This would require a long rest time between two tests, leading to very lengthy tests for a charging/discharging cycle. In this paper, we propose an algebraic method which can extract the circuit parameters together with initial conditions. This would theoretically reduce the rest time to 0 and substantially accelerate the testing cycles.

Primary decomposition of zero-dimensional ideals over finite fields

NASA Astrophysics Data System (ADS)

Gao, Shuhong; Wan, Daqing; Wang, Mingsheng

2009-03-01

A new algorithm is presented for computing primary decomposition of zero-dimensional ideals over finite fields. Like Berlekamp's algorithm for univariate polynomials, the new method is based on the invariant subspace of the Frobenius map acting on the quotient algebra. The dimension of the invariant subspace equals the number of primary components, and a basis of the invariant subspace yields a complete decomposition. Unlike previous approaches for decomposing multivariate polynomial systems, the new method does not need primality testing nor any generic projection, instead it reduces the general decomposition problem directly to root finding of univariate polynomials over the ground field. Also, it is shown how Groebner basis structure can be used to get partial primary decomposition without any root finding.

Filiform Lie algebras of order 3

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

Navarro, R. M., E-mail: rnavarro@unex.es

2014-04-15

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de lamore » variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases.« less

The Effect of the Math Emporium Instructional Method on Students' Performance in College Algebra

ERIC Educational Resources Information Center

Cousins-Cooper, Kathy; Staley, Katrina N.; Kim, Seongtae; Luke, Nicholas S.

2017-01-01

This study aims to investigate the effectiveness of the Emporium instructional method in a course of college algebra and trigonometry by comparing to the traditional lecture method. The math emporium method is a nontraditional instructional method of learning math that has been implemented at several universities with much success and has been…

Using CAS to Solve Classical Mathematics Problems

ERIC Educational Resources Information Center

Burke, Maurice J.; Burroughs, Elizabeth A.

2009-01-01

Historically, calculus has displaced many algebraic methods for solving classical problems. This article illustrates an algebraic method for finding the zeros of polynomial functions that is closely related to Newton's method (devised in 1669, published in 1711), which is encountered in calculus. By exploring this problem, precalculus students…

Hybrid cloud and cluster computing paradigms for life science applications

PubMed Central

2010-01-01

Background Clouds and MapReduce have shown themselves to be a broadly useful approach to scientific computing especially for parallel data intensive applications. However they have limited applicability to some areas such as data mining because MapReduce has poor performance on problems with an iterative structure present in the linear algebra that underlies much data analysis. Such problems can be run efficiently on clusters using MPI leading to a hybrid cloud and cluster environment. This motivates the design and implementation of an open source Iterative MapReduce system Twister. Results Comparisons of Amazon, Azure, and traditional Linux and Windows environments on common applications have shown encouraging performance and usability comparisons in several important non iterative cases. These are linked to MPI applications for final stages of the data analysis. Further we have released the open source Twister Iterative MapReduce and benchmarked it against basic MapReduce (Hadoop) and MPI in information retrieval and life sciences applications. Conclusions The hybrid cloud (MapReduce) and cluster (MPI) approach offers an attractive production environment while Twister promises a uniform programming environment for many Life Sciences applications. Methods We used commercial clouds Amazon and Azure and the NSF resource FutureGrid to perform detailed comparisons and evaluations of different approaches to data intensive computing. Several applications were developed in MPI, MapReduce and Twister in these different environments. PMID:21210982

Robot map building based on fuzzy-extending DSmT

NASA Astrophysics Data System (ADS)

Li, Xinde; Huang, Xinhan; Wu, Zuyu; Peng, Gang; Wang, Min; Xiong, Youlun

2007-11-01

With the extensive application of mobile robots in many different fields, map building in unknown environments has been one of the principal issues in the field of intelligent mobile robot. However, Information acquired in map building presents characteristics of uncertainty, imprecision and even high conflict, especially in the course of building grid map using sonar sensors. In this paper, we extended DSmT with Fuzzy theory by considering the different fuzzy T-norm operators (such as Algebraic Product operator, Bounded Product operator, Einstein Product operator and Default minimum operator), in order to develop a more general and flexible combinational rule for more extensive application. At the same time, we apply fuzzy-extended DSmT to mobile robot map building with the help of new self-localization method based on neighboring field appearance matching( -NFAM), to make the new tool more robust in very complex environment. An experiment is conducted to reconstruct the map with the new tool in indoor environment, in order to compare their performances in map building with four T-norm operators, when Pioneer II mobile robot runs along the same trace. Finally, a conclusion is reached that this study develops a new idea to extend DSmT, also provides a new approach for autonomous navigation of mobile robot, and provides a human-computer interactive interface to manage and manipulate the robot remotely.

A Discrete Global Grid System Programming Language Using MapReduce

NASA Astrophysics Data System (ADS)

Peterson, P.; Shatz, I.

2016-12-01

A discrete global grid system (DGGS) is a powerful mechanism for storing and integrating geospatial information. As a "pixelization" of the Earth, many image processing techniques lend themselves to the transformation of data values referenced to the DGGS cells. It has been shown that image algebra, as an example, and advanced algebra, like Fast Fourier Transformation, can be used on the DGGS tiling structure for geoprocessing and spatial analysis. MapReduce has been shown to provide advantages for processing and generating large data sets within distributed and parallel computing. The DGGS structure is ideally suited for big distributed Earth data. We proposed that basic expressions could be created to form the atoms of a generalized DGGS language using the MapReduce programming model. We created three very efficient expressions: Selectors (aka filter) - A selection function that generate a set of cells, cell collections, or geometries; Calculators (aka map) - A computational function (including quantization of raw measurements and data sources) that generate values in a DGGS cell; and Aggregators (aka reduce) - A function that generate spatial statistics from cell values within a cell. We found that these three basic MapReduce operations along with a forth function, the Iterator, for horizontal and vertical traversing of any DGGS structure, provided simple building block resulting in very efficient operations and processes that could be used with any DGGS. We provide examples and a demonstration of their effectiveness using the ISEA3H DGGS on the PYXIS Studio.

Teaching Linear Algebra: Must the Fog Always Roll In?

ERIC Educational Resources Information Center

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…

Algebraic Concepts: What's Really New in New Curricula?

ERIC Educational Resources Information Center

Star, Jon R.; Herbel-Eisenmann, Beth A.; Smith, John P., III

2000-01-01

Examines 8th grade units from the Connected Mathematics Project (CMP). Identifies differences in older and newer conceptions, fundamental objects of study, typical problems, and typical solution methods in algebra. Also discusses where the issue of what is new in algebra is relevant to many other innovative middle school curricula. (KHR)

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

PubMed

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

2013-05-01

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

Coalgebraic structure of genetic inheritance.

PubMed

Tian, Jianjun; Li, Bai-Lian

2004-09-01

Although in the broadly defined genetic algebra, multiplication suggests a forward direction of from parents to progeny, when looking from the reverse direction, it also suggests to us a new algebraic structure-coalge- braic structure, which we call genetic coalgebras. It is not the dual coalgebraic structure and can be used in the construction of phylogenetic trees. Math- ematically, to construct phylogenetic trees means we need to solve equations x([n]) = a, or x([n]) = b. It is generally impossible to solve these equations inalgebras. However, we can solve them in coalgebras in the sense of tracing back for their ancestors. A thorough exploration of coalgebraic structure in genetics is apparently necessary. Here, we develop a theoretical framework of the coalgebraic structure of genetics. From biological viewpoint, we defined various fundamental concepts and examined their elementary properties that contain genetic significance. Mathematically, by genetic coalgebra, we mean any coalgebra that occurs in genetics. They are generally noncoassociative and without counit; and in the case of non-sex-linked inheritance, they are cocommutative. Each coalgebra with genetic realization has a baric property. We have also discussed the methods to construct new genetic coalgebras, including cocommutative duplication, the tensor product, linear combinations and the skew linear map, which allow us to describe complex genetic traits. We also put forward certain theorems that state the relationship between gametic coalgebra and gametic algebra. By Brower's theorem in topology, we prove the existence of equilibrium state for the in-evolution operator.

On the Performance of an Algebraic MultigridSolver on Multicore Clusters

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

Baker, A H; Schulz, M; Yang, U M

2010-04-29

Algebraic multigrid (AMG) solvers have proven to be extremely efficient on distributed-memory architectures. However, when executed on modern multicore cluster architectures, we face new challenges that can significantly harm AMG's performance. We discuss our experiences on such an architecture and present a set of techniques that help users to overcome the associated problems, including thread and process pinning and correct memory associations. We have implemented most of the techniques in a MultiCore SUPport library (MCSup), which helps to map OpenMP applications to multicore machines. We present results using both an MPI-only and a hybrid MPI/OpenMP model.

Spatial-Operator Algebra For Flexible-Link Manipulators

NASA Technical Reports Server (NTRS)

Jain, Abhinandan; Rodriguez, Guillermo

1994-01-01

Method of computing dynamics of multiple-flexible-link robotic manipulators based on spatial-operator algebra, which originally applied to rigid-link manipulators. Aspects of spatial-operator-algebra approach described in several previous articles in NASA Tech Briefs-most recently "Robot Control Based on Spatial-Operator Algebra" (NPO-17918). In extension of spatial-operator algebra to manipulators with flexible links, each link represented by finite-element model: mass of flexible link apportioned among smaller, lumped-mass rigid bodies, coupling of motions expressed in terms of vibrational modes. This leads to operator expression for modal-mass matrix of link.

Alternative Representations for Algebraic Problem Solving: When Are Graphs Better than Equations?

ERIC Educational Resources Information Center

Mielicki, Marta K.; Wiley, Jennifer

2016-01-01

Successful algebraic problem solving entails adaptability of solution methods using different representations. Prior research has suggested that students are more likely to prefer symbolic solution methods (equations) over graphical ones, even when graphical methods should be more efficient. However, this research has not tested how representation…

Analysis of backward differentiation formula for nonlinear differential-algebraic equations with 2 delays.

PubMed

Sun, Leping

2016-01-01

This paper is concerned with the backward differential formula or BDF methods for a class of nonlinear 2-delay differential algebraic equations. We obtain two sufficient conditions under which the methods are stable and asymptotically stable. At last, examples show that our methods are true.

Genetic algorithms in teaching artificial intelligence (automated generation of specific algebras)

NASA Astrophysics Data System (ADS)

Habiballa, Hashim; Jendryscik, Radek

2017-11-01

The problem of teaching essential Artificial Intelligence (AI) methods is an important task for an educator in the branch of soft-computing. The key focus is often given to proper understanding of the principle of AI methods in two essential points - why we use soft-computing methods at all and how we apply these methods to generate reasonable results in sensible time. We present one interesting problem solved in the non-educational research concerning automated generation of specific algebras in the huge search space. We emphasize above mentioned points as an educational case study of an interesting problem in automated generation of specific algebras.

Higher spin black holes with soft hair

NASA Astrophysics Data System (ADS)

Grumiller, Daniel; Pérez, Alfredo; Prohazka, Stefan; Tempo, David; Troncoso, Ricardo

2016-10-01

We construct a new set of boundary conditions for higher spin gravity, inspired by a recent "soft Heisenberg hair"-proposal for General Relativity on three-dimensional Anti-de Sitter space. The asymptotic symmetry algebra consists of a set of affine û(1) current algebras. Its associated canonical charges generate higher spin soft hair. We focus first on the spin-3 case and then extend some of our main results to spin- N , many of which resemble the spin-2 results: the generators of the asymptotic W 3 algebra naturally emerge from composite operators of the û(1) charges through a twisted Sugawara construction; our boundary conditions ensure regularity of the Euclidean solutions space independently of the values of the charges; solutions, which we call "higher spin black flowers", are stationary but not necessarily spherically symmetric. Finally, we derive the entropy of higher spin black flowers, and find that for the branch that is continuously connected to the BTZ black hole, it depends only on the affine purely gravitational zero modes. Using our map to W -algebra currents we recover well-known expressions for higher spin entropy. We also address higher spin black flowers in the metric formalism and achieve full consistency with previous results.

Non-geometric fluxes, quasi-Hopf twist deformations, and nonassociative quantum mechanics

NASA Astrophysics Data System (ADS)

Mylonas, Dionysios; Schupp, Peter; Szabo, Richard J.

2014-12-01

We analyse the symmetries underlying nonassociative deformations of geometry in non-geometric R-flux compactifications which arise via T-duality from closed strings with constant geometric fluxes. Starting from the non-abelian Lie algebra of translations and Bopp shifts in phase space, together with a suitable cochain twist, we construct the quasi-Hopf algebra of symmetries that deforms the algebra of functions and the exterior differential calculus in the phase space description of nonassociative R-space. In this setting, nonassociativity is characterised by the associator 3-cocycle which controls non-coassociativity of the quasi-Hopf algebra. We use abelian 2-cocycle twists to construct maps between the dynamical nonassociative star product and a family of associative star products parametrized by constant momentum surfaces in phase space. We define a suitable integration on these nonassociative spaces and find that the usual cyclicity of associative noncommutative deformations is replaced by weaker notions of 2-cyclicity and 3-cyclicity. Using this star product quantization on phase space together with 3-cyclicity, we formulate a consistent version of nonassociative quantum mechanics, in which we calculate the expectation values of area and volume operators, and find coarse-graining of the string background due to the R-flux.

Linear algebraic methods applied to intensity modulated radiation therapy.

PubMed

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.

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

Mozrzymas, Marek; Horodecki, Michał; Studziński, Michał

We consider the structure of algebra of operators, acting in n-fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its regular representation, we derive basic properties of the algebra. In particular, we describe all irreducible representations of the algebra of partially transposed operators and derive expressions for matrix elements of the representations. It appears that there are two kinds of irreducible representations of the algebra. The first one is strictly connected with the representations of the group S(n − 1) induced by irreduciblemore » representations of the group S(n − 2). The second kind is structurally connected with irreducible representations of the group S(n − 1)« less

The Geometric Nature of the Flaschka Transformation

NASA Astrophysics Data System (ADS)

Bloch, Anthony M.; Gay-Balmaz, François; Ratiu, Tudor S.

2017-06-01

We show that the Flaschka map, originally introduced to analyze the dynamics of the integrable Toda lattice system, is the inverse of a momentum map. We discuss the geometrical setting of the map and apply it to the generalized Toda lattice systems on semisimple Lie algebras, the rigid body system on Toda orbits, and to coadjoint orbits of semidirect products groups. In addition, we develop an infinite-dimensional generalization for the group of area preserving diffeomorphisms of the annulus and apply it to the analysis of the dispersionless Toda lattice PDE and the solvable rigid body PDE.

A Comparison of Web-Based and Paper-and-Pencil Homework on Student Performance in College Algebra

ERIC Educational Resources Information Center

Hauk, Shandy; Powers, Robert A.; Segalla, Angelo

2015-01-01

College algebra fulfills general education requirements at many colleges in the United States. The study reported here investigated differences in mathematics achievement between undergraduates in college algebra classes using one of two homework methods: "WeBWorK," an open-source system for web-based homework, or traditional…

Modelling of nanoscale quantum tunnelling structures using algebraic topology method

NASA Astrophysics Data System (ADS)

Sankaran, Krishnaswamy; Sairam, B.

2018-05-01

We have modelled nanoscale quantum tunnelling structures using Algebraic Topology Method (ATM). The accuracy of ATM is compared to the analytical solution derived based on the wave nature of tunnelling electrons. ATM provides a versatile, fast, and simple model to simulate complex structures. We are currently expanding the method for modelling electrodynamic systems.

On Correspondence of BRST-BFV, Dirac, and Refined Algebraic Quantizations of Constrained Systems

NASA Astrophysics Data System (ADS)

Shvedov, O. Yu.

2002-11-01

The correspondence between BRST-BFV, Dirac, and refined algebraic (group averaging, projection operator) approaches to quantizing constrained systems is analyzed. For the closed-algebra case, it is shown that the component of the BFV wave function corresponding to maximal (minimal) value of number of ghosts and antighosts in the Schrodinger representation may be viewed as a wave function in the refined algebraic (Dirac) quantization approach. The Giulini-Marolf group averaging formula for the inner product in the refined algebraic quantization approach is obtained from the Batalin-Marnelius prescription for the BRST-BFV inner product, which should be generally modified due to topological problems. The considered prescription for the correspondence of states is observed to be applicable to the open-algebra case. The refined algebraic quantization approach is generalized then to the case of nontrivial structure functions. A simple example is discussed. The correspondence of observables for different quantization methods is also investigated.

On Max-Plus Algebra and Its Application on Image Steganography

PubMed Central

Santoso, Kiswara Agung

2018-01-01

We propose a new steganography method to hide an image into another image using matrix multiplication operations on max-plus algebra. This is especially interesting because the matrix used in encoding or information disguises generally has an inverse, whereas matrix multiplication operations in max-plus algebra do not have an inverse. The advantages of this method are the size of the image that can be hidden into the cover image, larger than the previous method. The proposed method has been tested on many secret images, and the results are satisfactory which have a high level of strength and a high level of security and can be used in various operating systems. PMID:29887761

On Max-Plus Algebra and Its Application on Image Steganography.

PubMed

Santoso, Kiswara Agung; Fatmawati; Suprajitno, Herry

2018-01-01

We propose a new steganography method to hide an image into another image using matrix multiplication operations on max-plus algebra. This is especially interesting because the matrix used in encoding or information disguises generally has an inverse, whereas matrix multiplication operations in max-plus algebra do not have an inverse. The advantages of this method are the size of the image that can be hidden into the cover image, larger than the previous method. The proposed method has been tested on many secret images, and the results are satisfactory which have a high level of strength and a high level of security and can be used in various operating systems.

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

NASA Astrophysics Data System (ADS)

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

2016-08-01

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

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

ERIC Educational Resources Information Center

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…

Designing Cognitively Diagnostic Assessment for Algebraic Content Knowledge and Thinking Skills

ERIC Educational Resources Information Center

Zhang, Zhidong

2018-01-01

This study explored a diagnostic assessment method that emphasized the cognitive process of algebra learning. The study utilized a design and a theory-driven model to examine the content knowledge. Using the theory driven model, the thinking skills of algebra learning was also examined. A Bayesian network model was applied to represent the theory…

Alternative predictors in chaotic time series

NASA Astrophysics Data System (ADS)

Alves, P. R. L.; Duarte, L. G. S.; da Mota, L. A. C. P.

2017-06-01

In the scheme of reconstruction, non-polynomial predictors improve the forecast from chaotic time series. The algebraic manipulation in the Maple environment is the basis for obtaining of accurate predictors. Beyond the different times of prediction, the optional arguments of the computational routines optimize the running and the analysis of global mappings.

Exact solution of some linear matrix equations using algebraic methods

NASA Technical Reports Server (NTRS)

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

1977-01-01

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

A Construction of Rigid Analytic Cohomology Classes for Split Reductive Algebraic Groups

NASA Astrophysics Data System (ADS)

Graham, Bonita Lynn

The cohomology groups H1(Gamma 0(N), Vk) completely describe the space of classical cusp forms of weight k and level N. We study a generalization, Hn(Gamma, Vlambda), where some algebraic group G plays a role analogous to that of GL2 in the classical case. Ash and Stevens proved that certain classes in Hn(Gamma, Vlambda) may be lifted through the natural map rho lambda : Hn(Gamma, D lambda) → Hn(Gamma, Vlambda) to overconvergent classes in H n(Gamma, Dlambda). Pollack and Pollack were able to prove this result constructively in the case of G = GL3, by providing a filtration on the distribution space D?. We construct a general filtration FilN D lambda, for a split reductive algebraic group G. Using this filtration, we are able to lift classes in Hn(Gamma, Vlambda) to the finite dimensional spaces H n(Gamma, Dlambda / FilN Dlambda). These lifts approximate the lifts into Hn(Gamma, Dlambda ) and improve as N → infinity.

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

ERIC Educational Resources Information Center

Ng, Swee Fong; Lee, Kerry

2009-01-01

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

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

ERIC Educational Resources Information Center

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

2010-01-01

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

Multi-loop Integrand Reduction with Computational Algebraic Geometry

NASA Astrophysics Data System (ADS)

Badger, Simon; Frellesvig, Hjalte; Zhang, Yang

2014-06-01

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

Generalized Browder's and Weyl's theorems for Banach space operators

NASA Astrophysics Data System (ADS)

Curto, Raúl E.; Han, Young Min

2007-12-01

We find necessary and sufficient conditions for a Banach space operator T to satisfy the generalized Browder's theorem. We also prove that the spectral mapping theorem holds for the Drazin spectrum and for analytic functions on an open neighborhood of [sigma](T). As applications, we show that if T is algebraically M-hyponormal, or if T is algebraically paranormal, then the generalized Weyl's theorem holds for f(T), where f[set membership, variant]H((T)), the space of functions analytic on an open neighborhood of [sigma](T). We also show that if T is reduced by each of its eigenspaces, then the generalized Browder's theorem holds for f(T), for each f[set membership, variant]H([sigma](T)).

Properties of coupled-cluster equations originating in excitation sub-algebras

NASA Astrophysics Data System (ADS)

Kowalski, Karol

2018-03-01

In this paper, we discuss properties of single-reference coupled cluster (CC) equations associated with the existence of sub-algebras of excitations that allow one to represent CC equations in a hybrid fashion where the cluster amplitudes associated with these sub-algebras can be obtained by solving the corresponding eigenvalue problem. For closed-shell formulations analyzed in this paper, the hybrid representation of CC equations provides a natural way for extending active-space and seniority number concepts to provide an accurate description of electron correlation effects. Moreover, a new representation can be utilized to re-define iterative algorithms used to solve CC equations, especially for tough cases defined by the presence of strong static and dynamical correlation effects. We will also explore invariance properties associated with excitation sub-algebras to define a new class of CC approximations referred to in this paper as the sub-algebra-flow-based CC methods. We illustrate the performance of these methods on the example of ground- and excited-state calculations for commonly used small benchmark systems.

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

ERIC Educational Resources Information Center

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

2012-01-01

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

Intertextuality and Sense Production in the Learning of Algebraic Methods

ERIC Educational Resources Information Center

Rojano, Teresa; Filloy, Eugenio; Puig, Luis

2014-01-01

In studies carried out in the 1980s the algebraic symbols and expressions are revealed through prealgebraic readers as non-independent texts, as texts that relate to other texts that in some cases belong to the reader's native language or to the arithmetic sign system. Such outcomes suggest that the act of reading algebraic texts submerges…

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

ERIC Educational Resources Information Center

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…

Lattice Virasoro algebra and corner transfer matrices in the Baxter eight-vertex model

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

Itoyama, H.; Thacker, H.B.

1987-04-06

A lattice Virasoro algebra is constructed for the Baxter eight-vertex model. The operator L/sub 0/ is obtained from the logarithm of the corner transfer matrix and is given by the first moment of the XYZ spin-chain Hamiltonian. The algebra is valid even when the Hamiltonian includes a mass term, in which case it represents lattice coordinate transformations which distinguish between even and odd sublattices. We apply the quantum inverse scattering method to demonstrate that the Virasoro algebra follows from the Yang-Baxter relations.

An Analysis of the Algebraic Method for Balancing Chemical Reactions.

ERIC Educational Resources Information Center

Olson, John A.

1997-01-01

Analyzes the algebraic method for balancing chemical reactions. Introduces a third general condition that involves a balance between the total amount of oxidation and reduction. Requires the specification of oxidation states for all elements throughout the reaction. Describes the general conditions, the mathematical treatment, redox reactions, and…

Asymptotic symmetries of Rindler space at the horizon and null infinity

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

Chung, Hyeyoun

2010-08-15

We investigate the asymptotic symmetries of Rindler space at null infinity and at the event horizon using both systematic and ad hoc methods. We find that the approaches that yield infinite-dimensional asymptotic symmetry algebras in the case of anti-de Sitter and flat spaces only give a finite-dimensional algebra for Rindler space at null infinity. We calculate the charges corresponding to these symmetries and confirm that they are finite, conserved, and integrable, and that the algebra of charges gives a representation of the asymptotic symmetry algebra. We also use relaxed boundary conditions to find infinite-dimensional asymptotic symmetry algebras for Rindler spacemore » at null infinity and at the event horizon. We compute the charges corresponding to these symmetries and confirm that they are finite and integrable. We also determine sufficient conditions for the charges to be conserved on-shell, and for the charge algebra to give a representation of the asymptotic symmetry algebra. In all cases, we find that the central extension of the charge algebra is trivial.« less

Testing the Stability of 2-D Recursive QP, NSHP and General Digital Filters of Second Order

NASA Astrophysics Data System (ADS)

Rathinam, Ananthanarayanan; Ramesh, Rengaswamy; Reddy, P. Subbarami; Ramaswami, Ramaswamy

Several methods for testing stability of first quadrant quarter-plane two dimensional (2-D) recursive digital filters have been suggested in 1970's and 80's. Though Jury's row and column algorithms, row and column concatenation stability tests have been considered as highly efficient mapping methods. They still fall short of accuracy as they need infinite number of steps to conclude about the exact stability of the filters and also the computational time required is enormous. In this paper, we present procedurally very simple algebraic method requiring only two steps when applied to the second order 2-D quarter - plane filter. We extend the same method to the second order Non-Symmetric Half-plane (NSHP) filters. Enough examples are given for both these types of filters as well as some lower order general recursive 2-D digital filters. We applied our method to barely stable or barely unstable filter examples available in the literature and got the same decisions thus showing that our method is accurate enough.

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

PubMed

Benhammouda, Brahim

2016-01-01

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

Mathematical biodescriptors of proteomics maps: background and applications.

PubMed

Basak, Subhash C; Gute, Brian D

2008-05-01

This article reviews recent developments in the formulation and application of biodescriptors to characterize proteomics maps. Such biodescriptors can be derived by applying techniques from discrete mathematics (graph theory, linear algebra and information theory). This review focuses on the development of biodescriptors for proteomics maps derived from 2D gel electrophoresis. Preliminary results demonstrated that such descriptors have a reasonable ability to differentiate between proteomics patterns that result from exposure to closely related individual chemicals and complex mixtures, such as the jet fuel JP-8. Further research is required to evaluate the utility of these proteomics-based biodescriptors for drug discovery and predictive toxicology.

Integration of Genetic Algorithms and Fuzzy Logic for Urban Growth Modeling

NASA Astrophysics Data System (ADS)

Foroutan, E.; Delavar, M. R.; Araabi, B. N.

2012-07-01

Urban growth phenomenon as a spatio-temporal continuous process is subject to spatial uncertainty. This inherent uncertainty cannot be fully addressed by the conventional methods based on the Boolean algebra. Fuzzy logic can be employed to overcome this limitation. Fuzzy logic preserves the continuity of dynamic urban growth spatially by choosing fuzzy membership functions, fuzzy rules and the fuzzification-defuzzification process. Fuzzy membership functions and fuzzy rule sets as the heart of fuzzy logic are rather subjective and dependent on the expert. However, due to lack of a definite method for determining the membership function parameters, certain optimization is needed to tune the parameters and improve the performance of the model. This paper integrates genetic algorithms and fuzzy logic as a genetic fuzzy system (GFS) for modeling dynamic urban growth. The proposed approach is applied for modeling urban growth in Tehran Metropolitan Area in Iran. Historical land use/cover data of Tehran Metropolitan Area extracted from the 1988 and 1999 Landsat ETM+ images are employed in order to simulate the urban growth. The extracted land use classes of the year 1988 include urban areas, street, vegetation areas, slope and elevation used as urban growth physical driving forces. Relative Operating Characteristic (ROC) curve as an fitness function has been used to evaluate the performance of the GFS algorithm. The optimum membership function parameter is applied for generating a suitability map for the urban growth. Comparing the suitability map and real land use map of 1999 gives the threshold value for the best suitability map which can simulate the land use map of 1999. The simulation outcomes in terms of kappa of 89.13% and overall map accuracy of 95.58% demonstrated the efficiency and reliability of the proposed model.

Applications: Using Algebra in an Accounting Practice.

ERIC Educational Resources Information Center

Eisner, Gail A.

1994-01-01

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

[Feature extraction for breast cancer data based on geometric algebra theory and feature selection using differential evolution].

PubMed

Li, Jing; Hong, Wenxue

2014-12-01

The feature extraction and feature selection are the important issues in pattern recognition. Based on the geometric algebra representation of vector, a new feature extraction method using blade coefficient of geometric algebra was proposed in this study. At the same time, an improved differential evolution (DE) feature selection method was proposed to solve the elevated high dimension issue. The simple linear discriminant analysis was used as the classifier. The result of the 10-fold cross-validation (10 CV) classification of public breast cancer biomedical dataset was more than 96% and proved superior to that of the original features and traditional feature extraction method.

Yetter-Drinfeld modules for Hom-bialgebras

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

Makhlouf, Abdenacer, E-mail: Abdenacer.Makhlouf@uha.fr; Panaite, Florin, E-mail: Florin.Panaite@imar.ro

The aim of this paper is to define and study Yetter-Drinfeld modules over Hom-bialgebras, a generalized version of bialgebras obtained by modifying the algebra and coalgebra structures by a homomorphism. Yetter-Drinfeld modules over a Hom-bialgebra with bijective structure map provide solutions of the Hom-Yang-Baxter equation. The category H/HYD of Yetter-Drinfeld modules with bijective structure maps over a Hom-bialgebra H with bijective structure map can be organized, in two different ways, as a quasi-braided pre-tensor category. If H is quasitriangular (respectively, coquasitriangular) the first (respectively, second) quasi-braided pre-tensor category H/HYD contains, as a quasi-braided pre-tensor subcategory, the category of modules (respectively,more » comodules) with bijective structure maps over H.« less

Relationship between Instructional Strategies and Students' Performance in the New York State Regents Examination in Integrated Algebra in High Performing Suburban Districts

ERIC Educational Resources Information Center

Quintana, Elizabeth Ruiz

2015-01-01

This mixed method study explored and analyzed instructional strategies utilized by algebra teachers whose students' coursework culminated in the New York State Regents Examination in Integrated Algebra and for whom 50% of the tested cohort earned mastery level (85 or higher) on the examination. The targeted populations were eighth or ninth grade…

Teaching Algebra to Ninth and Tenth Grade Pupils with the Use of Programmed Materials and Teaching Machines.

ERIC Educational Resources Information Center

Raymond, Roger A.

In the second year of a study to compare and evaluate programed and conventional instruction in algebra for the ninth and tenth grades, comparisons of the control and experimental groups in each grade were again based on scores from the Lankton First-Year Algebra Test and the California Study Methods Survey (CSMS). Although there was a…

The Mathematics of Skateboarding: A Relevant Application of the 5Es of Constructivism

ERIC Educational Resources Information Center

Robertson, William H.; Meyer, Rachelle D.; Wilkerson, Trena L.

2012-01-01

Getting high school students to enjoy mathematics and to connect concepts to their daily lives is a challenge for many educators. The Mathematics of Skateboarding demonstrated innovative and creative ways to engage students in content and skills mapped to state requirements for high school students in Algebra and Geometry.

A note on generalized Weyl's theorem

NASA Astrophysics Data System (ADS)

Zguitti, H.

2006-04-01

We prove that if either T or T* has the single-valued extension property, then the spectral mapping theorem holds for B-Weyl spectrum. If, moreover T is isoloid, and generalized Weyl's theorem holds for T, then generalized Weyl's theorem holds for f(T) for every . An application is given for algebraically paranormal operators.

Direct Sum Decomposition of Groups

ERIC Educational Resources Information Center

Thaheem, A. B.

2005-01-01

Direct sum decomposition of Abelian groups appears in almost all textbooks on algebra for undergraduate students. This concept plays an important role in group theory. One simple example of this decomposition is obtained by using the kernel and range of a projection map on an Abelian group. The aim in this pedagogical note is to establish a direct…

Exact solution of some linear matrix equations using algebraic methods

NASA Technical Reports Server (NTRS)

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

1979-01-01

Algebraic methods are used to construct the exact solution P of the linear matrix equation PA + BP = - C, where A, B, and C are matrices with real entries. The emphasis of this equation is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The paper is divided into six sections which include the proof of the basic lemma, the Liapunov equation, and the computer implementation for the rational, integer and modular algorithms. Two numerical examples are given and the entire calculation process is depicted.

Algebraic methods for the solution of some linear matrix equations

NASA Technical Reports Server (NTRS)

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

1979-01-01

The characterization of polynomials whose zeros lie in certain algebraic domains (and the unification of the ideas of Hermite and Lyapunov) is the basis for developing finite algorithms for the solution of linear matrix equations. Particular attention is given to equations PA + A'P = Q (the Lyapunov equation) and P - A'PA = Q the (discrete Lyapunov equation). The Lyapunov equation appears in several areas of control theory such as stability theory, optimal control (evaluation of quadratic integrals), stochastic control (evaluation of covariance matrices) and in the solution of the algebraic Riccati equation using Newton's method.

Divergence of Scientific Heuristic Method and Direct Algebraic Instruction

ERIC Educational Resources Information Center

Calucag, Lina S.

2016-01-01

This is an experimental study, made used of the non-randomized experimental and control groups, pretest-posttest designs. The experimental and control groups were two separate intact classes in Algebra. For a period of twelve sessions, the experimental group was subjected to the scientific heuristic method, but the control group instead was given…

Quasi-generalized variables

NASA Technical Reports Server (NTRS)

Baumgarten, J.; Ostermeyer, G. P.

1986-01-01

The numerical solution of a system of differential and algebraic equations is difficult, due to the appearance of numerical instabilities. A method is presented here which permits numerical solutions of such a system to be obtained which satisfy the algebraic constraint equations exactly without reducing the order of the differential equations. The method is demonstrated using examples from mechanics.

Enumerating Small Sudoku Puzzles in a First Abstract Algebra Course

ERIC Educational Resources Information Center

Lorch, Crystal; Lorch, John

2008-01-01

Two methods are presented for counting small "essentially different" sudoku puzzles using elementary group theory: one method (due to Jarvis and Russell) uses Burnside's counting formula, while the other employs an invariant property of sudoku puzzles. Ideas are included for incorporating this material into an introductory abstract algebra course.…

Ermakov's Superintegrable Toy and Nonlocal Symmetries

NASA Astrophysics Data System (ADS)

Leach, P. G. L.; Karasu Kalkanli, A.; Nucci, M. C.; Andriopoulos, K.

2005-11-01

We investigate the symmetry properties of a pair of Ermakov equations. The system is superintegrable and yet possesses only three Lie point symmetries with the algebra sl(2, R). The number of point symmetries is insufficient and the algebra unsuitable for the complete specification of the system. We use the method of reduction of order to reduce the nonlinear fourth-order system to a third-order system comprising a linear second-order equation and a conservation law. We obtain the representation of the complete symmetry group from this system. Four of the required symmetries are nonlocal and the algebra is the direct sum of a one-dimensional Abelian algebra with the semidirect sum of a two-dimensional solvable algebra with a two-dimensional Abelian algebra. The problem illustrates the difficulties which can arise in very elementary systems. Our treatment demonstrates the existence of possible routes to overcome these problems in a systematic fashion.

Linear reduction methods for tag SNP selection.

PubMed

He, Jingwu; Zelikovsky, Alex

2004-01-01

It is widely hoped that constructing a complete human haplotype map will help to associate complex diseases with certain SNP's. Unfortunately, the number of SNP's is huge and it is very costly to sequence many individuals. Therefore, it is desirable to reduce the number of SNP's that should be sequenced to considerably small number of informative representatives, so called tag SNP's. In this paper, we propose a new linear algebra based method for selecting and using tag SNP's. Our method is purely combinatorial and can be combined with linkage disequilibrium (LD) and block based methods. We measure the quality of our tag SNP selection algorithm by comparing actual SNP's with SNP's linearly predicted from linearly chosen tag SNP's. We obtain an extremely good compression and prediction rates. For example, for long haplotypes (>25000 SNP's), knowing only 0.4% of all SNP's we predict the entire unknown haplotype with 2% accuracy while the prediction method is based on a 10% sample of the population.

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

PubMed

Bouchard-Côté, Alexandre

2013-12-01

Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems.

Elliptic generation of composite three-dimensional grids about realistic aircraft

NASA Technical Reports Server (NTRS)

Sorenson, R. L.

1986-01-01

An elliptic method for generating composite grids about realistic aircraft is presented. A body-conforming grid is first generated about the entire aircraft by the solution of Poisson's differential equation. This grid has relatively coarse spacing, and it covers the entire physical domain. At boundary surfaces, cell size is controlled and cell skewness is nearly eliminated by inhomogeneous terms, which are found automatically by the program. Certain regions of the grid in which high gradients are expected, and which map into rectangular solids in the computational domain, are then designated for zonal refinement. Spacing in the zonal grids is reduced by adding points with a simple, algebraic scheme. Details of the grid generation method are presented along with results of the present application, a wing-body configuration based on the F-16 fighter aircraft.

Edge-based nonlinear diffusion for finite element approximations of convection-diffusion equations and its relation to algebraic flux-correction schemes.

PubMed

Barrenechea, Gabriel R; Burman, Erik; Karakatsani, Fotini

2017-01-01

For the case of approximation of convection-diffusion equations using piecewise affine continuous finite elements a new edge-based nonlinear diffusion operator is proposed that makes the scheme satisfy a discrete maximum principle. The diffusion operator is shown to be Lipschitz continuous and linearity preserving. Using these properties we provide a full stability and error analysis, which, in the diffusion dominated regime, shows existence, uniqueness and optimal convergence. Then the algebraic flux correction method is recalled and we show that the present method can be interpreted as an algebraic flux correction method for a particular definition of the flux limiters. The performance of the method is illustrated on some numerical test cases in two space dimensions.

A Lie algebraic condition for exponential stability of discrete hybrid systems and application to hybrid synchronization.

PubMed

Zhao, Shouwei

2011-06-01

A Lie algebraic condition for global exponential stability of linear discrete switched impulsive systems is presented in this paper. By considering a Lie algebra generated by all subsystem matrices and impulsive matrices, when not all of these matrices are Schur stable, we derive new criteria for global exponential stability of linear discrete switched impulsive systems. Moreover, simple sufficient conditions in terms of Lie algebra are established for the synchronization of nonlinear discrete systems using a hybrid switching and impulsive control. As an application, discrete chaotic system's synchronization is investigated by the proposed method.

Capelli bitableaux and Z-forms of general linear Lie superalgebras.

PubMed Central

Brini, A; Teolis, A G

1990-01-01

The combinatorics of the enveloping algebra UQ(pl(L)) of the general linear Lie superalgebra of a finite dimensional Z2-graded Q-vector space is studied. Three non-equivalent Z-forms of UQ(pl(L)) are introduced: one of these Z-forms is a version of the Kostant Z-form and the others are Lie algebra analogs of Rota and Stein's straightening formulae for the supersymmetric algebra Super[L P] and for its dual Super[L* P*]. The method is based on an extension of Capelli's technique of variabili ausiliarie to algebras containing positively and negatively signed elements. PMID:11607048

Experiments with conjugate gradient algorithms for homotopy curve tracking

NASA Technical Reports Server (NTRS)

Irani, Kashmira M.; Ribbens, Calvin J.; Watson, Layne T.; Kamat, Manohar P.; Walker, Homer F.

1991-01-01

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

Momentum Maps and Stochastic Clebsch Action Principles

NASA Astrophysics Data System (ADS)

Cruzeiro, Ana Bela; Holm, Darryl D.; Ratiu, Tudor S.

2018-01-01

We derive stochastic differential equations whose solutions follow the flow of a stochastic nonlinear Lie algebra operation on a configuration manifold. For this purpose, we develop a stochastic Clebsch action principle, in which the noise couples to the phase space variables through a momentum map. This special coupling simplifies the structure of the resulting stochastic Hamilton equations for the momentum map. In particular, these stochastic Hamilton equations collectivize for Hamiltonians that depend only on the momentum map variable. The Stratonovich equations are derived from the Clebsch variational principle and then converted into Itô form. In comparing the Stratonovich and Itô forms of the stochastic dynamical equations governing the components of the momentum map, we find that the Itô contraction term turns out to be a double Poisson bracket. Finally, we present the stochastic Hamiltonian formulation of the collectivized momentum map dynamics and derive the corresponding Kolmogorov forward and backward equations.

The algebraic criteria for the stability of control systems

NASA Technical Reports Server (NTRS)

Cremer, H.; Effertz, F. H.

1986-01-01

This paper critically examines the standard algebraic criteria for the stability of linear control systems and their proofs, reveals important previously unnoticed connections, and presents new representations. Algebraic stability criteria have also acquired significance for stability studies of non-linear differential equation systems by the Krylov-Bogoljubov-Magnus Method, and allow realization conditions to be determined for classes of broken rational functions as frequency characteristics of electrical network.

From Earth Algebra to Earth Math: An Expansion and Dissemination of the Methods of Earth Algebra [and] Proceedings, Earth Math Conference (Kennesaw, Georgia, April 19-20, 1996).

ERIC Educational Resources Information Center

Zumoff, Nancy; Schaufele, Christopher

This final report and appended conference proceedings describe activities of the Earth Math project, a 3-year effort at Kennesaw State University (Georgia) to broaden and disseminate the concept of Earth Algebra to precalculus and mathematics education courses. Major outcomes of the project were the draft of a precalculus textbook now being…

Scaffolding the Mathematical "Connections": A New Approach to Preparing Teachers for the Teaching of Lower Secondary Algebra

ERIC Educational Resources Information Center

Ormond, Christine A.

2016-01-01

This paper discusses the results of a three-year mixed methods study into the effectiveness of a mathematics education unit. This was written for both pre-service primary education students and re-training in-service teachers, to prepare them for the teaching of pre-algebra and early algebra. The unit was taught rom 2013 to 2015 inclusively in a…

On representations of the filiform Lie superalgebra Lm,n

NASA Astrophysics Data System (ADS)

Wang, Qi; Chen, Hongjia; Liu, Wende

2015-11-01

In this paper, we study the representations for the filiform Lie superalgebras Lm,n, a particular class of nilpotent Lie superalgebras. We determine the minimal dimension of a faithful module over Lm,n using the theory of linear algebra. In addition, using the method of Feingold and Frenkel (1985), we construct some finite and infinite dimensional modules over Lm,n on the Grassmann algebra and the mixed Clifford-Weyl algebra.

Maximizing algebraic connectivity in air transportation networks

NASA Astrophysics Data System (ADS)

Wei, Peng

In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the weight assignment can not be studied separately for the problem with operating cost constraint. Therefore a relaxed SDP method with golden section search is developed to solve both at the same time. The cluster decomposition is utilized to solve large scale networks.

Hash function based on chaotic map lattices.

PubMed

Wang, Shihong; Hu, Gang

2007-06-01

A new hash function system, based on coupled chaotic map dynamics, is suggested. By combining floating point computation of chaos and some simple algebraic operations, the system reaches very high bit confusion and diffusion rates, and this enables the system to have desired statistical properties and strong collision resistance. The chaos-based hash function has its advantages for high security and fast performance, and it serves as one of the most highly competitive candidates for practical applications of hash function for software realization and secure information communications in computer networks.

Hash function based on chaotic map lattices

NASA Astrophysics Data System (ADS)

Wang, Shihong; Hu, Gang

2007-06-01

A new hash function system, based on coupled chaotic map dynamics, is suggested. By combining floating point computation of chaos and some simple algebraic operations, the system reaches very high bit confusion and diffusion rates, and this enables the system to have desired statistical properties and strong collision resistance. The chaos-based hash function has its advantages for high security and fast performance, and it serves as one of the most highly competitive candidates for practical applications of hash function for software realization and secure information communications in computer networks.

Teaching Basic Algebra Courses at the College Level

ERIC Educational Resources Information Center

Mallenby, Michel L.; Mallenby, Douglas W.

2004-01-01

Three dysfunctional behaviors of basic algebra students are described: Silence as Camouflage, Wing and a Prayer, and Ignorance is OK. These behavior patterns are explained, and beneficial teaching methods that address the weaknesses are presented.

Students’ Algebraic Thinking Process in Context of Point and Line Properties

NASA Astrophysics Data System (ADS)

Nurrahmi, H.; Suryadi, D.; Fatimah, S.

2017-09-01

Learning of schools algebra is limited to symbols and operating procedures, so students are able to work on problems that only require the ability to operate symbols but unable to generalize a pattern as one of part of algebraic thinking. The purpose of this study is to create a didactic design that facilitates students to do algebraic thinking process through the generalization of patterns, especially in the context of the property of point and line. This study used qualitative method and includes Didactical Design Research (DDR). The result is students are able to make factual, contextual, and symbolic generalization. This happen because the generalization arises based on facts on local terms, then the generalization produced an algebraic formula that was described in the context and perspective of each student. After that, the formula uses the algebraic letter symbol from the symbol t hat uses the students’ language. It can be concluded that the design has facilitated students to do algebraic thinking process through the generalization of patterns, especially in the context of property of the point and line. The impact of this study is this design can use as one of material teaching alternative in learning of school algebra.

Numerical methods on some structured matrix algebra problems

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

Jessup, E.R.

1996-06-01

This proposal concerned the design, analysis, and implementation of serial and parallel algorithms for certain structured matrix algebra problems. It emphasized large order problems and so focused on methods that can be implemented efficiently on distributed-memory MIMD multiprocessors. Such machines supply the computing power and extensive memory demanded by the large order problems. We proposed to examine three classes of matrix algebra problems: the symmetric and nonsymmetric eigenvalue problems (especially the tridiagonal cases) and the solution of linear systems with specially structured coefficient matrices. As all of these are of practical interest, a major goal of this work was tomore » translate our research in linear algebra into useful tools for use by the computational scientists interested in these and related applications. Thus, in addition to software specific to the linear algebra problems, we proposed to produce a programming paradigm and library to aid in the design and implementation of programs for distributed-memory MIMD computers. We now report on our progress on each of the problems and on the programming tools.« less

Normal forms for Poisson maps and symplectic groupoids around Poisson transversals

NASA Astrophysics Data System (ADS)

Frejlich, Pedro; Mărcuț, Ioan

2018-03-01

Poisson transversals are submanifolds in a Poisson manifold which intersect all symplectic leaves transversally and symplectically. In this communication, we prove a normal form theorem for Poisson maps around Poisson transversals. A Poisson map pulls a Poisson transversal back to a Poisson transversal, and our first main result states that simultaneous normal forms exist around such transversals, for which the Poisson map becomes transversally linear, and intertwines the normal form data of the transversals. Our second result concerns symplectic integrations. We prove that a neighborhood of a Poisson transversal is integrable exactly when the Poisson transversal itself is integrable, and in that case we prove a normal form theorem for the symplectic groupoid around its restriction to the Poisson transversal, which puts all structure maps in normal form. We conclude by illustrating our results with examples arising from Lie algebras.

Normal forms for Poisson maps and symplectic groupoids around Poisson transversals.

PubMed

Frejlich, Pedro; Mărcuț, Ioan

2018-01-01

Poisson transversals are submanifolds in a Poisson manifold which intersect all symplectic leaves transversally and symplectically. In this communication, we prove a normal form theorem for Poisson maps around Poisson transversals. A Poisson map pulls a Poisson transversal back to a Poisson transversal, and our first main result states that simultaneous normal forms exist around such transversals, for which the Poisson map becomes transversally linear, and intertwines the normal form data of the transversals. Our second result concerns symplectic integrations. We prove that a neighborhood of a Poisson transversal is integrable exactly when the Poisson transversal itself is integrable, and in that case we prove a normal form theorem for the symplectic groupoid around its restriction to the Poisson transversal, which puts all structure maps in normal form. We conclude by illustrating our results with examples arising from Lie algebras.

Sign Lines, Asymptotes, and Tangent Carriers--An Introduction to Curve Sketching.

ERIC Educational Resources Information Center

Spikell, Mark A.; Deane, William R.

This paper discusses methods of sketching various types of algebraic functions from an analysis of the portions of the plane where the curve will be found and where it will not be found. The discussion is limited to rational functions. Methods and techniques presented are applicable to the secondary mathematics curriculum from algebra through…

The algebraic decoding of the (41, 21, 9) quadratic residue code

NASA Technical Reports Server (NTRS)

Reed, Irving S.; Truong, T. K.; Chen, Xuemin; Yin, Xiaowei

1992-01-01

A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes.

Efficient discretization in finite difference method

NASA Astrophysics Data System (ADS)

Rozos, Evangelos; Koussis, Antonis; Koutsoyiannis, Demetris

2015-04-01

Finite difference method (FDM) is a plausible and simple method for solving partial differential equations. The standard practice is to use an orthogonal discretization to form algebraic approximate formulations of the derivatives of the unknown function and a grid, much like raster maps, to represent the properties of the function domain. For example, for the solution of the groundwater flow equation, a raster map is required for the characterization of the discretization cells (flow cell, no-flow cell, boundary cell, etc.), and two raster maps are required for the hydraulic conductivity and the storage coefficient. Unfortunately, this simple approach to describe the topology comes along with the known disadvantages of the FDM (rough representation of the geometry of the boundaries, wasted computational resources in the unavoidable expansion of the grid refinement in all cells of the same column and row, etc.). To overcome these disadvantages, Hunt has suggested an alternative approach to describe the topology, the use of an array of neighbours. This limits the need for discretization nodes only for the representation of the boundary conditions and the flow domain. Furthermore, the geometry of the boundaries is described more accurately using a vector representation. Most importantly, graded meshes can be employed, which are capable of restricting grid refinement only in the areas of interest (e.g. regions where hydraulic head varies rapidly, locations of pumping wells, etc.). In this study, we test the Hunt approach against MODFLOW, a well established finite difference model, and the Finite Volume Method with Simplified Integration (FVMSI). The results of this comparison are examined and critically discussed.

Semiclassical states on Lie algebras

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

Tsobanjan, Artur, E-mail: artur.tsobanjan@gmail.com

2015-03-15

The effective technique for analyzing representation-independent features of quantum systems based on the semiclassical approximation (developed elsewhere) has been successfully used in the context of the canonical (Weyl) algebra of the basic quantum observables. Here, we perform the important step of extending this effective technique to the quantization of a more general class of finite-dimensional Lie algebras. The case of a Lie algebra with a single central element (the Casimir element) is treated in detail by considering semiclassical states on the corresponding universal enveloping algebra. Restriction to an irreducible representation is performed by “effectively” fixing the Casimir condition, following themore » methods previously used for constrained quantum systems. We explicitly determine the conditions under which this restriction can be consistently performed alongside the semiclassical truncation.« less

Dolan Grady relations and noncommutative quasi-exactly solvable systems

NASA Astrophysics Data System (ADS)

Klishevich, Sergey M.; Plyushchay, Mikhail S.

2003-11-01

We investigate a U(1) gauge invariant quantum mechanical system on a 2D noncommutative space with coordinates generating a generalized deformed oscillator algebra. The Hamiltonian is taken as a quadratic form in gauge covariant derivatives obeying the nonlinear Dolan-Grady relations. This restricts the structure function of the deformed oscillator algebra to a quadratic polynomial. The cases when the coordinates form the {\\mathfrak{su}}(2) and {\\mathfrak{sl}}(2,{\\bb {R}}) algebras are investigated in detail. Reducing the Hamiltonian to 1D finite-difference quasi-exactly solvable operators, we demonstrate partial algebraization of the spectrum of the corresponding systems on the fuzzy sphere and noncommutative hyperbolic plane. A completely covariant method based on the notion of intrinsic algebra is proposed to deal with the spectral problem of such systems.

Applied Algebra: The Modeling Technique of Least Squares

ERIC Educational Resources Information Center

Zelkowski, Jeremy; Mayes, Robert

2008-01-01

The article focuses on engaging students in algebra through modeling real-world problems. The technique of least squares is explored, encouraging students to develop a deeper understanding of the method. (Contains 2 figures and a bibliography.)

Relations between elliptic multiple zeta values and a special derivation algebra

NASA Astrophysics Data System (ADS)

Broedel, Johannes; Matthes, Nils; Schlotterer, Oliver

2016-04-01

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

Bv and Bfv Formulation of a Gauge Theory of Quadratic Lie Algebras in 2d and a Construction of W3 Topological Gravity

NASA Astrophysics Data System (ADS)

Dayi, Ömer F.

The recently proposed generalized field method for solving the master equation of Batalin and Vilkovisky is applied to a gauge theory of quadratic Lie algebras in two dimensions. The charge corresponding to BRST symmetry derived from this solution in terms of the phase space variables by using the Noether procedure, and the one found due to the BFV-method are compared and found to coincide. W3-algebra, formulated in terms of a continuous variable is exploit in the mentioned gauge theory to construct a W3 topological gravity. Moreover, its gauge fixing is briefly discussed.

Propagation of Polarization Modulated Beams Through a Turbulent Atmosphere

DTIC Science & Technology

2014-11-24

Clifford Algebra to Geometric Calculus , Reidel, 1984. Hirschfelder, J.O., Curtiss, C.F. & Bird, R.B., Molecular Theory of Gases and Liquids, Wiley, 1954...are made explicit in a Poincaré sphere and geometric (Clifford) algebra representation. Section 5.0 of this report provides the evidence supporting...MEDIA 4.0 LABORATORY TEST CONFIGURATIONS 5.0 TEST RESULTS 5.1 DATA ANALYSIS METHODS 5.2 DATA ANALYSIS 6.0 GEOMETRIC ALGEBRA 6.1 INTRODUCTION

Poverty and Algebra Performance: A Comparative Spatial Analysis of a Border South State

ERIC Educational Resources Information Center

Tate, William F.; Hogrebe, Mark C.

2015-01-01

This research uses two measures of poverty, as well as mobility and selected education variables to study how their relationships vary across 543 Missouri high school districts. Using Missouri and U.S. Census American Community Survey (ACS) data, local R[superscript 2]'s from geographically weighted regressions are spatially mapped to demonstrate…

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

PubMed

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

2008-04-11

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

Numerical Methods for Forward and Inverse Problems in Discontinuous Media

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

Chartier, Timothy P.

The research emphasis under this grant's funding is in the area of algebraic multigrid methods. The research has two main branches: 1) exploring interdisciplinary applications in which algebraic multigrid can make an impact and 2) extending the scope of algebraic multigrid methods with algorithmic improvements that are based in strong analysis.The work in interdisciplinary applications falls primarily in the field of biomedical imaging. Work under this grant demonstrated the effectiveness and robustness of multigrid for solving linear systems that result from highly heterogeneous finite element method models of the human head. The results in this work also give promise tomore » medical advances possible with software that may be developed. Research to extend the scope of algebraic multigrid has been focused in several areas. In collaboration with researchers at the University of Colorado, Lawrence Livermore National Laboratory, and Los Alamos National Laboratory, the PI developed an adaptive multigrid with subcycling via complementary grids. This method has very cheap computing costs per iterate and is showing promise as a preconditioner for conjugate gradient. Recent work with Los Alamos National Laboratory concentrates on developing algorithms that take advantage of the recent advances in adaptive multigrid research. The results of the various efforts in this research could ultimately have direct use and impact to researchers for a wide variety of applications, including, astrophysics, neuroscience, contaminant transport in porous media, bi-domain heart modeling, modeling of tumor growth, and flow in heterogeneous porous media. This work has already led to basic advances in computational mathematics and numerical linear algebra and will continue to do so into the future.« less

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

PubMed

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.

Method of generating features optimal to a dataset and classifier

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

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

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

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

ERIC Educational Resources Information Center

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…

Application of geometric algebra for the description of polymer conformations.

PubMed

Chys, Pieter

2008-03-14

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

On the correspondence between boundary and bulk lattice models and (logarithmic) conformal field theories

NASA Astrophysics Data System (ADS)

Belletête, J.; Gainutdinov, A. M.; Jacobsen, J. L.; Saleur, H.; Vasseur, R.

2017-12-01

The relationship between bulk and boundary properties is one of the founding features of (rational) conformal field theory (CFT). Our goal in this paper is to explore the possibility of having an equivalent relationship in the context of lattice models. We focus on models based on the Temperley-Lieb algebra, and use the concept of ‘braid translation’, which is a natural way, in physical terms, to ‘close’ an open spin chain by adding an interaction between the first and last spins using braiding to ‘bring’ them next to each other. The interaction thus obtained is in general non-local, but has the key feature that it is expressed solely in terms of the algebra for the open spin chain—the ‘ordinary’ Temperley-Lieb algebra and its blob algebra generalization. This is in contrast with the usual periodic spin chains which involve only local interactions, and are described by the periodic Temperley-Lieb algebra. We show that for the restricted solid-on-solid models, which are known to be described by minimal unitary CFTs (with central charge c<1 ) in the continuum limit, the braid translation in fact does provide the ordinary periodic model starting from the open model with fixed (identical) boundary conditions on the two sides of the strip. This statement has a precise mathematical formulation, which is a pull-back map between irreducible modules of, respectively, the blob algebra and the affine Temperley-Lieb algebra. We then turn to the same kind of analysis for two models whose continuum limits are logarithmic CFTs (LCFTs)—the alternating gl(1\\vert 1) and sl(2\\vert 1) spin chains. We find that the result for minimal models does not hold any longer: braid translation of the relevant (in that case, indecomposable but not irreducible) modules of the Temperley-Lieb algebra does not give rise to the modules known to be present in the periodic chains. In the gl(1\\vert 1) case, the content in terms of the irreducibles is the same, as well as the spectrum, but the detailed structure (like logarithmic coupling) is profoundly different. This carries over to the continuum limit. The situation is similar for the sl(2\\vert 1) case. The problem of relating bulk and boundary lattice models for LCFTs thus remains open.

Basic Research in the Mathematical Foundations of Stability Theory, Control Theory and Numerical Linear Algebra.

DTIC Science & Technology

1979-09-01

without determinantal divisors, Linear and Multilinear Algebra 7(1979), 107-109. 4. The use of integral operators in number theory (with C. Ryavec and...Gersgorin revisited, to appear in Letters in Linear Algebra. 15. A surprising determinantal inequality for real matrices (with C.R. Johnson), to appear in...Analysis: An Essay Concerning the Limitations of Some Mathematical Methods in the Social , Political and Biological Sciences, David Berlinski, MIT Press

Algebraic methods in system theory

NASA Technical Reports Server (NTRS)

Brockett, R. W.; Willems, J. C.; Willsky, A. S.

1975-01-01

Investigations on problems of the type which arise in the control of switched electrical networks are reported. The main results concern the algebraic structure and stochastic aspects of these systems. Future reports will contain more detailed applications of these results to engineering studies.

X-ray Mapping of Terrestrial and Extraterrestrial Materials Using the Electron Microprobe

NASA Technical Reports Server (NTRS)

Carpenter, P.

2006-01-01

Lunar samples returned from the Apollo program motivated development of the Bence-Albee algorithm for the rapid and accurate analysis of lunar materials, and established interlaboratory comparability through its common use. In the analysis of mineral and rock fragments it became necessary to combine micro- and macroscopic analysis by coupling electron-probe microanalysis (EPMA) with automated stage point counting. A coarse grid that included several thousand points was used, and initially wavelength-dispersive (WDS) and later energydispersive (EDS) data were acquired at discrete stage points using approx. 5 sec count times. A approx 50 micrometer beam diameter was used for WDS and up to 500 micrometer beam diameter for EDS analysis. Average analyses of discretely sampled phases were coupled with the point count data to calculate the bulk composition using matrix algebra. Use of a defocused beam resulted in a contribution from multiple phases to each analytical point, and the analytical data were deconvolved relative to end-member phase chemistry on the fly. Impressive agreement was obtained between WDS and EDS measurements as well as comparison with bulk chemistry obtained by other methods. In the 30 years since these methods were developed, significant improvements in EPMA automation and computer processing have taken place. Digital beam control allows routine collection of x-ray maps by EDS, and stage mapping for WDS is conducted continuously at slew speed and incrementally by sampling at discrete points. Digital pulse processing in EDS systems has significantly increased the throughput for EDS mapping, and the ongoing development of Si-drift detector systems promises mapping capabilities rivaling WDS systems. Spectrum imaging allows a data cube of EDS spectra to be acquired and sophisticated processing of the original data is possible using matrix algebra techniques. The study of lunar and meteoritic materials includes the need to conveniently: (1) Characterize the sample at microscopic and macroscopic scales with relatively high sensitivity, (2) Determine the modal abundance of minerals, and (3) Identify and relocate discrete features of interest in terms of size and chemistry. The coupled substitution of cations in minerals can result in significant variation in mineral chemistry, but at similar average Z, leading to poor backscattered-electron (BSE) contrast discrimination of mineralogy. It is necessary to discriminate phase chemistry at both the trace element level and the major element level. To date, the WDS of microprobe systems is preferred for mapping due to high throughput and the ability to obtain the necessary intensity to discriminate phases at both trace and major element concentrations. It is desirable to produce fully quantitative compositional maps of geological materials, which requires the acquisition of k-ratio maps that are background and dead-time corrected, and which have been corrected by phi(delta z> or an equivalent algorithm at each pixel. To date, turnkey systems do not allow the acquisition of k-ratio maps and the rigorous correction in this manner. X-ray maps of a chondrule from the Ourique meteorite, and a comb-layered xenolith from the San Francisco volcanic field, have been analyzed and processed to extract phase information. The Ourique meteorite presents a challenge due to relatively low BSE contrast, and has been studied using spectrum imaging. X-ray maps for Si, Mg, and FeK(alpha) were used to produce RGB images. The xenolith sample contains sector-zoned augite, olivine, plagioclase, and basaltic glass. X-ray maps were processed using Lispix and ImageJ software to produce mineral phase maps. The x-ray maps for Mg, Ca, and Ti were used with traceback to generate binary images that were converted to RGB images. These approaches are successful in discriminating phases, but it is desirable to achieve the methods that were used on lunar samples 30 years ago on current microprobe systems. Curnt research includes x-ray mapping analysis of the Dalgety Downs chondrite by micro x-ray fluorescence and spectrum imaging, in collaboration with Kenny Witherspoon of IXRF Systems and Dale Newbury of NIST.

Lie algebraic approach to the time-dependent quantum general harmonic oscillator and the bi-dimensional charged particle in time-dependent electromagnetic fields

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

Ibarra-Sierra, V.G.; Sandoval-Santana, J.C.; Cardoso, J.L.

We discuss the one-dimensional, time-dependent general quadratic Hamiltonian and the bi-dimensional charged particle in time-dependent electromagnetic fields through the Lie algebraic approach. Such method consists in finding a set of generators that form a closed Lie algebra in terms of which it is possible to express a quantum Hamiltonian and therefore the evolution operator. The evolution operator is then the starting point to obtain the propagator as well as the explicit form of the Heisenberg picture position and momentum operators. First, the set of generators forming a closed Lie algebra is identified for the general quadratic Hamiltonian. This algebra ismore » later extended to study the Hamiltonian of a charged particle in electromagnetic fields exploiting the similarities between the terms of these two Hamiltonians. These results are applied to the solution of five different examples: the linear potential which is used to introduce the Lie algebraic method, a radio frequency ion trap, a Kanai–Caldirola-like forced harmonic oscillator, a charged particle in a time dependent magnetic field, and a charged particle in constant magnetic field and oscillating electric field. In particular we present exact analytical expressions that are fitting for the study of a rotating quadrupole field ion trap and magneto-transport in two-dimensional semiconductor heterostructures illuminated by microwave radiation. In these examples we show that this powerful method is suitable to treat quadratic Hamiltonians with time dependent coefficients quite efficiently yielding closed analytical expressions for the propagator and the Heisenberg picture position and momentum operators. -- Highlights: •We deal with the general quadratic Hamiltonian and a particle in electromagnetic fields. •The evolution operator is worked out through the Lie algebraic approach. •We also obtain the propagator and Heisenberg picture position and momentum operators. •Analytical expressions for a rotating quadrupole field ion trap are presented. •Exact solutions for magneto-transport in variable electromagnetic fields are shown.« less

Lecture Notes on Topics in Accelerator Physics

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

Chao, Alex W.

These are lecture notes that cover a selection of topics, some of them under current research, in accelerator physics. I try to derive the results from first principles, although the students are assumed to have an introductory knowledge of the basics. The topics covered are: (1) Panofsky-Wenzel and Planar Wake Theorems; (2) Echo Effect; (3) Crystalline Beam; (4) Fast Ion Instability; (5) Lawson-Woodward Theorem and Laser Acceleration in Free Space; (6) Spin Dynamics and Siberian Snakes; (7) Symplectic Approximation of Maps; (8) Truncated Power Series Algebra; and (9) Lie Algebra Technique for nonlinear Dynamics. The purpose of these lectures ismore » not to elaborate, but to prepare the students so that they can do their own research. Each topic can be read independently of the others.« less

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

Kozlov, I K

In this paper we study topological properties of an integrable case for Euler's equations on the Lie algebra so(4), which can be regarded as an analogue of the classical Kovalevskaya case in rigid body dynamics. In particular, for all values of the parameters of the system under consideration, the bifurcation diagrams of the momentum mapping are constructed, the types of critical points of rank 0 are determined, the bifurcations of Liouville tori are described, and the loop molecules are computed for all singular points of the bifurcation diagrams. It follows from the obtained results that some topological properties of the classicalmore » Kovalevskaya case can be obtained from the corresponding properties of the considered integrable case on the Lie algebra so(4) by taking a natural limit. Bibliography: 21 titles.« less

Fast multipole method using Cartesian tensor in beam dynamic simulation

DOE PAGES

Zhang, He; Huang, He; Li, Rui; ...

2017-03-06

Here, the fast multipole method (FMM) using traceless totally symmetric Cartesian tensor to calculate the Coulomb interaction between charged particles will be presented. The Cartesian tensor-based FMM can be generalized to treat other non-oscillating interactions with the help of the differential algebra or the truncated power series algebra. Issues on implementation of the FMM in beam dynamic simulations are also discussed.

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

NASA Astrophysics Data System (ADS)

Man, Yiu-Kwong

2010-10-01

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

Analysis of algebraic reasoning ability of cognitive style perspectives on field dependent field independent and gender

NASA Astrophysics Data System (ADS)

Rosita, N. T.

2018-03-01

The purpose of this study is to analyse algebraic reasoning ability using the SOLO model as a theoretical framework to assess students’ algebraic reasoning abilities of Field Dependent cognitive (FD), Field Independent (FI) and Gender perspectives. The method of this study is a qualitative research. The instrument of this study is the researcher himself assisted with algebraic reasoning tests, the problems have been designed based on NCTM indicators and algebraic reasoning according to SOLO model. While the cognitive style of students is determined using Group Embedded Figure Test (GEFT), as well as interviews on the subject as triangulation. The subjects are 15 female and 15 males of the sixth semester students of mathematics education, STKIP Sebelas April. The results of the qualitative data analysis is that most subjects are at the level of unistructural and multi-structural, subjects at the relational level have difficulty in forming a new linear pattern. While the subjects at the extended abstract level are able to meet all the indicators of algebraic reasoning ability even though some of the answers are not perfect yet. Subjects of FI tend to have higher algebraic reasoning abilities than of the subject of FD.

Celestial mechanics with geometric algebra

NASA Technical Reports Server (NTRS)

Hestenes, D.

1983-01-01

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

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

Kwasniewski, Bartosz K

The construction of reversible extensions of dynamical systems presented in a previous paper by the author and A.V. Lebedev is enhanced, so that it applies to arbitrary mappings (not necessarily with open range). It is based on calculating the maximal ideal space of C*-algebras that extends endomorphisms to partial automorphisms via partial isometric representations, and involves a new set of 'parameters' (the role of parameters is played by chosen sets or ideals). As model examples, we give a thorough description of reversible extensions of logistic maps and a classification of systems associated with compression of unitaries generating homeomorphisms of themore » circle. Bibliography: 34 titles.« less

Metaphorical motion in mathematical reasoning: further evidence for pre-motor implementation of structure mapping in abstract domains.

PubMed

Fields, Chris

2013-08-01

The theory of computation and category theory both employ arrow-based notations that suggest that the basic metaphor "state changes are like motions" plays a fundamental role in all mathematical reasoning involving formal manipulations. If this is correct, structure-mapping inferences implemented by the pre-motor action planning system can be expected to be involved in solving any mathematics problems not solvable by table lookups and number line manipulations alone. Available functional imaging studies of multi-digit arithmetic, algebra, geometry and calculus problem solving are consistent with this expectation.

Loop Quantization and Symmetry: Configuration Spaces

NASA Astrophysics Data System (ADS)

Fleischhack, Christian

2018-06-01

Given two sets S 1, S 2 and unital C *-algebras A_1, A_2 of functions thereon, we show that a map {σ : {S}_1 \\longrightarrow {S}_2} can be lifted to a continuous map \\barσ : spec A_1 \\longrightarrow spec A_2 iff σ^\\ast A_2 := σ^\\ast f | f \\in A_2 \\subseteq A_1. Moreover, \\bar σ is unique if existing, and injective iff σ^\\ast A_2 is dense. Then, we apply these results to loop quantum gravity and loop quantum cosmology. For all usual technical conventions, we decide whether the cosmological quantum configuration space is embedded into the gravitational one; indeed, both are spectra of some C *-algebras, say, A_cosm and A_grav, respectively. Typically, there is no embedding, but one can always get an embedding by the defining A_cosm := C^\\ast(σ^\\ast A_grav), where {σ} denotes the embedding between the classical configuration spaces. Finally, we explicitly determine {C^\\ast(σ^\\ast A_grav) in the homogeneous isotropic case for A_grav generated by the matrix functions of parallel transports along analytic paths. The cosmological quantum configuration space so equals the disjoint union of R and the Bohr compactification of R, appropriately glued together.

Loop Quantization and Symmetry: Configuration Spaces

NASA Astrophysics Data System (ADS)

Fleischhack, Christian

2018-04-01

Given two sets S 1, S 2 and unital C *-algebras A_1, A_2 of functions thereon, we show that a map σ : S_1 \\longrightarrow S_2 can be lifted to a continuous map \\barσ : spec A_1 \\longrightarrow spec A_2 iff σ^\\ast A_2 := σ^\\ast f | f \\in A_2 \\subseteq A_1. Moreover, \\bar σ is unique if existing, and injective iff {σ^\\ast A_2 is dense. Then, we apply these results to loop quantum gravity and loop quantum cosmology. For all usual technical conventions, we decide whether the cosmological quantum configuration space is embedded into the gravitational one; indeed, both are spectra of some C *-algebras, say, A_cosm and A_grav, respectively. Typically, there is no embedding, but one can always get an embedding by the defining A_cosm := C^\\ast(σ^\\ast A_grav), where σ denotes the embedding between the classical configuration spaces. Finally, we explicitly determine C^\\ast(σ^\\ast A_grav) in the homogeneous isotropic case for A_grav generated by the matrix functions of parallel transports along analytic paths. The cosmological quantum configuration space so equals the disjoint union of R and the Bohr compactification of R , appropriately glued together.

Topological T-duality, automorphisms and classifying spaces

NASA Astrophysics Data System (ADS)

Pande, Ashwin S.

2014-08-01

We extend the formalism of Topological T-duality to spaces which are the total space of a principal S1-bundle p:E→W with an H-flux in H3(E,Z) together with an automorphism of the continuous-trace algebra on E determined by H. The automorphism is a ‘topological approximation’ to a gerby gauge transformation of spacetime. We motivate this physically from Buscher’s Rules for T-duality. Using the Equivariant Brauer Group, we connect this problem to the C∗-algebraic formalism of Topological T-duality of Mathai and Rosenberg (2005). We show that the study of this problem leads to the study of a purely topological problem, namely, Topological T-duality of triples (p,b,H) consisting of isomorphism classes of a principal circle bundle p:X→B and classes b∈H2(X,Z) and H∈H3(X,Z). We construct a classifying space R for triples in a manner similar to the work of Bunke and Schick (2005). We characterize R up to homotopy and study some of its properties. We show that it possesses a natural self-map which induces T-duality for triples. We study some properties of this map.

Analysis of Secondary School Students’ Algebraic Thinking and Math-Talk Learning Community to Help Students Learn

NASA Astrophysics Data System (ADS)

Nurhayati, D. M.; Herman, T.; Suhendra, S.

2017-09-01

This study aims to determine the difficulties of algebraic thinking ability of students in one of secondary school on quadrilateral subject and to describe Math-Talk Learning Community as the alternative way that can be done to overcome the difficulties of the students’ algebraic thinking ability. Research conducted by using quantitative approach with descriptive method. The population in this research was all students of that school and twenty three students as the sample that was chosen by purposive sampling technique. Data of algebraic thinking were collected through essay test. The results showed the percentage of achievement of students’ algebraic thinking’s indicators on three aspects: a) algebra as generalized arithmetic with the indicators (conceptually based computational strategies and estimation); b) algebra as the language of mathematics (meaning of variables, variable expressions and meaning of solution); c) algebra as a tool for functions and mathematical modelling (representing mathematical ideas using equations, tables, or words and generalizing patterns and rules in real-world contexts) is still low. It is predicted that because the secondary school students was not familiar with the abstract problem and they are still at a semi-concrete stage where the stage of cognitive development is between concrete and abstract. Based on the percentage achievement of each indicators, it can be concluded that the level of achievement of student’s mathematical communication using conventional learning is still low, so students’ algebraic thinking ability need to be improved.

Minimal unitary representation of 5d superconformal algebra F(4) and AdS 6/CFT 5 higher spin (super)-algebras

DOE PAGES

Fernando, Sudarshan; Günaydin, Murat

2014-11-28

We study the minimal unitary representation (minrep) of SO(5, 2), obtained by quantization of its geometric quasiconformal action, its deformations and supersymmetric extensions. The minrep of SO(5, 2) describes a massless conformal scalar field in five dimensions and admits a unique “deformation” which describes a massless conformal spinor. Scalar and spinor minreps of SO(5, 2) are the 5d analogs of Dirac’s singletons of SO(3, 2). We then construct the minimal unitary representation of the unique 5d supercon-formal algebra F(4) with the even subalgebra SO(5, 2) ×SU(2). The minrep of F(4) describes a massless conformal supermultiplet consisting of two scalar andmore » one spinor fields. We then extend our results to the construction of higher spin AdS 6/CFT 5 (super)-algebras. The Joseph ideal of the minrep of SO(5, 2) vanishes identically as operators and hence its enveloping algebra yields the AdS 6/CFT 5 bosonic higher spin algebra directly. The enveloping algebra of the spinor minrep defines a “deformed” higher spin algebra for which a deformed Joseph ideal vanishes identically as operators. These results are then extended to the construction of the unique higher spin AdS 6/CFT 5 superalgebra as the enveloping algebra of the minimal unitary realization of F(4) obtained by the quasiconformal methods.« less

A characterization of positive linear maps and criteria of entanglement for quantum states

NASA Astrophysics Data System (ADS)

Hou, Jinchuan

2010-09-01

Let H and K be (finite- or infinite-dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from {\\mathcal B}(H) into {\\mathcal B}(K) is given, which particularly gives a characterization of positive elementary operators including all positive linear maps between matrix algebras. This characterization is then applied to give a representation of quantum channels (operations) between infinite-dimensional systems. A necessary and sufficient criterion of separability is given which shows that a state ρ on HotimesK is separable if and only if (ΦotimesI)ρ >= 0 for all positive finite-rank elementary operators Φ. Examples of NCP and indecomposable positive linear maps are given and are used to recognize some entangled states that cannot be recognized by the PPT criterion and the realignment criterion.

Invariant algebraic surfaces for a virus dynamics

NASA Astrophysics Data System (ADS)

Valls, Claudia

2015-08-01

In this paper, we provide a complete classification of the invariant algebraic surfaces and of the rational first integrals for a well-known virus system. In the proofs, we use the weight-homogeneous polynomials and the method of characteristic curves for solving linear partial differential equations.

Local algebraic analysis of differential systems

NASA Astrophysics Data System (ADS)

Kaptsov, O. V.

2015-06-01

We propose a new approach for studying the compatibility of partial differential equations. This approach is a synthesis of the Riquier method, Gröbner basis theory, and elements of algebraic geometry. As applications, we consider systems including the wave equation and the sine-Gordon equation.

Characterizing Preservice Teachers' Mathematical Understanding of Algebraic Relationships

ERIC Educational Resources Information Center

Nillas, Leah A.

2010-01-01

Qualitative research methods were employed to investigate characterization of preservice teachers' mathematical understanding. Responses on test items involving algebraic relationships were analyzed using with-in case analysis (Miles and Huberman, 1994) and Pirie and Kieren's (1994) model of growth of mathematical understanding. Five elementary…

Chern-Simons, Wess-Zumino and other cocycles from Kashiwara-Vergne and associators

NASA Astrophysics Data System (ADS)

Alekseev, Anton; Naef, Florian; Xu, Xiaomeng; Zhu, Chenchang

2018-03-01

Descent equations play an important role in the theory of characteristic classes and find applications in theoretical physics, e.g., in the Chern-Simons field theory and in the theory of anomalies. The second Chern class (the first Pontrjagin class) is defined as p= < F, F> where F is the curvature 2-form and < \\cdot , \\cdot > is an invariant scalar product on the corresponding Lie algebra g. The descent for p gives rise to an element ω =ω _3+ω _2+ω _1+ω _0 of mixed degree. The 3-form part ω _3 is the Chern-Simons form. The 2-form part ω _2 is known as the Wess-Zumino action in physics. The 1-form component ω _1 is related to the canonical central extension of the loop group LG. In this paper, we give a new interpretation of the low degree components ω _1 and ω _0. Our main tool is the universal differential calculus on free Lie algebras due to Kontsevich. We establish a correspondence between solutions of the first Kashiwara-Vergne equation in Lie theory and universal solutions of the descent equation for the second Chern class p. In more detail, we define a 1-cocycle C which maps automorphisms of the free Lie algebra to one forms. A solution of the Kashiwara-Vergne equation F is mapped to ω _1=C(F). Furthermore, the component ω _0 is related to the associator Φ corresponding to F. It is surprising that while F and Φ satisfy the highly nonlinear twist and pentagon equations, the elements ω _1 and ω _0 solve the linear descent equation.

QuBiLS-MIDAS: a parallel free-software for molecular descriptors computation based on multilinear algebraic maps.

PubMed

García-Jacas, César R; Marrero-Ponce, Yovani; Acevedo-Martínez, Liesner; Barigye, Stephen J; Valdés-Martiní, José R; Contreras-Torres, Ernesto

2014-07-05

The present report introduces the QuBiLS-MIDAS software belonging to the ToMoCoMD-CARDD suite for the calculation of three-dimensional molecular descriptors (MDs) based on the two-linear (bilinear), three-linear, and four-linear (multilinear or N-linear) algebraic forms. Thus, it is unique software that computes these tensor-based indices. These descriptors, establish relations for two, three, and four atoms by using several (dis-)similarity metrics or multimetrics, matrix transformations, cutoffs, local calculations and aggregation operators. The theoretical background of these N-linear indices is also presented. The QuBiLS-MIDAS software was developed in the Java programming language and employs the Chemical Development Kit library for the manipulation of the chemical structures and the calculation of the atomic properties. This software is composed by a desktop user-friendly interface and an Abstract Programming Interface library. The former was created to simplify the configuration of the different options of the MDs, whereas the library was designed to allow its easy integration to other software for chemoinformatics applications. This program provides functionalities for data cleaning tasks and for batch processing of the molecular indices. In addition, it offers parallel calculation of the MDs through the use of all available processors in current computers. The studies of complexity of the main algorithms demonstrate that these were efficiently implemented with respect to their trivial implementation. Lastly, the performance tests reveal that this software has a suitable behavior when the amount of processors is increased. Therefore, the QuBiLS-MIDAS software constitutes a useful application for the computation of the molecular indices based on N-linear algebraic maps and it can be used freely to perform chemoinformatics studies. Copyright © 2014 Wiley Periodicals, Inc.

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

PubMed Central

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

2014-01-01

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

Global exponential stability of octonion-valued neural networks with leakage delay and mixed delays.

PubMed

Popa, Călin-Adrian

2018-06-08

This paper discusses octonion-valued neural networks (OVNNs) with leakage delay, time-varying delays, and distributed delays, for which the states, weights, and activation functions belong to the normed division algebra of octonions. The octonion algebra is a nonassociative and noncommutative generalization of the complex and quaternion algebras, but does not belong to the category of Clifford algebras, which are associative. In order to avoid the nonassociativity of the octonion algebra and also the noncommutativity of the quaternion algebra, the Cayley-Dickson construction is used to decompose the OVNNs into 4 complex-valued systems. By using appropriate Lyapunov-Krasovskii functionals, with double and triple integral terms, the free weighting matrix method, and simple and double integral Jensen inequalities, delay-dependent criteria are established for the exponential stability of the considered OVNNs. The criteria are given in terms of complex-valued linear matrix inequalities, for two types of Lipschitz conditions which are assumed to be satisfied by the octonion-valued activation functions. Finally, two numerical examples illustrate the feasibility, effectiveness, and correctness of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

Quantum Superalgebras at Roots of Unity and Topological Invariants of Three-manifolds

NASA Astrophysics Data System (ADS)

Blumen, Sacha C.

2006-01-01

The general method of Reshetikhin and Turaev is followed to develop topological invariants of closed, connected, orientable 3-manifolds from a new class of algebras called pseudo-modular Hopf algebras. Pseudo-modular Hopf algebras are a class of Z_2-graded ribbon Hopf algebras that generalise the concept of a modular Hopf algebra. The quantum superalgebra U_q(osp(1|2n)) over C is considered with q a primitive N^th root of unity for all integers N >= 3. For such a q, a certain left ideal I of U_q(osp(1|2n)) is also a two-sided Hopf ideal, and the quotient algebra U_q^(N)(osp(1|2n)) = U_q(osp(1|2n)) / I is a Z_2-graded ribbon Hopf algebra. For all n and all N >= 3, a finite collection of finite dimensional representations of U_q^(N)(osp(1|2n)) is defined. Each such representation of U_q^(N)(osp(1|2n)) is labelled by an integral dominant weight belonging to the truncated dominant Weyl chamber. Properties of these representations are considered: the quantum superdimension of each representation is calculated, each representation is shown to be self-dual, and more importantly, the decomposition of the tensor product of an arbitrary number of such representations is obtained for even N. It is proved that the quotient algebra U_q^(N)(osp(1|2n)), together with the set of finite dimensional representations discussed above, form a pseudo-modular Hopf algebra when N >= 6 is twice an odd number. Using this pseudo-modular Hopf algebra, we construct a topological invariant of 3-manifolds. This invariant is shown to be different to the topological invariants of 3-manifolds arising from quantum so(2n+1) at roots of unity.

Three-dimensional trend mapping from wire-line logs

USGS Publications Warehouse

Doveton, J.H.; Ke-an, Z.

1985-01-01

Mapping of lithofacies and porosities of stratigraphic units is complicated because these properties vary in three dimensions. The method of moments was proposed by Krumbein and Libby (1957) as a technique to aid in resolving this problem. Moments are easily computed from wireline logs and are simple statistics which summarize vertical variation in a log trace. Combinations of moment maps have proved useful in understanding vertical and lateral changes in lithology of sedimentary rock units. Although moments have meaning both as statistical descriptors and as mechanical properties, they also define polynomial curves which approximate lithologic changes as a function of depth. These polynomials can be fitted by least-squares methods, partitioning major trends in rock properties from finescale fluctuations. Analysis of variance yields the degree of fit of any polynomial and measures the proportion of vertical variability expressed by any moment or combination of moments. In addition, polynomial curves can be differentiated to determine depths at which pronounced expressions of facies occur and to determine the locations of boundaries between major lithologic subdivisions. Moments can be estimated at any location in an area by interpolating from log moments at control wells. A matrix algebra operation then converts moment estimates to coefficients of a polynomial function which describes a continuous curve of lithologic variation with depth. If this procedure is applied to a grid of geographic locations, the result is a model of variability in three dimensions. Resolution of the model is determined largely by number of moments used in its generation. The method is illustrated with an analysis of lithofacies in the Simpson Group of south-central Kansas; the three-dimensional model is shown as cross sections and slice maps. In this study, the gamma-ray log is used as a measure of shaliness of the unit. However, the method is general and can be applied, for example, to suites of neutron, density, or sonic logs to produce three-dimensional models of porosity in reservoir rocks. ?? 1985 Plenum Publishing Corporation.

Lie algebras and linear differential equations.

NASA Technical Reports Server (NTRS)

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.

Extensions of algebraic image operators: An approach to model-based vision

NASA Technical Reports Server (NTRS)

Lerner, Bao-Ting; Morelli, Michael V.

1990-01-01

Researchers extend their previous research on a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, researchers devised an innovative, efficient edge detection scheme. An accurate method for deriving gradient component information from this edge detector is presented. Based upon this new edge detection system researchers developed a robust method for linear feature extraction by combining the techniques of a Hough transform and a line follower. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The algebraic operators are global operations which are easily reconfigured to operate on any size or shape region. This provides a natural platform from which to pursue dynamic scene analysis. A method for optimizing the linear feature extractor which capitalizes on the spatially reconfiguration nature of the edge detector/gradient component operator is discussed.

Networks of open systems

NASA Astrophysics Data System (ADS)

Lerman, Eugene

2018-08-01

Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with collaborators formalized these kinds of structures (systems of systems) as algebras over presentable colored operads (Spivak, 2013; Rupel and Spivak, 2013; Vagner et al., 2015). It is also very useful to consider maps between dynamical systems. This is the point of view taken by DeVille and Lerman in the study of dynamics on networks (DeVille and Lerman, 2015 [4,5]; DeVille and Lerman, 2010). The work of DeVille and Lerman was inspired by the coupled cell networks of Golubitsky, Stewart and their collaborators (Stewart et al., 2003; Golubitsky et al., 2005; Golubitsky and Stewart, 2006). The goal of this paper is to describe an algebraic structure that encompasses both approaches to systems of systems. More specifically we define a double category of open systems and construct a functor from this double category to the double category of vector spaces, linear maps and linear relations. This allows us, on one hand, to build new open systems out of collections of smaller open subsystems and on the other to keep track of maps between open systems. Consequently we obtain synchrony results for open systems which generalize the synchrony results of Golubitsky, Stewart and their collaborators for groupoid invariant vector fields on coupled cell networks.

Implicit Runge-Kutta Methods with Explicit Internal Stages

NASA Astrophysics Data System (ADS)

Skvortsov, L. M.

2018-03-01

The main computational costs of implicit Runge-Kutta methods are caused by solving a system of algebraic equations at every step. By introducing explicit stages, it is possible to increase the stage (or pseudo-stage) order of the method, which makes it possible to increase the accuracy and avoid reducing the order in solving stiff problems, without additional costs of solving algebraic equations. The paper presents implicit methods with an explicit first stage and one or two explicit internal stages. The results of solving test problems are compared with similar methods having no explicit internal stages.

Symbolic Algebra Development for Higher-Order Electron Propagator Formulation and Implementation.

PubMed

Tamayo-Mendoza, Teresa; Flores-Moreno, Roberto

2014-06-10

Through the use of symbolic algebra, implemented in a program, the algebraic expression of the elements of the self-energy matrix for the electron propagator to different orders were obtained. In addition, a module for the software package Lowdin was automatically generated. Second- and third-order electron propagator results have been calculated to test the correct operation of the program. It was found that the Fortran 90 modules obtained automatically with our algorithm succeeded in calculating ionization energies with the second- and third-order electron propagator in the diagonal approximation. The strategy for the development of this symbolic algebra program is described in detail. This represents a solid starting point for the automatic derivation and implementation of higher-order electron propagator methods.

Operator pencil passing through a given operator

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

Biggs, A., E-mail: khudian@manchester.ac.uk, E-mail: adam.biggs@student.manchester.ac.uk; Khudaverdian, H. M., E-mail: khudian@manchester.ac.uk, E-mail: adam.biggs@student.manchester.ac.uk

Let Δ be a linear differential operator acting on the space of densities of a given weight λ{sub 0} on a manifold M. One can consider a pencil of operators Π-circumflex(Δ)=(Δ{sub λ}) passing through the operator Δ such that any Δ{sub λ} is a linear differential operator acting on densities of weight λ. This pencil can be identified with a linear differential operator Δ-circumflex acting on the algebra of densities of all weights. The existence of an invariant scalar product in the algebra of densities implies a natural decomposition of operators, i.e., pencils of self-adjoint and anti-self-adjoint operators. We studymore » lifting maps that are on one hand equivariant with respect to divergenceless vector fields, and, on the other hand, with values in self-adjoint or anti-self-adjoint operators. In particular, we analyze the relation between these two concepts, and apply it to the study of diff (M)-equivariant liftings. Finally, we briefly consider the case of liftings equivariant with respect to the algebra of projective transformations and describe all regular self-adjoint and anti-self-adjoint liftings. Our constructions can be considered as a generalisation of equivariant quantisation.« less

A Categorification of the Crystal Isomorphism B 1,1 B + B(Lambda i) = B(Lambdasigma (i) and a Graphical Calculus for the Shifted Symmetric Functions

NASA Astrophysics Data System (ADS)

Kvinge, Henry

We prove two results at the intersection of Lie theory and the representation theory of symmetric groups, Hecke algebras, and their generalizations. The first is a categorification of the crystal isomorphism B. (1,1) tensor B1,1 ⊕ B(Lambdai ) ≅ B(Lambdasigma (i)). Here B(Lambdai and B(Lambda sigma(i)) are two affine type highest weight crystals of weight Lambdai and Lambdasigma (i) respectively, sigma is a specific map from the Dynkin indexing set I to itself, and B1,1 is a Kirillov-Reshetikhin crystal. We show that this crystal isomorphism is in fact the shadow of a richer module-theoretic phenomenon in the representation theory of Khovanov-Lauda-Rouquier algebras of classical affine type. Our second result identifies the center EndH'( 1) of Khovanov's Heisenberg category H', as the algebra of shifted symmetric functions Lambda* of Okounkov and Olshanski, i.e. End H'(1) ≅ Lambda*. This isomorphism provides us with a graphical calculus for Lambda*. It also allows us to describe EndH'(1) in terms of the transition and co-transition measure of Kerov and the noncommutative probability spaces of Biane.

Branes and the Kraft-Procesi transition: classical case

NASA Astrophysics Data System (ADS)

Cabrera, Santiago; Hanany, Amihay

2018-04-01

Moduli spaces of a large set of 3 d N=4 effective gauge theories are known to be closures of nilpotent orbits. This set of theories has recently acquired a special status, due to Namikawa's theorem. As a consequence of this theorem, closures of nilpotent orbits are the simplest non-trivial moduli spaces that can be found in three dimensional theories with eight supercharges. In the early 80's mathematicians Hanspeter Kraft and Claudio Procesi characterized an inclusion relation between nilpotent orbit closures of the same classical Lie algebra. We recently [1] showed a physical realization of their work in terms of the motion of D3-branes on the Type IIB superstring embedding of the effective gauge theories. This analysis is restricted to A-type Lie algebras. The present note expands our previous discussion to the remaining classical cases: orthogonal and symplectic algebras. In order to do so we introduce O3-planes in the superstring description. We also find a brane realization for the mathematical map between two partitions of the same integer number known as collapse. Another result is that basic Kraft-Procesi transitions turn out to be described by the moduli space of orthosymplectic quivers with varying boundary conditions.

Extended hybrid-space SENSE for EPI: Off-resonance and eddy current corrected joint interleaved blip-up/down reconstruction.

PubMed

Zahneisen, Benjamin; Aksoy, Murat; Maclaren, Julian; Wuerslin, Christian; Bammer, Roland

2017-06-01

Geometric distortions along the phase encode direction caused by off-resonant spins are still a major issue in EPI based functional and diffusion imaging. If the off-resonance map is known it is possible to correct for distortions. Most correction methods operate as a post-processing step on the reconstructed magnitude images. Here, we present an algebraic reconstruction method (hybrid-space SENSE) that incorporates a physics based model of off-resonances, phase inconsistencies between k-space segments, and T2*-decay during the acquisition. The method can be used to perform a joint reconstruction of interleaved acquisitions with normal (blip-up) and inverted (blip-down) phase encode direction which results in reduced g-factor penalty. A joint blip-up/down simultaneous multi slice (SMS) reconstruction for SMS-factor 4 in combination with twofold in-plane acceleration leads to a factor of two decrease in maximum g-factor penalty while providing off-resonance and eddy-current corrected images. We provide an algebraic framework for reconstructing diffusion weighted EPI data that in addition to the general applicability of hybrid-space SENSE to 2D-EPI, SMS-EPI and 3D-EPI with arbitrary k-space coverage along z, allows for a modeling of arbitrary spatio-temporal effects during the acquisition period like off-resonances, phase inconsistencies and T2*-decay. The most immediate benefit is a reduction in g-factor penalty if an interleaved blip-up/down acquisition strategy is chosen which facilitates eddy current estimation and ensures no loss in k-space encoding in regions with strong off-resonance gradients. Copyright © 2017 Elsevier Inc. All rights reserved.

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

Fernando, Sudarshan; Günaydin, Murat

We study the minimal unitary representation (minrep) of SO(5, 2), obtained by quantization of its geometric quasiconformal action, its deformations and supersymmetric extensions. The minrep of SO(5, 2) describes a massless conformal scalar field in five dimensions and admits a unique “deformation” which describes a massless conformal spinor. Scalar and spinor minreps of SO(5, 2) are the 5d analogs of Dirac’s singletons of SO(3, 2). We then construct the minimal unitary representation of the unique 5d supercon-formal algebra F(4) with the even subalgebra SO(5, 2) ×SU(2). The minrep of F(4) describes a massless conformal supermultiplet consisting of two scalar andmore » one spinor fields. We then extend our results to the construction of higher spin AdS 6/CFT 5 (super)-algebras. The Joseph ideal of the minrep of SO(5, 2) vanishes identically as operators and hence its enveloping algebra yields the AdS 6/CFT 5 bosonic higher spin algebra directly. The enveloping algebra of the spinor minrep defines a “deformed” higher spin algebra for which a deformed Joseph ideal vanishes identically as operators. These results are then extended to the construction of the unique higher spin AdS 6/CFT 5 superalgebra as the enveloping algebra of the minimal unitary realization of F(4) obtained by the quasiconformal methods.« less

Using linear algebra for protein structural comparison and classification

PubMed Central

2009-01-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. PMID:21637532

Using linear algebra for protein structural comparison and classification.

PubMed

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.

On Geometric and Algebraic Aspects of 3D Affine and Projective Structures from Perspective 2D Views

DTIC Science & Technology

1993-07-01

June 1992. an ideal lint (has no image ,n /th rteal plane) and [5] O.D. Faugeras. Q.T. Luong, and S.J. Maybank . uhich maps non-collhnearpoints A. B.C...projection for tire. Italy, .lune 1992. any giei aftin( transformation of the plane. [6 O.D. Faugeras and S. Maybank . Motion from point matches

Motivating the Concept of Eigenvectors via Cryptography

ERIC Educational Resources Information Center

Siap, Irfan

2008-01-01

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

A new application of algebraic geometry to systems theory

NASA Technical Reports Server (NTRS)

Martin, C. F.; Hermann, R.

1976-01-01

Following an introduction to algebraic geometry, the dominant morphism theorem is stated, and the application of this theorem to systems-theoretic problems, such as the feedback problem, is discussed. The Gaussian elimination method used for solving linear equations is shown to be an example of a dominant morphism.

Middle Grade Students' Concept Images of Algebraic Concepts

ERIC Educational Resources Information Center

Tekin-Sitrava, Reyhan

2017-01-01

This study investigates middle school students' concept images of algebraic concepts which are term, constant term, variable, and coefficient. Also, the study aimed to explore their performances in defining these concepts correctly. A phenomenological method was used to support methodological perspective and to reveal the findings of the study.…

Combinatorial Formulas for Characteristic Classes, and Localization of Secondary Topological Invariants.

NASA Astrophysics Data System (ADS)

Smirnov, Mikhail

1995-01-01

The problems solved in this thesis originated from combinatorial formulas for characteristic classes. This thesis deals with Chern-Simons classes, their generalizations and related algebraic and analytic problems. (1) In this thesis, I describe a new class of algebras whose elements contain Chern and generalized Chern -Simons classes. There is a Poisson bracket in these algebras, similar to the bracket in Kontsevich's noncommutative symplectic geometry (Kon). I prove that the Poisson bracket gives rise to a graded Lie algebra containing differential forms representing Chern and Chern-Simons classes. This is a new result. I describe algebraic analogs of the dilogarithm and higher polylogarithms in the algebra corresponding to Chern-Simons classes. (2) I study the properties of this bracket. It is possible to write the exterior differential and other operations in the algebra using this bracket. The bracket of any two Chern classes is zero and the bracket of a Chern class and a Chern-Simons class is d-closed. The construction developed here easily gives explicit formulas for known secondary classes and makes it possible to construct new ones. (3) I develop an algebraic model for the action of the gauge group and describe how elements of algebra corresponding to the secondary characteristic classes change under this action (see theorem 3 page xi). (4) It is possible give new explicit formulas for cocycles on a gauge group of a bundle and for the corresponding cocycles on the Lie algebra of the gauge group. I use formulas for secondary characteristic classes and an algebraic approach developed in chapter 1. I also use the work of Faddeev, Reiman and Semyonov-Tian-Shanskii (FRS) on cocycles as quantum anomalies. (5) I apply the methods of differential geometry of formal power series to construct universal characteristic and secondary characteristic classes. Given a pair of gauge equivalent connections using local formulas I obtain dilogarithmic and trilogarithmic analogs of Chern-Simons classes.

Classical integrable many-body systems disconnected with semi-simple Lie algebras

NASA Astrophysics Data System (ADS)

Inozemtsev, V. I.

2017-05-01

The review of the results in the theory of integrable many-body systems disconnected with semisimple Lie algebras is done. The one-dimensional systems of light Calogero-Sutherland-Moser particles interacting with one particle of infinite mass located at the origin are described in detail. In some cases the exact solutions of the equations of motion are obtained. The general theory of integration of the equations of motion needs the methods of algebraic geometry. The Lax pairs with spectral parameter are constructed for this purpose. The theory still contains many unsolved problems.

Construction of Orthonormal Wavelets Using Symbolic Algebraic Methods

NASA Astrophysics Data System (ADS)

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

2009-09-01

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

Partition functions for heterotic WZW conformal field theories

NASA Astrophysics Data System (ADS)

Gannon, Terry

1993-08-01

Thus far in the search for, and classification of, "physical" modular invariant partition functions ΣN LRχ Lχ R∗ the attention has been focused on the symmetric case where the holomorphic and anti-holomorphic sectors, and hence the characters χLand χR, are associated with the same Kac-Moody algebras ĝL = ĝR and levels κ L = κ R. In this paper we consider the more general possibility where ( ĝL, κ L) may not equal ( ĝR, κ R). We discuss which choices of algebras and levels may correspond to well-defined conformal field theories, we find the "smallest" such heterotic (i.e. asymmetric) partition functions, and we give a method, generalizing the Roberts-Terao-Warner lattice method, for explicitly constructing many other modular invariants. We conclude the paper by proving that this new lattice method will succeed in generating all the heterotic partition functions, for all choices of algebras and levels.

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

Müller-Hermes, Alexander, E-mail: muellerh@ma.tum.de; Wolf, Michael M., E-mail: m.wolf@tum.de; Reeb, David, E-mail: reeb.qit@gmail.com

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transposemore » bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.« less

Navigating around the algebraic jungle of QCD: efficient evaluation of loop helicity amplitudes

NASA Astrophysics Data System (ADS)

Lam, C. S.

1993-05-01

A method is developed whereby spinor helicity techniques can be used to simlify the calculation of loop amplitudes. This is achieved by using the Feynman-parameter representation where the offending off-shell loop momenta do not appear. Other shortcuts motivated by the Bern-Kosower one-loop string calculations can be incorporated into the formalism. This includes color reorganization into Chan-Paton factors and the use of background Feynman gauge. This method is applicable to any Feynman diagram with any number of loops as long as the external masses can be ignored. In order to minimize the very considerable algebra encountered in non-abelian gauge theories, graphical methods are developed for most of the calculations. This enables the large number of terms encountered to be organized implicitly in the Feynman diagram without the necessity of writing down any of them algebraically. A one-loop four-gluon amplitude in a particular helicity configuration is computed explicitly to illustrate the method.

Generalising the logistic map through the q-product

NASA Astrophysics Data System (ADS)

Pessoa, R. W. S.; Borges, E. P.

2011-03-01

We investigate a generalisation of the logistic map as xn+1 = 1 - axn otimesqmap xn (-1 <= xn <= 1, 0 < a <= 2) where otimesq stands for a generalisation of the ordinary product, known as q-product [Borges, E.P. Physica A 340, 95 (2004)]. The usual product, and consequently the usual logistic map, is recovered in the limit q → 1, The tent map is also a particular case for qmap → ∞. The generalisation of this (and others) algebraic operator has been widely used within nonextensive statistical mechanics context (see C. Tsallis, Introduction to Nonextensive Statistical Mechanics, Springer, NY, 2009). We focus the analysis for qmap > 1 at the edge of chaos, particularly at the first critical point ac, that depends on the value of qmap. Bifurcation diagrams, sensitivity to initial conditions, fractal dimension and rate of entropy growth are evaluated at ac(qmap), and connections with nonextensive statistical mechanics are explored.

Geodiversity and biodiversity assessment of the Słupsk Bank, Baltic Sea

NASA Astrophysics Data System (ADS)

Najwer, Alicja; Zelewska, Izabela; Zwoliński, Zbigniew

2017-04-01

Recognizing the most diversified parts of the territory turns out to be very crucial for management and planning of natural protected areas. There is an increasing number of studies concerning assessing geodiversity and biodiversity of the land areas. However, there is noticeable lack of such publications for submerged zones. The study area consists of 100km2 Słupsk sandy shoal sporadically covered with boulder layers, located in the southern part of the Baltic Sea. It is characterised by landscapes of a significant nature value protected by Natura 2000 and is as well designated as an open sea by Helsinki Commission Baltic Sea Protected Area (HELCOM BSPA). The main aim of the presentation is an attempt to integrate geodiversity and biodiversity assessments of the submerged area using GIS platform. The basis for the diversity assessment is the proper selection of features of the marine environment, its reclassification and integration by the map algebra analysis. The map of geodiversity is based on three factor maps: a relief energy map (classification based on bathymetric model, a landform fragmentation/geomorphological map (expert classification using BPI - Bathymetric Position Index), and a lithological map (classification of the average size of grain fraction). The map of biodiversity is based on the following factor maps: a map of biomass distribution of Ceraminum Diaphanum, a map of biomass distribution of Coccotylus Truncatus, a map of biomass distribution of Polysiphonia Fucoides, a map of biomass distribution of Mytilus Edulis Trossulus, a map of distribution of macroalgae, and finally a map of distribution of macrozoobenthos. It was decided to use four classes of diversity (from low through medium and high, up to very high). The designation of the lowest class was abandoned because it characterizes areas with high anthropopressure. Maps of geodiversity and biodiversity may prove to be helpful in determining the directions for management of the most valuable parts of the areas from the nature point of view, as well as delimitation of the geodiveristy/biodiversity hotspots for purpose of the strict nature protection. This study is the first attempt to use methods of diversity assessment for marine environment.

Cubic polynomial maps with periodic critical orbit, Part II

NASA Astrophysics Data System (ADS)

Bonifant, Araceli; Kiwi, Jan; Milnor, John

The parameter space S_p for monic centered cubic polynomial maps with a marked critical point of period p is a smooth affine algebraic curve whose genus increases rapidly with p . Each S_p consists of a compact connectedness locus together with finitely many escape regions, each of which is biholomorphic to a punctured disk and is characterized by an essentially unique Puiseux series. This note will describe the topology of S_p , and of its smooth compactification, in terms of these escape regions. In particular, it computes the Euler characteristic. It concludes with a discussion of the real sub-locus of S_p .

Locally Compact Quantum Groups. A von Neumann Algebra Approach

NASA Astrophysics Data System (ADS)

Van Daele, Alfons

2014-08-01

In this paper, we give an alternative approach to the theory of locally compact quantum groups, as developed by Kustermans and Vaes. We start with a von Neumann algebra and a comultiplication on this von Neumann algebra. We assume that there exist faithful left and right Haar weights. Then we develop the theory within this von Neumann algebra setting. In [Math. Scand. 92 (2003), 68-92] locally compact quantum groups are also studied in the von Neumann algebraic context. This approach is independent of the original C^*-algebraic approach in the sense that the earlier results are not used. However, this paper is not really independent because for many proofs, the reader is referred to the original paper where the C^*-version is developed. In this paper, we give a completely self-contained approach. Moreover, at various points, we do things differently. We have a different treatment of the antipode. It is similar to the original treatment in [Ann. Sci. & #201;cole Norm. Sup. (4) 33 (2000), 837-934]. But together with the fact that we work in the von Neumann algebra framework, it allows us to use an idea from [Rev. Roumaine Math. Pures Appl. 21 (1976), 1411-1449] to obtain the uniqueness of the Haar weights in an early stage. We take advantage of this fact when deriving the other main results in the theory. We also give a slightly different approach to duality. Finally, we collect, in a systematic way, several important formulas. In an appendix, we indicate very briefly how the C^*-approach and the von Neumann algebra approach eventually yield the same objects. The passage from the von Neumann algebra setting to the C^*-algebra setting is more or less standard. For the other direction, we use a new method. It is based on the observation that the Haar weights on the C^*-algebra extend to weights on the double dual with central support and that all these supports are the same. Of course, we get the von Neumann algebra by cutting down the double dual with this unique support projection in the center. All together, we see that there are many advantages when we develop the theory of locally compact quantum groups in the von Neumann algebra framework, rather than in the C^*-algebra framework. It is not only simpler, the theory of weights on von Neumann algebras is better known and one needs very little to go from the C^*-algebras to the von Neumann algebras. Moreover, in many cases when constructing examples, the von Neumann algebra with the coproduct is constructed from the very beginning and the Haar weights are constructed as weights on this von Neumann algebra (using left Hilbert algebra theory). This paper is written in a concise way. In many cases, only indications for the proofs of the results are given. This information should be enough to see that these results are correct. We will give more details in forthcoming paper, which will be expository, aimed at non-specialists. See also [Bull. Kerala Math. Assoc. (2005), 153-177] for an 'expanded' version of the appendix.

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

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

Nataf, J.M.; Winkelmann, F.

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

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

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

Nataf, J.M.; Winkelmann, F.

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

Optical systolic solutions of linear algebraic equations

NASA Technical Reports Server (NTRS)

Neuman, C. P.; Casasent, D.

1984-01-01

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

Seismic noise attenuation using an online subspace tracking algorithm

NASA Astrophysics Data System (ADS)

Zhou, Yatong; Li, Shuhua; Zhang, Dong; Chen, Yangkang

2018-02-01

We propose a new low-rank based noise attenuation method using an efficient algorithm for tracking subspaces from highly corrupted seismic observations. The subspace tracking algorithm requires only basic linear algebraic manipulations. The algorithm is derived by analysing incremental gradient descent on the Grassmannian manifold of subspaces. When the multidimensional seismic data are mapped to a low-rank space, the subspace tracking algorithm can be directly applied to the input low-rank matrix to estimate the useful signals. Since the subspace tracking algorithm is an online algorithm, it is more robust to random noise than traditional truncated singular value decomposition (TSVD) based subspace tracking algorithm. Compared with the state-of-the-art algorithms, the proposed denoising method can obtain better performance. More specifically, the proposed method outperforms the TSVD-based singular spectrum analysis method in causing less residual noise and also in saving half of the computational cost. Several synthetic and field data examples with different levels of complexities demonstrate the effectiveness and robustness of the presented algorithm in rejecting different types of noise including random noise, spiky noise, blending noise, and coherent noise.

Category of trees in representation theory of quantum algebras

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

Moskaliuk, N. M.; Moskaliuk, S. S., E-mail: mss@bitp.kiev.ua

2013-10-15

New applications of categorical methods are connected with new additional structures on categories. One of such structures in representation theory of quantum algebras, the category of Kuznetsov-Smorodinsky-Vilenkin-Smirnov (KSVS) trees, is constructed, whose objects are finite rooted KSVS trees and morphisms generated by the transition from a KSVS tree to another one.

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

ERIC Educational Resources Information Center

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

2011-01-01

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

The Role of Technology in Increasing Preservice Teachers' Anticipation of Students' Thinking in Algebra

ERIC Educational Resources Information Center

Rhine, Steve; Harrington, Rachel; Olszewski, Brandon

2015-01-01

The collision between a growing, inexperienced teaching force and students' algebra struggles should be one of great concern. A collaboration of four public and private universities in Oregon restructured mathematics methods courses for preservice teacher candidates by using the affordances of technology to counteract this loss of experience. Over…

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

NASA Technical Reports Server (NTRS)

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

1992-01-01

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

Classical Yang-Baxter equations and quantum integrable systems

NASA Astrophysics Data System (ADS)

Jurčo, Branislav

1989-06-01

Quantum integrable models associated with nondegenerate solutions of classical Yang-Baxter equations related to the simple Lie algebras are investigated. These models are diagonalized for rational and trigonometric solutions in the cases of sl(N)/gl(N)/, o(N) and sp(N) algebras. The analogy with the quantum inverse scattering method is demonstrated.

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

ERIC Educational Resources Information Center

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

Pre-Service Teachers' Mental Constructions of Concepts in Matrix Algebra

ERIC Educational Resources Information Center

Ndlovu, Zanele; Brijlall, Deonarain

2015-01-01

This study is part of ongoing research in undergraduate mathematics education. The study was guided by the belief that understanding the mental constructions the pre-service teachers make when learning matrix algebra concepts leads to improved instructional methods. In this preliminary study the data was collected from 85 pre-service teachers…

Validating Cognitive Models of Task Performance in Algebra on the SAT®. Research Report No. 2009-3

ERIC Educational Resources Information Center

Gierl, Mark J.; Leighton, Jacqueline P.; Wang, Changjiang; Zhou, Jiawen; Gokiert, Rebecca; Tan, Adele

2009-01-01

The purpose of the study is to present research focused on validating the four algebra cognitive models in Gierl, Wang, et al., using student response data collected with protocol analysis methods to evaluate the knowledge structures and processing skills used by a sample of SAT test takers.

Hidden algebra method (quasi-exact-solvability in quantum mechanics)

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

Turbiner, Alexander; Instituto de Ciencias Nucleares, Universidad Nacional Autonoma de Mexico, Apartado, Postal 70-543, 04510 Mexico, D. F.

1996-02-20

A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland N-body problems ass ociated with an existence of the hidden algebra slN is discussed extensively.

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

ERIC Educational Resources Information Center

Maat, Siti Mistima; Zakaria, Effandi

2011-01-01

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

A Method for the Microanalysis of Pre-Algebra Transfer

ERIC Educational Resources Information Center

Pavlik, Philip I., Jr.; Yudelson, Michael; Koedinger, Kenneth R.

2011-01-01

The objective of this research was to better understand the transfer of learning between different variations of pre-algebra problems. While the authors could have addressed a specific variation that might address transfer, they were interested in developing a general model of transfer, so we gathered data from multiple problem types and their…

High-Stakes Testing and Teacher Stress

ERIC Educational Resources Information Center

Hoyt, Joshua Paul

2017-01-01

The purpose of this mixed-methods research study was to examine how stress levels of middle school mathematics teachers who taught Algebra I in school districts in the state of Pennsylvania relate to high-stakes testing and to explore the experiences of middle school mathematics Algebra I teachers. The researcher collected and compared it to…

Graphs in Kinematics--A Need for Adherence to Principles of Algebraic Functions

ERIC Educational Resources Information Center

Sokolowski, Andrzej

2017-01-01

Graphs in physics are central to the analysis of phenomena and to learning about a system's behavior. The ways students handle graphs are frequently researched. Students' misconceptions are highlighted, and methods of improvement suggested. While kinematics graphs are to represent a real motion, they are also algebraic entities that must satisfy…

Research on Flipping College Algebra: Lessons Learned and Practical Advice for Flipping Multiple Sections

ERIC Educational Resources Information Center

Overmyer, Jerry

2015-01-01

This quantitative research compares five sections of College Algebra using flipped classroom methods with six sections using the traditional lecture/homework structure and its effect on student achievement as measured through a common final exam. Common final exam scores were the dependent variables. Instructors of flipped sections who had…

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

ERIC Educational Resources Information Center

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

2010-01-01

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

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

PubMed

Egri-Nagy, Attila; Nehaniv, Chrystopher L

2008-01-01

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

Dual number algebra method for Green's function derivatives in 3D magneto-electro-elasticity

NASA Astrophysics Data System (ADS)

Dziatkiewicz, Grzegorz

2018-01-01

The Green functions are the basic elements of the boundary element method. To obtain the boundary integral formulation the Green function and its derivative should be known for the considered differential operator. Today the interesting group of materials are electronic composites. The special case of the electronic composite is the magnetoelectroelastic continuum. The mentioned continuum is a model of the piezoelectric-piezomagnetic composites. The anisotropy of their physical properties makes the problem of Green's function determination very difficult. For that reason Green's functions for the magnetoelectroelastic continuum are not known in the closed form and numerical methods should be applied to determine such Green's functions. These means that the problem of the accurate and simply determination of Green's function derivatives is even harder. Therefore in the present work the dual number algebra method is applied to calculate numerically the derivatives of 3D Green's functions for the magnetoelectroelastic materials. The introduced method is independent on the step size and it can be treated as a special case of the automatic differentiation method. Therefore, the dual number algebra method can be applied as a tool for checking the accuracy of the well-known finite difference schemes.

Highly Entangled, Non-random Subspaces of Tensor Products from Quantum Groups

NASA Astrophysics Data System (ADS)

Brannan, Michael; Collins, Benoît

2018-03-01

In this paper we describe a class of highly entangled subspaces of a tensor product of finite-dimensional Hilbert spaces arising from the representation theory of free orthogonal quantum groups. We determine their largest singular values and obtain lower bounds for the minimum output entropy of the corresponding quantum channels. An application to the construction of d-positive maps on matrix algebras is also presented.

ADAM: analysis of discrete models of biological systems using computer algebra.

PubMed

Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

2011-07-20

Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web-based tool for several different input formats, and it makes analysis of complex models accessible to a larger community, as it is platform independent as a web-service and does not require understanding of the underlying mathematics.

Performance of Renormalization Group Algebraic Turbulence Model on Boundary Layer Transition Simulation

NASA Technical Reports Server (NTRS)

Ahn, Kyung H.

1994-01-01

The RNG-based algebraic turbulence model, with a new method of solving the cubic equation and applying new length scales, is introduced. An analysis is made of the RNG length scale which was previously reported and the resulting eddy viscosity is compared with those from other algebraic turbulence models. Subsequently, a new length scale is introduced which actually uses the two previous RNG length scales in a systematic way to improve the model performance. The performance of the present RNG model is demonstrated by simulating the boundary layer flow over a flat plate and the flow over an airfoil.

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

NASA Technical Reports Server (NTRS)

Moitra, Anutosh

1989-01-01

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

Complementary Reliability-Based Decodings of Binary Linear Block Codes

NASA Technical Reports Server (NTRS)

Fossorier, Marc P. C.; Lin, Shu

1997-01-01

This correspondence presents a hybrid reliability-based decoding algorithm which combines the reprocessing method based on the most reliable basis and a generalized Chase-type algebraic decoder based on the least reliable positions. It is shown that reprocessing with a simple additional algebraic decoding effort achieves significant coding gain. For long codes, the order of reprocessing required to achieve asymptotic optimum error performance is reduced by approximately 1/3. This significantly reduces the computational complexity, especially for long codes. Also, a more efficient criterion for stopping the decoding process is derived based on the knowledge of the algebraic decoding solution.

Graphs in kinematics—a need for adherence to principles of algebraic functions

NASA Astrophysics Data System (ADS)

Sokolowski, Andrzej

2017-11-01

Graphs in physics are central to the analysis of phenomena and to learning about a system’s behavior. The ways students handle graphs are frequently researched. Students’ misconceptions are highlighted, and methods of improvement suggested. While kinematics graphs are to represent a real motion, they are also algebraic entities that must satisfy conditions for being algebraic functions. To be algebraic functions, they must pass certain tests before they can be used to infer more about motion. A preliminary survey of some physics resources has revealed that little attention is paid to verifying if the position, velocity and acceleration versus time graphs, that are to depict real motion, satisfy the most critical condition for being an algebraic function; the vertical line test. The lack of attention to this adherence shows as vertical segments in piecewise graphs. Such graphs generate unrealistic interpretations and may confuse students. A group of 25 college physics students was provided with such a graph and asked to analyse its adherence to reality. The majority of the students (N  =  16, 64%) questioned the graph’s validity. It is inferred that such graphs might not only jeopardize the function principles studied in mathematics but also undermine the purpose of studying these principles. The aim of this study was to bring this idea forth and suggest a better alignment of physics and mathematics methods.

Connections between Kac-Moody algebras and M-theory

NASA Astrophysics Data System (ADS)

Cook, Paul P.

2007-11-01

We investigate some of the motivations and consequences of the conjecture that the Kac-Moody algebra E11 is the symmetry algebra of M-theory, and we develop methods to aid the further investigation of this idea. The definitions required to work with abstract root systems of Lie algebras are given in review leading up to the definition of a Kac-Moody algebra. The motivations for the E11 conjecture are presented and the nonlinear realisation of gravity relevant to the conjecture is described. We give a beginner's guide to producing the algebras of E11, relevant to M-theory, and K27, relevant to the bosonic string theory, along with their l1 representations are constructed. Reference tables of low level roots are produced for both the adjoint and l1 representations of these algebras. In addition a particular group element, having a generic form for all G+++ algebras, is shown to encode all the half-BPS brane solutions of the maximally oxidised supergravities. Special analysis is given to the role of space-time signature in the context of this group element and subsequent to this analysis spacelike brane solutions are derived from the same solution generating group element. Finally the appearance of U-duality charge multiplets from E11 is reviewed. General formulae for finding the content of arbitrary brane charge multiplets are given and the content of the particle and string multiplets in dimensions 4,5,6,7 and 8 is shown to be contained in the l1 representation of E11.

Relational Thinking: The Bridge between Arithmetic and Algebra

ERIC Educational Resources Information Center

Kiziltoprak, Ayhan; Köse, Nilüfer Yavuzsoy

2017-01-01

The purpose of this study is to investigate the development of relational thinking skill, which is an important component of the transition from arithmetic to algebra, of 5th grade students. In the study, the qualitative research method of teaching experiment was used. The research data were collected from six secondary school 5th grade students…

Is the Role of Equations in the Doing of Word Problems in School Algebra Changing? Initial Indications from Teacher Study Groups

ERIC Educational Resources Information Center

Chazan, Daniel; Sela, Hagit; Herbst, Patricio

2012-01-01

We illustrate a method, which is modeled on "breaching experiments," for studying tacit norms that govern classroom interaction around particular mathematical content. Specifically, this study explores norms that govern teachers' expectations for the doing of word problems in school algebra. Teacher study groups discussed representations of…

Preservice Teachers' Algebraic Reasoning and Symbol Use on a Multistep Fraction Word Problem

ERIC Educational Resources Information Center

Cullen, Amanda L.; Tobias, Jennifer M.; Safak, Elif; Kirwan, J. Vince; Wessman-Enzinger, Nicole M.; Wickstrom, Megan H.; Baek, Jae M.

2017-01-01

Previous research on preservice teachers' understanding of fractions and algebra has focused on one or the other. To extend this research, we examined 85 undergraduate elementary education majors and middle school mathematics education majors' solutions and solution paths (i.e., the ways or methods in which preservice teachers solve word problems)…

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

ERIC Educational Resources Information Center

Gasyna, Zbigniew L.

2008-01-01

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

Algebraic model checking for Boolean gene regulatory networks.

PubMed

Tran, Quoc-Nam

2011-01-01

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

Integrand-level reduction of loop amplitudes by computational algebraic geometry methods

NASA Astrophysics Data System (ADS)

Zhang, Yang

2012-09-01

We present an algorithm for the integrand-level reduction of multi-loop amplitudes of renormalizable field theories, based on computational algebraic geometry. This algorithm uses (1) the Gröbner basis method to determine the basis for integrand-level reduction, (2) the primary decomposition of an ideal to classify all inequivalent solutions of unitarity cuts. The resulting basis and cut solutions can be used to reconstruct the integrand from unitarity cuts, via polynomial fitting techniques. The basis determination part of the algorithm has been implemented in the Mathematica package, BasisDet. The primary decomposition part can be readily carried out by algebraic geometry softwares, with the output of the package BasisDet. The algorithm works in both D = 4 and D = 4 - 2 ɛ dimensions, and we present some two and three-loop examples of applications of this algorithm.

A simple method for constructing the inhomogeneous quantum group IGLq(n) and its universal enveloping algebra Uq(igl(n))

NASA Astrophysics Data System (ADS)

Shariati, A.; Aghamohammadi, A.

1995-12-01

We propose a simple and concise method to construct the inhomogeneous quantum group IGLq(n) and its universal enveloping algebra Uq(igl(n)). Our technique is based on embedding an n-dimensional quantum space in an n+1-dimensional one as the set xn+1=1. This is possible only if one considers the multiparametric quantum space whose parameters are fixed in a specific way. The quantum group IGLq(n) is then the subset of GLq(n+1), which leaves the xn+1=1 subset invariant. For the deformed universal enveloping algebra Uq(igl(n)), we will show that it can also be embedded in Uq(gl(n+1)), provided one uses the multiparametric deformation of U(gl(n+1)) with a specific choice of its parameters.

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

NASA Astrophysics Data System (ADS)

Jiang, Yunfeng; Zhang, Yang

2018-03-01

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

Solar system dynamics

NASA Technical Reports Server (NTRS)

Wisdom, Jack

1987-01-01

The rotational dynamics of irregularly shaped satellites and the origin of Kirkwood Gaps are discussed. The chaotic tumbling of Hyperion and the anomalously low eccentricity of Deimos are examined. The Digital Orrery is used to explore the phase space of the ellipic restricted three body problem near the principal commensurabilities (2/1, 5/2, 3/1, and 3/2). The results for the 3/1 commensurability are in close agreement with those found earlier with the algebraic mapping method. Large chaotic zones are associated with the 3/1, 2/1 and 5/2 resonances, where there are gaps in the distribution of asteroids. The region near the 3/2 resonance, where the Hilda group of asteroids is located, is largely devoid of chaotic behavior. Thus, there is a qualitative agreement between the character of the motion and the distribution of asteroids.

Boundary-fitted coordinate systems for numerical solution of partial differential equations - A review

NASA Technical Reports Server (NTRS)

Thompson, J. F.; Warsi, Z. U. A.; Mastin, C. W.

1982-01-01

A comprehensive review of methods of numerically generating curvilinear coordinate systems with coordinate lines coincident with all boundary segments is given. Some general mathematical framework and error analysis common to such coordinate systems is also included. The general categories of generating systems are those based on conformal mapping, orthogonal systems, nearly orthogonal systems, systems produced as the solution of elliptic and hyperbolic partial differential equations, and systems generated algebraically by interpolation among the boundaries. Also covered are the control of coordinate line spacing by functions embedded in the partial differential operators of the generating system and by subsequent stretching transformation. Dynamically adaptive coordinate systems, coupled with the physical solution, and time-dependent systems that follow moving boundaries are treated. References reporting experience using such coordinate systems are reviewed as well as those covering the system development.

Geometric analysis of Arabidopsis root apex reveals a new aspect of the ethylene signal transduction pathway in development

NASA Technical Reports Server (NTRS)

Cervantes, Emilio; Tocino, Angel

2005-01-01

Structurally, ethylene is the simplest phytohormone and regulates multiple aspects of plant growth and development. Its effects are mediated by a signal transduction cascade involving receptors, MAP kinases and transcription factors. Many morphological effects of ethylene in plant development, including root size, have been previously described. In this article a combined geometric and algebraic approach has been used to analyse the shape and the curvature in the root apex of Arabidopsis seedlings. The process requires the fitting of Bezier curves that reproduce the root apex shape, and the calculation of the corresponding curvatures. The application of the method has allowed us to identify significant differences in the root curvatures of ethylene insensitive mutants (ein2-1 and etr1-1) with respect to the wild-type Columbia.

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

NASA Technical Reports Server (NTRS)

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

2008-01-01

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

Hypotrochoids in conformal restriction systems and Virasoro descendants

NASA Astrophysics Data System (ADS)

Doyon, Benjamin

2013-09-01

A conformal restriction system is a commutative, associative, unital algebra equipped with a representation of the groupoid of univalent conformal maps on connected open sets of the Riemann sphere, along with a family of linear functionals on subalgebras, satisfying a set of properties including conformal invariance and a type of restriction. This embodies some expected properties of expectation values in conformal loop ensembles CLEκ (at least for 8/3 < κ ≤ 4). In the context of conformal restriction systems, we study certain algebra elements associated with hypotrochoid simple curves (a family of curves including the ellipse). These have the CLE interpretation of being ‘renormalized random variables’ that are nonzero only if there is at least one loop of hypotrochoid shape. Each curve has a center w, a scale ɛ and a rotation angle θ, and we analyze the renormalized random variable as a function of u = ɛeiθ and w. We find that it has an expansion in positive powers of u and \\bar {u}, and that the coefficients of pure u (\\bar {u}) powers are holomorphic in w (\\bar {w}). We identify these coefficients (the ‘hypotrochoid fields’) with certain Virasoro descendants of the identity field in conformal field theory, thereby showing that they form part of a vertex operator algebraic structure. This largely generalizes works by the author (in CLE), and the author with his collaborators Riva and Cardy (in SLE8/3 and other restriction measures), where the case of the ellipse, at the order u2, led to the stress-energy tensor of CFT. The derivation uses in an essential way the Virasoro vertex operator algebra structure of conformal derivatives established recently by the author. The results suggest in particular the exact evaluation of CLE expectations of products of hypotrochoid fields as well as nontrivial relations amongst them through the vertex operator algebra, and further shed light onto the relationship between CLE and CFT.

Correlation functions from a unified variational principle: Trial Lie groups

NASA Astrophysics Data System (ADS)

Balian, R.; Vénéroni, M.

2015-11-01

Time-dependent expectation values and correlation functions for many-body quantum systems are evaluated by means of a unified variational principle. It optimizes a generating functional depending on sources associated with the observables of interest. It is built by imposing through Lagrange multipliers constraints that account for the initial state (at equilibrium or off equilibrium) and for the backward Heisenberg evolution of the observables. The trial objects are respectively akin to a density operator and to an operator involving the observables of interest and the sources. We work out here the case where trial spaces constitute Lie groups. This choice reduces the original degrees of freedom to those of the underlying Lie algebra, consisting of simple observables; the resulting objects are labeled by the indices of a basis of this algebra. Explicit results are obtained by expanding in powers of the sources. Zeroth and first orders provide thermodynamic quantities and expectation values in the form of mean-field approximations, with dynamical equations having a classical Lie-Poisson structure. At second order, the variational expression for two-time correlation functions separates-as does its exact counterpart-the approximate dynamics of the observables from the approximate correlations in the initial state. Two building blocks are involved: (i) a commutation matrix which stems from the structure constants of the Lie algebra; and (ii) the second-derivative matrix of a free-energy function. The diagonalization of both matrices, required for practical calculations, is worked out, in a way analogous to the standard RPA. The ensuing structure of the variational formulae is the same as for a system of non-interacting bosons (or of harmonic oscillators) plus, at non-zero temperature, classical Gaussian variables. This property is explained by mapping the original Lie algebra onto a simpler Lie algebra. The results, valid for any trial Lie group, fulfill consistency properties and encompass several special cases: linear responses, static and time-dependent fluctuations, zero- and high-temperature limits, static and dynamic stability of small deviations.

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

Balian, R., E-mail: roger.balian@cea.fr; Vénéroni, M.

Time-dependent expectation values and correlation functions for many-body quantum systems are evaluated by means of a unified variational principle. It optimizes a generating functional depending on sources associated with the observables of interest. It is built by imposing through Lagrange multipliers constraints that account for the initial state (at equilibrium or off equilibrium) and for the backward Heisenberg evolution of the observables. The trial objects are respectively akin to a density operator and to an operator involving the observables of interest and the sources. We work out here the case where trial spaces constitute Lie groups. This choice reduces themore » original degrees of freedom to those of the underlying Lie algebra, consisting of simple observables; the resulting objects are labeled by the indices of a basis of this algebra. Explicit results are obtained by expanding in powers of the sources. Zeroth and first orders provide thermodynamic quantities and expectation values in the form of mean-field approximations, with dynamical equations having a classical Lie–Poisson structure. At second order, the variational expression for two-time correlation functions separates–as does its exact counterpart–the approximate dynamics of the observables from the approximate correlations in the initial state. Two building blocks are involved: (i) a commutation matrix which stems from the structure constants of the Lie algebra; and (ii) the second-derivative matrix of a free-energy function. The diagonalization of both matrices, required for practical calculations, is worked out, in a way analogous to the standard RPA. The ensuing structure of the variational formulae is the same as for a system of non-interacting bosons (or of harmonic oscillators) plus, at non-zero temperature, classical Gaussian variables. This property is explained by mapping the original Lie algebra onto a simpler Lie algebra. The results, valid for any trial Lie group, fulfill consistency properties and encompass several special cases: linear responses, static and time-dependent fluctuations, zero- and high-temperature limits, static and dynamic stability of small deviations.« less

SU-F-T-527: A Novel Dynamic Multileaf Collimator Leaf-Sequencing Algorithm in Radiation Therapy

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

Jing, J; Lin, H; Chow, J

Purpose: A novel leaf-sequencing algorithm is developed for generating arbitrary beam intensity profiles in discrete levels using dynamic multileaf collimator (MLC). The efficiency of this dynamic MLC leaf-sequencing method was evaluated using external beam treatment plans delivered by intensity modulated radiation therapy technique. Methods: To qualify and validate this algorithm, integral test for the beam segment of MLC generated by the CORVUS treatment planning system was performed with clinical intensity map experiments. The treatment plans were optimized and the fluence maps for all photon beams were determined. This algorithm started with the algebraic expression for the area under the beammore » profile. The coefficients in the expression can be transformed into the specifications for the leaf-setting sequence. The leaf optimization procedure was then applied and analyzed for clinical relevant intensity profiles in cancer treatment. Results: The macrophysical effect of this method can be described by volumetric plan evaluation tools such as dose-volume histograms (DVHs). The DVH results are in good agreement compared to those from the CORVUS treatment planning system. Conclusion: We developed a dynamic MLC method to examine the stability of leaf speed including effects of acceleration and deceleration of leaf motion in order to make sure the stability of leaf speed did not affect the intensity profile generated. It was found that the mechanical requirements were better satisfied using this method. The Project is sponsored by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.« less

Accelerate quasi Monte Carlo method for solving systems of linear algebraic equations through shared memory

NASA Astrophysics Data System (ADS)

Lai, Siyan; Xu, Ying; Shao, Bo; Guo, Menghan; Lin, Xiaola

2017-04-01

In this paper we study on Monte Carlo method for solving systems of linear algebraic equations (SLAE) based on shared memory. Former research demostrated that GPU can effectively speed up the computations of this issue. Our purpose is to optimize Monte Carlo method simulation on GPUmemoryachritecture specifically. Random numbers are organized to storein shared memory, which aims to accelerate the parallel algorithm. Bank conflicts can be avoided by our Collaborative Thread Arrays(CTA)scheme. The results of experiments show that the shared memory based strategy can speed up the computaions over than 3X at most.

Graphing trillions of triangles.

PubMed

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

Exactly solvable model of transitional nuclei based on dual algebraic structure for the three level pairing model in the framework of sdg interacting boson model

NASA Astrophysics Data System (ADS)

Jafarizadeh, M. A.; Ranjbar, Z.; Fouladi, N.; Ghapanvari, M.

2018-01-01

In this paper, a successful algebraic method based on the dual algebraic structure for three level pairing model in the framework of sdg IBM is proposed for transitional nuclei which show transitional behavior from spherical to gamma-unstable quantum shape phase transition. In this method complicated sdg Hamiltonian, which is a three level pairing Hamiltonian is determined easily via the exactly solvable method. This description provides a better interpretation of some observables such as BE (4) in nuclei which exhibits the necessity of inclusion of g boson in the sd IBM, while BE (4) cannot be explained in the sd boson model. Some observables such as Energy levels, BE (2), BE (4), the two neutron separation energies signature splitting of the γ-vibrational band and expectation values of the g-boson number operator are calculated and examined for 46 104 - 110Pd isotopes.

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

NASA Astrophysics Data System (ADS)

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

2008-01-01

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

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

PubMed Central

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

2010-01-01

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

Geometric properties of commutative subalgebras of partial differential operators

NASA Astrophysics Data System (ADS)

Zheglov, A. B.; Kurke, H.

2015-05-01

We investigate further algebro-geometric properties of commutative rings of partial differential operators, continuing our research started in previous articles. In particular, we start to explore the simplest and also certain known examples of quantum algebraically completely integrable systems from the point of view of a recent generalization of Sato's theory, developed by the first author. We give a complete characterization of the spectral data for a class of 'trivial' commutative algebras and strengthen geometric properties known earlier for a class of known examples. We also define a kind of restriction map from the moduli space of coherent sheaves with fixed Hilbert polynomial on a surface to an analogous moduli space on a divisor (both the surface and the divisor are part of the spectral data). We give several explicit examples of spectral data and corresponding algebras of commuting (completed) operators, producing as a by-product interesting examples of surfaces that are not isomorphic to spectral surfaces of any (maximal) commutative ring of partial differential operators of rank one. Finally, we prove that any commutative ring of partial differential operators whose normalization is isomorphic to the ring of polynomials k \\lbrack u,t \\rbrack is a Darboux transformation of a ring of operators with constant coefficients. Bibliography: 39 titles.

On two special values of temperature factor in hypersonic flow stagnation point

NASA Astrophysics Data System (ADS)

Bilchenko, G. G.; Bilchenko, N. G.

2018-03-01

The hypersonic aircraft permeable cylindrical and spherical surfaces laminar boundary layer heat and mass transfer control mathematical model properties are investigated. The nonlinear algebraic equations systems are obtained for two special values of temperature factor in the hypersonic flow stagnation point. The mappings bijectivity between heat and mass transfer local parameters and controls is established. The computation experiments results are presented: the domains of allowed values “heat-friction” are obtained.

Electrostatic potential map modelling with COSY Infinity

NASA Astrophysics Data System (ADS)

Maloney, J. A.; Baartman, R.; Planche, T.; Saminathan, S.

2016-06-01

COSY Infinity (Makino and Berz, 2005) is a differential-algebra based simulation code which allows accurate calculation of transfer maps to arbitrary order. COSY's existing internal procedures were modified to allow electrostatic elements to be specified using an array of field potential data from the midplane. Additionally, a new procedure was created allowing electrostatic elements and their fringe fields to be specified by an analytic function. This allows greater flexibility in accurately modelling electrostatic elements and their fringe fields. Applied examples of these new procedures are presented including the modelling of a shunted electrostatic multipole designed with OPERA, a spherical electrostatic bender, and the effects of different shaped apertures in an electrostatic beam line.

Research on numerical algorithms for large space structures

NASA Technical Reports Server (NTRS)

Denman, E. D.

1982-01-01

Numerical algorithms for large space structures were investigated with particular emphasis on decoupling method for analysis and design. Numerous aspects of the analysis of large systems ranging from the algebraic theory to lambda matrices to identification algorithms were considered. A general treatment of the algebraic theory of lambda matrices is presented and the theory is applied to second order lambda matrices.

Hidden algebra method (quasi-exact-solvability in quantum mechanics)

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

Turbiner, A.

1996-02-01

A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland {ital N}-body problems ass ociated with an existence of the hidden algebra {ital sl}{sub {ital N}} is discussed extensively. {copyright} {ital 1996 American Institute of Physics.}

W-algebra for solving problems with fuzzy parameters

NASA Astrophysics Data System (ADS)

Shevlyakov, A. O.; Matveev, M. G.

2018-03-01

A method of solving the problems with fuzzy parameters by means of a special algebraic structure is proposed. The structure defines its operations through operations on real numbers, which simplifies its use. It avoids deficiencies limiting applicability of the other known structures. Examples for solution of a quadratic equation, a system of linear equations and a network planning problem are given.

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

ERIC Educational Resources Information Center

Burke, Maurice J.; Hodgson, Ted R.

2007-01-01

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

What Kinds of Numbers Do Students Assign to Literal Symbols? Aspects of the Transition from Arithmetic to Algebra

ERIC Educational Resources Information Center

Christou, Konstantinos P.; Vosniadou, Stella

2012-01-01

Three experiments used multiple methods--open-ended assessments, multiple-choice questionnaires, and interviews--to investigate the hypothesis that the development of students' understanding of the concept of real variable in algebra may be influenced in fundamental ways by their initial concept of number, which seems to be organized around the…

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

PubMed

Ferčec, Brigita; Mahdi, Adam

2013-01-01

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

Effect of a Cooperative Learning Technique on the Academic Performance of High School Students in Mathematics

ERIC Educational Resources Information Center

Idowu, Olumuyiwa Ayodeji

2013-01-01

Over the past 2 years, almost 45% of the students attending a local suburban high school failed Algebra 2. The purpose of this study was to compare the impact of a cooperative instructional technique (student teams-achievement divisions [STAD]) to traditional instructional methods on performance in high school algebra. Motivational and cognitive…

Reducing Communication in Algebraic Multigrid Using Additive Variants

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

Vassilevski, Panayot S.; Yang, Ulrike Meier

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

Reducing Communication in Algebraic Multigrid Using Additive Variants

DOE PAGES

Vassilevski, Panayot S.; Yang, Ulrike Meier

2014-02-12

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

Arithmetic Circuit Verification Based on Symbolic Computer Algebra

NASA Astrophysics Data System (ADS)

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

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

Generalized EMV-Effect Algebras

NASA Astrophysics Data System (ADS)

Borzooei, R. A.; Dvurečenskij, A.; Sharafi, A. H.

2018-04-01

Recently in Dvurečenskij and Zahiri (2017), new algebraic structures, called EMV-algebras which generalize both MV-algebras and generalized Boolean algebras, were introduced. We present equivalent conditions for EMV-algebras. In addition, we define a partial algebraic structure, called a generalized EMV-effect algebra, which is close to generalized MV-effect algebras. Finally, we show that every generalized EMV-effect algebra is either an MV-effect algebra or can be embedded into an MV-effect algebra as a maximal ideal.

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

NASA Astrophysics Data System (ADS)

Mehrpooya, Adel; Ebrahimi, Mohammad; Davvaz, Bijan

2017-09-01

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

Image-algebraic design of multispectral target recognition algorithms

NASA Astrophysics Data System (ADS)

Schmalz, Mark S.; Ritter, Gerhard X.

1994-06-01

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

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

NASA Technical Reports Server (NTRS)

Moitra, Anutosh

1989-01-01

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

SEGMENTATION OF MITOCHONDRIA IN ELECTRON MICROSCOPY IMAGES USING ALGEBRAIC CURVES.

PubMed

Seyedhosseini, Mojtaba; Ellisman, Mark H; Tasdizen, Tolga

2013-01-01

High-resolution microscopy techniques have been used to generate large volumes of data with enough details for understanding the complex structure of the nervous system. However, automatic techniques are required to segment cells and intracellular structures in these multi-terabyte datasets and make anatomical analysis possible on a large scale. We propose a fully automated method that exploits both shape information and regional statistics to segment irregularly shaped intracellular structures such as mitochondria in electron microscopy (EM) images. The main idea is to use algebraic curves to extract shape features together with texture features from image patches. Then, these powerful features are used to learn a random forest classifier, which can predict mitochondria locations precisely. Finally, the algebraic curves together with regional information are used to segment the mitochondria at the predicted locations. We demonstrate that our method outperforms the state-of-the-art algorithms in segmentation of mitochondria in EM images.

The First Fundamental Theorem of Invariant Theory for the Orthosymplectic Supergroup

NASA Astrophysics Data System (ADS)

Lehrer, G. I.; Zhang, R. B.

2017-01-01

We give an elementary and explicit proof of the first fundamental theorem of invariant theory for the orthosymplectic supergroup by generalising the geometric method of Atiyah, Bott and Patodi to the supergroup context. We use methods from super-algebraic geometry to convert invariants of the orthosymplectic supergroup into invariants of the corresponding general linear supergroup on a different space. In this way, super Schur-Weyl-Brauer duality is established between the orthosymplectic supergroup of superdimension ( m|2 n) and the Brauer algebra with parameter m - 2 n. The result may be interpreted either in terms of the group scheme OSp( V) over C, where V is a finite dimensional super space, or as a statement about the orthosymplectic Lie supergroup over the infinite dimensional Grassmann algebra {Λ}. We take the latter point of view here, and also state a corresponding theorem for the orthosymplectic Lie superalgebra, which involves an extra invariant generator, the super-Pfaffian.

Continuum analogues of contragredient Lie algebras (Lie algebras with a Cartan operator and nonlinear dynamical systems)

NASA Astrophysics Data System (ADS)

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

1989-12-01

We present an axiomatic formulation of a new class of infinitedimensional 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.

Monotonically improving approximate answers to relational algebra queries

NASA Technical Reports Server (NTRS)

Smith, Kenneth P.; Liu, J. W. S.

1989-01-01

We present here a query processing method that produces approximate answers to queries posed in standard relational algebra. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy enables us to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes appromimate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.

A numerical method to solve the 1D and the 2D reaction diffusion equation based on Bessel functions and Jacobian free Newton-Krylov subspace methods

NASA Astrophysics Data System (ADS)

Parand, K.; Nikarya, M.

2017-11-01

In this paper a novel method will be introduced to solve a nonlinear partial differential equation (PDE). In the proposed method, we use the spectral collocation method based on Bessel functions of the first kind and the Jacobian free Newton-generalized minimum residual (JFNGMRes) method with adaptive preconditioner. In this work a nonlinear PDE has been converted to a nonlinear system of algebraic equations using the collocation method based on Bessel functions without any linearization, discretization or getting the help of any other methods. Finally, by using JFNGMRes, the solution of the nonlinear algebraic system is achieved. To illustrate the reliability and efficiency of the proposed method, we solve some examples of the famous Fisher equation. We compare our results with other methods.

The preconditioned Gauss-Seidel method faster than the SOR method

NASA Astrophysics Data System (ADS)

Niki, Hiroshi; Kohno, Toshiyuki; Morimoto, Munenori

2008-09-01

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

Improved algorithm of ray tracing in ICF cryogenic targets

NASA Astrophysics Data System (ADS)

Zhang, Rui; Yang, Yongying; Ling, Tong; Jiang, Jiabin

2016-10-01

The high precision ray tracing inside inertial confinement fusion (ICF) cryogenic targets plays an important role in the reconstruction of the three-dimensional density distribution by algebraic reconstruction technique (ART) algorithm. The traditional Runge-Kutta methods, which is restricted by the precision of the grid division and the step size of ray tracing, cannot make an accurate calculation in the case of refractive index saltation. In this paper, we propose an improved algorithm of ray tracing based on the Runge-Kutta methods and Snell's law of refraction to achieve high tracing precision. On the boundary of refractive index, we apply Snell's law of refraction and contact point search algorithm to ensure accuracy of the simulation. Inside the cryogenic target, the combination of the Runge-Kutta methods and self-adaptive step algorithm are employed for computation. The original refractive index data, which is used to mesh the target, can be obtained by experimental measurement or priori refractive index distribution function. A finite differential method is performed to calculate the refractive index gradient of mesh nodes, and the distance weighted average interpolation methods is utilized to obtain refractive index and gradient of each point in space. In the simulation, we take ideal ICF target, Luneberg lens and Graded index rod as simulation model to calculate the spot diagram and wavefront map. Compared the simulation results to Zemax, it manifests that the improved algorithm of ray tracing based on the fourth-order Runge-Kutta methods and Snell's law of refraction exhibits high accuracy. The relative error of the spot diagram is 0.2%, and the peak-to-valley (PV) error and the root-mean-square (RMS) error of the wavefront map is less than λ/35 and λ/100, correspondingly.

Numerical modeling of marine Gravity data for tsunami hazard zone mapping

NASA Astrophysics Data System (ADS)

Porwal, Nipun

2012-07-01

Tsunami is a series of ocean wave with very high wavelengths ranges from 10 to 500 km. Therefore tsunamis act as shallow water waves and hard to predict from various methods. Bottom Pressure Recorders of Poseidon class considered as a preeminent method to detect tsunami waves but Acoustic Modem in Ocean Bottom Pressure (OBP) sensors placed in the vicinity of trenches having depth of more than 6000m fails to propel OBP data to Surface Buoys. Therefore this paper is developed for numerical modeling of Gravity field coefficients from Bureau Gravimetric International (BGI) which do not play a central role in the study of geodesy, satellite orbit computation, & geophysics but by mathematical transformation of gravity field coefficients using Normalized Legendre Polynomial high resolution ocean bottom pressure (OBP) data is generated. Real time sea level monitored OBP data of 0.3° by 1° spatial resolution using Kalman filter (kf080) for past 10 years by Estimating the Circulation and Climate of the Ocean (ECCO) has been correlated with OBP data from gravity field coefficients which attribute a feasible study on future tsunami detection system from space and in identification of most suitable sites to place OBP sensors near deep trenches. The Levitus Climatological temperature and salinity are assimilated into the version of the MITGCM using the ad-joint method to obtain the sea height segment. Then TOPEX/Poseidon satellite altimeter, surface momentum, heat, and freshwater fluxes from NCEP reanalysis product and the dynamic ocean topography DOT_DNSCMSS08_EGM08 is used to interpret sea-bottom elevation. Then all datasets are associated under raster calculator in ArcGIS 9.3 using Boolean Intersection Algebra Method and proximal analysis tools with high resolution sea floor topographic map. Afterward tsunami prone area and suitable sites for set up of BPR as analyzed in this research is authenticated by using Passive microwave radiometry system for Tsunami Hazard Zone Mapping by network of seismometers. Thus using such methodology for early Tsunami Hazard Zone Mapping also increase accuracy and reduce time period for tsunami predictions. KEYWORDS:, Tsunami, Gravity Field Coefficients, Ocean Bottom Pressure, ECCO, BGI, Sea Bottom Temperature, Sea Floor Topography.

How Visual Imagery Contributed to College: A Case of How Visual Imagery Contributes to a College Algebra Student's Understanding of the Concept of Function in the United States

ERIC Educational Resources Information Center

Lane, Rebekah M.

2011-01-01

This investigation utilized the qualitative case study method. Seventy-one College Algebra students were given a mathematical processing instrument. This testing device measured a student's preference for visual thinking. Two students were purposefully selected using the instrument. The visual mathematical learner (VL) was discussed in this…

An algebraic program for the states associated with the U(5) ⊃ O(5) ⊃ O(3) chain of groups

NASA Astrophysics Data System (ADS)

Yannouleas, C.; Pacheco, J. M.

1988-12-01

A REDUCE program is presented that calculates algebraically the γ-dependent part of the states associated with the U(5) ⊃ O(5) ⊃ O(3) chain of groups, familiar from nuclear-structure problems. The method of solution is a direct implementation of the analytic expressions given by Chacón and Moshinsky.

Polyhedral realizations of crystal bases for quantum algebras of classical affine types

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

Hoshino, A.

2013-05-15

We give the explicit forms of the crystal bases B({infinity}) for the quantum affine algebras of types A{sub 2n-1}{sup (2)}, A{sub 2n}{sup (2)}, B{sub n}{sup (1)}, C{sub n}{sup (1)}, D{sub n}{sup (1)}, and D{sub n+1}{sup (2)} by using the method of polyhedral realizations of crystal bases.

An Investigation into Challenges Faced by Secondary School Teachers and Pupils in Algebraic Linear Equations: A Case of Mufulira District, Zambia

ERIC Educational Resources Information Center

Samuel, Koji; Mulenga, H. M.; Angel, Mukuka

2016-01-01

This paper investigates the challenges faced by secondary school teachers and pupils in the teaching and learning of algebraic linear equations. The study involved 80 grade 11 pupils and 15 teachers of mathematics, drawn from 4 selected secondary schools in Mufulira district, Zambia in Central Africa. A descriptive survey method was employed to…

Identification of Large Space Structures on Orbit

DTIC Science & Technology

1986-09-01

requires only the eigenvector corresponding to the eigenvector 93 .:. ,S --- k’.’ L derivative being calculated. However, a set of linear algebraic ...Journal of Guidance, Control and Dynamics. 204. Noble, B. and J. W. Daniel, Applied Linear Algebra , Prentice-Hall, Inc., 1977. 205. Nurre, G. S., R. S...4.2.1. Linear Relationships . . . . . . . . . . 114 4.2.2. Nonlinear Relationships . . . . . . . . . 120 4.3. Series Expansion Methods

Genetic hotels for the standard genetic code: evolutionary analysis based upon novel three-dimensional algebraic models.

PubMed

José, Marco V; Morgado, Eberto R; Govezensky, Tzipe

2011-07-01

Herein, we rigorously develop novel 3-dimensional algebraic models called Genetic Hotels of the Standard Genetic Code (SGC). We start by considering the primeval RNA genetic code which consists of the 16 codons of type RNY (purine-any base-pyrimidine). Using simple algebraic operations, we show how the RNA code could have evolved toward the current SGC via two different intermediate evolutionary stages called Extended RNA code type I and II. By rotations or translations of the subset RNY, we arrive at the SGC via the former (type I) or via the latter (type II), respectively. Biologically, the Extended RNA code type I, consists of all codons of the type RNY plus codons obtained by considering the RNA code but in the second (NYR type) and third (YRN type) reading frames. The Extended RNA code type II, comprises all codons of the type RNY plus codons that arise from transversions of the RNA code in the first (YNY type) and third (RNR) nucleotide bases. Since the dimensions of remarkable subsets of the Genetic Hotels are not necessarily integer numbers, we also introduce the concept of algebraic fractal dimension. A general decoding function which maps each codon to its corresponding amino acid or the stop signals is also derived. The Phenotypic Hotel of amino acids is also illustrated. The proposed evolutionary paths are discussed in terms of the existing theories of the evolution of the SGC. The adoption of 3-dimensional models of the Genetic and Phenotypic Hotels will facilitate the understanding of the biological properties of the SGC.

Steenrod homotopy

NASA Astrophysics Data System (ADS)

Melikhov, Sergey A.

2009-06-01

Steenrod homotopy theory is a natural framework for doing algebraic topology on general spaces in terms of algebraic topology of polyhedra; or from a different viewpoint, it studies the topology of the \\lim^1 functor (for inverse sequences of groups). This paper is primarily concerned with the case of compacta, in which Steenrod homotopy coincides with strong shape. An attempt is made to simplify the foundations of the theory and to clarify and improve some of its major results. With geometric tools such as Milnor's telescope compactification, comanifolds (=mock bundles), and the Pontryagin-Thom construction, new simple proofs are obtained for results by Barratt-Milnor, Geoghegan-Krasinkiewicz, Dydak, Dydak-Segal, Krasinkiewicz-Minc, Cathey, Mittag-Leffler-Bourbaki, Fox, Eda-Kawamura, Edwards-Geoghegan, Jussila, and for three unpublished results by Shchepin. An error in Lisitsa's proof of the `Hurewicz theorem in Steenrod homotopy' is corrected. It is shown that over compacta, R.H. Fox's overlayings are equivalent to I.M. James' uniform covering maps. Other results include: \\bullet A morphism between inverse sequences of countable (possibly non-Abelian) groups that induces isomorphisms on \\lim and \\lim^1 is invertible in the pro-category. This implies the `Whitehead theorem in Steenrod homotopy', thereby answering two questions of Koyama. \\bullet If X is an LC_{n-1}-compactum, n\\ge 1, then its n-dimensional Steenrod homotopy classes are representable by maps S^n\\to\

ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra

PubMed Central

2011-01-01

Background Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. Results We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Conclusions Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web-based tool for several different input formats, and it makes analysis of complex models accessible to a larger community, as it is platform independent as a web-service and does not require understanding of the underlying mathematics. PMID:21774817

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

NASA Technical Reports Server (NTRS)

Tsai, Wen-Lang; Kikuchi, Noboru

1993-01-01

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

Noncommutative mapping from the symplectic formalism

NASA Astrophysics Data System (ADS)

De Andrade, M. A.; Neves, C.

2018-01-01

Bopp's shifts will be generalized through a symplectic formalism. A special procedure, like "diagonalization," which drives the completely deformed symplectic matrix to the standard symplectic form was found as suggested by Faddeev-Jackiw. Consequently, the correspondent transformation matrix guides the mapping from commutative to noncommutative (NC) phase-space coordinates. Bopp's shifts may be directly generalized from this mapping. In this context, all the NC and scale parameters, introduced into the brackets, will be lifted to the Hamiltonian. Well-known results, obtained using ⋆-product, will be reproduced without considering that the NC parameters are small (≪1). Besides, it will be shown that different choices for NC algebra among the symplectic variables generate distinct dynamical systems, in which they may not even connect with each other, and that some of them can preserve, break, or restore the symmetry of the system. Further, we will also discuss the charge and mass rescaling in a simple model.

Mathematics make microbes beautiful, beneficial, and bountiful.

PubMed

Jungck, John R

2012-01-01

Microbiology is a rich area for visualizing the importance of mathematics in terms of designing experiments, data mining, testing hypotheses, and visualizing relationships. Historically, Nobel Prizes have acknowledged the close interplay between mathematics and microbiology in such examples as the fluctuation test and mutation rates using Poisson statistics by Luria and Delbrück and the use of graph theory of polyhedra by Caspar and Klug. More and more contemporary microbiology journals feature mathematical models, computational algorithms and heuristics, and multidimensional visualizations. While revolutions in research have driven these initiatives, a commensurate effort needs to be made to incorporate much more mathematics into the professional preparation of microbiologists. In order not to be daunting to many educators, a Bloom-like "Taxonomy of Quantitative Reasoning" is shared with explicit examples of microbiological activities for engaging students in (a) counting, measuring, calculating using image analysis of bacterial colonies and viral infections on variegated leaves, measurement of fractal dimensions of beautiful colony morphologies, and counting vertices, edges, and faces on viral capsids and using graph theory to understand self assembly; (b) graphing, mapping, ordering by applying linear, exponential, and logistic growth models of public health and sanitation problems, revisiting Snow's epidemiological map of cholera with computational geometry, and using interval graphs to do complementation mapping, deletion mapping, food webs, and microarray heatmaps; (c) problem solving by doing gene mapping and experimental design, and applying Boolean algebra to gene regulation of operons; (d) analysis of the "Bacterial Bonanza" of microbial sequence and genomic data using bioinformatics and phylogenetics; (e) hypothesis testing-again with phylogenetic trees and use of Poisson statistics and the Luria-Delbrück fluctuation test; and (f) modeling of biodiversity by using game theory, of epidemics with algebraic models, bacterial motion by using motion picture analysis and fluid mechanics of motility in multiple dimensions through the physics of "Life at Low Reynolds Numbers," and pattern formation of quorum sensing bacterial populations. Through a developmental model for preprofessional education that emphasizes the beauty, utility, and diversity of microbiological systems, we hope to foster creativity as well as mathematically rigorous reasoning. Copyright © 2012 Elsevier Inc. All rights reserved.

Global paths of time-periodic solutions of the Benjamin-Ono equation connecting arbitrary traveling waves

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

Ambrose, David M.; Wilkening, Jon

2008-12-11

We classify all bifurcations from traveling waves to non-trivial time-periodic solutions of the Benjamin-Ono equation that are predicted by linearization. We use a spectrally accurate numerical continuation method to study several paths of non-trivial solutions beyond the realm of linear theory. These paths are found to either re-connect with a different traveling wave or to blow up. In the latter case, as the bifurcation parameter approaches a critical value, the amplitude of the initial condition grows without bound and the period approaches zero. We propose a conjecture that gives the mapping from one bifurcation to its counterpart on the othermore » side of the path of non-trivial solutions. By experimentation with data fitting, we identify the form of the exact solutions on the path connecting two traveling waves, which represents the Fourier coefficients of the solution as power sums of a finite number of particle positions whose elementary symmetric functions execute simple orbits in the complex plane (circles or epicycles). We then solve a system of algebraic equations to express the unknown constants in the new representation in terms of the mean, a spatial phase, a temporal phase, four integers (enumerating the bifurcation at each end of the path) and one additional bifurcation parameter. We also find examples of interior bifurcations from these paths of already non-trivial solutions, but we do not attempt to analyze their algebraic structure.« less

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

NASA Astrophysics Data System (ADS)

Chen, Xingwu; Zhang, Weinian

2009-10-01

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

Existence and global exponential stability of periodic solution of memristor-based BAM neural networks with time-varying delays.

PubMed

Li, Hongfei; Jiang, Haijun; Hu, Cheng

2016-03-01

In this paper, we investigate a class of memristor-based BAM neural networks with time-varying delays. Under the framework of Filippov solutions, boundedness and ultimate boundedness of solutions of memristor-based BAM neural networks are guaranteed by Chain rule and inequalities technique. Moreover, a new method involving Yoshizawa-like theorem is favorably employed to acquire the existence of periodic solution. By applying the theory of set-valued maps and functional differential inclusions, an available Lyapunov functional and some new testable algebraic criteria are derived for ensuring the uniqueness and global exponential stability of periodic solution of memristor-based BAM neural networks. The obtained results expand and complement some previous work on memristor-based BAM neural networks. Finally, a numerical example is provided to show the applicability and effectiveness of our theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.

Matrix Factorizations at Scale: a Comparison of Scientific Data Analytics in Spark and C+MPI Using Three Case Studies

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

Gittens, Alex; Devarakonda, Aditya; Racah, Evan

We explore the trade-offs of performing linear algebra using Apache Spark, compared to traditional C and MPI implementations on HPC platforms. Spark is designed for data analytics on cluster computing platforms with access to local disks and is optimized for data-parallel tasks. We examine three widely-used and important matrix factorizations: NMF (for physical plausibility), PCA (for its ubiquity) and CX (for data interpretability). We apply these methods to 1.6TB particle physics, 2.2TB and 16TB climate modeling and 1.1TB bioimaging data. The data matrices are tall-and-skinny which enable the algorithms to map conveniently into Spark’s data parallel model. We perform scalingmore » experiments on up to 1600 Cray XC40 nodes, describe the sources of slowdowns, and provide tuning guidance to obtain high performance.« less

Dealing with Uncertainties in Initial Orbit Determination

NASA Technical Reports Server (NTRS)

Armellin, Roberto; Di Lizia, Pierluigi; Zanetti, Renato

2015-01-01

A method to deal with uncertainties in initial orbit determination (IOD) is presented. This is based on the use of Taylor differential algebra (DA) to nonlinearly map the observation uncertainties from the observation space to the state space. When a minimum set of observations is available DA is used to expand the solution of the IOD problem in Taylor series with respect to measurement errors. When more observations are available high order inversion tools are exploited to obtain full state pseudo-observations at a common epoch. The mean and covariance of these pseudo-observations are nonlinearly computed by evaluating the expectation of high order Taylor polynomials. Finally, a linear scheme is employed to update the current knowledge of the orbit. Angles-only observations are considered and simplified Keplerian dynamics adopted to ease the explanation. Three test cases of orbit determination of artificial satellites in different orbital regimes are presented to discuss the feature and performances of the proposed methodology.

Persistent topological features of dynamical systems

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

Maletić, Slobodan, E-mail: slobodan@hitsz.edu.cn; Institute of Nuclear Sciences Vinča, University of Belgrade, Belgrade; Zhao, Yi, E-mail: zhao.yi@hitsz.edu.cn

Inspired by an early work of Muldoon et al., Physica D 65, 1–16 (1993), we present a general method for constructing simplicial complex from observed time series of dynamical systems based on the delay coordinate reconstruction procedure. The obtained simplicial complex preserves all pertinent topological features of the reconstructed phase space, and it may be analyzed from topological, combinatorial, and algebraic aspects. In focus of this study is the computation of homology of the invariant set of some well known dynamical systems that display chaotic behavior. Persistent homology of simplicial complex and its relationship with the embedding dimensions are examinedmore » by studying the lifetime of topological features and topological noise. The consistency of topological properties for different dynamic regimes and embedding dimensions is examined. The obtained results shed new light on the topological properties of the reconstructed phase space and open up new possibilities for application of advanced topological methods. The method presented here may be used as a generic method for constructing simplicial complex from a scalar time series that has a number of advantages compared to the mapping of the same time series to a complex network.« less

High-order computer-assisted estimates of topological entropy

NASA Astrophysics Data System (ADS)

Grote, Johannes

The concept of Taylor Models is introduced, which offers highly accurate C0-estimates for the enclosures of functional dependencies, combining high-order Taylor polynomial approximation of functions and rigorous estimates of the truncation error, performed using verified interval arithmetic. The focus of this work is on the application of Taylor Models in algorithms for strongly nonlinear dynamical systems. A method to obtain sharp rigorous enclosures of Poincare maps for certain types of flows and surfaces is developed and numerical examples are presented. Differential algebraic techniques allow the efficient and accurate computation of polynomial approximations for invariant curves of certain planar maps around hyperbolic fixed points. Subsequently we introduce a procedure to extend these polynomial curves to verified Taylor Model enclosures of local invariant manifolds with C0-errors of size 10-10--10 -14, and proceed to generate the global invariant manifold tangle up to comparable accuracy through iteration in Taylor Model arithmetic. Knowledge of the global manifold structure up to finite iterations of the local manifold pieces enables us to find all homoclinic and heteroclinic intersections in the generated manifold tangle. Combined with the mapping properties of the homoclinic points and their ordering we are able to construct a subshift of finite type as a topological factor of the original planar system to obtain rigorous lower bounds for its topological entropy. This construction is fully automatic and yields homoclinic tangles with several hundred homoclinic points. As an example rigorous lower bounds for the topological entropy of the Henon map are computed, which to the best knowledge of the authors yield the largest such estimates published so far.

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

PubMed

Fu, Zhongtao; Yang, Wenyu; Yang, Zhen

2013-08-01

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

Techniques for grid manipulation and adaptation. [computational fluid dynamics

NASA Technical Reports Server (NTRS)

Choo, Yung K.; Eisemann, Peter R.; Lee, Ki D.

1992-01-01

Two approaches have been taken to provide systematic grid manipulation for improved grid quality. One is the control point form (CPF) of algebraic grid generation. It provides explicit control of the physical grid shape and grid spacing through the movement of the control points. It works well in the interactive computer graphics environment and hence can be a good candidate for integration with other emerging technologies. The other approach is grid adaptation using a numerical mapping between the physical space and a parametric space. Grid adaptation is achieved by modifying the mapping functions through the effects of grid control sources. The adaptation process can be repeated in a cyclic manner if satisfactory results are not achieved after a single application.

XLWrap - Querying and Integrating Arbitrary Spreadsheets with SPARQL

NASA Astrophysics Data System (ADS)

Langegger, Andreas; Wöß, Wolfram

In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF wrappers supports cross tables and tables where data is not aligned in rows. Similar to RDF123, XLWrap is based on template graphs where fragments of triples can be mapped to specific cells of a spreadsheet. Additionally, it features a full expression algebra based on the syntax of OpenOffice Calc and various shift operations, which can be used to repeat similar mappings in order to wrap cross tables including multiple sheets and spreadsheet files. The set of available expression functions includes most of the native functions of OpenOffice Calc and can be easily extended by users of XLWrap.

A Quantitative Study Analyzing Predictive Factors That Affect Achievement on Florida's Algebra I End-of-Course Exam (EOC)

ERIC Educational Resources Information Center

Holley, Hope D.

2017-01-01

Despite research that high-stakes tests do not improve knowledge, Florida requires students to pass an Algebra I End-of-Course exam (EOC) to earn a high school diploma. Test passing scores are determined by a raw score to t-score to scale score analysis. This method ultimately results as a comparative test model where students' passage is…

Deriving the Work Done by an Inverse Square Force in Non-Calculus-Based Introductory Physics Courses

ERIC Educational Resources Information Center

Hu, Ben Yu-Kuang

2012-01-01

I describe a method of evaluating the integral of 1/r[superscript 2] with respect to r that uses only algebra and the concept of area underneath a curve, and which does not formally employ any calculus. This is useful for algebra-based introductory physics classes (where the use of calculus is forbidden) to derive the work done by the force of one…

On a programming language for graph algorithms

NASA Technical Reports Server (NTRS)

Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.

1971-01-01

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Topologies on quantum topoi induced by quantization

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

Nakayama, Kunji

2013-07-15

In the present paper, we consider effects of quantization in a topos approach of quantum theory. A quantum system is assumed to be coded in a quantum topos, by which we mean the topos of presheaves on the context category of commutative subalgebras of a von Neumann algebra of bounded operators on a Hilbert space. A classical system is modeled by a Lie algebra of classical observables. It is shown that a quantization map from the classical observables to self-adjoint operators on the Hilbert space naturally induces geometric morphisms from presheaf topoi related to the classical system to the quantummore » topos. By means of the geometric morphisms, we give Lawvere-Tierney topologies on the quantum topos (and their equivalent Grothendieck topologies on the context category). We show that, among them, there exists a canonical one which we call a quantization topology. We furthermore give an explicit expression of a sheafification functor associated with the quantization topology.« less

Radiative opacities of iron using a difference algebraic converging method at temperatures near solar convection zone

NASA Astrophysics Data System (ADS)

Fan, Zhixiang; Sun, Weiguo; Zhang, Yi; Fu, Jia; Hu, Shide; Fan, Qunchao

2018-03-01

An interpolation method named difference algebraic converging method for opacity (DACMo) is proposed to study the opacities and transmissions of metal plasmas. The studies on iron plasmas at temperatures near the solar convection zone show that (1) the DACMo values reproduce most spectral structures and magnitudes of experimental opacities and transmissions. (2) The DACMo can be used to predict unknown opacities at other temperature Te' and density ρ' using the opacity constants obtained at ( Te , ρ). (3) The DACMo may predict reasonable opacities which may not be available experimentally but the least-squares (LS) method does not. (4) The computational speed of the DACMo is at least 10 times faster than that of the original difference converging method for opacity.

Concerning an application of the method of least squares with a variable weight matrix

NASA Technical Reports Server (NTRS)

Sukhanov, A. A.

1979-01-01

An estimate of a state vector for a physical system when the weight matrix in the method of least squares is a function of this vector is considered. An iterative procedure is proposed for calculating the desired estimate. Conditions for the existence and uniqueness of the limit of this procedure are obtained, and a domain is found which contains the limit estimate. A second method for calculating the desired estimate which reduces to the solution of a system of algebraic equations is proposed. The question of applying Newton's method of tangents to solving the given system of algebraic equations is considered and conditions for the convergence of the modified Newton's method are obtained. Certain properties of the estimate obtained are presented together with an example.

The optimal inventory policy for EPQ model under trade credit

NASA Astrophysics Data System (ADS)

Chung, Kun-Jen

2010-09-01

Huang and Huang [(2008), 'Optimal Inventory Replenishment Policy for the EPQ Model Under Trade Credit without Derivatives International Journal of Systems Science, 39, 539-546] use the algebraic method to determine the optimal inventory replenishment policy for the retailer in the extended model under trade credit. However, the algebraic method has its limit of application such that validities of proofs of Theorems 1-4 in Huang and Huang (2008) are questionable. The main purpose of this article is not only to indicate shortcomings but also to present the accurate proofs for Huang and Huang (2008).

Algebraic multigrid methods applied to problems in computational structural mechanics

NASA Technical Reports Server (NTRS)

Mccormick, Steve; Ruge, John

1989-01-01

The development of algebraic multigrid (AMG) methods and their application to certain problems in structural mechanics are described with emphasis on two- and three-dimensional linear elasticity equations and the 'jacket problems' (three-dimensional beam structures). Various possible extensions of AMG are also described. The basic idea of AMG is to develop the discretization sequence based on the target matrix and not the differential equation. Therefore, the matrix is analyzed for certain dependencies that permit the proper construction of coarser matrices and attendant transfer operators. In this manner, AMG appears to be adaptable to structural analysis applications.

Multiple solution of linear algebraic systems by an iterative method with recomputed preconditioner in the analysis of microstrip structures

NASA Astrophysics Data System (ADS)

Ahunov, Roman R.; Kuksenko, Sergey P.; Gazizov, Talgat R.

2016-06-01

A multiple solution of linear algebraic systems with dense matrix by iterative methods is considered. To accelerate the process, the recomputing of the preconditioning matrix is used. A priory condition of the recomputing based on change of the arithmetic mean of the current solution time during the multiple solution is proposed. To confirm the effectiveness of the proposed approach, the numerical experiments using iterative methods BiCGStab and CGS for four different sets of matrices on two examples of microstrip structures are carried out. For solution of 100 linear systems the acceleration up to 1.6 times, compared to the approach without recomputing, is obtained.

Software Development Of XML Parser Based On Algebraic Tools

NASA Astrophysics Data System (ADS)

Georgiev, Bozhidar; Georgieva, Adriana

2011-12-01

In this paper, is presented one software development and implementation of an algebraic method for XML data processing, which accelerates XML parsing process. Therefore, the proposed in this article nontraditional approach for fast XML navigation with algebraic tools contributes to advanced efforts in the making of an easier user-friendly API for XML transformations. Here the proposed software for XML documents processing (parser) is easy to use and can manage files with strictly defined data structure. The purpose of the presented algorithm is to offer a new approach for search and restructuring hierarchical XML data. This approach permits fast XML documents processing, using algebraic model developed in details in previous works of the same authors. So proposed parsing mechanism is easy accessible to the web consumer who is able to control XML file processing, to search different elements (tags) in it, to delete and to add a new XML content as well. The presented various tests show higher rapidity and low consumption of resources in comparison with some existing commercial parsers.

Algebraic Thinking in Solving Linier Program at High School Level: Female Student’s Field Independent Cognitive Style

NASA Astrophysics Data System (ADS)

Hardiani, N.; Budayasa, I. K.; Juniati, D.

2018-01-01

The aim of this study was to describe algebraic thinking of high school female student’s field independent cognitive style in solving linier program problem by revealing deeply the female students’ responses. Subjects in this study were 7 female students having field independent cognitive style in class 11. The type of this research was descriptive qualitative. The method of data collection used was observation, documentation, and interview. Data analysis technique was by reduction, presentation, and conclusion. The results of this study showed that the female students with field independent cognitive style in solving the linier program problem had the ability to represent algebraic ideas from the narrative question that had been read by manipulating symbols and variables presented in tabular form, creating and building mathematical models in two variables linear inequality system which represented algebraic ideas, and interpreting the solutions as variables obtained from the point of intersection in the solution area to obtain maximum benefit.

Virasoro algebra in the KN algebra; Bosonic string with fermionic ghosts on Riemann surfaces

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

Koibuchi, H.

1991-10-10

In this paper the bosonic string model with fermionic ghosts is considered in the framework of the KN algebra. The authors' attentions are paid to representations of KN algebra and a Clifford algebra of the ghosts. The authors show that a Virasoro-like algebra is obtained from KN algebra when KN algebra has certain antilinear anti-involution, and that it is isomorphic to the usual Virasoro algebra. The authors show that there is an expected relation between a central charge of this Virasoro-like algebra and an anomaly of the combined system.

Elementary operators on self-adjoint operators

NASA Astrophysics Data System (ADS)

Molnar, Lajos; Semrl, Peter

2007-03-01

Let H be a Hilbert space and let and be standard *-operator algebras on H. Denote by and the set of all self-adjoint operators in and , respectively. Assume that and are surjective maps such that M(AM*(B)A)=M(A)BM(A) and M*(BM(A)B)=M*(B)AM*(B) for every pair , . Then there exist an invertible bounded linear or conjugate-linear operator and a constant c[set membership, variant]{-1,1} such that M(A)=cTAT*, , and M*(B)=cT*BT, .

Mathematical Modeling for Inherited Diseases.

PubMed

Anis, Saima; Khan, Madad; Khan, Saqib

2017-01-01

We introduced a new nonassociative algebra, namely, left almost algebra, and discussed some of its genetic properties. We discussed the relation of this algebra with flexible algebra, Jordan algebra, and generalized Jordan algebra.

Mathematical Modeling for Inherited Diseases

PubMed Central

Khan, Saqib

2017-01-01

We introduced a new nonassociative algebra, namely, left almost algebra, and discussed some of its genetic properties. We discussed the relation of this algebra with flexible algebra, Jordan algebra, and generalized Jordan algebra. PMID:28781606

An Algebraic Method for Exploring Quantum Monodromy and Quantum Phase Transitions in Non-Rigid Molecules

NASA Astrophysics Data System (ADS)

Larese, D.; Iachello, F.

2011-06-01

A simple algebraic Hamiltonian has been used to explore the vibrational and rotational spectra of the skeletal bending modes of HCNO, BrCNO, NCNCS, and other ``floppy`` (quasi-linear or quasi-bent) molecules. These molecules have large-amplitude, low-energy bending modes and champagne-bottle potential surfaces, making them good candidates for observing quantum phase transitions (QPT). We describe the geometric phase transitions from bent to linear in these and other non-rigid molecules, quantitatively analysing the spectroscopy signatures of ground state QPT, excited state QPT, and quantum monodromy.The algebraic framework is ideal for this work because of its small calculational effort yet robust results. Although these methods have historically found success with tri- and four-atomic molecules, we now address five-atomic and simple branched molecules such as CH_3NCO and GeH_3NCO. Extraction of potential functions is completed for several molecules, resulting in predictions of barriers to linearity and equilibrium bond angles.

Computation of indirect nuclear spin-spin couplings with reduced complexity in pure and hybrid density functional approximations.

PubMed

Luenser, Arne; Kussmann, Jörg; Ochsenfeld, Christian

2016-09-28

We present a (sub)linear-scaling algorithm to determine indirect nuclear spin-spin coupling constants at the Hartree-Fock and Kohn-Sham density functional levels of theory. Employing efficient integral algorithms and sparse algebra routines, an overall (sub)linear scaling behavior can be obtained for systems with a non-vanishing HOMO-LUMO gap. Calculations on systems with over 1000 atoms and 20 000 basis functions illustrate the performance and accuracy of our reference implementation. Specifically, we demonstrate that linear algebra dominates the runtime of conventional algorithms for 10 000 basis functions and above. Attainable speedups of our method exceed 6 × in total runtime and 10 × in the linear algebra steps for the tested systems. Furthermore, a convergence study of spin-spin couplings of an aminopyrazole peptide upon inclusion of the water environment is presented: using the new method it is shown that large solvent spheres are necessary to converge spin-spin coupling values.

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

NASA Astrophysics Data System (ADS)

Winicour, Jeffrey

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

Coherent population transfer in multilevel systems with magnetic sublevels. II. Algebraic analysis

NASA Astrophysics Data System (ADS)

Martin, J.; Shore, B. W.; Bergmann, K.

1995-07-01

We extend previous theoretical work on coherent population transfer by stimulated Raman adiabatic passage for states involving nonzero angular momentum. The pump and Stokes fields are either copropagating or counterpropagating with the corresponding linearly polarized electric-field vectors lying in a common plane with the magnetic-field direction. Zeeman splitting lifts the magnetic sublevel degeneracy. We present an algebraic analysis of dressed-state properties to explain the behavior noted in numerical studies. In particular, we discuss conditions which are likely to lead to a failure of complete population transfer. The applied strategy, based on simple methods of linear algebra, will also be successful for other types of discrete multilevel systems, provided the rotating-wave and adiabatic approximation are valid.

Affine.m—Mathematica package for computations in representation theory of finite-dimensional and affine Lie algebras

NASA Astrophysics Data System (ADS)

Nazarov, Anton

2012-11-01

In this paper we present Affine.m-a program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. The algorithms are based on the properties of weights and Weyl symmetry. Computation of weight multiplicities in irreducible and Verma modules, branching of representations and tensor product decomposition are the most important problems for us. These problems have numerous applications in physics and we provide some examples of these applications. The program is implemented in the popular computer algebra system Mathematica and works with finite-dimensional and affine Lie algebras. Catalogue identifier: AENA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENB_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, UK Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 24 844 No. of bytes in distributed program, including test data, etc.: 1 045 908 Distribution format: tar.gz Programming language: Mathematica. Computer: i386-i686, x86_64. Operating system: Linux, Windows, Mac OS, Solaris. RAM: 5-500 Mb Classification: 4.2, 5. Nature of problem: Representation theory of finite-dimensional Lie algebras has many applications in different branches of physics, including elementary particle physics, molecular physics, nuclear physics. Representations of affine Lie algebras appear in string theories and two-dimensional conformal field theory used for the description of critical phenomena in two-dimensional systems. Also Lie symmetries play a major role in a study of quantum integrable systems. Solution method: We work with weights and roots of finite-dimensional and affine Lie algebras and use Weyl symmetry extensively. Central problems which are the computations of weight multiplicities, branching and fusion coefficients are solved using one general recurrent algorithm based on generalization of Weyl character formula. We also offer alternative implementation based on the Freudenthal multiplicity formula which can be faster in some cases. Restrictions: Computational complexity grows fast with the rank of an algebra, so computations for algebras of ranks greater than 8 are not practical. Unusual features: We offer the possibility of using a traditional mathematical notation for the objects in representation theory of Lie algebras in computations if Affine.m is used in the Mathematica notebook interface. Running time: From seconds to days depending on the rank of the algebra and the complexity of the representation.

Reusable Software Component Retrieval via Normalized Algebraic Specifications

DTIC Science & Technology

1991-12-01

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

Adler-Kostant-Symes scheme for face and Calogero-Moser-Sutherland-type models

NASA Astrophysics Data System (ADS)

Jurčo, Branislav; Schupp, Peter

1998-07-01

We give the construction of quantum Lax equations for IRF models and the difference version of the Calogero-Moser-Sutherland model introduced by Ruijsenaars. We solve the equations using factorization properties of the underlying face Hopf algebras/elliptic quantum groups. This construction is in the spirit of the Adler-Kostant-Symes method and generalizes our previous work to the case of face Hopf algebras/elliptic quantum groups with dynamical R matrices.

Conical Lens for 5-Inch/54 Gun Launched Missile

DTIC Science & Technology

1981-06-01

Propagation, Interferenceand Diffraction of Light, 2nd ed. (revised), p. 121-124, Pergamon Press, 1964. 10. Anton , Howard, Elementary Linear Algebra , p. 1-21...equations is nonlinear in x, but is linear in the coefficients. Therefore, the techniques of linear algebra can be used on equation (F-13). The method...This thesis assumes the air to be homogenous, isotropic, linear , time indepen- dent (HILT) and free of shock waves in order to investigate the

An algebraic method for constructing stable and consistent autoregressive filters

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

Harlim, John, E-mail: jharlim@psu.edu; Department of Meteorology, the Pennsylvania State University, University Park, PA 16802; Hong, Hoon, E-mail: hong@ncsu.edu

2015-02-15

In this paper, we introduce an algebraic method to construct stable and consistent univariate autoregressive (AR) models of low order for filtering and predicting nonlinear turbulent signals with memory depth. By stable, we refer to the classical stability condition for the AR model. By consistent, we refer to the classical consistency constraints of Adams–Bashforth methods of order-two. One attractive feature of this algebraic method is that the model parameters can be obtained without directly knowing any training data set as opposed to many standard, regression-based parameterization methods. It takes only long-time average statistics as inputs. The proposed method provides amore » discretization time step interval which guarantees the existence of stable and consistent AR model and simultaneously produces the parameters for the AR models. In our numerical examples with two chaotic time series with different characteristics of decaying time scales, we find that the proposed AR models produce significantly more accurate short-term predictive skill and comparable filtering skill relative to the linear regression-based AR models. These encouraging results are robust across wide ranges of discretization times, observation times, and observation noise variances. Finally, we also find that the proposed model produces an improved short-time prediction relative to the linear regression-based AR-models in forecasting a data set that characterizes the variability of the Madden–Julian Oscillation, a dominant tropical atmospheric wave pattern.« less

Spatio-Temporal Constrained Human Trajectory Generation from the PIR Motion Detector Sensor Network Data: A Geometric Algebra Approach

PubMed Central

Yu, Zhaoyuan; Yuan, Linwang; Luo, Wen; Feng, Linyao; Lv, Guonian

2015-01-01

Passive infrared (PIR) motion detectors, which can support long-term continuous observation, are widely used for human motion analysis. Extracting all possible trajectories from the PIR sensor networks is important. Because the PIR sensor does not log location and individual information, none of the existing methods can generate all possible human motion trajectories that satisfy various spatio-temporal constraints from the sensor activation log data. In this paper, a geometric algebra (GA)-based approach is developed to generate all possible human trajectories from the PIR sensor network data. Firstly, the representation of the geographical network, sensor activation response sequences and the human motion are represented as algebraic elements using GA. The human motion status of each sensor activation are labeled using the GA-based trajectory tracking. Then, a matrix multiplication approach is developed to dynamically generate the human trajectories according to the sensor activation log and the spatio-temporal constraints. The method is tested with the MERL motion database. Experiments show that our method can flexibly extract the major statistical pattern of the human motion. Compared with direct statistical analysis and tracklet graph method, our method can effectively extract all possible trajectories of the human motion, which makes it more accurate. Our method is also likely to provides a new way to filter other passive sensor log data in sensor networks. PMID:26729123

Spatio-Temporal Constrained Human Trajectory Generation from the PIR Motion Detector Sensor Network Data: A Geometric Algebra Approach.

PubMed

Yu, Zhaoyuan; Yuan, Linwang; Luo, Wen; Feng, Linyao; Lv, Guonian

2015-12-30

Passive infrared (PIR) motion detectors, which can support long-term continuous observation, are widely used for human motion analysis. Extracting all possible trajectories from the PIR sensor networks is important. Because the PIR sensor does not log location and individual information, none of the existing methods can generate all possible human motion trajectories that satisfy various spatio-temporal constraints from the sensor activation log data. In this paper, a geometric algebra (GA)-based approach is developed to generate all possible human trajectories from the PIR sensor network data. Firstly, the representation of the geographical network, sensor activation response sequences and the human motion are represented as algebraic elements using GA. The human motion status of each sensor activation are labeled using the GA-based trajectory tracking. Then, a matrix multiplication approach is developed to dynamically generate the human trajectories according to the sensor activation log and the spatio-temporal constraints. The method is tested with the MERL motion database. Experiments show that our method can flexibly extract the major statistical pattern of the human motion. Compared with direct statistical analysis and tracklet graph method, our method can effectively extract all possible trajectories of the human motion, which makes it more accurate. Our method is also likely to provides a new way to filter other passive sensor log data in sensor networks.

Identification of control targets in Boolean molecular network models via computational algebra.

PubMed

Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard

2016-09-23

Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

Denoised and texture enhanced MVCT to improve soft tissue conspicuity

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

Sheng, Ke, E-mail: ksheng@mednet.ucla.edu; Qi, Sharon X.; Gou, Shuiping

Purpose: MVCT images have been used in TomoTherapy treatment to align patients based on bony anatomies but its usefulness for soft tissue registration, delineation, and adaptive radiation therapy is limited due to insignificant photoelectric interaction components and the presence of noise resulting from low detector quantum efficiency of megavoltage x-rays. Algebraic reconstruction with sparsity regularizers as well as local denoising methods has not significantly improved the soft tissue conspicuity. The authors aim to utilize a nonlocal means denoising method and texture enhancement to recover the soft tissue information in MVCT (DeTECT). Methods: A block matching 3D (BM3D) algorithm was adaptedmore » to reduce the noise while keeping the texture information of the MVCT images. Following imaging denoising, a saliency map was created to further enhance visual conspicuity of low contrast structures. In this study, BM3D and saliency maps were applied to MVCT images of a CT imaging quality phantom, a head and neck, and four prostate patients. Following these steps, the contrast-to-noise ratios (CNRs) were quantified. Results: By applying BM3D denoising and saliency map, postprocessed MVCT images show remarkable improvements in imaging contrast without compromising resolution. For the head and neck patient, the difficult-to-see lymph nodes and vein in the carotid space in the original MVCT image became conspicuous in DeTECT. For the prostate patients, the ambiguous boundary between the bladder and the prostate in the original MVCT was clarified. The CNRs of phantom low contrast inserts were improved from 1.48 and 3.8 to 13.67 and 16.17, respectively. The CNRs of two regions-of-interest were improved from 1.5 and 3.17 to 3.14 and 15.76, respectively, for the head and neck patient. DeTECT also increased the CNR of prostate from 0.13 to 1.46 for the four prostate patients. The results are substantially better than a local denoising method using anisotropic diffusion. Conclusions: The authors showed that it is feasible to extract more soft tissue contrast information from the noisy MVCT images using a nonlocal means 3D block matching method in combination with saliency maps, revealing information that was originally unperceivable to human observers.« less

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

ERIC Educational Resources Information Center

Gonzalez-Vega, Laureano

1999-01-01

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

Ionospheric Tomography Using Faraday Rotation of Automatic Dependant Surveillance Broadcast UHF Signals

NASA Astrophysics Data System (ADS)

Cushley, A. C.

2013-12-01

The proposed launch of a satellite carrying the first space-borne ADS-B receiver by the Royal Military College of Canada (RMCC) will create a unique opportunity to study the modification of the 1090 MHz radio waves following propagation through the ionosphere from the transmitting aircraft to the passive satellite receiver(s). Experimental work successfully demonstrated that ADS-B data can be used to reconstruct two dimensional (2D) electron density maps of the ionosphere using computerized tomography (CT). The goal of this work is to evaluate the feasibility of CT reconstruction. The data is modelled using Ray-tracing techniques. This allows us to determine the characteristics of individual waves, including the wave path and the state of polarization at the satellite receiver. The modelled Faraday rotation (FR) is determined and converted to total electron content (TEC) along the ray-paths. The resulting TEC is used as input for computerized ionospheric tomography (CIT) using algebraic reconstruction technique (ART). This study concentrated on meso-scale structures 100-1000 km in horizontal extent. The primary scientific interest of this thesis was to show the feasibility of a new method to image the ionosphere and obtain a better understanding of magneto-ionic wave propagation. Multiple feature input electron density profile to ray-tracing program. Top: reconstructed relative electron density map of ray-trace input (Fig. 1) using TEC measurements and line-of-sight path. Bottom: reconstructed electron density map of ray-trace input using quiet background a priori estimate.

Graphing trillions of triangles

PubMed Central

Burkhardt, Paul

2016-01-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed. PMID:28690426

A comparison of different methods to implement higher order derivatives of density functionals

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

van Dam, Hubertus J.J.

Density functional theory is the dominant approach in electronic structure methods today. To calculate properties higher order derivatives of the density functionals are required. These derivatives might be implemented manually,by automatic differentiation, or by symbolic algebra programs. Different authors have cited different reasons for using the particular method of their choice. This paper presents work where all three approaches were used and the strengths and weaknesses of each approach are considered. It is found that all three methods produce code that is suffficiently performanted for practical applications, despite the fact that our symbolic algebra generated code and our automatic differentiationmore » code still have scope for significant optimization. The automatic differentiation approach is the best option for producing readable and maintainable code.« less

An Ensemble Approach to Building Mercer Kernels with Prior Information

NASA Technical Reports Server (NTRS)

Srivastava, Ashok N.; Schumann, Johann; Fischer, Bernd

2005-01-01

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

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

NASA Astrophysics Data System (ADS)

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

2018-07-01

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

Banach Synaptic Algebras

NASA Astrophysics Data System (ADS)

Foulis, David J.; Pulmannov, Sylvia

2018-04-01

Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

Hopf algebras of rooted forests, cocyles, and free Rota-Baxter algebras

NASA Astrophysics Data System (ADS)

Zhang, Tianjie; Gao, Xing; Guo, Li

2016-10-01

The Hopf algebra and the Rota-Baxter algebra are the two algebraic structures underlying the algebraic approach of Connes and Kreimer to renormalization of perturbative quantum field theory. In particular, the Hopf algebra of rooted trees serves as the "baby model" of Feynman graphs in their approach and can be characterized by certain universal properties involving a Hochschild 1-cocycle. Decorated rooted trees have also been applied to study Feynman graphs. We will continue the study of universal properties of various spaces of decorated rooted trees with such a 1-cocycle, leading to the concept of a cocycle Hopf algebra. We further apply the universal properties to equip a free Rota-Baxter algebra with the structure of a cocycle Hopf algebra.

The Unitality of Quantum B-algebras

NASA Astrophysics Data System (ADS)

Han, Shengwei; Xu, Xiaoting; Qin, Feng

2018-02-01

Quantum B-algebras as a generalization of quantales were introduced by Rump and Yang, which cover the majority of implicational algebras and provide a unified semantic for a wide class of substructural logics. Unital quantum B-algebras play an important role in the classification of implicational algebras. The main purpose of this paper is to construct unital quantum B-algebras from non-unital quantum B-algebras.

Application of the Group Foliation Method to the Complex Monge-Ampère Equation

NASA Astrophysics Data System (ADS)

Nutku, Y.; Sheftel, M. B.

2001-04-01

We apply the method of group foliation to the complex Monge-Ampère equation ( CMA 2) to establish a regular framework for finding its non-invariant solutions. We employ an infinite symmetry subgroup of CMA 2 to produce a foliation of the solution space into orbits of solutions with respect to this group and a corresponding splitting of CMA 2 into an automorphic system and a resolvent system. We propose a new approach to group foliation which is based on the commutator algebra of operators of invariant differentiation. This algebra together with its Jacobi identities provides the commutator representation of the resolvent system.

Analytical solutions for systems of partial differential-algebraic equations.

PubMed

Benhammouda, Brahim; Vazquez-Leal, Hector

2014-01-01

This work presents the application of the power series method (PSM) to find solutions of partial differential-algebraic equations (PDAEs). Two systems of index-one and index-three are solved to show that PSM can provide analytical solutions of PDAEs in convergent series form. What is more, we present the post-treatment of the power series solutions with the Laplace-Padé (LP) resummation method as a useful strategy to find exact solutions. The main advantage of the proposed methodology is that the procedure is based on a few straightforward steps and it does not generate secular terms or depends of a perturbation parameter.

Phased-mission system analysis using Boolean algebraic methods

NASA Technical Reports Server (NTRS)

Somani, Arun K.; Trivedi, Kishor S.

1993-01-01

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

MULTIVARIATERESIDUES : A Mathematica package for computing multivariate residues

NASA Astrophysics Data System (ADS)

Larsen, Kasper J.; Rietkerk, Robbert

2018-01-01

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

Robot Control Based On Spatial-Operator Algebra

NASA Technical Reports Server (NTRS)

Rodriguez, Guillermo; Kreutz, Kenneth K.; Jain, Abhinandan

1992-01-01

Method for mathematical modeling and control of robotic manipulators based on spatial-operator algebra providing concise representation and simple, high-level theoretical frame-work for solution of kinematical and dynamical problems involving complicated temporal and spatial relationships. Recursive algorithms derived immediately from abstract spatial-operator expressions by inspection. Transition from abstract formulation through abstract solution to detailed implementation of specific algorithms to compute solution greatly simplified. Complicated dynamical problems like two cooperating robot arms solved more easily.

Mathematical Methods for Physics and Engineering Third Edition Paperback Set

NASA Astrophysics Data System (ADS)

Riley, Ken F.; Hobson, Mike P.; Bence, Stephen J.

2006-06-01

Prefaces; 1. Preliminary algebra; 2. Preliminary calculus; 3. Complex numbers and hyperbolic functions; 4. Series and limits; 5. Partial differentiation; 6. Multiple integrals; 7. Vector algebra; 8. Matrices and vector spaces; 9. Normal modes; 10. Vector calculus; 11. Line, surface and volume integrals; 12. Fourier series; 13. Integral transforms; 14. First-order ordinary differential equations; 15. Higher-order ordinary differential equations; 16. Series solutions of ordinary differential equations; 17. Eigenfunction methods for differential equations; 18. Special functions; 19. Quantum operators; 20. Partial differential equations: general and particular; 21. Partial differential equations: separation of variables; 22. Calculus of variations; 23. Integral equations; 24. Complex variables; 25. Application of complex variables; 26. Tensors; 27. Numerical methods; 28. Group theory; 29. Representation theory; 30. Probability; 31. Statistics; Index.

A Method for the Construction of Hereditary Constitutive Equations of Laminates Bases on a Hereditary Constitutive Equation for a Layer

NASA Astrophysics Data System (ADS)

Dumansky, Alexander M.; Tairova, Lyudmila P.

2008-09-01

A method for the construction of hereditary constitutive equation is proposed for the laminate on the basis of hereditary constitutive equations of a layer. The method is developed from the assumption that in the directions of axes of orthotropy the layer follows elastic behavior, and obeys hereditary constitutive equations under shear. The constitutive equations of the laminate are constructed on the basis of classical laminate theory and algebra of resolvent operators. Effective matrix algorithm and relationships of operator algebra are used to derive visco-elastic stiffness and compliance of the laminate. The example of construction of hereditary constitutive equations of cross-ply carbon fiber-reinforced plastic is presented.

Polynomial algebra reveals diverging roles of the unfolded protein response in endothelial cells during ischemia-reperfusion injury.

PubMed

Le Pape, Sylvain; Dimitrova, Elena; Hannaert, Patrick; Konovalov, Alexander; Volmer, Romain; Ron, David; Thuillier, Raphaël; Hauet, Thierry

2014-08-25

The unfolded protein response (UPR)--the endoplasmic reticulum stress response--is found in various pathologies including ischemia-reperfusion injury (IRI). However, its role during IRI is still unclear. Here, by combining two different bioinformatical methods--a method based on ordinary differential equations (Time Series Network Inference) and an algebraic method (probabilistic polynomial dynamical systems)--we identified the IRE1α-XBP1 and the ATF6 pathways as the main UPR effectors involved in cell's adaptation to IRI. We validated these findings experimentally by assessing the impact of their knock-out and knock-down on cell survival during IRI. Copyright © 2014 Federation of European Biochemical Societies. Published by Elsevier B.V. All rights reserved.

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

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

We introduce a classical BRST complex (See Definition 3.2.) and show that one can construct a classical affine W-algebra via the complex. This definition clarifies that classical affine W-algebras can be considered as quasi-classical limits of quantum affine W-algebras. We also give a definition of a classical affine fractional W-algebra as a Poisson vertex algebra. As in the classical affine case, a classical affine fractional W-algebra has two compatible λ-brackets and is isomorphic to an algebra of differential polynomials as a differential algebra. When a classical affine fractional W-algebra is associated to a minimal nilpotent, we describe explicit forms ofmore » free generators and compute λ-brackets between them. Provided some assumptions on a classical affine fractional W-algebra, we find an infinite sequence of integrable systems related to the algebra, using the generalized Drinfel’d and Sokolov reduction.« less

A double commutant theorem for Murray–von Neumann algebras

PubMed Central

Liu, Zhe

2012-01-01

Murray–von Neumann algebras are algebras of operators affiliated with finite von Neumann algebras. In this article, we study commutativity and affiliation of self-adjoint operators (possibly unbounded). We show that a maximal abelian self-adjoint subalgebra of the Murray–von Neumann algebra associated with a finite von Neumann algebra is the Murray–von Neumann algebra , where is a maximal abelian self-adjoint subalgebra of and, in addition, is . We also prove that the Murray–von Neumann algebra with the center of is the center of the Murray–von Neumann algebra . Von Neumann’s celebrated double commutant theorem characterizes von Neumann algebras as those for which , where , the commutant of , is the set of bounded operators on the Hilbert space that commute with all operators in . At the end of this article, we present a double commutant theorem for Murray–von Neumann algebras. PMID:22543165

Assessing Algebraic Solving Ability: A Theoretical Framework

ERIC Educational Resources Information Center

Lian, Lim Hooi; Yew, Wun Thiam

2012-01-01

Algebraic solving ability had been discussed by many educators and researchers. There exists no definite definition for algebraic solving ability as it can be viewed from different perspectives. In this paper, the nature of algebraic solving ability in terms of algebraic processes that demonstrate the ability in solving algebraic problem is…

On the intersection of irreducible components of the space of finite-dimensional Lie algebras

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

Gorbatsevich, Vladimir V

2012-07-31

The irreducible components of the space of n-dimensional Lie algebras are investigated. The properties of Lie algebras belonging to the intersection of all the irreducible components of this kind are studied (these Lie algebras are said to be basic or founding Lie algebras). It is proved that all Lie algebras of this kind are nilpotent and each of these Lie algebras has an Abelian ideal of codimension one. Specific examples of founding Lie algebras of arbitrary dimension are described and, to describe the Lie algebras in general, we state a conjecture. The concept of spectrum of a Lie algebra ismore » considered and some of the most elementary properties of the spectrum are studied. Bibliography: 6 titles.« less

FOURTH SEMINAR TO THE MEMORY OF D.N. KLYSHKO: Algebraic solution of the synthesis problem for coded sequences

NASA Astrophysics Data System (ADS)

Leukhin, Anatolii N.

2005-08-01

The algebraic solution of a 'complex' problem of synthesis of phase-coded (PC) sequences with the zero level of side lobes of the cyclic autocorrelation function (ACF) is proposed. It is shown that the solution of the synthesis problem is connected with the existence of difference sets for a given code dimension. The problem of estimating the number of possible code combinations for a given code dimension is solved. It is pointed out that the problem of synthesis of PC sequences is related to the fundamental problems of discrete mathematics and, first of all, to a number of combinatorial problems, which can be solved, as the number factorisation problem, by algebraic methods by using the theory of Galois fields and groups.

Tile-Based Two-Dimensional Phase Unwrapping for Digital Holography Using a Modular Framework

PubMed Central

Antonopoulos, Georgios C.; Steltner, Benjamin; Heisterkamp, Alexander; Ripken, Tammo; Meyer, Heiko

2015-01-01

A variety of physical and biomedical imaging techniques, such as digital holography, interferometric synthetic aperture radar (InSAR), or magnetic resonance imaging (MRI) enable measurement of the phase of a physical quantity additionally to its amplitude. However, the phase can commonly only be measured modulo 2π, as a so called wrapped phase map. Phase unwrapping is the process of obtaining the underlying physical phase map from the wrapped phase. Tile-based phase unwrapping algorithms operate by first tessellating the phase map, then unwrapping individual tiles, and finally merging them to a continuous phase map. They can be implemented computationally efficiently and are robust to noise. However, they are prone to failure in the presence of phase residues or erroneous unwraps of single tiles. We tried to overcome these shortcomings by creating novel tile unwrapping and merging algorithms as well as creating a framework that allows to combine them in modular fashion. To increase the robustness of the tile unwrapping step, we implemented a model-based algorithm that makes efficient use of linear algebra to unwrap individual tiles. Furthermore, we adapted an established pixel-based unwrapping algorithm to create a quality guided tile merger. These original algorithms as well as previously existing ones were implemented in a modular phase unwrapping C++ framework. By examining different combinations of unwrapping and merging algorithms we compared our method to existing approaches. We could show that the appropriate choice of unwrapping and merging algorithms can significantly improve the unwrapped result in the presence of phase residues and noise. Beyond that, our modular framework allows for efficient design and test of new tile-based phase unwrapping algorithms. The software developed in this study is freely available. PMID:26599984

Tile-Based Two-Dimensional Phase Unwrapping for Digital Holography Using a Modular Framework.

PubMed

Antonopoulos, Georgios C; Steltner, Benjamin; Heisterkamp, Alexander; Ripken, Tammo; Meyer, Heiko

2015-01-01

A variety of physical and biomedical imaging techniques, such as digital holography, interferometric synthetic aperture radar (InSAR), or magnetic resonance imaging (MRI) enable measurement of the phase of a physical quantity additionally to its amplitude. However, the phase can commonly only be measured modulo 2π, as a so called wrapped phase map. Phase unwrapping is the process of obtaining the underlying physical phase map from the wrapped phase. Tile-based phase unwrapping algorithms operate by first tessellating the phase map, then unwrapping individual tiles, and finally merging them to a continuous phase map. They can be implemented computationally efficiently and are robust to noise. However, they are prone to failure in the presence of phase residues or erroneous unwraps of single tiles. We tried to overcome these shortcomings by creating novel tile unwrapping and merging algorithms as well as creating a framework that allows to combine them in modular fashion. To increase the robustness of the tile unwrapping step, we implemented a model-based algorithm that makes efficient use of linear algebra to unwrap individual tiles. Furthermore, we adapted an established pixel-based unwrapping algorithm to create a quality guided tile merger. These original algorithms as well as previously existing ones were implemented in a modular phase unwrapping C++ framework. By examining different combinations of unwrapping and merging algorithms we compared our method to existing approaches. We could show that the appropriate choice of unwrapping and merging algorithms can significantly improve the unwrapped result in the presence of phase residues and noise. Beyond that, our modular framework allows for efficient design and test of new tile-based phase unwrapping algorithms. The software developed in this study is freely available.

Duncan F. Gregory, William Walton and the development of British algebra: 'algebraical geometry', 'geometrical algebra', abstraction.

PubMed

Verburgt, Lukas M

2016-01-01

This paper provides a detailed account of the period of the complex history of British algebra and geometry between the publication of George Peacock's Treatise on Algebra in 1830 and William Rowan Hamilton's paper on quaternions of 1843. During these years, Duncan Farquharson Gregory and William Walton published several contributions on 'algebraical geometry' and 'geometrical algebra' in the Cambridge Mathematical Journal. These contributions enabled them not only to generalize Peacock's symbolical algebra on the basis of geometrical considerations, but also to initiate the attempts to question the status of Euclidean space as the arbiter of valid geometrical interpretations. At the same time, Gregory and Walton were bound by the limits of symbolical algebra that they themselves made explicit; their work was not and could not be the 'abstract algebra' and 'abstract geometry' of figures such as Hamilton and Cayley. The central argument of the paper is that an understanding of the contributions to 'algebraical geometry' and 'geometrical algebra' of the second generation of 'scientific' symbolical algebraists is essential for a satisfactory explanation of the radical transition from symbolical to abstract algebra that took place in British mathematics in the 1830s-1840s.

From simplicial Lie algebras and hypercrossed complexes to differential graded Lie algebras via 1-jets

NASA Astrophysics Data System (ADS)

Jurčo, Branislav

2012-12-01

Let g be a simplicial Lie algebra with Moore complex Ng of length k. Let G be the simplicial Lie group integrating g, such that each Gn is simply connected. We use the 1-jet of the classifying space W¯ G to construct, starting from g, a Lie k-algebra L. The so constructed Lie k-algebra L is actually a differential graded Lie algebra. The differential and the brackets are explicitly described in terms (of a part) of the corresponding k-hypercrossed complex structure of Ng. The result can be seen as a geometric interpretation of Quillen's (purely algebraic) construction of the adjunction between simplicial Lie algebras and dg-Lie algebras.

Algebra: A Challenge at the Crossroads of Policy and Practice

ERIC Educational Resources Information Center

Stein, Mary Kay; Kaufman, Julia Heath; Sherman, Milan; Hillen, Amy F.

2011-01-01

The authors review what is known about early and universal algebra, including who is getting access to algebra and student outcomes associated with algebra course taking in general and specifically with universal algebra policies. The findings indicate that increasing numbers of students, some of whom are underprepared, are taking algebra earlier.…

Making Algebra Work: Instructional Strategies that Deepen Student Understanding, within and between Algebraic Representations

ERIC Educational Resources Information Center

Star, Jon R.; Rittle-Johnson, Bethany

2009-01-01

Competence in algebra is increasingly recognized as a critical milestone in students' middle and high school years. The transition from arithmetic to algebra is a notoriously difficult one, and improvements in algebra instruction are greatly needed (National Research Council, 2001). Algebra historically has represented students' first sustained…

Algebraic K-theory, K-regularity, and -duality of -stable C ∗-algebras

NASA Astrophysics Data System (ADS)

Mahanta, Snigdhayan

2015-12-01

We develop an algebraic formalism for topological -duality. More precisely, we show that topological -duality actually induces an isomorphism between noncommutative motives that in turn implements the well-known isomorphism between twisted K-theories (up to a shift). In order to establish this result we model topological K-theory by algebraic K-theory. We also construct an E ∞ -operad starting from any strongly self-absorbing C ∗-algebra . Then we show that there is a functorial topological K-theory symmetric spectrum construction on the category of separable C ∗-algebras, such that is an algebra over this operad; moreover, is a module over this algebra. Along the way we obtain a new symmetric spectra valued functorial model for the (connective) topological K-theory of C ∗-algebras. We also show that -stable C ∗-algebras are K-regular providing evidence for a conjecture of Rosenberg. We conclude with an explicit description of the algebraic K-theory of a x+ b-semigroup C ∗-algebras coming from number theory and that of -stabilized noncommutative tori.

Iterative methods for elliptic finite element equations on general meshes

NASA Technical Reports Server (NTRS)

Nicolaides, R. A.; Choudhury, Shenaz

1986-01-01

Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.

Tropospheric wet refractivity tomography using multiplicative algebraic reconstruction technique

NASA Astrophysics Data System (ADS)

Xiaoying, Wang; Ziqiang, Dai; Enhong, Zhang; Fuyang, K. E.; Yunchang, Cao; Lianchun, Song

2014-01-01

Algebraic reconstruction techniques (ART) have been successfully used to reconstruct the total electron content (TEC) of the ionosphere and in recent years be tentatively used in tropospheric wet refractivity and water vapor tomography in the ground-based GNSS technology. The previous research on ART used in tropospheric water vapor tomography focused on the convergence and relaxation parameters for various algebraic reconstruction techniques and rarely discussed the impact of Gaussian constraints and initial field on the iteration results. The existing accuracy evaluation parameters calculated from slant wet delay can only evaluate the resultant precision of the voxels penetrated by slant paths and cannot evaluate that of the voxels not penetrated by any slant path. The paper proposes two new statistical parameters Bias and RMS, calculated from wet refractivity of the total voxels, to improve the deficiencies of existing evaluation parameters and then discusses the effect of the Gaussian constraints and initial field on the convergence and tomography results in multiplicative algebraic reconstruction technique (MART) to reconstruct the 4D tropospheric wet refractivity field using simulation method.

Hawking fluxes, fermionic currents, W{sub 1+{infinity}} algebra, and anomalies

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

Bonora, L.; Cvitan, M.; Theoretical Physics Department, Faculty of Science, University of Zagreb Bijenicka cesta 32, HR-10002 Zagreb

2009-10-15

We complete the analysis carried out in previous papers by studying the Hawking radiation for a Kerr black hole carried to infinity by fermionic currents of any spin. We find agreement with the thermal spectrum of the Hawking radiation for fermionic degrees of freedom. We start by showing that the near-horizon physics for a Kerr black hole is approximated by an effective two-dimensional field theory of fermionic fields. Then, starting from two-dimensional currents of any spin that form a W{sub 1+{infinity}} algebra, we construct an infinite set of covariant currents, each of which carries the corresponding moment of the Hawkingmore » radiation. All together they agree with the thermal spectrum of the latter. We show that the predictive power of this method is based not on the anomalies of the higher-spin currents (which are trivial) but on the underlying W{sub 1+{infinity}} structure. Our results point toward the existence in the near-horizon geometry of a symmetry larger than the Virasoro algebra, which very likely takes the form of a W{sub {infinity}} algebra.« less

Littelmann path model for geometric crystals, Whittaker functions on Lie groups and Brownian motion

NASA Astrophysics Data System (ADS)

Chhaibi, Reda

2013-02-01

Generally speaking, this thesis focuses on the interplay between the representations of Lie groups and probability theory. It subdivides into essentially three parts. In a first rather algebraic part, we construct a path model for geometric crystals in the sense of Berenstein and Kazhdan, for complex semi-simple Lie groups. We will mainly describe the algebraic structure, its natural morphisms and parameterizations. The theory of total positivity will play a particularly important role. Then, we anticipate on the probabilistic part by exhibiting a canonical measure on geometric crystals. It uses as ingredients the superpotential for the flag manifold and a measure invariant under the crystal actions. The image measure under the weight map plays the role of Duistermaat-Heckman measure. Its Laplace transform defines Whittaker functions, providing an interesting formula for all Lie groups. Then it appears clearly that Whittaker functions are to geometric crystals, what characters are to combinatorial crystals. The Littlewood-Richardson rule is also exposed. Finally we present the probabilistic approach that allows to find the canonical measure. It is based on the fundamental idea that the Wiener measure will induce the adequate measure on the algebraic structures through the path model. In the last chapter, we show how our geometric model degenerates to the continuous classical Littelmann path model and thus recover known results. For example, the canonical measure on a geometric crystal of highest weight degenerates into a uniform measure on a polytope, and recovers the parameterizations of continuous crystals.

Janus configurations with SL(2, ℤ)-duality twists, strings on mapping tori and a tridiagonal determinant formula

NASA Astrophysics Data System (ADS)

Ganor, Ori J.; Moore, Nathan P.; Sun, Hao-Yu; Torres-Chicon, Nesty R.

2014-07-01

We develop an equivalence between two Hilbert spaces: (i) the space of states of U(1) n Chern-Simons theory with a certain class of tridiagonal matrices of coupling constants (with corners) on T 2; and (ii) the space of ground states of strings on an associated mapping torus with T 2 fiber. The equivalence is deduced by studying the space of ground states of SL(2, ℤ)-twisted circle compactifications of U(1) gauge theory, connected with a Janus configuration, and further compactified on T 2. The equality of dimensions of the two Hilbert spaces (i) and (ii) is equivalent to a known identity on determinants of tridiagonal matrices with corners. The equivalence of operator algebras acting on the two Hilbert spaces follows from a relation between the Smith normal form of the Chern-Simons coupling constant matrix and the isometry group of the mapping torus, as well as the torsion part of its first homology group.

Generalized Clifford Algebras as Algebras in Suitable Symmetric Linear Gr-Categories

NASA Astrophysics Data System (ADS)

Cheng, Tao; Huang, Hua-Lin; Yang, Yuping

2016-01-01

By viewing Clifford algebras as algebras in some suitable symmetric Gr-categories, Albuquerque and Majid were able to give a new derivation of some well known results about Clifford algebras and to generalize them. Along the same line, Bulacu observed that Clifford algebras are weak Hopf algebras in the aforementioned categories and obtained other interesting properties. The aim of this paper is to study generalized Clifford algebras in a similar manner and extend the results of Albuquerque, Majid and Bulacu to the generalized setting. In particular, by taking full advantage of the gauge transformations in symmetric linear Gr-categories, we derive the decomposition theorem and provide categorical weak Hopf structures for generalized Clifford algebras in a conceptual and simpler manner.

Mathematical Methods for Optical Physics and Engineering

NASA Astrophysics Data System (ADS)

Gbur, Gregory J.

2011-01-01

1. Vector algebra; 2. Vector calculus; 3. Vector calculus in curvilinear coordinate systems; 4. Matrices and linear algebra; 5. Advanced matrix techniques and tensors; 6. Distributions; 7. Infinite series; 8. Fourier series; 9. Complex analysis; 10. Advanced complex analysis; 11. Fourier transforms; 12. Other integral transforms; 13. Discrete transforms; 14. Ordinary differential equations; 15. Partial differential equations; 16. Bessel functions; 17. Legendre functions and spherical harmonics; 18. Orthogonal functions; 19. Green's functions; 20. The calculus of variations; 21. Asymptotic techniques; Appendices; References; Index.

Nonlinear response of a harmonic diatomic molecule: Algebraic nonperturbative calculation

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

Recamier, Jose; Mochan, W. Luis; Maytorena, Jesus A.

2005-08-15

Even harmonic molecules display a nonlinear behavior when driven by an inhomogeneous field. We calculate the response of single harmonic molecules to a monochromatic time and space dependent electric field E(r,t) of frequency {omega} employing exact algebraic methods. We evaluate the responses at the fundamental frequency {omega} and at successive harmonics 2{omega}, 3{omega}, etc., as a function of the intensity and of the frequency of the field and compare the results with those of first and second order perturbation theory.

Computer programs for the solution of systems of linear algebraic equations

NASA Technical Reports Server (NTRS)

Sequi, W. T.

1973-01-01

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

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

PubMed

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.

Reduction of quantum systems and the local Gauss law

NASA Astrophysics Data System (ADS)

Stienstra, Ruben; van Suijlekom, Walter D.

2018-05-01

We give an operator-algebraic interpretation of the notion of an ideal generated by the unbounded operators associated with the elements of the Lie algebra of a Lie group that implements the symmetries of a quantum system. We use this interpretation to establish a link between Rieffel induction and the implementation of a local Gauss law in lattice gauge theories similar to the method discussed by Kijowski and Rudolph (J Math Phys 43:1796-1808, 2002; J Math Phys 46:032303, 2004).

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

NASA Technical Reports Server (NTRS)

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

1974-01-01

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

Finite-analytic numerical solution of heat transfer in two-dimensional cavity flow

NASA Technical Reports Server (NTRS)

Chen, C.-J.; Naseri-Neshat, H.; Ho, K.-S.

1981-01-01

Heat transfer in cavity flow is numerically analyzed by a new numerical method called the finite-analytic method. The basic idea of the finite-analytic method is the incorporation of local analytic solutions in the numerical solutions of linear or nonlinear partial differential equations. In the present investigation, the local analytic solutions for temperature, stream function, and vorticity distributions are derived. When the local analytic solution is evaluated at a given nodal point, it gives an algebraic relationship between a nodal value in a subregion and its neighboring nodal points. A system of algebraic equations is solved to provide the numerical solution of the problem. The finite-analytic method is used to solve heat transfer in the cavity flow at high Reynolds number (1000) for Prandtl numbers of 0.1, 1, and 10.

A least-squares finite element method for 3D incompressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Hou, Lin-Jun; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

Hybrid cloud and cluster computing paradigms for life science applications.

PubMed

Qiu, Judy; Ekanayake, Jaliya; Gunarathne, Thilina; Choi, Jong Youl; Bae, Seung-Hee; Li, Hui; Zhang, Bingjing; Wu, Tak-Lon; Ruan, Yang; Ekanayake, Saliya; Hughes, Adam; Fox, Geoffrey

2010-12-21

Clouds and MapReduce have shown themselves to be a broadly useful approach to scientific computing especially for parallel data intensive applications. However they have limited applicability to some areas such as data mining because MapReduce has poor performance on problems with an iterative structure present in the linear algebra that underlies much data analysis. Such problems can be run efficiently on clusters using MPI leading to a hybrid cloud and cluster environment. This motivates the design and implementation of an open source Iterative MapReduce system Twister. Comparisons of Amazon, Azure, and traditional Linux and Windows environments on common applications have shown encouraging performance and usability comparisons in several important non iterative cases. These are linked to MPI applications for final stages of the data analysis. Further we have released the open source Twister Iterative MapReduce and benchmarked it against basic MapReduce (Hadoop) and MPI in information retrieval and life sciences applications. The hybrid cloud (MapReduce) and cluster (MPI) approach offers an attractive production environment while Twister promises a uniform programming environment for many Life Sciences applications. We used commercial clouds Amazon and Azure and the NSF resource FutureGrid to perform detailed comparisons and evaluations of different approaches to data intensive computing. Several applications were developed in MPI, MapReduce and Twister in these different environments.

New modified multi-level residue harmonic balance method for solving nonlinearly vibrating double-beam problem

NASA Astrophysics Data System (ADS)

Rahman, Md. Saifur; Lee, Yiu-Yin

2017-10-01

In this study, a new modified multi-level residue harmonic balance method is presented and adopted to investigate the forced nonlinear vibrations of axially loaded double beams. Although numerous nonlinear beam or linear double-beam problems have been tackled and solved, there have been few studies of this nonlinear double-beam problem. The geometric nonlinear formulations for a double-beam model are developed. The main advantage of the proposed method is that a set of decoupled nonlinear algebraic equations is generated at each solution level. This heavily reduces the computational effort compared with solving the coupled nonlinear algebraic equations generated in the classical harmonic balance method. The proposed method can generate the higher-level nonlinear solutions that are neglected by the previous modified harmonic balance method. The results from the proposed method agree reasonably well with those from the classical harmonic balance method. The effects of damping, axial force, and excitation magnitude on the nonlinear vibrational behaviour are examined.

GIS and Multi-criteria evaluation (MCE) for landform geodiversity assessment

NASA Astrophysics Data System (ADS)

Najwer, Alicja; Reynard, Emmanuel; Zwoliński, Zbigniew

2014-05-01

In geomorphology, at the contemporary stage of methodology and methodological development, it is very significant to undertake new research problems, from theoretical and application point of view. As an example of applying geoconservation results in landscape studies and environmental conservation one can refer to the problem of the landform geodiversity. The concept of geodiversity was created relatively recently and, therefore, little progress has been made in its objective assessment and mapping. In order to ensure clarity and coherency, it is recommended that the evaluation process to be rigorous. Multi-criteria evaluation meets these criteria well. The main objective of this presentation is to demonstrate a new methodology for the assessment of the selected natural environment components in response to the definition of geodiversity, as well as visualization of the landforms geodiversity, using the opportunities offered by the geoinformation environment. The study area consists of two peculiar alpine valleys: Illgraben and Derborence, located in the Swiss Alps. Apart from glacial and fluvial landforms, the morphology of these two sites is largely due to the extreme phenomena(rockslides, torrential processes). Both valleys are recognized as geosites of national importance. The basis of the assessment is the selection of the geographical environment features. Firstly, six factor maps were prepared for each area: the landform energy, the landform fragmentation, the contemporary landform preservation, geological settings and hydrographic elements (lakes and streams). Input maps were then standardized and resulted from map algebra operations carried out by multi-criteria evaluation (MCE) with GIS-based Weighted Sum technique. Weights for particular classes were calculated using pair-comparison matrixes method. The final stage of deriving landform geodiversity maps was the reclassification procedure with the use of natural breaks method. The final maps of landform geodiversity were generated with the use of the same methodological algorithm and multiplication of each factor map by its given weight with consistency ratio = 0.07. However, the results that were obtained were radically different. The map of geodiversity for Derborence is characterized by much more significant fragmentation. Areas of low geodiveristy constitute a greater contribution. In the Illgraben site, there is a significant contribution of high and very high geodiversity classes. The obtained maps were reviewed during the field exploration with positive results, which gives a basis to conclude that the methodology used is correct and can be applied for other similar areas. Therefore, it is very important to develop an objective methodology that can be implemented for areas at the local and regional scale, but also giving satisfactory results for areas with a landscape different from the alpine one. The maps of landform geodiversity may be used for environment conservation management, preservation of specific features within the geosite perimeter, spatial planning or tourism management.

Convergence of the standard RLS method and UDUT factorisation of covariance matrix for solving the algebraic Riccati equation of the DLQR via heuristic approximate dynamic programming

NASA Astrophysics Data System (ADS)

Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.

2015-08-01

The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.

SDG Fermion-Pair Algebraic SO(12) and Sp(10) Models and Their Boson Realizations

NASA Astrophysics Data System (ADS)

Navratil, P.; Geyer, H. B.; Dobes, J.; Dobaczewski, J.

1995-11-01

It is shown how the boson mapping formalism may be applied as a useful many-body tool to solve a fermion problem. This is done in the context of generalized Ginocchio models for which we introduce S-, D-, and G-pairs of fermions and subsequently construct the sdg-boson realizations of the generalized Dyson type. The constructed SO(12) and Sp(10) fermion models are solved beyond the explicit symmetry limits. Phase transitions to rotational structures are obtained also in situations where there is no underlying SU(3) symmetry.

Proper Conformal Killing Vectors in Kantowski-Sachs Metric

NASA Astrophysics Data System (ADS)

Hussain, Tahir; Farhan, Muhammad

2018-04-01

This paper deals with the existence of proper conformal Killing vectors (CKVs) in Kantowski-Sachs metric. Subject to some integrability conditions, the general form of vector filed generating CKVs and the conformal factor is presented. The integrability conditions are solved generally as well as in some particular cases to show that the non-conformally flat Kantowski-Sachs metric admits two proper CKVs, while it admits a 15-dimensional Lie algebra of CKVs in the case when it becomes conformally flat. The inheriting conformal Killing vectors (ICKVs), which map fluid lines conformally, are also investigated.

Implementation of Geometric Algebra in MATLAB (registered trademark) with Applications

DTIC Science & Technology

2014-09-01

HHH HHHH HHHH HH HHH HHH HHHH P r C r O 6 HHHj ~A ~B Figure 1: Pinhole...is given by the similar map L 7→ P ∨ (C ∧ L) . (66) The result is the unique line of intersection of two planes. HHH HHH HHHH HH H HHH HHH HHH HH Pα...Pβ r Cα r Cβ rOαβ rOβα HH HHH HHH HHH HHH HH H HH H HH rX rXα rXβ A A A A

Symplecticity in Beam Dynamics: An Introduction

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

Rees, John R

2003-06-10

A particle in a particle accelerator can often be considered a Hamiltonian system, and when that is the case, its motion obeys the constraints of the Symplectic Condition. This tutorial monograph derives the condition from the requirement that a canonical transformation must yield a new Hamiltonian system from an old one. It then explains some of the consequences of symplecticity and discusses examples of its applications, touching on symplectic matrices, phase space and Liouville's Theorem, Lagrange and Poisson brackets, Lie algebra, Lie operators and Lie transformations, symplectic maps and symplectic integrators.

Dynamical systems defined on infinite dimensional lie algebras of the ''current algebra'' or ''Kac-Moody'' type

NASA Astrophysics Data System (ADS)

Hermann, Robert

1982-07-01

Recent work by Morrison, Marsden, and Weinstein has drawn attention to the possibility of utilizing the cosymplectic structure of the dual of the Lie algebra of certain infinite dimensional Lie groups to study hydrodynamical and plasma systems. This paper treats certain models arising in elementary particle physics, considered by Lee, Weinberg, and Zumino; Sugawara; Bardacki, Halpern, and Frishman; Hermann; and Dolan. The lie algebras involved are associated with the ''current algebras'' of Gell-Mann. This class of Lie algebras contains certain of the algebras that are called ''Kac-Moody algebras'' in the recent mathematics and mathematical physics literature.

Volume-preserving normal forms of Hopf-zero singularity

NASA Astrophysics Data System (ADS)

Gazor, Majid; Mokhtari, Fahimeh

2013-10-01

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

Lambda: A Mathematica package for operator product expansions in vertex algebras

NASA Astrophysics Data System (ADS)

Ekstrand, Joel

2011-02-01

We give an introduction to the Mathematica package Lambda, designed for calculating λ-brackets in both vertex algebras, and in SUSY vertex algebras. This is equivalent to calculating operator product expansions in two-dimensional conformal field theory. The syntax of λ-brackets is reviewed, and some simple examples are shown, both in component notation, and in N=1 superfield notation. Program summaryProgram title: Lambda Catalogue identifier: AEHF_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHF_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License No. of lines in distributed program, including test data, etc.: 18 087 No. of bytes in distributed program, including test data, etc.: 131 812 Distribution format: tar.gz Programming language: Mathematica Computer: See specifications for running Mathematica V7 or above. Operating system: See specifications for running Mathematica V7 or above. RAM: Varies greatly depending on calculation to be performed. Classification: 4.2, 5, 11.1. Nature of problem: Calculate operator product expansions (OPEs) of composite fields in 2d conformal field theory. Solution method: Implementation of the algebraic formulation of OPEs given by vertex algebras, and especially by λ-brackets. Running time: Varies greatly depending on calculation requested. The example notebook provided takes about 3 s to run.

Student Solution Manual for Mathematical Methods for Physics and Engineering Third Edition

NASA Astrophysics Data System (ADS)

Riley, K. F.; Hobson, M. P.

2006-03-01

Preface; 1. Preliminary algebra; 2. Preliminary calculus; 3. Complex numbers and hyperbolic functions; 4. Series and limits; 5. Partial differentiation; 6. Multiple integrals; 7. Vector algebra; 8. Matrices and vector spaces; 9. Normal modes; 10. Vector calculus; 11. Line, surface and volume integrals; 12. Fourier series; 13. Integral transforms; 14. First-order ordinary differential equations; 15. Higher-order ordinary differential equations; 16. Series solutions of ordinary differential equations; 17. Eigenfunction methods for differential equations; 18. Special functions; 19. Quantum operators; 20. Partial differential equations: general and particular; 21. Partial differential equations: separation of variables; 22. Calculus of variations; 23. Integral equations; 24. Complex variables; 25. Application of complex variables; 26. Tensors; 27. Numerical methods; 28. Group theory; 29. Representation theory; 30. Probability; 31. Statistics.

General algebraic method applied to control analysis of complex engine types

NASA Technical Reports Server (NTRS)

Boksenbom, Aaron S; Hood, Richard

1950-01-01

A general algebraic method of attack on the problem of controlling gas-turbine engines having any number of independent variables was utilized employing operational functions to describe the assumed linear characteristics for the engine, the control, and the other units in the system. Matrices were used to describe the various units of the system, to form a combined system showing all effects, and to form a single condensed matrix showing the principal effects. This method directly led to the conditions on the control system for noninteraction so that any setting disturbance would affect only its corresponding controlled variable. The response-action characteristics were expressed in terms of the control system and the engine characteristics. The ideal control-system characteristics were explicitly determined in terms of any desired response action.

Linear systems with structure group and their feedback invariants

NASA Technical Reports Server (NTRS)

Martin, C.; Hermann, R.

1977-01-01

A general method described by Hermann and Martin (1976) for the study of the feedback invariants of linear systems is considered. It is shown that this method, which makes use of ideas of topology and algebraic geometry, is very useful in the investigation of feedback problems for which the classical methods are not suitable. The transfer function as a curve in the Grassmanian is examined. The general concepts studied in the context of specific systems and applications are organized in terms of the theory of Lie groups and algebraic geometry. Attention is given to linear systems which have a structure group, linear mechanical systems, and feedback invariants. The investigation shows that Lie group techniques are powerful and useful tools for analysis of the feedback structure of linear systems.

Applications of algebraic topology to compatible spatial discretizations.

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

Bochev, Pavel Blagoveston; Hyman, James M.

We provide a common framework for compatible discretizations using algebraic topology to guide our analysis. The main concept is the natural inner product on cochains, which induces a combinatorial Hodge theory. The framework comprises of mutually consistent operations of differentiation and integration, has a discrete Stokes theorem, and preserves the invariants of the DeRham cohomology groups. The latter allows for an elementary calculation of the kernel of the discrete Laplacian. Our framework provides an abstraction that includes examples of compatible finite element, finite volume and finite difference methods. We describe how these methods result from the choice of a reconstructionmore » operator and when they are equivalent.« less

Solving multi-customer FPR model with quality assurance and discontinuous deliveries using a two-phase algebraic approach.

PubMed

Chiu, Yuan-Shyi Peter; Chou, Chung-Li; Chang, Huei-Hsin; Chiu, Singa Wang

2016-01-01

A multi-customer finite production rate (FPR) model with quality assurance and discontinuous delivery policy was investigated in a recent paper (Chiu et al. in J Appl Res Technol 12(1):5-13, 2014) using differential calculus approach. This study employs mathematical modeling along with a two-phase algebraic method to resolve such a specific multi-customer FPR model. As a result, the optimal replenishment lot size and number of shipments can be derived without using the differential calculus. Such a straightforward method may assist practitioners who with insufficient knowledge of calculus in learning and managing the real multi-customer FPR systems more effectively.

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

PubMed Central

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

2011-01-01

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

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

PubMed

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

2005-04-07

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

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

PubMed

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

1998-01-01

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

Transfer matrix spectrum for cyclic representations of the 6-vertex reflection algebra by quantum separation of variables

NASA Astrophysics Data System (ADS)

Pezelier, Baptiste

2018-02-01

In this proceeding, we recall the notion of quantum integrable systems on a lattice and then introduce the Sklyanin’s Separation of Variables method. We sum up the main results for the transfer matrix spectral problem for the cyclic representations of the trigonometric 6-vertex reflection algebra associated to the Bazanov-Stroganov Lax operator. These results apply as well to the spectral analysis of the lattice sine-Gordon model with open boundary conditions. The transfer matrix spectrum (both eigenvalues and eigenstates) is completely characterized in terms of the set of solutions to a discrete system of polynomial equations. We state an equivalent characterization as the set of solutions to a Baxter’s like T-Q functional equation, allowing us to rewrite the transfer matrix eigenstates in an algebraic Bethe ansatz form.

Invariant Connections in Loop Quantum Gravity

NASA Astrophysics Data System (ADS)

Hanusch, Maximilian

2016-04-01

Given a group {G}, and an abelian {C^*}-algebra {A}, the antihomomorphisms {Θ\\colon G→ {Aut}(A)} are in one-to-one with those left actions {Φ\\colon G× {Spec}(A)→ {Spec}(A)} whose translation maps {Φ_g} are continuous; whereby continuities of {Θ} and {Φ} turn out to be equivalent if {A} is unital. In particular, a left action {φ\\colon G × X→ X} can be uniquely extended to the spectrum of a {C^*}-subalgebra {A} of the bounded functions on {X} if {φ_g^*(A)subseteq A} holds for each {gin G}. In the present paper, we apply this to the framework of loop quantum gravity. We show that, on the level of the configuration spaces, quantization and reduction in general do not commute, i.e., that the symmetry-reduced quantum configuration space is (strictly) larger than the quantized configuration space of the reduced classical theory. Here, the quantum-reduced space has the advantage to be completely characterized by a simple algebraic relation, whereby the quantized reduced classical space is usually hard to compute.

Four-qubit systems and dyonic black Hole-Black branes in superstring theory

NASA Astrophysics Data System (ADS)

Belhaj, A.; Bensed, M.; Benslimane, Z.; Sedra, M. B.; Segui, A.

Using dyonic solutions in the type IIA superstring theory on Calabi-Yau (CY) manifolds, we reconsider the study of black objects and quantum information theory using string/string duality in six dimensions. Concretely, we relate four-qubits with a stringy quaternionic moduli space of type IIA compactification associated with a dyonic black solution formed by black holes (BHs) and black 2-branes (B2B) carrying eight electric charges and eight magnetic charges. This connection is made by associating the cohomology classes of the heterotic superstring on T4 to four-qubit states. These states are interpreted in terms of such dyonic charges resulting from the quaternionic symmetric space SO(4,4) SO(4)×SO(4) corresponding to a N = 4 sigma model superpotential in two dimensions. The superpotential is considered as a functional depending on four quaternionic fields mapped to a class of Clifford algebras denoted as Cl0,4. A link between such an algebra and the cohomology classes of T4 in heterotic superstring theory is also given.

Relative Critical Points

NASA Astrophysics Data System (ADS)

Lewis, Debra

2013-05-01

Relative equilibria of Lagrangian and Hamiltonian systems with symmetry are critical points of appropriate scalar functions parametrized by the Lie algebra (or its dual) of the symmetry group. Setting aside the structures - symplectic, Poisson, or variational - generating dynamical systems from such functions highlights the common features of their construction and analysis, and supports the construction of analogous functions in non-Hamiltonian settings. If the symmetry group is nonabelian, the functions are invariant only with respect to the isotropy subgroup of the given parameter value. Replacing the parametrized family of functions with a single function on the product manifold and extending the action using the (co)adjoint action on the algebra or its dual yields a fully invariant function. An invariant map can be used to reverse the usual perspective: rather than selecting a parametrized family of functions and finding their critical points, conditions under which functions will be critical on specific orbits, typically distinguished by isotropy class, can be derived. This strategy is illustrated using several well-known mechanical systems - the Lagrange top, the double spherical pendulum, the free rigid body, and the Riemann ellipsoids - and generalizations of these systems.

The general symmetry algebra structure of the underdetermined equation ux=(vxx)2

NASA Astrophysics Data System (ADS)

Kersten, Paul H. M.

1991-08-01

In a recent paper, Anderson, Kamran, and Olver [``Interior, exterior, and generalized symmetries,'' preprint (1990)] obtained the first- and second-order generalized symmetry algebra for the system ux=(vxx)2, leading to the noncompact real form of the exceptional Lie algebra G2. Here, the structure of the general higher-order symmetry algebra is obtained. Moreover, the Lie algebra G2 is obtained as ordinary symmetry algebra of the associated first-order system. The general symmetry algebra for ux=f(u,v,vx,...,) is established also.

Algebraic approach to electronic spectroscopy and dynamics.

PubMed

Toutounji, Mohamad

2008-04-28

Lie algebra, Zassenhaus, and parameter differentiation techniques are utilized to break up the exponential of a bilinear Hamiltonian operator into a product of noncommuting exponential operators by the virtue of the theory of Wei and Norman [J. Math. Phys. 4, 575 (1963); Proc. Am. Math. Soc., 15, 327 (1964)]. There are about three different ways to find the Zassenhaus exponents, namely, binomial expansion, Suzuki formula, and q-exponential transformation. A fourth, and most reliable method, is provided. Since linearly displaced and distorted (curvature change upon excitation/emission) Hamiltonian and spin-boson Hamiltonian may be classified as bilinear Hamiltonians, the presented algebraic algorithm (exponential operator disentanglement exploiting six-dimensional Lie algebra case) should be useful in spin-boson problems. The linearly displaced and distorted Hamiltonian exponential is only treated here. While the spin-boson model is used here only as a demonstration of the idea, the herein approach is more general and powerful than the specific example treated. The optical linear dipole moment correlation function is algebraically derived using the above mentioned methods and coherent states. Coherent states are eigenvectors of the bosonic lowering operator a and not of the raising operator a(+). While exp(a(+)) translates coherent states, exp(a(+)a(+)) operation on coherent states has always been a challenge, as a(+) has no eigenvectors. Three approaches, and the results, of that operation are provided. Linear absorption spectra are derived, calculated, and discussed. The linear dipole moment correlation function for the pure quadratic coupling case is expressed in terms of Legendre polynomials to better show the even vibronic transitions in the absorption spectrum. Comparison of the present line shapes to those calculated by other methods is provided. Franck-Condon factors for both linear and quadratic couplings are exactly accounted for by the herein calculated linear absorption spectra. This new methodology should easily pave the way to calculating the four-point correlation function, F(tau(1),tau(2),tau(3),tau(4)), of which the optical nonlinear response function may be procured, as evaluating F(tau(1),tau(2),tau(3),tau(4)) is only evaluating the optical linear dipole moment correlation function iteratively over different time intervals, which should allow calculating various optical nonlinear temporal/spectral signals.

A calculus based on a q-deformed Heisenberg algebra

DOE PAGES

Cerchiai, B. L.; Hinterding, R.; Madore, J.; ...

1999-04-27

We show how one can construct a differential calculus over an algebra where position variables $x$ and momentum variables p have be defined. As the simplest example we consider the one-dimensional q-deformed Heisenberg algebra. This algebra has a subalgebra generated by cursive Greek chi and its inverse which we call the coordinate algebra. A physical field is considered to be an element of the completion of this algebra. We can construct a derivative which leaves invariant the coordinate algebra and so takes physical fields into physical fields. A generalized Leibniz rule for this algebra can be found. Based on thismore » derivative differential forms and an exterior differential calculus can be constructed.« less

αAMG based on Weighted Matching for Systems of Elliptic PDEs Arising From Displacement and Mixed Methods

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

D'Ambra, P.; Vassilevski, P. S.

2014-05-30

Adaptive Algebraic Multigrid (or Multilevel) Methods (αAMG) are introduced to improve robustness and efficiency of classical algebraic multigrid methods in dealing with problems where no a-priori knowledge or assumptions on the near-null kernel of the underlined matrix are available. Recently we proposed an adaptive (bootstrap) AMG method, αAMG, aimed to obtain a composite solver with a desired convergence rate. Each new multigrid component relies on a current (general) smooth vector and exploits pairwise aggregation based on weighted matching in a matrix graph to define a new automatic, general-purpose coarsening process, which we refer to as “the compatible weighted matching”. Inmore » this work, we present results that broaden the applicability of our method to different finite element discretizations of elliptic PDEs. In particular, we consider systems arising from displacement methods in linear elasticity problems and saddle-point systems that appear in the application of the mixed method to Darcy problems.« less

Spectral relationships between kicked Harper and on-resonance double kicked rotor operators

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

Lawton, Wayne; Mouritzen, Anders S.; Wang Jiao

2009-03-15

Kicked Harper operators and on-resonance double kicked rotor operators model quantum systems whose semiclassical limits exhibit chaotic dynamics. Recent computational studies indicate a striking resemblance between the spectra of these operators. In this paper we apply C*-algebra methods to explain this resemblance. We show that each pair of corresponding operators belongs to a common rotation C*-algebra B{sub {alpha}}, prove that their spectra are equal if {alpha} is irrational, and prove that the Hausdorff distance between their spectra converges to zero as q increases if {alpha}=p/q with p and q coprime integers. Moreover, we show that corresponding operators in B{sub {alpha}}more » are homomorphic images of mother operators in the universal rotation C*-algebra A{sub {alpha}} that are unitarily equivalent and hence have identical spectra. These results extend analogous results for almost Mathieu operators. We also utilize the C*-algebraic framework to develop efficient algorithms to compute the spectra of these mother operators for rational {alpha} and present preliminary numerical results that support the conjecture that their spectra are Cantor sets if {alpha} is irrational. This conjecture for almost Mathieu operators, called the ten Martini problem, was recently proven after intensive efforts over several decades. This proof for the almost Mathieu operators utilized transfer matrix methods, which do not exist for the kicked operators. We outline a strategy, based on a special property of loop groups of semisimple Lie groups, to prove this conjecture for the kicked operators.« less

Finding Coefficients of the Full Array of Motion-Independent N-Body Potentials of Metric Gravity from Gravity's Exterior and Interior Effacement Algebra

NASA Astrophysics Data System (ADS)

Nordtvedt, Kenneth

2018-01-01

In the author's previous publications, a recursive linear algebraic method was introduced for obtaining (without gravitational radiation) the full potential expansions for the gravitational metric field components and the Lagrangian for a general N-body system. Two apparent properties of gravity— Exterior Effacement and Interior Effacement—were defined and fully enforced to obtain the recursive algebra, especially for the motion-independent potential expansions of the general N-body situation. The linear algebraic equations of this method determine the potential coefficients at any order n of the expansions in terms of the lower-order coefficients. Then, enforcing Exterior and Interior Effacement on a selecedt few potential series of the full motion-independent potential expansions, the complete exterior metric field for a single, spherically-symmetric mass source was obtained, producing the Schwarzschild metric field of general relativity. In this fourth paper of this series, the complete spatial metric's motion-independent potentials for N bodies are obtained using enforcement of Interior Effacement and knowledge of the Schwarzschild potentials. From the full spatial metric, the complete set of temporal metric potentials and Lagrangian potentials in the motion-independent case can then be found by transfer equations among the coefficients κ( n, α) → λ( n, ɛ) → ξ( n, α) with κ( n, α), λ( n, ɛ), ξ( n, α) being the numerical coefficients in the spatial metric, the Lagrangian, and the temporal metric potential expansions, respectively.

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

NASA Astrophysics Data System (ADS)

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

2017-08-01

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

Official crime data versus collaborative crime mapping at a Brazilian city

NASA Astrophysics Data System (ADS)

Brito, P. L.; Jesus, E. G. V.; Sant'Ana, R. M. S.; Martins, C.; Delgado, J. P. M.; Fernandes, V. O.

2014-11-01

In July of 2013 a group of undergraduate students from the Federal University of Bahia, Brazil, published a collaborative web map called "Where I Was Robbed". Their initial efforts in publicizing their web map were restricted to announce it at a local radio as a tool of social interest. In two months the map had almost 10.000 reports, 155 reports per day and people from more the 350 cities had already reported a crime. The present study consists in an investigation about this collaborative web map spatial correlation to official robbery data registered at the Secretary of Public Safety database, for the city of Salvador, Bahia. Kernel density estimator combined with map algebra was used to the investigation. Spatial correlations with official robbery data for the city of Salvador were not found initially, but after standardizing collaborative data and mining official registers, both data pointed at very similar areas as the main hot spots for pedestrian robbery. Both areas are located at two of the most economical active areas of the city, although web map crimes reports were more concentrated in an area with higher income population. This results and discussions indicates that this collaborative application is been used mainly by mid class and upper class parcel of the city population, but can still provide significant information on public safety priority areas. Therefore, extended divulgation, on local papers, radio and TV, of the collaborative crime map application and partnership with official agencies are strongly recommended.

A Unified Approach to Teaching Quadratic and Cubic Equations.

ERIC Educational Resources Information Center

Ward, A. J. B.

2003-01-01

Presents a simple method for teaching the algebraic solution of cubic equations via completion of the cube. Shows that this method is readily accepted by students already familiar with completion of the square as a method for quadratic equations. (Author/KHR)

Highest-weight representations of Brocherd`s algebras

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

Slansky, R.

1997-01-01

General features of highest-weight representations of Borcherd`s algebras are described. to show their typical features, several representations of Borcherd`s extensions of finite-dimensional algebras are analyzed. Then the example of the extension of affine- su(2) to a Borcherd`s algebra is examined. These algebras provide a natural way to extend a Kac-Moody algebra to include the hamiltonian and number-changing operators in a generalized symmetry structure.

Identities of Finitely Generated Algebras Over AN Infinite Field

NASA Astrophysics Data System (ADS)

Kemer, A. R.

1991-02-01

It is proved that for each finitely generated associative PI-algebra U over an infinite field F, there is a finite-dimensional F-algebra C such that the ideals of identities of the algebras U and C coincide. This yields a positive solution to the local problem of Specht for algebras over an infinite field: A finitely generated free associative algebra satisfies the maximum condition for T-ideals.

Quantum cluster algebras and quantum nilpotent algebras.

PubMed

Goodearl, Kenneth R; Yakimov, Milen T

2014-07-08

A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein-Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405-455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337-397] for the case of symmetric Kac-Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1-52] associated with double Bruhat cells coincide with the corresponding cluster algebras.

Quantum cluster algebras and quantum nilpotent algebras

PubMed Central

Goodearl, Kenneth R.; Yakimov, Milen T.

2014-01-01

A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197

Holographic Symmetries and Generalized Order Parameters for Topological Matter

NASA Astrophysics Data System (ADS)

Cobanera, Emilio; Ortiz, Gerardo; Nussinov, Zohar

2013-03-01

We introduce a universally applicable method, based on the bond-algebraic theory of dualities, to search for generalized order parameters in a wide variety of non-Landau systems, including topologically ordered matter. To this end we introduce the key notion of holographic symmetry. It reflects situations in which global symmetries become exact boundary symmetries under a duality mapping. Holographic symmetries are naturally related to edge modes and localization. The utility of our approach is illustrated by presenting a systematic derivation of generalized order parameters for pure and matter-coupled Abelian gauge theories and (extended) toric codes. Also we introduce a many-body extension of the Kitaev wire, the gauged Kitaev wire, and exploit holographic symmetries and dualities to describe its phase diagram, generalized order parameter, and edge states. [arXiv:1211.0564] This work was supported by the Dutch Science Foundation NWO/FOM and an ERC Advanced Investigator grant, and, in part, under grants No. NSF PHY11-25915 and CMMT 1106293.

Bit Error Probability for Maximum Likelihood Decoding of Linear Block Codes

NASA Technical Reports Server (NTRS)

Lin, Shu; Fossorier, Marc P. C.; Rhee, Dojun

1996-01-01

In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear codes is investigated. The contribution of each information bit to P(sub b) is considered. For randomly generated codes, it is shown that the conventional approximation at high SNR P(sub b) is approximately equal to (d(sub H)/N)P(sub s), where P(sub s) represents the block error probability, holds for systematic encoding only. Also systematic encoding provides the minimum P(sub b) when the inverse mapping corresponding to the generator matrix of the code is used to retrieve the information sequence. The bit error performances corresponding to other generator matrix forms are also evaluated. Although derived for codes with a generator matrix randomly generated, these results are shown to provide good approximations for codes used in practice. Finally, for decoding methods which require a generator matrix with a particular structure such as trellis decoding or algebraic-based soft decision decoding, equivalent schemes that reduce the bit error probability are discussed.

Geometric constrained variational calculus I: Piecewise smooth extremals

NASA Astrophysics Data System (ADS)

Massa, Enrico; Bruno, Danilo; Luria, Gianvittorio; Pagani, Enrico

2015-05-01

A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic constraints. Special attention is paid to the tensorial aspects of the theory. As far as the kinematical foundations are concerned, a fully covariant scheme is developed through the introduction of the concept of infinitesimal control. The standard classification of the extremals into normal and abnormal ones is discussed, pointing out the existence of an algebraic algorithm assigning to each admissible curve a corresponding abnormality index, related to the co-rank of a suitable linear map. Attention is then shifted to the study of the first variation of the action functional. The analysis includes a revisitation of Pontryagin's equations and of the Lagrange multipliers method, as well as a reformulation of Pontryagin's algorithm in Hamiltonian terms. The analysis is completed by a general result, concerning the existence of finite deformations with fixed endpoints.

Analytical Energy Gradients for Excited-State Coupled-Cluster Methods

NASA Astrophysics Data System (ADS)

Wladyslawski, Mark; Nooijen, Marcel

The equation-of-motion coupled-cluster (EOM-CC) and similarity transformed equation-of-motion coupled-cluster (STEOM-CC) methods have been firmly established as accurate and routinely applicable extensions of single-reference coupled-cluster theory to describe electronically excited states. An overview of these methods is provided, with emphasis on the many-body similarity transform concept that is the key to a rationalization of their accuracy. The main topic of the paper is the derivation of analytical energy gradients for such non-variational electronic structure approaches, with an ultimate focus on obtaining their detailed algebraic working equations. A general theoretical framework using Lagrange's method of undetermined multipliers is presented, and the method is applied to formulate the EOM-CC and STEOM-CC gradients in abstract operator terms, following the previous work in [P.G. Szalay, Int. J. Quantum Chem. 55 (1995) 151] and [S.R. Gwaltney, R.J. Bartlett, M. Nooijen, J. Chem. Phys. 111 (1999) 58]. Moreover, the systematics of the Lagrange multiplier approach is suitable for automation by computer, enabling the derivation of the detailed derivative equations through a standardized and direct procedure. To this end, we have developed the SMART (Symbolic Manipulation and Regrouping of Tensors) package of automated symbolic algebra routines, written in the Mathematica programming language. The SMART toolkit provides the means to expand, differentiate, and simplify equations by manipulation of the detailed algebraic tensor expressions directly. The Lagrangian multiplier formulation establishes a uniform strategy to perform the automated derivation in a standardized manner: A Lagrange multiplier functional is constructed from the explicit algebraic equations that define the energy in the electronic method; the energy functional is then made fully variational with respect to all of its parameters, and the symbolic differentiations directly yield the explicit equations for the wavefunction amplitudes, the Lagrange multipliers, and the analytical gradient via the perturbation-independent generalized Hellmann-Feynman effective density matrix. This systematic automated derivation procedure is applied to obtain the detailed gradient equations for the excitation energy (EE-), double ionization potential (DIP-), and double electron affinity (DEA-) similarity transformed equation-of-motion coupled-cluster singles-and-doubles (STEOM-CCSD) methods. In addition, the derivatives of the closed-shell-reference excitation energy (EE-), ionization potential (IP-), and electron affinity (EA-) equation-of-motion coupled-cluster singles-and-doubles (EOM-CCSD) methods are derived. Furthermore, the perturbative EOM-PT and STEOM-PT gradients are obtained. The algebraic derivative expressions for these dozen methods are all derived here uniformly through the automated Lagrange multiplier process and are expressed compactly in a chain-rule/intermediate-density formulation, which facilitates a unified modular implementation of analytic energy gradients for CCSD/PT-based electronic methods. The working equations for these analytical gradients are presented in full detail, and their factorization and implementation into an efficient computer code are discussed.

Form in Algebra: Reflecting, with Peacock, on Upper Secondary School Teaching.

ERIC Educational Resources Information Center

Menghini, Marta

1994-01-01

Discusses algebra teaching by looking back into the history of algebra and the work of George Peacock, who considered algebra from two points of view: symbolic and instrumental. Claims that, to be meaningful, algebra must be linked to real-world problems. (18 references) (MKR)

Fast and accurate computation of system matrix for area integral model-based algebraic reconstruction technique

NASA Astrophysics Data System (ADS)

Zhang, Shunli; Zhang, Dinghua; Gong, Hao; Ghasemalizadeh, Omid; Wang, Ge; Cao, Guohua

2014-11-01

Iterative algorithms, such as the algebraic reconstruction technique (ART), are popular for image reconstruction. For iterative reconstruction, the area integral model (AIM) is more accurate for better reconstruction quality than the line integral model (LIM). However, the computation of the system matrix for AIM is more complex and time-consuming than that for LIM. Here, we propose a fast and accurate method to compute the system matrix for AIM. First, we calculate the intersection of each boundary line of a narrow fan-beam with pixels in a recursive and efficient manner. Then, by grouping the beam-pixel intersection area into six types according to the slopes of the two boundary lines, we analytically compute the intersection area of the narrow fan-beam with the pixels in a simple algebraic fashion. Overall, experimental results show that our method is about three times faster than the Siddon algorithm and about two times faster than the distance-driven model (DDM) in computation of the system matrix. The reconstruction speed of our AIM-based ART is also faster than the LIM-based ART that uses the Siddon algorithm and DDM-based ART, for one iteration. The fast reconstruction speed of our method was accomplished without compromising the image quality.

Algebraic solution for the forward displacement analysis of the general 6-6 stewart mechanism

NASA Astrophysics Data System (ADS)

Wei, Feng; Wei, Shimin; Zhang, Ying; Liao, Qizheng

2016-01-01

The solution for the forward displacement analysis(FDA) of the general 6-6 Stewart mechanism(i.e., the connection points of the moving and fixed platforms are not restricted to lying in a plane) has been extensively studied, but the efficiency of the solution remains to be effectively addressed. To this end, an algebraic elimination method is proposed for the FDA of the general 6-6 Stewart mechanism. The kinematic constraint equations are built using conformal geometric algebra(CGA). The kinematic constraint equations are transformed by a substitution of variables into seven equations with seven unknown variables. According to the characteristic of anti-symmetric matrices, the aforementioned seven equations can be further transformed into seven equations with four unknown variables by a substitution of variables using the Gröbner basis. Its elimination weight is increased through changing the degree of one variable, and sixteen equations with four unknown variables can be obtained using the Gröbner basis. A 40th-degree univariate polynomial equation is derived by constructing a relatively small-sized 9´9 Sylvester resultant matrix. Finally, two numerical examples are employed to verify the proposed method. The results indicate that the proposed method can effectively improve the efficiency of solution and reduce the computational burden because of the small-sized resultant matrix.

Abstract Algebra for Algebra Teaching: Influencing School Mathematics Instruction

ERIC Educational Resources Information Center

Wasserman, Nicholas H.

2016-01-01

This article explores the potential for aspects of abstract algebra to be influential for the teaching of school algebra (and early algebra). Using national standards for analysis, four primary areas common in school mathematics--and their progression across elementary, middle, and secondary mathematics--where teaching may be transformed by…

Constructing Meanings and Utilities within Algebraic Tasks

ERIC Educational Resources Information Center

Ainley, Janet; Bills, Liz; Wilson, Kirsty

2004-01-01

The Purposeful Algebraic Activity project aims to explore the potential of spreadsheets in the introduction to algebra and algebraic thinking. We discuss two sub-themes within the project: tracing the development of pupils' construction of meaning for variable from arithmetic-based activity, through use of spreadsheets, and into formal algebra,…

Equivariant Gromov-Witten Invariants of Algebraic GKM Manifolds

NASA Astrophysics Data System (ADS)

Liu, Chiu-Chu Melissa; Sheshmani, Artan

2017-07-01

An algebraic GKM manifold is a non-singular algebraic variety equipped with an algebraic action of an algebraic torus, with only finitely many torus fixed points and finitely many 1-dimensional orbits. In this expository article, we use virtual localization to express equivariant Gromov-Witten invariants of any algebraic GKM manifold (which is not necessarily compact) in terms of Hodge integrals over moduli stacks of stable curves and the GKM graph of the GKM manifold.

Asymptotic aspect of derivations in Banach algebras.

PubMed

Roh, Jaiok; Chang, Ick-Soon

2017-01-01

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.

Lie algebra of conformal Killing-Yano forms

NASA Astrophysics Data System (ADS)

Ertem, Ümit

2016-06-01

We provide a generalization of the Lie algebra of conformal Killing vector fields to conformal Killing-Yano forms. A new Lie bracket for conformal Killing-Yano forms that corresponds to slightly modified Schouten-Nijenhuis bracket of differential forms is proposed. We show that conformal Killing-Yano forms satisfy a graded Lie algebra in constant curvature manifolds. It is also proven that normal conformal Killing-Yano forms in Einstein manifolds also satisfy a graded Lie algebra. The constructed graded Lie algebras reduce to the graded Lie algebra of Killing-Yano forms and the Lie algebras of conformal Killing and Killing vector fields in special cases.

Generalized Galilean algebras and Newtonian gravity

NASA Astrophysics Data System (ADS)

González, N.; Rubio, G.; Salgado, P.; Salgado, S.

2016-04-01

The non-relativistic versions of the generalized Poincaré algebras and generalized AdS-Lorentz algebras are obtained. These non-relativistic algebras are called, generalized Galilean algebras of type I and type II and denoted by GBn and GLn respectively. Using a generalized Inönü-Wigner contraction procedure we find that the generalized Galilean algebras of type I can be obtained from the generalized Galilean algebras type II. The S-expansion procedure allows us to find the GB5 algebra from the Newton Hooke algebra with central extension. The procedure developed in Ref. [1] allows us to show that the nonrelativistic limit of the five dimensional Einstein-Chern-Simons gravity is given by a modified version of the Poisson equation. The modification could be compatible with the effects of Dark Matter, which leads us to think that Dark Matter can be interpreted as a non-relativistic limit of Dark Energy.

On the structure of quantum L∞ algebras

NASA Astrophysics Data System (ADS)

Blumenhagen, Ralph; Fuchs, Michael; Traube, Matthias

2017-10-01

It is believed that any classical gauge symmetry gives rise to an L∞ algebra. Based on the recently realized relation between classical W algebras and L∞ algebras, we analyze how this generalizes to the quantum case. Guided by the existence of quantum W algebras, we provide a physically well motivated definition of quantum L∞ algebras describing the consistency of global symmetries in quantum field theories. In this case we are restricted to only two non-trivial graded vector spaces X 0 and X -1 containing the symmetry variations and the symmetry generators. This quantum L∞ algebra structure is explicitly exemplified for the quantum W_3 algebra. The natural quantum product between fields is the normal ordered one so that, due to contractions between quantum fields, the higher L∞ relations receive off-diagonal quantum corrections. Curiously, these are not present in the loop L∞ algebra of closed string field theory.

Simple and Accurate Method for Central Spin Problems

NASA Astrophysics Data System (ADS)

Lindoy, Lachlan P.; Manolopoulos, David E.

2018-06-01

We describe a simple quantum mechanical method that can be used to obtain accurate numerical results over long timescales for the spin correlation tensor of an electron spin that is hyperfine coupled to a large number of nuclear spins. This method does not suffer from the statistical errors that accompany a Monte Carlo sampling of the exact eigenstates of the central spin Hamiltonian obtained from the algebraic Bethe ansatz, or from the growth of the truncation error with time in the time-dependent density matrix renormalization group (TDMRG) approach. As a result, it can be applied to larger central spin problems than the algebraic Bethe ansatz, and for longer times than the TDMRG algorithm. It is therefore an ideal method to use to solve central spin problems, and we expect that it will also prove useful for a variety of related problems that arise in a number of different research fields.

An extended algebraic variational multiscale-multigrid-multifractal method (XAVM4) for large-eddy simulation of turbulent two-phase flow

NASA Astrophysics Data System (ADS)

Rasthofer, U.; Wall, W. A.; Gravemeier, V.

2018-04-01

A novel and comprehensive computational method, referred to as the eXtended Algebraic Variational Multiscale-Multigrid-Multifractal Method (XAVM4), is proposed for large-eddy simulation of the particularly challenging problem of turbulent two-phase flow. The XAVM4 involves multifractal subgrid-scale modeling as well as a Nitsche-type extended finite element method as an approach for two-phase flow. The application of an advanced structural subgrid-scale modeling approach in conjunction with a sharp representation of the discontinuities at the interface between two bulk fluids promise high-fidelity large-eddy simulation of turbulent two-phase flow. The high potential of the XAVM4 is demonstrated for large-eddy simulation of turbulent two-phase bubbly channel flow, that is, turbulent channel flow carrying a single large bubble of the size of the channel half-width in this particular application.

A New Technique for Personality Scale Construction. Preliminary Findings.

ERIC Educational Resources Information Center

Schaffner, Paul E.; Darlington, Richard B.

Most methods of personality scale construction have clear statistical disadvantages. A hybrid method (Darlington and Bishop, 1966) was found to increase scale validity more than any other method, with large item pools. A simple modification of the Darlington-Bishop method (algebraically and conceptually similar to ridge regression, but…