Multilevel filtering elliptic preconditioners
NASA Technical Reports Server (NTRS)
Kuo, C. C. Jay; Chan, Tony F.; Tong, Charles
1989-01-01
A class of preconditioners is presented for elliptic problems built on ideas borrowed from the digital filtering theory and implemented on a multilevel grid structure. They are designed to be both rapidly convergent and highly parallelizable. The digital filtering viewpoint allows the use of filter design techniques for constructing elliptic preconditioners and also provides an alternative framework for understanding several other recently proposed multilevel preconditioners. Numerical results are presented to assess the convergence behavior of the new methods and to compare them with other preconditioners of multilevel type, including the usual multigrid method as preconditioner, the hierarchical basis method and a recent method proposed by Bramble-Pasciak-Xu.
NASA Astrophysics Data System (ADS)
Lin, Paul T.; Shadid, John N.; Sala, Marzio; Tuminaro, Raymond S.; Hennigan, Gary L.; Hoekstra, Robert J.
2009-09-01
In this study results are presented for the large-scale parallel performance of an algebraic multilevel preconditioner for solution of the drift-diffusion model for semiconductor devices. The preconditioner is the key numerical procedure determining the robustness, efficiency and scalability of the fully-coupled Newton-Krylov based, nonlinear solution method that is employed for this system of equations. The coupled system is comprised of a source term dominated Poisson equation for the electric potential, and two convection-diffusion-reaction type equations for the electron and hole concentration. The governing PDEs are discretized in space by a stabilized finite element method. Solution of the discrete system is obtained through a fully-implicit time integrator, a fully-coupled Newton-based nonlinear solver, and a restarted GMRES Krylov linear system solver. The algebraic multilevel preconditioner is based on an aggressive coarsening graph partitioning of the nonzero block structure of the Jacobian matrix. Representative performance results are presented for various choices of multigrid V-cycles and W-cycles and parameter variations for smoothers based on incomplete factorizations. Parallel scalability results are presented for solution of up to 108 unknowns on 4096 processors of a Cray XT3/4 and an IBM POWER eServer system.
Parallel multilevel preconditioners
Bramble, J.H.; Pasciak, J.E.; Xu, Jinchao.
1989-01-01
In this paper, we shall report on some techniques for the development of preconditioners for the discrete systems which arise in the approximation of solutions to elliptic boundary value problems. Here we shall only state the resulting theorems. It has been demonstrated that preconditioned iteration techniques often lead to the most computationally effective algorithms for the solution of the large algebraic systems corresponding to boundary value problems in two and three dimensional Euclidean space. The use of preconditioned iteration will become even more important on computers with parallel architecture. This paper discusses an approach for developing completely parallel multilevel preconditioners. In order to illustrate the resulting algorithms, we shall describe the simplest application of the technique to a model elliptic problem.
Parallel Algebraic Multigrid Methods - High Performance Preconditioners
Yang, U M
2004-11-11
The development of high performance, massively parallel computers and the increasing demands of computationally challenging applications have necessitated the development of scalable solvers and preconditioners. One of the most effective ways to achieve scalability is the use of multigrid or multilevel techniques. Algebraic multigrid (AMG) is a very efficient algorithm for solving large problems on unstructured grids. While much of it can be parallelized in a straightforward way, some components of the classical algorithm, particularly the coarsening process and some of the most efficient smoothers, are highly sequential, and require new parallel approaches. This chapter presents the basic principles of AMG and gives an overview of various parallel implementations of AMG, including descriptions of parallel coarsening schemes and smoothers, some numerical results as well as references to existing software packages.
Shadid, John Nicolas; Elman, Howard; Shuttleworth, Robert R.; Howle, Victoria E.; Tuminaro, Raymond Stephen
2007-04-01
In recent years, considerable effort has been placed on developing efficient and robust solution algorithms for the incompressible Navier-Stokes equations based on preconditioned Krylov methods. These include physics-based methods, such as SIMPLE, and purely algebraic preconditioners based on the approximation of the Schur complement. All these techniques can be represented as approximate block factorization (ABF) type preconditioners. The goal is to decompose the application of the preconditioner into simplified sub-systems in which scalable multi-level type solvers can be applied. In this paper we develop a taxonomy of these ideas based on an adaptation of a generalized approximate factorization of the Navier-Stokes system first presented in [25]. This taxonomy illuminates the similarities and differences among these preconditioners and the central role played by efficient approximation of certain Schur complement operators. We then present a parallel computational study that examines the performance of these methods and compares them to an additive Schwarz domain decomposition (DD) algorithm. Results are presented for two and three-dimensional steady state problems for enclosed domains and inflow/outflow systems on both structured and unstructured meshes. The numerical experiments are performed using MPSalsa, a stabilized finite element code.
A multilevel preconditioner for domain decomposition boundary systems
Bramble, J.H.; Pasciak, J.E.; Xu, Jinchao.
1991-12-11
In this note, we consider multilevel preconditioning of the reduced boundary systems which arise in non-overlapping domain decomposition methods. It will be shown that the resulting preconditioned systems have condition numbers which be bounded in the case of multilevel spaces on the whole domain and grow at most proportional to the number of levels in the case of multilevel boundary spaces without multilevel extensions into the interior.
NASA Astrophysics Data System (ADS)
Akhunov, R. R.; Gazizov, T. R.; Kuksenko, S. P.
2016-08-01
The mean time needed to solve a series of systems of linear algebraic equations (SLAEs) as a function of the number of SLAEs is investigated. It is proved that this function has an extremum point. An algorithm for adaptively determining the time when the preconditioner matrix should be recalculated when a series of SLAEs is solved is developed. A numerical experiment with multiply solving a series of SLAEs using the proposed algorithm for computing 100 capacitance matrices with two different structures—microstrip when its thickness varies and a modal filter as the gap between the conductors varies—is carried out. The speedups turned out to be close to the optimal ones.
2010-12-01
discontinuous coefficients on geometrically nonconforming substructures. Technical Report Serie A 634, Instituto de Matematica Pura e Aplicada, Brazil, 2009...Instituto de Matematica Pura e Aplicada, Brazil, 2010. submitted. [41] M. Dryja, M. V. Sarkis, and O. B. Widlund. Multilevel Schwarz methods for
Accelerating the shifted Laplace preconditioner for the Helmholtz equation by multilevel deflation
NASA Astrophysics Data System (ADS)
Sheikh, A. H.; Lahaye, D.; Garcia Ramos, L.; Nabben, R.; Vuik, C.
2016-10-01
Many important physical phenomena can be described by the Helmholtz equation. We investigate to what extent the convergence of the shifted Laplacian preconditioner for the Helmholtz equation can be accelerated using deflation with multigrid vectors. We therefore present a unified framework for two published algorithms. The first deflates the preconditioned operator and requires no further preconditioning. The second deflates the original operator and combines deflation and preconditioning in a multiplicative fashion. We pursue two scientific contributions. First we show, using a model problem analysis, that both algorithms cluster the eigenvalues. The new and key insight here is that the near-kernel of the coarse grid operator causes a limited set of eigenvalues to shift away from the center of the cluster with a distance proportional to the wave number. This effect is less pronounced in the first algorithmic variant at the expense of a higher computational cost. In the second contribution we quantify for the first time the large amount of reduction in CPU-time that results from the clustering of eigenvalues and the reduction in iteration count. We report to this end on the findings of an implementation in PETSc on two and three-dimensional problems with constant and variable wave number.
A study of two domain decomposition preconditioners.
Dohrmann, Clark R.
2003-12-01
Large-scale finite element analysis often requires the iterative solution of equations with many unknowns. Preconditioners based on domain decomposition concepts have proven effective at accelerating the convergence of iterative methods like conjugate gradients for such problems. A study of two new domain decomposition preconditioners is presented here. The first is based on a substructuring approach and can viewed as a primal counterpart of the dual-primal variant of the finite element tearing and interconnecting method called FETI-DP. The second uses an algebraic approach to construct a coarse problem for a classic overlapping Schwarz method. The numerical properties of both preconditioners are shown to scale well with problem size. Although developed primarily for structural mechanics applications, the preconditioners are also useful for other problems types. Detailed descriptions of the two preconditioners along with numerical results are included.
NASA Astrophysics Data System (ADS)
Cusini, Matteo; van Kruijsdijk, Cor; Hajibeygi, Hadi
2016-06-01
This paper presents the development of an algebraic dynamic multilevel method (ADM) for fully implicit simulations of multiphase flow in homogeneous and heterogeneous porous media. Built on the fine-scale fully implicit (FIM) discrete system, ADM constructs a multilevel FIM system describing the coupled process on a dynamically defined grid of hierarchical nested topology. The multilevel adaptive resolution is determined at each time step on the basis of an error criterion. Once the grid resolution is established, ADM employs sequences of restriction and prolongation operators in order to map the FIM system across the considered resolutions. Several choices can be considered for prolongation (interpolation) operators, e.g., constant, bilinear and multiscale basis functions, all of which form partition of unity. The adaptive multilevel restriction operators, on the other hand, are constructed using a finite-volume scheme. This ensures mass conservation of the ADM solutions, and as such, the stability and accuracy of the simulations with multiphase transport. For several homogeneous and heterogeneous test cases, it is shown that ADM applies only a small fraction of the full FIM fine-scale grid cells in order to provide accurate solutions. The sensitivity of the solutions with respect to the employed fraction of grid cells (determined automatically based on the threshold value of the error criterion) is investigated for all test cases. ADM is a significant step forward in the application of dynamic local grid refinement methods, in the sense that it is algebraic, allows for systematic mapping across different scales, and applicable to heterogeneous test cases without any upscaling of fine-scale high resolution quantities. It also develops a novel multilevel multiscale method for FIM multiphase flow simulations in natural subsurface formations.
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.
Physics-based preconditioners for flow in fractured porous media
NASA Astrophysics Data System (ADS)
Sandve, T. H.; Keilegavlen, E.; Nordbotten, J. M.
2014-02-01
Discrete fracture models are an attractive alternative to upscaled models for flow in fractured media, as they provide a more accurate representation of the flow characteristics. A major challenge in discrete fracture simulation is to overcome the large computational cost associated with resolving the individual fractures in large-scale simulations. In this work, two characteristics of the fractured porous media are utilized to construct efficient preconditioners for the discretized flow equations. First, the preconditioners are tailored to the fracture geometry and presumed flow properties so that the dominant features are well represented there. This assures good scalability of the preconditioners in terms of problem size and permeability contrast. For fracture dominated problems, numerical examples show that such geometric preconditioners are comparable or preferable when compared to state-of-the-art algebraic multigrid preconditioners. The robustness of the physics-based preconditioner for less favorable fracture conditions is further demonstrated by a systematic degradation of the fracture hierarchy. Second, the preconditioners are physics preserving in the sense that conservative fluxes can be computed even for an inexact pressure solutions. This facilitates a scheme where accuracy in the linear solver can be traded for efficiency by terminating the iterative solvers based on error estimates, and without sacrificing basic physical modeling principles. With the combination of these two properties a novel preconditioner is obtained which bridges the gap between multiscale approximations and iterative linear solvers.
NASA Astrophysics Data System (ADS)
Bolaños, Marduk; Barberis-Blostein, Pablo
2015-11-01
We consider the Lindblad equation for a collection of multilevel systems coupled to independent environments. The equation is symmetric under the exchange of the labels associated with each system and thus the open-system dynamics takes place in the permutation-symmetric subspace of the operator space. The dimension of this space grows polynomially with the number of systems. We construct a basis of this space and a set of superoperators whose action on this basis is easily specified. For a given number of levels, M, these superoperators are written in terms of a bosonic realization of the generators of the Lie algebra {sl}({M}2). In some cases, these results enable finding an analytic solution of the master equation using known Lie-algebraic methods. To demonstrate this, we obtain an analytic expression for the state operator of a collection of three-level atoms coupled to independent radiation baths. When analytic solutions are difficult to find, the basis and the superoperators can be used to considerably reduce the computational resources required for simulations.
Preconditioners for the spectral multigrid method
NASA Technical Reports Server (NTRS)
Phillips, T. N.; Hussaini, M. Y.; Zang, T. A.
1986-01-01
The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.
A preconditioner for symmetric saddle point matrices
NASA Astrophysics Data System (ADS)
Wang, Chao
2017-09-01
In this paper, a new preconditioner for numerical solutions of symmetric indefinite linear systems is presented. The new preconditioner called as product preconditioner is constructed through the product of two fairly simple preconditioners. The eigenvalues distribution and the form of the eigenvectors of the product preconditioned matrix are analyzed. Numerical experiments illustrate the effectiveness of product preconditioner.
The construction of preconditioners for elliptic problems by substructuring, IV
Bramble, J.H.; Pasciak, J.E.; Schatz, A.H.
1989-07-01
We consider the problem of solving the algebraic system of equations which result from the discretization of elliptic boundary value problems defined on three-dimensional Euclidean space. We develop preconditioners for such systems based on substructuring (also known as domain decomposition). The resulting algorithms are well suited to emerging parallel computing architectures. We describe two techniques for developing these preconditioners. A theory for the analysis of the condition number for the resulting preconditioned system is given and the results of supporting numerical experiments are presented.
Scharz Preconditioners for Krylov Methods: Theory and Practice
Szyld, Daniel B.
2013-05-10
Several numerical methods were produced and analyzed. The main thrust of the work relates to inexact Krylov subspace methods for the solution of linear systems of equations arising from the discretization of partial di erential equa- tions. These are iterative methods, i.e., where an approximation is obtained and at each step. Usually, a matrix-vector product is needed at each iteration. In the inexact methods, this product (or the application of a preconditioner) can be done inexactly. Schwarz methods, based on domain decompositions, are excellent preconditioners for thise systems. We contributed towards their under- standing from an algebraic point of view, developed new ones, and studied their performance in the inexact setting. We also worked on combinatorial problems to help de ne the algebraic partition of the domains, with the needed overlap, as well as PDE-constraint optimization using the above-mentioned inexact Krylov subspace methods.
A comparison theorem for the iterative method with the preconditioner (I+Smax)
NASA Astrophysics Data System (ADS)
Kotakemori, Hisashi; Harada, Kyouji; Morimoto, Munenori; Niki, Hiroshi
2002-08-01
In 1991, Gunawardena et al. (Linear Algebra Appl. 154-156 (1991) 123) have reported the modified Gauss-Seidel method with a preconditioner (I+S). In this article, we propose to use a preconditioner (I+Smax) instead of (I+S). Here, Smax is constructed by only the largest element at each row of the upper triangular part of A. By using the lemma established Neumann and Plemmons (Linear Algebra Appl. 88/89 (1987) 559), we get the comparison theorem for the proposed method. Simple numerical examples are also given.
Parallel Algebraic Multigrids for Structural mechanics
Brezina, M; Tong, C; Becker, R
2004-05-11
This paper presents the results of a comparison of three parallel algebraic multigrid (AMG) preconditioners for structural mechanics applications. In particular, they are interested in investigating both the scalability and robustness of the preconditioners. Numerical results are given for a range of structural mechanics problems with various degrees of difficulty.
The construction of preconditioners for elliptic problems by substructuring, IV
Bramble, J.H.; Pasciak, J.E.; Schatz, A.H.
1987-06-01
We consider the problem of solving the algebraic system of equations which result from the discretization of elliptic boundary value problems defined on three dimensional Euclidean space. We develop preconditioners for such systems based on substructuring (also known as domain decomposition). The resulting algorithms are well suited to emerging parallel computing architectures. We describe two techniques for developing these precondictioners. A theory for the analysis of the condition number for the resulting preconditioned system is given and the results of supporting numerical experiments are presented. 16 refs., 2 tabs.
Equivariant preconditioners for boundary element methods
Tausch, J.
1994-12-31
In this paper the author proposes and discusses two preconditioners for boundary integral equations on domains which are nearly symmetric. The preconditioners under consideration are equivariant, that is, they commute with a group of permutation matrices. Numerical experiments demonstrate their efficiency for the GMRES method.
Sparse matrix orderings for factorized inverse preconditioners
Benzi, M.; Tuama, M.
1998-09-01
The effect of reorderings on the performance of factorized sparse approximate inverse preconditioners is considered. It is shown that certain reorderings can be very beneficial both in the preconditioner construction phase and in terms of the rate of convergence of the preconditioned iteration.
Wavelet Sparse Approximate Inverse Preconditioners
NASA Technical Reports Server (NTRS)
Chan, Tony F.; Tang, W.-P.; Wan, W. L.
1996-01-01
There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle and Chow and Saad also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse entries so that sparse approximate inverse is possible. However, for the class of matrices that, come from elliptic PDE problems, this assumption may not necessarily hold. Our main idea is to look for a basis, other than the standard one, such that a sparse representation of the inverse is feasible. A crucial observation is that the kind of matrices we are interested in typically have a piecewise smooth inverse. We exploit this fact, by applying wavelet techniques to construct a better sparse approximate inverse in the wavelet basis. We shall justify theoretically and numerically that our approach is effective for matrices with smooth inverse. We emphasize that in this paper we have only presented the idea of wavelet approximate inverses and demonstrated its potential but have not yet developed a highly refined and efficient algorithm.
NASA Astrophysics Data System (ADS)
Ma, Sangback
In this paper we compare various parallel preconditioners such as Point-SSOR (Symmetric Successive OverRelaxation), ILU(0) (Incomplete LU) in the Wavefront ordering, ILU(0) in the Multi-color ordering, Multi-Color Block SOR (Successive OverRelaxation), SPAI (SParse Approximate Inverse) and pARMS (Parallel Algebraic Recursive Multilevel Solver) for solving large sparse linear systems arising from two-dimensional PDE (Partial Differential Equation)s on structured grids. Point-SSOR is well-known, and ILU(0) is one of the most popular preconditioner, but it is inherently serial. ILU(0) in the Wavefront ordering maximizes the parallelism in the natural order, but the lengths of the wave-fronts are often nonuniform. ILU(0) in the Multi-color ordering is a simple way of achieving a parallelism of the order N, where N is the order of the matrix, but its convergence rate often deteriorates as compared to that of natural ordering. We have chosen the Multi-Color Block SOR preconditioner combined with direct sparse matrix solver, since for the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with the Multi-Color ordering. By using block version we expect to minimize the interprocessor communications. SPAI computes the sparse approximate inverse directly by least squares method. Finally, ARMS is a preconditioner recursively exploiting the concept of independent sets and pARMS is the parallel version of ARMS. Experiments were conducted for the Finite Difference and Finite Element discretizations of five two-dimensional PDEs with large meshsizes up to a million on an IBM p595 machine with distributed memory. Our matrices are real positive, i. e., their real parts of the eigenvalues are positive. We have used GMRES(m) as our outer iterative method, so that the convergence of GMRES(m) for our test matrices are mathematically guaranteed. Interprocessor communications were done using MPI (Message Passing Interface) primitives. The
CIMGS: An incomplete orthogonal factorization preconditioner
Wang, X.; Bramley, R.; Gallivan, K.
1994-12-31
This paper introduces, analyzes, and tests a preconditioning method for conjugate gradient (CG) type iterative methods. The authors start by examining incomplete Gram-Schmidt factorization (IGS) methods in order to motivate the new preconditioner. They show that the IGS family is more stable than IC, and they successfully factor any full rank matrix. Furthermore, IGS preconditioners are at least as effective in accelerating convergence of CG type iterative methods as the incomplete Cholesky (IC) preconditioner. The drawback of IGS methods are their high cost of factorization. This motivates finding a new algorithm, CIMGS, which can generate the same factor in a more efficient way.
Robust preconditioners for incompressible MHD models
NASA Astrophysics Data System (ADS)
Ma, Yicong; Hu, Kaibo; Hu, Xiaozhe; Xu, Jinchao
2016-07-01
In this paper, we develop two classes of robust preconditioners for the structure-preserving discretization of the incompressible magnetohydrodynamics (MHD) system. By studying the well-posedness of the discrete system, we design block preconditioners for them and carry out rigorous analysis on their performance. We prove that such preconditioners are robust with respect to most physical and discretization parameters. In our proof, we improve the existing estimates of the block triangular preconditioners for saddle point problems by removing the scaling parameters, which are usually difficult to choose in practice. This new technique is applicable not only to the MHD system, but also to other problems. Moreover, we prove that Krylov iterative methods with our preconditioners preserve the divergence-free condition exactly, which complements the structure-preserving discretization. Another feature is that we can directly generalize this technique to other discretizations of the MHD system. We also present preliminary numerical results to support the theoretical results and demonstrate the robustness of the proposed preconditioners.
Construction of preconditioners for elliptic problems by substructuring. I
Bramble, J.H.; Pasciak, J.E.; Schatz, A.H.
1986-07-01
We consider the problem of solving the algebraic system of equations which arise from the discretization of symmetric elliptic boundary value problems via finite element methods. A new class of preconditioners for the discrete system is developed based on substructuring (also known as domain decomposition). The resulting preconditioned algorithms are well suited to emerging parallel computing architectures. The proposed methods are applicable to problems on general domains involving differential operators with rather general coefficients. A basic theory for the analysis of the condition number of the preconditioned system (which determines the iterative convergence rate of the algorithm) is given. Techniques for applying the theory and algorithms to problems with irregular geometry are discussed and the results of extensive numerical experiments are reported.
Improved parallel preconditioners for multidisciplinary topology optimisations
NASA Astrophysics Data System (ADS)
Akay, H. U.; Oktay, E.; Manguoglu, M.; Sivas, A. A.
2016-04-01
Two commonly used preconditioners were evaluated for parallel solution of linear systems of equations with high condition numbers. The test cases were derived from topology optimisation applications in multiple disciplines, where the material distribution finite element methods were used. Because in this optimisation method, the equations rapidly become ill-conditioned due to disappearance of large number of elements from the design space as the optimisations progresses, it is shown that the choice for a suitable preconditioner becomes very crucial. In an earlier work the conjugate gradient (CG) method with a Block-Jacobi preconditioner was used, in which the number of CG iterations increased rapidly with the increasing number processors. Consequently, the parallel scalability of the method deteriorated fast due to the increasing loss of interprocessor information among the increased number of processors. By replacing the Block-Jacobi preconditioner with a sparse approximate inverse preconditioner, it is shown that the number of iterations to converge became independent of the number of processors. Therefore, the parallel scalability is improved.
Domain decomposition method of stochastic PDEs: a two-level scalable preconditioner
NASA Astrophysics Data System (ADS)
Subber, Waad; Sarkar, Abhijit
2012-02-01
For uncertainty quantification in many practical engineering problems, the stochastic finite element method (SFEM) may be computationally challenging. In SFEM, the size of the algebraic linear system grows rapidly with the spatial mesh resolution and the order of the stochastic dimension. In this paper, we describe a non-overlapping domain decomposition method, namely the iterative substructuring method to tackle the large-scale linear system arising in the SFEM. The SFEM is based on domain decomposition in the geometric space and a polynomial chaos expansion in the probabilistic space. In particular, a two-level scalable preconditioner is proposed for the iterative solver of the interface problem for the stochastic systems. The preconditioner is equipped with a coarse problem which globally connects the subdomains both in the geometric and probabilistic spaces via their corner nodes. This coarse problem propagates the information quickly across the subdomains leading to a scalable preconditioner. For numerical illustrations, a two-dimensional stochastic elliptic partial differential equation (SPDE) with spatially varying non-Gaussian random coefficients is considered. The numerical scalability of the the preconditioner is investigated with respect to the mesh size, subdomain size, fixed problem size per subdomain and order of polynomial chaos expansion. The numerical experiments are performed on a Linux cluster using MPI and PETSc parallel libraries.
Approximate inverse preconditioners for general sparse matrices
Chow, E.; Saad, Y.
1994-12-31
Preconditioned Krylov subspace methods are often very efficient in solving sparse linear matrices that arise from the discretization of elliptic partial differential equations. However, for general sparse indifinite matrices, the usual ILU preconditioners fail, often because of the fact that the resulting factors L and U give rise to unstable forward and backward sweeps. In such cases, alternative preconditioners based on approximate inverses may be attractive. We are currently developing a number of such preconditioners based on iterating on each column to get the approximate inverse. For this approach to be efficient, the iteration must be done in sparse mode, i.e., we must use sparse-matrix by sparse-vector type operatoins. We will discuss a few options and compare their performance on standard problems from the Harwell-Boeing collection.
Fast wavelet based sparse approximate inverse preconditioner
Wan, W.L.
1996-12-31
Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.
NASA Astrophysics Data System (ADS)
Whiteley, J. P.
2017-06-01
Large, incompressible elastic deformations are governed by a system of nonlinear partial differential equations. The finite element discretisation of these partial differential equations yields a system of nonlinear algebraic equations that are usually solved using Newton's method. On each iteration of Newton's method, a linear system must be solved. We exploit the structure of the Jacobian matrix to propose a preconditioner, comprising two steps. The first step is the solution of a relatively small, symmetric, positive definite linear system using the preconditioned conjugate gradient method. This is followed by a small number of multigrid V-cycles for a larger linear system. Through the use of exemplar elastic deformations, the preconditioner is demonstrated to facilitate the iterative solution of the linear systems arising. The number of GMRES iterations required has only a very weak dependence on the number of degrees of freedom of the linear systems.
An evaluation of parallel multigrid as a solver and a preconditioner for singular perturbed problems
Oosterlee, C.W.; Washio, T.
1996-12-31
In this paper we try to achieve h-independent convergence with preconditioned GMRES and BiCGSTAB for 2D singular perturbed equations. Three recently developed multigrid methods are adopted as a preconditioner. They are also used as solution methods in order to compare the performance of the methods as solvers and as preconditioners. Two of the multigrid methods differ only in the transfer operators. One uses standard matrix- dependent prolongation operators from. The second uses {open_quotes}upwind{close_quotes} prolongation operators, developed. Both employ the Galerkin coarse grid approximation and an alternating zebra line Gauss-Seidel smoother. The third method is based on the block LU decomposition of a matrix and on an approximate Schur complement. This multigrid variant is presented in. All three multigrid algorithms are algebraic methods.
ROBUST ALGEBRAIC PRECONDITIONERS USING IFPACK 3.0.
Sala, Marzio; Heroux, Michael A.
2005-01-01
IFPACKprovidesasuiteofobject-orientedalgebraicpreconditionersforthesolutionofprecon-ditionediterativesolvers.IFPACKconstructorsexpectthe(distributed)realsparsematrixtobeanEpetraRowMatrixobject.IFPACKcanbeusedtodefinepointandblockrelaxationprecondition-ers,variousflavorsofincompletefactorizationsforsymmetricandnon-symmetricmatrices,andone-leveladditiveSchwarzpreconditionerswithvariableoverlap.ExactLUfactorizationsofthelocalsubmatrixcanbeaccessedthroughtheAMESOSpackages.IFPACK,aspartoftheTrilinosSolverProject,interactswellwithotherTrilinospackages.Inparticular,IFPACKobjectscanbeusedaspreconditionersforAZTECOO,andassmoothersforML.IFPACKismainlywritteninC++,butonlyalimitedsubsetofC++featuresisused,inordertoenhanceportability.3
NASA Astrophysics Data System (ADS)
Kong, Fande; Cai, Xiao-Chuan
2017-07-01
Nonlinear fluid-structure interaction (FSI) problems on unstructured meshes in 3D appear in many applications in science and engineering, such as vibration analysis of aircrafts and patient-specific diagnosis of cardiovascular diseases. In this work, we develop a highly scalable, parallel algorithmic and software framework for FSI problems consisting of a nonlinear fluid system and a nonlinear solid system, that are coupled monolithically. The FSI system is discretized by a stabilized finite element method in space and a fully implicit backward difference scheme in time. To solve the large, sparse system of nonlinear algebraic equations at each time step, we propose an inexact Newton-Krylov method together with a multilevel, smoothed Schwarz preconditioner with isogeometric coarse meshes generated by a geometry preserving coarsening algorithm. Here ;geometry; includes the boundary of the computational domain and the wet interface between the fluid and the solid. We show numerically that the proposed algorithm and implementation are highly scalable in terms of the number of linear and nonlinear iterations and the total compute time on a supercomputer with more than 10,000 processor cores for several problems with hundreds of millions of unknowns.
Kong, Fande; Cai, Xiao-Chuan
2017-03-24
Nonlinear fluid-structure interaction (FSI) problems on unstructured meshes in 3D appear many applications in science and engineering, such as vibration analysis of aircrafts and patient-specific diagnosis of cardiovascular diseases. In this work, we develop a highly scalable, parallel algorithmic and software framework for FSI problems consisting of a nonlinear fluid system and a nonlinear solid system, that are coupled monolithically. The FSI system is discretized by a stabilized finite element method in space and a fully implicit backward difference scheme in time. To solve the large, sparse system of nonlinear algebraic equations at each time step, we propose an inexactmore » Newton-Krylov method together with a multilevel, smoothed Schwarz preconditioner with isogeometric coarse meshes generated by a geometry preserving coarsening algorithm. Here ''geometry'' includes the boundary of the computational domain and the wet interface between the fluid and the solid. We show numerically that the proposed algorithm and implementation are highly scalable in terms of the number of linear and nonlinear iterations and the total compute time on a supercomputer with more than 10,000 processor cores for several problems with hundreds of millions of unknowns.« less
NASA Astrophysics Data System (ADS)
Takahashi, Toru; Coulier, Pieter; Darve, Eric
2017-07-01
We investigate an efficient preconditioning of iterative methods (such as GMRES) for solving dense linear systems Ax = b that follow from a boundary element method (BEM) for the 3D Helmholtz equation, focusing on the low-frequency regime. While matrix-vector products in GMRES can be accelerated through the low-frequency fast multipole method (LFFMM), the BEM often remains computationally expensive due to the large number of GMRES iterations. We propose the application of the inverse fast multipole method (IFMM) as a preconditioner to accelerate the convergence of GMRES. The IFMM is in essence an approximate direct solver that uses a multilevel hierarchical decomposition and low-rank approximations. The proposed IFMM-based preconditioning has a tunable parameter ε that balances the cost to construct a preconditioner M, which is an approximation of A-1, and the cost to perform the iterative process by means of M. Namely, using a small (respectively, large) value of ε takes a long (respectively, short) time to construct M, while the number of iterations can be small (respectively, large). A comprehensive set of numerical examples involving various boundary value problems with complicated geometries and mixed boundary conditions is presented to validate the efficiency of the proposed method. We show that the IFMM preconditioner (with a nearly optimal ε of 10-2) clearly outperforms some common preconditioners for the BEM, achieving 1.2-10.8 times speed-up of the computations, in particular when the scale of the underlying scatterer is about five wavelengths or more. In addition, the IFMM preconditioner is capable of solving complicated problems (in a reasonable amount of time) that BD preconditioner can not.
Multigroup diffusion preconditioners for multiplying fixed-source transport problems
NASA Astrophysics Data System (ADS)
Roberts, Jeremy A.; Forget, Benoit
2014-10-01
Several preconditioners based on multigroup diffusion are developed for application to multiplying fixed-source transport problems using the discrete ordinates method. By starting from standard, one-group, diffusion synthetic acceleration (DSA), a multigroup diffusion preconditioner is constructed that shares the same fine mesh as the transport problem. As a cheaper but effective alternative, a two-grid, coarse-mesh, multigroup diffusion preconditioner is examined, for which a variety of homogenization schemes are studied to generate the coarse mesh operator. Finally, a transport-corrected diffusion preconditioner based on application of the Newton-Shulz algorithm is developed. The results of several numerical studies indicate the coarse-mesh, diffusion preconditioners work very well. In particular, a coarse-mesh, transport-corrected, diffusion preconditioner reduced the computational time of multigroup GMRES by up to a factor of 17 and outperformed best-case Gauss-Seidel results by over an order of magnitude for all problems studied.
Element-topology-independent preconditioners for parallel finite element computations
NASA Technical Reports Server (NTRS)
Park, K. C.; Alexander, Scott
1992-01-01
A family of preconditioners for the solution of finite element equations are presented, which are element-topology independent and thus can be applicable to element order-free parallel computations. A key feature of the present preconditioners is the repeated use of element connectivity matrices and their left and right inverses. The properties and performance of the present preconditioners are demonstrated via beam and two-dimensional finite element matrices for implicit time integration computations.
Element-topology-independent preconditioners for parallel finite element computations
NASA Technical Reports Server (NTRS)
Park, K. C.; Alexander, Scott
1992-01-01
A family of preconditioners for the solution of finite element equations are presented, which are element-topology independent and thus can be applicable to element order-free parallel computations. A key feature of the present preconditioners is the repeated use of element connectivity matrices and their left and right inverses. The properties and performance of the present preconditioners are demonstrated via beam and two-dimensional finite element matrices for implicit time integration computations.
Two classes of preconditioners computed using block matrix factorization techniques
Baca, L.S.; Salane, D.E.
1987-07-01
Two methods for computing preconditioners for nonsymmetric block tridiagonal systems of linear equations are investigated. Adaptable general purpose implementations are given for both methods. 11 refs.
Towards an ideal preconditioner for linearized Navier-Stokes problems
Murphy, M.F.
1996-12-31
Discretizing certain linearizations of the steady-state Navier-Stokes equations gives rise to nonsymmetric linear systems with indefinite symmetric part. We show that for such systems there exists a block diagonal preconditioner which gives convergence in three GMRES steps, independent of the mesh size and viscosity parameter (Reynolds number). While this {open_quotes}ideal{close_quotes} preconditioner is too expensive to be used in practice, it provides a useful insight into the problem. We then consider various approximations to the ideal preconditioner, and describe the eigenvalues of the preconditioned systems. Finally, we compare these preconditioners numerically, and present our conclusions.
Philip, Bobby; Chartier, Dr Timothy
2012-01-01
methods based on Local Sensitivity Analysis (LSA). The method can be used in the context of geometric and algebraic multigrid methods for constructing smoothers, and in the context of Krylov methods for constructing block preconditioners. It is suitable for both constant and variable coecient problems. Furthermore, the method can be applied to systems arising from both scalar and coupled system partial differential equations (PDEs), as well as linear systems that do not arise from PDEs. The simplicity of the method will allow it to be easily incorporated into existing multigrid and Krylov solvers while providing a powerful tool for adaptively constructing methods tuned to a problem.
A double-sweeping preconditioner for the Helmholtz equation
NASA Astrophysics Data System (ADS)
Eslaminia, Mehran; Guddati, Murthy N.
2016-06-01
A new preconditioner is developed to increase the efficiency of iterative solution of the Helmholtz equation. The key idea of the proposed preconditioner is to split the domain of interest into smaller subdomains and sequentially approximate the forward and backward components of the solution. The sequential solution is facilitated by approximate interface conditions that ignore the effect of multiple reflections. The efficiency of the proposed method is tested using various 2-D heterogeneous media. We observe that the proposed preconditioner results in good convergence, with number of iterations growing very slowly with increasing frequency. We also note that the mesh size and number of subdomains do not affect the convergence rate. Finally, we find that the overall computational time is much smaller than that of the sweeping preconditioner.
Construction of preconditioners for elliptic problems by substructuring, III
Bramble, J.H.; Pasciak, J.E.; Schatz, A.H.
1988-10-01
In earlier parts of this series of papers, we constructed preconditioners for the discrete systems of equations arising from the numerical approximation of elliptic boundary value problems. The resulting algorithms are well suited for implementation on computers with parallel architecture. In this paper, we will develop a technique which utilizes these earlier methods to derive even more efficient preconditioners. The iterative algorithms using these new preconditioners converge to the solution of the discrete equations with a rate that is independent of the number of unknowns. These preconditioners involve an incomplete Chebyshev iteration for boundary interface conditions which results in a negligible increase in the amount of computational work. Theoretical estimates and the results of numerical experiments are given which demonstrate the effectiveness of the methods.
A Portable MPI Implementation of the SPAI Preconditioner in ISIS++
NASA Technical Reports Server (NTRS)
Barnard, Stephen T.; Clay, Robert L.; Chancellor, Marisa K. (Technical Monitor)
1997-01-01
A parallel MPI implementation of the Sparse Approximate Inverse (SPAI) preconditioner is described. SPAI has proven to be a highly effective preconditioner, and is inherently parallel because it computes columns (or rows) of the preconditioning matrix independently. However, there are several problems that must be addressed for an efficient MPI implementation: load balance, latency hiding, and the need for one-sided communication. The effectiveness, efficiency, and scaling behavior of our implementation will be shown for different platforms.
A Portable MPI Implementation of the SPAI Preconditioner in ISIS++
NASA Technical Reports Server (NTRS)
Barnard, Stephen T.; Clay, Robert L.; Chancellor, Marisa K. (Technical Monitor)
1997-01-01
A parallel MPI implementation of the Sparse Approximate Inverse (SPAI) preconditioner is described. SPAI has proven to be a highly effective preconditioner, and is inherently parallel because it computes columns (or rows) of the preconditioning matrix independently. However, there are several problems that must be addressed for an efficient MPI implementation: load balance, latency hiding, and the need for one-sided communication. The effectiveness, efficiency, and scaling behavior of our implementation will be shown for different platforms.
A fast map-making preconditioner for regular scanning patterns
Næss, Sigurd K.; Louis, Thibaut E-mail: thibaut.louis@astro.ox.ac.uk
2014-08-01
High-resolution Maximum Likelihood map-making of the Cosmic Microwave Background is usually performed using Conjugate Gradients with a preconditioner that ignores noise correlations. We here present a new preconditioner that approximates the map noise covariance as circulant, and show that this results in a speedup of up to 400% for a realistic scanning pattern from the Atacama Cosmology Telescope. The improvement is especially large for polarized maps.
Acceleration of Multidimensional Discrete Ordinates Methods Via Adjacent-Cell Preconditioners
Azmy, Y.Y.
2000-10-15
The adjacent-cell preconditioner (AP) formalism originally derived in slab geometry is extended to multidimensional Cartesian geometry for generic fixed-weight, weighted diamond difference neutron transport methods. This is accomplished for the thick-cell regime (KAP) and thin-cell regime (NAP). A spectral analysis of the resulting acceleration schemes demonstrates their excellent spectral properties for model problem configurations, characterized by a uniform mesh of infinite extent and homogeneous material composition, each in its own cell-size regime. Thus, the spectral radius of KAP vanishes as the computational cell size approaches infinity, but it exceeds unity for very thin cells, thereby implying instability. In contrast, NAP is stable and robust for all cell sizes, but its spectral radius vanishes more slowly as the cell size increases. For this reason, and to avoid potential complication in the case of cells that are thin in one dimension and thick in another, NAP is adopted in the remainder of this work. The most important feature of AP for practical implementation in production level codes is that it is cell centered, reducing the size of the algebraic system comprising the acceleration stage compared to face-centered schemes. Boundary conditions for finite extent problems and a mixing formula across material and cell-size discontinuity are derived and used to implement NAP in a test code, AHOT, and a production code, TORT. Numerical testing for algebraically linear iterative schemes for the cases embodied in Burre's Suite of Test Problems demonstrates the high efficiency of the new method in reducing the number of iterations required to achieve convergence, especially for optically thick cells where acceleration is most needed. Also, for algebraically nonlinear (adaptive) methods, AP generally performs better than the partial current rebalance method in TORT and the diffusion synthetic acceleration method in TWODANT. Finally, application of the AP
Adaptive algebraic reconstruction technique
Lu Wenkai; Yin Fangfang
2004-12-01
Algebraic reconstruction techniques (ART) are iterative procedures for reconstructing objects from their projections. It is proven that ART can be computationally efficient by carefully arranging the order in which the collected data are accessed during the reconstruction procedure and adaptively adjusting the relaxation parameters. In this paper, an adaptive algebraic reconstruction technique (AART), which adopts the same projection access scheme in multilevel scheme algebraic reconstruction technique (MLS-ART), is proposed. By introducing adaptive adjustment of the relaxation parameters during the reconstruction procedure, one-iteration AART can produce reconstructions with better quality, in comparison with one-iteration MLS-ART. Furthermore, AART outperforms MLS-ART with improved computational efficiency.
A multigrid preconditioner for the semiconductor equations
Meza, J.C.; Tuminaro, R.S.
1994-12-31
Currently, integrated circuits are primarily designed in a {open_quote}trial and error{close_quote} fashion. That is, prototypes are built and improved via experimentation and testing. In the near future, however, it may be possible to significantly reduce the time and cost of designing new devices by using computer simulations. To accurately perform these complex simulations in three dimensions, however, new algorithms and high performance computers are necessary. In this paper the authors discuss the use of multigrid preconditioning inside a semiconductor device modeling code, DANCIR. The DANCIR code is a full three-dimensional simulator capable of computing steady-state solutions of the drift-diffusion equations for a single semiconductor device and has been used to simulate a wide variety of different devices. At the inner core of DANCIR is a solver for the nonlinear equations that arise from the spatial discretization of the drift-diffusion equations on a rectangular grid. These nonlinear equations are resolved using Gummel`s method which requires three symmetric linear systems to be solved within each Gummel iteration. It is the resolution of these linear systems which comprises the dominant computational cost of this code. The original version of DANCIR uses a Cholesky preconditioned conjugate gradient algorithm to solve these linear systems. Unfortunately, this algorithm has a number of disadvantages: (1) it takes many iterations to converge (if it converges), (2) it can require a significant amount of computing time, and (3) it is not very parallelizable. To improve the situation, the authors consider a multigrid preconditioner. The multigrid method uses iterations on a hierarchy of grids to accelerate the convergence on the finest grid.
A note on the preconditioner Pm=(I+Sm)
NASA Astrophysics Data System (ADS)
Kohno, Toshiyuki; Niki, Hiroshi
2009-03-01
Kotakemori et al. [H. Kotakemori, K. Harada, M. Morimoto, H. Niki, A comparison theorem for the iterative method with the preconditioner (I+Smax), Journal of Computational and Applied Mathematics 145 (2002) 373-378] have reported that the convergence rate of the iterative method with a preconditioner Pm=(I+Sm) was superior to one of the modified Gauss-Seidel method under the condition. These authors derived a theorem comparing the Gauss-Seidel method with the proposed method. However, through application of a counter example, Wen Li [Wen Li, A note on the preconditioned GaussSeidel (GS) method for linear systems, Journal of Computational and Applied Mathematics 182 (2005) 81-91] pointed out that there exists a special matrix that does not satisfy this comparison theorem. In this note, we analyze the reason why such a to counter example may be produced, and propose a preconditioner to overcome this problem.
Construction of preconditioners for elliptic problems by substructuring. II
Bramble, J.H.; Pasciak, J.E.; Schatz, A.H.
1987-07-01
We give a method for constructing preconditioners for the discrete systems arising in the approximation of solutions of elliptic boundary value problems. These preconditioners are based on domain decomposition techniques and lead to algorithms which are well suited for parallel computing environments. The method presented in this paper leads to a preconditioned system with condition number proportional to d/h where d is the subdomain size and h is the mesh size. These techniques are applied to singularly perturbed problems and problems in the three dimensions. The results of numerical experiments illustrating the performance of the method on problems in two and three dimensions are given.
The Design and Implementation of hypre, a Library of Parallel High Performance Preconditioners
Falgout, R D; Jones, J E; Yang, U M
2004-07-17
The increasing demands of computationally challenging applications and the advance of larger more powerful computers with more complicated architectures have necessitated the development of new solvers and preconditioners. Since the implementation of these methods is quite complex, the use of high performance libraries with the newest efficient solvers and preconditioners becomes more important for promulgating their use into applications with relative ease. The hypre library [14, 17] has been designed with the primary goal of providing users with advanced scalable parallel preconditioners. Issues of robustness, ease of use, flexibility and interoperability have also been important. It can be used both as a solver package and as a framework for algorithm development. Its object model is more general and flexible than most current generation solver libraries [9]. hypre also provides several of the most commonly used solvers, such as conjugate gradient for symmetric systems or GMRES for nonsymmetric systems to be used in conjunction with the preconditioners. Design innovations have been made to enable access to the library in the way that applications users naturally think about their problems. For example, application developers that use structured grids, typically think of their problems in terms of stencils and grids. hypre's users do not have to learn complicated sparse matrix structures; instead hypre does the work of building these data structures through various conceptual interfaces. The conceptual interfaces currently implemented include stencil-based structured and semi-structured interfaces, a finite-element based unstructured interface, and a traditional linear-algebra based interface. The primary focus of this paper is on the design and implementation of the conceptual interfaces in hypre. The paper is organized as follows. The first two sections are of general interest.We begin in Section 2 with an introductory discussion of conceptual interfaces and
S-Preconditioner for Multi-fold Data Reduction with Guaranteed User-Controlled Accuracy
Jin, Ye; Lakshminarasimhan, Sriram; Shah, Neil; Gong, Zhenhuan; Chang, C. S.; Chen, Jacqueline H.; Ethier, Stephane; Kolla, Hemanth; Ku, Seung-Hoe; Klasky, S.; Latham, Robert J.; Ross, Rob; Schuchardt, Karen L.; Samatova, Nagiza F.
2011-12-14
The growing gap between the massive amounts of data generated by petascale scientific simulation codes and the capability of system hardware and software to effectively analyze this data necessitates data reduction. Yet, the increasing data complexity challenges most, if not all, of the existing data compression methods. In fact, lossless compression techniques offer no more than 10% reduction on scientific data that we have experience with, which is widely regarded as effectively incompressible. To bridge this gap, in this paper, we advocate a transformative strategy that enables fast, accurate, and multi-fold reduction of double-precision floating-point scientific data. The intuition behind our method is inspired by an effective use of preconditioners for linear algebra solvers optimized for a particular class of computational dwarfs (e.g., dense or sparse matrices). Focusing on a commonly used multi-resolution wavelet compression technique as the underlying solver for data reduction we propose the S-preconditioner, which transforms scientific data into a form with high global regularity to ensure a significant decrease in the number of wavelet coefficients stored for a segment of data. Combined with the subsequent EQ-calibrator, our resultant method (called S-Preconditioned EQ-Calibrated Wavelets (SPEQC-WAVELETS)), robustly achieved a 4- to 5- fold data reduction while guaranteeing user-defined accuracy of reconstructed data to be within 1% point-by-point relative error, lower than 0:01 Normalized RMSE, and higher than 0:99 Pearson Correlation. In this paper, we show the results we obtained by testing our method on six petascale simulation codes including fusion, combustion, climate, astrophysics, and subsurface groundwater in addition to 13 publicly available scientific datasets. We also demonstrate that application-driven data mining tasks performed on decompressed variables or their derived quantities produce results of comparable quality with the ones for
Teaching Algebra without Algebra
ERIC Educational Resources Information Center
Kalman, Richard S.
2008-01-01
Algebra is, among other things, a shorthand way to express quantitative reasoning. This article illustrates ways for the classroom teacher to convert algebraic solutions to verbal problems into conversational solutions that can be understood by students in the lower grades. Three reasonably typical verbal problems that either appeared as or…
NASA Astrophysics Data System (ADS)
Büsing, Henrik
2013-04-01
Two-phase flow in porous media occurs in various settings, such as the sequestration of CO2 in the subsurface, radioactive waste management, the flow of oil or gas in hydrocarbon reservoirs, or groundwater remediation. To model the sequestration of CO2, we consider a fully coupled formulation of the system of nonlinear, partial differential equations. For the solution of this system, we employ the Box method after Huber & Helmig (2000) for the space discretization and the fully implicit Euler method for the time discretization. After linearization with Newton's method, it remains to solve a linear system in every Newton step. We compare different iterative methods (BiCGStab, GMRES, AGMG, c.f., [Notay (2012)]) combined with different preconditioners (ILU0, ASM, Jacobi, and AMG as preconditioner) for the solution of these systems. The required Jacobians can be obtained elegantly with automatic differentiation (AD) [Griewank & Walther (2008)], a source code transformation providing exact derivatives. We compare the performance of the different iterative methods with their respective preconditioners for these linear systems. Furthermore, we analyze linear systems obtained by approximating the Jacobian with finite differences in terms of Newton steps per time step, steps of the iterative solvers and the overall solution time. Finally, we study the influence of heterogeneities in permeability and porosity on the performance of the iterative solvers and their robustness in this respect. References [Griewank & Walther(2008)] Griewank, A. & Walther, A., 2008. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, SIAM, Philadelphia, PA, 2nd edn. [Huber & Helmig(2000)] Huber, R. & Helmig, R., 2000. Node-centered finite volume discretizations for the numerical simulation of multiphase flow in heterogeneous porous media, Computational Geosciences, 4, 141-164. [Notay(2012)] Notay, Y., 2012. Aggregation-based algebraic multigrid for convection
Parallel iterative solvers and preconditioners using approximate hierarchical methods
Grama, A.; Kumar, V.; Sameh, A.
1996-12-31
In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.
Parallel preconditioners for monolithic solution of shear bands
NASA Astrophysics Data System (ADS)
Berger-Vergiat, Luc; McAuliffe, Colin; Waisman, Haim
2016-01-01
Shear bands are one of the most fascinating instabilities in metals that occur under high strain rates. They describe narrow regions, on the order of micron scales, where plastic deformations and significant heating are localized which eventually leads to fracture nucleation and failure of the component. In this work shear bands are described by a set of four strongly coupled thermo-mechanical equations discretized by a mixed finite element formulation. A thermo-viscoplastic flow rule is used to model the inelastic constitutive law and finite thermal conductivity is prescribed which gives rise to an inherent physical length scale, governed by competition of shear heating and thermal diffusion. The residual equations are solved monolithically by a Newton type method at every time step and have been shown to yield mesh insensitive result. The Jacobian of the system is sparse and has a nonsymmetric block structure that varies with the different stages of shear bands formation. The aim of the current work is to develop robust parallel preconditioners to GMRES in order to solve the resulting Jacobian systems efficiently. The main idea is to design Schur complements tailored to the specific block structure of the system and that account for the varying stages of shear bands. We develop multipurpose preconditioners that apply to standard irreducible discretizations as well as our recent work on isogeometric discretizations of shear bands. The proposed preconditioners are tested on benchmark examples and compared to standard state of practice solvers such as GMRES/ILU and LU direct solvers. Nonlinear and linear iterations counts as well as CPU times and computational speedups are reported and it is shown that the proposed preconditioners are robust, efficient and outperform traditional state of the art solvers.
Domain decomposition preconditioners for the spectral collocation method
NASA Technical Reports Server (NTRS)
Quarteroni, Alfio; Sacchilandriani, Giovanni
1988-01-01
Several block iteration preconditioners are proposed and analyzed for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate which does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism.
Domain decomposed preconditioners with Krylov subspace methods as subdomain solvers
Pernice, M.
1994-12-31
Domain decomposed preconditioners for nonsymmetric partial differential equations typically require the solution of problems on the subdomains. Most implementations employ exact solvers to obtain these solutions. Consequently work and storage requirements for the subdomain problems grow rapidly with the size of the subdomain problems. Subdomain solves constitute the single largest computational cost of a domain decomposed preconditioner, and improving the efficiency of this phase of the computation will have a significant impact on the performance of the overall method. The small local memory available on the nodes of most message-passing multicomputers motivates consideration of the use of an iterative method for solving subdomain problems. For large-scale systems of equations that are derived from three-dimensional problems, memory considerations alone may dictate the need for using iterative methods for the subdomain problems. In addition to reduced storage requirements, use of an iterative solver on the subdomains allows flexibility in specifying the accuracy of the subdomain solutions. Substantial savings in solution time is possible if the quality of the domain decomposed preconditioner is not degraded too much by relaxing the accuracy of the subdomain solutions. While some work in this direction has been conducted for symmetric problems, similar studies for nonsymmetric problems appear not to have been pursued. This work represents a first step in this direction, and explores the effectiveness of performing subdomain solves using several transpose-free Krylov subspace methods, GMRES, transpose-free QMR, CGS, and a smoothed version of CGS. Depending on the difficulty of the subdomain problem and the convergence tolerance used, a reduction in solution time is possible in addition to the reduced memory requirements. The domain decomposed preconditioner is a Schur complement method in which the interface operators are approximated using interface probing.
NASA Astrophysics Data System (ADS)
Blumenhagen, Ralph; Fuchs, Michael; Traube, Matthias
2017-07-01
It is shown that the closure of the infinitesimal symmetry transformations underlying classical W algebras give rise to L∞ algebras with in general field dependent gauge parameters. Therefore, the class of well understood W algebras provides highly nontrivial examples of such strong homotopy Lie algebras. We develop the general formalism for this correspondence and apply it explicitly to the classical W_3 algebra.
Kolotilina, L.; Nikishin, A.; Yeremin, A.
1994-12-31
The solution of large systems of linear equations is a crucial bottleneck when performing 3D finite element analysis of structures. Also, in many cases the reliability and robustness of iterative solution strategies, and their efficiency when exploiting hardware resources, fully determine the scope of industrial applications which can be solved on a particular computer platform. This is especially true for modern vector/parallel supercomputers with large vector length and for modern massively parallel supercomputers. Preconditioned iterative methods have been successfully applied to industrial class finite element analysis of structures. The construction and application of high quality preconditioners constitutes a high percentage of the total solution time. Parallel implementation of high quality preconditioners on such architectures is a formidable challenge. Two common types of existing preconditioners are the implicit preconditioners and the explicit preconditioners. The implicit preconditioners (e.g. incomplete factorizations of several types) are generally high quality but require solution of lower and upper triangular systems of equations per iteration which are difficult to parallelize without deteriorating the convergence rate. The explicit type of preconditionings (e.g. polynomial preconditioners or Jacobi-like preconditioners) require sparse matrix-vector multiplications and can be parallelized but their preconditioning qualities are less than desirable. The authors present results of numerical experiments with Factorized Sparse Approximate Inverses (FSAI) for symmetric positive definite linear systems. These are high quality preconditioners that possess a large resource of parallelism by construction without increasing the serial complexity.
Triangular preconditioners for saddle point problems with a penalty term
Klawonn, A.
1996-12-31
Triangular preconditioners for a class of saddle point problems with a penalty term are considered. An important example is the mixed formulation of the pure displacement problem in linear elasticity. It is shown that the spectrum of the preconditioned system is contained in a real, positive interval, and that the interval bounds can be made independent of the discretization and penalty parameters. This fact is used to construct bounds of the convergence rate of the GMRES method used with an energy norm. Numerical results are given for GMRES and BI-CGSTAB.
ERIC Educational Resources Information Center
Connections: A Journal of Adult Literacy, 1997
1997-01-01
This issue contains 12 articles written by teachers who have investigated various aspects of the multilevel question in their own classrooms. "The Multilevel Question" (Lenore Balliro) provides an introduction. "Deconstructing the Great Wall of Print" (Richard Goldberg) investigates reading strategies that allow students with a wide range of…
Tyrtyshnikov, E.E.
1994-12-31
There exist several preconditioning strategies for systems of linear equations with Toeplitz coefficient matrices. The most popular of them are based on the Strang circulants and the Chan optimal circulants. Let A-n be an n-by-n Toeplitz matrix. Then the Strang preconditioner S-n copies the central n/2 diagonals of A-n while other diagonals are determined by the circulant properties of S-n. The Chan circulant C-n coincides with the minimizer of the deviation A-n - C-n in the sense of the matrix Frobenius norm. At the first glance the Chan circulant should provide a faster convergence rate since it exploits more information on the coefficient matrix. The preconditioning quality is heavily dependent on clusterization of the preconditioned eigenvalues. According to recent results by R. Chan it is known that both considered circulants possess the clustering property if the coefficient Toeplitz matrices A-n are generated by a function which first belongs to the Wiener class and second is separated from zero. Both circulants provide approximately the same clustering rate, and therefore both should possess the same preconditioning quality. However, the most interesting case is the one when the generating function may take the zero value, and hence the circulants have unbounded in n inverses. In these cases the Strang preconditioners may appear to be singular and we recommend to use the so called improved Strang preconditioners (in which a zero eigenvalue of the Strang circulant is replaced by some positive value).
Matrix-free constructions of circulant and block circulant preconditioners
Yang, Chao; Ng, Esmond G.; Penczek, Pawel A.
2001-12-01
A framework for constructing circulant and block circulant preconditioners (C) for a symmetric linear system Ax=b arising from certain signal and image processing applications is presented in this paper. The proposed scheme does not make explicit use of matrix elements of A. It is ideal for applications in which A only exists in the form of a matrix vector multiplication routine, and in which the process of extracting matrix elements of A is costly. The proposed algorithm takes advantage of the fact that for many linear systems arising from signal or image processing applications, eigenvectors of A can be well represented by a small number of Fourier modes. Therefore, the construction of C can be carried out in the frequency domain by carefully choosing its eigenvalues so that the condition number of C{sup T} AC can be reduced significantly. We illustrate how to construct the spectrum of C in a way such that the smallest eigenvalues of C{sup T} AC overlaps with those of A extremely well while the largest eigenvalues of C{sup T} AC are smaller than those of A by several orders of magnitude. Numerical examples are provided to demonstrate the effectiveness of the preconditioner on accelerating the solution of linear systems arising from image reconstruction application.
A modified direct preconditioner for indefinite symmetric Toeplitz systems
Concus, P.; Saylor, P.
1994-12-31
A modification is presented of the classical $O(n{sup 2})$ algorithm of Trench for the direct solution of Toeplitz systems of equations. The Trench algorithm can be guaranteed to be stable only for matrices that are (symmetric) positive definite; it is generally unstable otherwise. The modification permits extension of the algorithm to compute an approximate inverse in the indefinite symmetric case, for which the unmodified algorithm breaks down when principal submatrices are singular. As a preconditioner, this approximate inverse has an advantage that only matrix-vector multiplications are required for the solution of a linear system, without forward and backward solves. The approximate inverse so obtained can be sufficiently accurate, moreover that, when it is used as a preconditioner for the applications investigated, subsequent iteration may not even be necessary. Numerical results are given for several test matrices. The perturbation to the original matrix that defines the modification is related to a perturbation in a quantity generated in the Trench algorithm; the associated stability of the Trench algorithm is discussed.
Spectral analysis and structure preserving preconditioners for fractional diffusion equations
NASA Astrophysics Data System (ADS)
Donatelli, Marco; Mazza, Mariarosa; Serra-Capizzano, Stefano
2016-02-01
Fractional partial order diffusion equations are a generalization of classical partial differential equations, used to model anomalous diffusion phenomena. When using the implicit Euler formula and the shifted Grünwald formula, it has been shown that the related discretizations lead to a linear system whose coefficient matrix has a Toeplitz-like structure. In this paper we focus our attention on the case of variable diffusion coefficients. Under appropriate conditions, we show that the sequence of the coefficient matrices belongs to the Generalized Locally Toeplitz class and we compute the symbol describing its asymptotic eigenvalue/singular value distribution, as the matrix size diverges. We employ the spectral information for analyzing known methods of preconditioned Krylov and multigrid type, with both positive and negative results and with a look forward to the multidimensional setting. We also propose two new tridiagonal structure preserving preconditioners to solve the resulting linear system, with Krylov methods such as CGNR and GMRES. A number of numerical examples show that our proposal is more effective than recently used circulant preconditioners.
A modified direct preconditioner for indefinite symmetric Toeplitz systems
Concus, P. California Univ., Berkeley, CA . Dept. of Mathematics); Saylor, P. . Dept. of Computer Science)
1992-11-01
A modification is presented of the classical O(n[sup 2]) algorithm of Trench for the direct solution of Toeplitz systems of equations. The Trench algorithm can be guaranteed to be stable only for matrices that are (symmetric) positive definite; it is generally unstable otherwise. The modification permits extension of the algorithm to compute an approximate inverse in the indefinite symmetric case, for which the unmodified algorithm breaks down when principal submatrices are singular. As a preconditioner, this approximate inverse has an advantage that only matrix-vector multiplications are required for the solution of a linear system, without forward and backward solves. The approximate inverse so obtained can be sufficiently accurate, moreover, that, when it is used as a preconditioner for the applications investigated, subsequent iteration may not even be necessary. Numerical results are given for several test matrices. The perturbation to the original matrix that defines the modification is related to a perturbation in a quantity generated in the Trench algorithm; the associated stability of the Trench algorithm is discussed.
A modified direct preconditioner for indefinite symmetric Toeplitz systems
Concus, P. |; Saylor, P.
1992-11-01
A modification is presented of the classical O(n{sup 2}) algorithm of Trench for the direct solution of Toeplitz systems of equations. The Trench algorithm can be guaranteed to be stable only for matrices that are (symmetric) positive definite; it is generally unstable otherwise. The modification permits extension of the algorithm to compute an approximate inverse in the indefinite symmetric case, for which the unmodified algorithm breaks down when principal submatrices are singular. As a preconditioner, this approximate inverse has an advantage that only matrix-vector multiplications are required for the solution of a linear system, without forward and backward solves. The approximate inverse so obtained can be sufficiently accurate, moreover, that, when it is used as a preconditioner for the applications investigated, subsequent iteration may not even be necessary. Numerical results are given for several test matrices. The perturbation to the original matrix that defines the modification is related to a perturbation in a quantity generated in the Trench algorithm; the associated stability of the Trench algorithm is discussed.
Newton-Raphson preconditioner for Krylov type solvers on GPU devices.
Kushida, Noriyuki
2016-01-01
A new Newton-Raphson method based preconditioner for Krylov type linear equation solvers for GPGPU is developed, and the performance is investigated. Conventional preconditioners improve the convergence of Krylov type solvers, and perform well on CPUs. However, they do not perform well on GPGPUs, because of the complexity of implementing powerful preconditioners. The developed preconditioner is based on the BFGS Hessian matrix approximation technique, which is well known as a robust and fast nonlinear equation solver. Because the Hessian matrix in the BFGS represents the coefficient matrix of a system of linear equations in some sense, the approximated Hessian matrix can be a preconditioner. On the other hand, BFGS is required to store dense matrices and to invert them, which should be avoided on modern computers and supercomputers. To overcome these disadvantages, we therefore introduce a limited memory BFGS, which requires less memory space and less computational effort than the BFGS. In addition, a limited memory BFGS can be implemented with BLAS libraries, which are well optimized for target architectures. There are advantages and disadvantages to the Hessian matrix approximation becoming better as the Krylov solver iteration continues. The preconditioning matrix varies through Krylov solver iterations, and only flexible Krylov solvers can work well with the developed preconditioner. The GCR method, which is a flexible Krylov solver, is employed because of the prevalence of GCR as a Krylov solver with a variable preconditioner. As a result of the performance investigation, the new preconditioner indicates the following benefits: (1) The new preconditioner is robust; i.e., it converges while conventional preconditioners (the diagonal scaling, and the SSOR preconditioners) fail. (2) In the best case scenarios, it is over 10 times faster than conventional preconditioners on a CPU. (3) Because it requries only simple operations, it performs well on a GPGPU. In
1998-06-01
on courses being taught at NPS. LIST OF REFERENCES [1] Anton , Howard , Elementary Linear Algebra , John Wiley and Sons, New York, New York, 1994...and computational techniques for solving systems of linear equations. The goal is to enhance current matrix algebra textbooks and help the beginning... algebra is the study of algebraic operations on matrices and of their applications, primarily for solving systems of linear equations. Systems of
Lin, Lin; Yang, Chao
2013-10-28
We discuss techniques for accelerating the self consistent field (SCF) iteration for solving the Kohn-Sham equations. These techniques are all based on constructing approximations to the inverse of the Jacobian associated with a fixed point map satisfied by the total potential. They can be viewed as preconditioners for a fixed point iteration. We point out different requirements for constructing preconditioners for insulating and metallic systems respectively, and discuss how to construct preconditioners to keep the convergence rate of the fixed point iteration independent of the size of the atomistic system. We propose a new preconditioner that can treat insulating and metallic system in a unified way. The new preconditioner, which we call an elliptic preconditioner, is constructed by solving an elliptic partial differential equation. The elliptic preconditioner is shown to be more effective in accelerating the convergence of a fixed point iteration than the existing approaches for large inhomogeneous systems at low temperature.
Scalable Parallel Algebraic Multigrid Solvers
Bank, R; Lu, S; Tong, C; Vassilevski, P
2005-03-23
The authors propose a parallel algebraic multilevel algorithm (AMG), which has the novel feature that the subproblem residing in each processor is defined over the entire partition domain, although the vast majority of unknowns for each subproblem are associated with the partition owned by the corresponding processor. This feature ensures that a global coarse description of the problem is contained within each of the subproblems. The advantages of this approach are that interprocessor communication is minimized in the solution process while an optimal order of convergence rate is preserved; and the speed of local subproblem solvers can be maximized using the best existing sequential algebraic solvers.
ERIC Educational Resources Information Center
Rickles, Jordan H.
2011-01-01
This study seeks to demonstrate a method for treatment effect estimation in a multisite observational study where the treatment is highly selective and the assignment mechanism varies across sites. The method is demonstrated by addressing three primary research questions about the effect of 8th grade algebra: (1) For students who take algebra in…
Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem
Vion, A. Geuzaine, C.
2014-06-01
This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.
A New Preconditioner on Gauss-Seidel Method for H-Matrices
NASA Astrophysics Data System (ADS)
Darvishi, M. T.; Azimbeigi, M.
2009-09-01
In order to accelerate the convergency of Gauss-Seidel method to solve systems of linear equations when the coefficient matrix is an H-matrix, a new preconditioner is introduced. The convergency of the new preconditioned method is proved.
Incomplete Augmented Lagrangian Preconditioner for Steady Incompressible Navier-Stokes Equations
Tan, Ning-Bo; Huang, Ting-Zhu; Hu, Ze-Jun
2013-01-01
An incomplete augmented Lagrangian preconditioner, for the steady incompressible Navier-Stokes equations discretized by stable finite elements, is proposed. The eigenvalues of the preconditioned matrix are analyzed. Numerical experiments show that the incomplete augmented Lagrangian-based preconditioner proposed is very robust and performs quite well by the Picard linearization or the Newton linearization over a wide range of values of the viscosity on both uniform and stretched grids. PMID:24235888
Incomplete augmented Lagrangian preconditioner for steady incompressible Navier-Stokes equations.
Tan, Ning-Bo; Huang, Ting-Zhu; Hu, Ze-Jun
2013-01-01
An incomplete augmented Lagrangian preconditioner, for the steady incompressible Navier-Stokes equations discretized by stable finite elements, is proposed. The eigenvalues of the preconditioned matrix are analyzed. Numerical experiments show that the incomplete augmented Lagrangian-based preconditioner proposed is very robust and performs quite well by the Picard linearization or the Newton linearization over a wide range of values of the viscosity on both uniform and stretched grids.
Multilevel domain decomposition for electronic structure calculations
Barrault, M. . E-mail: maxime.barrault@edf.fr; Cances, E. . E-mail: cances@cermics.enpc.fr; Hager, W.W. . E-mail: hager@math.ufl.edu; Le Bris, C. . E-mail: lebris@cermics.enpc.fr
2007-03-01
We introduce a new multilevel domain decomposition method (MDD) for electronic structure calculations within semi-empirical and density functional theory (DFT) frameworks. This method iterates between local fine solvers and global coarse solvers, in the spirit of domain decomposition methods. Using this approach, calculations have been successfully performed on several linear polymer chains containing up to 40,000 atoms and 200,000 atomic orbitals. Both the computational cost and the memory requirement scale linearly with the number of atoms. Additional speed-up can easily be obtained by parallelization. We show that this domain decomposition method outperforms the density matrix minimization (DMM) method for poor initial guesses. Our method provides an efficient preconditioner for DMM and other linear scaling methods, variational in nature, such as the orbital minimization (OM) procedure.
NASA Astrophysics Data System (ADS)
Mercier, Sylvain; Gratton, Serge; Tardieu, Nicolas; Vasseur, Xavier
2017-07-01
Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.
ERIC Educational Resources Information Center
Cavanagh, Sean
2009-01-01
As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…
ERIC Educational Resources Information Center
Cavanagh, Sean
2009-01-01
As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…
ERIC Educational Resources Information Center
Amdahl, Kenn; Loats, Jim
This book discusses algebra in a non-threatening, fun way. It explains concepts, vocabulary, and strategies of algebra in understandable terms. Chapter titles include: "Numbers with Interesting Properties"; "Important Concepts"; "Fraction Refresher"; "Terms, Factors, and Polynomials"; "Rearranging Expressions"; "Handy Tricks and Magic Words";…
A framework for the construction of preconditioners for systems of PDE
Holmgren, S.; Otto, K.
1994-12-31
The authors consider the solution of systems of partial differential equations (PDE) in 2D or 3D using preconditioned CG-like iterative methods. The PDE is discretized using a finite difference scheme with arbitrary order of accuracy. The arising sparse and highly structured system of equations is preconditioned using a discretization of a modified PDE, possibly exploiting a different discretization stencil. The preconditioner corresponds to a separable problem, and the discretization in one space direction is constructed so that the corresponding matrix is diagonalized by a unitary transformation. If this transformation is computable using a fast O(n log{sub 2} n) algorithm, the resulting preconditioner solve is of the same complexity. Also, since the preconditioner solves are based on a dimensional splitting, the intrinsic parallelism is good. Different choices of the unitary transformation are considered, e.g., the discrete Fourier transform, sine transform, and modified sine transform. The preconditioners fully exploit the structure of the original problem, and it is shown how to compute the parameters describing them subject to different optimality constraints. Some of these results recover results derived by e.g. R. Chan, T. Chan, and E. Tyrtyshnikov, but here they are stated in a {open_quotes}PDE context{close_quotes}. Numerical experiments where different preconditioners are exploited are presented. Primarily, high-order accurate discretizations for first-order PDE problems are studied, but also second-order derivatives are considered. The results indicate that utilizing preconditioners based on fast solvers for modified PDE problems yields good solution algorithms. These results extend previously derived theoretical and numerical results for second-order approximations for first-order PDE, exploiting preconditioners based on fast Fourier transforms.
Keyes, D.E. . Dept. of Mechanical Engineering); Gropp, W.D. )
1990-01-01
Discrete systems arising in computational fluid dynamics applications often require wide stencils adapted to the local convective direction in order to accommodate higher-order upwind differencing, and involve multiple components perhaps coupling strongly at each point. Conventional exactly or approximately factored inverses of such operators are burdensome to apply globally, especially in problems complicated by non-tensor-product domain geometry or adaptive refinement, though their forward'' action is not. Such problems can be solved by iterative methods by using either point-block preconditioners or combination space-decoupled/component-decoupled preconditioners that are based on lower-order discretizations. Except for a global implicit solve on a coarse grid, each phase in the application of such preconditioners has simple locally exploitable structure. 16 refs., 2 figs., 3 tabs.
Algorithmically scalable block preconditioner for fully implicit shallow-water equations in CAM-SE
Lott, P. Aaron; Woodward, Carol S.; Evans, Katherine J.
2014-10-19
Performing accurate and efficient numerical simulation of global atmospheric climate models is challenging due to the disparate length and time scales over which physical processes interact. Implicit solvers enable the physical system to be integrated with a time step commensurate with processes being studied. The dominant cost of an implicit time step is the ancillary linear system solves, so we have developed a preconditioner aimed at improving the efficiency of these linear system solves. Our preconditioner is based on an approximate block factorization of the linearized shallow-water equations and has been implemented within the spectral element dynamical core within the Community Atmospheric Model (CAM-SE). Furthermore, in this paper we discuss the development and scalability of the preconditioner for a suite of test cases with the implicit shallow-water solver within CAM-SE.
Algorithmically scalable block preconditioner for fully implicit shallow-water equations in CAM-SE
Lott, P. Aaron; Woodward, Carol S.; Evans, Katherine J.
2014-10-19
Performing accurate and efficient numerical simulation of global atmospheric climate models is challenging due to the disparate length and time scales over which physical processes interact. Implicit solvers enable the physical system to be integrated with a time step commensurate with processes being studied. The dominant cost of an implicit time step is the ancillary linear system solves, so we have developed a preconditioner aimed at improving the efficiency of these linear system solves. Our preconditioner is based on an approximate block factorization of the linearized shallow-water equations and has been implemented within the spectral element dynamical core within themore » Community Atmospheric Model (CAM-SE). Furthermore, in this paper we discuss the development and scalability of the preconditioner for a suite of test cases with the implicit shallow-water solver within CAM-SE.« less
Layout optimization with algebraic multigrid methods
NASA Technical Reports Server (NTRS)
Regler, Hans; Ruede, Ulrich
1993-01-01
Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.
FaCSI: A block parallel preconditioner for fluid-structure interaction in hemodynamics
NASA Astrophysics Data System (ADS)
Deparis, Simone; Forti, Davide; Grandperrin, Gwenol; Quarteroni, Alfio
2016-12-01
Modeling Fluid-Structure Interaction (FSI) in the vascular system is mandatory to reliably compute mechanical indicators in vessels undergoing large deformations. In order to cope with the computational complexity of the coupled 3D FSI problem after discretizations in space and time, a parallel solution is often mandatory. In this paper we propose a new block parallel preconditioner for the coupled linearized FSI system obtained after space and time discretization. We name it FaCSI to indicate that it exploits the Factorized form of the linearized FSI matrix, the use of static Condensation to formally eliminate the interface degrees of freedom of the fluid equations, and the use of a SIMPLE preconditioner for saddle-point problems. FaCSI is built upon a block Gauss-Seidel factorization of the FSI Jacobian matrix and it uses ad-hoc preconditioners for each physical component of the coupled problem, namely the fluid, the structure and the geometry. In the fluid subproblem, after operating static condensation of the interface fluid variables, we use a SIMPLE preconditioner on the reduced fluid matrix. Moreover, to efficiently deal with a large number of processes, FaCSI exploits efficient single field preconditioners, e.g., based on domain decomposition or the multigrid method. We measure the parallel performances of FaCSI on a benchmark cylindrical geometry and on a problem of physiological interest, namely the blood flow through a patient-specific femoropopliteal bypass. We analyze the dependence of the number of linear solver iterations on the cores count (scalability of the preconditioner) and on the mesh size (optimality).
Analysis of semi-Toeplitz preconditioners for first-order PDEs
Hemmingsson, L.
1994-12-31
A semi-Toeplitz preconditioner for nonsymmetric, nondiagonally dominant systems of equations is studied. The preconditioner solve is based on a Fast Modified Sine Transform. As a model problem the author studies a system of equations arising from an implicit time-discretization of a scalar hyperbolic PDE. Analytical formulas for the eigenvalues of the preconditioned system are derived. The convergence of a minimal residual iteration is shown to be dependent only on the grid ratio in space and not on the number of unknowns.
Preconditioners based on approximation of non-standard norms for phase separation applications
NASA Astrophysics Data System (ADS)
Kumar, Pawan
2016-06-01
Some of the phase separation processes are typically modeled by well known Cahn-Hilliard equation with obstacle potential. Solving these equations correspond to a nonsmooth and nonlinear optimization problem. Recently a globally convergent Newton Schur method was proposed for the non-linear Schur complement corresponding to this 2 × 2 non-linear system. The discrete linear problem has essentially three parameters: the mesh size, time step, and a parameter related to interface width. The preconditioners considered so far has not been robust to one of these parameters. We propose preconditioners that seem to be robust provided the mesh is sufficiently refined.
NASA Technical Reports Server (NTRS)
Mulligan, Jeffrey B.
2017-01-01
A color algebra refers to a system for computing sums and products of colors, analogous to additive and subtractive color mixtures. We would like it to match the well-defined algebra of spectral functions describing lights and surface reflectances, but an exact correspondence is impossible after the spectra have been projected to a three-dimensional color space, because of metamerism physically different spectra can produce the same color sensation. Metameric spectra are interchangeable for the purposes of addition, but not multiplication, so any color algebra is necessarily an approximation to physical reality. Nevertheless, because the majority of naturally-occurring spectra are well-behaved (e.g., continuous and slowly-varying), color algebras can be formulated that are largely accurate and agree well with human intuition. Here we explore the family of algebras that result from associating each color with a member of a three-dimensional manifold of spectra. This association can be used to construct a color product, defined as the color of the spectrum of the wavelength-wise product of the spectra associated with the two input colors. The choice of the spectral manifold determines the behavior of the resulting system, and certain special subspaces allow computational efficiencies. The resulting systems can be used to improve computer graphic rendering techniques, and to model various perceptual phenomena such as color constancy.
NASA Astrophysics Data System (ADS)
Mikhalev, A. V.; Pinchuk, I. A.
2005-06-01
The structure of Steinberg conformal algebras is studied; these are analogues of Steinberg groups (algebras, superalgebras).A Steinberg conformal algebra is defined as an abstract algebra by a system of generators and relations between the generators. It is proved that a Steinberg conformal algebra is the universal central extension of the corresponding conformal Lie algebra; the kernel of this extension is calculated.
NASA Astrophysics Data System (ADS)
Moroney, Timothy; Yang, Qianqian
2013-08-01
We develop a fast Poisson preconditioner for the efficient numerical solution of a class of two-sided nonlinear space-fractional diffusion equations in one and two dimensions using the method of lines. Using the shifted Grünwald finite difference formulas to approximate the two-sided (i.e. the left and right Riemann-Liouville) fractional derivatives, the resulting semi-discrete nonlinear systems have dense Jacobian matrices owing to the non-local property of fractional derivatives. We employ a modern initial value problem solver utilising backward differentiation formulas and Jacobian-free Newton-Krylov methods to solve these systems. For efficient performance of the Jacobian-free Newton-Krylov method it is essential to apply an effective preconditioner to accelerate the convergence of the linear iterative solver. The key contribution of our work is to generalise the fast Poisson preconditioner, widely used for integer-order diffusion equations, so that it applies to the two-sided space-fractional diffusion equation. A number of numerical experiments are presented to demonstrate the effectiveness of the preconditioner and the overall solution strategy.
NASA Astrophysics Data System (ADS)
Debreu, Laurent; Neveu, Emilie; Simon, Ehouarn; Le Dimet, Francois Xavier; Vidard, Arthur
2014-05-01
In order to lower the computational cost of the variational data assimilation process, we investigate the use of multigrid methods to solve the associated optimal control system. On a linear advection equation, we study the impact of the regularization term on the optimal control and the impact of discretization errors on the efficiency of the coarse grid correction step. We show that even if the optimal control problem leads to the solution of an elliptic system, numerical errors introduced by the discretization can alter the success of the multigrid methods. The view of the multigrid iteration as a preconditioner for a Krylov optimization method leads to a more robust algorithm. A scale dependent weighting of the multigrid preconditioner and the usual background error covariance matrix based preconditioner is proposed and brings significant improvements. [1] Laurent Debreu, Emilie Neveu, Ehouarn Simon, François-Xavier Le Dimet and Arthur Vidard, 2014: Multigrid solvers and multigrid preconditioners for the solution of variational data assimilation problems, submitted to QJRMS, http://hal.inria.fr/hal-00874643 [2] Emilie Neveu, Laurent Debreu and François-Xavier Le Dimet, 2011: Multigrid methods and data assimilation - Convergence study and first experiments on non-linear equations, ARIMA, 14, 63-80, http://intranet.inria.fr/international/arima/014/014005.html
ERIC Educational Resources Information Center
Capani, Antonio; De Dominicis, Gabriel
This paper proposes a model for a general interface between people and Computer Algebra Systems (CAS). The main features in the CAS interface are data navigation and the possibility of accessing powerful remote machines. This model is based on the idea of session management, in which the main engine of the tool enables interactions with the…
NASA Astrophysics Data System (ADS)
Koldan, Jelena; Puzyrev, Vladimir; de la Puente, Josep; Houzeaux, Guillaume; Cela, José María
2014-06-01
We present an elaborate preconditioning scheme for Krylov subspace methods which has been developed to improve the performance and reduce the execution time of parallel node-based finite-element (FE) solvers for 3-D electromagnetic (EM) numerical modelling in exploration geophysics. This new preconditioner is based on algebraic multigrid (AMG) that uses different basic relaxation methods, such as Jacobi, symmetric successive over-relaxation (SSOR) and Gauss-Seidel, as smoothers and the wave front algorithm to create groups, which are used for a coarse-level generation. We have implemented and tested this new preconditioner within our parallel nodal FE solver for 3-D forward problems in EM induction geophysics. We have performed series of experiments for several models with different conductivity structures and characteristics to test the performance of our AMG preconditioning technique when combined with biconjugate gradient stabilized method. The results have shown that, the more challenging the problem is in terms of conductivity contrasts, ratio between the sizes of grid elements and/or frequency, the more benefit is obtained by using this preconditioner. Compared to other preconditioning schemes, such as diagonal, SSOR and truncated approximate inverse, the AMG preconditioner greatly improves the convergence of the iterative solver for all tested models. Also, when it comes to cases in which other preconditioners succeed to converge to a desired precision, AMG is able to considerably reduce the total execution time of the forward-problem code-up to an order of magnitude. Furthermore, the tests have confirmed that our AMG scheme ensures grid-independent rate of convergence, as well as improvement in convergence regardless of how big local mesh refinements are. In addition, AMG is designed to be a black-box preconditioner, which makes it easy to use and combine with different iterative methods. Finally, it has proved to be very practical and efficient in the
NASA Astrophysics Data System (ADS)
Golenishcheva-Kutuzova, Maria I.; Kac, Victor G.
1998-04-01
Γ-conformal algebra is an axiomatic description of the operator product expansion of chiral fields with simple poles at finitely many points. We classify these algebras and their representations in terms of Lie algebras and their representations with an action of the group Γ. To every Γ-conformal algebra and a character of Γ we associate a Lie algebra generated by fields with the OPE with simple poles. Examples include twisted affine Kac-Moody algebras, the sin algebra (which is a "Γ-conformal" analogue of the general linear algebra) and its analogues, the algebra of pseudodifferential operators on the circle, etc.
Constructing efficient substructure-based preconditioners for BEM systems of equations
D'Araujo, Celio; D'Azevedo, Ed F; Gray, Leonard J
2011-01-01
In this work, a generic substructuring algorithm is employed to construct global block-diagonal preconditioners for BEM systems of equations. In this strategy, the allowable fill-in positions are those on-diagonal block matrices corresponding to each BE subregion. As these subsystems are independently assembled, the preconditioner for a particular BE model, after the LU decomposition of all subsystem matrices, is easily formed. So as to highlight the efficiency of the preconditioning proposed, the Bi-CG solver, which presents a quite erratic convergence behavior, is considered. In the particular applications of this paper, 3D representative volume elements (RVEs) of carbon-nanotube (CNT) composites are analyzed. The models contain up to several tens of thousands of degrees of freedom. The efficiency and relevance of the preconditioning technique is also discussed in the context of developing general (parallel) BE codes.
Tensor-product preconditioners for higher-order space-time discontinuous Galerkin methods
NASA Astrophysics Data System (ADS)
Diosady, Laslo T.; Murman, Scott M.
2017-02-01
A space-time discontinuous-Galerkin spectral-element discretization is presented for direct numerical simulation of the compressible Navier-Stokes equations. An efficient solution technique based on a matrix-free Newton-Krylov method is developed in order to overcome the stiffness associated with high solution order. The use of tensor-product basis functions is key to maintaining efficiency at high-order. Efficient preconditioning methods are presented which can take advantage of the tensor-product formulation. A diagonalized Alternating-Direction-Implicit (ADI) scheme is extended to the space-time discontinuous Galerkin discretization. A new preconditioner for the compressible Euler/Navier-Stokes equations based on the fast-diagonalization method is also presented. Numerical results demonstrate the effectiveness of these preconditioners for the direct numerical simulation of subsonic turbulent flows.
NASA Astrophysics Data System (ADS)
Vaninsky, Alexander
2011-04-01
This article introduces a trigonometric field (TF) that extends the field of real numbers by adding two new elements: sin and cos - satisfying an axiom sin2 + cos2 = 1. It is shown that by assigning meaningful names to particular elements of the field, all known trigonometric identities may be introduced and proved. Two different interpretations of the TF are discussed with many others potentially possible. The main objective of this article is to introduce a broader view of trigonometry that can serve as motivation for mathematics students and teachers to study and teach abstract algebraic structures.
Multi-Level iterative methods in computational plasma physics
Knoll, D.A.; Barnes, D.C.; Brackbill, J.U.; Chacon, L.; Lapenta, G.
1999-03-01
Plasma physics phenomena occur on a wide range of spatial scales and on a wide range of time scales. When attempting to model plasma physics problems numerically the authors are inevitably faced with the need for both fine spatial resolution (fine grids) and implicit time integration methods. Fine grids can tax the efficiency of iterative methods and large time steps can challenge the robustness of iterative methods. To meet these challenges they are developing a hybrid approach where multigrid methods are used as preconditioners to Krylov subspace based iterative methods such as conjugate gradients or GMRES. For nonlinear problems they apply multigrid preconditioning to a matrix-few Newton-GMRES method. Results are presented for application of these multilevel iterative methods to the field solves in implicit moment method PIC, multidimensional nonlinear Fokker-Planck problems, and their initial efforts in particle MHD.
NASA Astrophysics Data System (ADS)
Korneev, V. G.
2012-09-01
BPS is a well known an efficient and rather general domain decomposition Dirichlet-Dirichlet type preconditioner, suggested in the famous series of papers Bramble, Pasciak and Schatz (1986-1989). Since then, it has been serving as the origin for the whole family of domain decomposition Dirichlet-Dirichlet type preconditioners-solvers as for h so hp discretizations of elliptic problems. For its original version, designed for h discretizations, the named authors proved the bound O(1 + log2 H/ h) for the relative condition number under some restricting conditions on the domain decomposition and finite element discretization. Here H/ h is the maximal relation of the characteristic size H of a decomposition subdomain to the mesh parameter h of its discretization. It was assumed that subdomains are images of the reference unite cube by trilinear mappings. Later similar bounds related to h discretizations were proved for more general domain decompositions, defined by means of coarse tetrahedral meshes. These results, accompanied by the development of some special tools of analysis aimed at such type of decompositions, were summarized in the book of Toselli and Widlund (2005). This paper is also confined to h discretizations. We further expand the range of admissible domain decompositions for constructing BPS preconditioners, in which decomposition subdomains can be convex polyhedrons, satisfying some conditions of shape regularity. We prove the bound for the relative condition number with the same dependence on H/ h as in the bound given above. Along the way to this result, we simplify the proof of the so called abstract bound for the relative condition number of the domain decomposition preconditioner. In the part, related to the analysis of the interface sub-problem preconditioning, our technical tools are generalization of those used by Bramble, Pasciak and Schatz.
Ternary algebraic approach to extended superconformal algebras
NASA Astrophysics Data System (ADS)
Günaydin, Murat; Hyun, Seungjoon
1992-04-01
The construction of extended ( N = 2 and N = 4) superconformal algebras (SCA) over very general classes of ternary algebras (triple systems) is given. For N = 2 this construction leads to superconformal algebras corresponding to certain Kählerian coset spaces of Lie groups with non-vanishing torsion. In general, a given Lie group admits more than one coset space of this type. The construction and a complete classification of N = 2 SCAs over Kantor triple system is given. In particular, the division algebras and their tensor products lead to N = 2 superconformal algebras associated with the coset spaces of the groups of the Magic Square. For a very special class of ternary algebras, namely the Freudenthal triple (FT) systems, the N = 2 superconformal algebras can be extended to N = 4 superconformal algebras with the gauge group SU(2)×SU(2)×U(1). The realization and a complete classification of N = 2 and N = 4
Assessment of Preconditioner for a USM3D Hierarchical Adaptive Nonlinear Method (HANIM) (Invited)
NASA Technical Reports Server (NTRS)
Pandya, Mohagna J.; Diskin, Boris; Thomas, James L.; Frink, Neal T.
2016-01-01
Enhancements to the previously reported mixed-element USM3D Hierarchical Adaptive Nonlinear Iteration Method (HANIM) framework have been made to further improve robustness, efficiency, and accuracy of computational fluid dynamic simulations. The key enhancements include a multi-color line-implicit preconditioner, a discretely consistent symmetry boundary condition, and a line-mapping method for the turbulence source term discretization. The USM3D iterative convergence for the turbulent flows is assessed on four configurations. The configurations include a two-dimensional (2D) bump-in-channel, the 2D NACA 0012 airfoil, a three-dimensional (3D) bump-in-channel, and a 3D hemisphere cylinder. The Reynolds Averaged Navier Stokes (RANS) solutions have been obtained using a Spalart-Allmaras turbulence model and families of uniformly refined nested grids. Two types of HANIM solutions using line- and point-implicit preconditioners have been computed. Additional solutions using the point-implicit preconditioner alone (PA) method that broadly represents the baseline solver technology have also been computed. The line-implicit HANIM shows superior iterative convergence in most cases with progressively increasing benefits on finer grids.
Derive Workshop Matrix Algebra and Linear Algebra.
ERIC Educational Resources Information Center
Townsley Kulich, Lisa; Victor, Barbara
This document presents the course content for a workshop that integrates the use of the computer algebra system Derive with topics in matrix and linear algebra. The first section is a guide to using Derive that provides information on how to write algebraic expressions, make graphs, save files, edit, define functions, differentiate expressions,…
ERIC Educational Resources Information Center
Edwards, Edgar L., Jr., Ed.
The fundamentals of algebra and algebraic thinking should be a part of the background of all citizens in society. The vast increase in the use of technology requires that school mathematics ensure the teaching of algebraic thinking as well as its use at both the elementary and secondary school levels. Algebra is a universal theme that runs through…
On Exceptional Superconformal Algebras
Poletaeva, Elena
2010-06-17
We obtain realizations of superconformal algebras K(2), K'(4) and the exceptional N = 6 superconformal algebra in matrices over a Weyl algebra of size 2x2, 4x4 and 8x8, respectively. A general construction of these realizations is based on the spin representations of the orthogonal Lie algebras. We give explicit descriptions of these matrix realizations.
NASA Astrophysics Data System (ADS)
Foulis, David J.; Jenčová, Anna; Pulmannová, Sylvia
2017-02-01
Different versions of the notion of a state have been formulated for various so-called quantum structures. In this paper, we investigate the interplay among states on synaptic algebras and on its sub-structures. A synaptic algebra is a generalization of the partially ordered Jordan algebra of all bounded self-adjoint operators on a Hilbert space. The paper culminates with a characterization of extremal states on a commutative generalized Hermitian algebra, a special kind of synaptic algebra.
JTpack90: A parallel, object-based, Fortran 90 linear algebra package
Turner, J.A.; Kothe, D.B.; Ferrell, R.C.
1997-03-01
The authors have developed an object-based linear algebra package, currently with emphasis on sparse Krylov methods, driven primarily by needs of the Los Alamos National Laboratory parallel unstructured-mesh casting simulation tool Telluride. Support for a number of sparse storage formats, methods, and preconditioners have been implemented, driven primarily by application needs. They describe the object-based Fortran 90 approach, which enhances maintainability, performance, and extensibility, the parallelization approach using a new portable gather/scatter library (PGSLib), current capabilities and future plans, and present preliminary performance results on a variety of platforms.
NASA Astrophysics Data System (ADS)
Georgiev, K.; Zlatev, Z.
2012-10-01
The solution of systems of linear algebraic equations (SLAEs) is very often the most time-consuming part of the computational process during the treatment of the original problems, because these systems can be very large (containing up to many millions of equations). It is, therefore, important to select fast, robust and reliable methods for the solution of SLAEs when large applications are to be run, also in the case where fast modern computers are available. Since the coefficient matrices of the systems are normally sparse (i.e., most of their elements are zeros), the first requirement is to exploit efficiently the sparsity. However, this is normally not sufficient when the systems are very large. The computation of preconditioners based on approximate LU-factorizations and their use in the efforts to increase further the efficiency of the calculations will be discussed in this paper. Computational experiments based on comprehensive comparisons of many numerical results that are obtained by using ten well-known methods for solving SLAEs (the direct Gaussian elimination and nine iterative methods) when the coefficient matrices are chosen from the "Sparse Matrix Market" are reported in this paper. Most of the methods are preconditioned Krylov sub-space algorithms.
Quantum cluster algebras and quantum nilpotent algebras.
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
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
ERIC Educational Resources Information Center
Ross, Amanda; Willson, Victor
2012-01-01
This study examined the effects of types of representations, constructivist teaching approaches, and student engagement on middle school algebra students' procedural knowledge and conceptual understanding. Data gathered from 16 video lessons and algebra pretest/posttests were used to run three multilevel structural equation models. Symbolic…
An MPI implementation of the SPAI preconditioner on the T3E
Barnard, Stephen T.; Bernardo, Luis M.; Simon, Horst D.
1997-09-08
The authors describe and test spai_1.1, a parallel MPIimplementation of the sparse approximate inverse (SPAI) preconditioner.They show that SPAI can be very effective for solving a set of very largeand difficult problems on a Cray T3E. The results clearly show the valueof SPAI (and approximate inverse methods in general) as the viablealternative to ILU-type methods when facing very large and difficultproblems. The authorsstrengthen this conclusion by showing that spai_1.1also has very good scaling behavior.
Deformed Virasoro Algebras from Elliptic Quantum Algebras
NASA Astrophysics Data System (ADS)
Avan, J.; Frappat, L.; Ragoucy, E.
2017-09-01
We revisit the construction of deformed Virasoro algebras from elliptic quantum algebras of vertex type, generalizing the bilinear trace procedure proposed in the 1990s. It allows us to make contact with the vertex operator techniques that were introduced separately at the same period. As a by-product, the method pinpoints two critical values of the central charge for which the center of the algebra is extended, as well as (in the gl(2) case) a Liouville formula.
Multilevel and Diverse Classrooms
ERIC Educational Resources Information Center
Baurain, Bradley, Ed.; Ha, Phan Le, Ed.
2010-01-01
The benefits and advantages of classroom practices incorporating unity-in-diversity and diversity-in-unity are what "Multilevel and Diverse Classrooms" is all about. Multilevel classrooms--also known as mixed-ability or heterogeneous classrooms--are a fact of life in ESOL programs around the world. These classrooms are often not only…
Multilevel and Diverse Classrooms
ERIC Educational Resources Information Center
Baurain, Bradley, Ed.; Ha, Phan Le, Ed.
2010-01-01
The benefits and advantages of classroom practices incorporating unity-in-diversity and diversity-in-unity are what "Multilevel and Diverse Classrooms" is all about. Multilevel classrooms--also known as mixed-ability or heterogeneous classrooms--are a fact of life in ESOL programs around the world. These classrooms are often not only…
Multilevel Mixture Factor Models
ERIC Educational Resources Information Center
Varriale, Roberta; Vermunt, Jeroen K.
2012-01-01
Factor analysis is a statistical method for describing the associations among sets of observed variables in terms of a small number of underlying continuous latent variables. Various authors have proposed multilevel extensions of the factor model for the analysis of data sets with a hierarchical structure. These Multilevel Factor Models (MFMs)…
Learning Algebra in a Computer Algebra Environment
ERIC Educational Resources Information Center
Drijvers, Paul
2004-01-01
This article summarises a doctoral thesis entitled "Learning algebra in a computer algebra environment, design research on the understanding of the concept of parameter" (Drijvers, 2003). It describes the research questions, the theoretical framework, the methodology and the results of the study. The focus of the study is on the…
Connecting Arithmetic to Algebra
ERIC Educational Resources Information Center
Darley, Joy W.; Leapard, Barbara B.
2010-01-01
Algebraic thinking is a top priority in mathematics classrooms today. Because elementary school teachers lay the groundwork to develop students' capacity to think algebraically, it is crucial for teachers to have a conceptual understanding of the connections between arithmetic and algebra and be confident in communicating these connections. Many…
Connecting Arithmetic to Algebra
ERIC Educational Resources Information Center
Darley, Joy W.; Leapard, Barbara B.
2010-01-01
Algebraic thinking is a top priority in mathematics classrooms today. Because elementary school teachers lay the groundwork to develop students' capacity to think algebraically, it is crucial for teachers to have a conceptual understanding of the connections between arithmetic and algebra and be confident in communicating these connections. Many…
ERIC Educational Resources Information Center
Miller, L. Diane; England, David A.
1989-01-01
Describes a study in a large metropolitan high school to ascertain what influence the use of regular writing in algebra classes would have on students' attitudes towards algebra and their skills in algebra. Reports the simpler and more direct the writing topics the better. (MVL)
Profiles of Algebraic Competence
ERIC Educational Resources Information Center
Humberstone, J.; Reeve, R.A.
2008-01-01
The algebraic competence of 72 12-year-old female students was examined to identify profiles of understanding reflecting different algebraic knowledge states. Beginning algebraic competence (mapping abilities: word-to-symbol and vice versa, classifying, and solving equations) was assessed. One week later, the nature of assistance required to map…
Arithmetic: Prerequisite to Algebra?
ERIC Educational Resources Information Center
Rotman, Jack W.
Drawing from research and observations at Lansing Community College (Michigan) (LCC), this paper argues that typical arithmetic courses do little to prepare students to master algebra, and proposes an alternative set of arithmetic skills as actual prerequisites to algebra. The first section offers a description of the algebra sequence at LCC,…
ERIC Educational Resources Information Center
Mitchell, Sarah
2006-01-01
Many students find the leap from arithmetic to algebra a difficult one to make, and current literature suggests that a number of the common misconceptions held by students arise as a result of the methods which teachers use to present algebra. The abstract nature of algebra makes it difficult for students to grasp; students also struggle with the…
Developing Thinking in Algebra
ERIC Educational Resources Information Center
Mason, John; Graham, Alan; Johnson-Wilder, Sue
2005-01-01
This book is for people with an interest in algebra whether as a learner, or as a teacher, or perhaps as both. It is concerned with the "big ideas" of algebra and what it is to understand the process of thinking algebraically. The book has been structured according to a number of pedagogic principles that are exposed and discussed along the way,…
NASA Technical Reports Server (NTRS)
Iachello, Franco
1995-01-01
An algebraic formulation of quantum mechanics is presented. In this formulation, operators of interest are expanded onto elements of an algebra, G. For bound state problems in nu dimensions the algebra G is taken to be U(nu + 1). Applications to the structure of molecules are presented.
Ternary Virasoro - Witt algebra.
Zachos, C.; Curtright, T.; Fairlie, D.; High Energy Physics; Univ. of Miami; Univ. of Durham
2008-01-01
A 3-bracket variant of the Virasoro-Witt algebra is constructed through the use of su(1,1) enveloping algebra techniques. The Leibniz rules for 3-brackets acting on other 3-brackets in the algebra are discussed and verified in various situations.
Multilevel ensemble Kalman filtering
Hoel, Hakon; Law, Kody J. H.; Tempone, Raul
2016-06-14
This study embeds a multilevel Monte Carlo sampling strategy into the Monte Carlo step of the ensemble Kalman filter (EnKF) in the setting of finite dimensional signal evolution and noisy discrete-time observations. The signal dynamics is assumed to be governed by a stochastic differential equation (SDE), and a hierarchy of time grids is introduced for multilevel numerical integration of that SDE. Finally, the resulting multilevel EnKF is proved to asymptotically outperform EnKF in terms of computational cost versus approximation accuracy. The theoretical results are illustrated numerically.
Multilevel ensemble Kalman filtering
Hoel, Hakon; Law, Kody J. H.; Tempone, Raul
2016-06-14
This study embeds a multilevel Monte Carlo sampling strategy into the Monte Carlo step of the ensemble Kalman filter (EnKF) in the setting of finite dimensional signal evolution and noisy discrete-time observations. The signal dynamics is assumed to be governed by a stochastic differential equation (SDE), and a hierarchy of time grids is introduced for multilevel numerical integration of that SDE. Finally, the resulting multilevel EnKF is proved to asymptotically outperform EnKF in terms of computational cost versus approximation accuracy. The theoretical results are illustrated numerically.
Computer algebra and operators
NASA Technical Reports Server (NTRS)
Fateman, Richard; Grossman, Robert
1989-01-01
The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.
Subber, Waad Sarkar, Abhijit
2014-01-15
Recent advances in high performance computing systems and sensing technologies motivate computational simulations with extremely high resolution models with capabilities to quantify uncertainties for credible numerical predictions. A two-level domain decomposition method is reported in this investigation to devise a linear solver for the large-scale system in the Galerkin spectral stochastic finite element method (SSFEM). In particular, a two-level scalable preconditioner is introduced in order to iteratively solve the large-scale linear system in the intrusive SSFEM using an iterative substructuring based domain decomposition solver. The implementation of the algorithm involves solving a local problem on each subdomain that constructs the local part of the preconditioner and a coarse problem that propagates information globally among the subdomains. The numerical and parallel scalabilities of the two-level preconditioner are contrasted with the previously developed one-level preconditioner for two-dimensional flow through porous media and elasticity problems with spatially varying non-Gaussian material properties. A distributed implementation of the parallel algorithm is carried out using MPI and PETSc parallel libraries. The scalabilities of the algorithm are investigated in a Linux cluster.
Discrete Minimal Surface Algebras
NASA Astrophysics Data System (ADS)
Arnlind, Joakim; Hoppe, Jens
2010-05-01
We consider discrete minimal surface algebras (DMSA) as generalized noncommutative analogues of minimal surfaces in higher dimensional spheres. These algebras appear naturally in membrane theory, where sequences of their representations are used as a regularization. After showing that the defining relations of the algebra are consistent, and that one can compute a basis of the enveloping algebra, we give several explicit examples of DMSAs in terms of subsets of sln (any semi-simple Lie algebra providing a trivial example by itself). A special class of DMSAs are Yang-Mills algebras. The representation graph is introduced to study representations of DMSAs of dimension d ≤ 4, and properties of representations are related to properties of graphs. The representation graph of a tensor product is (generically) the Cartesian product of the corresponding graphs. We provide explicit examples of irreducible representations and, for coinciding eigenvalues, classify all the unitary representations of the corresponding algebras.
On Derivations Of Genetic Algebras
NASA Astrophysics Data System (ADS)
Mukhamedov, Farrukh; Qaralleh, Izzat
2014-11-01
A genetic algebra is a (possibly non-associative) algebra used to model inheritance in genetics. In application of genetics this algebra often has a basis corresponding to genetically different gametes, and the structure constant of the algebra encode the probabilities of producing offspring of various types. In this paper, we find the connection between the genetic algebras and evolution algebras. Moreover, we prove the existence of nontrivial derivations of genetic algebras in dimension two.
Chui, Siu Lit; Lu, Ya Yan
2004-03-01
Wide-angle full-vector beam propagation methods (BPMs) for three-dimensional wave-guiding structures can be derived on the basis of rational approximants of a square root operator or its exponential (i.e., the one-way propagator). While the less accurate BPM based on the slowly varying envelope approximation can be efficiently solved by the alternating direction implicit (ADI) method, the wide-angle variants involve linear systems that are more difficult to handle. We present an efficient solver for these linear systems that is based on a Krylov subspace method with an ADI preconditioner. The resulting wide-angle full-vector BPM is used to simulate the propagation of wave fields in a Y branch and a taper.
Glowinski, Roland . E-mail: roland@math.uh.edu; Toivanen, Jari . E-mail: jatoivan@ncsu.edu
2005-07-20
We study the efficient solution of non-equilibrium radiation diffusion problems. An implicit time discretization leads to the solution of systems of non-linear equations which couple radiation energy and material temperature. We consider the implicit Euler method, the mid-point scheme, the two-step backward differentiation formula, and a two-stage implicit Runge-Kutta method for time discretization. We employ a Newton-Krylov method in the solution of arising non-linear problems. We describe the computation of the Jacobian matrix for Newton's method using automatic differentiation based on the operator overloading in Fortran 90. For GMRES iterations, we propose a simple multigrid preconditioner applied directly to the coupled linearized problems. We demonstrate the efficiency and scalability of the proposed solution procedure by solving one-dimensional and two-dimensional model problems.
Scalability of preconditioners as a strategy for parallel computation of compressible fluid flow
Hansen, G.A.
1996-05-01
Parallel implementations of a Newton-Krylov-Schwarz algorithm are used to solve a model problem representing low Mach number compressible fluid flow over a backward-facing step. The Mach number is specifically selected to result in a numerically {open_quote}stiff{close_quotes} matrix problem, based on an implicit finite volume discretization of the compressible 2D Navier-Stokes/energy equations using primitive variables. Newton`s method is used to linearize the discrete system, and a preconditioned Krylov projection technique is used to solve the resulting linear system. Domain decomposition enables the development of a global preconditioner via the parallel construction of contributions derived from subdomains. Formation of the global preconditioner is based upon additive and multiplicative Schwarz algorithms, with and without subdomain overlap. The degree of parallelism of this technique is further enhanced with the use of a matrix-free approximation for the Jacobian used in the Krylov technique (in this case, GMRES(k)). Of paramount interest to this study is the implementation and optimization of these techniques on parallel shared-memory hardware, namely the Cray C90 and SGI Challenge architectures. These architectures were chosen as representative and commonly available to researchers interested in the solution of problems of this type. The Newton-Krylov-Schwarz solution technique is increasingly being investigated for computational fluid dynamics (CFD) applications due to the advantages of full coupling of all variables and equations, rapid non-linear convergence, and moderate memory requirements. A parallel version of this method that scales effectively on the above architectures would be extremely attractive to practitioners, resulting in efficient, cost-effective, parallel solutions exhibiting the benefits of the solution technique.
A Multilevel Approach to the Algebraic Image Reconstruction Problem
1994-06-01
space of the matrix is characterized. The composite linear system of equations can be solved using a block Gauss- Seidel method . This approach is...and later use this fact to show that the Gauss- Seidel method when applied to the problem cannot diverge and in fact must converge. Theorem 4.2: B is...xi - 1 L.....t q1Jxj L.....t q1Jxj , qii j=l j=i+l which defines one iteration of the Gauss- Seidel method . Recasting (5.4) once again in matrix
Prediction of Algebraic Instabilities
NASA Astrophysics Data System (ADS)
Zaretzky, Paula; King, Kristina; Hill, Nicole; Keithley, Kimberlee; Barlow, Nathaniel; Weinstein, Steven; Cromer, Michael
2016-11-01
A widely unexplored type of hydrodynamic instability is examined - large-time algebraic growth. Such growth occurs on the threshold of (exponentially) neutral stability. A new methodology is provided for predicting the algebraic growth rate of an initial disturbance, when applied to the governing differential equation (or dispersion relation) describing wave propagation in dispersive media. Several types of algebraic instabilities are explored in the context of both linear and nonlinear waves.
Connecting Algebra and Chemistry.
ERIC Educational Resources Information Center
O'Connor, Sean
2003-01-01
Correlates high school chemistry curriculum with high school algebra curriculum and makes the case for an integrated approach to mathematics and science instruction. Focuses on process integration. (DDR)
Infinite dimensional matrix algebras
NASA Astrophysics Data System (ADS)
Bordemann, M.; Hoppe, J.; Schaller, P.
1989-11-01
To each (finite dimensional) Lie algebra g we associate a class L λ(g) of infinite dimensional Lie algebras, induced by representations D λ(g). We show that in the case of sl(2, C) one obtains a series of pairwise non-isomorphic infinite dimensional Lie algebras depending continuously on a complex parameter λ. We connect this method with previous results on the relation between Diff AS 2 and su( N), and comment on a recent conjecture concerning higher spin algebras, and (2 + 1)-dimensional gravity.
Multilevel corporate environmental responsibility.
Karassin, Orr; Bar-Haim, Aviad
2016-12-01
The multilevel empirical study of the antecedents of corporate social responsibility (CSR) has been identified as "the first knowledge gap" in CSR research. Based on an extensive literature review, the present study outlines a conceptual multilevel model of CSR, then designs and empirically validates an operational multilevel model of the principal driving factors affecting corporate environmental responsibility (CER), as a measure of CSR. Both conceptual and operational models incorporate three levels of analysis: institutional, organizational, and individual. The multilevel nature of the design allows for the assessment of the relative importance of the levels and of their components in the achievement of CER. Unweighted least squares (ULS) regression analysis reveals that the institutional-level variables have medium relationships with CER, some variables having a negative effect. The organizational level is revealed as having strong and positive significant relationships with CER, with organizational culture and managers' attitudes and behaviors as significant driving forces. The study demonstrates the importance of multilevel analysis in improving the understanding of CSR drivers, relative to single level models, even if the significance of specific drivers and levels may vary by context.
NASA Astrophysics Data System (ADS)
Büsing, Henrik
2014-05-01
The geological sequestration of CO2 is considered as one option to mitigate anthropogenic effects on climate change. To describe the behavior of CO2 underground we consider mass balance equations for the two phases, CO2 and brine, which include the dissolution of CO2 into the brine phase and of H2O into the gas phase (c.f. [1]). After discretization in time with the implicit Euler method and in space with the Box method (c.f. [2]), we end up with a nonlinear system of equations. Newton's method is used to solve these systems, where the required Jacobians are obtained by automatic differentiation (AD) (c.f. [3]). In contrast to approximate Jacobians via finite differences, AD gives exact Jacobians through a source code transformation. These exact Jacobians have the advantage that no additional errors are introduced by the derivative computation. In consequence, fewer Newton iterations are needed and a performance increase during derivative computation can be observed (c.f. [4]). During the initial stage of a CO2 sequestration scenario the movement of the CO2 plume is driven by advective and buoyancy forces. After injection is finished solubility and density driven flow become dominant. We examine the performance of different iterative solvers and preconditioners for these two stages. To this end, we consider standard ILU preconditioning with BiCGStab as iterative solver, as well as GMRES, and algebraic and geometric multigrid methods. Our test example considers, on the one hand, a homogeneous permeability distribution and, on the other hand, a heterogeneous one. In the latter case we sample a heterogeneous porosity field from a Gaussian distribution and, subsequently, derive the corresponding permeabilities after [5]. Finally, we examine to which extent the amount of dissolved CO2 depends on the heterogeneities in the reservoir. References [1] Spycher, N., Pruess, K., & Ennis-King, J., 2003. CO2-H2O mixtures in the geological sequestration of CO2. I. Assessment and
The Virasoro vertex algebra and factorization algebras on Riemann surfaces
NASA Astrophysics Data System (ADS)
Williams, Brian
2017-08-01
This paper focuses on the connection of holomorphic two-dimensional factorization algebras and vertex algebras which has been made precise in the forthcoming book of Costello-Gwilliam. We provide a construction of the Virasoro vertex algebra starting from a local Lie algebra on the complex plane. Moreover, we discuss an extension of this factorization algebra to a factorization algebra on the category of Riemann surfaces. The factorization homology of this factorization algebra is computed as the correlation functions. We provide an example of how the Virasoro factorization algebra implements conformal symmetry of the beta-gamma system using the method of effective BV quantization.
Language Approaches to Beginning Algebra.
ERIC Educational Resources Information Center
Rotman, Jack W.
1990-01-01
Ideas which apply language concepts to the study of algebra are presented. Discussed are algebraic notation, vocabulary, vocalization, and written assignments. The careful use of algebraic language in mathematics classes is emphasized. (CW)
Practical Marginalized Multilevel Models
Griswold, Michael E.; Swihart, Bruce J.; Caffo, Brian S.; Zeger, Scott L.
2013-01-01
Clustered data analysis is characterized by the need to describe both systematic variation in a mean model and cluster-dependent random variation in an association model. Marginalized multilevel models embrace the robustness and interpretations of a marginal mean model, while retaining the likelihood inference capabilities and flexible dependence structures of a conditional association model. Although there has been increasing recognition of the attractiveness of marginalized multilevel models, there has been a gap in their practical application arising from a lack of readily available estimation procedures. We extend the marginalized multilevel model to allow for nonlinear functions in both the mean and association aspects. We then formulate marginal models through conditional specifications to facilitate estimation with mixed model computational solutions already in place. We illustrate the MMM and approximate MMM approaches on a cerebrovascular deficiency crossover trial using SAS and an epidemiological study on race and visual impairment using R. Datasets, SAS and R code are included as supplemental materials. PMID:24357884
Bicovariant quantum algebras and quantum Lie algebras
NASA Astrophysics Data System (ADS)
Schupp, Peter; Watts, Paul; Zumino, Bruno
1993-10-01
A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from Fun(mathfrak{G}_q ) to U q g, given by elements of the pure braid group. These operators—the “reflection matrix” Y≡L + SL - being a special case—generate algebras that linearly close under adjoint actions, i.e. they form generalized Lie algebras. We establish the connection between the Hopf algebra formulation of the calculus and a formulation in compact matrix form which is quite powerful for actual computations and as applications we find the quantum determinant and an orthogonality relation for Y in SO q (N).
Seo, Young Joo; Kim, Young Hee
2016-01-01
In this paper we construct some real algebras by using elementary functions, and discuss some relations between several axioms and its related conditions for such functions. We obtain some conditions for real-valued functions to be a (edge) d-algebra.
ERIC Educational Resources Information Center
Merlin, Ethan M.
2013-01-01
This article describes how the author has developed tasks for students that address the missed "essence of the matter" of algebraic transformations. Specifically, he has found that having students practice "perceiving" algebraic structure--by naming the "glue" in the expressions, drawing expressions using…
ERIC Educational Resources Information Center
Levy, Alissa Beth
2012-01-01
The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this dissertation,…
NASA Technical Reports Server (NTRS)
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
ERIC Educational Resources Information Center
Merlin, Ethan M.
2013-01-01
This article describes how the author has developed tasks for students that address the missed "essence of the matter" of algebraic transformations. Specifically, he has found that having students practice "perceiving" algebraic structure--by naming the "glue" in the expressions, drawing expressions using…
Learning Activity Package, Algebra.
ERIC Educational Resources Information Center
Evans, Diane
A set of ten teacher-prepared Learning Activity Packages (LAPs) in beginning algebra and nine in intermediate algebra, these units cover sets, properties of operations, number systems, open expressions, solution sets of equations and inequalities in one and two variables, exponents, factoring and polynomials, relations and functions, radicals,…
NASA Technical Reports Server (NTRS)
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
Algebraic Reasoning through Patterns
ERIC Educational Resources Information Center
Rivera, F. D.; Becker, Joanne Rossi
2009-01-01
This article presents the results of a three-year study that explores students' performance on patterning tasks involving prealgebra and algebra. The findings, insights, and issues drawn from the study are intended to help teach prealgebra and algebra. In the remainder of the article, the authors take a more global view of the three-year study on…
ERIC Educational Resources Information Center
Levy, Alissa Beth
2012-01-01
The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this dissertation,…
Parastatistics Algebras and Combinatorics
NASA Astrophysics Data System (ADS)
Popov, T.
2005-03-01
We consider the algebras spanned by the creation parafermionic and parabosonic operators which give rise to generalized parastatistics Fock spaces. The basis of such a generalized Fock space can be labelled by Young tableaux which are combinatorial objects. By means of quantum deformations a nice combinatorial structure of the algebra of the plactic monoid that lies behind the parastatistics is revealed.
ERIC Educational Resources Information Center
Cavanagh, Sean
2008-01-01
A popular humorist and avowed mathphobe once declared that in real life, there's no such thing as algebra. Kathie Wilson knows better. Most of the students in her 8th grade class will be thrust into algebra, the definitive course that heralds the beginning of high school mathematics, next school year. The problem: Many of them are about three…
Implementation of Hybrid V-Cycle Multilevel Methods for Mixed Finite Element Systems with Penalty
NASA Technical Reports Server (NTRS)
Lai, Chen-Yao G.
1996-01-01
The goal of this paper is the implementation of hybrid V-cycle hierarchical multilevel methods for the indefinite discrete systems which arise when a mixed finite element approximation is used to solve elliptic boundary value problems. By introducing a penalty parameter, the perturbed indefinite system can be reduced to a symmetric positive definite system containing the small penalty parameter for the velocity unknown alone. We stabilize the hierarchical spatial decomposition approach proposed by Cai, Goldstein, and Pasciak for the reduced system. We demonstrate that the relative condition number of the preconditioner is bounded uniformly with respect to the penalty parameter, the number of levels and possible jumps of the coefficients as long as they occur only across the edges of the coarsest elements.
Implementation of Hybrid V-Cycle Multilevel Methods for Mixed Finite Element Systems with Penalty
NASA Technical Reports Server (NTRS)
Lai, Chen-Yao G.
1996-01-01
The goal of this paper is the implementation of hybrid V-cycle hierarchical multilevel methods for the indefinite discrete systems which arise when a mixed finite element approximation is used to solve elliptic boundary value problems. By introducing a penalty parameter, the perturbed indefinite system can be reduced to a symmetric positive definite system containing the small penalty parameter for the velocity unknown alone. We stabilize the hierarchical spatial decomposition approach proposed by Cai, Goldstein, and Pasciak for the reduced system. We demonstrate that the relative condition number of the preconditioner is bounded uniformly with respect to the penalty parameter, the number of levels and possible jumps of the coefficients as long as they occur only across the edges of the coarsest elements.
NASA Astrophysics Data System (ADS)
Majewski, Władysław A.; Tylec, Tomasz I.
2010-12-01
Erik M. Alfsen and Frederic W. Shultz had recently developed the characterisation of state spaces of operator algebras. It established full equivalence (in the mathematical sense) between the Heisenberg and the Schrödinger picture, i.e. given a physical system we are able to construct its state space out of its observables as well as to construct algebra of observables from its state space. As an underlying mathematical structure they used the theory of duality of ordered linear spaces and obtained results are valid for various types of operator algebras (namely C *, von Neumann, JB and JBW algebras). Here, we show that the language they developed also admits a representation of an effect algebra.
NASA Astrophysics Data System (ADS)
Adrian, S. B.; Andriulli, F. P.; Eibert, T. F.
2017-02-01
A new hierarchical basis preconditioner for the electric field integral equation (EFIE) operator is introduced. In contrast to existing hierarchical basis preconditioners, it works on arbitrary meshes and preconditions both the vector and the scalar potential within the EFIE operator. This is obtained by taking into account that the vector and the scalar potential discretized with loop-star basis functions are related to the hypersingular and the single layer operator (i.e., the well known integral operators from acoustics). For the single layer operator discretized with piecewise constant functions, a hierarchical preconditioner can easily be constructed. Thus the strategy we propose in this work for preconditioning the EFIE is the transformation of the scalar and the vector potential into operators equivalent to the single layer operator and to its inverse. More specifically, when the scalar potential is discretized with star functions as source and testing functions, the resulting matrix is a single layer operator discretized with piecewise constant functions and multiplied left and right with two additional graph Laplacian matrices. By inverting these graph Laplacian matrices, the discretized single layer operator is obtained, which can be preconditioned with the hierarchical basis. Dually, when the vector potential is discretized with loop functions, the resulting matrix can be interpreted as a hypersingular operator discretized with piecewise linear functions. By leveraging on a scalar Calderón identity, we can interpret this operator as spectrally equivalent to the inverse single layer operator. Then we use a linear-in-complexity, closed-form inverse of the dual hierarchical basis to precondition the hypersingular operator. The numerical results show the effectiveness of the proposed preconditioner and the practical impact of theoretical developments in real case scenarios.
Parallel multilevel adaptive methods
NASA Technical Reports Server (NTRS)
Dowell, B.; Govett, M.; Mccormick, S.; Quinlan, D.
1989-01-01
The progress of a project for the design and analysis of a multilevel adaptive algorithm (AFAC/HM/) targeted for the Navier Stokes Computer is discussed. The results of initial timing tests of AFAC, coupled with multigrid and an efficient load balancer, on a 16-node Intel iPSC/2 hypercube are included. The results of timing tests are presented.
Prediction in Multilevel Models
ERIC Educational Resources Information Center
Afshartous, David; de Leeuw, Jan
2005-01-01
Multilevel modeling is an increasingly popular technique for analyzing hierarchical data. This article addresses the problem of predicting a future observable y[subscript *j] in the jth group of a hierarchical data set. Three prediction rules are considered and several analytical results on the relative performance of these prediction rules are…
Lie algebra extensions of current algebras on S3
NASA Astrophysics Data System (ADS)
Kori, Tosiaki; Imai, Yuto
2015-06-01
An affine Kac-Moody algebra is a central extension of the Lie algebra of smooth mappings from S1 to the complexification of a Lie algebra. In this paper, we shall introduce a central extension of the Lie algebra of smooth mappings from S3 to the quaternization of a Lie algebra and investigate its root space decomposition. We think this extension of current algebra might give a mathematical tool for four-dimensional conformal field theory as Kac-Moody algebras give it for two-dimensional conformal field theory.
Algebraic Nonlinear Collective Motion
NASA Astrophysics Data System (ADS)
Troupe, J.; Rosensteel, G.
1998-11-01
Finite-dimensional Lie algebras of vector fields determine geometrical collective models in quantum and classical physics. Every set of vector fields on Euclidean space that generates the Lie algebra sl(3, R) and contains the angular momentum algebra so(3) is determined. The subset of divergence-free sl(3, R) vector fields is proven to be indexed by a real numberΛ. TheΛ=0 solution is the linear representation that corresponds to the Riemann ellipsoidal model. The nonlinear group action on Euclidean space transforms a certain family of deformed droplets among themselves. For positiveΛ, the droplets have a neck that becomes more pronounced asΛincreases; for negativeΛ, the droplets contain a spherical bubble of radius |Λ|1/3. The nonlinear vector field algebra is extended to the nonlinear general collective motion algebra gcm(3) which includes the inertia tensor. The quantum algebraic models of nonlinear nuclear collective motion are given by irreducible unitary representations of the nonlinear gcm(3) Lie algebra. These representations model fissioning isotopes (Λ>0) and bubble and two-fluid nuclei (Λ<0).
NASA Technical Reports Server (NTRS)
Lin, Shu; Rhee, Dojun
1996-01-01
This paper is concerned with construction of multilevel concatenated block modulation codes using a multi-level concatenation scheme for the frequency non-selective Rayleigh fading channel. In the construction of multilevel concatenated modulation code, block modulation codes are used as the inner codes. Various types of codes (block or convolutional, binary or nonbinary) are being considered as the outer codes. In particular, we focus on the special case for which Reed-Solomon (RS) codes are used as the outer codes. For this special case, a systematic algebraic technique for constructing q-level concatenated block modulation codes is proposed. Codes have been constructed for certain specific values of q and compared with the single-level concatenated block modulation codes using the same inner codes. A multilevel closest coset decoding scheme for these codes is proposed.
Fully anisotropic 3-D EM modelling on a Lebedev grid with a multigrid pre-conditioner
NASA Astrophysics Data System (ADS)
Jaysaval, Piyoosh; Shantsev, Daniil V.; de la Kethulle de Ryhove, Sébastien; Bratteland, Tarjei
2016-12-01
We present a numerical algorithm for 3-D electromagnetic (EM) simulations in conducting media with general electric anisotropy. The algorithm is based on the finite-difference discretization of frequency-domain Maxwell's equations on a Lebedev grid, in which all components of the electric field are collocated but half a spatial step staggered with respect to the magnetic field components, which also are collocated. This leads to a system of linear equations that is solved using a stabilized biconjugate gradient method with a multigrid preconditioner. We validate the accuracy of the numerical results for layered and 3-D tilted transverse isotropic (TTI) earth models representing typical scenarios used in the marine controlled-source EM method. It is then demonstrated that not taking into account the full anisotropy of the conductivity tensor can lead to misleading inversion results. For synthetic data corresponding to a 3-D model with a TTI anticlinal structure, a standard vertical transverse isotropic (VTI) inversion is not able to image a resistor, while for a 3-D model with a TTI synclinal structure it produces a false resistive anomaly. However, if the VTI forward solver used in the inversion is replaced by the proposed TTI solver with perfect knowledge of the strike and dip of the dipping structures, the resulting resistivity images become consistent with the true models.
Magnetic cleansing of weathered/tarry oiled feathers--the role of pre-conditioners.
Dao, Hien V; Ngeh, Lawrence N; Bigger, Stephen W; Orbell, John D; Healy, Margaret; Jessop, Rosalind; Dann, Peter
2006-12-01
Iron powder has previously been demonstrated to be effective in the removal, via magnetic harvesting, of a wide variety of oil contaminants from feathers and plumage. This study investigates the efficacy of magnetic cleansing for the removal from feathers of tarry contamination that has been allowed to weather. Clusters of feathers from Mallard duck (Anas platyrhnchos) and Little Penguin (Eudyptula minor) were completely immersed in a tarry contaminant and allowed to weather from one to fourteen days. The contaminant was removed using a magnetic cleansing protocol and the removal efficacy assessed gravimetrically. For one, seven and fourteen days of weathering, a final removal (after fourteen treatments) of more than 99% and 97% was achieved for duck feathers and penguin feathers, respectively. Repeating the experiments (for a seven-day weathering period) for both duck and penguin feathers, with the judicious application of a pre-conditioner (olive oil), further improved removal efficacy. A convenient method to screen for improved pre-conditioning agents is suggested.
NASA Astrophysics Data System (ADS)
Zukir, Muhammad; Srigutomo, Wahyu
2016-08-01
Magnetotelluric (MT) method is a passive geophysical exploration technique utilizing natural electromagnetic source to obtain variation of the electric field and magnetic field on the surface of the earth. The frequency range used in this modeling is 10-4 Hz to 102 Hz. The two-dimensional (2D) magnetotelluric modeling is aimed to determine the value of electromagnetic field in the earth, the apparent resistivity, and the impedance phase. The relation between the geometrical and physical parameters used are governed by the Maxwell's equations. These equations are used in the case of Transverse Electric polarization (TE) and Transverse Magnetic polarization (TM). To calculate the solutions of electric and magnetic fields in the entire domain, the modeling domain is discretized into smaller elements using the finite element method, whereas the assembled matrix of equation system is solved using the Biconjugate Gradient Stabilized (BiCGStab) technique combined with the Incomplete Lower - Upper (ILU) preconditioner. This scheme can minimize the iteration process (computational cost) and is more effective than the Biconjugate Gradient (BiCG) technique with LU preconditions and Conjugate Gradient Square (CGS).
Algebraic invariants for homotopy types
NASA Astrophysics Data System (ADS)
Blanc, David
1999-11-01
We define a sequence of purely algebraic invariants - namely, classes in the Quillen cohomology of the [Pi]-algebra [pi][low asterisk]X - for distinguishing between different homotopy types of spaces. Another sequence of such cohomology classes allows one to decide whether a given abstract [Pi]-algebra can be realized as the homotopy [Pi]-algebra of a space.
A Richer Understanding of Algebra
ERIC Educational Resources Information Center
Foy, Michelle
2008-01-01
Algebra is one of those hard-to-teach topics where pupils seem to struggle to see it as more than a set of rules to learn, but this author recently used the software "Grid Algebra" from ATM, which engaged her Year 7 pupils in exploring algebraic concepts for themselves. "Grid Algebra" allows pupils to experience number,…
Multilevel Interventions: Measurement and Measures
Charns, Martin P.; Alligood, Elaine C.; Benzer, Justin K.; Burgess, James F.; Mcintosh, Nathalie M.; Burness, Allison; Partin, Melissa R.; Clauser, Steven B.
2012-01-01
Background Multilevel intervention research holds the promise of more accurately representing real-life situations and, thus, with proper research design and measurement approaches, facilitating effective and efficient resolution of health-care system challenges. However, taking a multilevel approach to cancer care interventions creates both measurement challenges and opportunities. Methods One-thousand seventy two cancer care articles from 2005 to 2010 were reviewed to examine the state of measurement in the multilevel intervention cancer care literature. Ultimately, 234 multilevel articles, 40 involving cancer care interventions, were identified. Additionally, literature from health services, social psychology, and organizational behavior was reviewed to identify measures that might be useful in multilevel intervention research. Results The vast majority of measures used in multilevel cancer intervention studies were individual level measures. Group-, organization-, and community-level measures were rarely used. Discussion of the independence, validity, and reliability of measures was scant. Discussion Measurement issues may be especially complex when conducting multilevel intervention research. Measurement considerations that are associated with multilevel intervention research include those related to independence, reliability, validity, sample size, and power. Furthermore, multilevel intervention research requires identification of key constructs and measures by level and consideration of interactions within and across levels. Thus, multilevel intervention research benefits from thoughtful theory-driven planning and design, an interdisciplinary approach, and mixed methods measurement and analysis. PMID:22623598
Pseudo-Riemannian Novikov algebras
NASA Astrophysics Data System (ADS)
Chen, Zhiqi; Zhu, Fuhai
2008-08-01
Novikov algebras were introduced in connection with the Poisson brackets of hydrodynamic-type and Hamiltonian operators in formal variational calculus. Pseudo-Riemannian Novikov algebras denote Novikov algebras with non-degenerate invariant symmetric bilinear forms. In this paper, we find that there is a remarkable geometry on pseudo-Riemannian Novikov algebras, and give a special class of pseudo-Riemannian Novikov algebras.
On the multi-level solution algorithm for Markov chains
Horton, G.
1996-12-31
We discuss the recently introduced multi-level algorithm for the steady-state solution of Markov chains. The method is based on the aggregation principle, which is well established in the literature. Recursive application of the aggregation yields a multi-level method which has been shown experimentally to give results significantly faster than the methods currently in use. The algorithm can be reformulated as an algebraic multigrid scheme of Galerkin-full approximation type. The uniqueness of the scheme stems from its solution-dependent prolongation operator which permits significant computational savings in the evaluation of certain terms. This paper describes the modeling of computer systems to derive information on performance, measured typically as job throughput or component utilization, and availability, defined as the proportion of time a system is able to perform a certain function in the presence of component failures and possibly also repairs.
Algebraic integrability: a survey.
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.
Algebraic Semantics for Narrative
ERIC Educational Resources Information Center
Kahn, E.
1974-01-01
This paper uses discussion of Edmund Spenser's "The Faerie Queene" to present a theoretical framework for explaining the semantics of narrative discourse. The algebraic theory of finite automata is used. (CK)
Developing Algebraic Thinking.
ERIC Educational Resources Information Center
Alejandre, Suzanne
2002-01-01
Presents a teaching experience that resulted in students getting to a point of full understanding of the kinesthetic activity and the algebra behind it. Includes a lesson plan for a traffic jam activity. (KHR)
Jordan Algebraic Quantum Categories
NASA Astrophysics Data System (ADS)
Graydon, Matthew; Barnum, Howard; Ududec, Cozmin; Wilce, Alexander
2015-03-01
State cones in orthodox quantum theory over finite dimensional complex Hilbert spaces enjoy two particularly essential features: homogeneity and self-duality. Orthodox quantum theory is not, however, unique in that regard. Indeed, all finite dimensional formally real Jordan algebras -- arenas for generalized quantum theories with close algebraic kinship to the orthodox theory -- admit homogeneous self-dual positive cones. We construct categories wherein these theories are unified. The structure of composite systems is cast from universal tensor products of the universal C*-algebras enveloping ambient spaces for the constituent state cones. We develop, in particular, a notion of composition that preserves the local distinction of constituent systems in quaternionic quantum theory. More generally, we explicitly derive the structure of hybrid quantum composites with subsystems of arbitrary Jordan algebraic type.
ERIC Educational Resources Information Center
Leron, Uri; Dubinsky, Ed
1995-01-01
Describes a constructivist, interactive approach for teaching undergraduate mathematics, abstract algebra in particular, using computer constructions programmed in ISETL to induce students' mental constructions and collaborative learning to help students reflect on these constructions. (18 references) (MKR)
Accounting Equals Applied Algebra.
ERIC Educational Resources Information Center
Roberts, Sondra
1997-01-01
Argues that students should be given mathematics credits for completing accounting classes. Demonstrates that, although the terminology is different, the mathematical concepts are the same as those used in an introductory algebra class. (JOW)
NASA Astrophysics Data System (ADS)
Markarian, Nikita
2017-03-01
We introduce Weyl n-algebras and show how their factorization complex may be used to define invariants of manifolds. In the appendix, we heuristically explain why these invariants must be perturbative Chern-Simons invariants.
Advanced multilevel metallization technology
NASA Astrophysics Data System (ADS)
Ohba, Takayuki
1995-10-01
In order for ULSI manufacturing to minimize the COO (cost of ownership) aspect in the wiring process and realize fabricating over 256M bits DRAM, several wiring technologies have been proposed. The evidential criteria in choosing the most probable one are physical or material limitations (e.g. step-coverage and resistivity) and requirements from manufacturing (e.g. process complexity, reliability, throughput, and total cost). Therefore, a combination of metallurgy using chemical vapor deposition (CVD) with simplified multilevel interconnects has a high potential in overcoming those difficulties. In this paper, an integrated multilevel metallization (IMM) by considering the above criteria is discussed. Alternatives of improved W-CVD, TiN-CVD using diborane (B 2H 6) and methylhydrazine (MH) reduction, selective W-CVD, and Cu wiring are described from our recent studies.
Aprepro - Algebraic Preprocessor
2005-08-01
Aprepro is an algebraic preprocessor that reads a file containing both general text and algebraic, string, or conditional expressions. It interprets the expressions and outputs them to the output file along witht the general text. Aprepro contains several mathematical functions, string functions, and flow control constructs. In addition, functions are included that, with some additional files, implement a units conversion system and a material database lookup system.
Covariant deformed oscillator algebras
NASA Technical Reports Server (NTRS)
Quesne, Christiane
1995-01-01
The general form and associativity conditions of deformed oscillator algebras are reviewed. It is shown how the latter can be fulfilled in terms of a solution of the Yang-Baxter equation when this solution has three distinct eigenvalues and satisfies a Birman-Wenzl-Murakami condition. As an example, an SU(sub q)(n) x SU(sub q)(m)-covariant q-bosonic algebra is discussed in some detail.
Aprepro - Algebraic Preprocessor
2005-08-01
Aprepro is an algebraic preprocessor that reads a file containing both general text and algebraic, string, or conditional expressions. It interprets the expressions and outputs them to the output file along witht the general text. Aprepro contains several mathematical functions, string functions, and flow control constructs. In addition, functions are included that, with some additional files, implement a units conversion system and a material database lookup system.
NASA Astrophysics Data System (ADS)
Fialowski, A.; Schlichenmaier, M.
2007-11-01
In two earlier articles we constructed algebraic-geometric families of genus one (i.e. elliptic) Lie algebras of Krichever Novikov type. The considered algebras are vector fields, current and affine Lie algebras. These families deform the Witt algebra, the Virasoro algebra, the classical current, and the affine Kac Moody Lie algebras respectively. The constructed families are not equivalent (not even locally) to the trivial families, despite the fact that the classical algebras are formally rigid. This effect is due to the fact that the algebras are infinite dimensional. In this article the results are reviewed and developed further. The constructions are induced by the geometric process of degenerating the elliptic curves to singular cubics. The algebras are of relevance in the global operator approach to the Wess Zumino Witten Novikov models appearing in the quantization of Conformal Field Theory.
Recent developments in multilevel optimization
NASA Technical Reports Server (NTRS)
Vanderplaats, Garret N.; Kim, D.-S.
1989-01-01
Recent developments in multilevel optimization are briefly reviewed. The general nature of the multilevel design task, the use of approximations to develop and solve the analysis design task, the structure of the formal multidiscipline optimization problem, a simple cantilevered beam which demonstrates the concepts of multilevel design and the basic mathematical details of the optimization task and the system level are among the topics discussed.
Azmy, Y.Y.
1999-06-10
The author proposes preconditioning as a viable acceleration scheme for the inner iterations of transport calculations in slab geometry. In particular he develops Adjacent-Cell Preconditioners (AP) that have the same coupling stencil as cell-centered diffusion schemes. For lowest order methods, e.g., Diamond Difference, Step, and 0-order Nodal Integral Method (ONIM), cast in a Weighted Diamond Difference (WDD) form, he derives AP for thick (KAP) and thin (NAP) cells that for model problems are unconditionally stable and efficient. For the First-Order Nodal Integral Method (INIM) he derives a NAP that possesses similarly excellent spectral properties for model problems. The two most attractive features of the new technique are:(1) its cell-centered coupling stencil, which makes it more adequate for extension to multidimensional, higher order situations than the standard edge-centered or point-centered Diffusion Synthetic Acceleration (DSA) methods; and (2) its decreasing spectral radius with increasing cell thickness to the extent that immediate pointwise convergence, i.e., in one iteration, can be achieved for problems with sufficiently thick cells. He implemented these methods, augmented with appropriate boundary conditions and mixing formulas for material heterogeneities, in the test code APID that he uses to successfully verify the analytical spectral properties for homogeneous problems. Furthermore, he conducts numerical tests to demonstrate the robustness of the KAP and NAP in the presence of sharp mesh or material discontinuities. He shows that the AP for WDD is highly resilient to such discontinuities, but for INIM a few cases occur in which the scheme does not converge; however, when it converges, AP greatly reduces the number of iterations required to achieve convergence.
Griebel, M.
1994-12-31
In recent years, it has turned out that many modern iterative algorithms (multigrid schemes, multilevel preconditioners, domain decomposition methods etc.) for solving problems resulting from the discretization of PDEs can be interpreted as additive (Jacobi-like) or multiplicative (Gauss-Seidel-like) subspace correction methods. The key to their analysis is the study of certain metric properties of the underlying splitting of the discretization space V into a sum of subspaces V{sub j}, j = 1{hor_ellipsis}, J resp. of the variational problem on V into auxiliary problems on these subspaces. Here, the author proposes a modified approach to the abstract convergence theory of these additive and multiplicative Schwarz iterative methods, that makes the relation to traditional iteration methods more explicit. To this end he introduces the enlarged Hilbert space V = V{sub 0} x {hor_ellipsis} x V{sub j} which is nothing else but the usual construction of the Cartesian product of the Hilbert spaces V{sub j} and use it now in the discretization process. This results in an enlarged, semidefinite linear system to be solved instead of the usual definite system. Then, modern multilevel methods as well as domain decomposition methods simplify to just traditional (block-) iteration methods. Now, the convergence analysis can be carried out directly for these traditional iterations on the enlarged system, making convergence proofs of multilevel and domain decomposition methods more clear, or, at least, more classical. The terms that enter the convergence proofs are exactly the ones of the classical iterative methods. It remains to estimate them properly. The convergence proof itself follow basically line by line the old proofs of the respective traditional iterative methods. Additionally, new multilevel/domain decomposition methods are constructed straightforwardly by now applying just other old and well known traditional iterative methods to the enlarged system.
Algebraic mesh quality metrics
KNUPP,PATRICK
2000-04-24
Quality metrics for structured and unstructured mesh generation are placed within an algebraic framework to form a mathematical theory of mesh quality metrics. The theory, based on the Jacobian and related matrices, provides a means of constructing, classifying, and evaluating mesh quality metrics. The Jacobian matrix is factored into geometrically meaningful parts. A nodally-invariant Jacobian matrix can be defined for simplicial elements using a weight matrix derived from the Jacobian matrix of an ideal reference element. Scale and orientation-invariant algebraic mesh quality metrics are defined. the singular value decomposition is used to study relationships between metrics. Equivalence of the element condition number and mean ratio metrics is proved. Condition number is shown to measure the distance of an element to the set of degenerate elements. Algebraic measures for skew, length ratio, shape, volume, and orientation are defined abstractly, with specific examples given. Combined metrics for shape and volume, shape-volume-orientation are algebraically defined and examples of such metrics are given. Algebraic mesh quality metrics are extended to non-simplical elements. A series of numerical tests verify the theoretical properties of the metrics defined.
Fast multilevel radiative transfer
NASA Astrophysics Data System (ADS)
Paletou, Frédéric; Léger, Ludovick
2007-01-01
The vast majority of recent advances in the field of numerical radiative transfer relies on approximate operator methods better known in astrophysics as Accelerated Lambda-Iteration (ALI). A superior class of iterative schemes, in term of rates of convergence, such as Gauss-Seidel and Successive Overrelaxation methods were therefore quite naturally introduced in the field of radiative transfer by Trujillo Bueno & Fabiani Bendicho (1995); it was thoroughly described for the non-LTE two-level atom case. We describe hereafter in details how such methods can be generalized when dealing with non-LTE unpolarised radiation transfer with multilevel atomic models, in monodimensional geometry.
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…
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…
A Primer on Multilevel Modeling
ERIC Educational Resources Information Center
Hayes, Andrew F.
2006-01-01
Multilevel modeling (MLM) is growing in use throughout the social sciences. Although daunting from a mathematical perspective, MLM is relatively easy to employ once some basic concepts are understood. In this article, I present a primer on MLM, describing some of these principles and applying them to the analysis of a multilevel data set on…
Omitted Variables in Multilevel Models
ERIC Educational Resources Information Center
Kim, Jee-Seon; Frees, Edward W.
2006-01-01
Statistical methodology for handling omitted variables is presented in a multilevel modeling framework. In many nonexperimental studies, the analyst may not have access to all requisite variables, and this omission may lead to biased estimates of model parameters. By exploiting the hierarchical nature of multilevel data, a battery of statistical…
Multilevel Modeling of Social Segregation
ERIC Educational Resources Information Center
Leckie, George; Pillinger, Rebecca; Jones, Kelvyn; Goldstein, Harvey
2012-01-01
The traditional approach to measuring segregation is based upon descriptive, non-model-based indices. A recently proposed alternative is multilevel modeling. The authors further develop the argument for a multilevel modeling approach by first describing and expanding upon its notable advantages, which include an ability to model segregation at a…
Adaptive Algebraic Multigrid Methods
Brezina, M; Falgout, R; MacLachlan, S; Manteuffel, T; McCormick, S; Ruge, J
2004-04-09
Our ability to simulate physical processes numerically is constrained by our ability to solve the resulting linear systems, prompting substantial research into the development of multiscale iterative methods capable of solving these linear systems with an optimal amount of effort. Overcoming the limitations of geometric multigrid methods to simple geometries and differential equations, algebraic multigrid methods construct the multigrid hierarchy based only on the given matrix. While this allows for efficient black-box solution of the linear systems associated with discretizations of many elliptic differential equations, it also results in a lack of robustness due to assumptions made on the near-null spaces of these matrices. This paper introduces an extension to algebraic multigrid methods that removes the need to make such assumptions by utilizing an adaptive process. The principles which guide the adaptivity are highlighted, as well as their application to algebraic multigrid solution of certain symmetric positive-definite linear systems.
NASA Astrophysics Data System (ADS)
Durka, R.
2017-04-01
The S-expansion framework is analyzed in the context of a freedom in closing the multiplication tables for the abelian semigroups. Including the possibility of the zero element in the resonant decomposition, and associating the Lorentz generator with the semigroup identity element, leads to a wide class of the expanded Lie algebras introducing interesting modifications to the gauge gravity theories. Among the results, we find all the Maxwell algebras of type {{B}m} , {{C}m} , and the recently introduced {{D}m} . The additional new examples complete the resulting generalization of the bosonic enlargements for an arbitrary number of the Lorentz-like and translational-like generators. Some further prospects concerning enlarging the algebras are discussed, along with providing all the necessary constituents for constructing the gravity actions based on the obtained results.
Hatcher, N.; Restuccia, A.; Stephany, J.
2006-02-15
We present the complete set of N=1, D=4 quantum algebras associated to massive superparticles. We obtain the explicit solution of these algebras realized in terms of unconstrained operators acting on the Hilbert space of superfields. These solutions are expressed using the chiral, antichiral and tensorial projectors which define the three irreducible representations of the supersymmetry on the superfields. In each case the space-time variables are noncommuting and their commutators are proportional to the internal angular momentum of the representation. The quantum algebra associated to the chiral or the antichiral projector is the one obtained by the quantization of the Casalbuoni-Brink-Schwarz (superspin 0) massive superparticle. We present a new superparticle action for the (superspin 1/2) case and show that their wave functions are the ones associated to the irreducible tensor multiplet.
NASA Astrophysics Data System (ADS)
Roytenberg, Dmitry
2007-11-01
A Lie 2-algebra is a linear category equipped with a functorial bilinear operation satisfying skew-symmetry and Jacobi identity up to natural transformations which themselves obey coherence laws of their own. Functors and natural transformations between Lie 2-algebras can also be defined, yielding a 2-category. Passing to the normalized chain complex gives an equivalence of 2-categories between Lie 2-algebras and certain "up to homotopy" structures on the complex; for strictly skew-symmetric Lie 2-algebras these are L∞-algebras, by a result of Baez and Crans. Lie 2-algebras appear naturally as infinitesimal symmetries of solutions of the Maurer-Cartan equation in some differential graded Lie algebras and L∞-algebras. In particular, (quasi-) Poisson manifolds, (quasi-) Lie bialgebroids and Courant algebroids provide large classes of examples.
A Holistic Approach to Algebra.
ERIC Educational Resources Information Center
Barbeau, Edward J.
1991-01-01
Described are two examples involving recursive mathematical sequences designed to integrate a holistic approach to learning algebra. These examples promote pattern recognition with algebraic justification, full class participation, and mathematical values that can be transferred to other situations. (MDH)
Computer Program For Linear Algebra
NASA Technical Reports Server (NTRS)
Krogh, F. T.; Hanson, R. J.
1987-01-01
Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.
Computer Program For Linear Algebra
NASA Technical Reports Server (NTRS)
Krogh, F. T.; Hanson, R. J.
1987-01-01
Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.
Algebra for Gifted Third Graders.
ERIC Educational Resources Information Center
Borenson, Henry
1987-01-01
Elementary school children who are exposed to a concrete, hands-on experience in algebraic linear equations will more readily develop a positive mind-set and expectation for success in later formal, algebraic studies. (CB)
1985-03-13
AD-Ri55 296 ALGEBRA OF NEURON MATRICES(U) FOREIGN TECHNOLOGY DIV i/i WRIGHT-PATTERSON RF8 ON K~ G RGRBRBYRN 13 MAR 85 FTD-ID(RS)T-8@4i-85...ANCLASSIFIED F/G6/6 NL I. 1j.2 U .611111 ’’ K1*10 Vl( PIH OPY Pl (iLUTION TL T CHART I-" FTD-ID(RS )T-0041-85 FOREIGN TECHNOLOGY DIVISION In ALGEBRA OF NEURON ... NEURON MATRICES DTIC TAB Unannounced Q By: K.G. Agababyan JustLficatlon English pages: 10 By Distribution/ Source: Doklady Akademii Nauk SSSR, Vol. 199
An algebra of reversible computation.
Wang, Yong
2016-01-01
We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.
Thomys, Janus; Zhang, Xiaohong
2013-01-01
We describe weak-BCC-algebras (also called BZ-algebras) in which the condition (x∗y)∗z = (x∗z)∗y is satisfied only in the case when elements x, y belong to the same branch. We also characterize ideals, nilradicals, and nilpotent elements of such algebras. PMID:24311983
Visual Salience of Algebraic Transformations
ERIC Educational Resources Information Center
Kirshner, David; Awtry, Thomas
2004-01-01
Information processing researchers have assumed that algebra symbol skills depend on mastery of the abstract rules presented in the curriculum (Matz, 1980; Sleeman, 1986). Thus, students' ubiquitous algebra errors have been taken as indicating the need to embed algebra in rich contextual settings (Kaput, 1995; National Council of Teachers of…
ERIC Educational Resources Information Center
Zahner, William
2015-01-01
This paper uses a multilevel analysis of mathematical reasoning rooted in Cultural Historical Activity Theory to examine how mathematical discourse and student reasoning about linear functions developed across 3 weeks in a ninth grade bilingual algebra class. Despite the teacher's expertise teaching with a conceptual focus, and her stated…
ERIC Educational Resources Information Center
Zahner, William
2015-01-01
This paper uses a multilevel analysis of mathematical reasoning rooted in Cultural Historical Activity Theory to examine how mathematical discourse and student reasoning about linear functions developed across 3 weeks in a ninth grade bilingual algebra class. Despite the teacher's expertise teaching with a conceptual focus, and her stated…
ERIC Educational Resources Information Center
Chiu, Ming Ming
2008-01-01
The micro-time context of group processes (such as argumentation) can affect a group's micro-creativity (new ideas). Eighty high school students worked in groups of four on an algebra problem. Groups with higher mathematics grades showed greater micro-creativity, and both were linked to better problem solving outcomes. Dynamic multilevel analyses…
ERIC Educational Resources Information Center
Ketterlin-Geller, Leanne R.; Jungjohann, Kathleen; Chard, David J.; Baker, Scott
2007-01-01
Much of the difficulty that students encounter in the transition from arithmetic to algebra stems from their early learning and understanding of arithmetic. Too often, students learn about the whole number system and the operations that govern that system as a set of procedures to solve addition, subtraction, multiplication, and division problems.…
Algebraic Thinking through Origami.
ERIC Educational Resources Information Center
Higginson, William; Colgan, Lynda
2001-01-01
Describes the use of paper folding to create a rich environment for discussing algebraic concepts. Explores the effect that changing the dimensions of two-dimensional objects has on the volume of related three-dimensional objects. (Contains 13 references.) (YDS)
ERIC Educational Resources Information Center
Kennedy, John
This text provides information and exercises on arithmetic topics which should be mastered before a student enrolls in an Elementary Algebra course. Section I describes the fundamental properties and relationships of whole numbers, focusing on basic operations, divisibility tests, exponents, order of operations, prime numbers, greatest common…
Thinking Visually about Algebra
ERIC Educational Resources Information Center
Baroudi, Ziad
2015-01-01
Many introductions to algebra in high school begin with teaching students to generalise linear numerical patterns. This article argues that this approach needs to be changed so that students encounter variables in the context of modelling visual patterns so that the variables have a meaning. The article presents sample classroom activities,…
Algebraic Thinking through Origami.
ERIC Educational Resources Information Center
Higginson, William; Colgan, Lynda
2001-01-01
Describes the use of paper folding to create a rich environment for discussing algebraic concepts. Explores the effect that changing the dimensions of two-dimensional objects has on the volume of related three-dimensional objects. (Contains 13 references.) (YDS)
ERIC Educational Resources Information Center
Nwabueze, Kenneth K.
2004-01-01
The current emphasis on flexible modes of mathematics delivery involving new information and communication technology (ICT) at the university level is perhaps a reaction to the recent change in the objectives of education. Abstract algebra seems to be one area of mathematics virtually crying out for computer instructional support because of the…
ERIC Educational Resources Information Center
Nwabueze, Kenneth K.
2004-01-01
The current emphasis on flexible modes of mathematics delivery involving new information and communication technology (ICT) at the university level is perhaps a reaction to the recent change in the objectives of education. Abstract algebra seems to be one area of mathematics virtually crying out for computer instructional support because of the…
Computer Algebra versus Manipulation
ERIC Educational Resources Information Center
Zand, Hossein; Crowe, David
2004-01-01
In the UK there is increasing concern about the lack of skill in algebraic manipulation that is evident in students entering mathematics courses at university level. In this note we discuss how the computer can be used to ameliorate some of the problems. We take as an example the calculations needed in three dimensional vector analysis in polar…
Computer Algebra versus Manipulation
ERIC Educational Resources Information Center
Zand, Hossein; Crowe, David
2004-01-01
In the UK there is increasing concern about the lack of skill in algebraic manipulation that is evident in students entering mathematics courses at university level. In this note we discuss how the computer can be used to ameliorate some of the problems. We take as an example the calculations needed in three dimensional vector analysis in polar…
Planar Para Algebras, Reflection Positivity
NASA Astrophysics Data System (ADS)
Jaffe, Arthur; Liu, Zhengwei
2017-05-01
We define a planar para algebra, which arises naturally from combining planar algebras with the idea of ZN para symmetry in physics. A subfactor planar para algebra is a Hilbert space representation of planar tangles with parafermionic defects that are invariant under para isotopy. For each ZN, we construct a family of subfactor planar para algebras that play the role of Temperley-Lieb-Jones planar algebras. The first example in this family is the parafermion planar para algebra (PAPPA). Based on this example, we introduce parafermion Pauli matrices, quaternion relations, and braided relations for parafermion algebras, which one can use in the study of quantum information. An important ingredient in planar para algebra theory is the string Fourier transform (SFT), which we use on the matrix algebra generated by the Pauli matrices. Two different reflections play an important role in the theory of planar para algebras. One is the adjoint operator; the other is the modular conjugation in Tomita-Takesaki theory. We use the latter one to define the double algebra and to introduce reflection positivity. We give a new and geometric proof of reflection positivity by relating the two reflections through the string Fourier transform.
Prosocial behavior: multilevel perspectives.
Penner, Louis A; Dovidio, John F; Piliavin, Jane A; Schroeder, David A
2005-01-01
Current research on prosocial behavior covers a broad and diverse range of phenomena. We argue that this large research literature can be best organized and understood from a multilevel perspective. We identify three levels of analysis of prosocial behavior: (a) the "meso" level--the study of helper-recipient dyads in the context of a specific situation; (b) the micro level--the study of the origins of prosocial tendencies and the sources of variation in these tendencies; and (c) the macro level--the study of prosocial actions that occur within the context of groups and large organizations. We present research at each level and discuss similarities and differences across levels. Finally, we consider ways in which theory and research at these three levels of analysis might be combined in future intra- and interdisciplinary research on prosocial behavior.
Su, Gui-Jia
2003-06-10
A multilevel DC link inverter and method for improving torque response and current regulation in permanent magnet motors and switched reluctance motors having a low inductance includes a plurality of voltage controlled cells connected in series for applying a resulting dc voltage comprised of one or more incremental dc voltages. The cells are provided with switches for increasing the resulting applied dc voltage as speed and back EMF increase, while limiting the voltage that is applied to the commutation switches to perform PWM or dc voltage stepping functions, so as to limit current ripple in the stator windings below an acceptable level, typically 5%. Several embodiments are disclosed including inverters using IGBT's, inverters using thyristors. All of the inverters are operable in both motoring and regenerating modes.
Totally parallel multilevel algorithms
NASA Technical Reports Server (NTRS)
Frederickson, Paul O.
1988-01-01
Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.
Algebraic connectivity and graph robustness.
Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T.
2009-07-01
Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.
On Dunkl angular momenta algebra
NASA Astrophysics Data System (ADS)
Feigin, Misha; Hakobyan, Tigran
2015-11-01
We consider the quantum angular momentum generators, deformed by means of the Dunkl operators. Together with the reflection operators they generate a subalgebra in the rational Cherednik algebra associated with a finite real reflection group. We find all the defining relations of the algebra, which appear to be quadratic, and we show that the algebra is of Poincaré-Birkhoff-Witt (PBW) type. We show that this algebra contains the angular part of the Calogero-Moser Hamiltonian and that together with constants it generates the centre of the algebra. We also consider the gl( N ) version of the subalge-bra of the rational Cherednik algebra and show that it is a non-homogeneous quadratic algebra of PBW type as well. In this case the central generator can be identified with the usual Calogero-Moser Hamiltonian associated with the Coxeter group in the harmonic confinement.
On extensions of Leibniz algebras
NASA Astrophysics Data System (ADS)
Rakhimov, I. S.; Said Husain, Sh. K.; Mohammed, M. A.
2017-09-01
This paper is dedicated to the study extensions of Leibniz algebras using the annihilator approach. The extensions methods have been used earlier to classify certain classes of algebras. In the paper we first review and adjust theoretical background of the method for Leibniz algebras then apply it to classify four-dimensional Leibniz algebras over a field K. We obtain complete classification of four-dimensional nilpotent Leibniz algebras. The main idea of the method is to transfer the “base change” action to an action of automorphism group of the algebras of smaller dimension on cocycles constructed by the annihilator extensions. The method can be used to classify low-dimensional Leibniz algebras over other finite fields as well.
Marquette, Ian
2013-07-15
We introduce the most general quartic Poisson algebra generated by a second and a fourth order integral of motion of a 2D superintegrable classical system. We obtain the corresponding quartic (associative) algebra for the quantum analog, extend Daskaloyannis construction obtained in context of quadratic algebras, and also obtain the realizations as deformed oscillator algebras for this quartic algebra. We obtain the Casimir operator and discuss how these realizations allow to obtain the finite-dimensional unitary irreducible representations of quartic algebras and obtain algebraically the degenerate energy spectrum of superintegrable systems. We apply the construction and the formula obtained for the structure function on a superintegrable system related to type I Laguerre exceptional orthogonal polynomials introduced recently.
Multilevel Algorithms for Nonlinear Optimization
1994-06-01
NASA Contractor Report 194940 ICASE Report No. 94-53 AD-A284 318 * ICASE MULTILEVEL ALGORITHMSDDTIC FOR NONLINEAR OPTIMIZATION ELECTESEP 1 4 1994 F...Association SOperated b MULTILEVEL ALGORITHMS FOR NONLINEAR OPTIMIZATION Natalia Alexandrov Accesion For ICASE C Mail Stop 132C NTIS CRA&ID C TAB 1Q...ABSTRACT Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that
ERIC Educational Resources Information Center
Beigie, Darin
2014-01-01
Most people who are attracted to STEM-related fields are drawn not by a desire to take mathematics tests but to create things. The opportunity to create an algebra drawing gives students a sense of ownership and adventure that taps into the same sort of energy that leads a young person to get lost in reading a good book, building with Legos®,…
ERIC Educational Resources Information Center
Beigie, Darin
2014-01-01
Most people who are attracted to STEM-related fields are drawn not by a desire to take mathematics tests but to create things. The opportunity to create an algebra drawing gives students a sense of ownership and adventure that taps into the same sort of energy that leads a young person to get lost in reading a good book, building with Legos®,…
Lee, Jaehoon; Wilczek, Frank
2013-11-27
Motivated by the problem of identifying Majorana mode operators at junctions, we analyze a basic algebraic structure leading to a doubled spectrum. For general (nonlinear) interactions the emergent mode creation operator is highly nonlinear in the original effective mode operators, and therefore also in the underlying electron creation and destruction operators. This phenomenon could open up new possibilities for controlled dynamical manipulation of the modes. We briefly compare and contrast related issues in the Pfaffian quantum Hall state.
2013-05-06
AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumps and an anisotropy in one part.
Palmkvist, Jakob
2014-01-15
We introduce an infinite-dimensional Lie superalgebra which is an extension of the U-duality Lie algebra of maximal supergravity in D dimensions, for 3 ⩽ D ⩽ 7. The level decomposition with respect to the U-duality Lie algebra gives exactly the tensor hierarchy of representations that arises in gauge deformations of the theory described by an embedding tensor, for all positive levels p. We prove that these representations are always contained in those coming from the associated Borcherds-Kac-Moody superalgebra, and we explain why some of the latter representations are not included in the tensor hierarchy. The most remarkable feature of our Lie superalgebra is that it does not admit a triangular decomposition like a (Borcherds-)Kac-Moody (super)algebra. Instead the Hodge duality relations between level p and D − 2 − p extend to negative p, relating the representations at the first two negative levels to the supersymmetry and closure constraints of the embedding tensor.
NASA Technical Reports Server (NTRS)
Cleaveland, Rance; Luettgen, Gerald; Natarajan, V.
1999-01-01
This paper surveys the semantic ramifications of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. These enriched formalisms allow one to model system features such as interrupts, prioritized choice, or real-time behavior. Approaches to priority in process algebras can be classified according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global pre-emption and static priorities and led to formalisms for modeling interrupts and aspects of real-time, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of pre-emption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the efficient encoding of real-time semantics. Technically, this paper studies the different models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local pre- emption. In each case the operational semantics of CCS is modified appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for different process-algebraic settings are discussed.
NASA Technical Reports Server (NTRS)
Freund, Roland
1988-01-01
Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.
Clifford Algebras and Their Decomposition into Conjugate Fermionic Heisenberg Algebras
NASA Astrophysics Data System (ADS)
Catto, Sultan; Gürcan, Yasemin; Khalfan, Amish; Kurt, Levent; Kato La, V.
2016-10-01
We discuss a construction scheme for Clifford numbers of arbitrary dimension. The scheme is based upon performing direct products of the Pauli spin and identity matrices. Conjugate fermionic algebras can then be formed by considering linear combinations of the Clifford numbers and the Hermitian conjugates of such combinations. Fermionic algebras are important in investigating systems that follow Fermi-Dirac statistics. We will further comment on the applications of Clifford algebras to Fueter analyticity, twistors, color algebras, M-theory and Leech lattice as well as unification of ancient and modern geometries through them.
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…
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.
Quantum computation using geometric algebra
NASA Astrophysics Data System (ADS)
Matzke, Douglas James
This dissertation reports that arbitrary Boolean logic equations and operators can be represented in geometric algebra as linear equations composed entirely of orthonormal vectors using only addition and multiplication Geometric algebra is a topologically based algebraic system that naturally incorporates the inner and anticommutative outer products into a real valued geometric product, yet does not rely on complex numbers or matrices. A series of custom tools was designed and built to simplify geometric algebra expressions into a standard sum of products form, and automate the anticommutative geometric product and operations. Using this infrastructure, quantum bits (qubits), quantum registers and EPR-bits (ebits) are expressed symmetrically as geometric algebra expressions. Many known quantum computing gates, measurement operators, and especially the Bell/magic operators are also expressed as geometric products. These results demonstrate that geometric algebra can naturally and faithfully represent the central concepts, objects, and operators necessary for quantum computing, and can facilitate the design and construction of quantum computing tools.
Multilevel turbulence simulations
Tziperman, E.
1994-12-31
The authors propose a novel method for the simulation of turbulent flows, that is motivated by and based on the Multigrid (MG) formalism. The method, called Multilevel Turbulence Simulations (MTS), is potentially more efficient and more accurate than LES. In many physical problems one is interested in the effects of the small scales on the larger ones, or in a typical realization of the flow, and not in the detailed time history of each small scale feature. MTS takes advantage of the fact that the detailed simulation of small scales is not needed at all times, in order to make the calculation significantly more efficient, while accurately accounting for the effects of the small scales on the larger scale of interest. In MTS, models of several resolutions are used to represent the turbulent flow. The model equations in each coarse level incorporate a closure term roughly corresponding to the tau correction in the MG formalism that accounts for the effects of the unresolvable scales on that grid. The finer resolution grids are used only a small portion of the simulation time in order to evaluate the closure terms for the coarser grids, while the coarse resolution grids are then used to accurately and efficiently calculate the evolution of the larger scales. The methods efficiency relative to direct simulations is of the order of the ratio of required integration time to the smallest eddies turnover time, potentially resulting in orders of magnitude improvement for a large class of turbulence problems.
ERIC Educational Resources Information Center
Novotna, Jarmila; Hoch, Maureen
2008-01-01
Many students have difficulties with basic algebraic concepts at high school and at university. In this paper two levels of algebraic structure sense are defined: for high school algebra and for university algebra. We suggest that high school algebra structure sense components are sub-components of some university algebra structure sense…
Applications of algebraic grid generation
NASA Technical Reports Server (NTRS)
Eiseman, Peter R.; Smith, Robert E.
1990-01-01
Techniques and applications of algebraic grid generation are described. The techniques are univariate interpolations and transfinite assemblies of univariate interpolations. Because algebraic grid generation is computationally efficient, the use of interactive graphics in conjunction with the techniques is advocated. A flexible approach, which works extremely well in an interactive environment, called the control point form of algebraic grid generation is described. The applications discussed are three-dimensional grids constructed about airplane and submarine configurations.
Challenges of evaluating multilevel interventions.
Nastasi, Bonnie K; Hitchcock, John
2009-06-01
This article uses the Comprehensive Mixed-Methods Participatory Evaluation (CMMPE; Nastasi and Hitchcock Transforming school mental health services: Population-based approaches to promoting the competency and wellness of children, Thousand Oaks, CA: Corwin Press with National Association of School Psychologists 2008; Nastasi et al. School-based mental health services: creating comprehensive and culturally specific programs. Washington, DC: American Psychological Association 2004) model as a framework for addressing the multiplicity of evaluation decisions and complex nature of questions related to program success in multilevel interventions. CMMPE defines program success in terms of acceptability, integrity, social or cultural validity, outcomes (impact), sustainability and institutionalization, thus broadening the traditional notions of program outcomes. The authors use CMMPE and an example of a community-based multilevel sexual risk prevention program with multiple outcomes to discuss challenges of evaluating multilevel interventions. The sexual risk program exemplifies what Schensul and Trickett (this issue) characterize as multilevel intervention-multilevel evaluation (M-M), with both intervention and evaluation at community, health practitioner, and patient levels. The illustration provides the context for considering several challenges related to M-M designs: feasibility of randomized controlled trials within community-based multilevel intervention; acceptability and social or cultural validity of evaluation procedures; implementer, recipient, and contextual variations in program success; interactions among levels of the intervention; unanticipated changes or conditions; multiple indicators of program success; engaging multiple stakeholders in a participatory process; and evaluating sustainability and institutionalization. The complexity of multilevel intervention and evaluation designs challenges traditional notions of evaluation research and experimental
Higher level twisted Zhu algebras
NASA Astrophysics Data System (ADS)
van Ekeren, Jethro
2011-05-01
The study of twisted representations of graded vertex algebras is important for understanding orbifold models in conformal field theory. In this paper, we consider the general setup of a vertex algebra V, graded by Γ /{Z} for some subgroup Γ of {R} containing {Z}, and with a Hamiltonian operator H having real (but not necessarily integer) eigenvalues. We construct the directed system of twisted level p Zhu algebras operatorname{Zhu}_{p, Γ }(V), and we prove the following theorems: For each p, there is a bijection between the irreducible operatorname{Zhu}_{p, Γ }(V)-modules and the irreducible Γ-twisted positive energy V-modules, and V is (Γ, H)-rational if and only if all its Zhu algebras operatorname{Zhu}_{p, Γ }(V) are finite dimensional and semisimple. The main novelty is the removal of the assumption of integer eigenvalues for H. We provide an explicit description of the level p Zhu algebras of a universal enveloping vertex algebra, in particular of the Virasoro vertex algebra operatorname{Vir}^c and the universal affine Kac-Moody vertex algebra V^k({g}) at non-critical level. We also compute the inverse limits of these directed systems of algebras.
Epetra Linear Algebra Services Package
2011-09-09
Epetra provides the fundamental construction routines and service functions that are required for serial and paraliellinear algebra libraries using double precision scalar values and int ordinal values.
Abstract Algebra to Secondary School Algebra: Building Bridges
ERIC Educational Resources Information Center
Christy, Donna; Sparks, Rebecca
2015-01-01
The authors have experience with secondary mathematics teacher candidates struggling to make connections between the theoretical abstract algebra course they take as college students and the algebra they will be teaching in secondary schools. As a mathematician and a mathematics educator, the authors collaborated to create and implement a…
Algebra and Algebraic Thinking in School Math: 70th YB
ERIC Educational Resources Information Center
National Council of Teachers of Mathematics, 2008
2008-01-01
Algebra is no longer just for college-bound students. After a widespread push by the National Council of Teachers of Mathematics (NCTM) and teachers across the country, algebra is now a required part of most curricula. However, students' standardized test scores are not at the level they should be. NCTM's seventieth yearbook takes a look at the…
Abstract Algebra to Secondary School Algebra: Building Bridges
ERIC Educational Resources Information Center
Christy, Donna; Sparks, Rebecca
2015-01-01
The authors have experience with secondary mathematics teacher candidates struggling to make connections between the theoretical abstract algebra course they take as college students and the algebra they will be teaching in secondary schools. As a mathematician and a mathematics educator, the authors collaborated to create and implement a…
Algebra and Algebraic Thinking in School Math: 70th YB
ERIC Educational Resources Information Center
National Council of Teachers of Mathematics, 2008
2008-01-01
Algebra is no longer just for college-bound students. After a widespread push by the National Council of Teachers of Mathematics (NCTM) and teachers across the country, algebra is now a required part of most curricula. However, students' standardized test scores are not at the level they should be. NCTM's seventieth yearbook takes a look at the…
Statecharts Via Process Algebra
NASA Technical Reports Server (NTRS)
Luttgen, Gerald; vonderBeeck, Michael; Cleaveland, Rance
1999-01-01
Statecharts is a visual language for specifying the behavior of reactive systems. The Language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded system, precisely defining its semantics has proved extremely challenging. In this paper, a simple process algebra, called Statecharts Process Language (SPL), is presented, which is expressive enough for encoding Statecharts in a structure-preserving and semantic preserving manner. It is establish that the behavioral relation bisimulation, when applied to SPL, preserves Statecharts semantics
Multilevel phase gratings for array illuminators.
Arrizón, V; Ojeda-Castañeda, J
1994-09-01
We describe a variety of multilevel phase structures that can be used to generate Lohmann's array illuminators. We report several experimental verifications of the synthesis of such multilevel phase structures by using simple binary curves in a conventional optical processor.
Patterns to Develop Algebraic Reasoning
ERIC Educational Resources Information Center
Stump, Sheryl L.
2011-01-01
What is the role of patterns in developing algebraic reasoning? This important question deserves thoughtful attention. In response, this article examines some differing views of algebraic reasoning, discusses a controversy regarding patterns, and describes how three types of patterns--in contextual problems, in growing geometric figures, and in…
Viterbi/algebraic hybrid decoder
NASA Technical Reports Server (NTRS)
Boyd, R. W.; Ingels, F. M.; Mo, C.
1980-01-01
Decoder computer program is hybrid between optimal Viterbi and optimal algebraic decoders. Tests have shown that hybrid decoder outperforms any strictly Viterbi or strictly algebraic decoder and effectively handles compound channels. Algorithm developed uses syndrome-detecting logic to direct two decoders to assume decoding load alternately, depending on real-time channel characteristics.
Teaching Algebra Conceptually: Student Achievement
ERIC Educational Resources Information Center
Linsell, Chris; Tozer, Lynn; Anakin, Megan; Cox, Anna; Jones, Rachel; McAuslan, Eric; Smith, Donna; Turner, Garry
2012-01-01
This paper reports findings from the second year of a two-year study designed to develop approaches to teaching algebra in years 9 and 10. The aim of the research was to explore and develop teaching approaches to assist students to acquire a conceptual understanding of algebra, and to document the impact of these approaches on student outcomes.…
SICs and Algebraic Number Theory
NASA Astrophysics Data System (ADS)
Appleby, Marcus; Flammia, Steven; McConnell, Gary; Yard, Jon
2017-08-01
We give an overview of some remarkable connections between symmetric informationally complete measurements (SIC-POVMs, or SICs) and algebraic number theory, in particular, a connection with Hilbert's 12th problem. The paper is meant to be intelligible to a physicist who has no prior knowledge of either Galois theory or algebraic number theory.
Patterns to Develop Algebraic Reasoning
ERIC Educational Resources Information Center
Stump, Sheryl L.
2011-01-01
What is the role of patterns in developing algebraic reasoning? This important question deserves thoughtful attention. In response, this article examines some differing views of algebraic reasoning, discusses a controversy regarding patterns, and describes how three types of patterns--in contextual problems, in growing geometric figures, and in…
Learning Algebra from Worked Examples
ERIC Educational Resources Information Center
Lange, Karin E.; Booth, Julie L.; Newton, Kristie J.
2014-01-01
For students to be successful in algebra, they must have a truly conceptual understanding of key algebraic features as well as the procedural skills to complete a problem. One strategy to correct students' misconceptions combines the use of worked example problems in the classroom with student self-explanation. "Self-explanation" is the…
Linear Algebra and Image Processing
ERIC Educational Resources Information Center
Allali, Mohamed
2010-01-01
We use the computing technology digital image processing (DIP) to enhance the teaching of linear algebra so as to make the course more visual and interesting. Certainly, this visual approach by using technology to link linear algebra to DIP is interesting and unexpected to both students as well as many faculty. (Contains 2 tables and 11 figures.)
Linear algebra and image processing
NASA Astrophysics Data System (ADS)
Allali, Mohamed
2010-09-01
We use the computing technology digital image processing (DIP) to enhance the teaching of linear algebra so as to make the course more visual and interesting. Certainly, this visual approach by using technology to link linear algebra to DIP is interesting and unexpected to both students as well as many faculty.
Multiplier operator algebras and applications.
Blecher, David P; Zarikian, Vrej
2004-01-20
The one-sided multipliers of an operator space X are a key to "latent operator algebraic structure" in X. We begin with a survey of these multipliers, together with several of the applications that they have had to operator algebras. We then describe several new results on one-sided multipliers, and new applications, mostly to one-sided M-ideals.
ERIC Educational Resources Information Center
1997
Astro Algebra is one of six titles in the Mighty Math Series from Edmark, a comprehensive line of math software for students from kindergarten through ninth grade. Many of the activities in Astro Algebra contain a unique technology that uses the computer to help students make the connection between concrete and abstract mathematics. This software…
Elementary maps on nest algebras
NASA Astrophysics Data System (ADS)
Li, Pengtong
2006-08-01
Let , be algebras and let , be maps. An elementary map of is an ordered pair (M,M*) such that for all , . In this paper, the general form of surjective elementary maps on standard subalgebras of nest algebras is described. In particular, such maps are automatically additive.
ERIC Educational Resources Information Center
Buerman, Margaret
2007-01-01
Finding real-world examples for middle school algebra classes can be difficult but not impossible. As we strive to accomplish teaching our students how to solve and graph equations, we neglect to teach the big ideas of algebra. One of those big ideas is functions. This article gives three examples of functions that are found in Arches National…
Linear Algebra and Image Processing
ERIC Educational Resources Information Center
Allali, Mohamed
2010-01-01
We use the computing technology digital image processing (DIP) to enhance the teaching of linear algebra so as to make the course more visual and interesting. Certainly, this visual approach by using technology to link linear algebra to DIP is interesting and unexpected to both students as well as many faculty. (Contains 2 tables and 11 figures.)
Online Algebraic Tools for Teaching
ERIC Educational Resources Information Center
Kurz, Terri L.
2011-01-01
Many free online tools exist to complement algebraic instruction at the middle school level. This article presents findings that analyzed the features of algebraic tools to support learning. The findings can help teachers select appropriate tools to facilitate specific topics. (Contains 1 table and 4 figures.)
The Algebra of Complex Numbers.
ERIC Educational Resources Information Center
LePage, Wilbur R.
This programed text is an introduction to the algebra of complex numbers for engineering students, particularly because of its relevance to important problems of applications in electrical engineering. It is designed for a person who is well experienced with the algebra of real numbers and calculus, but who has no experience with complex number…
Thermodynamics. [algebraic structure
NASA Technical Reports Server (NTRS)
Zeleznik, F. J.
1976-01-01
The fundamental structure of thermodynamics is purely algebraic, in the sense of atopological, and it is also independent of partitions, composite systems, the zeroth law, and entropy. The algebraic structure requires the notion of heat, but not the first law. It contains a precise definition of entropy and identifies it as a purely mathematical concept. It also permits the construction of an entropy function from heat measurements alone when appropriate conditions are satisfied. Topology is required only for a discussion of the continuity of thermodynamic properties, and then the weak topology is the relevant topology. The integrability of the differential form of the first law can be examined independently of Caratheodory's theorem and his inaccessibility axiom. Criteria are established by which one can determine when an integrating factor can be made intensive and the pseudopotential extensive and also an entropy. Finally, a realization of the first law is constructed which is suitable for all systems whether they are solids or fluids, whether they do or do not exhibit chemical reactions, and whether electromagnetic fields are or are not present.
Kalashnikova, Irina
2012-05-01
A numerical study aimed to evaluate different preconditioners within the Trilinos Ifpack and ML packages for the Quantum Computer Aided Design (QCAD) non-linear Poisson problem implemented within the Albany code base and posed on the Ottawa Flat 270 design geometry is performed. This study led to some new development of Albany that allows the user to select an ML preconditioner with Zoltan repartitioning based on nodal coordinates, which is summarized. Convergence of the numerical solutions computed within the QCAD computational suite with successive mesh refinement is examined in two metrics, the mean value of the solution (an L{sup 1} norm) and the field integral of the solution (L{sup 2} norm).
Symplectic Clifford Algebraic Field Theory.
NASA Astrophysics Data System (ADS)
Dixon, Geoffrey Moore
We develop a mathematical framework on which is built a theory of fermion, scalar, and gauge vector fields. This field theory is shown to be equivalent to the original Weinberg-Salam model of weak and electromagnetic interactions, but since the new framework is more rigid than that on which the original Weinberg-Salam model was built, a concomitant reduction in the number of assumptions lying outside of the framework has resulted. In particular, parity violation is actually hiding within our framework, and with little difficulty we are able to manifest it. The mathematical framework upon which we build our field theory is arrived at along two separate paths. The first is by the marriage of a Clifford algebra and a Lie superalgebra, the result being called a super Clifford algebra. The second is by providing a new characterization for a Clifford algebra employing its generators and a symmetric array of metric coefficients. Subsequently we generalize this characterization to the case of an antisymmetric array of metric coefficients, and we call the algebra which results a symplectic Clifford algebra. It is upon one of these that we build our field theory, and it is shown that this symplectic Clifford algebra is a particular subalgebra of a super Clifford algebra. The final ingredient is the operation of bracketing which involves treating the elements of our algebra as endomorphisms of a particular inner product space, and employing this space and its inner product to provide us with maps from our algebra to the reals. It is this operation which enables us to manifest the parity violation hiding in our algebra.
A General Multilevel SEM Framework for Assessing Multilevel Mediation
ERIC Educational Resources Information Center
Preacher, Kristopher J.; Zyphur, Michael J.; Zhang, Zhen
2010-01-01
Several methods for testing mediation hypotheses with 2-level nested data have been proposed by researchers using a multilevel modeling (MLM) paradigm. However, these MLM approaches do not accommodate mediation pathways with Level-2 outcomes and may produce conflated estimates of between- and within-level components of indirect effects. Moreover,…
A General Multilevel SEM Framework for Assessing Multilevel Mediation
ERIC Educational Resources Information Center
Preacher, Kristopher J.; Zyphur, Michael J.; Zhang, Zhen
2010-01-01
Several methods for testing mediation hypotheses with 2-level nested data have been proposed by researchers using a multilevel modeling (MLM) paradigm. However, these MLM approaches do not accommodate mediation pathways with Level-2 outcomes and may produce conflated estimates of between- and within-level components of indirect effects. Moreover,…
2014-01-01
the appropriate convex hull , construction of a PBNO preconditioner for the 2-D DG model utilizes precisely the same objective NLLS algorithm as for...handle the complex spectrum of the DG model would introduce an element of arbitrariness in selecting the appropriate convex hull construction of a PBNO...Fig. 2.1(b), which has a hull that cannot be well-represented by a convex form. As we show in the next section, the process by which the PBNO
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)
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)
Multilevel Assessments of Science Standards
ERIC Educational Resources Information Center
Quellmalz, Edys S.; Timms, Michael J.; Silberglitt, Matt D.
2011-01-01
The Multilevel Assessment of Science Standards (MASS) project is creating a new generation of technology-enhanced formative assessments that bring the best formative assessment practices into classrooms to transform what, how, when, and where science learning is assessed. The project is investigating the feasibility, utility, technical quality,…
Multilevel Modeling with Correlated Effects
ERIC Educational Resources Information Center
Kim, Jee-Seon; Frees, Edward W.
2007-01-01
When there exist omitted effects, measurement error, and/or simultaneity in multilevel models, explanatory variables may be correlated with random components, and standard estimation methods do not provide consistent estimates of model parameters. This paper introduces estimators that are consistent under such conditions. By employing generalized…
Multilevel Modeling with Correlated Effects
ERIC Educational Resources Information Center
Kim, Jee-Seon; Frees, Edward W.
2007-01-01
When there exist omitted effects, measurement error, and/or simultaneity in multilevel models, explanatory variables may be correlated with random components, and standard estimation methods do not provide consistent estimates of model parameters. This paper introduces estimators that are consistent under such conditions. By employing generalized…
Multilevel algorithms for nonlinear optimization
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia; Dennis, J. E., Jr.
1994-01-01
Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that naturally occur in blocks. We propose a class of multilevel optimization methods motivated by the structure and number of constraints and by the expense of the derivative computations for MDO. The algorithms are an extension to the nonlinear programming problem of the successful class of local Brown-Brent algorithms for nonlinear equations. Our extensions allow the user to partition constraints into arbitrary blocks to fit the application, and they separately process each block and the objective function, restricted to certain subspaces. The methods use trust regions as a globalization strategy, and they have been shown to be globally convergent under reasonable assumptions. The multilevel algorithms can be applied to all classes of MDO formulations. Multilevel algorithms for solving nonlinear systems of equations are a special case of the multilevel optimization methods. In this case, they can be viewed as a trust-region globalization of the Brown-Brent class.
Generalized Multilevel Structural Equation Modeling
ERIC Educational Resources Information Center
Rabe-Hesketh, Sophia; Skrondal, Anders; Pickles, Andrew
2004-01-01
A unifying framework for generalized multilevel structural equation modeling is introduced. The models in the framework, called generalized linear latent and mixed models (GLLAMM), combine features of generalized linear mixed models (GLMM) and structural equation models (SEM) and consist of a response model and a structural model for the latent…
Macdonald index and chiral algebra
NASA Astrophysics Data System (ADS)
Song, Jaewon
2017-08-01
For any 4d N = 2 SCFT, there is a subsector described by a 2d chiral algebra. The vacuum character of the chiral algebra reproduces the Schur index of the corresponding 4d theory. The Macdonald index counts the same set of operators as the Schur index, but the former has one more fugacity than the latter. We conjecture a prescription to obtain the Macdonald index from the chiral algebra. The vacuum module admits a filtration, from which we construct an associated graded vector space. From this grading, we conjecture a notion of refined character for the vacuum module of a chiral algebra, which reproduces the Macdonald index. We test this prescription for the Argyres-Douglas theories of type ( A 1 , A 2 n ) and ( A 1 , D 2 n+1) where the chiral algebras are given by Virasoro and \\widehat{su}(2) affine Kac-Moody algebra. When the chiral algebra has more than one family of generators, our prescription requires a knowledge of the generators from the 4d.
Quantum algebra of N superspace
Hatcher, Nicolas; Restuccia, A.; Stephany, J.
2007-08-15
We identify the quantum algebra of position and momentum operators for a quantum system bearing an irreducible representation of the super Poincare algebra in the N>1 and D=4 superspace, both in the case where there are no central charges in the algebra, and when they are present. This algebra is noncommutative for the position operators. We use the properties of superprojectors acting on the superfields to construct explicit position and momentum operators satisfying the algebra. They act on the projected wave functions associated to the various supermultiplets with defined superspin present in the representation. We show that the quantum algebra associated to the massive superparticle appears in our construction and is described by a supermultiplet of superspin 0. This result generalizes the construction for D=4, N=1 reported recently. For the case N=2 with central charges, we present the equivalent results when the central charge and the mass are different. For the {kappa}-symmetric case when these quantities are equal, we discuss the reduction to the physical degrees of freedom of the corresponding superparticle and the construction of the associated quantum algebra.
Constraint algebra in bigravity
Soloviev, V. O.
2015-07-15
The number of degrees of freedom in bigravity theory is found for a potential of general form and also for the potential proposed by de Rham, Gabadadze, and Tolley (dRGT). This aim is pursued via constructing a Hamiltonian formalismand studying the Poisson algebra of constraints. A general potential leads to a theory featuring four first-class constraints generated by general covariance. The vanishing of the respective Hessian is a crucial property of the dRGT potential, and this leads to the appearance of two additional second-class constraints and, hence, to the exclusion of a superfluous degree of freedom—that is, the Boulware—Deser ghost. The use of a method that permits avoiding an explicit expression for the dRGT potential is a distinctive feature of the present study.
Chen, J.; Safro, I.
2011-01-01
Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407-423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.
NASA Astrophysics Data System (ADS)
Grassi, P. A.; Hurth, T.; Steinhauser, M.
2001-09-01
Combining the effect of an intermediate renormalization prescription (zero momentum subtraction) and the background field method (BFM), we show that the algebraic renormalization procedure needed for the computation of radiative corrections within non-invariant regularization schemes is drastically simplified. The present technique is suitable for gauge models and, here, is applied to the Standard Model. The use of the BFM allows a powerful organization of the counterterms and avoids complicated Slavnov-Taylor identities. Furthermore, the Becchi-Rouet-Stora-Tyutin (BRST) variation of background fields plays a special role in disentangling Ward-Takahashi identities (WTI) and Slavnov-Taylor identities (STI). Finally, the strategy to be applied to physical processes is exemplified for the process b→ sγ.
Particle-like structure of Lie algebras
NASA Astrophysics Data System (ADS)
Vinogradov, A. M.
2017-07-01
If a Lie algebra structure 𝔤 on a vector space is the sum of a family of mutually compatible Lie algebra structures 𝔤i's, we say that 𝔤 is simply assembled from the 𝔤i's. Repeating this procedure with a number of Lie algebras, themselves simply assembled from the 𝔤i's, one obtains a Lie algebra assembled in two steps from 𝔤i's, and so on. We describe the process of modular disassembling of a Lie algebra into a unimodular and a non-unimodular part. We then study two inverse questions: which Lie algebras can be assembled from a given family of Lie algebras, and from which Lie algebras can a given Lie algebra be assembled. We develop some basic assembling and disassembling techniques that constitute the elements of a new approach to the general theory of Lie algebras. The main result of our theory is that any finite-dimensional Lie algebra over an algebraically closed field of characteristic zero or over R can be assembled in a finite number of steps from two elementary constituents, which we call dyons and triadons. Up to an abelian summand, a dyon is a Lie algebra structure isomorphic to the non-abelian 2-dimensional Lie algebra, while a triadon is isomorphic to the 3-dimensional Heisenberg Lie algebra. As an example, we describe constructions of classical Lie algebras from triadons.
Investigating Teacher Noticing of Student Algebraic Thinking
ERIC Educational Resources Information Center
Walkoe, Janet Dawn Kim
2013-01-01
Learning algebra is critical for students in the U.S. today. Algebra concepts provide the foundation for much advanced mathematical content. In addition, algebra serves as a gatekeeper to opportunities such as admission to college. Yet many students in the U.S. struggle in algebra classes. Researchers claim that one reason for these difficulties…
Investigating Teacher Noticing of Student Algebraic Thinking
ERIC Educational Resources Information Center
Walkoe, Janet Dawn Kim
2013-01-01
Learning algebra is critical for students in the U.S. today. Algebra concepts provide the foundation for much advanced mathematical content. In addition, algebra serves as a gatekeeper to opportunities such as admission to college. Yet many students in the U.S. struggle in algebra classes. Researchers claim that one reason for these difficulties…
Generalized Lie algebras of type An
NASA Astrophysics Data System (ADS)
Lyubashenko, Volodymyr; Sudbery, Anthony
1998-06-01
It is shown that the quantized enveloping algebra of sl(n) contains a generalized Lie algebra, defined by means of axioms similar to Woronowicz's. This gives rise to Lie algebra-like generators and relations for the locally finite part of the quantized enveloping algebra, and suggests a canonical Poincaré-Birkhoff-Witt basis.
Readiness and Preparation for Beginning Algebra.
ERIC Educational Resources Information Center
Rotman, Jack W.
Drawing from experience at Lansing Community College (LCC), this paper discusses how to best prepare students for success in a beginning algebra course. First, an overview is presented of LCC's developmental math sequence, which includes Basic Arithmetic (MTH 008), Pre-Algebra (MTH 009), Beginning Algebra (MTH 012), and Intermediate Algebra (MTH…
Loop Virasoro Lie conformal algebra
Wu, Henan Chen, Qiufan; Yue, Xiaoqing
2014-01-15
The Lie conformal algebra of loop Virasoro algebra, denoted by CW, is introduced in this paper. Explicitly, CW is a Lie conformal algebra with C[∂]-basis (L{sub i} | i∈Z) and λ-brackets [L{sub i} {sub λ} L{sub j}] = (−∂−2λ)L{sub i+j}. Then conformal derivations of CW are determined. Finally, rank one conformal modules and Z-graded free intermediate series modules over CW are classified.
Central extensions of Lax operator algebras
NASA Astrophysics Data System (ADS)
Schlichenmaier, M.; Sheinman, O. K.
2008-08-01
Lax operator algebras were introduced by Krichever and Sheinman as a further development of Krichever's theory of Lax operators on algebraic curves. These are almost-graded Lie algebras of current type. In this paper local cocycles and associated almost-graded central extensions of Lax operator algebras are classified. It is shown that in the case when the corresponding finite-dimensional Lie algebra is simple the two-cohomology space is one-dimensional. An important role is played by the action of the Lie algebra of meromorphic vector fields on the Lax operator algebra via suitable covariant derivatives.
Asymptotic aspect of derivations in Banach algebras.
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.
Computing Matrix Representations of Filiform Lie Algebras
NASA Astrophysics Data System (ADS)
Ceballos, Manuel; Núñez, Juan; Tenorio, Ángel F.
In this paper, we compute minimal faithful unitriangular matrix representations of filiform Lie algebras. To do it, we use the nilpotent Lie algebra, g_n, formed of n ×n strictly upper-triangular matrices. More concretely, we search the lowest natural number n such that the Lie algebra g_n contains a given filiform Lie algebra, also computing a representative of this algebra. All the computations in this paper have been done using MAPLE 9.5.
NASA Technical Reports Server (NTRS)
Klumpp, A. R.; Lawson, C. L.
1988-01-01
Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.
Cartooning in Algebra and Calculus
ERIC Educational Resources Information Center
Moseley, L. Jeneva
2014-01-01
This article discusses how teachers can create cartoons for undergraduate math classes, such as college algebra and basic calculus. The practice of cartooning for teaching can be helpful for communication with students and for students' conceptual understanding.
Cartooning in Algebra and Calculus
ERIC Educational Resources Information Center
Moseley, L. Jeneva
2014-01-01
This article discusses how teachers can create cartoons for undergraduate math classes, such as college algebra and basic calculus. The practice of cartooning for teaching can be helpful for communication with students and for students' conceptual understanding.
Semiclassical states on Lie algebras
Tsobanjan, Artur
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 the methods previously used for constrained quantum systems. We explicitly determine the conditions under which this restriction can be consistently performed alongside the semiclassical truncation.
An "Arithmetic" Thinker Tackles Algebra
ERIC Educational Resources Information Center
Armstrong, Alayne C.
2006-01-01
Working from Carolyn Kieran's categorization of "arithmetic" and "algebraic" thinkers, the article describes one eighth-grade "arithmetic" thinker's progress as she attempts to solve one- and two-step equations.
Hopf algebras and topological recursion
NASA Astrophysics Data System (ADS)
Esteves, João N.
2015-11-01
We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293-309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347-452).
Quantum Process Algebra with Priorities
NASA Astrophysics Data System (ADS)
Ren, Xingtian; Wang, Yong; Dai, Guiping
2017-08-01
One of the most fascinating characteristics is the modularity of ACP (Algebra of Communicating Processes), that is, ACP can be extended easily. qACP also inherents the modularity characteristics of ACP. By introducing new operators or new constants, qACP can have more properties. In this paper, we extend the quantum process algebra qACP with priorities support in an elegant way. And we obtain the soundness and completeness of the extension.
Coherent States for Hopf Algebras
NASA Astrophysics Data System (ADS)
Škoda, Zoran
2007-07-01
Families of Perelomov coherent states are defined axiomatically in the context of unitary representations of Hopf algebras. A global geometric picture involving locally trivial noncommutative fibre bundles is involved in the construction. If, in addition, the Hopf algebra has a left Haar integral, then a formula for noncommutative resolution of identity in terms of the family of coherent states holds. Examples come from quantum groups.
Multiplier operator algebras and applications
Blecher, David P.; Zarikian, Vrej
2004-01-01
The one-sided multipliers of an operator space X are a key to “latent operator algebraic structure” in X. We begin with a survey of these multipliers, together with several of the applications that they have had to operator algebras. We then describe several new results on one-sided multipliers, and new applications, mostly to one-sided M-ideals. PMID:14711990
Algebraic Systems and Pushdown Automata
NASA Astrophysics Data System (ADS)
Petre, Ion; Salomaa, Arto
We concentrate in this chapter on the core aspects of algebraic series, pushdown automata, and their relation to formal languages. We choose to follow here a presentation of their theory based on the concept of properness. We introduce in Sect. 2 some auxiliary notions and results needed throughout the chapter, in particular the notions of discrete convergence in semirings and C-cycle free infinite matrices. In Sect. 3 we introduce the algebraic power series in terms of algebraic systems of equations. We focus on interconnections with context-free grammars and on normal forms. We then conclude the section with a presentation of the theorems of Shamir and Chomsky-Schützenberger. We discuss in Sect. 4 the algebraic and the regulated rational transductions, as well as some representation results related to them. Section 5 is dedicated to pushdown automata and focuses on the interconnections with classical (non-weighted) pushdown automata and on the interconnections with algebraic systems. We then conclude the chapter with a brief discussion of some of the other topics related to algebraic systems and pushdown automata.
Nonnumeric Computer Applications to Algebra, Trigonometry and Calculus.
ERIC Educational Resources Information Center
Stoutemyer, David R.
1983-01-01
Described are computer program packages requiring little or no knowledge of computer programing for college algebra, calculus, and abstract algebra. Widely available computer algebra systems are listed. (MNS)
Novikov algebras with associative bilinear forms
NASA Astrophysics Data System (ADS)
Zhu, Fuhai; Chen, Zhiqi
2007-11-01
Novikov algebras were introduced in connection with the Poisson brackets of hydrodynamic-type and Hamiltonian operators in formal variational calculus. The goal of this paper is to study Novikov algebras with non-degenerate associative symmetric bilinear forms, which we call quadratic Novikov algebras. Based on the classification of solvable quadratic Lie algebras of dimension not greater than 4 and Novikov algebras in dimension 3, we show that quadratic Novikov algebras up to dimension 4 are commutative. Furthermore, we obtain the classification of transitive quadratic Novikov algebras in dimension 4. But we find that not every quadratic Novikov algebra is commutative and give a non-commutative quadratic Novikov algebra in dimension 6.
Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*
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
Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*
Bank, R.; Falgout, R. D.; Jones, T.; Manteuffel, T. A.; McCormick, S. F.; Ruge, J. W.
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 in 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.
Quantum Q systems: from cluster algebras to quantum current algebras
NASA Astrophysics Data System (ADS)
Di Francesco, Philippe; Kedem, Rinat
2017-02-01
This paper gives a new algebraic interpretation for the algebra generated by the quantum cluster variables of the A_r quantum Q-system (Di Francesco and Kedem in Int Math Res Not IMRN 10:2593-2642, 2014). We show that the algebra can be described as a quotient of the localization of the quantum algebra U_{√{q}}({n}[u,u^{-1}])subset U_{√{q}}(widehat{{sl}}_2), in the Drinfeld presentation. The generating current is made up of a subset of the cluster variables which satisfy the Q-system, which we call fundamental. The other cluster variables are given by a quantum determinant-type formula, and are polynomials in the fundamental generators. The conserved quantities of the discrete evolution (Di Francesco and Kedem in Adv Math 228(1):97-152, 2011) described by quantum Q-system generate the Cartan currents at level 0, in a non-standard polarization. The rest of the quantum affine algebra is also described in terms of cluster variables.
(Fuzzy) Ideals of BN-Algebras.
Dymek, Grzegorz; Walendziak, Andrzej
2015-01-01
The notions of an ideal and a fuzzy ideal in BN-algebras are introduced. The properties and characterizations of them are investigated. The concepts of normal ideals and normal congruences of a BN-algebra are also studied, the properties of them are displayed, and a one-to-one correspondence between them is presented. Conditions for a fuzzy set to be a fuzzy ideal are given. The relationships between ideals and fuzzy ideals of a BN-algebra are established. The homomorphic properties of fuzzy ideals of a BN-algebra are provided. Finally, characterizations of Noetherian BN-algebras and Artinian BN-algebras via fuzzy ideals are obtained.
A multilevel stochastic collocation method for SPDEs
Gunzburger, Max; Jantsch, Peter; Teckentrup, Aretha; Webster, Clayton
2015-03-10
We present a multilevel stochastic collocation method that, as do multilevel Monte Carlo methods, uses a hierarchy of spatial approximations to reduce the overall computational complexity when solving partial differential equations with random inputs. For approximation in parameter space, a hierarchy of multi-dimensional interpolants of increasing fidelity are used. Rigorous convergence and computational cost estimates for the new multilevel stochastic collocation method are derived and used to demonstrate its advantages compared to standard single-level stochastic collocation approximations as well as multilevel Monte Carlo methods.
Detwiler, R.L.; Mehl, S.; Rajaram, H.; Cheung, W.W.
2002-01-01
Numerical solution of large-scale ground water flow and transport problems is often constrained by the convergence behavior of the iterative solvers used to solve the resulting systems of equations. We demonstrate the ability of an algebraic multigrid algorithm (AMG) to efficiently solve the large, sparse systems of equations that result from computational models of ground water flow and transport in large and complex domains. Unlike geometric multigrid methods, this algorithm is applicable to problems in complex flow geometries, such as those encountered in pore-scale modeling of two-phase flow and transport. We integrated AMG into MODFLOW 2000 to compare two- and three-dimensional flow simulations using AMG to simulations using PCG2, a preconditioned conjugate gradient solver that uses the modified incomplete Cholesky preconditioner and is included with MODFLOW 2000. CPU times required for convergence with AMG were up to 140 times faster than those for PCG2. The cost of this increased speed was up to a nine-fold increase in required random access memory (RAM) for the three-dimensional problems and up to a four-fold increase in required RAM for the two-dimensional problems. We also compared two-dimensional numerical simulations of steady-state transport using AMG and the generalized minimum residual method with an incomplete LU-decomposition preconditioner. For these transport simulations, AMG yielded increased speeds of up to 17 times with only a 20% increase in required RAM. The ability of AMG to solve flow and transport problems in large, complex flow systems and its ready availability make it an ideal solver for use in both field-scale and pore-scale modeling.
NASA Astrophysics Data System (ADS)
Dobbelaere, D.; De Zutter, D.; Van Hese, J.; Sercu, J.; Boonen, T.; Rogier, H.
2015-12-01
In the context of hybrid formulations, the Poincaré-Steklov operator acting on traces of solutions to the vector Helmholtz equation in a heterogeneous interior domain with a smooth boundary is regularized by a well-known boundary integral operator related to the homogeneous exterior domain. For the first time, this property allows us to simultaneously construct a Calderón multiplicative preconditioner for the discretized operator and for a 3-D hybrid finite/boundary element method formulation, applicable to electromagnetic scattering problems. Numerical examples demonstrate the effectiveness of this novel preconditioning scheme, even for heterogeneous domains with non-smooth boundaries.
Moving frames and prolongation algebras
NASA Technical Reports Server (NTRS)
Estabrook, F. B.
1982-01-01
Differential ideals generated by sets of 2-forms which can be written with constant coefficients in a canonical basis of 1-forms are considered. By setting up a Cartan-Ehresmann connection, in a fiber bundle over a base space in which the 2-forms live, one finds an incomplete Lie algebra of vector fields in the fields in the fibers. Conversely, given this algebra (a prolongation algebra), one can derive the differential ideal. The two constructs are thus dual, and analysis of either derives properties of both. Such systems arise in the classical differential geometry of moving frames. Examples of this are discussed, together with examples arising more recently: the Korteweg-de Vries and Harrison-Ernst systems.
Algebraic Lattices in QFT Renormalization
NASA Astrophysics Data System (ADS)
Borinsky, Michael
2016-07-01
The structure of overlapping subdivergences, which appear in the perturbative expansions of quantum field theory, is analyzed using algebraic lattice theory. It is shown that for specific QFTs the sets of subdivergences of Feynman diagrams form algebraic lattices. This class of QFTs includes the standard model. In kinematic renormalization schemes, in which tadpole diagrams vanish, these lattices are semimodular. This implies that the Hopf algebra of Feynman diagrams is graded by the coradical degree or equivalently that every maximal forest has the same length in the scope of BPHZ renormalization. As an application of this framework, a formula for the counter terms in zero-dimensional QFT is given together with some examples of the enumeration of primitive or skeleton diagrams.
A Metric Conceptual Space Algebra
NASA Astrophysics Data System (ADS)
Adams, Benjamin; Raubal, Martin
The modeling of concepts from a cognitive perspective is important for designing spatial information systems that interoperate with human users. Concept representations that are built using geometric and topological conceptual space structures are well suited for semantic similarity and concept combination operations. In addition, concepts that are more closely grounded in the physical world, such as many spatial concepts, have a natural fit with the geometric structure of conceptual spaces. Despite these apparent advantages, conceptual spaces are underutilized because existing formalizations of conceptual space theory have focused on individual aspects of the theory rather than the creation of a comprehensive algebra. In this paper we present a metric conceptual space algebra that is designed to facilitate the creation of conceptual space knowledge bases and inferencing systems. Conceptual regions are represented as convex polytopes and context is built in as a fundamental element. We demonstrate the applicability of the algebra to spatial information systems with a proof-of-concept application.
Using Number Theory to Reinforce Elementary Algebra.
ERIC Educational Resources Information Center
Covillion, Jane D.
1995-01-01
Demonstrates that using the elementary number theory in algebra classes helps students to use acquired algebraic skills as well as helping them to more clearly understand concepts that are presented. Discusses factoring, divisibility rules, and number patterns. (AIM)
Colored Quantum Algebra and Its Bethe State
NASA Astrophysics Data System (ADS)
Wang, Jin-Zheng; Jia, Xiao-Yu; Wang, Shi-Kun
2014-12-01
We investigate the colored Yang—Baxter equation. Based on a trigonometric solution of colored Yang—Baxter equation, we construct a colored quantum algebra. Moreover we discuss its algebraic Bethe ansatz state and highest wight representation.
Comments on /N=4 superconformal algebras
NASA Astrophysics Data System (ADS)
Rasmussen, Jørgen
2001-01-01
We present a new and asymmetric N=4 superconformal algebra for arbitrary central charge, thus completing our recent work on its classical analogue with vanishing central charge. Besides the Virasoro generator and 4 supercurrents, the algebra consists of an internal SU(2)⊗U(1) Kac-Moody algebra in addition to two spin 1/2 fermions and a bosonic scalar. The algebra is shown to be invariant under a linear twist of the generators, except for a unique value of the continuous twist parameter. At this value, the invariance is broken and the algebra collapses to the small N=4 superconformal algebra. The asymmetric N=4 superconformal algebra may be seen as induced by an affine SL(2|2) current superalgebra. Replacing SL(2|2) with the coset SL(2|2)/U(1), results directly in the small N=4 superconformal algebra.
Tensor models and 3-ary algebras
NASA Astrophysics Data System (ADS)
Sasakura, Naoki
2011-10-01
Tensor models are the generalization of matrix models, and are studied as models of quantum gravity in general dimensions. In this paper, I discuss the algebraic structure in the fuzzy space interpretation of the tensor models which have a tensor with three indices as its only dynamical variable. The algebraic structure is studied mainly from the perspective of 3-ary algebras. It is shown that the tensor models have algebraic expressions, and that their symmetries are represented by 3-ary algebras. It is also shown that the 3-ary algebras of coordinates, which appear in the nonassociative fuzzy flat spacetimes corresponding to a certain class of configurations with Gaussian functions in the tensor models, form Lie triple systems, and the associated Lie algebras are shown to agree with those of the Snyder's noncommutative spacetimes. The Poincare transformations of the coordinates on the fuzzy flat spacetimes are shown to be generated by 3-ary algebras.
Algebraic Nonoverlapping Domain Decomposition Methods for Stabilized FEM and FV Discretizations
NASA Technical Reports Server (NTRS)
Barth, Timothy J.; Bailey, David (Technical Monitor)
1998-01-01
We consider preconditioning methods for convection dominated fluid flow problems based on a nonoverlapping Schur complement domain decomposition procedure for arbitrary triangulated domains. The triangulation is first partitioned into a number of subdomains and interfaces which induce a natural 2 x 2 partitioning of the p.d.e. discretization matrix. We view the Schur complement induced by this partitioning as an algebraically derived coarse space approximation. This avoids the known difficulties associated with the direct formation of an effective coarse discretization for advection dominated equations. By considering various approximations of the block factorization of the 2 x 2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 using MPI message passing protocol. A number of 2-D CFD calculations will be presented for both scalar advection-diffusion equations and the Euler equations discretized using stabilized finite element and finite volume methods. These results show very good scalability of the preconditioner for various discretizations as the number of processors is increased while the number of degrees of freedom per processor is fixed.
NASA Astrophysics Data System (ADS)
Chen, Hui; Deng, Ju-Zhi; Yin, Min; Yin, Chang-Chun; Tang, Wen-Wu
2017-03-01
To speed up three-dimensional (3D) DC resistivity modeling, we present a new multigrid method, the aggregation-based algebraic multigrid method (AGMG). We first discretize the differential equation of the secondary potential field with mixed boundary conditions by using a seven-point finite-difference method to obtain a large sparse system of linear equations. Then, we introduce the theory behind the pairwise aggregation algorithms for AGMG and use the conjugate-gradient method with the V-cycle AGMG preconditioner (AGMG-CG) to solve the linear equations. We use typical geoelectrical models to test the proposed AGMG-CG method and compare the results with analytical solutions and the 3DDCXH algorithm for 3D DC modeling (3DDCXH). In addition, we apply the AGMG-CG method to different grid sizes and geoelectrical models and compare it to different iterative methods, such as ILU-BICGSTAB, ILU-GCR, and SSOR-CG. The AGMG-CG method yields nearly linearly decreasing errors, whereas the number of iterations increases slowly with increasing grid size. The AGMG-CG method is precise and converges fast, and thus can improve the computational efficiency in forward modeling of three-dimensional DC resistivity.
Structural optimization by multilevel decomposition
NASA Technical Reports Server (NTRS)
Sobieszczanski-Sobieski, J.; James, B.; Dovi, A.
1983-01-01
A method is described for decomposing an optimization problem into a set of subproblems and a coordination problem which preserves coupling between the subproblems. The method is introduced as a special case of multilevel, multidisciplinary system optimization and its algorithm is fully described for two level optimization for structures assembled of finite elements of arbitrary type. Numerical results are given for an example of a framework to show that the decomposition method converges and yields results comparable to those obtained without decomposition. It is pointed out that optimization by decomposition should reduce the design time by allowing groups of engineers, using different computers to work concurrently on the same large problem.
Algebraic orbifold conformal field theories
Xu, Feng
2000-01-01
The unitary rational orbifold conformal field theories in the algebraic quantum field theory and subfactor theory framework are formulated. Under general conditions, it is shown that the orbifold of a given unitary rational conformal field theory generates a unitary modular category. Many new unitary modular categories are obtained. It is also shown that the irreducible representations of orbifolds of rank one lattice vertex operator algebras give rise to unitary modular categories and determine the corresponding modular matrices, which has been conjectured for some time. PMID:11106383
Entropic Forms and Related Algebras
NASA Astrophysics Data System (ADS)
Scarfone, Antonio
2013-02-01
Starting from a very general trace-form entropy, we introduce a pair of algebraic structures endowed by a generalized sum and a generalized product. These algebras form, respectively, two Abelian fields in the realm of the complex numbers isomorphic each other. We specify our results to several entropic forms related to distributions recurrently observed in social, economical, biological and physical systems including the stretched exponential, the power-law and the interpolating Bosons-Fermions distributions. Some potential applications in the study of complex systems are advanced.
Spatial-Operator Algebra For Robotic Manipulators
NASA Technical Reports Server (NTRS)
Rodriguez, Guillermo; Kreutz, Kenneth K.; Milman, Mark H.
1991-01-01
Report discusses spatial-operator algebra developed in recent studies of mathematical modeling, control, and design of trajectories of robotic manipulators. Provides succinct representation of mathematically complicated interactions among multiple joints and links of manipulator, thereby relieving analyst of most of tedium of detailed algebraic manipulations. Presents analytical formulation of spatial-operator algebra, describes some specific applications, summarizes current research, and discusses implementation of spatial-operator algebra in the Ada programming language.
Symmetry algebras of linear differential equations
NASA Astrophysics Data System (ADS)
Shapovalov, A. V.; Shirokov, I. V.
1992-07-01
The local symmetries of linear differential equations are investigated by means of proven theorems on the structure of the algebra of local symmetries of translationally and dilatationally invariant differential equations. For a nonparabolic second-order equation, the absence of nontrivial nonlinear local symmetries is proved. This means that the local symmetries reduce to the Lie algebra of linear differential symmetry operators. For the Laplace—Beltrami equation, all local symmetries reduce to the enveloping algebra of the algebra of the conformal group.
Discrimination in a General Algebraic Setting
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
Post-Lie algebras and factorization theorems
NASA Astrophysics Data System (ADS)
Ebrahimi-Fard, Kurusch; Mencattini, Igor; Munthe-Kaas, Hans
2017-09-01
In this note we further explore the properties of universal enveloping algebras associated to a post-Lie algebra. Emphasizing the role of the Magnus expansion, we analyze the properties of group like-elements belonging to (suitable completions of) those Hopf algebras. Of particular interest is the case of post-Lie algebras defined in terms of solutions of modified classical Yang-Baxter equations. In this setting we will study factorization properties of the aforementioned group-like elements.
Twining characters and orbit Lie algebras
Fuchs, Jurgen; Ray, Urmie; Schellekens, Bert; Schweigert, Christoph
1996-12-05
We associate to outer automorphisms of generalized Kac-Moody algebras generalized character-valued indices, the twining characters. A character formula for twining characters is derived which shows that they coincide with the ordinary characters of some other generalized Kac-Moody algebra, the so-called orbit Lie algebra. Some applications to problems in conformal field theory, algebraic geometry and the theory of sporadic simple groups are sketched.
Discrimination in a General Algebraic Setting.
Fine, Benjamin; Gaglione, Anthony; 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.
Applications of Algebraic Logic and Universal Algebra to Computer Science
1989-06-21
conference, with roughly equal representation from Mathematics and Computer Science . The conference consisted of eight invited lectures (60 minutes...each) and 26 contributed talks (20-40 minutes each). There was also a round-table discussion on the role of algebra and logic in computer science . Keywords
A Multilevel Assessment of Differential Item Functioning.
ERIC Educational Resources Information Center
Shen, Linjun
A multilevel approach was proposed for the assessment of differential item functioning and compared with the traditional logistic regression approach. Data from the Comprehensive Osteopathic Medical Licensing Examination for 2,300 freshman osteopathic medical students were analyzed. The multilevel approach used three-level hierarchical generalized…
Scalable Adaptive Multilevel Solvers for Multiphysics Problems
Xu, Jinchao
2014-11-26
In this project, we carried out many studies on adaptive and parallel multilevel methods for numerical modeling for various applications, including Magnetohydrodynamics (MHD) and complex fluids. We have made significant efforts and advances in adaptive multilevel methods of the multiphysics problems: multigrid methods, adaptive finite element methods, and applications.
A Balancing Act: Making Sense of Algebra
ERIC Educational Resources Information Center
Gavin, M. Katherine; Sheffield, Linda Jensen
2015-01-01
For most students, algebra seems like a totally different subject than the number topics they studied in elementary school. In reality, the procedures followed in arithmetic are actually based on the properties and laws of algebra. Algebra should be a logical next step for students in extending the proficiencies they developed with number topics…
Difficulties in Initial Algebra Learning in Indonesia
ERIC Educational Resources Information Center
Jupri, Al; Drijvers, Paul; van den Heuvel-Panhuizen, Marja
2014-01-01
Within mathematics curricula, algebra has been widely recognized as one of the most difficult topics, which leads to learning difficulties worldwide. In Indonesia, algebra performance is an important issue. In the Trends in International Mathematics and Science Study (TIMSS) 2007, Indonesian students' achievement in the algebra domain was…
Teaching Strategies to Improve Algebra Learning
ERIC Educational Resources Information Center
Zbiek, Rose Mary; Larson, Matthew R.
2015-01-01
Improving student learning is the primary goal of every teacher of algebra. Teachers seek strategies to help all students learn important algebra content and develop mathematical practices. The new Institute of Education Sciences[IES] practice guide, "Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students"…
Build an Early Foundation for Algebra Success
ERIC Educational Resources Information Center
Knuth, Eric; Stephens, Ana; Blanton, Maria; Gardiner, Angela
2016-01-01
Research tells us that success in algebra is a factor in many other important student outcomes. Emerging research also suggests that students who are started on an algebra curriculum in the earlier grades may have greater success in the subject in secondary school. What's needed is a consistent, algebra-infused mathematics curriculum all…
Teacher Actions to Facilitate Early Algebraic Reasoning
ERIC Educational Resources Information Center
Hunter, Jodie
2015-01-01
In recent years there has been an increased emphasis on integrating the teaching of arithmetic and algebra in primary school classrooms. This requires teachers to develop links between arithmetic and algebra and use pedagogical actions that facilitate algebraic reasoning. Drawing on findings from a classroom-based study, this paper provides an…
Unifying the Algebra for All Movement
ERIC Educational Resources Information Center
Eddy, Colleen M.; Quebec Fuentes, Sarah; Ward, Elizabeth K.; Parker, Yolanda A.; Cooper, Sandi; Jasper, William A.; Mallam, Winifred A.; Sorto, M. Alejandra; Wilkerson, Trena L.
2015-01-01
There exists an increased focus on school mathematics, especially first-year algebra, due to recent efforts for all students to be college and career ready. In addition, there are calls, policies, and legislation advocating for all students to study algebra epitomized by four rationales of the "Algebra for All" movement. In light of this…
Unifying the Algebra for All Movement
ERIC Educational Resources Information Center
Eddy, Colleen M.; Quebec Fuentes, Sarah; Ward, Elizabeth K.; Parker, Yolanda A.; Cooper, Sandi; Jasper, William A.; Mallam, Winifred A.; Sorto, M. Alejandra; Wilkerson, Trena L.
2015-01-01
There exists an increased focus on school mathematics, especially first-year algebra, due to recent efforts for all students to be college and career ready. In addition, there are calls, policies, and legislation advocating for all students to study algebra epitomized by four rationales of the "Algebra for All" movement. In light of this…
UCSMP Algebra. What Works Clearinghouse Intervention Report
ERIC Educational Resources Information Center
What Works Clearinghouse, 2007
2007-01-01
"University of Chicago School Mathematics Project (UCSMP) Algebra," designed to increase students' skills in algebra, is appropriate for students in grades 7-10, depending on the students' incoming knowledge. This one-year course highlights applications, uses statistics and geometry to develop the algebra of linear equations and inequalities, and…
Cyclic homology for Hom-associative algebras
NASA Astrophysics Data System (ADS)
Hassanzadeh, Mohammad; Shapiro, Ilya; Sütlü, Serkan
2015-12-01
In the present paper we investigate the noncommutative geometry of a class of algebras, called the Hom-associative algebras, whose associativity is twisted by a homomorphism. We define the Hochschild, cyclic, and periodic cyclic homology and cohomology for this class of algebras generalizing these theories from the associative to the Hom-associative setting.
Algebra? A Gate! A Barrier! A Mystery!
ERIC Educational Resources Information Center
Mathematics Educatio Dialogues, 2000
2000-01-01
This issue of Mathematics Education Dialogues focuses on the nature and the role of algebra in the K-14 curriculum. Articles on this theme include: (1) "Algebra For All? Why?" (Nel Noddings); (2) "Algebra For All: It's a Matter of Equity, Expectations, and Effectiveness" (Dorothy S. Strong and Nell B. Cobb); (3) "Don't Delay: Build and Talk about…
Embedding Algebraic Thinking throughout the Mathematics Curriculum
ERIC Educational Resources Information Center
Vennebush, G. Patrick; Marquez, Elizabeth; Larsen, Joseph
2005-01-01
This article explores the algebra that can be uncovered in many middle-grades mathematics tasks that, on first inspection, do not appear to be algebraic. It shows connections to the other four Standards that occur in traditional algebra problems, and it offers strategies for modifying activities so that they can be used to foster algebraic…
Constraint-Referenced Analytics of Algebra Learning
ERIC Educational Resources Information Center
Sutherland, Scot M.; White, Tobin F.
2016-01-01
The development of the constraint-referenced analytics tool for monitoring algebra learning activities presented here came from the desire to firstly, take a more quantitative look at student responses in collaborative algebra activities, and secondly, to situate those activities in a more traditional introductory algebra setting focusing on…
Difficulties in Initial Algebra Learning in Indonesia
ERIC Educational Resources Information Center
Jupri, Al; Drijvers, Paul; van den Heuvel-Panhuizen, Marja
2014-01-01
Within mathematics curricula, algebra has been widely recognized as one of the most difficult topics, which leads to learning difficulties worldwide. In Indonesia, algebra performance is an important issue. In the Trends in International Mathematics and Science Study (TIMSS) 2007, Indonesian students' achievement in the algebra domain was…
Teaching Strategies to Improve Algebra Learning
ERIC Educational Resources Information Center
Zbiek, Rose Mary; Larson, Matthew R.
2015-01-01
Improving student learning is the primary goal of every teacher of algebra. Teachers seek strategies to help all students learn important algebra content and develop mathematical practices. The new Institute of Education Sciences[IES] practice guide, "Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students"…
Build an Early Foundation for Algebra Success
ERIC Educational Resources Information Center
Knuth, Eric; Stephens, Ana; Blanton, Maria; Gardiner, Angela
2016-01-01
Research tells us that success in algebra is a factor in many other important student outcomes. Emerging research also suggests that students who are started on an algebra curriculum in the earlier grades may have greater success in the subject in secondary school. What's needed is a consistent, algebra-infused mathematics curriculum all…
A Balancing Act: Making Sense of Algebra
ERIC Educational Resources Information Center
Gavin, M. Katherine; Sheffield, Linda Jensen
2015-01-01
For most students, algebra seems like a totally different subject than the number topics they studied in elementary school. In reality, the procedures followed in arithmetic are actually based on the properties and laws of algebra. Algebra should be a logical next step for students in extending the proficiencies they developed with number topics…
Algebra? A Gate! A Barrier! A Mystery!
ERIC Educational Resources Information Center
Mathematics Educatio Dialogues, 2000
2000-01-01
This issue of Mathematics Education Dialogues focuses on the nature and the role of algebra in the K-14 curriculum. Articles on this theme include: (1) "Algebra For All? Why?" (Nel Noddings); (2) "Algebra For All: It's a Matter of Equity, Expectations, and Effectiveness" (Dorothy S. Strong and Nell B. Cobb); (3) "Don't Delay: Build and Talk about…
Quadratic Dynamical Systems and Algebras
NASA Astrophysics Data System (ADS)
Kinyon, M. K.; Sagle, A. A.
1995-03-01
Quadratic dynamical systems come from differential or discrete systems of the form Ẋ = Q(X) or X(k+1)=Q(X(k)), where Q:Rn→Rn is homogeneous of degree 2; i.e., Q(αX) = α2Q(X) for all α∈R, X∈Rn. Defining a bilinear mapping β:Rn × Rn→Rn by β(X, Y) ≔ {1}/{2}[Q(X+Y)-Q(X)-Q(Y)], we view XY≡β(X, Y) as a multiplication, and thus consider A=(Rn, β) to be a commutative, nonassociative algebra. The quadratic systems are then studied with the general theme that the structure of the algebras helps determine the behavior of the solutions. For example, semisimple algebras give a decoupling of the original system into systems occurring in simple algebras, and solvable algebras give solutions to differential systems via linear differential equations; the general three-dimensional example of the latter phenomenon is described. There are many classical examples and the scope of quadratic systems is large; every polynomial system can be embedded into a higher dimensional quadratic system such that solutions of the original system are obtained from the quadratic system. For differential systems, nilpotents of index 2 (N2=0) are equilibria and idempotents (E2=E) give ray solutions. The origin is never asymptotically stable, and the existence of nonzero idempotents implies that the origin is actually unstable. Nonzero equilibria are not hyperbolic, but can be studied by standard algebra techniques using nondegenerate bilinear forms as Lyapunov functions. Periodic orbits lie on "cones." They cannot occur in dimension 2 or in power-associative algebras. No periodic orbit can be an attractor but "limit cycles" (invariant cones) can exist. Automorphisms of the algebra A leave equilibria, periodic orbits, and domains of attraction invariant. Also, explicit solutions can be given by the action of automorphisms on an initial point; the general three-dimensional example of this is described. Thus if there are sufficient automorphisms, Hilbert‧s sixteenth problem in R3 has
A multilevel nonvolatile magnetoelectric memory
NASA Astrophysics Data System (ADS)
Shen, Jianxin; Cong, Junzhuang; Shang, Dashan; Chai, Yisheng; Shen, Shipeng; Zhai, Kun; Sun, Young
2016-09-01
The coexistence and coupling between magnetization and electric polarization in multiferroic materials provide extra degrees of freedom for creating next-generation memory devices. A variety of concepts of multiferroic or magnetoelectric memories have been proposed and explored in the past decade. Here we propose a new principle to realize a multilevel nonvolatile memory based on the multiple states of the magnetoelectric coefficient (α) of multiferroics. Because the states of α depends on the relative orientation between magnetization and polarization, one can reach different levels of α by controlling the ratio of up and down ferroelectric domains with external electric fields. Our experiments in a device made of the PMN-PT/Terfenol-D multiferroic heterostructure confirm that the states of α can be well controlled between positive and negative by applying selective electric fields. Consequently, two-level, four-level, and eight-level nonvolatile memory devices are demonstrated at room temperature. This kind of multilevel magnetoelectric memory retains all the advantages of ferroelectric random access memory but overcomes the drawback of destructive reading of polarization. In contrast, the reading of α is nondestructive and highly efficient in a parallel way, with an independent reading coil shared by all the memory cells.
A multilevel nonvolatile magnetoelectric memory
Shen, Jianxin; Cong, Junzhuang; Shang, Dashan; Chai, Yisheng; Shen, Shipeng; Zhai, Kun; Sun, Young
2016-01-01
The coexistence and coupling between magnetization and electric polarization in multiferroic materials provide extra degrees of freedom for creating next-generation memory devices. A variety of concepts of multiferroic or magnetoelectric memories have been proposed and explored in the past decade. Here we propose a new principle to realize a multilevel nonvolatile memory based on the multiple states of the magnetoelectric coefficient (α) of multiferroics. Because the states of α depends on the relative orientation between magnetization and polarization, one can reach different levels of α by controlling the ratio of up and down ferroelectric domains with external electric fields. Our experiments in a device made of the PMN-PT/Terfenol-D multiferroic heterostructure confirm that the states of α can be well controlled between positive and negative by applying selective electric fields. Consequently, two-level, four-level, and eight-level nonvolatile memory devices are demonstrated at room temperature. This kind of multilevel magnetoelectric memory retains all the advantages of ferroelectric random access memory but overcomes the drawback of destructive reading of polarization. In contrast, the reading of α is nondestructive and highly efficient in a parallel way, with an independent reading coil shared by all the memory cells. PMID:27681812
Multilevel joint competing risk models
NASA Astrophysics Data System (ADS)
Karunarathna, G. H. S.; Sooriyarachchi, M. R.
2017-09-01
Joint modeling approaches are often encountered for different outcomes of competing risk time to event and count in many biomedical and epidemiology studies in the presence of cluster effect. Hospital length of stay (LOS) has been the widely used outcome measure in hospital utilization due to the benchmark measurement for measuring multiple terminations such as discharge, transferred, dead and patients who have not completed the event of interest at the follow up period (censored) during hospitalizations. Competing risk models provide a method of addressing such multiple destinations since classical time to event models yield biased results when there are multiple events. In this study, the concept of joint modeling has been applied to the dengue epidemiology in Sri Lanka, 2006-2008 to assess the relationship between different outcomes of LOS and platelet count of dengue patients with the district cluster effect. Two key approaches have been applied to build up the joint scenario. In the first approach, modeling each competing risk separately using the binary logistic model, treating all other events as censored under the multilevel discrete time to event model, while the platelet counts are assumed to follow a lognormal regression model. The second approach is based on the endogeneity effect in the multilevel competing risks and count model. Model parameters were estimated using maximum likelihood based on the Laplace approximation. Moreover, the study reveals that joint modeling approach yield more precise results compared to fitting two separate univariate models, in terms of AIC (Akaike Information Criterion).
Adventures in Flipping College Algebra
ERIC Educational Resources Information Center
Van Sickle, Jenna
2015-01-01
This paper outlines the experience of a university professor who implemented flipped learning in two sections of college algebra courses for two semesters. It details how the courses were flipped, what technology was used, advantages, challenges, and results. It explains what students do outside of class, what they do inside class, and discusses…
Elementary Algebra Connections to Precalculus
ERIC Educational Resources Information Center
Lopez-Boada, Roberto; Daire, Sandra Arguelles
2013-01-01
This article examines the attitudes of some precalculus students to solve trigonometric and logarithmic equations and systems using the concepts of elementary algebra. With the goal of enticing the students to search for and use connections among mathematical topics, they are asked to solve equations or systems specifically designed to allow…
Elementary Algebra Connections to Precalculus
ERIC Educational Resources Information Center
Lopez-Boada, Roberto; Daire, Sandra Arguelles
2013-01-01
This article examines the attitudes of some precalculus students to solve trigonometric and logarithmic equations and systems using the concepts of elementary algebra. With the goal of enticing the students to search for and use connections among mathematical topics, they are asked to solve equations or systems specifically designed to allow…
Dimension independence in exterior algebra.
Hawrylycz, M
1995-03-14
The identities between homogeneous expressions in rank 1 vectors and rank n - 1 covectors in a Grassmann-Cayley algebra of rank n, in which one set occurs multilinearly, are shown to represent a set of dimension-independent identities. The theorem yields an infinite set of nontrivial geometric identities from a given identity.
Inequalities, Assessment and Computer Algebra
ERIC Educational Resources Information Center
Sangwin, Christopher J.
2015-01-01
The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in contemporary…
Experts Question California's Algebra Edict
ERIC Educational Resources Information Center
Cavanagh, Sean
2008-01-01
Business leaders from important sectors of the American economy have been urging schools to set higher standards in math and science--and California officials, in mandating that 8th graders be tested in introductory algebra, have responded with one of the highest such standards in the land. Still, many California educators and school…
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.
Weaving Geometry and Algebra Together
ERIC Educational Resources Information Center
Cetner, Michelle
2015-01-01
When thinking about student reasoning and sense making, teachers must consider the nature of tasks given to students along with how to plan to use the tasks in the classroom. Students should be presented with tasks in a way that encourages them to draw connections between algebraic and geometric concepts. This article focuses on the idea that it…
Algebraic Activities Aid Discovery Lessons
ERIC Educational Resources Information Center
Wallace-Gomez, Patricia
2013-01-01
After a unit on the rules for positive and negative numbers and the order of operations for evaluating algebraic expressions, many students believe that they understand these principles well enough, but they really do not. They clearly need more practice, but not more of the same kind of drill. Wallace-Gomez provides three graphing activities that…
Kleene Algebra and Bytecode Verification
2016-04-27
Languages, ACM SIGPLAN/SIGACT, 1998, pp. 149–160. [2] Coglio, A., Simple verification technique for complex Java bytecode subroutines, Concurrency and...of Programming Languages (POPL’73), ACM , 1973, pp. 194–206. [6] Kot, L. and D. Kozen, Second-order abstract interpretation via Kleene algebra
Algebra for All. Research Brief
ERIC Educational Resources Information Center
Bleyaert, Barbara
2009-01-01
The call for "algebra for all" is not a recent phenomenon. Concerns about the inadequacy of math (and science) preparation in America's high schools have been a steady drumbeat since the 1957 launch of Sputnik; a call for raising standards and the number of math (and science) courses required for graduation has been a part of countless…
Algebra from Chips and Chopsticks
ERIC Educational Resources Information Center
Yun, Jeong Oak; Flores, Alfinio
2012-01-01
Students can use geometric representations of numbers as a way to explore algebraic ideas. With the help of these representations, students can think about the relations among the numbers, express them using their own words, and represent them with letters. The activities discussed here can stimulate students to try to find various ways of solving…
Implementing Change in College Algebra
ERIC Educational Resources Information Center
Haver, William E.
2007-01-01
In this paper, departments are urged to consider implementing the type of changes proposed in Beyond Crossroads in College Algebra. The author of this paper is chair of the Curriculum Renewal Across the First Two Years (CRAFTY) Committee of the Mathematical Association of America. The committee has members from two-year colleges, four-year…
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.
Inequalities, Assessment and Computer Algebra
ERIC Educational Resources Information Center
Sangwin, Christopher J.
2015-01-01
The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in contemporary…
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.
Algebra, Home Mortgages, and Recessions
ERIC Educational Resources Information Center
Mariner, Jean A. Miller; Miller, Richard A.
2009-01-01
The current financial crisis and recession in the United States present an opportunity to discuss relevant applications of some topics in typical first-and second-year algebra and precalculus courses. Real-world applications of percent change, exponential functions, and sums of finite geometric sequences can help students understand the problems…
Easing Students' Transition to Algebra
ERIC Educational Resources Information Center
Baroudi, Ziad
2006-01-01
Traditionally, students learn arithmetic throughout their primary schooling, and this is seen as the ideal preparation for the learning of algebra in the junior secondary school. The four operations are taught and rehearsed in the early years and from this, it is assumed, "children will induce the fundamental structure of arithmetic" (Warren &…
Algebra, Home Mortgages, and Recessions
ERIC Educational Resources Information Center
Mariner, Jean A. Miller; Miller, Richard A.
2009-01-01
The current financial crisis and recession in the United States present an opportunity to discuss relevant applications of some topics in typical first-and second-year algebra and precalculus courses. Real-world applications of percent change, exponential functions, and sums of finite geometric sequences can help students understand the problems…
Generalized electromagnetism and Dirac algebra
Fryberger, D.
1989-02-01
Using a framework of Dirac algebra, the Clifford algebra appropriate for Minkowski space-time, the formulation of classical electromagnetism including both electric and magnetic charge is explored. Employing the two-potential approach of Cabibbo and Ferrari, a Lagrangian is obtained that is dyality invariant and from which it is possible to derive by Hamilton's principle both the symmetrized Maxwell's equations and the equations of motion for both electrically and magnetically charged particles. This latter result is achieved by defining the variation of the action associated with the cross terms of the interaction Lagrangian in terms of a surface integral. The surface integral has an equivalent path-integral form, showing that the contribution of the cross terms is local in nature. The form of these cross terms derives in a natural way from a Dirac algebraic formulation, and, in fact, the use of the geometric product of Dirac algebra is an essential aspect of this derivation. No kinematic restrictions are associated with the derivation, and no relationship between magnetic and electric charge evolves from the (classical) formulations. However, it is indicated that in bound states quantum mechanical considerations will lead to a version of Dirac's quantization condition. A discussion of parity violation of the generalized electromagnetic theory is given, and a new approach to the incorporation of this violation into the formalism is suggested. Possibilities for extensions are mentioned.
Exploring Algebraic Misconceptions with Technology
ERIC Educational Resources Information Center
Sakow, Matthew; Karaman, Ruveyda
2015-01-01
Many students struggle with algebra, from simplifying expressions to solving systems of equations. Students also have misconceptions about the meaning of variables. In response to the question "Can x + y + z ever equal x + p + z?" during a student interview, the student claimed, "Never . . . because p has to have a different value…
Carry Groups: Abstract Algebra Projects
ERIC Educational Resources Information Center
Miller, Cheryl Chute; Madore, Blair F.
2004-01-01
Carry Groups are a wonderful collection of groups to introduce in an undergraduate Abstract Algebra course. These groups are straightforward to define but have interesting structures for students to discover. We describe these groups and give examples of in-class group projects that were developed and used by Miller.
Exploring Algebraic Misconceptions with Technology
ERIC Educational Resources Information Center
Sakow, Matthew; Karaman, Ruveyda
2015-01-01
Many students struggle with algebra, from simplifying expressions to solving systems of equations. Students also have misconceptions about the meaning of variables. In response to the question "Can x + y + z ever equal x + p + z?" during a student interview, the student claimed, "Never . . . because p has to have a different value…
Adventures in Flipping College Algebra
ERIC Educational Resources Information Center
Van Sickle, Jenna
2015-01-01
This paper outlines the experience of a university professor who implemented flipped learning in two sections of college algebra courses for two semesters. It details how the courses were flipped, what technology was used, advantages, challenges, and results. It explains what students do outside of class, what they do inside class, and discusses…
Dimension independence in exterior algebra.
Hawrylycz, M
1995-01-01
The identities between homogeneous expressions in rank 1 vectors and rank n - 1 covectors in a Grassmann-Cayley algebra of rank n, in which one set occurs multilinearly, are shown to represent a set of dimension-independent identities. The theorem yields an infinite set of nontrivial geometric identities from a given identity. PMID:11607520
Carry Groups: Abstract Algebra Projects
ERIC Educational Resources Information Center
Miller, Cheryl Chute; Madore, Blair F.
2004-01-01
Carry Groups are a wonderful collection of groups to introduce in an undergraduate Abstract Algebra course. These groups are straightforward to define but have interesting structures for students to discover. We describe these groups and give examples of in-class group projects that were developed and used by Miller.
Monitoring Student Learning in Algebra
ERIC Educational Resources Information Center
Accardo, Amy L.; Kuder, S. Jay
2017-01-01
Mr. Perez and Mrs. Peterson co-teach a ninth-grade algebra class. Perez and Peterson's class includes four students with individualized education programs (IEPs). In response to legislation, such as the No Child Left Behind (NCLB) Act (2001) and the Individuals with Disabilities Education Improvement Act (2006), an increasing number of students…
Algebraic Activities Aid Discovery Lessons
ERIC Educational Resources Information Center
Wallace-Gomez, Patricia
2013-01-01
After a unit on the rules for positive and negative numbers and the order of operations for evaluating algebraic expressions, many students believe that they understand these principles well enough, but they really do not. They clearly need more practice, but not more of the same kind of drill. Wallace-Gomez provides three graphing activities that…
Weaving Geometry and Algebra Together
ERIC Educational Resources Information Center
Cetner, Michelle
2015-01-01
When thinking about student reasoning and sense making, teachers must consider the nature of tasks given to students along with how to plan to use the tasks in the classroom. Students should be presented with tasks in a way that encourages them to draw connections between algebraic and geometric concepts. This article focuses on the idea that it…
Math Sense: Algebra and Geometry.
ERIC Educational Resources Information Center
Howett, Jerry
This book is designed to help students gain the range of math skills they need to succeed in life, work, and on standardized tests; overcome math anxiety; discover math as interesting and purposeful; and develop good number sense. Topics covered in this book include algebra and geometry. Lessons are organized around four strands: (1) skill lessons…
Does Calculation or Word-Problem Instruction Provide A Stronger Route to Pre-Algebraic Knowledge?
Fuchs, Lynn S.; Powell, Sarah R.; Cirino, Paul T.; Schumacher, Robin F.; Marrin, Sarah; Hamlett, Carol L.; Fuchs, Douglas; Compton, Donald L.; Changas, Paul C.
2014-01-01
The focus of this study was connections among 3 aspects of mathematical cognition at 2nd grade: calculations, word problems, and pre-algebraic knowledge. We extended the literature, which is dominated by correlational work, by examining whether intervention conducted on calculations or word problems contributes to improved performance in the other domain and whether intervention in either or both domains contributes to pre-algebraic knowledge. Participants were 1102 children in 127 2nd-grade classrooms in 25 schools. Teachers were randomly assigned to 3 conditions: calculation intervention, word-problem intervention, and business-as-usual control. Intervention, which lasted 17 weeks, was designed to provide research-based linkages between arithmetic calculations or arithmetic word problems (depending on condition) to pre-algebraic knowledge. Multilevel modeling suggested calculation intervention improved calculation but not word-problem outcomes; word-problem intervention enhanced word-problem but not calculation outcomes; and word-problem intervention provided a stronger route than calculation intervention to pre-algebraic knowledge. PMID:25541565
Does Calculation or Word-Problem Instruction Provide A Stronger Route to Pre-Algebraic Knowledge?
Fuchs, Lynn S; Powell, Sarah R; Cirino, Paul T; Schumacher, Robin F; Marrin, Sarah; Hamlett, Carol L; Fuchs, Douglas; Compton, Donald L; Changas, Paul C
2014-11-01
The focus of this study was connections among 3 aspects of mathematical cognition at 2(nd) grade: calculations, word problems, and pre-algebraic knowledge. We extended the literature, which is dominated by correlational work, by examining whether intervention conducted on calculations or word problems contributes to improved performance in the other domain and whether intervention in either or both domains contributes to pre-algebraic knowledge. Participants were 1102 children in 127 2(nd)-grade classrooms in 25 schools. Teachers were randomly assigned to 3 conditions: calculation intervention, word-problem intervention, and business-as-usual control. Intervention, which lasted 17 weeks, was designed to provide research-based linkages between arithmetic calculations or arithmetic word problems (depending on condition) to pre-algebraic knowledge. Multilevel modeling suggested calculation intervention improved calculation but not word-problem outcomes; word-problem intervention enhanced word-problem but not calculation outcomes; and word-problem intervention provided a stronger route than calculation intervention to pre-algebraic knowledge.
Teachers' Understanding of Algebraic Generalization
NASA Astrophysics Data System (ADS)
Hawthorne, Casey Wayne
Generalization has been identified as a cornerstone of algebraic thinking (e.g., Lee, 1996; Sfard, 1995) and is at the center of a rich conceptualization of K-8 algebra (Kaput, 2008; Smith, 2003). Moreover, mathematics teachers are being encouraged to use figural-pattern generalizing tasks as a basis of student-centered instruction, whereby teachers respond to and build upon the ideas that arise from students' explorations of these activities. Although more and more teachers are engaging their students in such generalizing tasks, little is known about teachers' understanding of generalization and their understanding of students' mathematical thinking in this domain. In this work, I addressed this gap, exploring the understanding of algebraic generalization of 4 exemplary 8th-grade teachers from multiple perspectives. A significant feature of this investigation is an examination of teachers' understanding of the generalization process, including the use of algebraic symbols. The research consisted of two phases. Phase I was an examination of the teachers' understandings of the underlying quantities and quantitative relationships represented by algebraic notation. In Phase II, I observed the instruction of 2 of these teachers. Using the lens of professional noticing of students' mathematical thinking, I explored the teachers' enacted knowledge of algebraic generalization, characterizing how it supported them to effectively respond to the needs and queries of their students. Results indicated that teachers predominantly see these figural patterns as enrichment activities, disconnected from course content. Furthermore, in my analysis, I identified conceptual difficulties teachers experienced when solving generalization tasks, in particular, connecting multiple symbolic representations with the quantities in the figures. Moreover, while the teachers strived to overcome the challenges of connecting different representations, they invoked both productive and unproductive
Explicit field realizations of W algebras
NASA Astrophysics Data System (ADS)
Wei, Shao-Wen; Liu, Yu-Xiao; Zhang, Li-Jie; Ren, Ji-Rong
2009-06-01
The fact that certain nonlinear W2,s algebras can be linearized by the inclusion of a spin-1 current can provide a simple way to realize W2,s algebras from linear W1,2,s algebras. In this paper, we first construct the explicit field realizations of linear W1,2,s algebras with double scalar and double spinor, respectively. Then, after a change of basis, the realizations of W2,s algebras are presented. The results show that all these realizations are Romans-type realizations.
Roughness in lattice ordered effect algebras.
Xin, Xiao Long; Hua, Xiu Juan; Zhu, Xi
2014-01-01
Many authors have studied roughness on various algebraic systems. In this paper, we consider a lattice ordered effect algebra and discuss its roughness in this context. Moreover, we introduce the notions of the interior and the closure of a subset and give some of their properties in effect algebras. Finally, we use a Riesz ideal induced congruence and define a function e(a, b) in a lattice ordered effect algebra E and build a relationship between it and congruence classes. Then we study some properties about approximation of lattice ordered effect algebras.
Roughness in Lattice Ordered Effect Algebras
Xin, Xiao Long; Hua, Xiu Juan; Zhu, Xi
2014-01-01
Many authors have studied roughness on various algebraic systems. In this paper, we consider a lattice ordered effect algebra and discuss its roughness in this context. Moreover, we introduce the notions of the interior and the closure of a subset and give some of their properties in effect algebras. Finally, we use a Riesz ideal induced congruence and define a function e(a, b) in a lattice ordered effect algebra E and build a relationship between it and congruence classes. Then we study some properties about approximation of lattice ordered effect algebras. PMID:25170523
Array algebra estimation in signal processing
NASA Astrophysics Data System (ADS)
Rauhala, U. A.
A general theory of linear estimators called array algebra estimation is interpreted in some terms of multidimensional digital signal processing, mathematical statistics, and numerical analysis. The theory has emerged during the past decade from the new field of a unified vector, matrix and tensor algebra called array algebra. The broad concepts of array algebra and its estimation theory cover several modern computerized sciences and technologies converting their established notations and terminology into one common language. Some concepts of digital signal processing are adopted into this language after a review of the principles of array algebra estimation and its predecessors in mathematical surveying sciences.
On special classes of n-algebras
NASA Astrophysics Data System (ADS)
Vainerman, L.; Kerner, R.
1996-05-01
We define n-algebras as linear spaces on which the internal composition law involves n elements: m:V⊗n■V. It is known that such algebraic structures are interesting for their applications to problems of modern mathematical physics. Using the notion of a commutant of two subalgebras of an n-algebra, we distinguish certain classes of n-algebras with reasonable properties: semisimple, Abelian, nilpotent, solvable. We also consider a few examples of n-algebras of different types, and show their properties.
Infinite order decompositions of C*-algebras.
Nematjonovich, Arzikulov Farhodjon
2016-01-01
The present paper is devoted to infinite order decompositions of C*-algebras. It is proved that an infinite order decomposition (IOD) of a C*-algebra forms the complexification of an order unit space, and, if the C*-algebra is monotone complete (not necessarily weakly closed) then its IOD is also monotone complete ordered vector space. Also it is established that an IOD of a C*-algebra is a C*-algebra if and only if this C*-algebra is a von Neumann algebra. As a summary we obtain that the norm of an infinite dimensional matrix is equal to the supremum of norms of all finite dimensional main diagonal submatrices of this matrix and an infinite dimensional matrix is positive if and only if all finite dimensional main diagonal submatrices of this matrix are positive.
Deformed Kac Moody and Virasoro algebras
NASA Astrophysics Data System (ADS)
Balachandran, A. P.; Queiroz, A. R.; Marques, A. M.; Teotonio-Sobrinho, P.
2007-07-01
Whenever the group {\\bb R}^n acts on an algebra {\\cal A} , there is a method to twist \\cal A to a new algebra {\\cal A}_\\theta which depends on an antisymmetric matrix θ (θμν = -θνμ = constant). The Groenewold-Moyal plane {\\cal A}_\\theta({\\bb R}^{d+1}) is an example of such a twisted algebra. We give a general construction to realize this twist in terms of {\\cal A} itself and certain 'charge' operators Qμ. For {\\cal A}_\\theta({\\bb R}^{d+1}), Q_\\mu are translation generators. This construction is then applied to twist the oscillators realizing the Kac-Moody (KM) algebra as well as the KM currents. They give different deformations of the KM algebra. From one of the deformations of the KM algebra, we construct, via the Sugawara construction, the Virasoro algebra. These deformations have an implication for statistics as well.
Filiform Lie algebras of order 3
Navarro, R. M.
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 la 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.
Recursion and feedback in image algebra
NASA Astrophysics Data System (ADS)
Ritter, Gerhard X.; Davidson, Jennifer L.
1991-04-01
Recursion and feedback are two important processes in image processing. Image algebra, a unified algebraic structure developed for use in image processing and image analysis, provides a common mathematical environment for expressing image processing transforms. It is only recently that image algebra has been extended to include recursive operations [1]. Recently image algebra was shown to incorporate neural nets [2], including a new type of neural net, the morphological neural net [3]. This paper presents the relationship of the recursive image algebra to the field of fractions of the ring of matrices, and gives the two dimensional moving average filter as an example. Also, the popular multilayer perceptron with back propagation and a morphology neural network with learning rule are presented in image algebra notation. These examples show that image algebra can express these important feedback concepts in a succinct way.
Preconditioner Circuit Analysis
2011-09-01
ground plane and both operational amplifier terminals. The parasitic capacitances are labeled Cp1 and Cp2 in Figure 19. Figure 19. Circuit for...3.69 MHz 3.98pF 55720 5107 OV (17) Cp2 = 1 pF R1 = 5107 Ω R3...circuit. The capacitor would be placed in parallel with RF to cancel the effect of Cp2 and then feedback factor will look purely resistive. Another
On multilevel block modulation codes
NASA Technical Reports Server (NTRS)
Kasami, Tadao; Takata, Toyoo; Fujiwara, Toru; Lin, Shu
1991-01-01
The multilevel (ML) technique for combining block coding and modulation is investigated. A general formulation is presented for ML modulation codes in terms of component codes with appropriate distance measures. A specific method for constructing ML block modulation codes (MLBMCs) with interdependency among component codes is proposed. Given an MLBMC C with no interdependency among the binary component codes, the proposed method gives an MLBC C-prime that has the same rate as C, a minimum squared Euclidean distance not less than that of C, a trellis diagram with the same number of states as that of C, and a smaller number of nearest-neighbor codewords than that of C. Finally, a technique is presented for analyzing the error performance of MLBMCs for an additive white Gaussian noise channel based on soft-decision maximum-likelihood decoding.
On multilevel block modulation codes
NASA Technical Reports Server (NTRS)
Kasami, Tadao; Takata, Toyoo; Fujiwara, Toru; Lin, Shu
1991-01-01
The multilevel (ML) technique for combining block coding and modulation is investigated. A general formulation is presented for ML modulation codes in terms of component codes with appropriate distance measures. A specific method for constructing ML block modulation codes (MLBMCs) with interdependency among component codes is proposed. Given an MLBMC C with no interdependency among the binary component codes, the proposed method gives an MLBC C-prime that has the same rate as C, a minimum squared Euclidean distance not less than that of C, a trellis diagram with the same number of states as that of C, and a smaller number of nearest-neighbor codewords than that of C. Finally, a technique is presented for analyzing the error performance of MLBMCs for an additive white Gaussian noise channel based on soft-decision maximum-likelihood decoding.
Algebraic complexities and algebraic curves over finite fields
Chudnovsky, D. V.; Chudnovsky, G. V.
1987-01-01
We consider the problem of minimal (multiplicative) complexity of polynomial multiplication and multiplication in finite extensions of fields. For infinite fields minimal complexities are known [Winograd, S. (1977) Math. Syst. Theory 10, 169-180]. We prove lower and upper bounds on minimal complexities over finite fields, both linear in the number of inputs, using the relationship with linear coding theory and algebraic curves over finite fields. PMID:16593816
Multilevel modelling: Beyond the basic applications.
Wright, Daniel B; London, Kamala
2009-05-01
Over the last 30 years statistical algorithms have been developed to analyse datasets that have a hierarchical/multilevel structure. Particularly within developmental and educational psychology these techniques have become common where the sample has an obvious hierarchical structure, like pupils nested within a classroom. We describe two areas beyond the basic applications of multilevel modelling that are important to psychology: modelling the covariance structure in longitudinal designs and using generalized linear multilevel modelling as an alternative to methods from signal detection theory (SDT). Detailed code for all analyses is described using packages for the freeware R.
Planarization of metal films for multilevel interconnects
Tuckerman, D.B.
1985-08-23
In the fabrication of multilevel integrated circuits, each metal layer is planarized by heating to momentarily melt the layer. The layer is melted by sweeping laser pulses of suitable width, typically about 1 microsecond duration, over the layer in small increments. The planarization of each metal layer eliminates irregular and discontinuous conditions between successive layers. The planarization method is particularly applicable to circuits having ground or power planes and allows for multilevel interconnects. Dielectric layers can also be planarized to produce a fully planar multilevel interconnect structure. The method is useful for the fabrication of VLSI circuits, particularly for wafer-scale integration.
Planarization of metal films for multilevel interconnects
Tuckerman, David B.
1987-01-01
In the fabrication of multilevel integrated circuits, each metal layer is anarized by heating to momentarily melt the layer. The layer is melted by sweeping laser pulses of suitable width, typically about 1 microsecond duration, over the layer in small increments. The planarization of each metal layer eliminates irregular and discontinuous conditions between successive layers. The planarization method is particularly applicable to circuits having ground or power planes and allows for multilevel interconnects. Dielectric layers can also be planarized to produce a fully planar multilevel interconnect structure. The method is useful for the fabrication of VLSI circuits, particularly for wafer-scale integration.
Planarization of metal films for multilevel interconnects
Tuckerman, David B.
1989-01-01
In the fabrication of multilevel integrated circuits, each metal layer is anarized by heating to momentarily melt the layer. The layer is melted by sweeping laser pulses of suitable width, typically about 1 microsecond duration, over the layer in small increments. The planarization of each metal layer eliminates irregular and discontinuous conditions between successive layers. The planarization method is particularly applicable to circuits having ground or power planes and allows for multilevel interconnects. Dielectric layers can also be planarized to produce a fully planar multilevel interconnect structure. The method is useful for the fabrication of VLSI circuits, particularly for wafer-scale integration.
Planarization of metal films for multilevel interconnects
Tuckerman, D.B.
1985-06-24
In the fabrication of multilevel integrated circuits, each metal layer is planarized by heating to momentarily melt the layer. The layer is melted by sweeping lase pulses of suitable width, typically about 1 microsecond duration, over the layer in small increments. The planarization of each metal layer eliminates irregular and discontinuous conditions between successive layers. The planarization method is particularly applicable to circuits having ground or power planes and allows for multilevel interconnects. Dielectric layers can also be planarized to produce a fully planar multilevel interconnect structure. The method is useful for the fabrication of VLSI circuits, particularly for wafer-scale integration.
Planarization of metal films for multilevel interconnects
Tuckerman, D.B.
1989-03-21
In the fabrication of multilevel integrated circuits, each metal layer is planarized by heating to momentarily melt the layer. The layer is melted by sweeping laser pulses of suitable width, typically about 1 microsecond duration, over the layer in small increments. The planarization of each metal layer eliminates irregular and discontinuous conditions between successive layers. The planarization method is particularly applicable to circuits having ground or power planes and allows for multilevel interconnects. Dielectric layers can also be planarized to produce a fully planar multilevel interconnect structure. The method is useful for the fabrication of VLSI circuits, particularly for wafer-scale integration. 6 figs.
Planarization of metal films for multilevel interconnects
Tuckerman, D.B.
1989-03-21
In the fabrication of multilevel integrated circuits, each metal layer is planarized by heating to momentarily melt the layer. The layer is melted by sweeping laser pulses of suitable width, typically about 1 microsecond duration, over the layer in small increments. The planarization of each metal layer eliminates irregular and discontinuous conditions between successive layers. The planarization method is particularly applicable to circuits having ground or power planes and allows for multilevel interconnects. Dielectric layers can also be planarized to produce a fully planar multilevel interconnect structure. The method is useful for the fabrication of VLSI circuits, particularly for wafer-scale integration. 6 figs.
Multilevel converters for power system applications
Lai, J.S.; Stovall, J.P.; Peng, F.Z. |
1995-09-01
Multilevel converters are emerging as a new breed of power converter options for power system applications. These converters are most suitable for high voltage high power applications because they connect devices in series without the need for component matching. One of the major limitations of the multilevel converters is the voltage unbalance between different levels. To avoid voltage unbalance between different levels, several techniques have been proposed for different applications. Excluding magnetic-coupled converters, this paper introduces three multilevel voltage source converters: (1) diode-clamp, (2) flying-capacitors, and (3) cascaded inverters with separate dc sources. The operation principle, features, constraints, and potential applications of these converters will be discussed.
Alternative algebraic approaches in quantum chemistry
Mezey, Paul G.
2015-01-22
Various algebraic approaches of quantum chemistry all follow a common principle: the fundamental properties and interrelations providing the most essential features of a quantum chemical representation of a molecule or a chemical process, such as a reaction, can always be described by algebraic methods. Whereas such algebraic methods often provide precise, even numerical answers, nevertheless their main role is to give a framework that can be elaborated and converted into computational methods by involving alternative mathematical techniques, subject to the constraints and directions provided by algebra. In general, algebra describes sets of interrelations, often phrased in terms of algebraic operations, without much concern with the actual entities exhibiting these interrelations. However, in many instances, the very realizations of two, seemingly unrelated algebraic structures by actual quantum chemical entities or properties play additional roles, and unexpected connections between different algebraic structures are often giving new insight. Here we shall be concerned with two alternative algebraic structures: the fundamental group of reaction mechanisms, based on the energy-dependent topology of potential energy surfaces, and the interrelations among point symmetry groups for various distorted nuclear arrangements of molecules. These two, distinct algebraic structures provide interesting interrelations, which can be exploited in actual studies of molecular conformational and reaction processes. Two relevant theorems will be discussed.
Fuchs, Lynn S.; Compton, Donald L.; Fuchs, Douglas; Powell, Sarah R.; Schumacher, Robin F.; Hamlett, Carol L.; Vernier, Emily; Namkung, Jessica M.; Vukovic, Rose K.
2012-01-01
The purpose of this study was to investigate the contributions of domain-general cognitive resources and different forms of arithmetic development to individual differences in pre-algebraic knowledge. Children (n=279; mean age=7.59 yrs) were assessed on 7 domain-general cognitive resources as well as arithmetic calculations and word problems at start of 2nd grade and on calculations, word problems, and pre-algebraic knowledge at end of 3rd grade. Multilevel path analysis, controlling for instructional effects associated with the sequence of classrooms in which students were nested across grades 2–3, indicated arithmetic calculations and word problems are foundational to pre-algebraic knowledge. Also, results revealed direct contributions of nonverbal reasoning and oral language to pre-algebraic knowledge, beyond indirect effects that are mediated via arithmetic calculations and word problems. By contrast, attentive behavior, phonological processing, and processing speed contributed to pre-algebraic knowledge only indirectly via arithmetic calculations and word problems. PMID:22409764
Surface defects and chiral algebras
Córdova, Clay; Gaiotto, Davide; Shao, Shu-Heng
2017-05-26
Here, we investigate superconformal surface defects in four-dimensional N = 2 superconformal theories. Each such defect gives rise to a module of the associated chiral algebra and the surface defect Schur index is the character of this module. Various natural chiral algebra operations such as Drinfield-Sokolov reduction and spectral flow can be interpreted as constructions involving four-dimensional surface defects. We compute the index of these defects in the free hypermultiplet theory and Argyres-Douglas theories, using both infrared techniques involving BPS states, as well as renormalization group flows onto Higgs branches. We find perfect agreement with the predicted characters, in eachmore » case.« less
Algebraic Methods to Design Signals
2015-08-27
whose out-of-phase autocorrelation values are very small. We call the constructed sequences perfect sequences and they serve as perfect algebraic...matrices DISTRIBUTION A: Distribution approved for public release. 2. Gauss sum factorizations yield perfect sequences, (with John Dillon and...the p- ary case, the prefix " perfect " for the underlying sequence (i.e. 1-dimensional array) refers to the case when all the out-of-phase
Algebraic learning for language acquisition
NASA Astrophysics Data System (ADS)
Farrell, Kevin R.; Mammone, Richard J.; Gorin, Allen
1994-02-01
This paper explores the application of new algorithms to the adaptive language acquisition model formulated by Gorin. The new methods consists of incremental approaches for the algebraic learning of statistical associations proposed by Tishby. The incremental methods are evaluated on a text-based natural language experiment, namely the inward call manager task. Performance is evaluated with respect to the alternative methods, namely the smooth mutual information method and the pseudo-inverse solution.
Introduction to Image Algebra Ada
NASA Astrophysics Data System (ADS)
Wilson, Joseph N.
1991-07-01
Image Algebra Ada (IAA) is a superset of the Ada programming language designed to support use of the Air Force Armament Laboratory's image algebra in the development of computer vision application programs. The IAA language differs from other computer vision languages is several respects. It is machine independent, and an IAA translator has been implemented in the military standard Ada language. Its image operands and operations can be used to program a range of both low- and high-level vision algorithms. This paper provides an overview of the image algebra constructs supported in IAA and describes the embodiment of these constructs in the IAA extension of Ada. Examples showing the use of IAA for a range of computer vision tasks are given. The design of IAA as a superset of Ada and the implementation of the initial translator in Ada represent critical choices. The authors discuss the reasoning behind these choices as well as the benefits and drawbacks associated with them. Implementation strategies associated with the use of Ada as an implementation language for IAA are also discussed. While one can look on IAA as a program design language (PDL) for specifying Ada programs, it is useful to consider IAA as a separate language superset of Ada. This admits the possibility of directly translating IAA for implementation on special purpose architectures. This paper explores strategies for porting IAA to various architectures and notes the critical language and implementation features for porting to different architectures.
BLAS- BASIC LINEAR ALGEBRA SUBPROGRAMS
NASA Technical Reports Server (NTRS)
Krogh, F. T.
1994-01-01
The Basic Linear Algebra Subprogram (BLAS) library is a collection of FORTRAN callable routines for employing standard techniques in performing the basic operations of numerical linear algebra. The BLAS library was developed to provide a portable and efficient source of basic operations for designers of programs involving linear algebraic computations. The subprograms available in the library cover the operations of dot product, multiplication of a scalar and a vector, vector plus a scalar times a vector, Givens transformation, modified Givens transformation, copy, swap, Euclidean norm, sum of magnitudes, and location of the largest magnitude element. Since these subprograms are to be used in an ANSI FORTRAN context, the cases of single precision, double precision, and complex data are provided for. All of the subprograms have been thoroughly tested and produce consistent results even when transported from machine to machine. BLAS contains Assembler versions and FORTRAN test code for any of the following compilers: Lahey F77L, Microsoft FORTRAN, or IBM Professional FORTRAN. It requires the Microsoft Macro Assembler and a math co-processor. The PC implementation allows individual arrays of over 64K. The BLAS library was developed in 1979. The PC version was made available in 1986 and updated in 1988.
BLAS- BASIC LINEAR ALGEBRA SUBPROGRAMS
NASA Technical Reports Server (NTRS)
Krogh, F. T.
1994-01-01
The Basic Linear Algebra Subprogram (BLAS) library is a collection of FORTRAN callable routines for employing standard techniques in performing the basic operations of numerical linear algebra. The BLAS library was developed to provide a portable and efficient source of basic operations for designers of programs involving linear algebraic computations. The subprograms available in the library cover the operations of dot product, multiplication of a scalar and a vector, vector plus a scalar times a vector, Givens transformation, modified Givens transformation, copy, swap, Euclidean norm, sum of magnitudes, and location of the largest magnitude element. Since these subprograms are to be used in an ANSI FORTRAN context, the cases of single precision, double precision, and complex data are provided for. All of the subprograms have been thoroughly tested and produce consistent results even when transported from machine to machine. BLAS contains Assembler versions and FORTRAN test code for any of the following compilers: Lahey F77L, Microsoft FORTRAN, or IBM Professional FORTRAN. It requires the Microsoft Macro Assembler and a math co-processor. The PC implementation allows individual arrays of over 64K. The BLAS library was developed in 1979. The PC version was made available in 1986 and updated in 1988.
Computer algebra and transport theory.
Warsa, J. S.
2004-01-01
Modern symbolic algebra computer software augments and complements more traditional approaches to transport theory applications in several ways. The first area is in the development and enhancement of numerical solution methods for solving the Boltzmann transport equation. Typically, special purpose computer codes are designed and written to solve specific transport problems in particular ways. Different aspects of the code are often written from scratch and the pitfalls of developing complex computer codes are numerous and well known. Software such as MAPLE and MATLAB can be used to prototype, analyze, verify and determine the suitability of numerical solution methods before a full-scale transport application is written. Once it is written, the relevant pieces of the full-scale code can be verified using the same tools I that were developed for prototyping. Another area is in the analysis of numerical solution methods or the calculation of theoretical results that might otherwise be difficult or intractable. Algebraic manipulations are done easily and without error and the software also provides a framework for any additional numerical calculations that might be needed to complete the analysis. We will discuss several applications in which we have extensively used MAPLE and MATLAB in our work. All of them involve numerical solutions of the S{sub N} transport equation. These applications encompass both of the two main areas in which we have found computer algebra software essential.
Cervical Laminoplasty for Multilevel Cervical Myelopathy
Sayana, Murali Krishna; Jamil, Hassan; Poynton, Ashley
2011-01-01
Cervical spondylotic myelopathy can result from degenerative cervical spondylosis, herniated disk material, osteophytes, redundant ligamentum flavum, or ossification of the posterior longitudinal ligament. Surgical intervention for multi-level myelopathy aims to decompress the spinal cord and maintain stability of the cervical spine. Laminoplasty was major surgical advancement as laminectomy resulted in kyphosis and unsatisfactory outcomes. Hirabayashi popularised the expansive open door laminoplasty which was later modified several surgeons. Laminoplasty has changed the way surgeons approach multilevel cervical spondylotic myelopathy. PMID:21991408
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.…
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.…
Walendziak, Andrzej
2015-01-01
The notions of an ideal and a fuzzy ideal in BN-algebras are introduced. The properties and characterizations of them are investigated. The concepts of normal ideals and normal congruences of a BN-algebra are also studied, the properties of them are displayed, and a one-to-one correspondence between them is presented. Conditions for a fuzzy set to be a fuzzy ideal are given. The relationships between ideals and fuzzy ideals of a BN-algebra are established. The homomorphic properties of fuzzy ideals of a BN-algebra are provided. Finally, characterizations of Noetherian BN-algebras and Artinian BN-algebras via fuzzy ideals are obtained. PMID:26125050
Bilinear forms on fermionic Novikov algebras
NASA Astrophysics Data System (ADS)
Chen, Zhiqi; Zhu, Fuhai
2007-05-01
Novikov algebras were introduced in connection with the Poisson brackets of hydrodynamic type and Hamiltonian operators in formal variational calculus. Fermionic Novikov algebras correspond to a certain Hamiltonian super-operator in a super-variable. In this paper, we show that there is a remarkable geometry on fermionic Novikov algebras with non-degenerate invariant symmetric bilinear forms, which we call pseudo-Riemannian fermionic Novikov algebras. They are related to pseudo-Riemannian Lie algebras. Furthermore, we obtain a procedure to classify pseudo-Riemannian fermionic Novikov algebras. As an application, we give the classification in dimension <=4. Motivated by the one in dimension 4, we construct some examples in high dimensions.
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.
Lie algebras of classical and stochastic electrodynamics
NASA Astrophysics Data System (ADS)
Neto, J. J. Soares; Vianna, J. D. M.
1994-03-01
The Lie algebras associated with infinitesimal symmetry transformations of third-order differential equations of interest to classical electrodynamics and stochastic electrodynamics have been obtained. The structure constants for a general case are presented and the Lie algebra for each particular application is easily achieved. By the method used here it is not necessary to know the explicit expressions of the infinitesimal generators in order to determine the structure constants of the Lie algebra.
On classification of m-dimensional algebras
NASA Astrophysics Data System (ADS)
Bekbaev, U.
2017-03-01
A constructive approach to the classification and invariance problems, with respect to basis changes, of the finite dimensional algebras is offered. A construction of an invariant open, dense (in the Zariski topology) subset of the space of structure constants of algebras is given. A classification of all algebras with structure constants from this dense set is given by providing canonical representatives of their orbits. A finite system of generators for the corresponding field of invariant rational functions of structure constants is shown.
Symbolic Lie algebras manipulations using COMMON LISP
NASA Astrophysics Data System (ADS)
Cecchini, R.; Tarlini, M.
1989-01-01
We present a description and an implementation of a program in COMMON LISP to perform symbolic computations in a given Lie algebra. Using the general definitions of vector space Lie algebra and enveloping algebra, the program is able to compute commutators, to evaluate similarity transformations and the general Baker-Campbell-Hausdorff formula. All the computations are exact, including numerical coefficients. For the interactive user an optional menu facility and online help are available. LISP knowledge is unnecessary.
Numerical linear algebra algorithms and software
NASA Astrophysics Data System (ADS)
Dongarra, Jack J.; Eijkhout, Victor
2000-11-01
The increasing availability of advanced-architecture computers has a significant effect on all spheres of scientific computation, including algorithm research and software development in numerical linear algebra. Linear algebra - in particular, the solution of linear systems of equations - lies at the heart of most calculations in scientific computing. This paper discusses some of the recent developments in linear algebra designed to exploit these advanced-architecture computers. We discuss two broad classes of algorithms: those for dense, and those for sparse matrices.
NASA Astrophysics Data System (ADS)
Manerowska, Anna; Nieznański, Edward; Mulawka, Jan
2013-10-01
Our aim is to present the algebra of concepts in two formal languages. First, after introducing a primary relation between concepts, which is subsumption, we shall specify in a language that uses quantifiers, the Boolean algebra of general concepts. Next, we shall note down the same algebra in simplified non-quantifying language, in order to use it as basis for two specific implementations, i.e. to create the Boolean algebras of deontic concepts and axiological concepts.
Vertex representations of quantum affine algebras.
Frenkel, I B; Jing, N
1988-12-01
We construct vertex representations of quantum affine algebras of ADE type, which were first introduced in greater generality by Drinfeld and Jimbo. The limiting special case of our construction is the untwisted vertex representation of affine Lie algebras of Frenkel-Kac and Segal. Our representation is given by means of a new type of vertex operator corresponding to the simple roots and satisfying the defining relations. In the case of the quantum affine algebra of type A, we introduce vertex operators corresponding to all the roots and determine their commutation relations. This provides an analogue of a Chevalley basis of the affine Lie algebra [unk](n) in the basic representation.
Regular subalgebras of affine Kac Moody algebras
NASA Astrophysics Data System (ADS)
Felikson, Anna; Retakh, Alexander; Tumarkin, Pavel
2008-09-01
We classify regular subalgebras of Kac-Moody algebras in terms of their root systems. In the process, we establish that a root system of a subalgebra is always an intersection of the root system of the algebra with a sublattice of its root lattice. We also discuss applications to investigations of regular subalgebras of hyperbolic Kac-Moody algebras and conformally invariant subalgebras of affine Kac-Moody algebras. In particular, we provide explicit formulae for determining all Virasoro charges in coset constructions that involve regular subalgebras.
Dispersion Operators Algebra and Linear Canonical Transformations
NASA Astrophysics Data System (ADS)
Andriambololona, Raoelina; Ranaivoson, Ravo Tokiniaina; Hasimbola Damo Emile, Randriamisy; Rakotoson, Hanitriarivo
2017-02-01
This work intends to present a study on relations between a Lie algebra called dispersion operators algebra, linear canonical transformation and a phase space representation of quantum mechanics that we have introduced and studied in previous works. The paper begins with a brief recall of our previous works followed by the description of the dispersion operators algebra which is performed in the framework of the phase space representation. Then, linear canonical transformations are introduced and linked with this algebra. A multidimensional generalization of the obtained results is given.
Banach Algebras Associated to Lax Pairs
NASA Astrophysics Data System (ADS)
Glazebrook, James F.
2015-04-01
Lax pairs featuring in the theory of integrable systems are known to be constructed from a commutative algebra of formal pseudodifferential operators known as the Burchnall- Chaundy algebra. Such pairs induce the well known KP flows on a restricted infinite-dimensional Grassmannian. The latter can be exhibited as a Banach homogeneous space constructed from a Banach *-algebra. It is shown that this commutative algebra of operators generating Lax pairs can be associated with a commutative C*-subalgebra in the C*-norm completion of the *-algebra. In relationship to the Bose-Fermi correspondence and the theory of vertex operators, this C*-algebra has an association with the CAR algebra of operators as represented on Fermionic Fock space by the Gelfand-Naimark-Segal construction. Instrumental is the Plücker embedding of the restricted Grassmannian into the projective space of the associated Hilbert space. The related Baker and tau-functions provide a connection between these two C*-algebras, following which their respective state spaces and Jordan-Lie-Banach algebras structures can be compared.
Literal algebra for satellite dynamics. [perturbation analysis
NASA Technical Reports Server (NTRS)
Gaposchkin, E. M.
1975-01-01
A description of the rather general class of operations available is given and the operations are related to problems in satellite dynamics. The implementation of an algebra processor is discussed. The four main categories of symbol processors are related to list processing, string manipulation, symbol manipulation, and formula manipulation. Fundamental required operations for an algebra processor are considered. It is pointed out that algebra programs have been used for a number of problems in celestial mechanics with great success. The advantage of computer algebra is its accuracy and speed.
Dispersion Operators Algebra and Linear Canonical Transformations
NASA Astrophysics Data System (ADS)
Andriambololona, Raoelina; Ranaivoson, Ravo Tokiniaina; Hasimbola Damo Emile, Randriamisy; Rakotoson, Hanitriarivo
2017-04-01
This work intends to present a study on relations between a Lie algebra called dispersion operators algebra, linear canonical transformation and a phase space representation of quantum mechanics that we have introduced and studied in previous works. The paper begins with a brief recall of our previous works followed by the description of the dispersion operators algebra which is performed in the framework of the phase space representation. Then, linear canonical transformations are introduced and linked with this algebra. A multidimensional generalization of the obtained results is given.
Representations of Super Yang-Mills Algebras
NASA Astrophysics Data System (ADS)
Herscovich, Estanislao
2013-06-01
We study in this article the representation theory of a family of super algebras, called the super Yang-Mills algebras, by exploiting the Kirillov orbit method à la Dixmier for nilpotent super Lie algebras. These super algebras are an extension of the so-called Yang-Mills algebras, introduced by A. Connes and M. Dubois-Violette in (Lett Math Phys 61(2):149-158, 2002), and in fact they appear as a "background independent" formulation of supersymmetric gauge theory considered in physics, in a similar way as Yang-Mills algebras do the same for the usual gauge theory. Our main result states that, under certain hypotheses, all Clifford-Weyl super algebras {{Cliff}q(k) ⊗ Ap(k)}, for p ≥ 3, or p = 2 and q ≥ 2, appear as a quotient of all super Yang-Mills algebras, for n ≥ 3 and s ≥ 1. This provides thus a family of representations of the super Yang-Mills algebras.
Difficulties in initial algebra learning in Indonesia
NASA Astrophysics Data System (ADS)
Jupri, Al; Drijvers, Paul; van den Heuvel-Panhuizen, Marja
2014-12-01
Within mathematics curricula, algebra has been widely recognized as one of the most difficult topics, which leads to learning difficulties worldwide. In Indonesia, algebra performance is an important issue. In the Trends in International Mathematics and Science Study (TIMSS) 2007, Indonesian students' achievement in the algebra domain was significantly below the average student performance in other Southeast Asian countries such as Thailand, Malaysia, and Singapore. This fact gave rise to this study which aims to investigate Indonesian students' difficulties in algebra. In order to do so, a literature study was carried out on students' difficulties in initial algebra. Next, an individual written test on algebra tasks was administered, followed by interviews. A sample of 51 grade VII Indonesian students worked the written test, and 37 of them were interviewed afterwards. Data analysis revealed that mathematization, i.e., the ability to translate back and forth between the world of the problem situation and the world of mathematics and to reorganize the mathematical system itself, constituted the most frequently observed difficulty in both the written test and the interview data. Other observed difficulties concerned understanding algebraic expressions, applying arithmetic operations in numerical and algebraic expressions, understanding the different meanings of the equal sign, and understanding variables. The consequences of these findings on both task design and further research in algebra education are discussed.
Multicloning and Multibroadcasting in Operator Algebras
NASA Astrophysics Data System (ADS)
Kaniowski, Krzysztof; Lubnauer, Katarzyna; Łuczak, Andrzej
2015-12-01
We investigate multicloning and multibroadcasting in the general operator algebra framework in arbitrary dimension, generalizing thus results obtained in this framework for simple cloning and broadcasting.
ERIC Educational Resources Information Center
Ozgun-Koca, S. Ash
2010-01-01
Although growing numbers of secondary school mathematics teachers and students use calculators to study graphs, they mainly rely on paper-and-pencil when manipulating algebraic symbols. However, the Computer Algebra Systems (CAS) on computers or handheld calculators create new possibilities for teaching and learning algebraic manipulation. This…
ERIC Educational Resources Information Center
Hitt, Fernando; Saboya, Mireille; Cortés Zavala, Carlos
2016-01-01
This paper presents an experiment that attempts to mobilise an arithmetic-algebraic way of thinking in order to articulate between arithmetic thinking and the early algebraic thinking, which is considered a prelude to algebraic thinking. In the process of building this latter way of thinking, researchers analysed pupils' spontaneous production…
ERIC Educational Resources Information Center
Ozgun-Koca, S. Ash
2010-01-01
Although growing numbers of secondary school mathematics teachers and students use calculators to study graphs, they mainly rely on paper-and-pencil when manipulating algebraic symbols. However, the Computer Algebra Systems (CAS) on computers or handheld calculators create new possibilities for teaching and learning algebraic manipulation. This…
ERIC Educational Resources Information Center
Hitt, Fernando; Saboya, Mireille; Cortés Zavala, Carlos
2016-01-01
This paper presents an experiment that attempts to mobilise an arithmetic-algebraic way of thinking in order to articulate between arithmetic thinking and the early algebraic thinking, which is considered a prelude to algebraic thinking. In the process of building this latter way of thinking, researchers analysed pupils' spontaneous production…
Alternative Methods for Assessing Mediation in Multilevel Data: The Advantages of Multilevel SEM
ERIC Educational Resources Information Center
Preacher, Kristopher J.; Zhang, Zhen; Zyphur, Michael J.
2011-01-01
Multilevel modeling (MLM) is a popular way of assessing mediation effects with clustered data. Two important limitations of this approach have been identified in prior research and a theoretical rationale has been provided for why multilevel structural equation modeling (MSEM) should be preferred. However, to date, no empirical evidence of MSEM's…
Gu, Fei; Preacher, Kristopher J; Wu, Wei; Yung, Yiu-Fai
2014-01-01
Although the state space approach for estimating multilevel regression models has been well established for decades in the time series literature, it does not receive much attention from educational and psychological researchers. In this article, we (a) introduce the state space approach for estimating multilevel regression models and (b) extend the state space approach for estimating multilevel factor models. A brief outline of the state space formulation is provided and then state space forms for univariate and multivariate multilevel regression models, and a multilevel confirmatory factor model, are illustrated. The utility of the state space approach is demonstrated with either a simulated or real example for each multilevel model. It is concluded that the results from the state space approach are essentially identical to those from specialized multilevel regression modeling and structural equation modeling software. More importantly, the state space approach offers researchers a computationally more efficient alternative to fit multilevel regression models with a large number of Level 1 units within each Level 2 unit or a large number of observations on each subject in a longitudinal study.
Multilevel Complex Networks and Systems
NASA Astrophysics Data System (ADS)
Caldarelli, Guido
2014-03-01
Network theory has been a powerful tool to model isolated complex systems. However, the classical approach does not take into account the interactions often present among different systems. Hence, the scientific community is nowadays concentrating the efforts on the foundations of new mathematical tools for understanding what happens when multiple networks interact. The case of economic and financial networks represents a paramount example of multilevel networks. In the case of trade, trade among countries the different levels can be described by the different granularity of the trading relations. Indeed, we have now data from the scale of consumers to that of the country level. In the case of financial institutions, we have a variety of levels at the same scale. For example one bank can appear in the interbank networks, ownership network and cds networks in which the same institution can take place. In both cases the systemically important vertices need to be determined by different procedures of centrality definition and community detection. In this talk I will present some specific cases of study related to these topics and present the regularities found. Acknowledged support from EU FET Project ``Multiplex'' 317532.
Multilevel sequential Monte Carlo samplers
Beskos, Alexandros; Jasra, Ajay; Law, Kody; Tempone, Raul; Zhou, Yan
2016-08-24
Here, we study the approximation of expectations w.r.t. probability distributions associated to the solution of partial differential equations (PDEs); this scenario appears routinely in Bayesian inverse problems. In practice, one often has to solve the associated PDE numerically, using, for instance finite element methods and leading to a discretisation bias, with the step-size level h_{L}. In addition, the expectation cannot be computed analytically and one often resorts to Monte Carlo methods. In the context of this problem, it is known that the introduction of the multilevel Monte Carlo (MLMC) method can reduce the amount of computational effort to estimate expectations, for a given level of error. This is achieved via a telescoping identity associated to a Monte Carlo approximation of a sequence of probability distributions with discretisation levels ${\\infty}$ >h_{0}>h_{1 }...>h_{L}. In many practical problems of interest, one cannot achieve an i.i.d. sampling of the associated sequence of probability distributions. A sequential Monte Carlo (SMC) version of the MLMC method is introduced to deal with this problem. In conclusion, it is shown that under appropriate assumptions, the attractive property of a reduction of the amount of computational effort to estimate expectations, for a given level of error, can be maintained within the SMC context.
Multilevel sequential Monte Carlo samplers
Beskos, Alexandros; Jasra, Ajay; Law, Kody; ...
2016-08-24
Here, we study the approximation of expectations w.r.t. probability distributions associated to the solution of partial differential equations (PDEs); this scenario appears routinely in Bayesian inverse problems. In practice, one often has to solve the associated PDE numerically, using, for instance finite element methods and leading to a discretisation bias, with the step-size level hL. In addition, the expectation cannot be computed analytically and one often resorts to Monte Carlo methods. In the context of this problem, it is known that the introduction of the multilevel Monte Carlo (MLMC) method can reduce the amount of computational effort to estimate expectations, for a given level of error. This is achieved via a telescoping identity associated to a Monte Carlo approximation of a sequence of probability distributions with discretisation levelsmore » $${\\infty}$$ >h0>h1 ...>hL. In many practical problems of interest, one cannot achieve an i.i.d. sampling of the associated sequence of probability distributions. A sequential Monte Carlo (SMC) version of the MLMC method is introduced to deal with this problem. In conclusion, it is shown that under appropriate assumptions, the attractive property of a reduction of the amount of computational effort to estimate expectations, for a given level of error, can be maintained within the SMC context.« less
Applications of cascade multilevel inverters.
Peng, Fang-zen; Qian, Zhao-ming
2003-01-01
Cascade multilevel inverters have been developed for electric utility applications. A cascade M-level inverter consists of (M-1)/2 H-bridges in which each bridge's dc voltage is supported by its own dc capacitor. The new inverter can: (1) generate almost sinusoidal waveform voltage while only switching one time per fundamental cycle; (2) dispense with multi-pulse inverters' transformers used in conventional utility interfaces and static var compensators; (3) enables direct parallel or series transformer-less connection to medium- and high-voltage power systems. In short, the cascade inverter is much more efficient and suitable for utility applications than traditional multi-pulse and pulse width modulation (PWM) inverters. The authors have experimentally demonstrated the superiority of the new inverter for power supply, (hybrid) electric vehicle (EV) motor drive, reactive power (var) and harmonic compensation. This paper summarizes the features, feasibility, and control schemes of the cascade inverter for utility applications including utility interface of renewable energy, voltage regulation, var compensation, and harmonic filtering in power systems. Analytical, simulated, and experimental results demonstrated the superiority of the new inverters.
Multilevel sequential Monte Carlo samplers
Beskos, Alexandros; Jasra, Ajay; Law, Kody; Tempone, Raul; Zhou, Yan
2016-08-24
Here, we study the approximation of expectations w.r.t. probability distributions associated to the solution of partial differential equations (PDEs); this scenario appears routinely in Bayesian inverse problems. In practice, one often has to solve the associated PDE numerically, using, for instance finite element methods and leading to a discretisation bias, with the step-size level h_{L}. In addition, the expectation cannot be computed analytically and one often resorts to Monte Carlo methods. In the context of this problem, it is known that the introduction of the multilevel Monte Carlo (MLMC) method can reduce the amount of computational effort to estimate expectations, for a given level of error. This is achieved via a telescoping identity associated to a Monte Carlo approximation of a sequence of probability distributions with discretisation levels ${\\infty}$ >h_{0}>h_{1 }...>h_{L}. In many practical problems of interest, one cannot achieve an i.i.d. sampling of the associated sequence of probability distributions. A sequential Monte Carlo (SMC) version of the MLMC method is introduced to deal with this problem. In conclusion, it is shown that under appropriate assumptions, the attractive property of a reduction of the amount of computational effort to estimate expectations, for a given level of error, can be maintained within the SMC context.
The Growing Importance of Linear Algebra in Undergraduate Mathematics.
ERIC Educational Resources Information Center
Tucker, Alan
1993-01-01
Discusses the theoretical and practical importance of linear algebra. Presents a brief history of linear algebra and matrix theory and describes the place of linear algebra in the undergraduate curriculum. (MDH)
Kim, Eun Sook; Cao, Chunhua
2015-01-01
Considering that group comparisons are common in social science, we examined two latent group mean testing methods when groups of interest were either at the between or within level of multilevel data: multiple-group multilevel confirmatory factor analysis (MG ML CFA) and multilevel multiple-indicators multiple-causes modeling (ML MIMIC). The performance of these methods were investigated through three Monte Carlo studies. In Studies 1 and 2, either factor variances or residual variances were manipulated to be heterogeneous between groups. In Study 3, which focused on within-level multiple-group analysis, six different model specifications were considered depending on how to model the intra-class group correlation (i.e., correlation between random effect factors for groups within cluster). The results of simulations generally supported the adequacy of MG ML CFA and ML MIMIC for multiple-group analysis with multilevel data. The two methods did not show any notable difference in the latent group mean testing across three studies. Finally, a demonstration with real data and guidelines in selecting an appropriate approach to multilevel multiple-group analysis are provided.
Classification of filiform Lie algebras of order 3
NASA Astrophysics Data System (ADS)
Navarro, Rosa María
2016-12-01
Lie algebras of order 3 constitute a generalization of Lie algebras and superalgebras. Throughout this paper the classification problem of filiform Lie algebras of order 3 is considered and therefore this work is a continuation papers seen in the literature. We approach this classification by extending Vergne's result for filiform Lie algebras and by considering algebras of order 3 of high nilindex. We find the expression of the law to which any elementary filiform Lie algebra of order 3 is isomorphic.
Centroids and derivations of low-dimensional Leibniz algebra
NASA Astrophysics Data System (ADS)
Husain, Sh. K. Said; Rakhimov, I. S.; Basri, W.
2017-08-01
In this paper we introduce the concept of centroid and derivation of Leibniz algebras. By using the classification results of Leibniz algebras obtained earlier, we describe the centroids and derivations of low-dimensional Leibniz algebras. We also study some properties of centroids of Leibniz algebras and use these properties to categorize the algebras to have so-called small centroids. The description of the derivations enables us to specify an important subclass of Leibniz algebras called characteristically nilpotent.
The Algebra of Lexical Semantics
NASA Astrophysics Data System (ADS)
Kornai, András
The current generative theory of the lexicon relies primarily on tools from formal language theory and mathematical logic. Here we describe how a different formal apparatus, taken from algebra and automata theory, resolves many of the known problems with the generative lexicon. We develop a finite state theory of word meaning based on machines in the sense of Eilenberg [11], a formalism capable of describing discrepancies between syntactic type (lexical category) and semantic type (number of arguments). This mechanism is compared both to the standard linguistic approaches and to the formalisms developed in AI/KR.
Automated Angular Momentum Recoupling Algebra
NASA Astrophysics Data System (ADS)
Williams, H. T.; Silbar, Richard R.
1992-04-01
We present a set of heuristic rules for algebraic solution of angular momentum recoupling problems. The general problem reduces to that of finding an optimal path from one binary tree (representing the angular momentum coupling scheme for the reduced matrix element) to another (representing the sub-integrals and spin sums to be done). The method lends itself to implementation on a microcomputer, and we have developed such an implementation using a dialect of LISP. We describe both how our code, called RACAH, works and how it appears to the user. We illustrate the use of RACAH for several transition and scattering amplitude matrix elements occurring in atomic, nuclear, and particle physics.
Strengthening Effect Algebras in a Logical Perspective: Heyting-Wajsberg Algebras
NASA Astrophysics Data System (ADS)
Konig, Martinvaldo
2014-10-01
Heyting effect algebras are lattice-ordered pseudoboolean effect algebras endowed with a pseudocomplementation that maps on the center (i.e. Boolean elements). They are the algebraic counterpart of an extension of both Łukasiewicz many-valued logic and intuitionistic logic. We show that Heyting effect algebras are termwise equivalent to Heyting-Wajsberg algebras where the two different logical implications are defined as primitive operators. We prove this logic to be decidable, to be strongly complete and to have the deduction-detachment theorem.
Automorphisms and Derivations of the Insertion-Elimination Algebra and Related Graded Lie Algebras
NASA Astrophysics Data System (ADS)
Ondrus, Matthew; Wiesner, Emilie
2016-07-01
This paper addresses several structural aspects of the insertion-elimination algebra {mathfrak{g}}, a Lie algebra that can be realized in terms of tree-inserting and tree-eliminating operations on the set of rooted trees. In particular, we determine the finite-dimensional subalgebras of {mathfrak{g}}, the automorphism group of {mathfrak{g}}, the derivation Lie algebra of {mathfrak{g}}, and a generating set. Several results are stated in terms of Lie algebras admitting a triangular decomposition and can be used to reproduce results for the generalized Virasoro algebras.
Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems
Zheng, Bin; Chen, Luoping; Hu, Xiaozhe; Chen, Long; Nochetto, Ricardo H.; Xu, Jinchao
2016-03-05
In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigate the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.
Non-relativistic Bondi–Metzner–Sachs algebra
NASA Astrophysics Data System (ADS)
Batlle, Carles; Delmastro, Diego; Gomis, Joaquim
2017-09-01
We construct two possible candidates for non-relativistic bms4 algebra in four space-time dimensions by contracting the original relativistic bms4 algebra. bms4 algebra is infinite-dimensional and it contains the generators of the Poincaré algebra, together with the so-called super-translations. Similarly, the proposed nrbms4 algebras can be regarded as two infinite-dimensional extensions of the Bargmann algebra. We also study a canonical realization of one of these algebras in terms of the Fourier modes of a free Schrödinger field, mimicking the canonical realization of relativistic bms4 algebra using a free Klein–Gordon field.
Global Geometric Deformations of Current Algebras as Krichever-Novikov Type Algebras
NASA Astrophysics Data System (ADS)
Fialowski, Alice; Schlichenmaier, Martin
2005-12-01
We construct algebraic-geometric families of genus one (i.e. elliptic) current and affine Lie algebras of Krichever-Novikov type. These families deform the classical current, respectively affine Kac-Moody Lie algebras. The construction is induced by the geometric process of degenerating the elliptic curve to singular cubics. If the finite-dimensional Lie algebra defining the infinite dimensional current algebra is simple then, even if restricted to local families, the constructed families are non-equivalent to the trivial family. In particular, we show that the current algebra is geometrically not rigid, despite its formal rigidity. This shows that in the infinite dimensional Lie algebra case the relations between geometric deformations, formal deformations and Lie algebra two-cohomology are not that close as in the finite-dimensional case. The constructed families are e.g. of relevance in the global operator approach to the Wess-Zumino-Witten-Novikov models appearing in the quantization of Conformal Field Theory. The algebras are explicitly given by generators and structure equations and yield new examples of infinite dimensional algebras of current and affine Lie algebra type.
Deriving the Regression Line with Algebra
ERIC Educational Resources Information Center
Quintanilla, John A.
2017-01-01
Exploration with spreadsheets and reliance on previous skills can lead students to determine the line of best fit. To perform linear regression on a set of data, students in Algebra 2 (or, in principle, Algebra 1) do not have to settle for using the mysterious "black box" of their graphing calculators (or other classroom technologies).…
Algebraic Thinking: A Problem Solving Approach
ERIC Educational Resources Information Center
Windsor, Will
2010-01-01
Algebraic thinking is a crucial and fundamental element of mathematical thinking and reasoning. It initially involves recognising patterns and general mathematical relationships among numbers, objects and geometric shapes. This paper will highlight how the ability to think algebraically might support a deeper and more useful knowledge, not only of…
Learning from Student Approaches to Algebraic Proofs
ERIC Educational Resources Information Center
D'Ambrosio, Beatriz S.; Kastberg, Signe E.; Viola dos Santos, Joao Ricardo
2010-01-01
Many mathematics teachers struggle to support their students' developing understanding of proof as an essential element in investigations of mathematics. The area of mathematics where the development of an understanding of proof is most challenging is algebra. In the case of algebraic proof, analysis of student written work on tasks that demand…
Post-Lie Algebras and Isospectral Flows
NASA Astrophysics Data System (ADS)
Ebrahimi-Fard, Kurusch; Lundervold, Alexander; Mencattini, Igor; Munthe-Kaas, Hans Z.
2015-11-01
In this paper we explore the Lie enveloping algebra of a post-Lie algebra derived from a classical R-matrix. An explicit exponential solution of the corresponding Lie bracket flow is presented. It is based on the solution of a post-Lie Magnus-type differential equation.
Success in Algebra among Community College Students
ERIC Educational Resources Information Center
Reyes, Czarina
2010-01-01
College algebra is a required course for most majors, but is viewed by many as a gatekeeper course for degree completion by students. With almost half a million students taking college algebra each year, faculty are experimenting with new course lengths of time that might result in higher success, completion, and retention rates for college…
2-Supernilpotent Mal'cev algebras.
Mudrinski, Nebojša
In this note we prove that a Mal'cev algebra is 2-supernilpotent ([1, 1, 1] = 0) if and only if it is polynomially equivalent to a special expanded group. This generalizes Gumm's result that a Mal'cev algebra is abelian if and only if it is polynomially equivalent to a module over a ring.
Calif. Laws Shift Gears on Algebra, Textbooks
ERIC Educational Resources Information Center
Robelen, Erik W.
2012-01-01
New laws in California have set the state on a course for some potentially significant changes to the curriculum, including a measure that revisits the matter of teaching Algebra 1 in 8th grade and another that revamps the state's textbook-adoption process and hands districts greater leeway in choosing instructional materials. The algebra-related…
Algebraic Formulas for Areas between Curves.
ERIC Educational Resources Information Center
Gabai, Hyman
1982-01-01
Korean secondary school students preparing for college learn about a simple algebraic formula for area bounded by a parabola and line. The approach does not seem well-known among American students. It is noted that, while the formula derivations rely on integration, algebra students could use the formulas without proofs. (MP)
Some Applications of Algebraic System Solving
ERIC Educational Resources Information Center
Roanes-Lozano, Eugenio
2011-01-01
Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…
Algebraic Thinking through Koch Snowflake Constructions
ERIC Educational Resources Information Center
Ghosh, Jonaki B.
2016-01-01
Generalizing is a foundational mathematical practice for the algebra classroom. It entails an act of abstraction and forms the core of algebraic thinking. Kinach (2014) describes two kinds of generalization--by analogy and by extension. This article illustrates how exploration of fractals provides ample opportunity for generalizations of both…
Practicing Algebraic Skills: A Conceptual Approach
ERIC Educational Resources Information Center
Friedlander, Alex; Arcavi, Abraham
2012-01-01
Traditionally, a considerable part of teaching and learning algebra has focused on routine practice and the application of rules, procedures, and techniques. Although today's computerized environments may have decreased the need to master algebraic skills, procedural competence is still a central component in any mathematical activity. However,…
Some Applications of Algebraic System Solving
ERIC Educational Resources Information Center
Roanes-Lozano, Eugenio
2011-01-01
Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…
Success in Algebra among Community College Students
ERIC Educational Resources Information Center
Reyes, Czarina
2010-01-01
College algebra is a required course for most majors, but is viewed by many as a gatekeeper course for degree completion by students. With almost half a million students taking college algebra each year, faculty are experimenting with new course lengths of time that might result in higher success, completion, and retention rates for college…
Deforming the Maxwell-Sim algebra
Gibbons, G. W.; Gomis, Joaquim; Pope, C. N.
2010-09-15
The Maxwell algebra is a noncentral extension of the Poincare algebra, in which the momentum generators no longer commute, but satisfy [P{sub {mu}},P{sub {nu}}]=Z{sub {mu}{nu}}. The charges Z{sub {mu}{nu}} commute with the momenta, and transform tensorially under the action of the angular momentum generators. If one constructs an action for a massive particle, invariant under these symmetries, one finds that it satisfies the equations of motion of a charged particle interacting with a constant electromagnetic field via the Lorentz force. In this paper, we explore the analogous constructions where one starts instead with the ISim subalgebra of Poincare, this being the symmetry algebra of very special relativity. It admits an analogous noncentral extension, and we find that a particle action invariant under this Maxwell-Sim algebra again describes a particle subject to the ordinary Lorentz force. One can also deform the ISim algebra to DISim{sub b}, where b is a nontrivial dimensionless parameter. We find that the motion described by an action invariant under the corresponding Maxwell-DISim algebra is that of a particle interacting via a Finslerian modification of the Lorentz force. In an appendix is it shown that the DISim{sub b} algebra is isomorphic to the extended Schroedinger algebra with its standard deformation parameter z, when b=(1/1-z).
Just Say Yes to Early Algebra!
ERIC Educational Resources Information Center
Stephens, Ana; Blanton, Maria; Knuth, Eric; Isler, Isil; Gardiner, Angela Murphy
2015-01-01
Mathematics educators have argued for some time that elementary school students are capable of engaging in algebraic thinking and should be provided with rich opportunities to do so. Recent initiatives like the Common Core State Standards for Mathematics (CCSSM) (CCSSI 2010) have taken up this call by reiterating the place of early algebra in…
THE RADICAL OF A JORDAN ALGEBRA
McCrimmon, Kevin
1969-01-01
In this paper we define a Jacobson radical for Jordan algebras analogous to that for associative algebras and show that it enjoys many of the properties of the associative radical. We then relate the corresponding notion of “semisimplicity” to the previously defined notion of “nondegeneracy” (Jacobson, N., these Proceedings, 55, 243-251 (1966)). PMID:16591736
Cartan calculus on quantum Lie algebras
Schupp, P.; Watts, P.; Zumino, B.
1993-12-09
A generalization of the differential geometry of forms and vector fields to the case of quantum Lie algebras is given. In an abstract formulation that incorporates many existing examples of differential geometry on quantum spaces we combine an exterior derivative, inner derivations, Lie derivatives, forms and functions au into one big algebra, the ``Cartan Calculus.``
An algebraic approach to the scattering equations
NASA Astrophysics Data System (ADS)
Huang, Rijun; Rao, Junjie; Feng, Bo; He, Yang-Hui
2015-12-01
We employ the so-called companion matrix method from computational algebraic geometry, tailored for zero-dimensional ideals, to study the scattering equations. The method renders the CHY-integrand of scattering amplitudes computable using simple linear algebra and is amenable to an algorithmic approach. Certain identities in the amplitudes as well as rationality of the final integrand become immediate in this formalism.
SAYD Modules over Lie-Hopf Algebras
NASA Astrophysics Data System (ADS)
Rangipour, Bahram; Sütlü, Serkan
2012-11-01
In this paper a general van Est type isomorphism is proved. The isomorphism is between the Lie algebra cohomology of a bicrossed sum Lie algebra and the Hopf cyclic cohomology of its Hopf algebra. We first prove a one to one correspondence between stable-anti-Yetter-Drinfeld (SAYD) modules over the total Lie algebra and those modules over the associated Hopf algebra. In contrast to the non-general case done in our previous work, here the van Est isomorphism is proved at the first level of a natural spectral sequence, rather than at the level of complexes. It is proved that the Connes-Moscovici Hopf algebras do not admit any finite dimensional SAYD modules except the unique one-dimensional one found by Connes-Moscovici in 1998. This is done by extending our techniques to work with the infinite dimensional Lie algebra of formal vector fields. At the end, the one to one correspondence is applied to construct a highly nontrivial four dimensional SAYD module over the Schwarzian Hopf algebra. We then illustrate the whole theory on this example. Finally explicit representative cocycles of the cohomology classes for this example are calculated.
Parabolas: Connection between Algebraic and Geometrical Representations
ERIC Educational Resources Information Center
Shriki, Atara
2011-01-01
A parabola is an interesting curve. What makes it interesting at the secondary school level is the fact that this curve is presented in both its contexts: algebraic and geometric. Being one of Apollonius' conic sections, the parabola is basically a geometric entity. It is, however, typically known for its algebraic characteristics, in particular…
Algebraic Formulas for Areas between Curves.
ERIC Educational Resources Information Center
Gabai, Hyman
1982-01-01
Korean secondary school students preparing for college learn about a simple algebraic formula for area bounded by a parabola and line. The approach does not seem well-known among American students. It is noted that, while the formula derivations rely on integration, algebra students could use the formulas without proofs. (MP)
From operator algebras to superconformal field theory
Kawahigashi, Yasuyuki
2010-01-15
We survey operator algebraic approach to (super)conformal field theory. We discuss representation theory, classification results, full and boundary conformal field theories, relations to supervertex operator algebras and Moonshine, connections to subfactor theory of Jones, and certain aspects of noncommutative geometry of Connes.
Focus on Fractions to Scaffold Algebra
ERIC Educational Resources Information Center
Ooten, Cheryl Thomas
2013-01-01
Beginning algebra is a gatekeeper course into the pipeline to higher mathematics courses required for respected professions in engineering, science, statistics, mathematics, education, and technology. Beginning algebra can also be a perfect storm if the necessary foundational skills are not within a student's grasp. What skills ensure beginning…
Relational Algebra and SQL: Better Together
ERIC Educational Resources Information Center
McMaster, Kirby; Sambasivam, Samuel; Hadfield, Steven; Wolthuis, Stuart
2013-01-01
In this paper, we describe how database instructors can teach Relational Algebra and Structured Query Language together through programming. Students write query programs consisting of sequences of Relational Algebra operations vs. Structured Query Language SELECT statements. The query programs can then be run interactively, allowing students to…
Using Tables to Bridge Arithmetic and Algebra
ERIC Educational Resources Information Center
Brown, Susan A.; Mehilos, Megan
2010-01-01
Many students and adults feel that algebra is merely the shuffling of symbols. The three interrelated concepts of variable, expression, and equation are central to beginning algebra, and in recent years, helping students understand the idea of a variable has been emphasized. Although graphing calculators help students solve equations, it is also…
A Technology-Intensive Approach to Algebra.
ERIC Educational Resources Information Center
Heid, M. Kathleen; Zbiek, Rose Mary
1995-01-01
Computer-Intensive Algebra (CIA) focuses on the use of technology to help develop a rich understanding of fundamental algebraic concepts in real-world settings using computing tools for easy access to numerical, graphical, and symbolic representations of mathematical ideas. (MKR)
Algebraic Thinking through Koch Snowflake Constructions
ERIC Educational Resources Information Center
Ghosh, Jonaki B.
2016-01-01
Generalizing is a foundational mathematical practice for the algebra classroom. It entails an act of abstraction and forms the core of algebraic thinking. Kinach (2014) describes two kinds of generalization--by analogy and by extension. This article illustrates how exploration of fractals provides ample opportunity for generalizations of both…
Focus on Fractions to Scaffold Algebra
ERIC Educational Resources Information Center
Ooten, Cheryl Thomas
2013-01-01
Beginning algebra is a gatekeeper course into the pipeline to higher mathematics courses required for respected professions in engineering, science, statistics, mathematics, education, and technology. Beginning algebra can also be a perfect storm if the necessary foundational skills are not within a student's grasp. What skills ensure beginning…
Using Students' Interests as Algebraic Models
ERIC Educational Resources Information Center
Whaley, Kenneth A.
2012-01-01
Fostering algebraic thinking is an important goal for middle-grades mathematics teachers. Developing mathematical reasoning requires that teachers cultivate students' habits of mind. Teachers develop students' understanding of algebra by engaging them in tasks that involve modeling and representation. This study was designed to investigate how…
Symbolic Notations and Students' Achievements in Algebra
ERIC Educational Resources Information Center
Peter, Ebiendele E.; Olaoye, Adetunji A.
2013-01-01
This study focuses on symbolic notations and its impact on students' achievement in Algebra. The main reason for this study rests on the observation from personal and professional experiences on students' increasing hatred for Algebra. One hundred and fifty (150) Senior Secondary School Students (SSS) from Ojo Local Education District, Ojo, Lagos,…
Endomorphisms of Quantum Generalized Weyl Algebras
NASA Astrophysics Data System (ADS)
Kitchin, Andrew P.; Launois, Stéphane
2014-07-01
We prove that every endomorphism of a simple quantum generalized Weyl algebra A over a commutative Laurent polynomial ring in one variable is an automorphism. This is achieved by obtaining an explicit classification of all endomorphisms of A. Our main result applies to minimal primitive factors of the quantized enveloping algebra and certain minimal primitive quotients of the positive part of.
Situated Learning in an Abstract Algebra Classroom
ERIC Educational Resources Information Center
Ticknor, Cindy S.
2012-01-01
Advisory committees of mathematics consider abstract algebra as an essential component of the mathematical preparation of secondary teachers, yet preservice teachers find it challenging to connect the topics addressed in this advanced course with the high school algebra they must someday teach. This study analyzed the mathematical content…
Teaching Modeling and Axiomatization with Boolean Algebra.
ERIC Educational Resources Information Center
De Villiers, Michael D.
1987-01-01
Presented is an alternative approach to the traditional teaching of Boolean algebra for secondary school mathematics. The main aim of the approach is to use Boolean algebra to teach pupils such mathematical processes as modeling and axiomatization. A course using the approach is described. (RH)
Symbolic Notations and Students' Achievements in Algebra
ERIC Educational Resources Information Center
Peter, Ebiendele E.; Olaoye, Adetunji A.
2013-01-01
This study focuses on symbolic notations and its impact on students' achievement in Algebra. The main reason for this study rests on the observation from personal and professional experiences on students' increasing hatred for Algebra. One hundred and fifty (150) Senior Secondary School Students (SSS) from Ojo Local Education District, Ojo, Lagos,…
Upper Primary School Students' Algebraic Thinking
ERIC Educational Resources Information Center
Kamol, Natcha; Ban Har, Yeap
2010-01-01
This qualitative research study involving 128 students in grades 4-6 was conducted to develop a framework for characterizing upper primary school students' algebraic thinking. Four levels of algebraic thinking were identified from student responses to tasks involving patterns and open number sentences. Level 1 students failed to understand the…