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.
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.
2004-04-01
Meros uses the compositional, aggregation, and overload operator capabilities of TSF to provide an object-oriented package providing segregated/block preconditioners for linear systems related to fully-coupled Navier-Stokes problems. This class of preconditioners exploits the special properties of these problems to segregate the equations and use multi-level preconditioners (through ML) on the matrix sub-blocks. Several preconditioners are provided, including the Fp and BFB preconditioners of Kay & Loghin and Silvester, Elman, Kay & Wathen. The overall performancemore » and scalability of these preconditioners approaches that of multigrid for certain types of problems. Meros also provides more traditional pressure projection methods including SIMPLE and SIMPLEC.« less
Element Agglomeration Algebraic Multilevel Monte-Carlo Library
2015-02-19
ElagMC is a parallel C++ library for Multilevel Monte Carlo simulations with algebraically constructed coarse spaces. ElagMC enables Multilevel variance reduction techniques in the context of general unstructured meshes by using the specialized element-based agglomeration techniques implemented in ELAG (the Element-Agglomeration Algebraic Multigrid and Upscaling Library developed by U. Villa and P. Vassilevski and currently under review for public release). The ElabMC library can support different type of deterministic problems, including mixed finite element discretizations of subsurface flow problems.
Element Agglomeration Algebraic Multilevel Monte-Carlo Library
2015-02-19
ElagMC is a parallel C++ library for Multilevel Monte Carlo simulations with algebraically constructed coarse spaces. ElagMC enables Multilevel variance reduction techniques in the context of general unstructured meshes by using the specialized element-based agglomeration techniques implemented in ELAG (the Element-Agglomeration Algebraic Multigrid and Upscaling Library developed by U. Villa and P. Vassilevski and currently under review for public release). The ElabMC library can support different type of deterministic problems, including mixed finite element discretizationsmore » of subsurface flow problems.« less
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.
Algebraic multilevel preconditioning in isogeometric analysis: Construction and numerical studies
NASA Astrophysics Data System (ADS)
Gahalaut, K. P. S.; Tomar, S. K.; Kraus, J. K.
2013-11-01
We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a uniform mesh on a unit interval, the explicit representation of B-spline basis functions for a fixed mesh size $h$ is given for $p=2,3,4$ and for $C^{0}$- and $C^{p-1}$-continuity. The presented methods show $h$- and (almost) $p$-independent convergence rates. Supporting numerical results for convergence factor and iterations count for AMLI cycles ($V$-, linear $W$-, nonlinear $W$-) are provided. Numerical tests are performed, in two-dimensions on square domain and quarter annulus, and in three-dimensions on quarter thick ring.
NASA Astrophysics Data System (ADS)
May, D. A.; Le Pourhiet, L.
2012-12-01
The use of a mixed finite element formulation to discretise Stokes equations, coupled with a particle based Lagrangian representation of the material lithology is a common numerical technique employed within geodynamics to study large deformation processes. The extension of this methodology to enable high-resolution, three-dimensional simulations still represents a number of significant computational challenges. Of most concern are the high computational memory requirements of the favoured Q2-P1 element, and the development of efficient, 'light-weight' and robust linear and non-linear solvers, which are performant on multi-core, massively parallel computational hardware. Our objective is to develop a 'cheap' and efficient methodology utilizing the mixed element Q2-P1, to study 3D geodynamic processes including subduction, rifting and folding with the inclusion of visco-plastic materials. For this class of problems, careful treatment of all of the aforementioned technical challenges is essential to achieve high resolution simulations. Here, I describe a flexible methodology which aims to rectify all of these issues. The key to the approach is 1) always pose the discrete problem in defect-correction form and 2) utilise a mixture of assembled and matrix-free operations to evaluate the non-linear residual and apply the operators and smoothers required to define the multi-level preconditioner for the Jacobian. The performance characteristics of the matrix-free, multi-level preconditioning strategy is demonstrated by considering several 3D visco-plastic models. The robustness of the preconditioner and non-linear solver with respect to the viscosity contrast and the topology of the viscosity field, together with the parallel scalability will be demonstrated.
NASA Astrophysics Data System (ADS)
Ahunov, Roman R.; Kuksenko, Sergey P.; Gazizov, Talgat R.
2016-06-01
A multiple solution of linear algebraic systems with dense matrix by iterative methods is considered. To accelerate the process, the recomputing of the preconditioning matrix is used. A priory condition of the recomputing based on change of the arithmetic mean of the current solution time during the multiple solution is proposed. To confirm the effectiveness of the proposed approach, the numerical experiments using iterative methods BiCGStab and CGS for four different sets of matrices on two examples of microstrip structures are carried out. For solution of 100 linear systems the acceleration up to 1.6 times, compared to the approach without recomputing, is obtained.
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.
Preconditioners for the spectral multigrid method
NASA Technical Reports Server (NTRS)
Phillips, T. N.; Zang, T. A.; Hussaini, M. Y.
1983-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 problems 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.
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.
Parallel Bidomain Preconditioners for Cardiac Excitation
NASA Astrophysics Data System (ADS)
Colli Franzone, P.; Pavarino, L. F.; Scacchi, S.
2010-09-01
A multilevel hybrid Newton-Krylov-Schwarz (NKS) method is constructed and studied numerically for implicit time discretizations of the Bidomain reaction-diffusion system in three dimensions. This model describes the bioelectrical activity of the heart by coupling two degenerate parabolic equations with a stiff system of ordinary differential equations. The NKS Bidomain solver employs an outer inexact Newton iteration to solve the nonlinear finite element system originating at each time step of the implicit discretization. The Jacobian update during the Newton iteration is solved by a Krylov method employing a multilevel hybrid overlapping Schwarz preconditioner, additive within the levels and multiplicative among the levels. Parallel tests on Linux clusters are performed, showing that the convergence of the method is independent of the number of subdomains (scalability), the discretization parameters and the number of levels (optimality).
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.
Carburetor and fuel preconditioner
Brown, P.M.
1991-12-24
This patent describes an improved carburetor and fuel preconditioner device for internal combustion engines. It comprises a first atmospheric air intake conduit; a bubble chamber operable to hold liquid fuel at a selected level therein, the bubble chamber provided with one or more air ports located below the fuel level for receiving atmospheric air from the first air intake conduit for bubbling air through the fuel and the bubble chamber defining an air-fuel vapor chamber above the fuel level; a multiplicity of catalytic beads located within the bubble chamber in contact with the fuel and with air drawn through the ports; a second atmospheric air intake conduit for receiving an air supply separate from the first conduit, the second conduit provided with at least one venturi, the venturi in fluid communication with the vapor chamber of the bubble chamber for receiving a fuel-air vapor mixture therefrom and for mixing and conducting the same to an intake manifold of the internal combustion engine; and, control means consisting of at least one pill can, located between the vapor chamber of the bubble chamber and the second conduit for controlling the amount of fuel-air mixture entering the second conduit.
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.
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.
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.
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.
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.
NASA Technical Reports Server (NTRS)
Ruge, J. W.; Stueben, K.
1987-01-01
The state of the art in algebraic multgrid (AMG) methods is discussed. The interaction between the relaxation process and the coarse grid correction necessary for proper behavior of the solution probes is discussed in detail. Sufficient conditions on relaxation and interpolation for the convergence of the V-cycle are given. The relaxation used in AMG, what smoothing means in an algebraic setting, and how it relates to the existing theory are considered. Some properties of the coarse grid operator are discussed, and results on the convergence of two-level and multilevel convergence are given. Details of an algorithm particularly studied for problems obtained by discretizing a single elliptic, second order partial differential equation are given. Results of experiments with such problems using both finite difference and finite element discretizations are presented.
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.
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 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.
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 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.
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…
A universal preconditioner for simulating condensed phase materials
NASA Astrophysics Data System (ADS)
Packwood, David; Kermode, James; Mones, Letif; Bernstein, Noam; Woolley, John; Gould, Nicholas; Ortner, Christoph; Csányi, Gábor
2016-04-01
We introduce a universal sparse preconditioner that accelerates geometry optimisation and saddle point search tasks that are common in the atomic scale simulation of materials. Our preconditioner is based on the neighbourhood structure and we demonstrate the gain in computational efficiency in a wide range of materials that include metals, insulators, and molecular solids. The simple structure of the preconditioner means that the gains can be realised in practice not only when using expensive electronic structure models but also for fast empirical potentials. Even for relatively small systems of a few hundred atoms, we observe speedups of a factor of two or more, and the gain grows with system size. An open source Python implementation within the Atomic Simulation Environment is available, offering interfaces to a wide range of atomistic codes.
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
jShyLU Scalable Hybrid Preconditioner and Solver
2012-09-11
ShyLU is numerical software to solve sparse linear systems of equations. ShyLU uses a hybrid direct-iterative Schur complement method, and may be used either as a preconditioner or as a solver. ShyLU is parallel and optimized for a single compute Solver node. ShyLU will be a package in the Trilinos software framework.
Contraction pre-conditioner in finite-difference electromagnetic modelling
NASA Astrophysics Data System (ADS)
Yavich, Nikolay; Zhdanov, Michael S.
2016-09-01
This paper introduces a novel approach to constructing an effective pre-conditioner for finite-difference (FD) electromagnetic modelling in geophysical applications. This approach is based on introducing an FD contraction operator, similar to one developed for integral equation formulation of Maxwell's equation. The properties of the FD contraction operator were established using an FD analogue of the energy equality for the anomalous electromagnetic field. A new pre-conditioner uses a discrete Green's function of a 1-D layered background conductivity. We also developed the formulae for an estimation of the condition number of the system of FD equations pre-conditioned with the introduced FD contraction operator. Based on this estimation, we have established that the condition number is bounded by the maximum conductivity contrast between the background conductivity and actual conductivity. When there are both resistive and conductive anomalies relative to the background, the new pre-conditioner is advantageous over using the 1-D discrete Green's function directly. In our numerical experiments with both resistive and conductive anomalies, for a land geoelectrical model with 1:10 contrast, the method accelerates convergence of an iterative method (BiCGStab) by factors of 2-2.5, and in a marine example with 1:50 contrast, by a factor of 4.6, compared to direct use of the discrete 1-D Green's function as a pre-conditioner.
Contraction preconditioner in finite-difference electromagnetic modeling
NASA Astrophysics Data System (ADS)
Yavich, Nikolay; Zhdanov, Michael S.
2016-06-01
This paper introduces a novel approach to constructing an effective preconditioner for finite-difference (FD) electromagnetic modeling in geophysical applications. This approach is based on introducing an FD contraction operator, similar to one developed for integral equation formulation of Maxwell's equation. The properties of the FD contraction operator were established using an FD analog of the energy equality for the anomalous electromagnetic field. A new preconditioner uses a discrete Green's function of a 1D layered background conductivity. We also developed the formulas for an estimation of the condition number of the system of FD equations preconditioned with the introduced FD contraction operator. Based on this estimation, we have established that for high contrasts, the condition number is bounded by the maximum conductivity contrast between the background conductivity and actual conductivity. When there are both resistive and conductive anomalies relative to the background, the new preconditioner is advantageous over using the 1D discrete Green's function directly. In our numerical experiments with both resistive and conductive anomalies, for a land geoelectrical model with 1:10 contrast, the method accelerates convergence of an iterative method (BiCGStab) by factors of 2 to 2.5, and in a marine example with 1:50 contrast, by a factor of 4.6, compared to direct use of the discrete 1D Green's function as a preconditioner.
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.
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.
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.
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.
ERIC Educational Resources Information Center
Pavelle, Richard; And Others
1981-01-01
Describes the nature and use of computer algebra and its applications to various physical sciences. Includes diagrams illustrating, among others, a computer algebra system and flow chart of operation of the Euclidean algorithm. (SK)
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…
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.
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).
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.
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.
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
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
ERIC Educational Resources Information Center
Schaufele, Christopher; Zumoff, Nancy
Earth Algebra is an entry level college algebra course that incorporates the spirit of the National Council of Teachers of Mathematics (NCTM) Curriculum and Evaluation Standards for School Mathematics at the college level. The context of the course places mathematics at the center of one of the major current concerns of the world. Through…
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.…
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.
Application of sparse matrix solvers as effective preconditioners
Young, D.P.; Melvin, R.G.; Johnson, F.T.; Bussoletti, J.E.; Wigton, L.B.; Samant, S.S. )
1989-11-01
In this paper the use of a new out-of-core sparse matrix package for the numerical solution of partial differential equations involving complex geometries arising from aerospace applications is discussed. The sparse matrix solver accepts contributions to the matrix elements in random order and assembles the matrix using fast sort/merge routines. Fill-in is reduced through the use of a physically based nested dissection ordering. For very large problems a drop tolerance is used during the matrix decomposition phase. The resulting incomplete factorization is an effective preconditioner for Krylov subspace methods, such as GMRES. Problems involving 200,000 unknowns routinely are solved on the Cray X-MP using 64MW of solid-state storage device (SSD).
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
Algebraic Flux Correction II. Compressible Euler Equations
NASA Astrophysics Data System (ADS)
Kuzmin, Dmitri; Möller, Matthias
Algebraic flux correction schemes of TVD and FCT type are extended to systems of hyperbolic conservation laws. The group finite element formulation is employed for the treatment of the compressible Euler equations. An efficient algorithm is proposed for the edge-by-edge matrix assembly. A generalization of Roe's approximate Riemann solver is derived by rendering all off-diagonal matrix blocks positive semi-definite. Another usable low-order method is constructed by adding scalar artificial viscosity proportional to the spectral radius of the cumulative Roe matrix. The limiting of antidiffusive fluxes is performed using a transformation to the characteristic variables or a suitable synchronization of correction factors for the conservative ones. The outer defect correction loop is equipped with a block-diagonal preconditioner so as to decouple the discretized Euler equations and solve them in a segregated fashion. As an alternative, a strongly coupled solution strategy (global BiCGSTAB method with a block-Gauß-Seidel preconditioner) is introduced for applications which call for the use of large time steps. Various algorithmic aspects including the implementation of characteristic boundary conditions are addressed. Simulation results are presented for inviscid flows in a wide range of Mach numbers.
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.
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.
ERIC Educational Resources Information Center
Frees, Edward W.; Kim, Jee-Seon
2006-01-01
Multilevel models are proven tools in social research for modeling complex, hierarchical systems. In multilevel modeling, statistical inference is based largely on quantification of random variables. This paper distinguishes among three types of random variables in multilevel modeling--model disturbances, random coefficients, and future response…
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
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.
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 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
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)
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.
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
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…
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)…
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…
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 methods for elliptic problems on unstructured grids
NASA Technical Reports Server (NTRS)
Chan, Tony F.; Go, Susie; Zikatanov, Ludmil
1997-01-01
Multilevel methods on unstructured grids for elliptic problems are reviewed. The advantages of these techniques are the flexible approximation of the boundaries of complicated physical domains and the ability to adapt the grid to the resolution of fine scaled structures. Multilevel methods, which include multigrid methods and domain decomposition methods, depend on the correct splitting of appropriate finite element spaces. The standard splittings used in the structured grid case cannot be directly extended to unstructured grids due to their requirement for a hierarchical grid structure. Issues related to the application of multilevel methods to unstructured grids are discussed, including how the coarse spaces and transfer operators are defined and how different types of boundary conditions are treated. An obvious way to generate a coarse mesh is to regrid the physical domain several times. Several alternatives are proposed and discussed: node nested coarse spaces, agglomerated coarse spaces and algebraically generated coarse spaces.
Numerical algebraic geometry and algebraic kinematics
NASA Astrophysics Data System (ADS)
Wampler, Charles W.; Sommese, Andrew J.
In this article, the basic constructs of algebraic kinematics (links, joints, and mechanism spaces) are introduced. This provides a common schema for many kinds of problems that are of interest in kinematic studies. Once the problems are cast in this algebraic framework, they can be attacked by tools from algebraic geometry. In particular, we review the techniques of numerical algebraic geometry, which are primarily based on homotopy methods. We include a review of the main developments of recent years and outline some of the frontiers where further research is occurring. While numerical algebraic geometry applies broadly to any system of polynomial equations, algebraic kinematics provides a body of interesting examples for testing algorithms and for inspiring new avenues of work.
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.
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.
Quantization of Algebraic Reduction
Sniatycki, Jeodrzej
2007-11-14
For a Poisson algebra obtained by algebraic reduction of symmetries of a quantizable system we develop an analogue of geometric quantization based on the quantization structure of the original system.
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 understanding of…
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.
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…
Orientation in operator algebras
Alfsen, Erik M.; Shultz, Frederic W.
1998-01-01
A concept of orientation is relevant for the passage from Jordan structure to associative structure in operator algebras. The research reported in this paper bridges the approach of Connes for von Neumann algebras and ourselves for C*-algebras in a general theory of orientation that is of geometric nature and is related to dynamics. PMID:9618457
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,…
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…
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.
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. PMID:27595527
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.
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.
Quasi Matrix Free Preconditioners in Optimization and Nonlinear Least-Squares
NASA Astrophysics Data System (ADS)
Bellavia, Stefania; Bertaccini, Daniele; Morini, Benedetta
2010-09-01
The approximate solution of several nonlinear optimization problems requires solving sequences of symmetric linear systems. When the number of variables is large, it is advisable to use an iterative linear solver for the Newton correction step. On the other hand, the underlying linear solver can converge slowly and the calculation of a preconditioner requires the computation of the Hessian matrix which usually represents a major task in the implementation. We propose here a way to overcome at least in part this two preconditioning issue.
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.
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…
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, pre-algebra, and algebra…
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.
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)
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
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.
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.
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.
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
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…
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
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…
Solving elliptic finite element systems in near-linear time with support preconditioners.
Vavasis, Stephen; Hendrickson, Bruce Alan; Boman, Erik Gunnar
2005-01-01
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by symmetric diagonally dominant matrices. Our framework for defining matrix approximation is support theory. Significant graph theoretic work has already been developed in the support framework for preconditioners in the diagonally dominant case, and in particular it is known that such systems can be solved with iterative methods in nearly linear time. Thus, our approximation result implies that these graph theoretic techniques can also solve a class of finite element problems in nearly linear time. We show that the quality of our approximation, which controls the number of iterations in the preconditioned iterative solver, depends primarily on a mesh quality measure but not on the problem size or shape of the domain.
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.
NASA Astrophysics Data System (ADS)
May, Dave; Le Pourhiet, Laetitia; Brown, Jed
2014-05-01
Here I describe a numerical method suitable for studying 3D non-linear, large deformation processes associated with crustal and lithopspheric deformation. The method employs a combination of mixed finite elements for the flow problem, coupled to the Material-Point-Method for representing material state and history variables. This computational methodology is intended to simultaneously satisfy all of the geodynamic modelling requirements. Particular emphasis is given to the development of non-linear solvers and preconditioners which are performant, practical and highly scalable - thereby enabling high resolution 3D simulations to be performed using massively parallel computational hardware. We have made a number of fundamental design choices which result in a fast, highly scalable and robust Q2P1 finite element implementation which is suitable for solving a wide range of geodynamic applications. Specifically these choices include: (i) utilizing an inf-sup stable mixed finite element (with a mapped pressure space) which provides a reliable velocity and pressure solution; (ii) expressing the problem in defect correction form so that Newton-like methods can be exploited; (iii) making extensive use of matrix-free operators which both drastically reduces the memory requirements and improves the parallel scalability of the sparse matrix-vector product; (iv) deferring a wide range of choices associated with the solver configuration to run-time. The performance characteristics of our hybrid geometric multi-grid preconditioning strategy is presented. The robustness of the preconditioner with respect to the viscosity contrast and the topology of the viscosity field, together with the parallel scalability is demonstrated. We will highlight the benefits of using hybrid coarse grid hierarchies consisting of a combination of Galerkin, assembled and matrix-free operators. The merits of using aggressive coarsening strategies will also be discussed. Examples from 3D continental
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.
Leibniz algebras associated with representations of filiform Lie algebras
NASA Astrophysics Data System (ADS)
Ayupov, Sh. A.; Camacho, L. M.; Khudoyberdiyev, A. Kh.; Omirov, B. A.
2015-12-01
In this paper we investigate Leibniz algebras whose quotient Lie algebra is a naturally graded filiform Lie algebra nn,1. We introduce a Fock module for the algebra nn,1 and provide classification of Leibniz algebras L whose corresponding Lie algebra L / I is the algebra nn,1 with condition that the ideal I is a Fock nn,1-module, where I is the ideal generated by squares of elements from L. We also consider Leibniz algebras with corresponding Lie algebra nn,1 and such that the action I ×nn,1 → I gives rise to a minimal faithful representation of nn,1. The classification up to isomorphism of such Leibniz algebras is given for the case of n = 4.
NASA Astrophysics Data System (ADS)
Smirnov, Andrey
2010-08-01
New trigonometric and rational solutions of the quantum Yang-Baxter equation (QYBE) are obtained by applying some singular gauge transformations to the known Belavin-Drinfeld elliptic R-matrix for sl(2;?). These solutions are shown to be related to the standard ones by the quasi-Hopf twist. We demonstrate that the quantum algebras arising from these new R-matrices can be obtained as special limits of the Sklyanin algebra. A representation for these algebras by the difference operators is found. The sl( N;?)-case is discussed.
NASA Astrophysics Data System (ADS)
Smirnov, Andrey
2010-08-01
New trigonometric and rational solutions of the quantum Yang-Baxter equation (QYBE) are obtained by applying some singular gauge transformations to the known Belavin-Drinfeld elliptic R-matrix for sl(2;?). These solutions are shown to be related to the standard ones by the quasi-Hopf twist. We demonstrate that the quantum algebras arising from these new R-matrices can be obtained as special limits of the Sklyanin algebra. A representation for these algebras by the difference operators is found. The sl(N;?)-case is discussed.
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
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…
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. PMID:17588863
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)
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.
Geometric Algebra for Physicists
NASA Astrophysics Data System (ADS)
Doran, Chris; Lasenby, Anthony
2007-11-01
Preface; Notation; 1. Introduction; 2. Geometric algebra in two and three dimensions; 3. Classical mechanics; 4. Foundations of geometric algebra; 5. Relativity and spacetime; 6. Geometric calculus; 7. Classical electrodynamics; 8. Quantum theory and spinors; 9. Multiparticle states and quantum entanglement; 10. Geometry; 11. Further topics in calculus and group theory; 12. Lagrangian and Hamiltonian techniques; 13. Symmetry and gauge theory; 14. Gravitation; Bibliography; Index.
NASA Astrophysics Data System (ADS)
Hiley, B. J.
In this chapter, we examine in detail the non-commutative symplectic algebra underlying quantum dynamics. By using this algebra, we show that it contains both the Weyl-von Neumann and the Moyal quantum algebras. The latter contains the Wigner distribution as the kernel of the density matrix. The underlying non-commutative geometry can be projected into either of two Abelian spaces, so-called `shadow phase spaces'. One of these is the phase space of Bohmian mechanics, showing that it is a fragment of the basic underlying algebra. The algebraic approach is much richer, giving rise to two fundamental dynamical time development equations which reduce to the Liouville equation and the Hamilton-Jacobi equation in the classical limit. They also include the Schrödinger equation and its wave-function, showing that these features are a partial aspect of the more general non-commutative structure. We discuss briefly the properties of this more general mathematical background from which the non-commutative symplectic algebra emerges.
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.
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
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…
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.
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).
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…
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.
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)
Multilevel techniques for nonelliptic problems
NASA Technical Reports Server (NTRS)
Jespersen, D. C.
1981-01-01
Multigrid and multilevel methods are extended to the solution of nonelliptic problems. A framework for analyzing these methods is established. A simple nonelliptic problem is given, and it is shown how a multilevel technique can be used for its solution. Emphasis is on smoothness properties of eigenvectors and attention is drawn to the possibility of conditioning the eigensystem so that eigenvectors have the desired smoothness properties.
Pseudo Algebraically Closed Extensions
NASA Astrophysics Data System (ADS)
Bary-Soroker, Lior
2009-07-01
This PhD deals with the notion of pseudo algebraically closed (PAC) extensions of fields. It develops a group-theoretic machinery, based on a generalization of embedding problems, to study these extensions. Perhaps the main result is that although there are many PAC extensions, the Galois closure of a proper PAC extension is separably closed. The dissertation also contains the following subjects. The group theoretical counterpart of pseudo algebraically closed extensions, the so-called projective pairs. Applications to seemingly unrelated subjects, e.g., an analog of Dirichlet's theorem about primes in arithmetic progression for polynomial rings in one variable over infinite fields.
Assessing Elementary Algebra with STACK
ERIC Educational Resources Information Center
Sangwin, Christopher J.
2007-01-01
This paper concerns computer aided assessment (CAA) of mathematics in which a computer algebra system (CAS) is used to help assess students' responses to elementary algebra questions. Using a methodology of documentary analysis, we examine what is taught in elementary algebra. The STACK CAA system, http://www.stack.bham.ac.uk/, which uses the CAS…
ERIC Educational Resources Information Center
Benjamin, Carl; And Others
Presented are student performance objectives, a student progress chart, and assignment sheets with objective and diagnostic measures for the stated performance objectives in College Algebra II. Topics covered include: differencing and complements; real numbers; factoring; fractions; linear equations; exponents and radicals; complex numbers,…
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,…
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…
ERIC Educational Resources Information Center
Glick, David
1995-01-01
Presents a technique that helps students concentrate more on the science and less on the mechanics of algebra while dealing with introductory physics formulas. Allows the teacher to do complex problems at a lower level and not be too concerned about the mathematical abilities of the students. (JRH)
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…
Multilevel Methods for the Poisson-Boltzmann Equation
NASA Astrophysics Data System (ADS)
Holst, Michael Jay
We consider the numerical solution of the Poisson -Boltzmann equation (PBE), a three-dimensional second order nonlinear elliptic partial differential equation arising in biophysics. This problem has several interesting features impacting numerical algorithms, including discontinuous coefficients representing material interfaces, rapid nonlinearities, and three spatial dimensions. Similar equations occur in various applications, including nuclear physics, semiconductor physics, population genetics, astrophysics, and combustion. In this thesis, we study the PBE, discretizations, and develop multilevel-based methods for approximating the solutions of these types of equations. We first outline the physical model and derive the PBE, which describes the electrostatic potential of a large complex biomolecule lying in a solvent. We next study the theoretical properties of the linearized and nonlinear PBE using standard function space methods; since this equation has not been previously studied theoretically, we provide existence and uniqueness proofs in both the linearized and nonlinear cases. We also analyze box-method discretizations of the PBE, establishing several properties of the discrete equations which are produced. In particular, we show that the discrete nonlinear problem is well-posed. We study and develop linear multilevel methods for interface problems, based on algebraic enforcement of Galerkin or variational conditions, and on coefficient averaging procedures. Using a stencil calculus, we show that in certain simplified cases the two approaches are equivalent, with different averaging procedures corresponding to different prolongation operators. We also develop methods for nonlinear problems based on a nonlinear multilevel method, and on linear multilevel methods combined with a globally convergent damped-inexact-Newton method. We derive a necessary and sufficient descent condition for the inexact-Newton direction, enabling the development of extremely
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.
Multilevel fusion exploitation
NASA Astrophysics Data System (ADS)
Lindberg, Perry C.; Dasarathy, Belur V.; McCullough, Claire L.
1996-06-01
This paper describes a project that was sponsored by the U.S. Army Space and Strategic Defense Command (USASSDC) to develop, test, and demonstrate sensor fusion algorithms for target recognition. The purpose of the project was to exploit the use of sensor fusion at all levels (signal, feature, and decision levels) and all combinations to improve target recognition capability against tactical ballistic missile (TBM) targets. These algorithms were trained with simulated radar signatures to accurately recognize selected TBM targets. The simulated signatures represent measurements made by two radars (S-band and X- band) with the targets at a variety of aspect and roll angles. Two tests were conducted: one with simulated signatures collected at angles different from those in the training database and one using actual test data. The test results demonstrate a high degree of recognition accuracy. This paper describes the training and testing techniques used; shows the fusion strategy employed; and illustrates the advantages of exploiting multi-level fusion.
NASA Astrophysics Data System (ADS)
Azmy, Y. Y.
1999-06-01
We propose preconditioning as a viable acceleration scheme for the inner iterations of transport calculations in slab geometry. In particular we develop 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 (0NIM), cast in a Weighted Diamond Difference (WDD) form, we derive AP for thick (KAP) and thin (NAP) cells that for model problems are unconditionally stable and efficient. For the First-Order Nodal Integral Method (1NIM) we derive a NAP that possesses similarly excellent spectral properties for model problems. [Note that the order of NIM refers to the truncated order of the local expansion of the cell and edge fluxes in Legendre series.] The two most attractive features of our 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. We implemented these methods, augmented with appropriate boundary conditions and mixing formulas for material heterogeneities, in the test code AP1D that we use to successfully verify the analytical spectral properties for homogeneous problems. Furthermore, we conduct numerical tests to demonstrate the robustness of the KAP and NAP in the presence of sharp mesh or material discontinuities. We show that the AP for WDD is highly resilient to such discontinuities, but for 1NIM 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.
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.
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.
NASA Astrophysics Data System (ADS)
Dankova, T. S.; Rosensteel, G.
1998-10-01
Mean field theory has an unexpected group theoretic mathematical foundation. Instead of representation theory which applies to most group theoretic quantum models, Hartree-Fock and Hartree-Fock-Bogoliubov have been formulated in terms of coadjoint orbits for the groups U(n) and O(2n). The general theory of mean fields is formulated for an arbitrary Lie algebra L of fermion operators. The moment map provides the correspondence between the Hilbert space of microscopic wave functions and the dual space L^* of densities. The coadjoint orbits of the group in the dual space are phase spaces on which time-dependent mean field theory is equivalent to a classical Hamiltonian dynamical system. Indeed it forms a finite-dimensional Lax system. The mean field theories for the Elliott SU(3) and symplectic Sp(3,R) algebras are constructed explicitly in the coadjoint orbit framework.
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.
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.
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,…
On the cohomology of Leibniz conformal algebras
NASA Astrophysics Data System (ADS)
Zhang, Jiao
2015-04-01
We construct a new cohomology complex of Leibniz conformal algebras with coefficients in a representation instead of a module. The low-dimensional cohomology groups of this complex are computed. Meanwhile, we construct a Leibniz algebra from a Leibniz conformal algebra and prove that the category of Leibniz conformal algebras is equivalent to the category of equivalence classes of formal distribution Leibniz algebras.
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. PMID:26806075
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.
Second-Order Algebraic Theories
NASA Astrophysics Data System (ADS)
Fiore, Marcelo; Mahmoud, Ola
Fiore and Hur [10] recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a formal deductive system for languages with variable binding and parameterised metavariables. This work completes the foundations of the subject from the viewpoint of categorical algebra. Specifically, the paper introduces the notion of second-order algebraic theory and develops its basic theory. Two categorical equivalences are established: at the syntactic level, that of second-order equational presentations and second-order algebraic theories; at the semantic level, that of second-order algebras and second-order functorial models. Our development includes a mathematical definition of syntactic translation between second-order equational presentations. This gives the first formalisation of notions such as encodings and transforms in the context of languages with variable binding.
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…
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 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…
2-Local derivations on matrix algebras over semi-prime Banach algebras and on AW*-algebras
NASA Astrophysics Data System (ADS)
Ayupov, Shavkat; Kudaybergenov, Karimbergen
2016-03-01
The paper is devoted to 2-local derivations on matrix algebras over unital semi-prime Banach algebras. For a unital semi-prime Banach algebra A with the inner derivation property we prove that any 2-local derivation on the algebra M 2n (A), n ≥ 2, is a derivation. We apply this result to AW*-algebras and show that any 2-local derivation on an arbitrary AW*-algebra is a derivation.
Plethystic algebras and vector symmetric functions.
Rota, G C; Stein, J A
1994-01-01
An isomorphism is established between the plethystic Hopf algebra Pleth(Super[L]) and the algebra of vector symmetric functions. The Hall inner product of symmetric function theory is extended to the Hopf algebra Pleth(Super[L]). PMID:11607504
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…
Handheld Computer Algebra Systems in the Pre-Algebra Classroom
ERIC Educational Resources Information Center
Gantz, Linda Ann Galofaro
2010-01-01
This mixed method analysis sought to investigate several aspects of student learning in pre-algebra through the use of computer algebra systems (CAS) as opposed to non-CAS learning. This research was broken into two main parts, one which compared results from both the experimental group (instruction using CAS, N = 18) and the control group…
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
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 jumpsmore » and an anisotropy in one part.« less
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.
A Programmed Course in Algebra.
ERIC Educational Resources Information Center
Mewborn, Ancel C.; Hively, Wells II
This programed textbook consists of short sections of text interspersed with questions designed to aid the student in understanding the material. The course is designed to increase the student's understanding of some of the basic ideas of algebra. Some general experience and manipulative skill with respect to high school algebra is assumed.…
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…
Gamow functionals on operator algebras
NASA Astrophysics Data System (ADS)
Castagnino, M.; Gadella, M.; Betán, R. Id; Laura, R.
2001-11-01
We obtain the precise form of two Gamow functionals representing the exponentially decaying part of a quantum resonance and its mirror image that grows exponentially, as a linear, positive and continuous functional on an algebra containing observables. These functionals do not admit normalization and, with an appropriate choice of the algebra, are time reversal of each other.
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.)
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…
ERIC Educational Resources Information Center
Instructional Objectives Exchange, Los Angeles, CA.
A complete set of behavioral objectives for first-year algebra taught in any of grades 8 through 12 is presented. Three to six sample test items and answers are provided for each objective. Objectives were determined by surveying the most used secondary school algebra textbooks. Fourteen major categories are included: (1) whole numbers--operations…
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.
Condensing Algebra for Technical Mathematics.
ERIC Educational Resources Information Center
Greenfield, Donald R.
Twenty Algebra-Packets (A-PAKS) were developed by the investigator for technical education students at the community college level. Each packet contained a statement of rationale, learning objectives, performance activities, performance test, and performance test answer key. The A-PAKS condensed the usual sixteen weeks of algebra into a six-week…
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…
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.
Multilevel light bending in nanoplasmonics
NASA Astrophysics Data System (ADS)
El Sherif, Mohamed H.; Ahmed, Osman S.; Bakr, Mohamed H.; Swillam, Mohamed A.
2014-03-01
Nanoplasmonic optical interconnects is proposed to mitigate challenges facing electronics integration. It provides fast and miniaturized data channel that overcome the diffraction limit. We present a three dimensional plasmonic coupler that vertically bends the light to multilevel circuit configurations. It exploits light guiding in nanoscale plasmonic slot waveguides (PSWs). A triangularly-shaped plasmonic slot waveguide rotator is introduced to attain such coupling with good efficiency over a wide bandwidth. Using this approach, light propagating in a horizontal direction is easily converted and coupled to propagate in the vertical direction and vice versa. The proposed configuration is further extended to the design of a multilayer power divider/combiner with ultra-compact footprint that guides the light to multiple channels. A detailed study of the triangular rotator is demonstrated with the analysis of multiple configurations. This structure is suitable for efficient coupling and splitting in multilevel nano circuit environment.
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)
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.
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.
Constraint algebra in bigravity
NASA Astrophysics Data System (ADS)
Soloviev, V. O.
2015-07-01
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.
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…
Hopf algebras and Dyson-Schwinger equations
NASA Astrophysics Data System (ADS)
Weinzierl, Stefan
2016-06-01
In this paper I discuss Hopf algebras and Dyson-Schwinger equations. This paper starts with an introduction to Hopf algebras, followed by a review of the contribution and application of Hopf algebras to particle physics. The final part of the paper is devoted to the relation between Hopf algebras and Dyson-Schwinger equations.
Two-parameter twisted quantum affine algebras
NASA Astrophysics Data System (ADS)
Jing, Naihuan; Zhang, Honglian
2016-09-01
We establish Drinfeld realization for the two-parameter twisted quantum affine algebras using a new method. The Hopf algebra structure for Drinfeld generators is given for both untwisted and twisted two-parameter quantum affine algebras, which include the quantum affine algebras as special cases.
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.
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.
GCD, LCM, and Boolean Algebra?
ERIC Educational Resources Information Center
Cohen, Martin P.; Juraschek, William A.
1976-01-01
This article investigates the algebraic structure formed when the process of finding the greatest common divisor and the least common multiple are considered as binary operations on selected subsets of positive integers. (DT)
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).
Sjaardema, G.; Gilkey, A.; Smith, M.; Forsythe, C.
2005-04-11
The ALGEBRA program allows the user to manipulate data from a finite element analysis before it is plotted. The finite element output data is in the form of variable values (e.g., stress, strain, and velocity components) in an EXODUS II database. The ALGEBRA program evaluates user-supplied functions of the data and writes the results to an output EXODUS II database that can be read by plot programs.
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.
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 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.
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…
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.
Factorial invariance in multilevel confirmatory factor analysis.
Ryu, Ehri
2014-02-01
This paper presents a procedure to test factorial invariance in multilevel confirmatory factor analysis. When the group membership is at level 2, multilevel factorial invariance can be tested by a simple extension of the standard procedure. However level-1 group membership raises problems which cannot be appropriately handled by the standard procedure, because the dependency between members of different level-1 groups is not appropriately taken into account. The procedure presented in this article provides a solution to this problem. This paper also shows Muthén's maximum likelihood (MUML) estimation for testing multilevel factorial invariance across level-1 groups as a viable alternative to maximum likelihood estimation. Testing multilevel factorial invariance across level-2 groups and testing multilevel factorial invariance across level-1 groups are illustrated using empirical examples. SAS macro and Mplus syntax are provided.
Invertible linear transformations and the Lie algebras
NASA Astrophysics Data System (ADS)
Zhang, Yufeng; Tam, Honwah; Guo, Fukui
2008-07-01
With the help of invertible linear transformations and the known Lie algebras, a way to generate new Lie algebras is given. These Lie algebras obtained have a common feature, i.e. integrable couplings of solitary hierarchies could be obtained by using them, specially, the Hamiltonian structures of them could be worked out. Some ways to construct the loop algebras of the Lie algebras are presented. It follows that some various loop algebras are given. In addition, a few new Lie algebras are explicitly constructed in terms of the classification of Lie algebras proposed by Ma Wen-Xiu, which are bases for obtaining new Lie algebras by using invertible linear transformations. Finally, some solutions of a (2 + 1)-dimensional partial-differential equation hierarchy are obtained, whose Hamiltonian form-expressions are manifested by using the quadratic-form identity.
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).
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
BRST charges for finite nonlinear algebras
NASA Astrophysics Data System (ADS)
Isaev, A. P.; Krivonos, S. O.; Ogievetsky, O. V.
2010-07-01
Some ingredients of the BRST construction for quantum Lie algebras are applied to a wider class of quadratic algebras of constraints. We build the BRST charge for a quantum Lie algebra with three generators and ghost-anti-ghosts commuting with constraints. We consider a one-parametric family of quadratic algebras with three generators and show that the BRST charge acquires the conventional form after a redefinition of ghosts. The modified ghosts form a quadratic algebra. The family possesses a nonlinear involution, which implies the existence of two independent BRST charges for each algebra in the family. These BRST charges anticommute and form a double BRST complex.
Some Remarks on Kite Pseudo Effect Algebras
NASA Astrophysics Data System (ADS)
Dvurečenskij, Anatolij; Holland, W. Charles
2014-05-01
Recently a new family of pseudo effect algebras, called kite pseudo effect algebras, was introduced. Such an algebra starts with a po-group G, a set I and with two bijections λ, ρ: I→ I. Using a clever construction on the ordinal sum of ( G +) I and ( G -) I , we can define a pseudo effect algebra which can be non-commutative even if G is an Abelian po-group. In the paper we give a characterization of subdirect product of subdirectly irreducible kite pseudo effect algebras, and we show that every kite pseudo effect algebra is an interval in a unital po-loop.
Operator product expansion algebra
Holland, Jan; Hollands, Stefan
2013-07-15
We establish conceptually important properties of the operator product expansion (OPE) in the context of perturbative, Euclidean φ{sup 4}-quantum field theory. First, we demonstrate, generalizing earlier results and techniques of hep-th/1105.3375, that the 3-point OPE,
Constructing a parasupersymmetric Virasoro algebra
NASA Astrophysics Data System (ADS)
Kuwata, S.
2011-03-01
We construct a para SUSY Virasoro algebra by generalizing the ordinary fermion in SUSY Virasoro algebra (Ramond or Neveu-Schwarz algebra) to the parafermion. First, we obtain a polynomial relation (PR) between different-mode parafermion fi's by generalizing the corresponding single-mode PR to such that is invariant under the unitary transformation of fi (Green's condition). Differently from a usual context, where the Green's condition is imposed only on the defining relation of fi (degree three with respect to fi and fi†), we impose it on any degree of PR. For the case of order-two parafermion (the simplest case of para SUSY), we calculate a PR between the parasupercharge G0, the bosonic hamiltonian LB0 and parafermionic one LF0, although it is difficult to obtain a PR between G0 and the total hamiltonian L0 (= LB0 + LF0). Finally, we construct a para SUSY Virasoro algebra by generalizing L0 to the Ln's such that form a Virasoro algebra.
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.
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.
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.
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.
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.
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.
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.
Generalized Galilean algebras and Newtonian gravity
NASA Astrophysics Data System (ADS)
González, N.; Rubio, G.; Salgado, P.; Salgado, S.
2016-04-01
The non-relativistic versions of the generalized Poincaré algebras and generalized AdS-Lorentz algebras are obtained. These non-relativistic algebras are called, generalized Galilean algebras of type I and type II and denoted by GBn and GLn respectively. Using a generalized Inönü-Wigner contraction procedure we find that the generalized Galilean algebras of type I can be obtained from the generalized Galilean algebras type II. The S-expansion procedure allows us to find the GB5 algebra from the Newton Hooke algebra with central extension. The procedure developed in Ref. [1] allows us to show that the nonrelativistic limit of the five dimensional Einstein-Chern-Simons gravity is given by a modified version of the Poisson equation. The modification could be compatible with the effects of Dark Matter, which leads us to think that Dark Matter can be interpreted as a non-relativistic limit of Dark Energy.
Motivating Activities that Lead to Algebra
ERIC Educational Resources Information Center
Menon, Ramakrishnan
2004-01-01
Four activities consisting of puzzles are introduced, which help students to recognize the strength of algebraic generalizations. They also assist them to comprehend algebraic concepts, and enable them to develop their individual puzzles and games.
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.
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. PMID:26171421
Characteristic Numbers of Matrix Lie Algebras
NASA Astrophysics Data System (ADS)
Zhang, Yu-Feng; Fan, En-Gui
2008-04-01
A notion of characteristic number of matrix Lie algebras is defined, which is devoted to distinguishing various Lie algebras that are used to generate integrable couplings of soliton equations. That is, the exact classification of the matrix Lie algebras by using computational formulas is given. Here the characteristic numbers also describe the relations between soliton solutions of the stationary zero curvature equations expressed by various Lie algebras.
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.
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.
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
New family of Maxwell like algebras
NASA Astrophysics Data System (ADS)
Concha, P. K.; Durka, R.; Merino, N.; Rodríguez, E. K.
2016-08-01
We introduce an alternative way of closing Maxwell like algebras. We show, through a suitable change of basis, that resulting algebras are given by the direct sums of the AdS and the Maxwell algebras already known in the literature. Casting the result into the S-expansion method framework ensures the straightaway construction of the gravity theories based on a found enlargement.
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…
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…
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…
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…
Computer Algebra Systems, Pedagogy, and Epistemology
ERIC Educational Resources Information Center
Bosse, Michael J.; Nandakumar, N. R.
2004-01-01
The advent of powerful Computer Algebra Systems (CAS) continues to dramatically affect curricula, pedagogy, and epistemology in secondary and college algebra classrooms. However, epistemological and pedagogical research regarding the role and effectiveness of CAS in the learning of algebra lags behind. This paper investigates concerns regarding…
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"…
Scalable Adaptive Multilevel Solvers for Multiphysics Problems
Xu, Jinchao
2014-12-01
In this project, we investigated adaptive, parallel, and multilevel methods for numerical modeling of various real-world applications, including Magnetohydrodynamics (MHD), complex fluids, Electromagnetism, Navier-Stokes equations, and reservoir simulation. First, we have designed improved mathematical models and numerical discretizaitons for viscoelastic fluids and MHD. Second, we have derived new a posteriori error estimators and extended the applicability of adaptivity to various problems. Third, we have developed multilevel solvers for solving scalar partial differential equations (PDEs) as well as coupled systems of PDEs, especially on unstructured grids. Moreover, we have integrated the study between adaptive method and multilevel methods, and made significant efforts and advances in adaptive multilevel methods of the multi-physics problems.
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.
Entropy algebras and Birkhoff factorization
NASA Astrophysics Data System (ADS)
Marcolli, Matilde; Tedeschi, Nicolas
2015-11-01
We develop notions of Rota-Baxter structures and associated Birkhoff factorizations, in the context of min-plus semirings and their thermodynamic deformations, including deformations arising from quantum information measures such as the von Neumann entropy. We consider examples related to Manin's renormalization and computation program, to Markov random fields and to counting functions and zeta functions of algebraic varieties.
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…
ERIC Educational Resources Information Center
Bosse, Michael J.; Ries, Heather; Chandler, Kayla
2012-01-01
Secondary school mathematics teachers often need to answer the "Why do we do that?" question in such a way that avoids confusion and evokes student interest. Understanding the properties of number systems can provide an avenue to better grasp algebraic structures, which in turn builds students' conceptual knowledge of secondary mathematics. This…
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
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…
ERIC Educational Resources Information Center
Oishi, Lindsay
2011-01-01
"Solve for x." While many people first encountered this enigmatic instruction in high school, the last 20 years have seen a strong push to get students to take algebra in eighth grade or even before. Today, concerns about the economy highlight a familiar worry: American eighth-graders trailed their peers in five Asian countries on the 2007 TIMSS…
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 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.
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…
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 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 national…
Kinds of Knowledge in Algebra.
ERIC Educational Resources Information Center
Lewis, Clayton
Solving equations in elementary algebra requires knowledge of the permitted operations, and knowledge of what operation to use at a given point in the solution process. While just these kinds of knowledge would be adequate for an ideal solver, human solvers appear to need and use other kinds of knowledge. First, many errors seem to indicate that…
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…
ERIC Educational Resources Information Center
Deakin, Michael A. B.
1974-01-01
Euler's famous formula, e to the (i, pi) power equals -1, is developed by a purely algebraic method that avoids the use of both trigonometry and calculus. A heuristic outline is given followed by the rigorous theory. Pedagogical considerations for classroom presentation are suggested. (LS)
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…
Math for All Learners: Algebra.
ERIC Educational Resources Information Center
Meader, Pam; Storer, Judy
This book consists of a series of activities aimed at providing a problem solving, hands-on approach so that students can experience concepts in algebra. Topics include ratio and proportion, patterns and formulas, integers, polynomials, linear equations, graphs, and probability. The activities come in the form of reproducible blackline masters…
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…
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…
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…
NASA Astrophysics Data System (ADS)
Kuipers, J.
2012-06-01
New features of the symbolic algebra package Form 4 are discussed. Most importantly, these features include polynomial factorization and polynomial gcd computation. Examples of their use are shown. One of them is an exact version of Mincer which gives answers in terms of rational polynomials and 5 master integrals.
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.
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.
Formal scattering theory by an algebraic approach
NASA Astrophysics Data System (ADS)
Alhassid, Y.; Levine, R. D.
1985-02-01
Formal scattering theory is recast in a Lie-algebraic form. The central result is an algebraic Lippmann-Schwinger equation for the wave operator from which an algebraic form of the Born series (containing only linked terms) is obtained. When a finite Lie algebra is sufficient, The Mo/ller wave operator, on the energy shell, can be solved for explicitly as an element of the corresponding group. The method is illustrated for the separable potential whose relevant algebra is found to be U(1,1).
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.
Atomic effect algebras with compression bases
Caragheorgheopol, Dan; Tkadlec, Josef
2011-01-15
Compression base effect algebras were recently introduced by Gudder [Demonstr. Math. 39, 43 (2006)]. They generalize sequential effect algebras [Rep. Math. Phys. 49, 87 (2002)] and compressible effect algebras [Rep. Math. Phys. 54, 93 (2004)]. The present paper focuses on atomic compression base effect algebras and the consequences of atoms being foci (so-called projections) of the compressions in the compression base. Part of our work generalizes results obtained in atomic sequential effect algebras by Tkadlec [Int. J. Theor. Phys. 47, 185 (2008)]. The notion of projection-atomicity is introduced and studied, and several conditions that force a compression base effect algebra or the set of its projections to be Boolean are found. Finally, we apply some of these results to sequential effect algebras and strengthen a previously established result concerning a sufficient condition for them to be Boolean.
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…
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
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 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. PMID:14566981
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.
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.
Linear algebra algorithms for divisors on an algebraic curve
NASA Astrophysics Data System (ADS)
Khuri-Makdisi, Kamal
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and matrices of size $O(g^2)\\times O(g)$. When the base field $k$ is finite, or if $C$ has a rational point over $k$, these give algorithms for working on the Jacobian of $C$ that require $O(g^4)$ field operations, arising from the Gaussian elimination. Our point of view is strongly geometric, and our representation of points on the Jacobian is fairly simple to work with; in particular, none of our algorithms involves arithmetic with polynomials. We note that our algorithms have the same asymptotic complexity for general curves as the more algebraic algorithms in Hess' 1999 Ph.D. thesis, which works with function fields as extensions of $k[x]$. However, for special classes of curves, Hess' algorithms are asymptotically more efficient than ours, generalizing other known efficient algorithms for special classes of curves, such as hyperelliptic curves (Cantor), superelliptic curves (Galbraith, Paulus, and Smart), and $C_{ab}$ curves (Harasawa and Suzuki); in all those cases, one can attain a complexity of $O(g^2)$.
Element Agglomeration Algebraic Multigrid and Upscaling Library
2015-02-11
ELAG is a serial C++ library for numerical upscaling of finite element discretizations. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equation (elliptic, hyperbolic, saddle point problems) on general unstructured mesh. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.
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.
The algebras of large N matrix mechanics
Halpern, M.B.; Schwartz, C.
1999-09-16
Extending early work, we formulate the large N matrix mechanics of general bosonic, fermionic and supersymmetric matrix models, including Matrix theory: The Hamiltonian framework of large N matrix mechanics provides a natural setting in which to study the algebras of the large N limit, including (reduced) Lie algebras, (reduced) supersymmetry algebras and free algebras. We find in particular a broad array of new free algebras which we call symmetric Cuntz algebras, interacting symmetric Cuntz algebras, symmetric Bose/Fermi/Cuntz algebras and symmetric Cuntz superalgebras, and we discuss the role of these algebras in solving the large N theory. Most important, the interacting Cuntz algebras are associated to a set of new (hidden!) local quantities which are generically conserved only at large N. A number of other new large N phenomena are also observed, including the intrinsic nonlocality of the (reduced) trace class operators of the theory and a closely related large N field identification phenomenon which is associated to another set (this time nonlocal) of new conserved quantities at large N.
2003-06-03
The ALGEBRA II program allows the user to manipulate data from a finite element analysis before it is plotted by evaluating algebraic expressions. The equation variables are dependent on the input database variable names. The finite element output data is in the form of variable values (e.g., stress, strain, and velocity components) in an EXODUS II database which can be read by plot programs. Code is written in a portable form as possible. Fortran code is written in ANSI Standard FORTRAN-77. Machine-specific routines are limited in number and are grouped together to minimize the time required to adapt them to a new system. SEACAS codes has been ported to several Unix systems.
2003-06-03
The ALGEBRA II program allows the user to manipulate data from a finite element analysis before it is plotted by evaluating algebraic expressions. The equation variables are dependent on the input database variable names. The finite element output data is in the form of variable values (e.g., stress, strain, and velocity components) in an EXODUS II database which can be read by plot programs. Code is written in a portable form as possible. Fortran codemore » is written in ANSI Standard FORTRAN-77. Machine-specific routines are limited in number and are grouped together to minimize the time required to adapt them to a new system. SEACAS codes has been ported to several Unix systems.« less
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.
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.
Winkler, Anderson M.; Webster, Matthew A.; Vidaurre, Diego; Nichols, Thomas E.; Smith, Stephen M.
2015-01-01
Under weak and reasonable assumptions, mainly that data are exchangeable under the null hypothesis, permutation tests can provide exact control of false positives and allow the use of various non-standard statistics. There are, however, various common examples in which global exchangeability can be violated, including paired tests, tests that involve repeated measurements, tests in which subjects are relatives (members of pedigrees) — any dataset with known dependence among observations. In these cases, some permutations, if performed, would create data that would not possess the original dependence structure, and thus, should not be used to construct the reference (null) distribution. To allow permutation inference in such cases, we test the null hypothesis using only a subset of all otherwise possible permutations, i.e., using only the rearrangements of the data that respect exchangeability, thus retaining the original joint distribution unaltered. In a previous study, we defined exchangeability for blocks of data, as opposed to each datum individually, then allowing permutations to happen within block, or the blocks as a whole to be permuted. Here we extend that notion to allow blocks to be nested, in a hierarchical, multi-level definition. We do not explicitly model the degree of dependence between observations, only the lack of independence; the dependence is implicitly accounted for by the hierarchy and by the permutation scheme. The strategy is compatible with heteroscedasticity and variance groups, and can be used with permutations, sign flippings, or both combined. We evaluate the method for various dependence structures, apply it to real data from the Human Connectome Project (HCP) as an example application, show that false positives can be avoided in such cases, and provide a software implementation of the proposed approach. PMID:26074200
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.…
Propensity score weighting with multilevel data.
Li, Fan; Zaslavsky, Alan M; Landrum, Mary Beth
2013-08-30
Propensity score methods are being increasingly used as a less parametric alternative to traditional regression to balance observed differences across groups in both descriptive and causal comparisons. Data collected in many disciplines often have analytically relevant multilevel or clustered structure. The propensity score, however, was developed and has been used primarily with unstructured data. We present and compare several propensity-score-weighted estimators for clustered data, including marginal, cluster-weighted, and doubly robust estimators. Using both analytical derivations and Monte Carlo simulations, we illustrate bias arising when the usual assumptions of propensity score analysis do not hold for multilevel data. We show that exploiting the multilevel structure, either parametrically or nonparametrically, in at least one stage of the propensity score analysis can greatly reduce these biases. We applied these methods to a study of racial disparities in breast cancer screening among beneficiaries of Medicare health plans.
Analysis of Phase Multilevel Recording on Microholograms
NASA Astrophysics Data System (ADS)
Ide, Tatsuro; Mikami, Hideharu; Osawa, Kentaro; Watanabe, Koichi
2011-09-01
An optical phase multilevel recording technique using a microholographic system and phase-diversity homodyne detection for enhancement of optical disc capacity is investigated. In this technique, multilevel phase signals are stored as the fringe shifts along the optical axis and recovered from the arctangent of two homodyne-detected signals. For comparison, phase signals from Blu-ray Disc read-only memory (BD-ROM) and Blu-ray Disc recordable (BD-R) media obtained by phase-diversity homodyne detection are experimentally evaluated. From the experimental results, we demonstrated that phase-diversity homodyne detection is useful for detecting the phase signal modulation of the signal beam from an optical disc. Furthermore, simulation results on microholograms indicate that phase signals from the microholograms are much more stable despite the variety of their sizes than those from BD-ROM. These results demonstrate the potential of this multilevel recording method.
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
Kumjian-Pask algebras of desourcification
NASA Astrophysics Data System (ADS)
Rosjanuardi, Rizky; Yusnitha, Isnie
2016-02-01
Kumjian-Pask algebra which was introduced by Pino, Clark, an Huef and Raeburn [1] in 2013, gives a purely algebraic version of a k-graph algebra. Rosjanuardi [2] gave necessary and sufficient condition of finitely dimensional complex Kumjian-Pask algebra of row-finite k-graph without sources. We will improve the previous results which allows us to deal with sources. We will consider Kumjian-Pask algebra for locally convex row-finite k-graph which was introduced by Clark, Flynn and an Huef [3], and use the desourcification of the graph to get conditions which characterise when the complex Kumjian-Pask algebra of locally convex row-finite k-graph is finite dimensional.
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.
Coverings of topological semi-abelian algebras
NASA Astrophysics Data System (ADS)
Mucuk, Osman; Demir, Serap
2016-08-01
In this work, we study on a category of topological semi-abelian algebras which are topological models of given an algebraic theory T whose category of models is semi-abelian; and investigate some results on the coverings of topological models of such theories yielding semi-abelian categories. We also consider the internal groupoid structure in the semi-abelian category of T-algebras, and give a criteria for the lifting of internal groupoid structure to the covering groupoids.
Multilevel transport solution of LWR reactor cores
Jose Ignacio Marquez Damian; Cassiano R.E. de Oliveira; HyeonKae Park
2008-09-01
This work presents a multilevel approach for the solution of the transport equation in typical LWR assemblies and core configurations. It is based on the second-order, even-parity formulation of the transport equation, which is solved within the framework provided by the finite element-spherical harmonics code EVENT. The performance of the new solver has been compared with that of the standard conjugate gradient solver for diffusion and transport problems on structured and unstruc-tured grids. Numerical results demonstrate the potential of the multilevel scheme for realistic reactor calculations.
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.
On Realization of Generalized Effect Algebras
NASA Astrophysics Data System (ADS)
Paseka, Jan
2012-12-01
A well-known fact is that there is a finite orthomodular lattice with an order determining set of states which is not representable in the standard quantum logic, the lattice L(H) of all closed subspaces of a separable complex Hilbert space. We show that a generalized effect algebra is representable in the operator generalized effect algebra G(H) of effects of a complex Hilbert space H iff it has an order determining set of generalized states. This extends the corresponding results for effect algebras of Riečanová and Zajac. Further, any operator generalized effect algebra G(H) possesses an order determining set of generalized states.
NASA Astrophysics Data System (ADS)
Chajda, Ivan
2014-10-01
Commutative BCI-algebras can be considered as semilattices whose sections are equipped with certain involutions. A similar view can be applied to commutative BCK-algebras. However, for general BCK-algebras a certain construction was settled by the author and J. Kühr (Miskolc Math. Notes 8:11-21, 2007) showing that they can be considered as structures essentially weaker than semilattices but still with certain involutions in sections. The aim of this paper is to involve a similar approach for BCI-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.
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.
Entanglement and algebraic independence in fermion systems
NASA Astrophysics Data System (ADS)
Benatti, Fabio; Floreanini, Roberto
2014-04-01
In the case of systems composed of identical particles, a typical instance in quantum statistical mechanics, the standard approach to separability and entanglement ought to be reformulated and rephrased in terms of correlations between operators from subalgebras localized in spatially disjoint regions. While this algebraic approach is straightforward for bosons, in the case of fermions it is subtler since one has to distinguish between micro-causality, that is the anti-commutativity of the basic creation and annihilation operators, and algebraic independence that is the commutativity of local observables. We argue that a consistent algebraic formulation of separability and entanglement should be compatible with micro-causality rather than with algebraic independence.
Some C∗-algebras which are coronas of non-C∗-Banach algebras
NASA Astrophysics Data System (ADS)
Voiculescu, Dan-Virgil
2016-07-01
We present results and motivating problems in the study of commutants of hermitian n-tuples of Hilbert space operators modulo normed ideals. In particular, the C∗-algebras which arise in this context as coronas of non-C∗-Banach algebras, the connections with normed ideal perturbations of operators, the hyponormal operators and the bidual Banach algebras one encounters are discussed.
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…
Leibniz algebras associated with some finite-dimensional representation of Diamond Lie algebra
NASA Astrophysics Data System (ADS)
Camacho, Luisa M.; Ladra, Manuel; Karimjanov, Iqboljon A.; Omirov, Bakhrom A.
2016-03-01
In this paper we classify Leibniz algebras whose associated Lie algebra is four-dimensional Diamond Lie algebra 𝕯 and the ideal generated by squares of elements is represented by one of the finite-dimensional indecomposable D-modules Un 1, Un 2 or Wn 1 or Wn 2.
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…
Displacement based multilevel structural optimization
NASA Technical Reports Server (NTRS)
Striz, Alfred G.
1995-01-01
Multidisciplinary design optimization (MDO) is expected to play a major role in the competitive transportation industries of tomorrow, i.e., in the design of aircraft and spacecraft, of high speed trains, boats, and automobiles. All of these vehicles require maximum performance at minimum weight to keep fuel consumption low and conserve resources. Here, MDO can deliver mathematically based design tools to create systems with optimum performance subject to the constraints of disciplines such as structures, aerodynamics, controls, etc. Although some applications of MDO are beginning to surface, the key to a widespread use of this technology lies in the improvement of its efficiency. This aspect is investigated here for the MDO subset of structural optimization, i.e., for the weight minimization of a given structure under size, strength, and displacement constraints. Specifically, finite element based multilevel optimization of structures (here, statically indeterminate trusses and beams for proof of concept) is performed. In the system level optimization, the design variables are the coefficients of assumed displacement functions, and the load unbalance resulting from the solution of the stiffness equations is minimized. Constraints are placed on the deflection amplitudes and the weight of the structure. In the subsystems level optimizations, the weight of each element is minimized under the action of stress constraints, with the cross sectional dimensions as design variables. This approach is expected to prove very efficient, especially for complex structures, since the design task is broken down into a large number of small and efficiently handled subtasks, each with only a small number of variables. This partitioning will also allow for the use of parallel computing, first, by sending the system and subsystems level computations to two different processors, ultimately, by performing all subsystems level optimizations in a massively parallel manner on separate
Cluster automorphism groups of cluster algebras with coefficients
NASA Astrophysics Data System (ADS)
Chang, Wen; Zhu, Bin
2016-10-01
We study the cluster automorphism group of a skew-symmetric cluster algebra with geometric coefficients. For this, we introduce the notion of gluing free cluster algebra, and show that under a weak condition the cluster automorphism group of a gluing free cluster algebra is a subgroup of the cluster automorphism group of its principal part cluster algebra (i.e. the corresponding cluster algebra without coefficients). We show that several classes of cluster algebras with coefficients are gluing free, for example, cluster algebras with principal coefficients, cluster algebras with universal geometric coefficients, and cluster algebras from surfaces (except a 4-gon) with coefficients from boundaries. Moreover, except four kinds of surfaces, the cluster automorphism group of a cluster algebra from a surface with coefficients from boundaries is isomorphic to the cluster automorphism group of its principal part cluster algebra; for a cluster algebra with principal coefficients, its cluster automorphism group is isomorphic to the automorphism group of its initial quiver.
The Structure of Parafermion Vertex Operator Algebras: General Case
NASA Astrophysics Data System (ADS)
Dong, Chongying; Wang, Qing
2010-11-01
The structure of the parafermion vertex operator algebra associated to an integrable highest weight module for any affine Kac-Moody algebra is studied. In particular, a set of generators for this algebra has been determined.
Gene algebra from a genetic code algebraic structure.
Sanchez, R; Morgado, E; Grau, R
2005-10-01
By considering two important factors involved in the codon-anticodon interactions, the hydrogen bond number and the chemical type of bases, a codon array of the genetic code table as an increasing code scale of interaction energies of amino acids in proteins was obtained. Next, in order to consecutively obtain all codons from the codon AAC, a sum operation has been introduced in the set of codons. The group obtained over the set of codons is isomorphic to the group (Z(64), +) of the integer module 64. On the Z(64)-algebra of the set of 64(N) codon sequences of length N, gene mutations are described by means of endomorphisms f:(Z(64))(N)-->(Z(64))(N). Endomorphisms and automorphisms helped us describe the gene mutation pathways. For instance, 77.7% mutations in 749 HIV protease gene sequences correspond to unique diagonal endomorphisms of the wild type strain HXB2. In particular, most of the reported mutations that confer drug resistance to the HIV protease gene correspond to diagonal automorphisms of the wild type. What is more, in the human beta-globin gene a similar situation appears where most of the single codon mutations correspond to automorphisms. Hence, in the analyses of molecular evolution process on the DNA sequence set of length N, the Z(64)-algebra will help us explain the quantitative relationships between genes.
Dirac matrices as elements of a superalgebraic matrix algebra
NASA Astrophysics Data System (ADS)
Monakhov, V. V.
2016-08-01
The paper considers a Clifford extension of the Grassmann algebra, in which operators are built from Grassmann variables and by the derivatives with respect to them. It is shown that a subalgebra which is isomorphic to the usual matrix algebra exists in this algebra, the Clifford exten-sion of the Grassmann algebra is a generalization of the matrix algebra and contains superalgebraic operators expanding matrix algebra and produces supersymmetric transformations.
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.
Multilevel Design Efficiency in Educational Effectiveness Research
ERIC Educational Resources Information Center
Cools, Wilfried; De Fraine, Bieke; Van den Noortgate, Wim; Onghena, Patrick
2009-01-01
In educational effectiveness research, multilevel data analyses are often used because research units (most frequently, pupils or teachers) are studied that are nested in groups (schools and classes). This hierarchical data structure complicates designing the study because the structure has to be taken into account when approximating the accuracy…
Engineering applications of heuristic multilevel optimization methods
NASA Technical Reports Server (NTRS)
Barthelemy, Jean-Francois M.
1988-01-01
Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.
Engineering applications of heuristic multilevel optimization methods
NASA Technical Reports Server (NTRS)
Barthelemy, Jean-Francois M.
1989-01-01
Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.
Efficiently Exploring Multilevel Data with Recursive Partitioning
ERIC Educational Resources Information Center
Martin, Daniel P.; von Oertzen, Timo; Rimm-Kaufman, Sara E.
2015-01-01
There is an increasing number of datasets with many participants, variables, or both, in education and other fields that often deal with large, multilevel data structures. Once initial confirmatory hypotheses are exhausted, it can be difficult to determine how best to explore the dataset to discover hidden relationships that could help to inform…
The Economic Cost of Homosexuality: Multilevel Analyses
ERIC Educational Resources Information Center
Baumle, Amanda K.; Poston, Dudley, Jr.
2011-01-01
This article builds on earlier studies that have examined "the economic cost of homosexuality," by using data from the 2000 U.S. Census and by employing multilevel analyses. Our findings indicate that partnered gay men experience a 12.5 percent earnings penalty compared to married heterosexual men, and a statistically insignificant earnings…
A Practical Guide to Multilevel Modeling
ERIC Educational Resources Information Center
Peugh, James L.
2010-01-01
Collecting data from students within classrooms or schools, and collecting data from students on multiple occasions over time, are two common sampling methods used in educational research that often require multilevel modeling (MLM) data analysis techniques to avoid Type-1 errors. The purpose of this article is to clarify the seven major steps…
Using Multilevel Modeling in Counseling Research
ERIC Educational Resources Information Center
Lynch, Martin F.
2012-01-01
This conceptual and practical overview of multilevel modeling (MLM) for researchers in counseling and development provides guidelines on setting up SPSS to perform MLM and an example of how to present the findings. It also provides a discussion on how counseling and developmental researchers can use MLM to address their own research questions.…
Suppressor Variables and Multilevel Mixture Modelling
ERIC Educational Resources Information Center
Darmawan, I Gusti Ngurah; Keeves, John P.
2006-01-01
A major issue in educational research involves taking into consideration the multilevel nature of the data. Since the late 1980s, attempts have been made to model social science data that conform to a nested structure. Among other models, two-level structural equation modelling or two-level path modelling and hierarchical linear modelling are two…
Single-Level and Multilevel Mediation Analysis
ERIC Educational Resources Information Center
Tofighi, Davood; Thoemmes, Felix
2014-01-01
Mediation analysis is a statistical approach used to examine how the effect of an independent variable on an outcome is transmitted through an intervening variable (mediator). In this article, we provide a gentle introduction to single-level and multilevel mediation analyses. Using single-level data, we demonstrate an application of structural…
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.
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…
Investigating Algebraic Procedures Using Discussion and Writing
ERIC Educational Resources Information Center
Harper, Jonathan; Ford, Jeffrey
2012-01-01
This study reports on the implementation of an intermediate algebra curriculum centered on a framework of student-centered questions designed to investigate algebraic procedures. Instructional activities were designed to build discourse in the small-group discussion meetings of the course. Students were assigned writing prompts to emphasize the…
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,…
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…
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
The operator algebra approach to quantum groups
Kustermans, Johan; Vaes, Stefaan
2000-01-01
A relatively simple definition of a locally compact quantum group in the C*-algebra setting will be explained as it was recently obtained by the authors. At the same time, we put this definition in the historical and mathematical context of locally compact groups, compact quantum groups, Kac algebras, multiplicative unitaries, and duality theory. PMID:10639116
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…
Solving Absolute Value Equations Algebraically and Geometrically
ERIC Educational Resources Information Center
Shiyuan, Wei
2005-01-01
The way in which students can improve their comprehension by understanding the geometrical meaning of algebraic equations or solving algebraic equation geometrically is described. Students can experiment with the conditions of the absolute value equation presented, for an interesting way to form an overall understanding of the concept.
Predicting Turkish Ninth Grade Students' Algebra Performance
ERIC Educational Resources Information Center
Erbas, Ayhan Kursat
2005-01-01
The prediction of students' achievement in algebra in eighth and ninth grades has become a research interest for practical issues of placement. A group of simple, easily accessible variables was used to predict student performance in algebra after completion of eighth grade. The three variables of school type, grade level, and previous year…
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…
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…
How To Prepare Students for Algebra.
ERIC Educational Resources Information Center
Wu, H.
2001-01-01
Suggests that no matter how much algebraic thinking is introduced in the early grades, and no matter how worthwhile this might be, the failure rate in algebra will continue unless the teaching of fractions and decimals is radically revamped. The proper study of fractions provides a ramp that leads students gently from whole number arithmetic up to…
Using the Internet To Investigate Algebra.
ERIC Educational Resources Information Center
Sherwood, Walter
The lesson plans in this book engage students by using a tool they enjoy--the Internet--to explore key concepts in algebra. Working either individually or in groups, students learn to approach algebra from a problem solving perspective. Each lesson shows learners how to use the Internet as a resource for gathering facts, data, and other…
New directions in algebraic dynamical systems
NASA Astrophysics Data System (ADS)
Schmidt, Klaus; Verbitskiy, Evgeny
2011-02-01
The logarithmic Mahler measure of certain multivariate polynomials occurs frequently as the entropy or the free energy of solvable lattice models (especially dimer models). It is also known that the entropy of an algebraic dynamical system is the logarithmic Mahler measure of the defining polynomial. The connection between the lattice models and the algebraic dynamical systems is still rather mysterious.
Classical and quantum Kummer shape algebras
NASA Astrophysics Data System (ADS)
Odzijewicz, A.; Wawreniuk, E.
2016-07-01
We study a family of integrable systems of nonlinearly coupled harmonic oscillators on the classical and quantum levels. We show that the integrability of these systems follows from their symmetry characterized by algebras, here called Kummer shape algebras. The resolution of identity for a wide class of reproducing kernels is found. A number of examples, illustrating this theory, are also presented.
Fourier theory and C∗-algebras
NASA Astrophysics Data System (ADS)
Bédos, Erik; Conti, Roberto
2016-07-01
We discuss a number of results concerning the Fourier series of elements in reduced twisted group C∗-algebras of discrete groups, and, more generally, in reduced crossed products associated to twisted actions of discrete groups on unital C∗-algebras. A major part of the article gives a review of our previous work on this topic, but some new results are also included.
Teaching Algebra to Students with Learning Disabilities
ERIC Educational Resources Information Center
Impecoven-Lind, Linda S.; Foegen, Anne
2010-01-01
Algebra is a gateway to expanded opportunities, but it often poses difficulty for students with learning disabilities. Consequently, it is essential to identify evidence-based instructional strategies for these students. The authors begin by identifying three areas of algebra difficulty experienced by students with disabilities: cognitive…
Arithmetic and Cognitive Contributions to Algebra
ERIC Educational Resources Information Center
Cirino, Paul T.; Tolar, Tammy D.; Fuchs, Lynn S.
2013-01-01
Algebra is a prerequisite for access to STEM careers and occupational success (NMAP, 2008a), yet algebra is difficult for students through high school (US DOE, 2008). Growth in children's conceptual and procedural arithmetical knowledge is reciprocal, although conceptual knowledge has more impact on procedural knowledge than the reverse…
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…
An Inquiry-Based Linear Algebra Class
ERIC Educational Resources Information Center
Wang, Haohao; Posey, Lisa
2011-01-01
Linear algebra is a standard undergraduate mathematics course. This paper presents an overview of the design and implementation of an inquiry-based teaching material for the linear algebra course which emphasizes discovery learning, analytical thinking and individual creativity. The inquiry-based teaching material is designed to fit the needs of a…
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 Geodesics on Three-Dimensional Quadrics
NASA Astrophysics Data System (ADS)
Kai, Yue
2015-12-01
By Hamilton-Jacobi method, we study the problem of algebraic geodesics on the third-order surface. By the implicit function theorem, we proved the existences of the real geodesics which are the intersections of two algebraic surfaces, and we also give some numerical examples.
ERIC Educational Resources Information Center
Rickard, Caroline
2008-01-01
Shortly after starting work for the University of Chichester in the School of Teacher Education, the author was planning a session relating to algebra and found herself inspired by an article in MT182: "Algebraic Infants" by Andrews and Sayers (2003). Based on the making of families of "Multilink" animals, Andrews and Sayers (2003) claim that…
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…
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 solve"…
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)
Modern Algebra, Mathematics: 5293.36.
ERIC Educational Resources Information Center
Edwards, Raymond J.
This guidebook covers Boolean algebra, matrices, linear transformations of the plane, characteristic values, vectors, and algebraic structures. Overall course goals and performance objectives for each unit are specified; sequencing of units and various time schedules are suggested. A sample pretest and posttest are given, and an annotated list of…
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)
Multilevel Dual Damascene copper interconnections
NASA Astrophysics Data System (ADS)
Lakshminarayanan, S.
Copper has been acknowledged as the interconnect material for future generations of ICs to overcome the bottlenecks on speed and reliability present with the current Al based wiring. A new set of challenges brought to the forefront when copper replaces aluminum, have to be met and resolved to make it a viable option. Unit step processes related to copper technology have been under development for the last few years. In this work, the application of copper as the interconnect material in multilevel structures with SiO2 as the interlevel dielectric has been explored, with emphasis on integration issues and complete process realization. Interconnect definition was achieved by the Dual Damascene approach using chemical mechanical polishing of oxide and copper. The choice of materials used as adhesion promoter/diffusion barrier included Ti, Ta and CVD TiN. Two different polish chemistries (NH4OH or HNO3 based) were used to form the interconnects. The diffusion barrier was removed during polishing (in the case of TiN) or by a post CMP etch (as with Ti or Ta). Copper surface passivation was performed using boron implantation and PECVD nitride encapsulation. The interlevel dielectric way composed of a multilayer stack of PECVD SiO2 and SixNy. A baseline process sequence which ensured the mechanical and thermal compatibility of the different unit steps was first created. A comprehensive test vehicle was designed and test structures were fabricated using the process flow developed. Suitable modifications were subsequently introduced in the sequence as and when processing problems were encountered. Electrical characterization was performed on the fabricated devices, interconnects, contacts and vias. The structures were subjected to thermal stressing to assess their stability and performance. The measurement of interconnect sheet resistances revealed lower copper loss due to dishing on samples polished using HNO3 based slurry. Interconnect resistances remained stable upto 400o
MODEL IDENTIFICATION AND COMPUTER ALGEBRA
Bollen, Kenneth A.; Bauldry, Shawn
2011-01-01
Multiequation models that contain observed or latent variables are common in the social sciences. To determine whether unique parameter values exist for such models, one needs to assess model identification. In practice analysts rely on empirical checks that evaluate the singularity of the information matrix evaluated at sample estimates of parameters. The discrepancy between estimates and population values, the limitations of numerical assessments of ranks, and the difference between local and global identification make this practice less than perfect. In this paper we outline how to use computer algebra systems (CAS) to determine the local and global identification of multiequation models with or without latent variables. We demonstrate a symbolic CAS approach to local identification and develop a CAS approach to obtain explicit algebraic solutions for each of the model parameters. We illustrate the procedures with several examples, including a new proof of the identification of a model for handling missing data using auxiliary variables. We present an identification procedure for Structural Equation Models that makes use of CAS and that is a useful complement to current methods. PMID:21769158
MODEL IDENTIFICATION AND COMPUTER ALGEBRA.
Bollen, Kenneth A; Bauldry, Shawn
2010-10-01
Multiequation models that contain observed or latent variables are common in the social sciences. To determine whether unique parameter values exist for such models, one needs to assess model identification. In practice analysts rely on empirical checks that evaluate the singularity of the information matrix evaluated at sample estimates of parameters. The discrepancy between estimates and population values, the limitations of numerical assessments of ranks, and the difference between local and global identification make this practice less than perfect. In this paper we outline how to use computer algebra systems (CAS) to determine the local and global identification of multiequation models with or without latent variables. We demonstrate a symbolic CAS approach to local identification and develop a CAS approach to obtain explicit algebraic solutions for each of the model parameters. We illustrate the procedures with several examples, including a new proof of the identification of a model for handling missing data using auxiliary variables. We present an identification procedure for Structural Equation Models that makes use of CAS and that is a useful complement to current methods.
Generalization of n-ary Nambu algebras and beyond
Ataguema, H.; Makhlouf, A.; Silvestrov, S.
2009-08-15
The aim of this paper is to introduce n-ary Hom-algebra structures generalizing the n-ary algebras of Lie type including n-ary Nambu algebras, n-ary Nambu-Lie algebras and n-ary Lie algebras, and n-ary algebras of associative type including n-ary totally associative and n-ary partially associative algebras. We provide examples of the new structures and present some properties and construction theorems. We describe the general method allowing one to obtain an n-ary Hom-algebra structure starting from an n-ary algebra and an n-ary algebra endomorphism. Several examples are derived using this process. Also we initiate investigation of classification problems for algebraic structures introduced in the article and describe all ternary three-dimensional Hom-Nambu-Lie structures with diagonal homomorphism.
Implementing abstract multigrid or multilevel methods
NASA Technical Reports Server (NTRS)
Douglas, Craig C.
1993-01-01
Multigrid methods can be formulated as an algorithm for an abstract problem that is independent of the partial differential equation, domain, and discretization method. In such an abstract setting, problems not arising from partial differential equations can be treated. A general theory exists for linear problems. The general theory was motivated by a series of abstract solvers (Madpack). The latest version was motivated by the theory. Madpack now allows for a wide variety of iterative and direct solvers, preconditioners, and interpolation and projection schemes, including user callback ones. It allows for sparse, dense, and stencil matrices. Mildly nonlinear problems can be handled. Also, there is a fast, multigrid Poisson solver (two and three dimensions). The type of solvers and design decisions (including language, data structures, external library support, and callbacks) are discussed. Based on the author's experiences with two versions of Madpack, a better approach is proposed. This is based on a mixed language formulation (C and FORTRAN + preprocessor). Reasons for not using FORTRAN, C, or C++ (individually) are given. Implementing the proposed strategy is not difficult.
Working memory, worry, and algebraic ability.
Trezise, Kelly; Reeve, Robert A
2014-05-01
Math anxiety (MA)-working memory (WM) relationships have typically been examined in the context of arithmetic problem solving, and little research has examined the relationship in other math domains (e.g., algebra). Moreover, researchers have tended to examine MA/worry separate from math problem solving activities and have used general WM tasks rather than domain-relevant WM measures. Furthermore, it seems to have been assumed that MA affects all areas of math. It is possible, however, that MA is restricted to particular math domains. To examine these issues, the current research assessed claims about the impact on algebraic problem solving of differences in WM and algebraic worry. A sample of 80 14-year-old female students completed algebraic worry, algebraic WM, algebraic problem solving, nonverbal IQ, and general math ability tasks. Latent profile analysis of worry and WM measures identified four performance profiles (subgroups) that differed in worry level and WM capacity. Consistent with expectations, subgroup membership was associated with algebraic problem solving performance: high WM/low worry>moderate WM/low worry=moderate WM/high worry>low WM/high worry. Findings are discussed in terms of the conceptual relationship between emotion and cognition in mathematics and implications for the MA-WM-performance relationship.
Weak homological dimensions and biflat Koethe algebras
Pirkovskii, A Yu
2008-06-30
The homological properties of metrizable Koethe algebras {lambda}(P) are studied. A criterion for an algebra A={lambda}(P) to be biflat in terms of the Koethe set P is obtained, which implies, in particular, that for such algebras the properties of being biprojective, biflat, and flat on the left are equivalent to the surjectivity of the multiplication operator A otimes-hat A{yields}A. The weak homological dimensions (the weak global dimension w.dg and the weak bidimension w.db) of biflat Koethe algebras are calculated. Namely, it is shown that the conditions w.db {lambda}(P)<=1 and w.dg {lambda}(P)<=1 are equivalent to the nuclearity of {lambda}(P); and if {lambda}(P) is non-nuclear, then w.dg {lambda}(P)=w.db {lambda}(P)=2. It is established that the nuclearity of a biflat Koethe algebra {lambda}(P), under certain additional conditions on the Koethe set P, implies the stronger estimate db {lambda}(P), where db is the (projective) bidimension. On the other hand, an example is constructed of a nuclear biflat Koethe algebra {lambda}(P) such that db {lambda}(P)=2 (while w.db {lambda}(P)=1). Finally, it is shown that many biflat Koethe algebras, while not being amenable, have trivial Hochschild homology groups in positive degrees (with arbitrary coefficients). Bibliography: 37 titles.
Algebraic curves of maximal cyclicity
NASA Astrophysics Data System (ADS)
Caubergh, Magdalena; Dumortier, Freddy
2006-01-01
The paper deals with analytic families of planar vector fields, studying methods to detect the cyclicity of a non-isolated closed orbit, i.e. the maximum number of limit cycles that can locally bifurcate from it. It is known that this multi-parameter problem can be reduced to a single-parameter one, in the sense that there exist analytic curves in parameter space along which the maximal cyclicity can be attained. In that case one speaks about a maximal cyclicity curve (mcc) in case only the number is considered and of a maximal multiplicity curve (mmc) in case the multiplicity is also taken into account. In view of obtaining efficient algorithms for detecting the cyclicity, we investigate whether such mcc or mmc can be algebraic or even linear depending on certain general properties of the families or of their associated Bautin ideal. In any case by well chosen examples we show that prudence is appropriate.
Inequalities, assessment and computer algebra
NASA Astrophysics Data System (ADS)
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 curricula. We consider the formal mathematical processes by which such inequalities are solved, and we consider the notation and syntax through which solutions are expressed. We review the extent to which current CAS can accurately solve these inequalities, and the form given to the solutions by the designers of this software. Finally, we discuss the functionality needed to deal with students' answers, i.e. to establish equivalence (or otherwise) of expressions representing unions of intervals. We find that while contemporary CAS accurately solve inequalities there is a wide variety of notation used.
Local Algebras of Differential Operators
NASA Astrophysics Data System (ADS)
Church, P. T.; Timourian, J. G.
2002-05-01
There is an increasing literature devoted to the study of boundary value problems using singularity theory. The resulting differential operators are typically Fredholm with index 0, defined on infinite-dimensional spaces, and they have often led to folds, cusps, and even higher-order Morin singularities. In this paper we develop some of the local algebras of germs of such differential Fredholm operators, extending the theory of the finite-dimensional case. We apply this work to nonlinear elliptic boundary value problems: in particular, we make further progress on a question proposed and initially studied by Ruf [1999, J. Differential Equations 151, 111-133]. We also make comments on several problems raised by others.
PC Basic Linear Algebra Subroutines
1992-03-09
PC-BLAS is a highly optimized version of the Basic Linear Algebra Subprograms (BLAS), a standardized set of thirty-eight routines that perform low-level operations on vectors of numbers in single and double-precision real and complex arithmetic. Routines are included to find the index of the largest component of a vector, apply a Givens or modified Givens rotation, multiply a vector by a constant, determine the Euclidean length, perform a dot product, swap and copy vectors, andmore » find the norm of a vector. The BLAS have been carefully written to minimize numerical problems such as loss of precision and underflow and are designed so that the computation is independent of the interface with the calling program. This independence is achieved through judicious use of Assembly language macros. Interfaces are provided for Lahey Fortran 77, Microsoft Fortran 77, and Ryan-McFarland IBM Professional Fortran.« less
Dunn, Erin C.; Masyn, Katherine E.; Yudron, Monica; Jones, Stephanie M.; Subramanian, S.V.
2014-01-01
The observation that features of the social environment, including family, school, and neighborhood characteristics, are associated with individual-level outcomes has spurred the development of dozens of multilevel or ecological theoretical frameworks in epidemiology, public health, psychology, and sociology, among other disciplines. Despite the widespread use of such theories in etiological, intervention, and policy studies, challenges remain in bridging multilevel theory and empirical research. This paper set out to synthesize these challenges and provide specific examples of methodological and analytical strategies researchers are using to gain a more nuanced understanding of the social determinants of psychiatric disorders, with a focus on children’s mental health. To accomplish this goal, we begin by describing multilevel theories, defining their core elements, and discussing what these theories suggest is needed in empirical work. In the second part, we outline the main challenges researchers face in translating multilevel theory into research. These challenges are presented for each stage of the research process. In the third section, we describe two methods being used as alternatives to traditional multilevel modeling techniques to better bridge multilevel theory and multilevel research. These are: (1) multilevel factor analysis and multilevel structural equation modeling; and (2) dynamic systems approaches. Through its review of multilevel theory, assessment of existing strategies, and examination of emerging methodologies, this paper offers a framework to evaluate and guide empirical studies on the social determinants of child psychiatric disorders as well as health across the lifecourse. PMID:24469555
Multilevel structured program design: formalization and applications
Glushkov, V.M.; Tseitlin, G.E.; Yushchenko, E.L.
1981-07-01
The authors present the conception of structured design grammars (SDG), which provide the basis for the MSPD method. A classification of program development methods according to top-down, bottom-up, and mixed strategy is proposed. The SDG formalism makes it possible to consider the problem of multilevel partial program verification, program transformation, and documentation generation during program development and subsequent maintenance. The MSPD method is demonstrated in application to a number of program design projects. They develop the arsenal of structured programming using MSPD method. Language and software tools constituting the basis of structured programming are considered. The problem of multilevel optimizing translation is treated in the context of the mul'tiprotsessist system oriented to automatic structured parallel programming by the MSPD method. Applications of the MSPD method to symbolic processing are considered. The process of structured design of the partran system and of software modules for mini- and microcomputers is described. 70 references.
Multilevel Inverters for Electric Vehicle Applications
Habetler, T.G.; Peng, F.Z.; Tolbert, L.M.
1998-10-22
This paper presents multilevel inverters as an application for all-electric vehicle (EV) and hybrid-electric vehicle (HEV) motor drives. Diode-clamped inverters and cascaded H-bridge inverters, (1) can generate near-sinusoidal voltages with only fundamental frequency switching; (2) have almost no electromagnetic interference (EMI) and common-mode voltage; and (3) make an EV more accessible/safer and open wiring possible for most of an EV'S power system. This paper explores the benefits and discusses control schemes of the cascade inverter for use as an EV motor drive or a parallel HEV drive and the diode-clamped inverter as a series HEV motor drive. Analytical, simulated, and experimental results show the superiority of these multilevel inverters for this new niche.
Computational modeling and multilevel cancer control interventions.
Morrissey, Joseph P; Lich, Kristen Hassmiller; Price, Rebecca Anhang; Mandelblatt, Jeanne
2012-05-01
This chapter presents an overview of computational modeling as a tool for multilevel cancer care and intervention research. Model-based analyses have been conducted at various "beneath the skin" or biological scales as well as at various "above the skin" or socioecological levels of cancer care delivery. We review the basic elements of computational modeling and illustrate its applications in four cancer control intervention areas: tobacco use, colorectal cancer screening, cervical cancer screening, and racial disparities in access to breast cancer care. Most of these models have examined cancer processes and outcomes at only one or two levels. We suggest ways these models can be expanded to consider interactions involving three or more levels. Looking forward, a number of methodological, structural, and communication barriers must be overcome to create useful computational models of multilevel cancer interventions and population health.
Multilevel Selection in Kin Selection Language.
Lehtonen, Jussi
2016-10-01
Few issues have raised more debate among evolutionary biologists than kin selection (KS) versus multilevel selection (MLS). They are formally equivalent, but use different-looking mathematical approaches, and are not causally equivalent: for a given problem KS can be a more suitable causal explanation than MLS, and vice versa. Methods for analyzing a given model from both viewpoints would therefore be valuable. I argue that there is often an easy way to achieve this: MLS can be written using the components of KS. This applies to the very general regression approach as well as to the practical evolutionarily stable strategy (ESS) maximization approach, and can hence be used to analyze many common ESS models from a multilevel perspective. I demonstrate this with example models of gamete competition and limitation. PMID:27590987
Jucys-Murphy elements for Birman-Murakami-Wenzl algebras
NASA Astrophysics Data System (ADS)
Isaev, A. P.; Ogievetsky, O. V.
2011-05-01
The Burman-Wenzl-Murakami algebra, considered as the quotient of the braid group algebra, possesses the commutative set of Jucys-Murphy elements. We show that the set of Jucys-Murphy elements is maximal commutative for the generic Birman-Wenzl-Murakami algebra and reconstruct the representation theory of the tower of Birman-Wenzl-Murakami algebras.
Kinematical superalgebras and Lie algebras of order 3
Campoamor-Stursberg, R.; Rausch de Traubenberg, M.
2008-06-15
We study and classify kinematical algebras which appear in the framework of Lie superalgebras or Lie algebras of order 3. All these algebras are related through generalized Inonue-Wigner contractions from either the orthosymplectic superalgebra or the de Sitter Lie algebra of order 3.
Becchi-Rouet-Stora-Tyutin operators for W algebras
Isaev, A. P.; Krivonos, S. O.; Ogievetsky, O. V.
2008-07-15
The study of quantum Lie algebras motivates a use of noncanonical ghosts and antighosts for nonlinear algebras, such as W-algebras. This leads, for the W{sub 3} and W{sub 3}{sup (2)} algebras, to the Becchi-Rouet-Stora-Tyutin operator having the conventional cubic form.
Multilevel resistive information storage and retrieval
Lohn, Andrew; Mickel, Patrick R.
2016-08-09
The present invention relates to resistive random-access memory (RRAM or ReRAM) systems, as well as methods of employing multiple state variables to form degenerate states in such memory systems. The methods herein allow for precise write and read steps to form multiple state variables, and these steps can be performed electrically. Such an approach allows for multilevel, high density memory systems with enhanced information storage capacity and simplified information retrieval.
Spinal deformity after multilevel osteoplastic laminotomy
Juergen, Krauss; Gloger, Harald; Soerensen, Nils; Wild, Alexander
2007-01-01
Multilevel laminectomy in children has a significant rate of postoperative spinal deformity. To decrease the incidence of this complication, the use of osteoplastic laminotomy is advocated to minimise the risk of spinal deformity by preserving the normal architecture of the spine. In this retrospective study, a 10-year series of a paediatric population undergoing multilevel osteoplastic laminotomy is reviewed to determine the incidence, especially in contrast to laminectomies, and to identify factors that affect the occurrence of spinal column deformity. Seventy patients (mean age 4.2 years) underwent multilevel osteoplastic laminotomy for congenital anomalies or removal of spinal tumours. All patients had a clinical and radiographic examination preoperatively, 12 months postoperatively and at follow-up. Mean follow-up was 5.3 years (range 3–12.6 years). Nineteen patients (27%) had a new or progressive spinal deformity. There was an increased incidence in patients who had surgery for spinal tumours (P < 0.05), surgery of the cervical spine (P < 0.01), and who had more than five levels of the spine included (P < 0.05). A review of the literature on children with multilevel laminectomy (n = 330), the incidence of spinal deformity found a significantly higher (46%) compared to our study group. This study demonstrates that osteoplastic laminotomy was found to be very effective in decreasing the incidence of spinal deformities after spinal-canal surgery for spinal-cord tumours or congenital anomalies in children and adolescents. The choice of an anatomical reconstructive surgical technique such as osteoplastic laminotomy seems to be essential to minimise secondary problems due to the surgical technique itself. Nevertheless, growing patients should be followed up for several years after the initial operation for early detection and consequent management of any possible deformity of the spinal column. PMID:17323095
Automatic Multilevel Parallelization Using OpenMP
NASA Technical Reports Server (NTRS)
Jin, Hao-Qiang; Jost, Gabriele; Yan, Jerry; Ayguade, Eduard; Gonzalez, Marc; Martorell, Xavier; Biegel, Bryan (Technical Monitor)
2002-01-01
In this paper we describe the extension of the CAPO (CAPtools (Computer Aided Parallelization Toolkit) OpenMP) parallelization support tool to support multilevel parallelism based on OpenMP directives. CAPO generates OpenMP directives with extensions supported by the NanosCompiler to allow for directive nesting and definition of thread groups. We report some results for several benchmark codes and one full application that have been parallelized using our system.
On the effectiveness of multilevel selection.
Goodnight, Charles J
2016-01-01
Experimental studies of group selection show that higher levels of selection act on indirect genetic effects, making the response to group and community selection qualitatively different from that of individual selection. This suggests that multilevel selection plays a key role in the evolution of supersocial societies. Experiments showing the effectiveness of community selection indicate that we should consider the possibility that selection among communities may be important in the evolution of supersocial species. PMID:27562604
Voltage balanced multilevel voltage source converter system
Peng, Fang Zheng; Lai, Jih-Sheng
1997-01-01
A voltage balanced multilevel converter for high power AC applications such as adjustable speed motor drives and back-to-back DC intertie of adjacent power systems. This converter provides a multilevel rectifier, a multilevel inverter, and a DC link between the rectifier and the inverter allowing voltage balancing between each of the voltage levels within the multilevel converter. The rectifier is equipped with at least one phase leg and a source input node for each of the phases. The rectifier is further equipped with a plurality of rectifier DC output nodes. The inverter is equipped with at least one phase leg and a load output node for each of the phases. The inverter is further equipped with a plurality of inverter DC input nodes. The DC link is equipped with a plurality of rectifier charging means and a plurality of inverter discharging means. The plurality of rectifier charging means are connected in series with one of the rectifier charging means disposed between and connected in an operable relationship with each adjacent pair of rectifier DC output nodes. The plurality of inverter discharging means are connected in series with one of the inverter discharging means disposed between and connected in an operable relationship with each adjacent pair of inverter DC input nodes. Each of said rectifier DC output nodes are individually electrically connected to the respective inverter DC input nodes. By this means, each of the rectifier DC output nodes and each of the inverter DC input nodes are voltage balanced by the respective charging and discharging of the rectifier charging means and the inverter discharging means.
Voltage balanced multilevel voltage source converter system
Peng, F.Z.; Lai, J.S.
1997-07-01
Disclosed is a voltage balanced multilevel converter for high power AC applications such as adjustable speed motor drives and back-to-back DC intertie of adjacent power systems. This converter provides a multilevel rectifier, a multilevel inverter, and a DC link between the rectifier and the inverter allowing voltage balancing between each of the voltage levels within the multilevel converter. The rectifier is equipped with at least one phase leg and a source input node for each of the phases. The rectifier is further equipped with a plurality of rectifier DC output nodes. The inverter is equipped with at least one phase leg and a load output node for each of the phases. The inverter is further equipped with a plurality of inverter DC input nodes. The DC link is equipped with a plurality of rectifier charging means and a plurality of inverter discharging means. The plurality of rectifier charging means are connected in series with one of the rectifier charging means disposed between and connected in an operable relationship with each adjacent pair of rectifier DC output nodes. The plurality of inverter discharging means are connected in series with one of the inverter discharging means disposed between and connected in an operable relationship with each adjacent pair of inverter DC input nodes. Each of said rectifier DC output nodes are individually electrically connected to the respective inverter DC input nodes. By this means, each of the rectifier DC output nodes and each of the inverter DC input nodes are voltage balanced by the respective charging and discharging of the rectifier charging means and the inverter discharging means. 15 figs.
Automatic Multilevel Parallelization Using OpenMP
NASA Technical Reports Server (NTRS)
Jin, Hao-Qiang; Jost, Gabriele; Yan, Jerry; Ayguade, Eduard; Gonzalez, Marc; Martorell, Xavier; Biegel, Bryan (Technical Monitor)
2002-01-01
In this paper we describe the extension of the CAPO parallelization support tool to support multilevel parallelism based on OpenMP directives. CAPO generates OpenMP directives with extensions supported by the NanosCompiler to allow for directive nesting and definition of thread groups. We report first results for several benchmark codes and one full application that have been parallelized using our system.
Imperfect Cloning Operations in Algebraic Quantum Theory
NASA Astrophysics Data System (ADS)
Kitajima, Yuichiro
2015-01-01
No-cloning theorem says that there is no unitary operation that makes perfect clones of non-orthogonal quantum states. The objective of the present paper is to examine whether an imperfect cloning operation exists or not in a C*-algebraic framework. We define a universal -imperfect cloning operation which tolerates a finite loss of fidelity in the cloned state, and show that an individual system's algebra of observables is abelian if and only if there is a universal -imperfect cloning operation in the case where the loss of fidelity is less than . Therefore in this case no universal -imperfect cloning operation is possible in algebraic quantum theory.
Multilevel sparse functional principal component analysis.
Di, Chongzhi; Crainiceanu, Ciprian M; Jank, Wolfgang S
2014-01-29
We consider analysis of sparsely sampled multilevel functional data, where the basic observational unit is a function and data have a natural hierarchy of basic units. An example is when functions are recorded at multiple visits for each subject. Multilevel functional principal component analysis (MFPCA; Di et al. 2009) was proposed for such data when functions are densely recorded. Here we consider the case when functions are sparsely sampled and may contain only a few observations per function. We exploit the multilevel structure of covariance operators and achieve data reduction by principal component decompositions at both between and within subject levels. We address inherent methodological differences in the sparse sampling context to: 1) estimate the covariance operators; 2) estimate the functional principal component scores; 3) predict the underlying curves. Through simulations the proposed method is able to discover dominating modes of variations and reconstruct underlying curves well even in sparse settings. Our approach is illustrated by two applications, the Sleep Heart Health Study and eBay auctions. PMID:24872597
Multilevel sparse functional principal component analysis
Di, Chongzhi; Crainiceanu, Ciprian M.; Jank, Wolfgang S.
2014-01-01
We consider analysis of sparsely sampled multilevel functional data, where the basic observational unit is a function and data have a natural hierarchy of basic units. An example is when functions are recorded at multiple visits for each subject. Multilevel functional principal component analysis (MFPCA; Di et al. 2009) was proposed for such data when functions are densely recorded. Here we consider the case when functions are sparsely sampled and may contain only a few observations per function. We exploit the multilevel structure of covariance operators and achieve data reduction by principal component decompositions at both between and within subject levels. We address inherent methodological differences in the sparse sampling context to: 1) estimate the covariance operators; 2) estimate the functional principal component scores; 3) predict the underlying curves. Through simulations the proposed method is able to discover dominating modes of variations and reconstruct underlying curves well even in sparse settings. Our approach is illustrated by two applications, the Sleep Heart Health Study and eBay auctions. PMID:24872597
Computational analyses of multilevel discourse comprehension.
Graesser, Arthur C; McNamara, Danielle S
2011-04-01
The proposed multilevel framework of discourse comprehension includes the surface code, the textbase, the situation model, the genre and rhetorical structure, and the pragmatic communication level. We describe these five levels when comprehension succeeds and also when there are communication misalignments and comprehension breakdowns. A computer tool has been developed, called Coh-Metrix, that scales discourse (oral or print) on dozens of measures associated with the first four discourse levels. The measurement of these levels with an automated tool helps researchers track and better understand multilevel discourse comprehension. Two sets of analyses illustrate the utility of Coh-Metrix in discourse theory and educational practice. First, Coh-Metrix was used to measure the cohesion of the text base and situation model, as well as potential extraneous variables, in a sample of published studies that manipulated text cohesion. This analysis helped us better understand what was precisely manipulated in these studies and the implications for discourse comprehension mechanisms. Second, Coh-Metrix analyses are reported for samples of narrative and science texts in order to advance the argument that traditional text difficulty measures are limited because they fail to accommodate most of the levels of the multilevel discourse comprehension framework.
A note on derivations of Murray–von Neumann algebras
Kadison, Richard V.; Liu, Zhe
2014-01-01
A Murray–von Neumann algebra is the algebra of operators affiliated with a finite von Neumann algebra. In this article, we first present a brief introduction to the theory of derivations of operator algebras from both the physical and mathematical points of view. We then describe our recent work on derivations of Murray–von Neumann algebras. We show that the “extended derivations” of a Murray–von Neumann algebra, those that map the associated finite von Neumann algebra into itself, are inner. In particular, we prove that the only derivation that maps a Murray–von Neumann algebra associated with a factor of type II1 into that factor is 0. Those results are extensions of Singer’s seminal result answering a question of Kaplansky, as applied to von Neumann algebras: The algebra may be noncommutative and may even contain unbounded elements. PMID:24469831
I CAN Learn[R] Pre-Algebra and Algebra. What Works Clearinghouse Intervention Report
ERIC Educational Resources Information Center
What Works Clearinghouse, 2009
2009-01-01
The I CAN Learn[R] Education System is an interactive, self-paced, mastery-based software system that includes the I CAN Learn[R] Fundamentals of Math (5th-6th grade math) curriculum, the I CAN Learn[R] Pre-Algebra curriculum, and the I CAN Learn[R] Algebra curriculum. College algebra credit is also available to students in participating schools…
Highest-weight representations of Brocherd`s algebras
Slansky, R.
1997-01-01
General features of highest-weight representations of Borcherd`s algebras are described. to show their typical features, several representations of Borcherd`s extensions of finite-dimensional algebras are analyzed. Then the example of the extension of affine- su(2) to a Borcherd`s algebra is examined. These algebras provide a natural way to extend a Kac-Moody algebra to include the hamiltonian and number-changing operators in a generalized symmetry structure.
On \\delta-derivations of n-ary algebras
NASA Astrophysics Data System (ADS)
Kaygorodov, Ivan B.
2012-12-01
We give a description of \\delta-derivations of (n+1)-dimensional n-ary Filippov algebras and, as a consequence, of simple finite-dimensional Filippov algebras over an algebraically closed field of characteristic zero. We also give new examples of non-trivial \\delta-derivations of Filippov algebras and show that there are no non-trivial \\delta-derivations of the simple ternary Mal'tsev algebra M_8.
Supersymmetric extension of Galilean conformal algebras
Bagchi, Arjun; Mandal, Ipsita
2009-10-15
The Galilean conformal algebra has recently been realized in the study of the nonrelativistic limit of the AdS/CFT conjecture. This was obtained by a systematic parametric group contraction of the parent relativistic conformal field theory. In this paper, we extend the analysis to include supersymmetry. We work at the level of the coordinates in superspace to construct the N=1 super-Galilean conformal algebra. One of the interesting outcomes of the analysis is that one is able to naturally extend the finite algebra to an infinite one. This looks structurally similar to the N=1 superconformal algebra in two dimensions, but is different. We also comment on the extension of our construction to cases of higher N.
Algebraic structures of sequences of numbers
NASA Astrophysics Data System (ADS)
Huang, I.-Chiau
2012-09-01
For certain sequences of numbers, commutative rings with a module structure over a non-commutative ring are constructed. Identities of these numbers are considered as realizations of algebraic relations.
Representations of filtered solvable Lie algebras
Panov, Alexander N
2012-01-31
The representation theory of filtered solvable Lie algebras is constructed. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found. Bibliography: 9 titles.
Structure of The Planar Galilean Conformal Algebra
NASA Astrophysics Data System (ADS)
Gao, Shoulan; Liu, Dong; Pei, Yufeng
2016-08-01
In this paper, we compute the low-dimensional cohomology groups of the planar Galilean conformal algebra introduced by Bagchi and Goparkumar. Consequently we determine its derivations, central extensions, and automorphisms.
Applications: Using Algebra in an Accounting Practice.
ERIC Educational Resources Information Center
Eisner, Gail A.
1994-01-01
Presents examples of algebra from the field of accounting including proportional ownership of stock, separation of a loan payment into principal and interest portions, depreciation methods, and salary withholdings computations. (MKR)
Using computer algebra and SMT solvers in algebraic biology
NASA Astrophysics Data System (ADS)
Pineda Osorio, Mateo
2014-05-01
Biologic processes are represented as Boolean networks, in a discrete time. The dynamics within these networks are approached with the help of SMT Solvers and the use of computer algebra. Software such as Maple and Z3 was used in this case. The number of stationary states for each network was calculated. The network studied here corresponds to the immune system under the effects of drastic mood changes. Mood is considered as a Boolean variable that affects the entire dynamics of the immune system, changing the Boolean satisfiability and the number of stationary states of the immune network. Results obtained show Z3's great potential as a SMT Solver. Some of these results were verified in Maple, even though it showed not to be as suitable for the problem approach. The solving code was constructed using Z3-Python and Z3-SMT-LiB. Results obtained are important in biology systems and are expected to help in the design of immune therapies. As a future line of research, more complex Boolean network representations of the immune system as well as the whole psychological apparatus are suggested.
Numerical linear algebra in data mining
NASA Astrophysics Data System (ADS)
Eldén, Lars
Ideas and algorithms from numerical linear algebra are important in several areas of data mining. We give an overview of linear algebra methods in text mining (information retrieval), pattern recognition (classification of handwritten digits), and PageRank computations for web search engines. The emphasis is on rank reduction as a method of extracting information from a data matrix, low-rank approximation of matrices using the singular value decomposition and clustering, and on eigenvalue methods for network analysis.
Vague Congruences and Quotient Lattice Implication Algebras
Qin, Xiaoyan; Xu, Yang
2014-01-01
The aim of this paper is to further develop the congruence theory on lattice implication algebras. Firstly, we introduce the notions of vague similarity relations based on vague relations and vague congruence relations. Secondly, the equivalent characterizations of vague congruence relations are investigated. Thirdly, the relation between the set of vague filters and the set of vague congruences is studied. Finally, we construct a new lattice implication algebra induced by a vague congruence, and the homomorphism theorem is given. PMID:25133207
Algebraic operator approach to gas kinetic models
NASA Astrophysics Data System (ADS)
Il'ichov, L. V.
1997-02-01
Some general properties of the linear Boltzmann kinetic equation are used to present it in the form ∂ tϕ = - Â†Âϕ with the operators ÂandÂ† possessing some nontrivial algebraic properties. When applied to the Keilson-Storer kinetic model, this method gives an example of quantum ( q-deformed) Lie algebra. This approach provides also a natural generalization of the “kangaroo model”.
Algebraic sub-structuring for electromagnetic applications
Yang, Chao; Gao, Weiguo; Bai, Zhaojun; Li, Xiaoye; Lee, Lie-Quan; Husbands, Parry; Ng, Esmond G.
2004-09-14
Algebraic sub-structuring refers to the process of applying matrix reordering and partitioning algorithms to divide a large sparse matrix into smaller submatrices from which a subset of spectral components are extracted and combined to form approximate solutions to the original problem. In this paper, we show that algebraic sub-structuring can be effectively used to solve generalized eigenvalue problems arising from the finite element analysis of an accelerator structure.
Algebra and topology for applications to physics
NASA Technical Reports Server (NTRS)
Rozhkov, S. S.
1987-01-01
The principal concepts of algebra and topology are examined with emphasis on applications to physics. In particular, attention is given to sets and mapping; topological spaces and continuous mapping; manifolds; and topological groups and Lie groups. The discussion also covers the tangential spaces of the differential manifolds, including Lie algebras, vector fields, and differential forms, properties of differential forms, mapping of tangential spaces, and integration of differential forms.
Algebraic Sub-Structuring for Electromagnetic Applications
Yang, C.; Gao, W.G.; Bai, Z.J.; Li, X.Y.S.; Lee, L.Q.; Husbands, P.; Ng, E.G.; /LBL, Berkeley /UC, Davis /SLAC
2006-06-30
Algebraic sub-structuring refers to the process of applying matrix reordering and partitioning algorithms to divide a large sparse matrix into smaller submatrices from which a subset of spectral components are extracted and combined to form approximate solutions to the original problem. In this paper, they show that algebraic sub-structuring can be effectively used to solve generalized eigenvalue problems arising from the finite element analysis of an accelerator structure.
From Atiyah Classes to Homotopy Leibniz Algebras
NASA Astrophysics Data System (ADS)
Chen, Zhuo; Stiénon, Mathieu; Xu, Ping
2016-01-01
A celebrated theorem of Kapranov states that the Atiyah class of the tangent bundle of a complex manifold X makes T X [-1] into a Lie algebra object in D + ( X), the bounded below derived category of coherent sheaves on X. Furthermore, Kapranov proved that, for a Kähler manifold X, the Dolbeault resolution {Ω^{bullet-1}(T_X^{1, 0})} of T X [-1] is an L ∞ algebra. In this paper, we prove that Kapranov's theorem holds in much wider generality for vector bundles over Lie pairs. Given a Lie pair ( L, A), i.e. a Lie algebroid L together with a Lie subalgebroid A, we define the Atiyah class α E of an A-module E as the obstruction to the existence of an A- compatible L-connection on E. We prove that the Atiyah classes α L/ A and α E respectively make L/ A[-1] and E[-1] into a Lie algebra and a Lie algebra module in the bounded below derived category {D^+(A)} , where {A} is the abelian category of left {U(A)} -modules and {U(A)} is the universal enveloping algebra of A. Moreover, we produce a homotopy Leibniz algebra and a homotopy Leibniz module stemming from the Atiyah classes of L/ A and E, and inducing the aforesaid Lie structures in {D^+(A)}.
Augustin, Christoph M.; Neic, Aurel; Liebmann, Manfred; Prassl, Anton J.; Niederer, Steven A.; Haase, Gundolf; Plank, Gernot
2016-01-01
Electromechanical (EM) models of the heart have been used successfully to study fundamental mechanisms underlying a heart beat in health and disease. However, in all modeling studies reported so far numerous simplifications were made in terms of representing biophysical details of cellular function and its heterogeneity, gross anatomy and tissue microstructure, as well as the bidirectional coupling between electrophysiology (EP) and tissue distension. One limiting factor is the employed spatial discretization methods which are not sufficiently flexible to accommodate complex geometries or resolve heterogeneities, but, even more importantly, the limited efficiency of the prevailing solver techniques which are not sufficiently scalable to deal with the incurring increase in degrees of freedom (DOF) when modeling cardiac electromechanics at high spatio-temporal resolution. This study reports on the development of a novel methodology for solving the nonlinear equation of finite elasticity using human whole organ models of cardiac electromechanics, discretized at a high para-cellular resolution. Three patient-specific, anatomically accurate, whole heart EM models were reconstructed from magnetic resonance (MR) scans at resolutions of 220 μm, 440 μm and 880 μm, yielding meshes of approximately 184.6, 24.4 and 3.7 million tetrahedral elements and 95.9, 13.2 and 2.1 million displacement DOF, respectively. The same mesh was used for discretizing the governing equations of both electrophysiology (EP) and nonlinear elasticity. A novel algebraic multigrid (AMG) preconditioner for an iterative Krylov solver was developed to deal with the resulting computational load. The AMG preconditioner was designed under the primary objective of achieving favorable strong scaling characteristics for both setup and solution runtimes, as this is key for exploiting current high performance computing hardware. Benchmark results using the 220 μm, 440 μm and 880 μm meshes demonstrate
NASA Astrophysics Data System (ADS)
Augustin, Christoph M.; Neic, Aurel; Liebmann, Manfred; Prassl, Anton J.; Niederer, Steven A.; Haase, Gundolf; Plank, Gernot
2016-01-01
Electromechanical (EM) models of the heart have been used successfully to study fundamental mechanisms underlying a heart beat in health and disease. However, in all modeling studies reported so far numerous simplifications were made in terms of representing biophysical details of cellular function and its heterogeneity, gross anatomy and tissue microstructure, as well as the bidirectional coupling between electrophysiology (EP) and tissue distension. One limiting factor is the employed spatial discretization methods which are not sufficiently flexible to accommodate complex geometries or resolve heterogeneities, but, even more importantly, the limited efficiency of the prevailing solver techniques which is not sufficiently scalable to deal with the incurring increase in degrees of freedom (DOF) when modeling cardiac electromechanics at high spatio-temporal resolution. This study reports on the development of a novel methodology for solving the nonlinear equation of finite elasticity using human whole organ models of cardiac electromechanics, discretized at a high para-cellular resolution. Three patient-specific, anatomically accurate, whole heart EM models were reconstructed from magnetic resonance (MR) scans at resolutions of 220 μm, 440 μm and 880 μm, yielding meshes of approximately 184.6, 24.4 and 3.7 million tetrahedral elements and 95.9, 13.2 and 2.1 million displacement DOF, respectively. The same mesh was used for discretizing the governing equations of both electrophysiology (EP) and nonlinear elasticity. A novel algebraic multigrid (AMG) preconditioner for an iterative Krylov solver was developed to deal with the resulting computational load. The AMG preconditioner was designed under the primary objective of achieving favorable strong scaling characteristics for both setup and solution runtimes, as this is key for exploiting current high performance computing hardware. Benchmark results using the 220 μm, 440 μm and 880 μm meshes demonstrate
Construction of N = 2 superconformal algebra from affine algebras with extended symmetry: I
NASA Astrophysics Data System (ADS)
Cheng, Shun-Jen
1995-01-01
The purpose of this Letter is to use the idea of the Sugawara-Kač-Todorov construction of the N = 0 and N = 1 superconformal algebras to construct a very simple free-field realization of the N = 2 superconformal algebra.
ERIC Educational Resources Information Center
Okpube, Nnaemeka Michael; Anugwo, M. N.
2016-01-01
This study investigated the Card Games and Algebra tic-Tacmatics on Junior Secondary II Students' Achievement in Algebraic Expressions. Three research questions and three null hypotheses guided the study. The study adopted the pre-test, post-test control group design. A total of two hundred and forty (240) Junior Secondary School II students were…
ERIC Educational Resources Information Center
Davies Gomez, Lisa
2012-01-01
Algebra is the gatekeeper of access to higher-level math and science courses, higher education and future earning opportunities. Unequal numbers of African-American males drop out of Algebra and mathematics courses and underperform on tests of mathematical competency and are thus denied both essential skills and a particularly important pathway to…
Slower Algebra Students Meet Faster Tools: Solving Algebra Word Problems with Graphing Software
ERIC Educational Resources Information Center
Yerushalmy, Michal
2006-01-01
The article discusses the ways that less successful mathematics students used graphing software with capabilities similar to a basic graphing calculator to solve algebra problems in context. The study is based on interviewing students who learned algebra for 3 years in an environment where software tools were always present. We found differences…
Generalization of Patterns: The Tension between Algebraic Thinking and Algebraic Notation.
ERIC Educational Resources Information Center
Zazkis, Rina; Liljedahl, Peter
2002-01-01
Explores the attempts of a group of preservice elementary school teachers to generalize a repeating visual number pattern. Discusses students' emergent algebraic thinking. Indicates that students' ability to express generalities verbally was not accompanied by algebraic notation, but participants often perceived complete and accurate solutions…
ERIC Educational Resources Information Center
Ormond, Christine
2012-01-01
Primary teachers play a key role in their students' future mathematical success in the early secondary years. While the word "algebra" may make some primary teachers feel uncomfortable or worried, the basic arithmetic ideas underlying algebra are vitally important for older primary students as they are increasingly required to use "algebraic…
Multilevel Higher-Order Item Response Theory Models
ERIC Educational Resources Information Center
Huang, Hung-Yu; Wang, Wen-Chung
2014-01-01
In the social sciences, latent traits often have a hierarchical structure, and data can be sampled from multiple levels. Both hierarchical latent traits and multilevel data can occur simultaneously. In this study, we developed a general class of item response theory models to accommodate both hierarchical latent traits and multilevel data. The…
Extensions of Mantel-Haenszel for Multilevel DIF Detection
ERIC Educational Resources Information Center
French, Brian F.; Finch, W. Holmes
2013-01-01
Multilevel data structures are ubiquitous in the assessment of differential item functioning (DIF), particularly in large-scale testing programs. There are a handful of DIF procures for researchers to select from that appropriately account for multilevel data structures. However, little, if any, work has been completed to extend a popular DIF…
Matching Strategies for Observational Data with Multilevel Structure
ERIC Educational Resources Information Center
Steiner, Peter M.
2011-01-01
Given the different possibilities of matching in the context of multilevel data and the lack of research on corresponding matching strategies, the author investigates two main research questions. The first research question investigates the advantages and disadvantages of different matching strategies that can be pursued with multilevel data…
Multilevel Modeling and School Psychology: A Review and Practical Example
ERIC Educational Resources Information Center
Graves, Scott L., Jr.; Frohwerk, April
2009-01-01
The purpose of this article is to provide an overview of the state of multilevel modeling in the field of school psychology. The authors provide a systematic assessment of published research of multilevel modeling studies in 5 journals devoted to the research and practice of school psychology. In addition, a practical example from the nationally…
Consequences of Unmodeled Nonlinear Effects in Multilevel Models
ERIC Educational Resources Information Center
Bauer, Daniel J.; Cai, Li
2009-01-01
Applications of multilevel models have increased markedly during the past decade. In incorporating lower-level predictors into multilevel models, a key interest is often whether or not a given predictor requires a random slope, that is, whether the effect of the predictor varies over upper-level units. If the variance of a random slope…
Alternatives to Multilevel Modeling for the Analysis of Clustered Data
ERIC Educational Resources Information Center
Huang, Francis L.
2016-01-01
Multilevel modeling has grown in use over the years as a way to deal with the nonindependent nature of observations found in clustered data. However, other alternatives to multilevel modeling are available that can account for observations nested within clusters, including the use of Taylor series linearization for variance estimation, the design…
The multilevel CC3 coupled cluster model
NASA Astrophysics Data System (ADS)
Myhre, Rolf H.; Koch, Henrik
2016-07-01
We present an efficient implementation of the closed shell multilevel coupled cluster method where coupled cluster singles and doubles (CCSD) is used for the inactive orbital space and CCSD with perturbative triples (CC3) is employed for the smaller active orbital space. Using Cholesky orbitals, the active space can be spatially localized and the computational cost is greatly reduced compared to full CC3 while retaining the accuracy of CC3 excitation energies. For the small organic molecules considered we achieve up to two orders of magnitude reduction in the computational requirements.
Multilevel converters -- A new breed of power converters
Lai, J.S.; Peng, F.Z. |
1995-09-01
Multilevel voltage source converters are emerging as a new breed of power converter options for high-power applications. The multilevel voltage source converters typically synthesize the staircase voltage wave from several levels of dc capacitor voltages. One of the major limitations of the multilevel converters is the voltage unbalance between different levels. The techniques to balance the voltage between different levels normally involve voltage clamping or capacitor charge control. There are several ways of implementing voltage balance in multilevel converters. Without considering the traditional magnetic coupled converters, this paper presents three recently developed multilevel voltage source converters: (1) diode-clamp, (2) flying-capacitors, and (3) cascaded-inverters with separate dc sources. The operating principle, features, constraints, and potential applications of these converters will be discussed.
Multilevel design optimization and the effect of epistemic uncertainty
NASA Astrophysics Data System (ADS)
Nesbit, Benjamin Edward
This work presents the state of the art in hierarchically decomposed multilevel optimization. This work is expanded with the inclusion of evidence theory with the multilevel framework for the quantification of epistemic uncertainty. The novel method, Evidence-Based Multilevel Design optimization, is then used to solve two analytical optimization problems. This method is also used to explore the effect of the belief structure on the final solution. A methodology is presented to reduce the costs of evidence-based optimization through manipulation of the belief structure. In addition, a transport aircraft wing is also solved with multilevel optimization without uncertainty. This complex, real world optimization problem shows the capability of decomposed multilevel framework to reduce costs of solving computationally expensive problems with black box analyses.
Lie algebra of conformal Killing–Yano forms
NASA Astrophysics Data System (ADS)
Ertem, Ümit
2016-06-01
We provide a generalization of the Lie algebra of conformal Killing vector fields to conformal Killing–Yano forms. A new Lie bracket for conformal Killing–Yano forms that corresponds to slightly modified Schouten–Nijenhuis bracket of differential forms is proposed. We show that conformal Killing–Yano forms satisfy a graded Lie algebra in constant curvature manifolds. It is also proven that normal conformal Killing–Yano forms in Einstein manifolds also satisfy a graded Lie algebra. The constructed graded Lie algebras reduce to the graded Lie algebra of Killing–Yano forms and the Lie algebras of conformal Killing and Killing vector fields in special cases.
Classification of central extensions of Lax operator algebras
Schlichenmaier, Martin
2008-11-18
Lax operator algebras were introduced by Krichever and Sheinman as further developments of Krichever's theory of Lax operators on algebraic curves. They are infinite dimensional Lie algebras of current type with meromorphic objects on compact Riemann surfaces (resp. algebraic curves) as elements. Here we report on joint work with Oleg Sheinman on the classification of their almost-graded central extensions. It turns out that in case that the finite-dimensional Lie algebra on which the Lax operator algebra is based on is simple there is a unique almost-graded central extension up to equivalence and rescaling of the central element.
TBGG- INTERACTIVE ALGEBRAIC GRID GENERATION
NASA Technical Reports Server (NTRS)
Smith, R. E.
1994-01-01
TBGG, Two-Boundary Grid Generation, applies an interactive algebraic grid generation technique in two dimensions. The program incorporates mathematical equations that relate the computational domain to the physical domain. TBGG has application to a variety of problems using finite difference techniques, such as computational fluid dynamics. Examples include the creation of a C-type grid about an airfoil and a nozzle configuration in which no left or right boundaries are specified. The underlying two-boundary technique of grid generation is based on Hermite cubic interpolation between two fixed, nonintersecting boundaries. The boundaries are defined by two ordered sets of points, referred to as the top and bottom. Left and right side boundaries may also be specified, and call upon linear blending functions to conform interior interpolation to the side boundaries. Spacing between physical grid coordinates is determined as a function of boundary data and uniformly spaced computational coordinates. Control functions relating computational coordinates to parametric intermediate variables that affect the distance between grid points are embedded in the interpolation formulas. A versatile control function technique with smooth cubic spline functions is also presented. The TBGG program is written in FORTRAN 77. It works best in an interactive graphics environment where computational displays and user responses are quickly exchanged. The program has been implemented on a CDC Cyber 170 series computer using NOS 2.4 operating system, with a central memory requirement of 151,700 (octal) 60 bit words. TBGG requires a Tektronix 4015 terminal and the DI-3000 Graphics Library of Precision Visuals, Inc. TBGG was developed in 1986.
A process algebra model of QED
NASA Astrophysics Data System (ADS)
Sulis, William
2016-03-01
The process algebra approach to quantum mechanics posits a finite, discrete, determinate ontology of primitive events which are generated by processes (in the sense of Whitehead). In this ontology, primitive events serve as elements of an emergent space-time and of emergent fundamental particles and fields. Each process generates a set of primitive elements, using only local information, causally propagated as a discrete wave, forming a causal space termed a causal tapestry. Each causal tapestry forms a discrete and finite sampling of an emergent causal manifold (space-time) M and emergent wave function. Interactions between processes are described by a process algebra which possesses 8 commutative operations (sums and products) together with a non-commutative concatenation operator (transitions). The process algebra possesses a representation via nondeterministic combinatorial games. The process algebra connects to quantum mechanics through the set valued process and configuration space covering maps, which associate each causal tapestry with sets of wave functions over M. Probabilities emerge from interactions between processes. The process algebra model has been shown to reproduce many features of the theory of non-relativistic scalar particles to a high degree of accuracy, without paradox or divergences. This paper extends the approach to a semi-classical form of quantum electrodynamics.
Multilevel converters for large electric drives
Tolbert, L.M.; Peng, F.Z.
1997-11-01
Traditional two-level high frequency pulse width modulation (PWM) inverters for motor drives have several problems associated with their high frequency switching which produces common-mode voltage and high voltage change (dV/dt) rates to the motor windings. Multilevel inverters solve these problems because their devices can switch at a much lower frequency. Two different multilevel topologies are identified for use as a converter for electric drives, a cascade inverter with separate dc sources and a back-to-back diode clamped converter. The cascade inverter is a natural fit for large automotive all electric drives because of the high VA ratings possible and because it uses several levels of dc voltage sources which would be available from batteries or fuel cells. The back to back diode damped converter is ideal where a source of ac voltage is available such as a hybrid electric vehicle. Simulation and experimental results show the superiority of these two converters over PWM based drives.
The treatment for multilevel noncontiguous spinal fractures
Lian, Xiao Feng; Hou, Tie Sheng; Yuan, Jian Dong; Jin, Gen Yang; Li, Zhong Hai
2006-01-01
We report the outcome of 30 patients with multilevel noncontiguous spinal fractures treated between 2000 and 2005. Ten cases were treated conservatively (group A), eight cases were operated on at only one level (group B), and 12 cases were treated surgically at both levels (group C). All cases were followed up for 14–60 months (mean 32 months). Initial mobilisation with a wheelchair or crutches in group A was 9.2±1.1 weeks, which was significantly longer than groups B and C with 6.8±0.7 weeks and 3.1±0.4 weeks, respectively. Operative time and blood loss in group C were significantly more than group B. The neurological deficit improved in six cases in group A (60%), six in group B (75%) and eight in group C (80%). Correction of kyphotic deformity was significantly superior in groups C and B at the operated level, and increasing deformity occurred in groups A and B at the non-operated level. From the results we believe that three treatment strategies were suitable for multilevel noncontiguous spinal fractures, and individualised treatment should be used in these patients. In the patients treated surgically, the clinical and radiographic outcomes are much better. PMID:17043863
Plasma simulation studies using multilevel physics models
Park, W.; Belova, E.V.; Fu, G.Y.
2000-01-19
The question of how to proceed toward ever more realistic plasma simulation studies using ever increasing computing power is addressed. The answer presented here is the M3D (Multilevel 3D) project, which has developed a code package with a hierarchy of physics levels that resolve increasingly complete subsets of phase-spaces and are thus increasingly more realistic. The rationale for the multilevel physics models is given. Each physics level is described and examples of its application are given. The existing physics levels are fluid models (3D configuration space), namely magnetohydrodynamic (MHD) and two-fluids; and hybrid models, namely gyrokinetic-energetic-particle/MHD (5D energetic particle phase-space), gyrokinetic-particle-ion/fluid-electron (5D ion phase-space), and full-kinetic-particle-ion/fluid-electron level (6D ion phase-space). Resolving electron phase-space (5D or 6D) remains a future project. Phase-space-fluid models are not used in favor of delta f particle models. A practical and accurate nonlinear fluid closure for noncollisional plasmas seems not likely in the near future.
On Fusion Algebras and Modular Matrices
NASA Astrophysics Data System (ADS)
Gannon, T.; Walton, M. A.
We consider the fusion algebras arising in e.g. Wess-Zumino-Witten conformal field theories, affine Kac-Moody algebras at positive integer level, and quantum groups at roots of unity. Using properties of the modular matrix S, we find small sets of primary fields (equivalently, sets of highest weights) which can be identified with the variables of a polynomial realization of the Ar fusion algebra at level k. We prove that for many choices of rank r and level k, the number of these variables is the minimum possible, and we conjecture that it is in fact minimal for most r and k. We also find new, systematic sources of zeros in the modular matrix S. In addition, we obtain a formula relating the entries of S at fixed points, to entries of S at smaller ranks and levels. Finally, we identify the number fields generated over the rationals by the entries of S, and by the fusion (Verlinde) eigenvalues.
Optical systolic solutions of linear algebraic equations
NASA Technical Reports Server (NTRS)
Neuman, C. P.; Casasent, D.
1984-01-01
The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.
An algebra of discrete event processes
NASA Technical Reports Server (NTRS)
Heymann, Michael; Meyer, George
1991-01-01
This report deals with an algebraic framework for modeling and control of discrete event processes. The report consists of two parts. The first part is introductory, and consists of a tutorial survey of the theory of concurrency in the spirit of Hoare's CSP, and an examination of the suitability of such an algebraic framework for dealing with various aspects of discrete event control. To this end a new concurrency operator is introduced and it is shown how the resulting framework can be applied. It is further shown that a suitable theory that deals with the new concurrency operator must be developed. In the second part of the report the formal algebra of discrete event control is developed. At the present time the second part of the report is still an incomplete and occasionally tentative working paper.
Computational algebraic geometry of epidemic models
NASA Astrophysics Data System (ADS)
Rodríguez Vega, Martín.
2014-06-01
Computational Algebraic Geometry is applied to the analysis of various epidemic models for Schistosomiasis and Dengue, both, for the case without control measures and for the case where control measures are applied. The models were analyzed using the mathematical software Maple. Explicitly the analysis is performed using Groebner basis, Hilbert dimension and Hilbert polynomials. These computational tools are included automatically in Maple. Each of these models is represented by a system of ordinary differential equations, and for each model the basic reproductive number (R0) is calculated. The effects of the control measures are observed by the changes in the algebraic structure of R0, the changes in Groebner basis, the changes in Hilbert dimension, and the changes in Hilbert polynomials. It is hoped that the results obtained in this paper become of importance for designing control measures against the epidemic diseases described. For future researches it is proposed the use of algebraic epidemiology to analyze models for airborne and waterborne diseases.
A new algebra core for the minimal form' problem
Purtill, M.R. . Center for Communications Research); Oliveira, J.S.; Cook, G.O. Jr. )
1991-12-20
The demands of large-scale algebraic computation have led to the development of many new algorithms for manipulating algebraic objects in computer algebra systems. For instance, parallel versions of many important algorithms have been discovered. Simultaneously, more effective symbolic representations of algebraic objects have been sought. Also, while some clever techniques have been found for improving the speed of the algebraic simplification process, little attention has been given to the issue of restructuring expressions, or transforming them into minimal forms.'' By minimal form,'' we mean that form of an expression that involves a minimum number of operations. In a companion paper, we introduce some new algorithms that are very effective at finding minimal forms of expressions. These algorithms require algebraic and combinatorial machinery that is not readily available in most algebra systems. In this paper we describe a new algebra core that begins to provide the necessary capabilities.
Infinitesimal deformations of naturally graded filiform Leibniz algebras
NASA Astrophysics Data System (ADS)
Khudoyberdiyev, A. Kh.; Omirov, B. A.
2014-12-01
In the present paper we describe infinitesimal deformations of complex naturally graded filiform Leibniz algebras. It is known that any n-dimensional filiform Lie algebra can be obtained by a linear integrable deformation of the naturally graded algebra Fn3(0) . We establish that in the same way any n-dimensional filiform Leibniz algebra can be obtained by an infinitesimal deformation of the filiform Leibniz algebras Fn1,Fn2and Fn3(α) . Moreover, we describe the linear integrable deformations of the above-mentioned algebras with a fixed basis of HL2 in the set of all n-dimensional Leibniz algebras. Among these deformations one new rigid algebra has been found.
Remedial Math: Its Effect on the Final Grade in Algebra.
ERIC Educational Resources Information Center
Head, L. Quinn; Lindsey, Jimmy D.
1984-01-01
The effectiveness of one remedial mathematics technique is examined. Results indicated that students who passed remedial math and then took college algebra had significantly higher final algebra grades than did undergraduates who failed remedial math. (MLW)
Geometric Algebra Software for Teaching Complex Numbers, Vectors and Spinors.
ERIC Educational Resources Information Center
Lounesto, Pertti; And Others
1990-01-01
Presents a calculator-type computer program, CLICAL, in conjunction with complex number, vector, and other geometric algebra computations. Compares the CLICAL with other symbolic programs for algebra. (Author/YP)
Rota-Baxter operators on Witt and Virasoro algebras
NASA Astrophysics Data System (ADS)
Gao, Xu; Liu, Ming; Bai, Chengming; Jing, Naihuan
2016-10-01
The homogeneous Rota-Baxter operators on the Witt and Virasoro algebras are classified. As applications, the induced solutions of the classical Yang-Baxter equation and the induced pre-Lie and PostLie algebra structures are obtained.
Shapes and stability of algebraic nuclear models
NASA Technical Reports Server (NTRS)
Lopez-Moreno, Enrique; Castanos, Octavio
1995-01-01
A generalization of the procedure to study shapes and stability of algebraic nuclear models introduced by Gilmore is presented. One calculates the expectation value of the Hamiltonian with respect to the coherent states of the algebraic structure of the system. Then equilibrium configurations of the resulting energy surface, which depends in general on state variables and a set of parameters, are classified through the Catastrophe theory. For one- and two-body interactions in the Hamiltonian of the interacting Boson model-1, the critical points are organized through the Cusp catastrophe. As an example, we apply this Separatrix to describe the energy surfaces associated to the Rutenium and Samarium isotopes.
Constraint algebra for interacting quantum systems
NASA Astrophysics Data System (ADS)
Fubini, S.; Roncadelli, M.
1988-04-01
We consider relativistic constrained systems interacting with external fields. We provide physical arguments to support the idea that the quantum constraint algebra should be the same as in the free quantum case. For systems with ordering ambiguities this principle is essential to obtain a unique quantization. This is shown explicitly in the case of a relativistic spinning particle, where our assumption about the constraint algebra plus invariance under general coordinate transformations leads to a unique S-matrix. On leave from Dipartimento di Fisica Nucleare e Teorica, Università di Pavia and INFN, I-27100 Pavia, Italy.
SLAPP: A systolic linear algebra parallel processor
Drake, B.L.; Luk, F.T.; Speiser, J.M.; Symanski, J.J.
1987-07-01
Systolic array computer architectures provide a means for fast computation of the linear algebra algorithms that form the building blocks of many signal-processing algorithms, facilitating their real-time computation. For applications to signal processing, the systolic array operates on matrices, an inherently parallel view of the data, using numerical linear algebra algorithms that have been suitably parallelized to efficiently utilize the available hardware. This article describes work currently underway at the Naval Ocean Systems Center, San Diego, California, to build a two-dimensional systolic array, SLAPP, demonstrating efficient and modular parallelization of key matric computations for real-time signal- and image-processing problems.
Nijenhuis Operators on n-Lie Algebras
NASA Astrophysics Data System (ADS)
Liu, Jie-Feng; Sheng, Yun-He; Zhou, Yan-Qiu; Bai, Cheng-Ming
2016-06-01
In this paper, we study (n - 1)-order deformations of an n-Lie algebra and introduce the notion of a Nijenhuis operator on an n-Lie algebra, which could give rise to trivial deformations. We prove that a polynomial of a Nijenhuis operator is still a Nijenhuis operator. Finally, we give various constructions of Nijenhuis operators and some examples. Supported by National Natural Science Foundation of China under Grant Nos. 11471139, 11271202, 11221091, 11425104, Specialized Research Fund for the Doctoral Program of Higher Education under Grant No. 20120031110022, and National Natural Science Foundation of Jilin Province under Grant No. 20140520054JH
Bohr model as an algebraic collective model
Rowe, D. J.; Welsh, T. A.; Caprio, M. A.
2009-05-15
Developments and applications are presented of an algebraic version of Bohr's collective model. Illustrative examples show that fully converged calculations can be performed quickly and easily for a large range of Hamiltonians. As a result, the Bohr model becomes an effective tool in the analysis of experimental data. The examples are chosen both to confirm the reliability of the algebraic collective model and to show the diversity of results that can be obtained by its use. The focus of the paper is to facilitate identification of the limitations of the Bohr model with a view to developing more realistic, computationally tractable models.
Algebraic surface design and finite element meshes
NASA Technical Reports Server (NTRS)
Bajaj, Chandrajit L.
1992-01-01
Some of the techniques are summarized which are used in constructing C sup 0 and C sup 1 continuous meshes of low degree, implicitly defined, algebraic surface patches in three dimensional space. These meshes of low degree algebraic surface patches are used to construct accurate computer models of physical objects. These meshes are also used in the finite element simulation of physical phenomena (e.g., heat dissipation, stress/strain distributions, fluid flow characteristics) required in the computer prototyping of both the manufacturability and functionality of the geometric design.
Nijenhuis Operators on n-Lie Algebras
NASA Astrophysics Data System (ADS)
Liu, Jie-Feng; Sheng, Yun-He; Zhou, Yan-Qiu; Bai, Cheng-Ming
2016-06-01
In this paper, we study (n ‑ 1)-order deformations of an n-Lie algebra and introduce the notion of a Nijenhuis operator on an n-Lie algebra, which could give rise to trivial deformations. We prove that a polynomial of a Nijenhuis operator is still a Nijenhuis operator. Finally, we give various constructions of Nijenhuis operators and some examples. Supported by National Natural Science Foundation of China under Grant Nos. 11471139, 11271202, 11221091, 11425104, Specialized Research Fund for the Doctoral Program of Higher Education under Grant No. 20120031110022, and National Natural Science Foundation of Jilin Province under Grant No. 20140520054JH
Weak Lie symmetry and extended Lie algebra
Goenner, Hubert
2013-04-15
The concept of weak Lie motion (weak Lie symmetry) is introduced. Applications given exhibit a reduction of the usual symmetry, e.g., in the case of the rotation group. In this context, a particular generalization of Lie algebras is found ('extended Lie algebras') which turns out to be an involutive distribution or a simple example for a tangent Lie algebroid. Riemannian and Lorentz metrics can be introduced on such an algebroid through an extended Cartan-Killing form. Transformation groups from non-relativistic mechanics and quantum mechanics lead to such tangent Lie algebroids and to Lorentz geometries constructed on them (1-dimensional gravitational fields).
[Applying multilevel models in evaluation of bioequivalence (I)].
Liu, Qiao-lan; Shen, Zhuo-zhi; Chen, Feng; Li, Xiao-song; Yang, Min
2009-12-01
This study aims to explore the application value of multilevel models for bioequivalence evaluation. Using a real example of 2 x 4 cross-over experimental design in evaluating bioequivalence of antihypertensive drug, this paper explores complex variance components corresponding to criteria statistics in existing methods recommended by FDA but obtained in multilevel models analysis. Results are compared with those from FDA standard Method of Moments, specifically on the feasibility and applicability of multilevel models in directly assessing the bioequivalence (ABE), the population bioequivalence (PBE) and the individual bioequivalence (IBE). When measuring ln (AUC), results from all variance components of the test and reference groups such as total variance (sigma(TT)(2) and sigma(TR)(2)), between-subject variance (sigma(BT)(2) and sigma(BR)(2)) and within-subject variance (sigma(WT)(2) and sigma(WR)(2)) estimated by simple 2-level models are very close to those that using the FDA Method of Moments. In practice, bioequivalence evaluation can be carried out directly by multilevel models, or by FDA criteria, based on variance components estimated from multilevel models. Both approaches produce consistent results. Multilevel models can be used to evaluate bioequivalence in cross-over test design. Compared to FDA methods, this one is more flexible in decomposing total variance into sub components in order to evaluate the ABE, PBE and IBE. Multilevel model provides a new way into the practice of bioequivalence evaluation.
Evolution of Multilevel Social Systems in Nonhuman Primates and Humans.
Grueter, Cyril C; Chapais, Bernard; Zinner, Dietmar
2012-10-01
Multilevel (or modular) societies are a distinct type of primate social system whose key features are single-male-multifemale, core units nested within larger social bands. They are not equivalent to fission-fusion societies, with the latter referring to routine variability in associations, either on an individual or subunit level. The purpose of this review is to characterize and operationalize multilevel societies and to outline their putative evolutionary origins. Multilevel societies are prevalent in three primate clades: papionins, Asian colobines, and hominins. For each clade, we portray the most parsimonious phylogenetic pathway leading to a modular system and then review and discuss likely socioecological conditions promoting the establishment and maintenance of these societies. The multilevel system in colobines (most notably Rhinopithecus and Nasalis) has likely evolved as single-male harem systems coalesced, whereas the multilevel system of papionins (Papio hamadryas, Theropithecus gelada) and hominins most likely arose as multimale-multifemale groups split into smaller units. We hypothesize that, although ecological conditions acted as preconditions for the origin of multilevel systems in all three clades, a potentially important catalyst was intraspecific social threat, predominantly bachelor threat in colobines and female coercion/infanticide in papionins and humans. We emphasize that female transfers within bands or genetic relationships among leader males help to maintain modular societies by facilitating interunit tolerance. We still lack a good or even basic understanding of many facets of multilevel sociality. Key remaining questions are how the genetic structure of a multilevel society matches the observed social effort of its members, to what degree cooperation of males of different units is manifest and contributes to band cohesion, and how group coordination, communication, and decision making are achieved. Affiliative and cooperative
Evolution of a Teaching Approach for Beginning Algebra
ERIC Educational Resources Information Center
Banerjee, Rakhi; Subramaniam, K.
2012-01-01
The article reports aspects of the evolution of a teaching approach over repeated trials for beginning symbolic algebra. The teaching approach emphasized the structural similarity between arithmetic and algebraic expressions and aimed at supporting students in making a transition from arithmetic to beginning algebra. The study was conducted with…
Abstract Numeric Relations and the Visual Structure of Algebra
ERIC Educational Resources Information Center
Landy, David; Brookes, David; Smout, Ryan
2014-01-01
Formal algebras are among the most powerful and general mechanisms for expressing quantitative relational statements; yet, even university engineering students, who are relatively proficient with algebraic manipulation, struggle with and often fail to correctly deploy basic aspects of algebraic notation (Clement, 1982). In the cognitive tradition,…
The Algebra Initiative Colloquium. Volume 2: Working Group Papers.
ERIC Educational Resources Information Center
Lacampagne, Carole B., Ed.; And Others
This volume presents recommendations from four working groups at a conference on reform in algebra held in Leesburg, Virginia, December 9-12, 1993. Working Group 1: Creating an Appropriate Algebra Experience for All Grades K-12 Students produced the following papers: (1) "Report" (A. H. Schoenfeld); (2) "Five Questions About Algebra Reform (and a…
Should College Algebra be a Prerequisite for Taking Psychology Statistics?
ERIC Educational Resources Information Center
Sibulkin, Amy E.; Butler, J. S.
2008-01-01
In order to consider whether a course in college algebra should be a prerequisite for taking psychology statistics, we recorded students' grades in elementary psychology statistics and in college algebra at a 4-year university. Students who earned credit in algebra prior to enrolling in statistics for the first time had a significantly higher mean…
Static friction, differential algebraic systems and numerical stability
NASA Astrophysics Data System (ADS)
Chen, Jian; Schinner, Alexander; Matuttis, Hans-Georg
We show how Differential Algebraic Systems (Ordinary Differential Equations with algebraic constraints) in mechanics are affected by stability issues and we implement Lubich's projection method to reduce the error to practically zero. Then, we explain how the "numerically exact" implementation for static friction by Differential Algebraic Systems can be stabilized. We conclude by comparing the corresponding steps in the "Contact mechanics" introduced by Moreau.
Supersymmetry algebra cohomology. I. Definition and general structure
Brandt, Friedemann
2010-12-15
This paper concerns standard supersymmetry algebras in diverse dimensions, involving bosonic translational generators and fermionic supersymmetry generators. A cohomology related to these supersymmetry algebras, termed supersymmetry algebra cohomology, and corresponding 'primitive elements' are defined by means of a BRST (Becchi-Rouet-Stora-Tyutin)-type coboundary operator. A method to systematically compute this cohomology is outlined and illustrated by simple examples.
Supersymmetry algebra cohomology. I. Definition and general structure
NASA Astrophysics Data System (ADS)
Brandt, Friedemann
2010-12-01
This paper concerns standard supersymmetry algebras in diverse dimensions, involving bosonic translational generators and fermionic supersymmetry generators. A cohomology related to these supersymmetry algebras, termed supersymmetry algebra cohomology, and corresponding "primitive elements" are defined by means of a BRST (Becchi-Rouet-Stora-Tyutin)-type coboundary operator. A method to systematically compute this cohomology is outlined and illustrated by simple examples.
Placement Tools for Developmental Mathematics and Intermediate Algebra
ERIC Educational Resources Information Center
Donovan, William J.; Wheland, Ethel R.
2008-01-01
This paper investigates the placement of students at an urban Ohio college campus in developmental mathematics and Intermediate Algebra courses. We have found that the ACT Mathematics and COMPASS Domain I (Algebra) Placement scores both correlate well with success in the Intermediate Algebra course and that, although females have lower placement…
Effectiveness of Cognitive Tutor Algebra I at Scale
ERIC Educational Resources Information Center
Pane, John F.; Griffin, Beth Ann; McCaffrey, Daniel F.; Karam, Rita
2014-01-01
This article examines the effectiveness of a technology-based algebra curriculum in a wide variety of middle schools and high schools in seven states. Participating schools were matched into similar pairs and randomly assigned to either continue with the current algebra curriculum for 2 years or to adopt Cognitive Tutor Algebra I (CTAI), which…
The Algebra Initiative Colloquium. Volume 1: Plenary and Reactor Papers.
ERIC Educational Resources Information Center
Lacampagne, Carole B., Ed.; And Others
This volume contains the plenary or reactor papers presented at a conference on reform in algebra held in Leesburg, Virginia, December 9-12, 1993. Papers included are: (1) "Introduction" (C. B. Lacampagne); (2) "Summary" (C. B. Lacampagne); (3) "Recommendations" (C. B. Lacampagne); (4) "The Development of Algebra and Algebra Education" (V. J.…
The Ideas of Algebra, K-12. 1988 Yearbook.
ERIC Educational Resources Information Center
Coxford, Arthur F., Ed.; Shulte, Albert P., Ed.
This volume is organized into six parts. Chapters 1-5, which make up Part 1, first discuss the forces impinging on algebra in the curriculum and suggest possible directions for change. Chapters 6-8, Part 2, concentrate on concepts and teaching possibilities available prior to the formal introduction of algebra. The notion that algebraic ideas are…
Assessing Mathematics Automatically Using Computer Algebra and the Internet
ERIC Educational Resources Information Center
Sangwin, Chris
2004-01-01
This paper reports some recent developments in mathematical computer-aided assessment which employs computer algebra to evaluate students' work using the Internet. Technical and educational issues raised by this use of computer algebra are addressed. Working examples from core calculus and algebra which have been used with first year university…
Discrete fluorescent saturation regimes in multilevel systems
NASA Technical Reports Server (NTRS)
Kastner, S. O.; Bhatia, A. K.
1988-01-01
Using models of multilevel atoms, the fluorescent process was examined for the ratio of the photooxidation rate, Pij, to the collisional oxidation rate, Cij, in the pumped resonance transition i-j. It is shown that, in the full range of the parameter Pij/Cij, there exist three distinct regimes (I, II, and III) which may be usefully exploited. These regimes are defined, respectively, by the following conditions: Pij/Cij smaller than about 1; Pij/Cij much greater than 1 and Pij much lower than Cki; and Pij/Cij much greater than 1 and Pij much higher than Cki, where Cki is the collisional rate populating the source level i. The only regime which is characterized by the sensitivity of fluorescent-fluorescent line intensity ratios to Pij is regime I. If regime III is reached, even fluorescent-nonfluorescent line ratios become independent of Pij. The analysis is applied to the resonant photoexcitation of a carbonlike ion.
Multilevel wireless capsule endoscopy video segmentation
NASA Astrophysics Data System (ADS)
Hwang, Sae; Celebi, M. Emre
2010-03-01
Wireless Capsule Endoscopy (WCE) is a relatively new technology (FDA approved in 2002) allowing doctors to view most of the small intestine. WCE transmits more than 50,000 video frames per examination and the visual inspection of the resulting video is a highly time-consuming task even for the experienced gastroenterologist. Typically, a medical clinician spends one or two hours to analyze a WCE video. To reduce the assessment time, it is critical to develop a technique to automatically discriminate digestive organs and shots each of which consists of the same or similar shots. In this paper a multi-level WCE video segmentation methodology is presented to reduce the examination time.
Cantilevered multilevel LIGA devices and methods
Morales, Alfredo Martin; Domeier, Linda A.
2002-01-01
In the formation of multilevel LIGA microstructures, a preformed sheet of photoresist material, such as polymethylmethacrylate (PMMA) is patterned by exposure through a mask to radiation, such as X-rays, and developed using a developer to remove the exposed photoresist material. A first microstructure is then formed by electroplating metal into the areas from which the photoresist has been removed. Additional levels of microstructure are added to the initial microstructure by covering the first microstructure with a conductive polymer, machining the conductive polymer layer to reveal the surface of the first microstructure, sealing the conductive polymer and surface of the first microstructure with a metal layer, and then forming the second level of structure on top of the first level structure. In such a manner, multiple layers of microstructure can be built up to allow complex cantilevered microstructures to be formed.
Multi-level coupled cluster theory
Myhre, Rolf H.; Koch, Henrik; Sánchez de Merás, Alfredo M. J.
2014-12-14
We present a general formalism where different levels of coupled cluster theory can be applied to different parts of the molecular system. The system is partitioned into subsystems by Cholesky decomposition of the one-electron Hartree-Fock density matrix. In this way the system can be divided across chemical bonds without discontinuities arising. The coupled cluster wave function is defined in terms of cluster operators for each part and these are determined from a set of coupled equations. The total wave function fulfills the Pauli-principle across all borders and levels of electron correlation. We develop the associated response theory for this multi-level coupled cluster theory and present proof of principle applications. The formalism is an essential tool in order to obtain size-intensive complexity in the calculation of local molecular properties.
Multilevel library instruction for emerging nursing roles.
Francis, B W; Fisher, C C
1995-01-01
As new nursing roles emerge that involve greater decision making than in the past, added responsibility for outcomes and cost control, and increased emphasis on primary care, the information-seeking skills needed by nurses change. A search of library and nursing literature indicates that there is little comprehensive library instruction covering all levels of nursing programs: undergraduate, returning registered nurses, and graduate students. The University of Florida is one of the few places that has such a multilevel, course-integrated curriculum in place for all entrants into the nursing program. Objectives have been developed for each stage of learning. The courses include instruction in the use of the online public access catalog, printed resources, and electronic databases. A library classroom equipped with the latest technology enables student interaction with electronic databases. This paper discusses the program and several methods used to evaluate it. PMID:8547913
Multilevel library instruction for emerging nursing roles.
Francis, B W; Fisher, C C
1995-10-01
As new nursing roles emerge that involve greater decision making than in the past, added responsibility for outcomes and cost control, and increased emphasis on primary care, the information-seeking skills needed by nurses change. A search of library and nursing literature indicates that there is little comprehensive library instruction covering all levels of nursing programs: undergraduate, returning registered nurses, and graduate students. The University of Florida is one of the few places that has such a multilevel, course-integrated curriculum in place for all entrants into the nursing program. Objectives have been developed for each stage of learning. The courses include instruction in the use of the online public access catalog, printed resources, and electronic databases. A library classroom equipped with the latest technology enables student interaction with electronic databases. This paper discusses the program and several methods used to evaluate it. PMID:8547913
Structural optimization by generalized, multilevel decomposition
NASA Technical Reports Server (NTRS)
Sobieszczanski-Sobieski, J.; James, B. B.; Riley, M. F.
1985-01-01
The developments toward a general multilevel optimization capability and results for a three-level structural optimization are described. The method partitions a structure into a number of substructuring levels where each substructure corresponds to a subsystem in the general case of an engineering system. The method is illustrated by a portal framework that decomposes into individual beams. Each beam is a box that can be further decomposed into stiffened plates. Substructuring for this example spans three different levels: (1) the bottom level of finite elements representing the plates; (2) an intermediate level of beams treated as substructures; and (3) the top level for the assembled structure. The three-level case is now considered to be qualitatively complete.
Solving Our Algebra Problem: Getting All Students through Algebra I to Improve Graduation Rates
ERIC Educational Resources Information Center
Schachter, Ron
2013-01-01
graduation as well as admission to most colleges. But taking algebra also can turn into a pathway for failure, from which some students never recover. In 2010, a national U.S. Department of Education study…
ERIC Educational Resources Information Center
Nomi, Takako; Raudenbush, Stephen W.
2014-01-01
Algebra is often considered as a gateway for later achievement. A recent report by the Mathematics Advisory Panel (2008) underscores the importance of improving algebra learning in secondary school. Today, a growing number of states and districts require algebra for all students in ninth grade or earlier. Chicago is at the forefront of this…
ERIC Educational Resources Information Center
Falcon, Raymond
2009-01-01
Teachers use action research in order to improve their teaching and student learning. This action research will analyze students' algebraic reasoning in finding values of variables in systems of equations pictorially and algebraically. This research will look at students solving linear systems of equations without knowing the algebraic algorithms.…
Using Technology to Balance Algebraic Explorations
ERIC Educational Resources Information Center
Kurz, Terri L.
2013-01-01
In 2000, the "National Council of Teachers of Mathematics" recommended that Algebra Standards, "instructional programs from prekindergarten through grade 12 should enable all students to use mathematical models to represent and understand quantitative relationships." In this article, the authors suggest the "Balance"…
Stability of Linear Equations--Algebraic Approach
ERIC Educational Resources Information Center
Cherif, Chokri; Goldstein, Avraham; Prado, Lucio M. G.
2012-01-01
This article could be of interest to teachers of applied mathematics as well as to people who are interested in applications of linear algebra. We give a comprehensive study of linear systems from an application point of view. Specifically, we give an overview of linear systems and problems that can occur with the computed solution when the…
Constructive Learning in Undergraduate Linear Algebra
ERIC Educational Resources Information Center
Chandler, Farrah Jackson; Taylor, Dewey T.
2008-01-01
In this article we describe a project that we used in our undergraduate linear algebra courses to help our students successfully master fundamental concepts and definitions and generate interest in the course. We describe our philosophy and discuss the projects overall success.
Modules as Learning Tools in Linear Algebra
ERIC Educational Resources Information Center
Cooley, Laurel; Vidakovic, Draga; Martin, William O.; Dexter, Scott; Suzuki, Jeff; Loch, Sergio
2014-01-01
This paper reports on the experience of STEM and mathematics faculty at four different institutions working collaboratively to integrate learning theory with curriculum development in a core undergraduate linear algebra context. The faculty formed a Professional Learning Community (PLC) with a focus on learning theories in mathematics and…
Noise limitations in optical linear algebra processors.
Batsell, S G; Jong, T L; Walkup, J F; Krile, T F
1990-05-10
A general statistical noise model is presented for optical linear algebra processors. A statistical analysis which includes device noise, the multiplication process, and the addition operation is undertaken. We focus on those processes which are architecturally independent. Finally, experimental results which verify the analytical predictions are also presented.
A Microcomputer Lab for Algebra & Calculus.
ERIC Educational Resources Information Center
Avery, Chris; And Others
An overview is provided of De Anza College's use of computerized instruction in its mathematics courses. After reviewing the ways in which computer technology is changing math instruction, the paper looks at the use of computers in several course sequences. The instructional model for the algebra sequence is based on a large group format of…
Representable states on quasilocal quasi *-algebras
Bagarello, F.; Trapani, C.; Triolo, S.
2011-01-15
Continuing a previous analysis originally motivated by physics, we consider representable states on quasilocal quasi *-algebras, starting with examining the possibility for a compatible family of local states to give rise to a global state. Some properties of local modifications of representable states and some aspects of their asymptotic behavior are also considered.
Applications of Maple To Algebraic Cryptography.
ERIC Educational Resources Information Center
Sigmon, Neil P.
1997-01-01
Demonstrates the use of technology to enhance the appreciation of applications involving abstract algebra. The symbolic manipulator Maple can perform computations required for a linear cryptosystem. One major benefit of this process is that students can encipher and decipher messages using a linear cryptosystem without becoming confused and…
I Teach Economics, Not Algebra and Calculus
ERIC Educational Resources Information Center
Hey, John D.
2005-01-01
Most people learn to drive without knowing how the engine works. In a similar vein, the author believes that students can learn economics without knowing the algebra and calculus underlying the results. If instructors follow the philosophy of other economics courses in using graphs to illustrate the results, and draw the graphs accurately, then…
Remedial Math and College Algebra Grades.
ERIC Educational Resources Information Center
Head, L. Quinn
This investigation tried to determine if a statistically significant relationship exists between different sequences of enrollment in remedial mathematics and grades obtained in college algebra classes at Jacksonville State University. Groups consisting of five different enrollment sequences in mathematics were studied. The data collected supports…
On a Equation in Finite Algebraically Structures
ERIC Educational Resources Information Center
Valcan, Dumitru
2013-01-01
Solving equations in finite algebraically structures (semigroups with identity, groups, rings or fields) many times is not easy. Even the professionals can have trouble in such cases. Therefore, in this paper we proposed to solve in the various finite groups or fields, a binomial equation of the form (1). We specify that this equation has been…
Hypercontractivity in finite-dimensional matrix algebras
Junge, Marius; Palazuelos, Carlos
2015-02-15
We obtain hypercontractivity estimates for a large class of semigroups defined on finite-dimensional matrix algebras M{sub n}. These semigroups arise from Poisson-like length functions ψ on ℤ{sub n} × ℤ{sub n} and provide new hypercontractive families of quantum channels when ψ is conditionally negative. We also study the optimality of our estimates.
A Linear Algebra Measure of Cluster Quality.
ERIC Educational Resources Information Center
Mather, Laura A.
2000-01-01
Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)
The geometric semantics of algebraic quantum mechanics.
Cruz Morales, John Alexander; Zilber, Boris
2015-08-01
In this paper, we will present an ongoing project that aims to use model theory as a suitable mathematical setting for studying the formalism of quantum mechanics. We argue that this approach provides a geometric semantics for such a formalism by means of establishing a (non-commutative) duality between certain algebraic and geometric objects.
Fundamental Theorems of Algebra for the Perplexes
ERIC Educational Resources Information Center
Poodiak, Robert; LeClair, Kevin
2009-01-01
The fundamental theorem of algebra for the complex numbers states that a polynomial of degree n has n roots, counting multiplicity. This paper explores the "perplex number system" (also called the "hyperbolic number system" and the "spacetime number system") In this system (which has extra roots of +1 besides the usual [plus or minus]1 of the…
Proof in Algebra: Reasoning beyond Examples
ERIC Educational Resources Information Center
Otten, Samuel; Herbel-Eisenmann, Beth A.; Males, Lorraine M.
2010-01-01
The purpose of this article is to provide an image of what proof could look like in beginning algebra, a course that nearly every secondary school student encounters. The authors present an actual classroom vignette in which a rich opportunity for student reasoning arose. After analyzing the proof schemes at play, the authors provide a…
Titration Calculations with Computer Algebra Software
ERIC Educational Resources Information Center
Lachance, Russ; Biaglow, Andrew
2012-01-01
This article examines the symbolic algebraic solution of the titration equations for a diprotic acid, as obtained using "Mathematica," "Maple," and "Mathcad." The equilibrium and conservation equations are solved symbolically by the programs to eliminate the approximations that normally would be performed by the student. Of the three programs,…
Window of Opportunity? Adolescence, Music, and Algebra
ERIC Educational Resources Information Center
Helmrich, Barbara H.
2010-01-01
Research has suggested that musicians process music in the same cortical regions that adolescents process algebra. An early adolescence synaptogenesis might present a window of opportunity during middle school for music to create and strengthen enduring neural connections in those regions. Six school districts across Maryland provided scores from…
Private quantum subsystems and quasiorthogonal operator algebras
NASA Astrophysics Data System (ADS)
Levick, Jeremy; Jochym-O'Connor, Tomas; Kribs, David W.; Laflamme, Raymond; Pereira, Rajesh
2016-03-01
We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the n-qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these quantum privacy investigations with the theory of quasiorthogonal operator algebras through the use of tools from group theory and operator theory.
Expansion of real numbers by algebraic numbers
NASA Astrophysics Data System (ADS)
Hajime, Kaneko
2008-01-01
In this paper we represent the fractional part of ξαn, where ξ is a nonzero real number and α is an algebraic number. By using this representation, we give new lower bounds for the distance from ξαn to the nearest integer.
Mathematics: Algebra and Geometry. GED Scoreboost.
ERIC Educational Resources Information Center
Hoyt, Cathy
GED "Scoreboost" materials target exactly the skills one needs to pass the General Educational Development (GED) tests. This book focuses on the GED Mathematics test. To prepare for the test, the test taker needs to learn skills in number and operation sense, data and statistics, geometry and measurement, and algebra. To pass the test, the test…
Invariant algebraic surfaces for a virus dynamics
NASA Astrophysics Data System (ADS)
Valls, Claudia
2015-08-01
In this paper, we provide a complete classification of the invariant algebraic surfaces and of the rational first integrals for a well-known virus system. In the proofs, we use the weight-homogeneous polynomials and the method of characteristic curves for solving linear partial differential equations.
A Photographic Assignment for Abstract Algebra
ERIC Educational Resources Information Center
Warrington, Gregory S.
2009-01-01
We describe a simple photographic assignment appropriate for an abstract algebra (or other) course. Students take digital pictures around campus of various examples of symmetry. They then classify these pictures according to which of the 17 plane symmetry groups they belong. (Contains 2 figures.)
Hungry for Early Spatial and Algebraic Reasoning
ERIC Educational Resources Information Center
Cross, Dionne I.; Adefope, Olufunke; Lee, Mi Yeon; Perez, Arnulfo
2012-01-01
Tasks that develop spatial and algebraic reasoning are crucial for learning and applying advanced mathematical ideas. In this article, the authors describe how two early childhood teachers used stories as the basis for a unit that supports spatial reasoning in kindergartners and first graders. Having mathematical experiences that go beyond…
Connecting Functions in Geometry and Algebra
ERIC Educational Resources Information Center
Steketee, Scott; Scher, Daniel
2016-01-01
One goal of a mathematics education is that students make significant connections among different branches of mathematics. Connections--such as those between arithmetic and algebra, between two-dimensional and three-dimensional geometry, between compass-and-straight-edge constructions and transformations, and between calculus and analytic…
Lie algebras and linear differential equations.
NASA Technical Reports Server (NTRS)
Brockett, R. W.; Rahimi, A.
1972-01-01
Certain symmetry properties possessed by the solutions of linear differential equations are examined. For this purpose, some basic ideas from the theory of finite dimensional linear systems are used together with the work of Wei and Norman on the use of Lie algebraic methods in differential equation theory.
Generalizing: The Core of Algebraic Thinking
ERIC Educational Resources Information Center
Kinach, Barbara M.
2014-01-01
Generalizing--along with conjecturing, representing, justifying, and refuting--are forms of mathematical reasoning important in all branches of mathematics (Lannin, Ellis, and Elliott 2011). Increasingly, however, generalizing is recognized as the essence of thinking in algebra (Mason, Graham, and Johnston-Wilder 2010; Kaput, Carraher, and Blanton…
Modern Geometric Algebra: A (Very Incomplete!) Survey
ERIC Educational Resources Information Center
Suzuki, Jeff
2009-01-01
Geometric algebra is based on two simple ideas. First, the area of a rectangle is equal to the product of the lengths of its sides. Second, if a figure is broken apart into several pieces, the sum of the areas of the pieces equals the area of the original figure. Remarkably, these two ideas provide an elegant way to introduce, connect, and…
A Linear Algebraic Approach to Teaching Interpolation
ERIC Educational Resources Information Center
Tassa, Tamir
2007-01-01
A novel approach for teaching interpolation in the introductory course in numerical analysis is presented. The interpolation problem is viewed as a problem in linear algebra, whence the various forms of interpolating polynomial are seen as different choices of a basis to the subspace of polynomials of the corresponding degree. This approach…
Euler and the Fundamental Theorem of Algebra.
ERIC Educational Resources Information Center
Duham, William
1991-01-01
The complexity of the proof of the Fundamental Theorem of Algebra makes it inaccessible to lower level students. Described are more understandable attempts of proving the theorem and a historical account of Euler's efforts that relates the progression of the mathematical process used and indicates some of the pitfalls encountered. (MDH)
Algebra II. Mathematics Curriculum Guide (Career Oriented).
ERIC Educational Resources Information Center
Ohmer, Merlin M.; And Others
The curriculum guide for Albegra 2 correlates algebraic concepts with career-oriented concepts and activities. The curriculum outline format gives the concepts to be taught, matched with related career-oriented performance objectives, concepts, and suggested instructional activities in facing page layouts. The suggested curriculum outline is…
A Concurrent Support Course for Intermediate Algebra
ERIC Educational Resources Information Center
Cooper, Cameron I.
2011-01-01
This article summarizes the creation and implementation of a concurrent support class for TRS 92--Intermediate Algebra, a developmental mathematics course at Fort Lewis College in Durango, Colorado. The concurrent course outlined in this article demonstrates a statistically significant increase in student success rates since its inception.…
Using Group Explorer in Teaching Abstract Algebra
ERIC Educational Resources Information Center
Schubert, Claus; Gfeller, Mary; Donohue, Christopher
2013-01-01
This study explores the use of Group Explorer in an undergraduate mathematics course in abstract algebra. The visual nature of Group Explorer in representing concepts in group theory is an attractive incentive to use this software in the classroom. However, little is known about students' perceptions on this technology in learning concepts in…
Journal Writing: Enlivening Elementary Linear Algebra.
ERIC Educational Resources Information Center
Meel, David E.
1999-01-01
Examines the various issues surrounding the implementation of journal writing in an undergraduate linear algebra course. Identifies the benefits of incorporating journal writing into an undergraduate mathematics course, which are supported with students' comments from their journals and their reflections on the process. Contains 14 references.…
D-algebra structure of topological insulators
NASA Astrophysics Data System (ADS)
Estienne, B.; Regnault, N.; Bernevig, B. A.
2012-12-01
In the quantum Hall effect, the density operators at different wave vectors generally do not commute and give rise to the Girvin-MacDonald-Plazmann (GMP) algebra, with important consequences such as ground-state center-of-mass degeneracy at fractional filling fraction, and W1+∞ symmetry of the filled Landau levels. We show that the natural generalization of the GMP algebra to higher-dimensional topological insulators involves the concept of a D commutator. For insulators in even-dimensional space, the D commutator is isotropic and closes, and its structure factors are proportional to the D/2 Chern number. In odd dimensions, the algebra is not isotropic, contains the weak topological insulator index (layers of the topological insulator in one fewer dimension), and does not contain the Chern-Simons θ form. This algebraic structure paves the way towards the identification of fractional topological insulators through the counting of their excitations. The possible relation to D-dimensional volume-preserving diffeomorphisms and parallel transport of extended objects is also discussed.
Some Unexpected Results Using Computer Algebra Systems.
ERIC Educational Resources Information Center
Alonso, Felix; Garcia, Alfonsa; Garcia, Francisco; Hoya, Sara; Rodriguez, Gerardo; de la Villa, Agustin
2001-01-01
Shows how teachers can often use unexpected outputs from Computer Algebra Systems (CAS) to reinforce concepts and to show students the importance of thinking about how they use the software and reflecting on their results. Presents different examples where DERIVE, MAPLE, or Mathematica does not work as expected and suggests how to use them as a…
Digital Maps, Matrices and Computer Algebra
ERIC Educational Resources Information Center
Knight, D. G.
2005-01-01
The way in which computer algebra systems, such as Maple, have made the study of complex problems accessible to undergraduate mathematicians with modest computational skills is illustrated by some large matrix calculations, which arise from representing the Earth's surface by digital elevation models. Such problems are often considered to lie in…
A Visual Approach to Algebra Concepts.
ERIC Educational Resources Information Center
Morelli, Lynn
1992-01-01
Presents activities to visually explore the algebraic concepts of variable, constant, the distributive property, and combining like terms. Presents four transparencies that use visual models to understand exercises in students perform the same mental calculations on a number of their choice and obtain the same result. (MDH)
Gilkey, A.P.
1988-08-01
The ALGEBRA program allows the user to manipulate data from a finite element analysis before it is plotted. The finite element output data is in the form of variable values (e.g., stress, strain, and velocity components) in an EXODUS database. The ALGEBRA program evaluates user-supplied functions of the data and writes the results to an output EXODUS database which can be read by plot programs. 8 refs.
The Krichever map, vector bundles over algebraic curves, and Heisenberg algebras
NASA Astrophysics Data System (ADS)
Adams, M. R.; Bergvelt, M. J.
1993-06-01
We study the Grassmannian Gr {/x n } consisting of equivalence classes of rank n algebraic vector bundles over a Riemann surface X with an holomorphic trivialization at a fixed point p. Commutative subalgebras of gl(n, H λ), H λ being the ring of functions holomorphic on a punctured disc about p, define flows on the Grassmannian, giving rise to classes of solutions to multi-component KP hierarchies. These commutative subalgebras correspond to Heisenberg algebras in the Kac-Moody algebra associated to gl(n, H λ). One can obtain, by the Krichever map, points of Gr {/x n } (and solutions of mcKP) from coverings f: Y→X and other geometric data. Conversely for every point of Gr {/x n } and for every choice of Heisenberg algebra we construct, using the cotangent bundle of Gr {/x n }, an algebraic curve covering X and other data, thus inverting the Krichever map. We show the explicit relation between the choice of Heisenberg algebra and the geometry of the covering space.
On vertex algebra representations of the Schrödinger-Virasoro Lie algebra
NASA Astrophysics Data System (ADS)
Unterberger, Jérémie
2009-12-01
The Schrödinger-Virasoro Lie algebra sv is an extension of the Virasoro Lie algebra by a nilpotent Lie algebra formed with a bosonic current of weight 3/2 and a bosonic current of weight 1. It is also a natural infinite-dimensional extension of the Schrödinger Lie algebra, which — leaving aside the invariance under time-translation — has been proved to be a symmetry algebra for many statistical physics models undergoing a dynamics with dynamical exponent z=2. We define in this article general Schrödinger-Virasoro primary fields by analogy with conformal field theory, characterized by a 'spin' index and a (non-relativistic) mass, and construct vertex algebra representations of sv out of a charged symplectic boson and a free boson and its associated vertex operators. We also compute two- and three-point functions of still conjectural massive fields that are defined by an analytic continuation with respect to a formal parameter.
Relation of deformed nonlinear algebras with linear ones
NASA Astrophysics Data System (ADS)
Nowicki, A.; Tkachuk, V. M.
2014-01-01
The relation between nonlinear algebras and linear ones is established. For a one-dimensional nonlinear deformed Heisenberg algebra with two operators we find the function of deformation for which this nonlinear algebra can be transformed to a linear one with three operators. We also establish the relation between the Lie algebra of total angular momentum and corresponding nonlinear one. This relation gives a possibility to simplify and to solve the eigenvalue problem for the Hamiltonian in a nonlinear case using the reduction of this problem to the case of linear algebra. It is demonstrated in an example of a harmonic oscillator.
Differential geometry on Hopf algebras and quantum groups
Watts, P.
1994-12-15
The differential geometry on a Hopf algebra is constructed, by using the basic axioms of Hopf algebras and noncommutative differential geometry. The space of generalized derivations on a Hopf algebra of functions is presented via the smash product, and used to define and discuss quantum Lie algebras and their properties. The Cartan calculus of the exterior derivative, Lie derivative, and inner derivation is found for both the universal and general differential calculi of an arbitrary Hopf algebra, and, by restricting to the quasitriangular case and using the numerical R-matrix formalism, the aforementioned structures for quantum groups are determined.
Extending Fourier transformations to Hamilton's quaternions and Clifford's geometric algebras
NASA Astrophysics Data System (ADS)
Hitzer, Eckhard
2013-10-01
We show how Fourier transformations can be extended to Hamilton's algebra of quaternions. This was initially motivated by applications in nuclear magnetic resonance and electric engineering. Followed by an ever wider range of applications in color image and signal processing. Hamilton's algebra of quaternions is only one example of the larger class of Clifford's geometric algebras, complete algebras encoding a vector space and all its subspace elements. We introduce how Fourier transformations are extended to Clifford algebras and applied in electromagnetism, and in the processing of images, color images, vector field and climate data.